From adab223837ae29d0355cb0b291c62c3a80feb017 Mon Sep 17 00:00:00 2001
From: Rainer  Schuetze <r.sagitario@gmx.de>
Date: Sun, 17 May 2015 21:54:33 +0200
Subject: [PATCH] remove trailing whitespace, detab, tolf

---
 etc/c/zlib/linux.mak              | 190 ++++++++++++-------------
 etc/c/zlib/osx.mak                | 190 ++++++++++++-------------
 etc/c/zlib/win32.mak              | 192 ++++++++++++-------------
 etc/c/zlib/win64.mak              | 202 +++++++++++++--------------
 std/functional.d                  |   2 +-
 std/internal/math/gammafunction.d |   4 +-
 std/math.d                        |  18 +--
 std/mathspecial.d                 |   6 +-
 std/numeric.d                     |   4 +-
 std/typecons.d                    | 224 +++++++++++++++---------------
 std/variant.d                     |   2 +-
 11 files changed, 517 insertions(+), 517 deletions(-)

diff --git a/etc/c/zlib/linux.mak b/etc/c/zlib/linux.mak
index 6faafaa18..604f70027 100644
--- a/etc/c/zlib/linux.mak
+++ b/etc/c/zlib/linux.mak
@@ -1,95 +1,95 @@
-# Makefile for zlib
-
-MODEL=32
-CC=gcc
-LD=link
-CFLAGS=-O -m$(MODEL)
-LDFLAGS=
-O=.o
-
-.c.o:
-	$(CC) -c $(CFLAGS) $*
-
-.d.o:
-	$(DMD) -c $(DFLAGS) $*
-
-# variables
-OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
-	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
-
-all:  zlib.a example minigzip
-
-adler32.o: zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-zutil.o: zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzclose.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzlib.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzread.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzwrite.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-compress.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-example.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-minigzip.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-uncompr.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-crc32.o: zutil.h zlib.h zconf.h crc32.h
-	$(CC) -c $(CFLAGS) $*.c
-
-deflate.o: deflate.h zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inftrees.o: zutil.h zlib.h zconf.h inftrees.h
-	$(CC) -c $(CFLAGS) $*.c
-
-trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
-	$(CC) -c $(CFLAGS) $*.c
-
-
-example.o: example.c zlib.h zconf.h
-	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
-
-minigzip.o: minigzip.c zlib.h zconf.h
-	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
-
-zlib.a: $(OBJS)
-	ar -r $@ $(OBJS)
-
-example: example.o zlib.a
-	$(CC) $(CFLAGS) -o $@ example.o zlib.a -g
-
-minigzip: minigzip.o zlib.a
-	$(CC) $(CFLAGS) -o $@ minigzip.o zlib.a -g
-
-test: example minigzip
-	./example
-	echo hello world | minigzip | minigzip -d
-
-clean:
-	$(RM) $(OBJS) zlib.a example.o example minigzip minigzip.o test foo.gz
-
+# Makefile for zlib
+
+MODEL=32
+CC=gcc
+LD=link
+CFLAGS=-O -m$(MODEL)
+LDFLAGS=
+O=.o
+
+.c.o:
+	$(CC) -c $(CFLAGS) $*
+
+.d.o:
+	$(DMD) -c $(DFLAGS) $*
+
+# variables
+OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
+	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
+
+all:  zlib.a example minigzip
+
+adler32.o: zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+zutil.o: zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzclose.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzlib.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzread.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzwrite.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+compress.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+example.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+uncompr.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+crc32.o: zutil.h zlib.h zconf.h crc32.h
+	$(CC) -c $(CFLAGS) $*.c
+
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+
+example.o: example.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+minigzip.o: minigzip.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+zlib.a: $(OBJS)
+	ar -r $@ $(OBJS)
+
+example: example.o zlib.a
+	$(CC) $(CFLAGS) -o $@ example.o zlib.a -g
+
+minigzip: minigzip.o zlib.a
+	$(CC) $(CFLAGS) -o $@ minigzip.o zlib.a -g
+
+test: example minigzip
+	./example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	$(RM) $(OBJS) zlib.a example.o example minigzip minigzip.o test foo.gz
+
diff --git a/etc/c/zlib/osx.mak b/etc/c/zlib/osx.mak
index 6faafaa18..604f70027 100644
--- a/etc/c/zlib/osx.mak
+++ b/etc/c/zlib/osx.mak
@@ -1,95 +1,95 @@
-# Makefile for zlib
-
-MODEL=32
-CC=gcc
-LD=link
-CFLAGS=-O -m$(MODEL)
-LDFLAGS=
-O=.o
-
-.c.o:
-	$(CC) -c $(CFLAGS) $*
-
-.d.o:
-	$(DMD) -c $(DFLAGS) $*
-
-# variables
-OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
-	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
-
-all:  zlib.a example minigzip
-
-adler32.o: zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-zutil.o: zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzclose.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzlib.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzread.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzwrite.o: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-compress.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-example.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-minigzip.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-uncompr.o: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-crc32.o: zutil.h zlib.h zconf.h crc32.h
-	$(CC) -c $(CFLAGS) $*.c
-
-deflate.o: deflate.h zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inftrees.o: zutil.h zlib.h zconf.h inftrees.h
-	$(CC) -c $(CFLAGS) $*.c
-
-trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
-	$(CC) -c $(CFLAGS) $*.c
-
-
-example.o: example.c zlib.h zconf.h
-	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
-
-minigzip.o: minigzip.c zlib.h zconf.h
-	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
-
-zlib.a: $(OBJS)
-	ar -r $@ $(OBJS)
-
-example: example.o zlib.a
-	$(CC) $(CFLAGS) -o $@ example.o zlib.a -g
-
-minigzip: minigzip.o zlib.a
-	$(CC) $(CFLAGS) -o $@ minigzip.o zlib.a -g
-
-test: example minigzip
-	./example
-	echo hello world | minigzip | minigzip -d
-
-clean:
-	$(RM) $(OBJS) zlib.a example.o example minigzip minigzip.o test foo.gz
-
+# Makefile for zlib
+
+MODEL=32
+CC=gcc
+LD=link
+CFLAGS=-O -m$(MODEL)
+LDFLAGS=
+O=.o
+
+.c.o:
+	$(CC) -c $(CFLAGS) $*
+
+.d.o:
+	$(DMD) -c $(DFLAGS) $*
+
+# variables
+OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
+	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
+
+all:  zlib.a example minigzip
+
+adler32.o: zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+zutil.o: zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzclose.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzlib.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzread.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzwrite.o: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+compress.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+example.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+uncompr.o: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+crc32.o: zutil.h zlib.h zconf.h crc32.h
+	$(CC) -c $(CFLAGS) $*.c
+
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+
+example.o: example.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+minigzip.o: minigzip.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+zlib.a: $(OBJS)
+	ar -r $@ $(OBJS)
+
+example: example.o zlib.a
+	$(CC) $(CFLAGS) -o $@ example.o zlib.a -g
+
+minigzip: minigzip.o zlib.a
+	$(CC) $(CFLAGS) -o $@ minigzip.o zlib.a -g
+
+test: example minigzip
+	./example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	$(RM) $(OBJS) zlib.a example.o example minigzip minigzip.o test foo.gz
+
diff --git a/etc/c/zlib/win32.mak b/etc/c/zlib/win32.mak
index f6077b7df..838fff9bc 100644
--- a/etc/c/zlib/win32.mak
+++ b/etc/c/zlib/win32.mak
@@ -1,96 +1,96 @@
-# Makefile for zlib
-
-CC=dmc
-LD=link
-LIB=lib
-CFLAGS=-o -DNO_snprintf
-LDFLAGS=
-O=.obj
-
-# variables
-
-OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
-	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
-
-
-all:  zlib.lib example.exe minigzip.exe
-
-adler32.obj: zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-zutil.obj: zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzclose.obj: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzlib.obj: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzread.obj: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-gzwrite.obj: zlib.h zconf.h gzguts.h
-	$(CC) -c $(CFLAGS) $*.c
-
-compress.obj: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-example.obj: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-minigzip.obj: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-uncompr.obj: zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-crc32.obj: zutil.h zlib.h zconf.h crc32.h
-	$(CC) -c $(CFLAGS) $*.c
-
-deflate.obj: deflate.h zutil.h zlib.h zconf.h
-	$(CC) -c $(CFLAGS) $*.c
-
-infback.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inflate.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inffast.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
-	$(CC) -c $(CFLAGS) $*.c
-
-inftrees.obj: zutil.h zlib.h zconf.h inftrees.h
-	$(CC) -c $(CFLAGS) $*.c
-
-trees.obj: deflate.h zutil.h zlib.h zconf.h trees.h
-	$(CC) -c $(CFLAGS) $*.c
-
-
-
-example.obj: example.c zlib.h zconf.h
-	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
-
-minigzip.obj: minigzip.c zlib.h zconf.h
-	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
-
-zlib.lib: $(OBJS)
-	$(LIB) -c zlib.lib $(OBJS)
-
-example.exe: example.obj zlib.lib
-	$(LD) $(LDFLAGS) example.obj zlib.lib
-
-minigzip.exe: minigzip.obj zlib.lib
-	$(LD) $(LDFLAGS) minigzip.obj zlib.lib
-
-test: example.exe minigzip.exe
-	example
-	echo hello world | minigzip | minigzip -d
-
-clean:
-	del *.obj
-	del *.exe
-	del *.dll
-	del *.lib
-	del *.lst
-	del foo.gz
+# Makefile for zlib
+
+CC=dmc
+LD=link
+LIB=lib
+CFLAGS=-o -DNO_snprintf
+LDFLAGS=
+O=.obj
+
+# variables
+
+OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
+	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
+
+
+all:  zlib.lib example.exe minigzip.exe
+
+adler32.obj: zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+zutil.obj: zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzclose.obj: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzlib.obj: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzread.obj: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzwrite.obj: zlib.h zconf.h gzguts.h
+	$(CC) -c $(CFLAGS) $*.c
+
+compress.obj: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+example.obj: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+uncompr.obj: zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+crc32.obj: zutil.h zlib.h zconf.h crc32.h
+	$(CC) -c $(CFLAGS) $*.c
+
+deflate.obj: deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infback.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inflate.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inffast.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inftrees.obj: zutil.h zlib.h zconf.h inftrees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+trees.obj: deflate.h zutil.h zlib.h zconf.h trees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+
+
+example.obj: example.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+zlib.lib: $(OBJS)
+	$(LIB) -c zlib.lib $(OBJS)
+
+example.exe: example.obj zlib.lib
+	$(LD) $(LDFLAGS) example.obj zlib.lib
+
+minigzip.exe: minigzip.obj zlib.lib
+	$(LD) $(LDFLAGS) minigzip.obj zlib.lib
+
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	del *.obj
+	del *.exe
+	del *.dll
+	del *.lib
+	del *.lst
+	del foo.gz
diff --git a/etc/c/zlib/win64.mak b/etc/c/zlib/win64.mak
index 164c04596..0c387c9ad 100644
--- a/etc/c/zlib/win64.mak
+++ b/etc/c/zlib/win64.mak
@@ -1,101 +1,101 @@
-# Makefile for zlib64
-
-MODEL=64
-VCDIR=\Program Files (x86)\Microsoft Visual Studio 10.0\VC
-
-CC="$(VCDIR)\bin\amd64\cl"
-LD="$(VCDIR)\bin\amd64\link"
-LIB="$(VCDIR)\bin\amd64\lib"
-
-CFLAGS=/O2 /nologo /I"$(VCDIR)\INCLUDE"
-LIBFLAGS=/nologo
-LDFLAGS=/nologo
-O=.obj
-
-# variables
-
-OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
-	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
-
-
-all:  zlib64.lib example.exe minigzip.exe
-
-adler32.obj: zutil.h zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-zutil.obj: zutil.h zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-gzclose.obj: zlib.h zconf.h gzguts.h
-	$(CC) /c $(CFLAGS) $*.c
-
-gzlib.obj: zlib.h zconf.h gzguts.h
-	$(CC) /c $(CFLAGS) $*.c
-
-gzread.obj: zlib.h zconf.h gzguts.h
-	$(CC) /c $(CFLAGS) $*.c
-
-gzwrite.obj: zlib.h zconf.h gzguts.h
-	$(CC) /c $(CFLAGS) $*.c
-
-compress.obj: zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-example.obj: zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-minigzip.obj: zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-uncompr.obj: zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-crc32.obj: zutil.h zlib.h zconf.h crc32.h
-	$(CC) /c $(CFLAGS) $*.c
-
-deflate.obj: deflate.h zutil.h zlib.h zconf.h
-	$(CC) /c $(CFLAGS) $*.c
-
-infback.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) /c $(CFLAGS) $*.c
-
-inflate.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
-	$(CC) /c $(CFLAGS) $*.c
-
-inffast.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
-	$(CC) /c $(CFLAGS) $*.c
-
-inftrees.obj: zutil.h zlib.h zconf.h inftrees.h
-	$(CC) /c $(CFLAGS) $*.c
-
-trees.obj: deflate.h zutil.h zlib.h zconf.h trees.h
-	$(CC) /c $(CFLAGS) $*.c
-
-
-
-example.obj: example.c zlib.h zconf.h
-	$(CC) /c $(cvarsdll) $(CFLAGS) $*.c
-
-minigzip.obj: minigzip.c zlib.h zconf.h
-	$(CC) /c $(cvarsdll) $(CFLAGS) $*.c
-
-zlib$(MODEL).lib: $(OBJS)
-	$(LIB) $(LIBFLAGS) /OUT:zlib$(MODEL).lib $(OBJS)
-
-example.exe: example.obj zlib$(MODEL).lib
-	$(LD) $(LDFLAGS) example.obj zlib$(MODEL).lib
-
-minigzip.exe: minigzip.obj zlib$(MODEL).lib
-	$(LD) $(LDFLAGS) minigzip.obj zlib$(MODEL).lib
-
-test: example.exe minigzip.exe
-	example
-	echo hello world | minigzip | minigzip -d
-
-clean:
-	del *.obj
-	del *.exe
-	del *.dll
-	del *.lib
-	del *.lst
-	del foo.gz
+# Makefile for zlib64
+
+MODEL=64
+VCDIR=\Program Files (x86)\Microsoft Visual Studio 10.0\VC
+
+CC="$(VCDIR)\bin\amd64\cl"
+LD="$(VCDIR)\bin\amd64\link"
+LIB="$(VCDIR)\bin\amd64\lib"
+
+CFLAGS=/O2 /nologo /I"$(VCDIR)\INCLUDE"
+LIBFLAGS=/nologo
+LDFLAGS=/nologo
+O=.obj
+
+# variables
+
+OBJS = adler32$(O) compress$(O) crc32$(O) deflate$(O) gzclose$(O) gzlib$(O) gzread$(O) \
+	gzwrite$(O) infback$(O) inffast$(O) inflate$(O) inftrees$(O) trees$(O) uncompr$(O) zutil$(O)
+
+
+all:  zlib64.lib example.exe minigzip.exe
+
+adler32.obj: zutil.h zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+zutil.obj: zutil.h zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+gzclose.obj: zlib.h zconf.h gzguts.h
+	$(CC) /c $(CFLAGS) $*.c
+
+gzlib.obj: zlib.h zconf.h gzguts.h
+	$(CC) /c $(CFLAGS) $*.c
+
+gzread.obj: zlib.h zconf.h gzguts.h
+	$(CC) /c $(CFLAGS) $*.c
+
+gzwrite.obj: zlib.h zconf.h gzguts.h
+	$(CC) /c $(CFLAGS) $*.c
+
+compress.obj: zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+example.obj: zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+minigzip.obj: zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+uncompr.obj: zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+crc32.obj: zutil.h zlib.h zconf.h crc32.h
+	$(CC) /c $(CFLAGS) $*.c
+
+deflate.obj: deflate.h zutil.h zlib.h zconf.h
+	$(CC) /c $(CFLAGS) $*.c
+
+infback.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) /c $(CFLAGS) $*.c
+
+inflate.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h inffixed.h
+	$(CC) /c $(CFLAGS) $*.c
+
+inffast.obj: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+	$(CC) /c $(CFLAGS) $*.c
+
+inftrees.obj: zutil.h zlib.h zconf.h inftrees.h
+	$(CC) /c $(CFLAGS) $*.c
+
+trees.obj: deflate.h zutil.h zlib.h zconf.h trees.h
+	$(CC) /c $(CFLAGS) $*.c
+
+
+
+example.obj: example.c zlib.h zconf.h
+	$(CC) /c $(cvarsdll) $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+	$(CC) /c $(cvarsdll) $(CFLAGS) $*.c
+
+zlib$(MODEL).lib: $(OBJS)
+	$(LIB) $(LIBFLAGS) /OUT:zlib$(MODEL).lib $(OBJS)
+
+example.exe: example.obj zlib$(MODEL).lib
+	$(LD) $(LDFLAGS) example.obj zlib$(MODEL).lib
+
+minigzip.exe: minigzip.obj zlib$(MODEL).lib
+	$(LD) $(LDFLAGS) minigzip.obj zlib$(MODEL).lib
+
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	del *.obj
+	del *.exe
+	del *.dll
+	del *.lib
+	del *.lst
+	del foo.gz
diff --git a/std/functional.d b/std/functional.d
index f6be980ca..64089ac88 100644
--- a/std/functional.d
+++ b/std/functional.d
@@ -1414,7 +1414,7 @@ template forward(args...)
 
     static if (args.length)
     {
-    	import std.algorithm.mutation : move;
+        import std.algorithm.mutation : move;
 
         alias arg = args[0];
         static if (__traits(isRef, arg))
diff --git a/std/internal/math/gammafunction.d b/std/internal/math/gammafunction.d
index 9515212bd..795c505e6 100644
--- a/std/internal/math/gammafunction.d
+++ b/std/internal/math/gammafunction.d
@@ -1584,14 +1584,14 @@ unittest {
 }
 
 /** Inverse of the Log Minus Digamma function
- * 
+ *
  *   Returns x such $(D log(x) - digamma(x) == y).
  *
  * References:
  *   1. Abramowitz, M., and Stegun, I. A. (1970).
  *      Handbook of mathematical functions. Dover, New York,
  *      pages 258-259, equation 6.3.18.
- * 
+ *
  * Authors: Ilya Yaroshenko
  */
 real logmdigammaInverse(real y)
diff --git a/std/math.d b/std/math.d
index 25d4124f6..0c52042a5 100644
--- a/std/math.d
+++ b/std/math.d
@@ -2725,7 +2725,7 @@ float ldexp(float n, int exp) @safe pure nothrow @nogc { return ldexp(cast(real)
         T n = 3.0;
         int exp = 3;
         r = ldexp(n, exp);
-        assert(r == 24);        
+        assert(r == 24);
     }
 }
 
@@ -4648,7 +4648,7 @@ unittest
 /*********************************
  * Determines if $(D_PARAM x) is NaN.
  * params:
- *  x = a floating point number. 
+ *  x = a floating point number.
  * returns:
  *  $(D true) if $(D_PARAM x) is Nan.
  */
@@ -4743,7 +4743,7 @@ bool isNaN(X)(X x) @nogc @trusted pure nothrow
 /*********************************
  * Determines if $(D_PARAM x) is finite.
  * params:
- *  x = a floating point number. 
+ *  x = a floating point number.
  * returns:
  *  $(D true) if $(D_PARAM x) is finite.
  */
@@ -4793,10 +4793,10 @@ int isFinite(X)(X x) @trusted pure nothrow @nogc
  * A normalized number must not be zero, subnormal, infinite nor $(NAN).
  *
  * params:
- *  x = a floating point number. 
+ *  x = a floating point number.
  * returns:
  *  $(D true) if $(D_PARAM x) is normalized.
- */ 
+ */
 
 /* Need one for each format because subnormal floats might
  * be converted to normal reals.
@@ -4838,12 +4838,12 @@ bool isNormal(X)(X x) @trusted pure nothrow @nogc
 
 /*********************************
  * Determines if $(D_PARAM x) is subnormal.
- * 
- * Subnormals (also known as "denormal number"), have a 0 exponent 
+ *
+ * Subnormals (also known as "denormal number"), have a 0 exponent
  * and a 0 most significant mantissa bit.
  *
  * params:
- *  x = a floating point number. 
+ *  x = a floating point number.
  * returns:
  *  $(D true) if $(D_PARAM x) is a denormal number.
  */
@@ -4912,7 +4912,7 @@ int isSubnormal(X)(X x) @trusted pure nothrow @nogc
 /*********************************
  * Determines if $(D_PARAM x) is $(PLUSMN)$(INFIN).
  * params:
- *  x = a floating point number. 
+ *  x = a floating point number.
  * returns:
  *  $(D true) if $(D_PARAM x) is $(PLUSMN)$(INFIN).
  */
diff --git a/std/mathspecial.d b/std/mathspecial.d
index 353642faf..29d20e318 100644
--- a/std/mathspecial.d
+++ b/std/mathspecial.d
@@ -179,7 +179,7 @@ real digamma(real x)
 /** Log Minus Digamma function
  *
  *  logmdigamma(x) = log(x) - digamma(x)
- * 
+ *
  *  See_Also: $(LREF digamma), $(LREF logmdigammaInverse).
  */
 real logmdigamma(real x)
@@ -188,9 +188,9 @@ real logmdigamma(real x)
 }
 
 /** Inverse of the Log Minus Digamma function
- * 
+ *
  *  Given y, the function finds x such log(x) - digamma(x) = y.
- * 
+ *
  *  See_Also: $(LREF logmdigamma), $(LREF digamma).
  */
 real logmdigammaInverse(real x)
