Boost C++ Library

Boost C++ Library

  1. Accumulators
  2. Algorithm
  3. Align
  4. Any
  5. Array
  6. Asio
  7. Assert
  8. Assign
  9. Atomic
  10. Bimap
  11. Bind
  12. Call Traits
  13. Chrono
  14. Circular Buffer
  15. Compatibility
  16. Compressed Pair
  17. Concept Check
  18. Config
  19. Container
  20. Context
  21. Conversion
  22. Core
  23. Coroutine
  24. CRC
  25. Date Time
  26. Dynamic Bitset
  27. Enable If
  28. Exception
  29. Filesystem
  30. Flyweight
  31. Foreach
  32. Format
  33. Function
  34. Function Types
  35. Functional
  36. Functional/Factory
  37. Functional/Forward
  38. Functional/Hash
  39. Functional/Overloaded Function
  40. Fusion
  41. Geometry
  42. GIL
  43. Graph
  44. Heap
  45. ICL
  46. Identity Type
  47. In Place Factory, Typed In Place Factory
  48. Integer
  49. Interprocess
  50. Interval
  51. Intrusive
  52. IO State Savers
  53. Iostreams
  54. Iterator
  55. Lambda
  56. Lexical Cast
  57. Local Function
  58. Locale
  59. Lockfree
  60. Log
  61. Math
  62. Math Common Factor
  63. Math Octonion
  64. Math Quaternion
  65. Math/Special Functions
  66. Math/Statistical Distributions
  67. Member Function
  68. Meta State Machine
  69. Min-Max
  70. Move
  71. MPI
  72. MPL
  73. Multi-Array
  74. Multi-Index
  75. Multiprecision
  76. Numeric Conversion
  77. Odeint
  78. Operators
  79. Optional
  80. Parameter
  81. Phoenix
  82. Pointer Container
  83. Polygon
  84. Pool
  85. Predef
  86. Preprocessor
  87. Program Options
  88. Property Map
  89. Property Tree
  90. Proto
  91. Python
  92. Random
  93. Range
  94. Ratio
  95. Rational
  96. Ref
  97. Regex
  98. Result Of
  99. Scope Exit
  100. Serialization
  101. Signals
  102. Signals2
  103. Smart Ptr
  104. Spirit
  105. Statechart
  106. Static Assert
  107. String Algo
  108. Swap
  109. System
  110. Test
  111. Thread
  112. ThrowException
  113. Timer
  114. Tokenizer
  115. TR1
  116. TTI
  117. Tuple
  118. Type Erasure
  119. Type Index
  120. Type Traits
  121. Typeof
  122. uBLAS
  123. Units
  124. Unordered
  125. Utility
  126. Uuid
  127. Value Initialized
  128. Variant
  129. Wave
  130. Xpressive
Advertisements

amcharts.com: JavaScript Charts and Maps

amcharts.com: JavaScript Charts and Maps

amCharts is an advanced charting library that will suit any data visualization need. Our charting solution include Column, Bar, Line, Area, Step, Step without risers, Smoothed line, Candlestick, OHLC, Pie/Donut, Radar/ Polar, XY/Scatter/Bubble, Bullet, Funnel/Pyramid charts as well as Gauges. Read More Our charts is a completely standalone and independent library, which doesn’t require any 3rd party includes. You can download, try and even use our charts for free. Check chart demos to see all the charts in action.

FLINT: Fast Library for Number Theory

FLINT: Fast Library for Number Theory
FLINT is a C library for doing number theory, maintained by William Hart. FLINT is licensed GPL v2+. FLINT supports arithmetic with numbers, polynomials, power series and matrices over many base rings, including: Multiprecision integers and rationals Integers modulo n p-adic numbers Finite fields (prime and non-prime order) Real and complex numbers (via the Arb extension library) Support is also currently being developed for algebraic number fields (via the Antic extension library). Operations that can be performed include conversions, arithmetic, computing GCDs, factoring, solving linear systems, and evaluating special functions. In addition, FLINT provides various low-level routines for fast arithmetic. FLINT is extensively documented and tested.

www.musl-libc.org: musl libc

www.musl-libc.org: musl libc
musl provides consistent quality and implementation behavior from tiny embedded systems to full-fledged servers. Minimal machine-specific code means less chance of breakage on minority architectures and better success with “write once run everywhere” C development. musl’s efficiency is unparalleled in Linux libc implementations. Designed from the ground up for static linking, musl carefully avoids pulling in large amounts of code or data that the application will not use. Dynamic linking is also efficient; by integrating the entire standard library implementation, including threads, math, and even the dynamic linker itself into a single shared object, most of the startup time and memory overhead of dynamic linking have been eliminated. musl features the first post-NPTL implementation of POSIX threads for Linux, and the first aimed at complete conformance and robustness. Thread cancellation has been re-designed to avoid serious race conditions in the original NPTL design. As for effic

PARI/GP Development Headquarters: computer algebra system designed for fast computations in number theory

PARI/GP Development Headquarters: computer algebra system designed for fast computations in number theory
PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorizations, algebraic number theory, elliptic curves…), but also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers etc., and a lot of transcendental functions. PARI is also available as a C library to allow for faster computations. Originally developed by Henri Cohen and his co-workers (Université Bordeaux I, France), PARI is now under the GPL and maintained by Karim Belabas with the help of many volunteer contributors. PARI is a C library, allowing fast computations. gp is an easy-to-use interactive shell giving access to the PARI functions. GP is the name of gp’s scripting language. gp2c, the GP-to-C compiler, combines the best of both worlds by compiling GP scripts to the C language and transparently loading the resulting functions into gp. (gp2c-compiled scripts will typically r

JSTOR: JSTOR is a not-for-profit, founded to help academic libraries and publishers.

JSTOR: JSTOR is a not-for-profit, founded to help academic libraries and publishers.
JSTOR is a not-for-profit, founded to help academic libraries and publishers. JSTOR is a shared digital library created in 1995 to help university and college libraries to free space on their shelves, save costs, and provide greater levels of access to more content than ever before. More generally, by digitizing content to high standards and supporting its long-term preservation, we also aim to help libraries and publishers of scholarly content transition their collections and publishing activities from print to digital operations. Our aim is to expand access to scholarly content around the world and to preserve it for future generations. We provide access to some or all of the content free-of-charge when we believe we can do so and still meet our long-term obligations. JSTOR currently includes more than 2,000 academic journals, dating back to the first volume ever published, along with thousands of monographs and other materials relevant for education. We have digitized more than 50