with_output_color now does all its output at once (via a buffer), to avoid async mixups; fixes #6609 and JuliaLang/IJulia.jl#106
update perf since randmtzig.c is no longer in julia src
Merge pull request #6616 from aviks/as/javaperf

update perf since randmtzig.c is no longer in julia src
Fix a type inference issue

For FooBar{s}.parameters[1] where s is a symbol, type inference deduced the
type to be Type{:x}. Unfortunately, this doesn't actually work because Type{:x}
may be widened to Type at any time at which point it becomes incorrect.
Convert in setindex! for SparseMatrixCSC
Enable running java perf via Makefile
Merge pull request #6622 from aviks/as/javaperf

Enable running java perf via Makefile Fix #6317
Use [ instead of [[ in jldownload

Closes #6615
Merge pull request #6612 from stevengj/atomic_color

with_output_color now does all its output at once (via a buffer)
alternative fix to #6623
remove 0-arg definitions of operators

give an error for reduce() on empty collections. calling op() in this
case is not too helpful, and wasn't even documented.

closes #6554
WIP: new approach to efficiently hashing 1, 1.0, big(1), the same.

The major change is that numeric values that are mathematically
equal hash the same. This is tricky to do in a way that allows the
hashing of Int64, Float64, Uint64 and such common numeric types to
all be fast – nearly as fast as just applying the core hash to them
as raw bits.

Although tests pass, this is an inherently half-baked state since
isequal and hash are now badly out of sync. Many decisions still
need to be made about how to hash collections: does the collection
type matter or just the element type of the collection? Or neither?

This also does away with the bitmix function, instead favoring a
Merkle-Damgård style of combining arbitrary amounts of data into a
single, fixed-size hash value output. In a sense the hash function
with two arguments replaces the bitmix function – you can give the
result of hashing previous values as the second argument to hash
and the result will depend on both in a difficult-to-predict way.
decompose: fix documentation of decompose for rational hashing.
define hash(x) = hash(x, zero(Uint)) in a single place; fix bugs.
MathConst: == and hash