diff --git a/std/numeric.d b/std/numeric.d
index 1759549bc..5fb3131b2 100644
--- a/std/numeric.d
+++ b/std/numeric.d
@@ -783,7 +783,7 @@ public:
 /**  Find a real root of a real function f(x) via bracketing.
  *
  * Given a function $(D f) and a range $(D [a..b]) such that $(D f(a))
- * and $(D f(b)) have opposite signs or at least one of them equals ±0, 
+ * and $(D f(b)) have opposite signs or at least one of them equals ±0,
  * returns the value of $(D x) in
  * the range which is closest to a root of $(D f(x)).  If $(D f(x))
  * has more than one root in the range, one will be chosen
@@ -845,7 +845,7 @@ T findRoot(T, DF)(scope DF f, in T a, in T b)
  *
  * fax = Value of $(D f(ax)).
  *
- * fbx = Value of $(D f(bx)). $(D fax) and $(D fbx) should have opposite signs. 
+ * fbx = Value of $(D f(bx)). $(D fax) and $(D fbx) should have opposite signs.
  * ($(D f(ax)) and $(D f(bx)) are commonly known in advance.)
  *
  *
diff --git a/std/typecons.d b/std/typecons.d
index d1a70c1c1..e86ef926c 100644
--- a/std/typecons.d
+++ b/std/typecons.d
@@ -542,7 +542,7 @@ template Tuple(Specs...)
          * The types of the `Tuple`'s components.
          */
         alias Types = staticMap!(extractType, fieldSpecs);
