be a bit more permissive about allowed method name expressions.
fixes #2984
more MPFR special functions
Merge pull request #3012 from stevengj/bigfloat_funcs

RFC: more BigFloat special functions
define exp2 and exp10 for Complex
use try-finally in with_bigfloat_*
Merge pull request #3013 from stevengj/master

define exp2 and exp10 for Complex
Fixed bug in tests for poll_fd and file watcher
Merge pull request #3017 from amitmurthy/amitm

Fixed bug in tests for poll_fd and file watcher
more correct and reliable wine PATH implementation
add a wine_pathsearch Makefile function that improves generality of windows 64 cross-make dist target
fix #3010
typo fix MPRF -> MPFR
Merge pull request #2989 from staticfloat/master

Fix markdown link syntax
base/primes.jl: faster primes(n) and isprime(n) functions.

Sieve of Atkin for generating primes:

	http://en.wikipedia.org/wiki/Sieve_of_Atkin

Code very loosely based on this:

	http://thomasinterestingblog.wordpress.com/2011/11/30/generating-primes-with-the-sieve-of-atkin-in-c/
	http://dl.dropboxusercontent.com/u/29023244/atkin.cpp

Miller-Rabin for primality testing:

	http://en.wikipedia.org/wiki/Miller–Rabin_primality_test
isprime(n): better witness choices for various n.

http://mathoverflow.net/questions/101922/smallest-collection-of-bases-for-prime-testing-of-64-bit-numbers
http://primes.utm.edu/prove/merged.html
http://miller-rabin.appspot.com
add eltype, last, and pop! for IntSet
a few other intset-related fixes and doc updates
add some IntSet tests
fix smallint -> BigInt conversions, especially BigInt(Int128)
fix #3032, bug in immutable constructor with too few args
factor: don't generate as many primes when doing trial division.
primes: implement and test prime stuff for BigInts [closes #3033]

It is not recommended to use this code to factor large integers. The
primality testing for BigInts calls GMP, so should be pretty good.