| 211 | |
| 212 | --------------------------------------------------------------------------------------------------- |
| 213 | == Boost.Creasing == |
| 214 | * '''Author(s):''' Grant Erickson |
| 215 | * '''Version:''' |
| 216 | * '''State:''' |
| 217 | * '''Last upload:''' |
| 218 | * '''Inclusion date:''' ??? |
| 219 | * '''Depends on:''' |
| 220 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 221 | * Missing criteria |
| 222 | * C1 |
| 223 | * '''Pre-reviewed by :''' ??? '''people''' |
| 224 | * '''Review Manager:''' Needed |
| 225 | * '''Expected review date:''' ??? |
| 226 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=creasing.zip&directory=Algorithms Boost Vault] |
| 227 | * '''Categories:''' [#Algorithms Algorithms] |
| 228 | * '''Description:''' |
| 229 | |
| 279 | == Boost.LA== |
| 280 | * '''Author(s):''' Emil Dotchevski |
| 281 | * '''Version:''' |
| 282 | * '''State:''' |
| 283 | * '''Last upload:''' |
| 284 | * '''Inclusion date:''' ??? |
| 285 | * '''Depends on:''' |
| 286 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 287 | * Missing criteria |
| 288 | * C1 |
| 289 | * '''Pre-reviewed by :''' ??? '''people''' |
| 290 | * '''Review Manager:''' Needed |
| 291 | * '''Expected review date:''' ??? |
| 292 | * '''Links:''' [http://www.revergestudios.com/boost-la Web Page] |
| 293 | * '''Categories:''' [#MathAndNumerics Math And Numerics] |
| 294 | * '''Description:''' Boost LA provides a set of generic linear algebra algorithms, primarily for working with vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the vector_traits and matrix_traits templates. |
| 295 | |
| 296 | |
| 297 | --------------------------------------------------------------------------------------------------- |
| 298 | == Boost.Locale== |
| 299 | * '''Author(s):''' Artyom Beilis |
| 300 | * '''Version:''' |
| 301 | * '''State:''' |
| 302 | * '''Last upload:''' |
| 303 | * '''Inclusion date:''' ??? |
| 304 | * '''Depends on:''' |
| 305 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 306 | * Missing criteria |
| 307 | * C1 |
| 308 | * '''Pre-reviewed by :''' ??? '''people''' |
| 309 | * '''Review Manager:''' Needed |
| 310 | * '''Expected review date:''' ??? |
| 311 | * '''Links:''' [https://sourceforge.net/projects/cppcms/files/boost_locale/boost_locale_for_review.zip/download Download] |
| 312 | * '''Categories:''' [#StringAndTextProcessing String And Text Processing] |
| 313 | * '''Description:''' Boost.Locale is a library that brings high quality localization facilities in C++ way. |
| 314 | It uses std::locale, and std::locale facets in order to provide localization in transparent and |
| 315 | C++ aware way to user.. |
| 316 | |
| 317 | |
| 318 | --------------------------------------------------------------------------------------------------- |
| 353 | |
| 354 | --------------------------------------------------------------------------------------------------- |
| 355 | == Boost.XInt == |
| 356 | * '''Author(s):''' Chad Nelson |
| 357 | * '''Version:''' 0.6 |
| 358 | * '''State:''' |
| 359 | * '''Last upload:''' 2010, Jun 19 |
| 360 | * '''Inclusion date:''' ??? |
| 361 | * '''Depends on:''' |
| 362 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 363 | * Missing criteria |
| 364 | * C1 |
| 365 | * '''Pre-reviewed by :''' ??? '''people''' |
| 366 | * '''Review Manager:''' Needed |
| 367 | * '''Expected review date:''' ??? |
| 368 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/xint Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/xint/libs/xint/index.html Boost Documentation] |
| 369 | * '''Categories:''' [#MathAndNumerics Math And Numerics] |
| 370 | * '''Description:''' It's a C++ library that lets your program handle much, much larger integer numbers than the built-in int, long, or even long long types, and handle them using the same syntax that C and C++ use for the built-in integer types. |
| 371 | |
| 372 | The maximum size of the integer is limited only by the memory available to store it. In practice that's millions of hexadecimal digits, so it's effectively infinite. |