-        
+
         ///
         unittest
         {
@@ -554,7 +554,7 @@ template Tuple(Specs...)
          * The names of the `Tuple`'s components. Unnamed fields have empty names.
          */
         alias fieldNames = staticMap!(extractName, fieldSpecs);
-        
+
         ///
         unittest
         {
@@ -570,18 +570,18 @@ template Tuple(Specs...)
          */
         Types expand;
         mixin(injectNamedFields());
-        
+
         ///
         unittest
         {
             auto t1 = tuple(1, " hello ", 2.3);
             assert(t1.toString() == `Tuple!(int, string, double)(1, " hello ", 2.3)`);
-            
-            void takeSeveralTypes(int n, string s, bool b) 
+
+            void takeSeveralTypes(int n, string s, bool b)
             {
                 assert(n == 4 && s == "test" && b == false);
             }
-            
+
             auto t2 = tuple(4, "test", false);
             //t.expand acting as a list of values
             takeSeveralTypes(t2.expand);
@@ -617,8 +617,8 @@ template Tuple(Specs...)
          * Params:
          *     values = A list of values that are either the same
          *              types as those given by the `Types` field
-         *              of this `Tuple`, or can implicitly convert 
-         *              to those types. They must be in the same 
+         *              of this `Tuple`, or can implicitly convert
+         *              to those types. They must be in the same
          *              order as they appear in `Types`.
          */
         static if (Types.length > 0)
@@ -628,7 +628,7 @@ template Tuple(Specs...)
                 field[] = values[];
             }
         }
-        
+
         ///
         unittest
         {
@@ -652,7 +652,7 @@ template Tuple(Specs...)
                 field[i] = values[i];
             }
         }
