libtnt 1.2.6-1 source package in Ubuntu


libtnt (1.2.6-1) unstable; urgency=low

  * New upstream release.

 -- Ubuntu Archive Auto-Sync <email address hidden>   Thu,  15 Jun 2006 14:52:06 +0100

Upload details

Uploaded by:
Ubuntu Archive Auto-Sync on 2006-06-15
Uploaded to:
Original maintainer:
Juan Esteban Monsalve Tobon
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release on 2019-10-18 universe math
Eoan release on 2019-04-18 universe math
Disco release on 2018-10-30 universe math
Cosmic release on 2018-05-01 universe math
Bionic release on 2017-10-24 universe math
Artful release on 2017-04-20 universe math
Xenial release on 2015-10-22 universe math
Trusty release on 2013-10-18 universe math
Precise release on 2011-10-13 universe math


Edgy: [FULLYBUILT] i386


File Size SHA-256 Checksum
libtnt_1.2.6.orig.tar.gz 51.1 KiB 016851ba0e263d160f42e81317ac5c9a1de4b93cc6b952c9c680857e01f4cddb
libtnt_1.2.6-1.diff.gz 8.8 KiB a520ad5376ae4bcfcdedb6c9ac34502d705a42058aebc7b71c4057d21a1ea7e0
libtnt_1.2.6-1.dsc 536 bytes de2dceed5bb00b050a02907857597fcaf5da70ddd0fc412fb42a6b3e8bc36045

View changes file

Binary packages built by this source

libtnt-dev: interface for scientific computing in C++

 The Template Numerical Toolkit (TNT) is a collection of interfaces and
 reference implementations of numerical objects useful for scientific
 computing in C++. The toolkit defines interfaces for basic data
 structures, such as multidimensional arrays and sparse matrices,
 commonly used in numerical applications. The goal of this package is to
 provide reusable software components that address many of the portability
 and maintenance problems with C++ codes.
 TNT provides a distinction between interfaces and implementations of TNT
 components. For example, there is a TNT interface for two-dimensional
 arrays which describes how individual elements are accessed and how
 certain information, such as the array dimensions, can be used in
 algorithms; however, there can be several implementations of such an
 interface: one that uses expression templates, or one that uses BLAS
 kernels, or another that is instrumented to provide debugging information.
 By specifying only the interface, applications codes may utilize such
 algorithms, while giving library developers the greatest flexibility in
 employing optimization or portability strategies.