add the ability to specify the address of a native function as a finalizer
the advantage of this is that we know no julia code runs, so it is safe to
free the underlying object immediately, rather than waiting for another GC
cycle to be sure no references to the object were added.

this is specifically designed for BigInt and BigFloat, which get faster and
use less memory with this change (helps #4169)
Merge branch 'master' of github.com:JuliaLang/julia into jb/nativefinalizers
conv and conv2
added permutedims!

Separated the permutedims method into a permutedims! method which
stores the permutation a given array into a specified destination, and
the wrapper permutedims which reproduces the original functionality by
creating the required destination storage and then calling permutedims!
on it.
Further changes to permutedims and tests

With this commit, all tests pass. I changed the permutedims tests to
have permutations specified by vectors instead of tuples (which is also
how it is stated in the manual). I also had to make two seperate
versions of permutedims!: when B is a BitArray, P has to be a BitArray,
whereas for B a StridedArray, P should be an Array. I don’t think it is
possible to obtain this behavior in a single parametric definition.
FixedSetPartitions

Functionality for iterating over the partitions of a set into a fixed
number of subsets. partitions(array,m) relates to partitions(array)
like partitions(n,m) relates to partitions(n).
fixed typo in description in manual
Replaced tabs with spaces
Removed type annotation of argument in isperm

As requested
Some work to make libjulia compilable on windows using the Intel compiler
Revert the wrong uv_errno_t changes
Use alloca where VLAs where originally used
Fix DLLEXPORT macro on windows so that the default is import
moved inttype.h include below platform.h include
add WINAPI again
add BitsFloat abstract type, leverage dispatch for rounding modes
Project Euler: decent basic functionality tests & fun to write.

This seems like a pretty good way to get better test coverage of
miscellaneous functionality, especially of the mathematical kind.
That's how I discovered digits didn't work for BigInts yesterday:
the test introduced was actually problem 16.
Projet Euler 5: lcm(1:20) == 232792560

It's handy to be able to take the gcd/lcm of a collection of integers.
Also, code golf in your own language feels a bit cheap.
Project Euler 6-11.
gcd, lcm on collection: use reduce instead of splatting.