-        
+
         ///
         unittest
         {
@@ -675,15 +675,15 @@ template Tuple(Specs...)
         {
             field[] = another.field[];
         }
-        
+
         ///
         unittest
         {
             alias IntVec = Tuple!(int, int, int);
             alias DubVec = Tuple!(double, double, double);
-            
+
             IntVec iv = tuple(1, 1, 1);
-            
+
             //Ok, int can implicitly convert to double
             DubVec dv = iv;
             //Error: double cannot implicitly convert to int
@@ -694,13 +694,13 @@ template Tuple(Specs...)
          * Comparison for equality. Two `Tuple`s are considered equal
          * $(B iff) they fulfill the following criteria:
          *
-         * $(UL 
+         * $(UL
          *   $(LI Each `Tuple` is the same length.)
-         *   $(LI For each type `T` on the left-hand side and each type 
-         *        `U` on the right-hand side, values of type `T` can be 
+         *   $(LI For each type `T` on the left-hand side and each type
+         *        `U` on the right-hand side, values of type `T` can be
          *        compared with values of type `U`.)
-         *   $(LI For each value `v1` on the left-hand side and each value 
-         *        `v2` on the right-hand side, the expression `v1 == v2` is 
+         *   $(LI For each value `v1` on the left-hand side and each value
+         *        `v2` on the right-hand side, the expression `v1 == v2` is
          *        true.))
          *
          * Params:
@@ -715,14 +715,14 @@ template Tuple(Specs...)
         {
             return field[] == rhs.field[];
         }
-        
+
         /// ditto
         bool opEquals(R)(R rhs) const
         if (areCompatibleTuples!(typeof(this), R, "=="))
         {
             return field[] == rhs.field[];
         }
-        
+
         ///
         unittest
         {
@@ -761,7 +761,7 @@ template Tuple(Specs...)
             }
             return 0;
         }
-        
+
         /// ditto
         int opCmp(R)(R rhs) const
         if (areCompatibleTuples!(typeof(this), R, "<"))
@@ -775,8 +775,8 @@ template Tuple(Specs...)
             }
             return 0;
         }
-        
-        /**  
+
+        /**
             The first `v1` for which `v1 > v2` is true determines
             the result. This could lead to unexpected behaviour.
          */
@@ -785,7 +785,7 @@ template Tuple(Specs...)
             auto tup1 = tuple(1, 1, 1);
             auto tup2 = tuple(1, 100, 100);
             assert(tup1 < tup2);
-            
+
             //Only the first result matters for comparison
             tup1[0] = 2;
             assert(tup1 > tup2);
@@ -795,7 +795,7 @@ template Tuple(Specs...)
          * Assignment from another `Tuple`.
          *
          * Params:
-         *     rhs = The source `Tuple` to assign from. Each element of the 
+         *     rhs = The source `Tuple` to assign from. Each element of the
          *           source `Tuple` must be implicitly assignable to each
          *           respective element of the target `Tuple`.
          */
@@ -832,8 +832,8 @@ template Tuple(Specs...)
          *     to = A `size_t` designating the ending position (exclusive) of the slice.
          *
          * Returns:
-         *     A new `Tuple` that is a slice from `[from, to$(RPAREN)` of the original. 
-         *     It has the same types and values as the range `[from, to$(RPAREN)` in 
+         *     A new `Tuple` that is a slice from `[from, to$(RPAREN)` of the original.
+         *     It has the same types and values as the range `[from, to$(RPAREN)` in
          *     the original.
          */
         @property
@@ -842,7 +842,7 @@ template Tuple(Specs...)
         {
             return *cast(typeof(return)*) &(field[from]);
         }
-        
+
         ///
         unittest
         {
@@ -856,7 +856,7 @@ template Tuple(Specs...)
 
         /**
             Creates a hash of this `Tuple`.
-            
+
             Returns:
                 A `size_t` representing the hash of this `Tuple`.
          */
@@ -867,7 +867,7 @@ template Tuple(Specs...)
                 h += typeid(T).getHash(cast(const void*)&field[i]);
             return h;
         }
-        
+
         void toString(DG)(scope DG sink)
         {
             enum header = typeof(this).stringof ~ "(",
@@ -921,7 +921,7 @@ unittest
     auto y = point[1];
 }
 
-/** 
+/**
     `Tuple` members can be named. It is legal to mix named and unnamed
     members. The method above is still applicable to all fields.
  */
@@ -950,10 +950,10 @@ unittest
 
 /**
     Create a copy of a `Tuple` with its fields in reverse order.
-    
+
     Params:
         t = The `Tuple` to copy.
-    
+
     Returns:
         A copy of `t` with its fields in reverse order.
  */
@@ -1389,17 +1389,17 @@ unittest
 /**
     Constructs a $(D Tuple) object instantiated and initialized according to
     the given arguments.
-    
+
     Params:
         Names = A list of strings naming each successive field of the `Tuple`.
                 Each name matches up with the corresponding field given by `Args`.
                 A name does not have to be provided for every field, but as
                 the names must proceed in order, it is not possible to skip
                 one field and name the next after it.
-                
+
         args = Values to initialize the `Tuple` with. The `Tuple`'s type will
                be inferred from the types of the values given.
-    
+
     Returns:
         A new `Tuple` with its type inferred from the arguments given.
 */
@@ -1460,10 +1460,10 @@ unittest
 
 /**
     Returns $(D true) if and only if $(D T) is an instance of $(D std.typecons.Tuple).
-    
+
     Params:
         T = The type to check.
-        
+
     Returns:
         true if `T` is a `Tuple` type, false otherwise.
  */
@@ -1599,7 +1599,7 @@ unittest
 }
 
 /**
-    However, $(D Rebindable!(Widget)) does allow reassignment, 
+    However, $(D Rebindable!(Widget)) does allow reassignment,
     while otherwise behaving exactly like a $(D const Widget).
  */
 unittest
@@ -1621,7 +1621,7 @@ inference.
 Params:
     obj = A reference to an object or interface, or an array slice
           to initialize the `Rebindable` with.
-          
+
 Returns:
     A newly constructed `Rebindable` initialized with the given reference.
 */
@@ -1736,7 +1736,7 @@ unittest
     Similar to $(D Rebindable!(T)) but strips all qualifiers from the reference as
     opposed to just constness / immutability. Primary intended use case is with
     shared (having thread-local reference to shared class data)
-    
+
     Params:
         T = A class or interface type.
  */
@@ -1794,13 +1794,13 @@ unittest
   Order the provided members to minimize size while preserving alignment.
   Alignment is not always optimal for 80-bit reals, nor for structs declared
   as align(1).
-  
+
   Params:
-      E = A list of the types to be aligned, representing fields 
+      E = A list of the types to be aligned, representing fields
           of an aggregate such as a `struct` or `class`.
-      
+
       names = The names of the fields that are to be aligned.
-      
+
   Returns:
       A string to be mixed in to an aggregate, such as a `struct` or `class`.
 */
@@ -1909,13 +1909,13 @@ Returns:
     {
         return _isNull;
     }
-    
+
 ///
 unittest
 {
     Nullable!int ni;
     assert(ni.isNull);
-    
+
     ni = 0;
     assert(!ni.isNull);
 }
@@ -1928,13 +1928,13 @@ Forces $(D this) to the null state.
         .destroy(_value);
         _isNull = true;
     }
