Fix minor typo in comment: thans => than
Merge pull request #72 from adampingel/2.10.0

fixing link to mailing list
Merge pull request #69 from clhodapp/patch-1

Fix minor typo in comment: thans => than
Make cfor more hygenic using symbols.

This fixes bug #71, where symbol collisions would cause incorrect
inlining. Thanks to Olivier Chafik for noticing the problem and
supply most of the fix.

Fixes #71
SeqOps maintains colletion types for ops.

This comes at the cost of specialization, due to some weird bug.
Clean-up of SeqOps required implicits.
remove Trig[A]'s requirement on Fractional[A]
More progress on pluggable PRNG API.

At this point, other than hardcoded functions like nextInt, Generator
provides a next[A] method, using the Next[A] type class to allow
pluggable generation of A.

The basic idea is that users can provide Next[A] implementations that
given a Generator instance can return an A instance. In practice this
looks something like:

  import spire.math._
  import spire.random._

  // set up a Generator instance
  val rng: Generator = WellPrng()

  // identical to g.nextDouble, using Next[Double]
  val d: Double = rng.next[Double]

  // produces Next[Complex[Double]] given Next[Double]
  // resulting complex numbers have real and imaginary
  // parts in [0.0, 1.0).
  val c: Complex[Double] = rng.next[Complex[Double]]

  // sets up an implicit Next[BigInt] instance which
  // will generate BigInts using 64 random bytes.
  implicit val nextBigInt = Next.bigint(64)

  val b: BigInt = rng.next[BigInt]
Major additions/changes to spire.random.Generator &co.

This commit adds:

  * some new RNGs from Rex Kerr
  * (optional) synchronous generators
  * better support for seeds, initialization
  * gaussian wrapper to generate values in normal distributions
  * basic RNG benchmarks
  * basic RNG tests
  * other miscellaneous changes and fixes
uncomment and expand benchmarks; fix test
Add a brief RNG descriptiong
Merge remote-tracking branch 'tixxit/topic/seqops-ret-type' into 2.10.0
small typo, updated version
Merge pull request #77 from emchristiansen/2.10.0

small typo, updated version
Add cfor benchmarks that update an array.

This checkin adds a set of basic benchmarks that updates each element
in an array after multiplying the previous value by 2.

This benchmark was added to replicate an external spire benchmark in
which cfor seemed to be slower than while.  The benchmark results,
however, vary enough to be inconclusive at this point.  For example,
in the case where n = 1m (as in this benchmark), the 'while' case
on my machine varies between 3-4.5ms and the tailrec & cfor benchmarks
vary between 4-6 ms.
rename spire.random.Util to Pack
Move cfor to a while-loop instead of tailrec
Improve cfor's handling of non-literal function arguments.

This commit supports two styles of cfor:

1. "clean" where arguments are Function or Ident trees
(i.e. literal functions or references to previously-bound functions).

2. "dirty" where arguments must be rebound to vals
(e.g. for expressions return functions).

This fixes #75. Thanks to Olivier Chafik for catching this!
add some comments and clean up cfor
Fix cfor compiler crashes.

This commit improves the names that cfor uses, which were previously
causing a crash during later compiler phases.

Thanks to Olivier Chafik for spotting this!

Fixes #74.