Changes between Version 151 and Version 152 of LibrariesUnderConstruction
- Timestamp:
- Aug 21, 2011, 3:09:53 PM (11 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
LibrariesUnderConstruction
v151 v152 23 23 * '''Categories:''' [#Memory Memory] 24 24 * '''Description:'''Allocators optimizations 25 26 --------------------------------------------------------------------------------------------------- 27 == Boost.Assign.V2 == 28 * '''Author(s):''' Ottosen Thorsten, Erwann Rogard 29 * '''Version:''' 2.0 30 * '''State:''' On going 31 * '''Last upload:''' 2011 Jan 28 32 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/assign_v2 Boost Sandbox] 33 * '''Categories:''' [#Containers Containers] 34 * '''Description:''' This library has grown out of Boost.Assign 1.0 but is functionally independent of it. It provides a small set of tools for carrying out operations that can be characterized as either putting a set of values in a container, in simple or complex ways, or manipulating references through a range-like interface. These are referred to as the put and ref frameworks, respectively. Each allows to code in one sweep, what would ordinarily require repetitive statements, and integrates nicely with range algorithms. Utilities bridging the above with other container or range functionality are provided. The library is open for extension with the help of macros. 25 35 26 36 --------------------------------------------------------------------------------------------------- … … 147 157 148 158 --------------------------------------------------------------------------------------------------- 159 == Boost.!BigNumbers == 160 161 * '''Author(s):''' John Maddock 162 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/big_number Boost Sandbox] 163 * '''Categories:''' [#MathAndNumerics Math And Numerics] 164 * '''Description:''' The Big Number library comes in two distinct parts: an expression template enabled front end big_number that handles all the operator overloading, expression evaluation optimization, and code reduction, and a selection of backends that implement the actual arithmetic operations, and need conform only to the reduced interface requirements of the front end. 165 166 --------------------------------------------------------------------------------------------------- 149 167 == Boost.Bitfield == 150 168 * '''Author(s):''' Emile Cormier, Vicente J. Botet Escribá … … 171 189 }}} 172 190 173 174 175 191 --------------------------------------------------------------------------------------------------- 176 192 == Boost.!BloomFilters == 177 * '''Author(s):''' Dean Michael Berris 193 * '''Author(s):''' Dean Michael Berris, Alejandro Cabrera 178 194 * '''Version:''' 0.1 179 195 * '''State:''' On going … … 289 305 290 306 --------------------------------------------------------------------------------------------------- 291 == Boost.Co nstrue ==307 == Boost.Coerce == 292 308 293 309 * '''Author(s):''' Jeroen Habraken … … 295 311 * '''State:''' On going 296 312 * '''Last upload:''' 2010 October 07 297 * '''Links:''' [http:// github.com/VeXocide/construe_cast Repository]298 * '''Categories:''' [#Utilities Utilities] 313 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/coerce Boost Sandbox] 314 * '''Categories:''' [#Utilities Utilities] [#StringAndTextProcessing String And Text Processing] 299 315 * '''Description:''' Builds upon boost.spirit to create a cast-like operator aiming to 300 316 provide an alternative to lexical_cast providing greater speed and … … 418 434 419 435 --------------------------------------------------------------------------------------------------- 436 == Boost.E.Float == 437 438 * '''Author(s):''' Christopher Kormanyos 439 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/e_float Boost Sandbox] 440 * '''Categories:''' [#MathAndNumerics Math And Numerics] 441 * '''Description:''' There are many multiple precision (MP) packages available to the scientific and engineering community. Each package has individual strengths within its range of application. However, most MP packages lack a uniform interface for high precision algorithm design. They also offer little or no special function support. Also, many MP packages have limited portability. There is no portable standalone C++ system which offers a wide variety of high precision special functions and handles large function parameters. 442 The e float system not only addresses these weaknesses but also significantly advances MP technology. It uses several MP packages and provides a uniform C++ interface for high precision algorithm design, independent of the underlying MP implementation. In addition, e float supports a large collection of high performance MP functions which are entirely portable, solidly designed and can be used with any suitably prepared MP type. Furthermore, the e float system provides software interfaces for seamless interoperability with other high level languages. 443 444 445 --------------------------------------------------------------------------------------------------- 420 446 == Boost.Endian == 421 447 * '''Author(s):''' Tomas Puverle … … 424 450 * '''Last upload:'''2010 May 26 425 451 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=endian-puverle.zip&directory=Utilities&PHPSESSID=2d7859f3e812c993f5a9e2d9900dfee8 Download] 426 * '''Categories:''' [#Portability Portability] 452 * '''Categories:''' [#Portability Portability] [#MathAndNumerics Math And Numerics] 427 453 * '''Description:''' The highlights of the library are the following: 428 454 * Very simple interface: swap<machine_to_little/big>(), swap_in_place<machine_to_little/big>() … … 493 519 * '''State:''' Ongoing 494 520 * '''Last upload:''' 495 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/hash/ sandbox] [http://www.cs.mcgill.ca/~smcmur/hash/ docs]521 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/hash/ Sandbox] [http://www.cs.mcgill.ca/~smcmur/hash/ docs] 496 522 * '''Categories:''' [#Algorithm Algorithm] 497 523 * '''Description:''' Concepts for general hashing, with generic implementations of cryptographic hashes (like MD5 and SHA-384) and checksums (like Adler).