-    
+
 ///
 unittest
 {
     Nullable!int ni = 0;
     assert(!ni.isNull);
-    
+
     ni.nullify();
     assert(ni.isNull);
 }
@@ -1956,7 +1956,7 @@ Params:
     If this `Nullable` wraps a type that already has a null value
     (such as a pointer), then assigning the null value to this
     `Nullable` is no different than assigning any other value of
-    type `T`, and the resulting code will look very strange. It 
+    type `T`, and the resulting code will look very strange. It
     is strongly recommended that this be avoided by instead using
     the version of `Nullable` that takes an additional `nullValue`
     template argument.
@@ -1966,7 +1966,7 @@ unittest
     //Passes
     Nullable!(int*) npi;
     assert(npi.isNull);
-    
+
     //Passes?!
     npi = null;
     assert(!npi.isNull);
@@ -1985,17 +1985,17 @@ Returns:
         assert(!isNull, message);
         return _value;
     }
-    
+
 ///
 unittest
 {
     import std.exception: assertThrown, assertNotThrown;
-    
+
     Nullable!int ni;
-    //`get` is implicitly called. Will throw 
+    //`get` is implicitly called. Will throw
     //an AssertError in non-release mode
     assertThrown!Throwable(ni == 0);
-    
+
     ni = 0;
     assertNotThrown!Throwable(ni == 0);
 }
@@ -2016,21 +2016,21 @@ unittest
         string address;
         int customerNum;
     }
-    
+
     Nullable!CustomerRecord getByName(string name)
     {
         //A bunch of hairy stuff
-        
+
         return Nullable!CustomerRecord.init;
     }
-    
+
     auto queryResult = getByName("Doe, John");
     if (!queryResult.isNull)
     {
         //Process Mr. Doe's customer record
         auto address = queryResult.address;
         auto customerNum = queryResult.customerNum;
-        
+
         //Do some things with this customer's info
     }
     else
@@ -2320,7 +2320,7 @@ Nullable!T) because it does not need to store an extra $(D bool).
 
 Params:
     T = The wrapped type for which Nullable provides a null value.
-    
+
     nullValue = The null value which denotes the null state of this
                 `Nullable`. Must be of type `T`.
  */
@@ -2375,14 +2375,14 @@ Returns:
             return _value == nullValue;
         }
     }
-    
+
 ///
 unittest
 {
     Nullable!(int, -1) ni;
     //Initialized to "null" state
     assert(ni.isNull);
-    
+
     ni = 0;
     assert(!ni.isNull);
 }
@@ -2394,20 +2394,20 @@ Forces $(D this) to the null state.
     {
         _value = nullValue;
     }
-    
+
 ///
 unittest
 {
     Nullable!(int, -1) ni = 0;
     assert(!ni.isNull);
-    
+
     ni = -1;
     assert(ni.isNull);
 }
 
 /**
 Assigns $(D value) to the internally-held state. If the assignment
-succeeds, $(D this) becomes non-null. No null checks are made. Note 
+succeeds, $(D this) becomes non-null. No null checks are made. Note
 that the assignment may leave $(D this) in the null state.
 
 Params:
@@ -2419,13 +2419,13 @@ Params:
     {
         _value = value;
     }
-    
+
 /**
     If this `Nullable` wraps a type that already has a null value
     (such as a pointer), and that null value is not given for
-    `nullValue`, then assigning the null value to this `Nullable` 
-    is no different than assigning any other value of type `T`, 
-    and the resulting code will look very strange. It is strongly 
+    `nullValue`, then assigning the null value to this `Nullable`
+    is no different than assigning any other value of type `T`,
+    and the resulting code will look very strange. It is strongly
     recommended that this be avoided by using `T`'s "built in"
     null value for `nullValue`.
  */
@@ -2435,7 +2435,7 @@ unittest
     enum nullVal = cast(int*)0xCAFEBABE;
     Nullable!(int*, nullVal) npi;
     assert(npi.isNull);
-    
+
     //Passes?!
     npi = null;
     assert(!npi.isNull);
@@ -2456,17 +2456,17 @@ Returns:
         assert(!isNull, message);
         return _value;
     }
-    
+
 ///
 unittest
 {
     import std.exception: assertThrown, assertNotThrown;
-    
+
     Nullable!(int, -1) ni;
-    //`get` is implicitly called. Will throw 
+    //`get` is implicitly called. Will throw
     //an error in non-release mode
     assertThrown!Throwable(ni == 0);
-    
+
     ni = 0;
     assertNotThrown!Throwable(ni == 0);
 }
@@ -2484,14 +2484,14 @@ unittest
     Nullable!(size_t, size_t.max) indexOf(string[] haystack, string needle)
     {
         //Find the needle, returning -1 if not found
-        
+
         return Nullable!(size_t, size_t.max).init;
     }
-    
+
     void sendLunchInvite(string name)
     {
     }
-    
+
     //It's safer than C...
     auto coworkers = ["Jane", "Jim", "Marry", "Fred"];
     auto pos = indexOf(coworkers, "Bob");
@@ -2504,7 +2504,7 @@ unittest
     {
         //Bob not found; report the error
     }
-    
+
     //And there's no overhead
     static assert(Nullable!(size_t, size_t.max).sizeof == size_t.sizeof);
 }
@@ -2683,13 +2683,13 @@ Params:
     {
         _value = value;
     }
-    
+
     ///
     unittest
     {
         NullableRef!int nr = new int(42);
         assert(nr == 42);
-        
+
         int* n = new int(1);
         nr.bind(n);
         assert(nr == 1);
@@ -2705,13 +2705,13 @@ Returns:
     {
         return _value is null;
     }
-    
+
     ///
     unittest
     {
         NullableRef!int nr;
         assert(nr.isNull);
-        
+
         int* n = new int(42);
         nr.bind(n);
         assert(!nr.isNull && nr == 42);
@@ -2724,13 +2724,13 @@ Forces $(D this) to the null state.
     {
         _value = null;
     }
-    
+
     ///
     unittest
     {
         NullableRef!int nr = new int(42);
         assert(!nr.isNull);
-        
+
         nr.nullify();
         assert(nr.isNull);
     }
@@ -2751,16 +2751,16 @@ Params:
         assert(!isNull, message);
         *_value = value;
     }
-    
+
     ///
     unittest
     {
         import std.exception: assertThrown, assertNotThrown;
-        
+
         NullableRef!int nr;
         assert(nr.isNull);
         assertThrown!Throwable(nr = 42);
-        
+
         nr.bind(new int(0));
         assert(!nr.isNull);
         assertNotThrown!Throwable(nr = 42);
@@ -2777,17 +2777,17 @@ This function is also called for the implicit conversion to $(D T).
         assert(!isNull, message);
         return *_value;
     }
-    
+
     ///
     unittest
     {
         import std.exception: assertThrown, assertNotThrown;
-        
+
         NullableRef!int nr;
-        //`get` is implicitly called. Will throw 
+        //`get` is implicitly called. Will throw
         //an error in non-release mode
         assertThrown!Throwable(nr == 0);
-        
+
         nr.bind(new int(0));
         assertNotThrown!Throwable(nr == 0);
     }
@@ -3016,8 +3016,8 @@ unittest
 
 /**
 $(D WhiteHole!Base) is a subclass of $(D Base) which automatically implements
-all abstract member functions as functions that always fail. These functions 
-simply throw an $(D Error) and never return. `Whitehole` is useful for 
+all abstract member functions as functions that always fail. These functions
+simply throw an $(D Error) and never return. `Whitehole` is useful for
 trapping the use of class member functions that haven't been implemented.
 
 The name came from
@@ -4996,15 +4996,15 @@ unittest
 
 /**
     Creates a proxy for the value `a` that will forward all operations
-    while disabling implicit conversions. The aliased item `a` must be 
-    an $(B lvalue). This is useful for creating a new type from the 
-    "base" type (though this is $(B not) a subtype-supertype 
-    relationship; the new type is not related to the old type in any way, 
+    while disabling implicit conversions. The aliased item `a` must be
+    an $(B lvalue). This is useful for creating a new type from the
+    "base" type (though this is $(B not) a subtype-supertype
+    relationship; the new type is not related to the old type in any way,
     by design).
-    
+
     The new type supports all operations that the underlying type does,
     including all operators such as `+`, `--`, `<`, `[]`, etc.
-    
+
     Params:
         a = The value to act as a proxy for all operations. It must
             be an lvalue.
@@ -5243,29 +5243,29 @@ unittest
     {
         //Won't work; the literal '1' is
         //is an rvalue, not an lvalue
-        //mixin Proxy!1; 
-        
+        //mixin Proxy!1;
+
         //Okay, n is an lvalue
         int n;
         mixin Proxy!n;
-        
+
         this(int n) { this.n = n; }
     }
-    
+
     NewIntType nit = 0;
     nit++;
     assert(nit == 1);
-    
-    
+
+
     struct NewObjectType
     {
         Object obj;
         //Ok, obj is an lvalue
         mixin Proxy!obj;
-        
+
         this (Object o) { obj = o; }
     }
-    
+
     NewObjectType not = new Object();
     assert(__traits(compiles, not.toHash()));
 }
@@ -5273,24 +5273,24 @@ unittest
 /**
     There is one exception to the fact that the new type is not related to the
     old type. $(LINK2 http://dlang.org/function.html#pseudo-member, Pseudo-member)
-    functions are usable with the new type; they will be forwarded on to the 
+    functions are usable with the new type; they will be forwarded on to the
     proxied value.
  */
 unittest
 {
     import std.math;
-    
+
     float f = 1.0;
     assert(!f.isInfinity);
-    
+
     struct NewFloat
     {
         float _;
         mixin Proxy!_;
-        
+
         this(float f) { _ = f; }
     }
- 
+
     NewFloat nf = 1.0f;
     assert(!nf.isInfinity);
 }
diff --git a/std/variant.d b/std/variant.d
index f463adb0a..180425d8e 100644
--- a/std/variant.d
+++ b/std/variant.d
@@ -140,7 +140,7 @@ template This2Variant(V, T...)
  * are larger than the largest built-in type, they will automatically
  * be boxed. This means that even large types will only be the size
  * of a pointer within the $(D_PARAM Variant), but this also implies some
- * overhead. $(D_PARAM Variant) can accommodate all primitive types and 
+ * overhead. $(D_PARAM Variant) can accommodate all primitive types and
  * all user-defined types.))
  *
  * Both $(D_PARAM Algebraic) and $(D_PARAM Variant) share $(D_PARAM