encoding.ascii: Make static const data immutable

Don't use extern for templated functions. If the function argument is
const, it gets a different mangling. So define a private function for
each floatint point length and call it from template.

.travis.yml

@@ -7,6 +7,7 @@ os:
 language: d
 
 d:
+  - dmd-2.080.0
   - dmd-2.079.1
   - dmd-2.078.3
   - dmd-2.077.1
@@ -22,7 +23,7 @@ addons:
       - gcc-multilib
 
 before_script:
-  - if [ "`$DC --version | head -n 1 | grep 'v2.079.1'`" ]; then
+  - if [ "`$DC --version | head -n 1 | grep 'v2.080.0'`" ]; then
       export UNITTEST="unittest-cov";
     fi
 

README.md

@@ -1,6 +1,6 @@
 # Tanya
 
-[![Build status](https://travis-ci.org/caraus-ecms/tanya.svg?branch=master)](https://travis-ci.org/caraus-ecms/tanya)
+[![Build Status](https://travis-ci.com/caraus-ecms/tanya.svg?branch=master)](https://travis-ci.com/caraus-ecms/tanya)
 [![Build status](https://ci.appveyor.com/api/projects/status/djkmverdfsylc7ti/branch/master?svg=true)](https://ci.appveyor.com/project/belka-ew/tanya/branch/master)
 [![codecov](https://codecov.io/gh/caraus-ecms/tanya/branch/master/graph/badge.svg)](https://codecov.io/gh/caraus-ecms/tanya)
 [![Dub version](https://img.shields.io/dub/v/tanya.svg)](https://code.dlang.org/packages/tanya)
@@ -26,7 +26,7 @@ Tanya consists of the following packages and (top-level) modules:
 * `algorithm`: Collection of generic algorithms.
 * `async`: Event loop (epoll, kqueue and IOCP).
 * `container`: Queue, Array, Singly and doubly linked lists, Buffers, UTF-8
-string, Hash table.
+string, Set, Hash table.
 * `conv`: This module provides functions for converting between different
 types.
 * `encoding`: This package provides tools to work with text encodings.
@@ -172,18 +172,11 @@ parameter is used)
 
 | DMD     | GCC       |
 |:-------:|:---------:|
-| 2.079.1 | *master*  |
+| 2.080.0 | *master*  |
+| 2.079.1 |           |
 | 2.078.3 |           |
 | 2.077.1 |           |
 
-### Current status
-
-Following modules are under development:
-
-| Feature    | Branch    | Build status                                                                                                                                                                                                                                                                                  |
-|------------|:---------:|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
-| Hash table | bitvector | [![bitvector](https://travis-ci.org/caraus-ecms/tanya.svg?branch=bitvector)](https://travis-ci.org/caraus-ecms/tanya) [![bitvector](https://ci.appveyor.com/api/projects/status/djkmverdfsylc7ti/branch/bitvector?svg=true)](https://ci.appveyor.com/project/belka-ew/tanya/branch/bitvector) |
-
 ### Release management
 
 Tanya is still under active development and it isn't possible to provide great

appveyor.yml

@@ -3,6 +3,12 @@ os: Visual Studio 2015
 
 environment:
   matrix:
+    - DC: dmd
+      DVersion: 2.080.0
+      arch: x64
+    - DC: dmd
+      DVersion: 2.080.0
+      arch: x86
     - DC: dmd
       DVersion: 2.079.1
       arch: x64

arch/x64/linux/math/abs.S

@@ -2,10 +2,10 @@
 
 
 // fabsf.
-	.globl _D5tanya4math8nbtheory10__T3absTfZ3absFNaNbNiNffZf
-	.type _D5tanya4math8nbtheory10__T3absTfZ3absFNaNbNiNffZf, @function
+	.globl _D5tanya4math8nbtheory4fabsFNaNbNiNffZf
+	.type _D5tanya4math8nbtheory4fabsFNaNbNiNffZf, @function
 
-_D5tanya4math8nbtheory10__T3absTfZ3absFNaNbNiNffZf:
+_D5tanya4math8nbtheory4fabsFNaNbNiNffZf:
 	mov $0x7fffffff, %eax
 	movq %rax, %xmm1
 	andpd %xmm1, %xmm0
@@ -13,10 +13,10 @@ _D5tanya4math8nbtheory10__T3absTfZ3absFNaNbNiNffZf:
 
 
 // fabs.
-	.globl _D5tanya4math8nbtheory10__T3absTdZ3absFNaNbNiNfdZd
-	.type _D5tanya4math8nbtheory10__T3absTdZ3absFNaNbNiNfdZd, @function
+	.globl _D5tanya4math8nbtheory4fabsFNaNbNiNfdZd
+	.type _D5tanya4math8nbtheory4fabsFNaNbNiNfdZd, @function
 
-_D5tanya4math8nbtheory10__T3absTdZ3absFNaNbNiNfdZd:
+_D5tanya4math8nbtheory4fabsFNaNbNiNfdZd:
 	mov $0x7fffffffffffffff, %rax
 	movq %rax, %xmm1
 	andpd %xmm1, %xmm0
@@ -24,12 +24,12 @@ _D5tanya4math8nbtheory10__T3absTdZ3absFNaNbNiNfdZd:
 
 
 // fabsl.
-	.globl _D5tanya4math8nbtheory10__T3absTeZ3absFNaNbNiNfeZe
-	.type _D5tanya4math8nbtheory10__T3absTeZ3absFNaNbNiNfeZe, @function
+	.globl _D5tanya4math8nbtheory4fabsFNaNbNiNfeZe
+	.type _D5tanya4math8nbtheory4fabsFNaNbNiNfeZe, @function
 
 // Load the parameter from the stack onto FP stack, execute 'fabs' instruction
 // The result is returned in ST0.
-_D5tanya4math8nbtheory10__T3absTeZ3absFNaNbNiNfeZe:
+_D5tanya4math8nbtheory4fabsFNaNbNiNfeZe:
 	fldt 0x8(%rsp)
 	fabs
 	ret

arch/x64/linux/math/log.S

@@ -1,22 +1,29 @@
 	.text
 
 
-// logl.
-	.globl _D5tanya4math8nbtheory9__T2lnTeZ2lnFNaNbNiNfeZe
-	.type _D5tanya4math8nbtheory9__T2lnTeZ2lnFNaNbNiNfeZe, @function
+// logf.
+	.globl _D5tanya4math8nbtheory4logfFNaNbNiNffZf
+	.type _D5tanya4math8nbtheory4logfFNaNbNiNffZf, @function
+
+_D5tanya4math8nbtheory4logfFNaNbNiNffZf:
+	movss %xmm0, -4(%rsp) // Put the argument onto the stack
 
-_D5tanya4math8nbtheory9__T2lnTeZ2lnFNaNbNiNfeZe:
 	fldln2 // Put lb(e) onto the FPU stack
-	fldt 8(%rsp) // Put the argument onto the FPU stack
+	flds -4(%rsp) // Put a float onto the FPU stack
 	fyl2x // %st1 * lb(%st0)
+
+	 // The result is on the FPU stack, but returned in %xmm0
+	fstps -4(%rsp)
+	movss -4(%rsp), %xmm0
+
 	ret
 
 
 // log.
-	.globl _D5tanya4math8nbtheory9__T2lnTdZ2lnFNaNbNiNfdZd
-	.type _D5tanya4math8nbtheory9__T2lnTdZ2lnFNaNbNiNfdZd, @function
+	.globl _D5tanya4math8nbtheory3logFNaNbNiNfdZd
+	.type _D5tanya4math8nbtheory3logFNaNbNiNfdZd, @function
 
-_D5tanya4math8nbtheory9__T2lnTdZ2lnFNaNbNiNfdZd:
+_D5tanya4math8nbtheory3logFNaNbNiNfdZd:
 	movsd %xmm0, -8(%rsp) // Put the argument onto the stack
 
 	fldln2 // Put lb(e) onto the FPU stack
@@ -30,19 +37,12 @@ _D5tanya4math8nbtheory9__T2lnTdZ2lnFNaNbNiNfdZd:
 	ret
 
 
-// logf.
-	.globl _D5tanya4math8nbtheory9__T2lnTfZ2lnFNaNbNiNffZf
-	.type _D5tanya4math8nbtheory9__T2lnTfZ2lnFNaNbNiNffZf, @function
-
-_D5tanya4math8nbtheory9__T2lnTfZ2lnFNaNbNiNffZf:
-	movss %xmm0, -4(%rsp) // Put the argument onto the stack
+// logl.
+	.globl _D5tanya4math8nbtheory4loglFNaNbNiNfeZe
+	.type _D5tanya4math8nbtheory4loglFNaNbNiNfeZe, @function
 
+_D5tanya4math8nbtheory4loglFNaNbNiNfeZe:
 	fldln2 // Put lb(e) onto the FPU stack
-	flds -4(%rsp) // Put a float onto the FPU stack
+	fldt 8(%rsp) // Put the argument onto the FPU stack
 	fyl2x // %st1 * lb(%st0)
-
-	 // The result is on the FPU stack, but returned in %xmm0
-	fstps -4(%rsp)
-	movss -4(%rsp), %xmm0
-
 	ret

arch/x64/linux/syscall.S

@@ -22,44 +22,31 @@ syscall1:
 	ret
 
 
-	.globl syscall2
-	.type syscall2, @function
+// 2 parameters.
+	.globl _D5tanya3sys5linux7syscall7syscallFNbNilllZl
+	.type _D5tanya3sys5linux7syscall7syscallFNbNilllZl, @function
 
-syscall2:
-	// Store registers.
-	movq %rdi, %r8
-
-	movq %rdx, %rax // Syscall number.
-
-	// Syscall arguments.
-	movq %rsi, %rdi
-	movq %r8, %rsi
+_D5tanya3sys5linux7syscall7syscallFNbNilllZl:
+	movq %rdx, %rax
 
 	syscall
 
-	// Restore registers.
-	movq %rdi, %rsi
-	movq %r8, %rdi
-
 	ret
 
 
-	.globl syscall3
-	.type syscall3, @function
+// 6 parameters.
+	.globl _D5tanya3sys5linux7syscall7syscallFNbNilllllllZl
+	.type _D5tanya3sys5linux7syscall7syscallFNbNilllllllZl, @function
 
-syscall3:
-	// Store registers.
-	movq %rdi, %r8
+_D5tanya3sys5linux7syscall7syscallFNbNilllllllZl:
+	pushq %rbp
+	movq %rsp, %rbp
 
-	movq %rcx, %rax // Syscall number.
+	movq 16(%rbp), %rax
 
-	// Syscall arguments.
-	movq %rdx, %rdi
-	movq %r8, %rdx
+	mov %rcx, %r10
 
 	syscall
 
-	// Restore registers.
-	movq %r8, %rdi
-
+	leave
 	ret

dscanner.ini

@@ -23,7 +23,7 @@ if_else_same_check="skip-unittest"
 ; Checks for some problems with constructors
 constructor_check="skip-unittest"
 ; Checks for unused variables and function parameters
-unused_variable_check="disabled"
+unused_variable_check="skip-unittest"
 ; Checks for unused labels
 unused_label_check="skip-unittest"
 ; Checks for duplicate attributes

source/tanya/algorithm/comparison.d

@@ -0,0 +1,272 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/**
+ * Algorithms for comparing values.
+ *
+ * Copyright: Eugene Wissner 2018.
+ * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
+ *                  Mozilla Public License, v. 2.0).
+ * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)
+ * Source: $(LINK2 https://github.com/caraus-ecms/tanya/blob/master/source/tanya/algorithm/comparison.d,
+ *                 tanya/algorithm/comparison.d)
+ */
+module tanya.algorithm.comparison;
+
+import tanya.algorithm.mutation;
+import tanya.math : isNaN;
+import tanya.meta.metafunction;
+import tanya.meta.trait;
+import tanya.meta.transform;
+import tanya.range.array;
+import tanya.range.primitive;
+
+private ref inout(Args[0]) minMax(alias cmp, Args...)(ref inout Args args)
+{
+    auto actual = ((ref arg) @trusted => &arg)(args[0]);
+
+    foreach (i, arg; args[1 .. $])
+    {
+        static if (isFloatingPoint!(Args[0]))
+        {
+            if (isNaN(arg))
+            {
+                continue;
+            }
+            if (isNaN(*actual))
+            {
+                actual = ((ref arg) @trusted => &arg)(args[i + 1]);
+                continue;
+            }
+        }
+        if (cmp(arg, *actual))
+        {
+            actual = ((ref arg) @trusted => &arg)(args[i + 1]);
+        }
+    }
+
+    return *actual;
+}
+
+private T moveIf(T)(ref T arg)
+{
+    static if (hasElaborateCopyConstructor!T && isMutable!T)
+    {
+        return move(arg);
+    }
+    else
+    {
+        return arg;
+    }
+}
+
+/**
+ * Finds the smallest element in the argument list or a range.
+ *
+ * If a range is passed, $(D_PSYMBOL min) returns a range of the same type,
+ * whose front element is the smallest in the range. If more than one element
+ * fulfills this condition, the front of the returned range points to
+ * the first one found.
+ * If $(D_PARAM range) is empty, the original range is returned.
+ *
+ * If $(D_PARAM Args) are floating point numbers, $(B NaN) is not considered
+ * for comparison. $(B NaN) is returned only if all arguments are $(B NaN)s.
+ *
+ * Params:
+ *  Args  = Types of the arguments. All arguments should have the same type.
+ *  Range = Forward range type.
+ *  args  = Argument list.
+ *  range = Forward range.
+ *
+ * Returns: The smallest element.
+ */
+CommonType!Args min(Args...)(Args args)
+if (Args.length >= 2
+ && isOrderingComparable!(Args[0])
+ && allSameType!(Map!(Unqual, Args)))
+{
+    return moveIf(minMax!((ref a, ref b) => a < b)(args));
+}
+
+/// ditto
+ref inout(Unqual!(Args[0])) min(Args...)(ref inout Args args)
+if (Args.length >= 2
+ && isOrderingComparable!(Args[0])
+ && allSameType!(Map!(Unqual, Args)))
+{
+    return minMax!((ref a, ref b) => a < b)(args);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    static assert(!is(typeof(min(1, 1UL))));
+}
+
+@nogc nothrow pure @safe unittest
+{
+    assert(min(5, 3) == 3);
+    assert(min(4, 4) == 4);
+    assert(min(5.2, 3.0) == 3.0);
+
+    assert(min(5.2, double.nan) == 5.2);
+    assert(min(double.nan, 3.0) == 3.0);
+    assert(isNaN(min(double.nan, double.nan)));
+}
+
+/// ditto
+Range min(Range)(Range range)
+if (isForwardRange!Range && isOrderingComparable!(ElementType!Range))
+{
+    if (range.empty)
+    {
+        return range;
+    }
+    auto actual = range.save;
+
+    range.popFront();
+    for (; !range.empty; range.popFront())
+    {
+        if (range.front < actual.front)
+        {
+            actual = range.save;
+        }
+    }
+
+    return actual;
+}
+
+///
+@nogc nothrow pure @safe unittest
+{
+    assert(min(1, 2) == 1);
+    assert(min(3, 2) == 2);
+    assert(min(3, 1, 2) == 1);
+
+    int[4] range = [3, 1, 1, 2];
+    auto minElement = min(range[]);
+    assert(minElement.front == 1);
+    assert(minElement.length == 3);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    assert(min(cast(ubyte[]) []).empty);
+}
+
+/**
+ * Finds the largest element in the argument list or a range.
+ *
+ * If a range is passed, $(D_PSYMBOL max) returns a range of the same type,
+ * whose front element is the largest in the range. If more than one element
+ * fulfills this condition, the front of the returned range points to
+ * the first one found.
+ * If $(D_PARAM range) is empty, the original range is returned.
+ *
+ * If $(D_PARAM Args) are floating point numbers, $(B NaN) is not considered
+ * for comparison. $(B NaN) is returned only if all arguments are $(B NaN)s.
+ *
+ * Params:
+ *  Args  = Types of the arguments. All arguments should have the same type.
+ *  Range = Forward range type.
+ *  args  = Argument list.
+ *  range = Forward range.
+ *
+ * Returns: The largest element.
+ */
+CommonType!Args max(Args...)(Args args)
+if (Args.length >= 2
+ && isOrderingComparable!(Args[0])
+ && allSameType!(Map!(Unqual, Args)))
+{
+    return moveIf(minMax!((ref a, ref b) => a > b)(args));
+}
+
+/// ditto
+ref inout(Unqual!(Args[0])) max(Args...)(ref inout Args args)
+if (Args.length >= 2
+ && isOrderingComparable!(Args[0])
+ && allSameType!(Map!(Unqual, Args)))
+{
+    return minMax!((ref a, ref b) => a > b)(args);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    static assert(!is(typeof(max(1, 1UL))));
+}
+
+@nogc nothrow pure @safe unittest
+{
+    assert(max(5, 3) == 5);
+    assert(max(4, 4) == 4);
+    assert(max(5.2, 3.0) == 5.2);
+
+    assert(max(5.2, double.nan) == 5.2);
+    assert(max(double.nan, 3.0) == 3.0);
+    assert(isNaN(max(double.nan, double.nan)));
+}
+
+/// ditto
+Range max(Range)(Range range)
+if (isForwardRange!Range && isOrderingComparable!(ElementType!Range))
+{
+    if (range.empty)
+    {
+        return range;
+    }
+    auto actual = range.save;
+
+    range.popFront();
+    for (; !range.empty; range.popFront())
+    {
+        if (range.front > actual.front)
+        {
+            actual = range.save;
+        }
+    }
+
+    return actual;
+}
+
+///
+@nogc nothrow pure @safe unittest
+{
+    assert(max(1, 2) == 2);
+    assert(max(3, 2) == 3);
+    assert(max(1, 3, 2) == 3);
+
+    int[4] range = [1, 5, 5, 2];
+    auto maxElement = max(range[]);
+    assert(maxElement.front == 5);
+    assert(maxElement.length == 3);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    assert(max(cast(ubyte[]) []).empty);
+}
+
+// min/max compare const and mutable structs.
+@nogc nothrow pure @safe unittest
+{
+    static struct S
+    {
+        int s;
+
+        int opCmp(typeof(this) that) const @nogc nothrow pure @safe
+        {
+            return this.s - that.s;
+        }
+    }
+    {
+        const s1 = S(1);
+        assert(min(s1, S(2)).s == 1);
+        assert(max(s1, S(2)).s == 2);
+    }
+    {
+        auto s2 = S(2), s3 = S(3);
+        assert(min(s2, s3).s == 2);
+        assert(max(s2, s3).s == 3);
+    }
+}

source/tanya/algorithm/package.d

@@ -14,4 +14,5 @@
  */
 module tanya.algorithm;
 
+public import tanya.algorithm.comparison;
 public import tanya.algorithm.mutation;

source/tanya/async/event/epoll.d

@@ -23,7 +23,7 @@ import core.stdc.errno;
 public import core.sys.linux.epoll;
 import core.sys.posix.unistd;
 import core.time;
-import std.algorithm.comparison;
+import tanya.algorithm.comparison;
 import tanya.async.event.selector;
 import tanya.async.loop;
 import tanya.async.protocol;

source/tanya/async/event/kqueue.d

@@ -52,7 +52,7 @@ import core.stdc.errno;
 import core.sys.posix.time; // timespec
 import core.sys.posix.unistd;
 import core.time;
-import std.algorithm.comparison;
+import tanya.algorithm.comparison;
 import tanya.async.event.selector;
 import tanya.async.loop;
 import tanya.async.transport;

source/tanya/async/loop.d

@@ -173,7 +173,7 @@ abstract class Loop
         return 128U;
     }
 
-    private unittest
+    @nogc @system unittest
     {
         auto loop = defaultAllocator.make!TestLoop;
         assert(loop.maxEvents == 64);
@@ -226,7 +226,7 @@ abstract class Loop
         this.done = true;
     }
 
-    private unittest
+    @nogc @system unittest
     {
         auto loop = defaultAllocator.make!TestLoop;
         assert(loop.done);
@@ -237,7 +237,7 @@ abstract class Loop
         defaultAllocator.dispose(loop);
     }
 
-    private unittest
+    @nogc @system unittest
     {
         auto loop = defaultAllocator.make!TestLoop;
         auto watcher = defaultAllocator.make!DummyWatcher;
@@ -327,7 +327,7 @@ abstract class Loop
         blockTime_ = blockTime;
     }
 
-    private unittest
+    @nogc @system unittest
     {
         auto loop = defaultAllocator.make!TestLoop;
         assert(loop.blockTime == 1.dur!"minutes");
@@ -417,7 +417,7 @@ do
 
 private Loop defaultLoop_;
 
-private unittest
+@nogc @system unittest
 {
     auto oldLoop = defaultLoop_;
     auto loop = defaultAllocator.make!TestLoop;

source/tanya/container/array.d

@@ -15,13 +15,14 @@
 module tanya.container.array;
 
 import core.checkedint;
-import std.algorithm.comparison;
+import std.algorithm.comparison : equal;
 import std.algorithm.mutation : bringToFront,
                                 copy,
                                 fill,
                                 initializeAll,
                                 uninitializedFill;
 import std.meta;
+import tanya.algorithm.comparison;
 import tanya.algorithm.mutation;
 import tanya.exception;
 import tanya.memory;
@@ -122,7 +123,7 @@ struct Range(A)
         --this.end;
     }
 
-    ref inout(E) opIndex(const size_t i) inout @trusted
+    ref inout(E) opIndex(size_t i) inout @trusted
     in
     {
         assert(i < length);
@@ -142,7 +143,7 @@ struct Range(A)
         return typeof(return)(*this.container, this.begin, this.end);
     }
 
-    Range opSlice(const size_t i, const size_t j) @trusted
+    Range opSlice(size_t i, size_t j) @trusted
     in
     {
         assert(i <= j);
@@ -153,7 +154,7 @@ struct Range(A)
         return typeof(return)(*this.container, this.begin + i, this.begin + j);
     }
 
-    A.ConstRange opSlice(const size_t i, const size_t j) const @trusted
+    A.ConstRange opSlice(size_t i, size_t j) const @trusted
     in
     {
         assert(i <= j);
@@ -299,16 +300,16 @@ struct Array(T)
      *  init      = Initial value to fill the array with.
      *  allocator = Allocator.
      */
-    this(const size_t len, T init, shared Allocator allocator = defaultAllocator) @trusted
+    this(size_t len, T init, shared Allocator allocator = defaultAllocator)
     {
         this(allocator);
         reserve(len);
-        uninitializedFill(this.data[0 .. len], init);
+        uninitializedFill(slice(len), init);
         length_ = len;
     }
 
     /// ditto
-    this(const size_t len, shared Allocator allocator = defaultAllocator)
+    this(size_t len, shared Allocator allocator = defaultAllocator)
     {
         this(allocator);
         length = len;
@@ -348,10 +349,10 @@ struct Array(T)
     /**
      * Destroys this $(D_PSYMBOL Array).
      */
-    ~this() @trusted
+    ~this()
     {
         clear();
-        allocator.deallocate(this.data[0 .. capacity]);
+        (() @trusted => allocator.deallocate(slice(capacity)))();
     }
 
     /**
@@ -359,7 +360,7 @@ struct Array(T)
      */
     this(this)
     {
-        auto buf = this.data[0 .. this.length_];
+        auto buf = slice(this.length);
         this.length_ = capacity_ = 0;
         this.data = null;
         insertBack(buf);
@@ -417,7 +418,7 @@ struct Array(T)
      * Params:
      *  len = New length.
      */
-    @property void length(const size_t len) @trusted
+    @property void length(size_t len) @trusted
     {
         if (len == length)
         {
@@ -474,7 +475,7 @@ struct Array(T)
      * Params:
      *  size = Desired size.
      */
-    void reserve(const size_t size) @trusted
+    void reserve(size_t size) @trusted
     {
         if (capacity_ >= size)
         {
@@ -531,14 +532,14 @@ struct Array(T)
      * Params:
      *  size = Desired size.
      */
-    void shrink(const size_t size) @trusted
+    void shrink(size_t size) @trusted
     {
         if (capacity <= size)
         {
             return;
         }
         const n = max(length, size);
-        void[] buf = this.data[0 .. this.capacity_];
+        void[] buf = slice(this.capacity_);
         if (allocator.reallocateInPlace(buf, n * T.sizeof))
         {
             this.capacity_ = n;
@@ -596,7 +597,7 @@ struct Array(T)
      *
      * Returns: The number of elements removed
      */
-    size_t removeBack(const size_t howMany)
+    size_t removeBack(size_t howMany)
     out (removed)
     {
         assert(removed <= howMany);
@@ -621,7 +622,17 @@ struct Array(T)
         assert(v.removeBack(3) == 0);
     }
 
-    private @property inout(T)* end() inout
+    private inout(T)[] slice(size_t length) inout @trusted
+    in
+    {
+        assert(length <= capacity);
+    }
+    do
+    {
+        return this.data[0 .. length];
+    }
+
+    private @property inout(T)* end() inout @trusted
     {
         return this.data + this.length_;
     }
@@ -637,22 +648,24 @@ struct Array(T)
      *
      * Precondition: $(D_PARAM r) refers to a region of $(D_KEYWORD this).
      */
-    Range remove(Range r) @trusted
+    Range remove(Range r)
     in
     {
         assert(r.container is &this);
         assert(r.begin >= this.data);
-        assert(r.end <= this.data + length);
+        assert(r.end <= end);
     }
     do
     {
         auto target = r.begin;
-        for (auto source = r.end; source != end; ++source, ++target)
+        auto source = r.end;
+        while (source !is end)
         {
             move(*source, *target);
+            ((ref s, ref t) @trusted {++s; ++t;})(source, target);
         }
         length = length - r.length;
-        return Range(this, r.begin, this.data + length);
+        return Range(this, r.begin, end);
     }
 
     ///
@@ -701,13 +714,13 @@ struct Array(T)
     }
 
     /// ditto
-    size_t insertBack(R)(ref R el) @trusted
+    size_t insertBack(R)(ref R el)
     if (isImplicitlyConvertible!(R, T))
     {
-        this.length = this.length + 1;
+        length = length + 1;
         scope (failure)
         {
-            this.length = this.length - 1;
+            length = length - 1;
         }
         opIndex(this.length - 1) = el;
         return 1;
@@ -992,7 +1005,7 @@ struct Array(T)
      *
      * Precondition: $(D_INLINECODE length > pos).
      */
-    ref T opIndexAssign(E : T)(auto ref E value, const size_t pos)
+    ref T opIndexAssign(E : T)(auto ref E value, size_t pos)
     {
         return opIndex(pos) = value;
     }
@@ -1057,7 +1070,7 @@ struct Array(T)
      *
      * Precondition: $(D_INLINECODE length > pos).
      */
-    ref inout(T) opIndex(const size_t pos) inout @trusted
+    ref inout(T) opIndex(size_t pos) inout @trusted
     in
     {
         assert(length > pos);
@@ -1221,7 +1234,7 @@ struct Array(T)
      *
      * Precondition: $(D_INLINECODE i <= j && j <= length).
      */
-    Range opSlice(const size_t i, const size_t j) @trusted
+    Range opSlice(size_t i, size_t j) @trusted
     in
     {
         assert(i <= j);
@@ -1233,7 +1246,7 @@ struct Array(T)
     }
 
     /// ditto
-    ConstRange opSlice(const size_t i, const size_t j) const @trusted
+    ConstRange opSlice(size_t i, size_t j) const @trusted
     in
     {
         assert(i <= j);
@@ -1294,7 +1307,7 @@ struct Array(T)
      * Precondition: $(D_INLINECODE i <= j && j <= length
      *                           && value.length == j - i)
      */
-    Range opSliceAssign(size_t R)(T[R] value, const size_t i, const size_t j)
+    Range opSliceAssign(size_t R)(T[R] value, size_t i, size_t j)
     @trusted
     in
     {
@@ -1308,7 +1321,7 @@ struct Array(T)
     }
 
     /// ditto
-    Range opSliceAssign(R : T)(auto ref R value, const size_t i, const size_t j)
+    Range opSliceAssign(R : T)(auto ref R value, size_t i, size_t j)
     @trusted
     in
     {
@@ -1322,7 +1335,7 @@ struct Array(T)
     }
 
     /// ditto
-    Range opSliceAssign(Range value, const size_t i, const size_t j) @trusted
+    Range opSliceAssign(Range value, size_t i, size_t j) @trusted
     in
     {
         assert(i <= j);
@@ -1407,7 +1420,7 @@ struct Array(T)
     }
 
     /// ditto
-    ref typeof(this) opAssign(R)(R that) @trusted
+    ref typeof(this) opAssign(R)(R that)
     if (is(R == Array))
     {
         swap(this.data, that.data);
@@ -1669,3 +1682,14 @@ struct Array(T)
     Array!int v1;
     v1 = Array!int([5, 15, 8]);
 }
+
+// Postblit is safe
+@nogc nothrow pure @safe unittest
+{
+    auto array = Array!int(3);
+    void func(Array!int arg)
+    {
+        assert(arg.capacity == 3);
+    }
+    func(array);
+}

source/tanya/container/buffer.d

@@ -20,7 +20,6 @@ import tanya.meta.trait;
 version (unittest)
 {
     private int fillBuffer(ubyte[] buffer,
-                           in size_t size,
                            int start = 0,
                            int end = 10) @nogc pure nothrow
     in
@@ -165,7 +164,7 @@ struct ReadBuffer(T = ubyte)
     }
 
     ///
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         ReadBuffer!ubyte b;
         size_t numberRead;
@@ -173,7 +172,7 @@ struct ReadBuffer(T = ubyte)
         assert(b.free == 0);
 
         // Fills the buffer with values 0..10
-        numberRead = fillBuffer(b[], b.free, 0, 10);
+        numberRead = fillBuffer(b[], 0, 10);
         b += numberRead;
         assert(b.free == b.blockSize - numberRead);
         b.clear();
@@ -197,14 +196,14 @@ struct ReadBuffer(T = ubyte)
     }
 
     ///
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         ReadBuffer!ubyte b;
         size_t numberRead;
         ubyte[] result;
 
         // Fills the buffer with values 0..10
-        numberRead = fillBuffer(b[], b.free, 0, 10);
+        numberRead = fillBuffer(b[], 0, 10);
         b += numberRead;
 
         result = b[0 .. $];
@@ -214,10 +213,10 @@ struct ReadBuffer(T = ubyte)
         b.clear();
 
         // It shouldn't overwrite, but append another 5 bytes to the buffer
-        numberRead = fillBuffer(b[], b.free, 0, 10);
+        numberRead = fillBuffer(b[], 0, 10);
         b += numberRead;
 
-        numberRead = fillBuffer(b[], b.free, 20, 25);
+        numberRead = fillBuffer(b[], 20, 25);
         b += numberRead;
 
         result = b[0..$];
@@ -272,14 +271,14 @@ struct ReadBuffer(T = ubyte)
     }
 
     ///
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         ReadBuffer!ubyte b;
         size_t numberRead;
         ubyte[] result;
 
         // Fills the buffer with values 0..10
-        numberRead = fillBuffer(b[], b.free, 0, 10);
+        numberRead = fillBuffer(b[], 0, 10);
         b += numberRead;
 
         assert(b.length == 10);
@@ -399,7 +398,7 @@ struct WriteBuffer(T = ubyte)
     alias opDollar = length;
 
     ///
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         auto b = WriteBuffer!ubyte(4);
         ubyte[3] buf = [48, 23, 255];
@@ -571,7 +570,7 @@ struct WriteBuffer(T = ubyte)
     }
 
     ///
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         auto b = WriteBuffer!ubyte(6);
         ubyte[6] buf = [23, 23, 255, 128, 127, 9];
@@ -599,8 +598,6 @@ struct WriteBuffer(T = ubyte)
      */
     T[] opSlice(in size_t start, in size_t end)
     {
-        immutable internStart = this.start + start;
-
         if (position > ring || position < start) // Buffer overflowed
         {
             return buffer_[this.start .. ring + 1 - length + end];
@@ -612,7 +609,7 @@ struct WriteBuffer(T = ubyte)
     }
 
     ///
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         auto b = WriteBuffer!ubyte(6);
         ubyte[6] buf = [23, 23, 255, 128, 127, 9];
@@ -655,7 +652,7 @@ struct WriteBuffer(T = ubyte)
     static assert(is(typeof(WriteBuffer!int(5))));
 }
 
-@nogc nothrow pure unittest
+@nogc nothrow pure @system unittest
 {
     auto b = WriteBuffer!ubyte(4);
     ubyte[3] buf = [48, 23, 255];
@@ -677,7 +674,7 @@ struct WriteBuffer(T = ubyte)
         && b.buffer_[2] == 48 && b.buffer_[3] == 23 && b.buffer_[4] == 255);
 }
 
-@nogc nothrow pure unittest
+@nogc nothrow pure @system unittest
 {
     auto b = WriteBuffer!ubyte(2);
     ubyte[3] buf = [48, 23, 255];

source/tanya/container/entry.d

@@ -14,7 +14,11 @@
  */
 module tanya.container.entry;
 
+import tanya.algorithm.mutation;
+import tanya.container.array;
+import tanya.memory.allocator;
 import tanya.meta.trait;
+import tanya.meta.transform;
 import tanya.typecons;
 
 package struct SEntry(T)
@@ -35,17 +39,6 @@ package struct DEntry(T)
     DEntry* next, prev;
 }
 
-package struct HashEntry(K, V)
-{
-    this(ref K key, ref V value)
-    {
-        this.pair = Pair!(K, V)(key, value);
-    }
-
-    Pair!(K, V) pair;
-    HashEntry* next;
-}
-
 package enum BucketStatus : byte
 {
     deleted = -1,
@@ -53,56 +46,260 @@ package enum BucketStatus : byte
     used = 1,
 }
 
-package struct Bucket(T)
+package struct Bucket(K, V = void)
 {
-    @property void content(ref T content)
+    static if (is(V == void))
     {
-        this.content_ = content;
+        K key_;
+    }
+    else
+    {
+        alias KV = Tuple!(K, "key", V, "value");
+        KV kv;
+    }
+    BucketStatus status = BucketStatus.empty;
+
+    this(ref K key)
+    {
+        this.key = key;
+    }
+
+    @property void key(ref K key)
+    {
+        this.key() = key;
         this.status = BucketStatus.used;
     }
 
-    @property ref inout(T) content() inout
+    @property ref inout(K) key() inout
     {
-        return this.content_;
+        static if (is(V == void))
+        {
+            return this.key_;
+        }
+        else
+        {
+            return this.kv.key;
+        }
     }
 
-    bool opEquals(ref T content)
+    bool opEquals(ref inout(K) key) inout
     {
-        if (this.status == BucketStatus.used && this.content == content)
-        {
-            return true;
-        }
-        return false;
+        return this.status == BucketStatus.used && this.key == key;
     }
 
-    bool opEquals(ref const T content) const
+    bool opEquals(ref inout(typeof(this)) that) inout
     {
-        if (this.status == BucketStatus.used && this.content == content)
-        {
-            return true;
-        }
-        return false;
-    }
-
-    bool opEquals(ref typeof(this) that)
-    {
-        return this.content == that.content && this.status == that.status;
-    }
-
-    bool opEquals(ref typeof(this) that) const
-    {
-        return this.content == that.content && this.status == that.status;
+        return key == that.key && this.status == that.status;
     }
 
     void remove()
     {
-        static if (hasElaborateDestructor!T)
+        static if (hasElaborateDestructor!K)
         {
-            destroy(this.content);
+            destroy(key);
         }
         this.status = BucketStatus.deleted;
     }
-
-    T content_;
-    BucketStatus status = BucketStatus.empty;
+}
+
+// Possible sizes for the hash-based containers.
+package static immutable size_t[33] primes = [
+    0, 3, 7, 13, 23, 37, 53, 97, 193, 389, 769, 1543, 3079, 6151, 12289,
+    24593, 49157, 98317, 196613, 393241, 786433, 1572869, 3145739, 6291469,
+    12582917, 25165843, 50331653, 100663319, 201326611, 402653189,
+    805306457, 1610612741, 3221225473
+];
+
+package struct HashArray(alias hasher, K, V = void)
+{
+    alias Key = K;
+    alias Value = V;
+    alias Bucket = .Bucket!(Key, Value);
+    alias Buckets = Array!Bucket;
+
+    Buckets array;
+    size_t lengthIndex;
+    size_t length;
+
+    this(shared Allocator allocator)
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this.array = Buckets(allocator);
+    }
+
+    this(T)(ref T data, shared Allocator allocator)
+    if (is(Unqual!T == HashArray))
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this.array = Buckets(data.array, allocator);
+        this.lengthIndex = data.lengthIndex;
+        this.length = data.length;
+    }
+
+    // Move constructor
+    void move(ref HashArray data, shared Allocator allocator)
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this.array = Buckets(.move(data.array), allocator);
+        this.lengthIndex = data.lengthIndex;
+        this.length = data.length;
+    }
+
+    void swap(ref HashArray data)
+    {
+        .swap(this.array, data.array);
+        .swap(this.lengthIndex, data.lengthIndex);
+        .swap(this.length, data.length);
+    }
+
+    void opAssign(ref typeof(this) that)
+    {
+        this.array = that.array;
+        this.lengthIndex = that.lengthIndex;
+        this.length = that.length;
+    }
+
+    /*
+     * Returns bucket position for `hash`. `0` may mean the 0th position or an
+     * empty `buckets` array.
+     */
+    size_t locateBucket(ref const Key key) const
+    {
+        return this.array.length == 0
+             ? 0
+             : hasher(key) % primes[this.lengthIndex];
+    }
+
+    /*
+     * Inserts a key into an empty or deleted bucket. If the key is
+     * already in there, does nothing. Returns the bucket with the key.
+     */
+    ref Bucket insert(ref Key key)
+    {
+        while ((this.lengthIndex + 1) != primes.length)
+        {
+            foreach (ref e; this.array[locateBucket(key) .. $])
+            {
+                if (e == key)
+                {
+                    return e;
+                }
+                else if (e.status != BucketStatus.used)
+                {
+                    ++this.length;
+                    return e;
+                }
+            }
+
+            if (this.rehashToSize(this.lengthIndex + 1))
+            {
+                ++this.lengthIndex;
+            }
+        }
+        this.array.insertBack(Bucket(key));
+        return this.array[$ - 1];
+    }
+
+    // Takes an index in the primes array.
+    bool rehashToSize(const size_t n)
+    in
+    {
+        assert(n < primes.length);
+    }
+    do
+    {
+        auto storage = typeof(this.array)(primes[n], this.array.allocator);
+        DataLoop: foreach (ref e1; this.array[])
+        {
+            if (e1.status == BucketStatus.used)
+            {
+                auto bucketPosition = hasher(e1.key) % primes[n];
+
+                foreach (ref e2; storage[bucketPosition .. $])
+                {
+                    if (e2.status != BucketStatus.used) // Insert the key
+                    {
+                        e2 = e1;
+                        continue DataLoop;
+                    }
+                }
+                return false; // Rehashing failed.
+            }
+        }
+        .move(storage, this.array);
+        return true;
+    }
+
+    void rehash(const size_t n)
+    {
+        size_t lengthIndex;
+        for (; lengthIndex < primes.length; ++lengthIndex)
+        {
+            if (primes[lengthIndex] >= n)
+            {
+                break;
+            }
+        }
+        if (this.rehashToSize(lengthIndex))
+        {
+            this.lengthIndex = lengthIndex;
+        }
+    }
+
+    @property size_t capacity() const
+    {
+        return this.array.length;
+    }
+
+    void clear()
+    {
+        this.array.clear();
+        this.length = 0;
+    }
+
+    size_t remove(ref Key key)
+    {
+        foreach (ref e; this.array[locateBucket(key) .. $])
+        {
+            if (e == key) // Found.
+            {
+                e.remove();
+                --this.length;
+                return 1;
+            }
+            else if (e.status == BucketStatus.empty)
+            {
+                break;
+            }
+        }
+        return 0;
+    }
+
+    bool opBinaryRight(string op : "in")(ref inout(Key) key) inout
+    {
+        foreach (ref e; this.array[locateBucket(key) .. $])
+        {
+            if (e == key) // Found.
+            {
+                return true;
+            }
+            else if (e.status == BucketStatus.empty)
+            {
+                break;
+            }
+        }
+        return false;
+    }
 }

source/tanya/container/hashtable.d

@@ -0,0 +1,775 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/**
+ * Hash table.
+ *
+ * Copyright: Eugene Wissner 2018.
+ * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
+ *                  Mozilla Public License, v. 2.0).
+ * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)
+ * Source: $(LINK2 https://github.com/caraus-ecms/tanya/blob/master/source/tanya/container/hashtable.d,
+ *                 tanya/container/hashtable.d)
+ */
+module tanya.container.hashtable;
+
+import tanya.container.array;
+import tanya.container.entry;
+import tanya.hash.lookup;
+import tanya.memory;
+import tanya.meta.trait;
+import tanya.meta.transform;
+import tanya.range.primitive;
+
+/**
+ * Bidirectional range whose element type is a tuple of a key and the
+ * respective value.
+ *
+ * Params:
+ *  T = Type of the internal hash storage.
+ */
+struct Range(T)
+{
+    private alias KV = CopyConstness!(T, T.Bucket.KV);
+    static if (isMutable!T)
+    {
+        private alias DataRange = T.array.Range;
+    }
+    else
+    {
+        private alias DataRange = T.array.ConstRange;
+    }
+    private DataRange dataRange;
+
+    @disable this();
+
+    private this(DataRange dataRange)
+    {
+        while (!dataRange.empty && dataRange.front.status != BucketStatus.used)
+        {
+            dataRange.popFront();
+        }
+        while (!dataRange.empty && dataRange.back.status != BucketStatus.used)
+        {
+            dataRange.popBack();
+        }
+        this.dataRange = dataRange;
+    }
+
+    @property Range save()
+    {
+        return this;
+    }
+
+    @property bool empty() const
+    {
+        return this.dataRange.empty();
+    }
+
+    @property void popFront()
+    in
+    {
+        assert(!empty);
+        assert(this.dataRange.front.status == BucketStatus.used);
+    }
+    out
+    {
+        assert(empty || this.dataRange.back.status == BucketStatus.used);
+    }
+    do
+    {
+        do
+        {
+            this.dataRange.popFront();
+        }
+        while (!empty && dataRange.front.status != BucketStatus.used);
+    }
+
+    @property void popBack()
+    in
+    {
+        assert(!empty);
+        assert(this.dataRange.back.status == BucketStatus.used);
+    }
+    out
+    {
+        assert(empty || this.dataRange.back.status == BucketStatus.used);
+    }
+    do
+    {
+        do
+        {
+            this.dataRange.popBack();
+        }
+        while (!empty && dataRange.back.status != BucketStatus.used);
+    }
+
+    @property ref inout(KV) front() inout
+    in
+    {
+        assert(!empty);
+        assert(this.dataRange.front.status == BucketStatus.used);
+    }
+    do
+    {
+        return this.dataRange.front.kv;
+    }
+
+    @property ref inout(KV) back() inout
+    in
+    {
+        assert(!empty);
+        assert(this.dataRange.back.status == BucketStatus.used);
+    }
+    do
+    {
+        return this.dataRange.back.kv;
+    }
+
+    Range opIndex()
+    {
+        return typeof(return)(this.dataRange[]);
+    }
+
+    Range!(const T) opIndex() const
+    {
+        return typeof(return)(this.dataRange[]);
+    }
+}
+
+/**
+ * Hash table is a data structure that stores pairs of keys and values without
+ * any particular order.
+ *
+ * This $(D_PSYMBOL HashTable) is implemented using closed hashing. Hash
+ * collisions are resolved with linear probing.
+ *
+ * $(D_PARAM Key) should be hashable with $(D_PARAM hasher). $(D_PARAM hasher)
+ * is a callable that accepts an argument of type $(D_PARAM Key) and returns a
+ * hash value for it ($(D_KEYWORD size_t)).
+ *
+ * Params:
+ *  Key    = Key type.
+ *  Value  = Value type.
+ *  hasher = Hash function for $(D_PARAM Key).
+ */
+struct HashTable(Key, Value, alias hasher = hash)
+if (is(typeof(hasher(Key.init)) == size_t))
+{
+    private alias HashArray = .HashArray!(hasher, Key, Value);
+    private alias Buckets = HashArray.Buckets;
+
+    private HashArray data;
+
+    /// Type of the key-value pair stored in the hash table.
+    alias KeyValue = HashArray.Bucket.KV;
+
+    /// The range types for $(D_PSYMBOL HashTable).
+    alias Range = .Range!HashArray;
+
+    /// ditto
+    alias ConstRange = .Range!(const HashArray);
+
+    invariant
+    {
+        assert(this.data.lengthIndex < primes.length);
+        assert(this.data.array.length == 0
+            || this.data.array.length == primes[this.data.lengthIndex]);
+    }
+
+    /**
+     * Constructor.
+     *
+     * Params:
+     *  n         = Minimum number of buckets.
+     *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
+     */
+    this(size_t n, shared Allocator allocator = defaultAllocator)
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this(allocator);
+        this.data.rehash(n);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        auto hashTable = HashTable!(string, int)(5);
+        assert(hashTable.capacity == 7);
+    }
+
+    /// ditto
+    this(shared Allocator allocator)
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this.data = HashArray(allocator);
+    }
+
+    /**
+     * Initializes this $(D_PARAM HashTable) from another one.
+     *
+     * If $(D_PARAM init) is passed by reference, it will be copied.
+     * If $(D_PARAM init) is passed by value, it will be moved.
+     *
+     * Params:
+     *  S         = Source set type.
+     *  init      = Source set.
+     *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
+     */
+    this(S)(ref S init, shared Allocator allocator = defaultAllocator)
+    if (is(Unqual!S == HashTable))
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this.data = HashArray(init.data, allocator);
+    }
+
+    /// ditto
+    this(S)(S init, shared Allocator allocator = defaultAllocator)
+    if (is(S == HashTable))
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this.data.move(init.data, allocator);
+    }
+
+    /**
+     * Constructs the hash table from a forward range.
+     *
+     * Params:
+     *  R         = Range type.
+     *  range     = Forward range.
+     *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
+     */
+    this(R)(R range, shared Allocator allocator = defaultAllocator)
+    if (isForwardRange!R && is(ElementType!R == KeyValue))
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        this(allocator);
+        insert(range);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        alias KeyValue = HashTable!(string, int).KeyValue;
+
+        KeyValue[2] range = [KeyValue("one", 1), KeyValue("two", 2)];
+        auto hashTable = HashTable!(string, int)(range[]);
+
+        assert(hashTable["one"] == 1);
+        assert(hashTable["two"] == 2);
+    }
+
+    /**
+     * Initializes the hash table from a static array.
+     *
+     * Params:
+     *  n         = Array size.
+     *  array     = Static array.
+     *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
+     */
+    this(size_t n)(KeyValue[n] array,
+         shared Allocator allocator = defaultAllocator)
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        insert(array[]);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        alias KeyValue = HashTable!(string, int).KeyValue;
+        auto hashTable = HashTable!(string, int)([KeyValue("one", 1), KeyValue("two", 2)]);
+
+        assert(hashTable["one"] == 1);
+        assert(hashTable["two"] == 2);
+    }
+
+    /**
+     * Assigns another hash table.
+     *
+     * If $(D_PARAM that) is passed by reference, it will be copied.
+     * If $(D_PARAM that) is passed by value, it will be moved.
+     *
+     * Params:
+     *  S    = Content type.
+     *  that = The value should be assigned.
+     *
+     * Returns: $(D_KEYWORD this).
+     */
+    ref typeof(this) opAssign(S)(ref S that)
+    if (is(Unqual!S == HashTable))
+    {
+        this.data = that.data;
+        return this;
+    }
+
+    /// ditto
+    ref typeof(this) opAssign(S)(S that) @trusted
+    if (is(S == HashTable))
+    {
+        this.data.swap(that.data);
+        return this;
+    }
+
+    /**
+     * Returns: Used allocator.
+     *
+     * Postcondition: $(D_INLINECODE allocator !is null)
+     */
+    @property shared(Allocator) allocator() const
+    out (allocator)
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        return this.data.array.allocator;
+    }
+
+    /**
+     * Maximum amount of elements this $(D_PSYMBOL HashTable) can hold without
+     * resizing and rehashing. Note that it doesn't mean that the
+     * $(D_PSYMBOL Set) will hold $(I exactly) $(D_PSYMBOL capacity) elements.
+     * $(D_PSYMBOL capacity) tells the size of the container under a best-case
+     * distribution of elements.
+     *
+     * Returns: $(D_PSYMBOL HashTable) capacity.
+     */
+    @property size_t capacity() const
+    {
+        return this.data.capacity;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        assert(hashTable.capacity == 0);
+
+        hashTable["eight"] = 8;
+        assert(hashTable.capacity == 3);
+    }
+
+    /**
+     * Returns the number of elements in the container.
+     *
+     * Returns: The number of elements in the container.
+     */
+    @property size_t length() const
+    {
+        return this.data.length;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        assert(hashTable.length == 0);
+
+        hashTable["eight"] = 8;
+        assert(hashTable.length == 1);
+    }
+
+    /**
+     * Tells whether the container contains any elements.
+     *
+     * Returns: Whether the container is empty.
+     */
+    @property bool empty() const
+    {
+        return length == 0;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        assert(hashTable.empty);
+        hashTable["five"] = 5;
+        assert(!hashTable.empty);
+    }
+
+    /**
+     * Removes all elements.
+     */
+    void clear()
+    {
+        this.data.clear();
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        hashTable["five"] = 5;
+        assert(!hashTable.empty);
+        hashTable.clear();
+        assert(hashTable.empty);
+    }
+
+    /// The maximum number of buckets the container can have.
+    enum size_t maxBucketCount = primes[$ - 1];
+
+    /**
+     * Inserts a new value at $(D_PARAM key) or reassigns the element if
+     * $(D_PARAM key) already exists in the hash table.
+     *
+     * Params:
+     *  key   = The key to insert the value at.
+     *  value = The value to be inserted.
+     *
+     * Returns: Just inserted element.
+     */
+    ref Value opIndexAssign(Value value, Key key)
+    {
+        auto e = ((ref v) @trusted => &this.data.insert(v))(key);
+        if (e.status != BucketStatus.used)
+        {
+            e.key = key;
+        }
+        return e.kv.value = value;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        assert("Pachycephalosaurus" !in hashTable);
+
+        hashTable["Pachycephalosaurus"] = 6;
+        assert(hashTable.length == 1);
+        assert("Pachycephalosaurus" in hashTable);
+
+        hashTable["Pachycephalosaurus"] = 6;
+        assert(hashTable.length == 1);
+        assert("Pachycephalosaurus" in hashTable);
+    }
+
+    /**
+     * Inserts a new element in the hash table.
+     *
+     * If the element with the same key was already in the table, it reassigns
+     * it with the new value, but $(D_PSYMBOL insert) returns `0`. Otherwise
+     * `1` is returned.
+     *
+     * Params:
+     *  keyValue = Key/value pair.
+     *
+     * Returns: The number of the inserted elements with a unique key.
+     */
+    size_t insert(KeyValue keyValue)
+    {
+        auto e = ((ref v) @trusted => &this.data.insert(v))(keyValue.key);
+        size_t inserted;
+        if (e.status != BucketStatus.used)
+        {
+            e.key = keyValue.key;
+            inserted = 1;
+        }
+        e.kv.value = keyValue.value;
+        return inserted;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+
+        assert(hashTable.insert(hashTable.KeyValue("number", 1)) == 1);
+        assert(hashTable["number"] == 1);
+        assert(hashTable.insert(hashTable.KeyValue("number", 2)) == 0);
+        assert(hashTable["number"] == 2);
+    }
+
+    /**
+     * Inserts a forward range of key/value pairs into the hash table.
+     *
+     * If some of the elements in the $(D_PARAM range) have the same key, they
+     * are reassigned but are not counted as inserted elements. So the value
+     * returned by this function will be less than the range length.
+     *
+     * Params:
+     *  R     = Range type.
+     *  range = Forward range.
+     *
+     * Returns: The number of the inserted elements with a unique key.
+     */
+    size_t insert(R)(R range)
+    if (isForwardRange!R && is(ElementType!R == KeyValue))
+    {
+        size_t count;
+        foreach (e; range)
+        {
+            count += insert(e);
+        }
+        return count;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+
+        hashTable.KeyValue[2] range = [
+            hashTable.KeyValue("one", 1),
+            hashTable.KeyValue("two", 2),
+        ];
+
+        assert(hashTable.insert(range[]) == 2);
+        assert(hashTable["one"] == 1);
+        assert(hashTable["two"] == 2);
+    }
+
+    /**
+     * Find the element with the key $(D_PARAM key).
+     *
+     * Params:
+     *  key = The key to be find.
+     *
+     * Returns: The value associated with $(D_PARAM key).
+     *
+     * Precondition: Element with $(D_PARAM key) is in this hash table.
+     */
+    ref Value opIndex(Key key)
+    {
+        const code = this.data.locateBucket(key);
+
+        for (auto range = this.data.array[code .. $]; !range.empty; range.popFront())
+        {
+            if (key == range.front.key)
+            {
+                return range.front.kv.value;
+            }
+        }
+        assert(false, "Range violation");
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        hashTable["Triceratops"] = 7;
+        assert(hashTable["Triceratops"] == 7);
+    }
+
+    /**
+     * Removes the element with the key $(D_PARAM key).
+     *
+     * The method returns the number of elements removed. Since
+     * the hash table contains only unique keys, $(D_PARAM remove) always
+     * returns `1` if an element with the $(D_PARAM key) was found, `0`
+     * otherwise.
+     *
+     * Params:
+     *  key = The key to be removed.
+     *
+     * Returns: Number of the removed elements.
+     */
+    size_t remove(Key key)
+    {
+        return this.data.remove(key);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        hashTable["Euoplocephalus"] = 6;
+
+        assert("Euoplocephalus" in hashTable);
+        assert(hashTable.remove("Euoplocephalus") == 1);
+        assert(hashTable.remove("Euoplocephalus") == 0);
+        assert("Euoplocephalus" !in hashTable);
+    }
+
+    /**
+     * Looks for $(D_PARAM key) in this hash table.
+     *
+     * Params:
+     *  key = The key to look for.
+     *
+     * Returns: $(D_KEYWORD true) if $(D_PARAM key) exists in the hash table,
+     *          $(D_KEYWORD false) otherwise.
+     */
+    bool opBinaryRight(string op : "in")(auto ref inout(Key) key) inout
+    {
+        return key in this.data;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+
+        assert("Shantungosaurus" !in hashTable);
+        hashTable["Shantungosaurus"] = 15;
+        assert("Shantungosaurus" in hashTable);
+
+        assert("Ceratopsia" !in hashTable);
+    }
+
+    /**
+     * Sets the number of buckets in the container to at least $(D_PARAM n)
+     * and rearranges all the elements according to their hash values.
+     *
+     * If $(D_PARAM n) is greater than the current $(D_PSYMBOL capacity)
+     * and lower than or equal to $(D_PSYMBOL maxBucketCount), a rehash is
+     * forced.
+     *
+     * If $(D_PARAM n) is greater than $(D_PSYMBOL maxBucketCount),
+     * $(D_PSYMBOL maxBucketCount) is used instead as a new number of buckets.
+     *
+     * If $(D_PARAM n) is equal to the current $(D_PSYMBOL capacity), rehashing
+     * is forced without resizing the container.
+     *
+     * If $(D_PARAM n) is lower than the current $(D_PSYMBOL capacity), the
+     * function may have no effect.
+     *
+     * Rehashing is automatically performed whenever the container needs space
+     * to insert new elements.
+     *
+     * Params:
+     *  n = Minimum number of buckets.
+     */
+    void rehash(size_t n)
+    {
+        this.data.rehash(n);
+    }
+
+    /**
+     * Returns a bidirectional range whose element type is a tuple of a key and
+     * the respective value.
+     *
+     * Returns: A bidirectional range that iterates over the container.
+     */
+    Range opIndex()
+    {
+        return typeof(return)(this.data.array[]);
+    }
+
+    /// ditto
+    ConstRange opIndex() const
+    {
+        return typeof(return)(this.data.array[]);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        HashTable!(string, int) hashTable;
+        assert(hashTable[].empty);
+
+        hashTable["Iguanodon"] = 9;
+        assert(!hashTable[].empty);
+        assert(hashTable[].front == hashTable.KeyValue("Iguanodon", 9));
+        assert(hashTable[].back == hashTable.KeyValue("Iguanodon", 9));
+    }
+}
+
+@nogc nothrow pure @safe unittest
+{
+    auto dinos = HashTable!(string, int)(17);
+    assert(dinos.empty);
+
+    dinos["Ornithominus"] = 4;
+    dinos["Tyrannosaurus"] = 12;
+    dinos["Deinonychus"] = 3;
+    dinos["Stegosaurus"] = 6;
+    dinos["Brachiosaurus"] = 25;
+
+    assert(dinos.length == 5);
+    assert(dinos["Ornithominus"] == 4);
+    assert(dinos["Stegosaurus"] == 6);
+    assert(dinos["Deinonychus"] == 3);
+    assert(dinos["Tyrannosaurus"] == 12);
+    assert(dinos["Brachiosaurus"] == 25);
+
+    dinos.clear();
+    assert(dinos.empty);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    import tanya.range.primitive : isForwardRange;
+    static assert(is(HashTable!(string, int) a));
+    static assert(is(const HashTable!(string, int)));
+    static assert(isForwardRange!(HashTable!(string, int).Range));
+}
+
+// Constructs by reference
+@nogc nothrow pure @safe unittest
+{
+    auto hashTable1 = HashTable!(string, int)(7);
+    auto hashTable2 = HashTable!(string, int)(hashTable1);
+    assert(hashTable1.length == hashTable2.length);
+    assert(hashTable1.capacity == hashTable2.capacity);
+}
+
+// Constructs by value
+@nogc nothrow pure @safe unittest
+{
+    auto hashTable = HashTable!(string, int)(HashTable!(string, int)(7));
+    assert(hashTable.capacity == 7);
+}
+
+// Assigns by reference
+@nogc nothrow pure @safe unittest
+{
+    auto hashTable1 = HashTable!(string, int)(7);
+    HashTable!(string, int) hashTable2;
+    hashTable1 = hashTable2;
+    assert(hashTable1.length == hashTable2.length);
+    assert(hashTable1.capacity == hashTable2.capacity);
+}
+
+// Assigns by value
+@nogc nothrow pure @safe unittest
+{
+    HashTable!(string, int) hashTable;
+    hashTable = HashTable!(string, int)(7);
+    assert(hashTable.capacity == 7);
+}
+
+// Postblit copies
+@nogc nothrow pure @safe unittest
+{
+    auto hashTable = HashTable!(string, int)(7);
+    void testFunc(HashTable!(string, int) hashTable)
+    {
+        assert(hashTable.capacity == 7);
+    }
+    testFunc(hashTable);
+}

source/tanya/container/list.d

@@ -15,8 +15,9 @@
  */
 module tanya.container.list;
 
-import std.algorithm.comparison;
+import std.algorithm.comparison : equal;
 import std.algorithm.searching;
+import tanya.algorithm.comparison;
 import tanya.algorithm.mutation;
 import tanya.container.entry;
 import tanya.memory;
@@ -435,9 +436,9 @@ struct SList(T)
         assert(l2.front == 9);
     }
 
-    version (assert)
-    {
     private bool checkRangeBelonging(ref const Range r) const
+    {
+        version (assert)
         {
             const(Entry)* pos = this.head;
             for (; pos !is *r.head && pos !is null; pos = pos.next)
@@ -445,6 +446,10 @@ struct SList(T)
             }
             return pos is *r.head;
         }
+        else
+        {
+            return true;
+        }
     }
 
     /**
@@ -1602,9 +1607,9 @@ struct DList(T)
     /// ditto
     alias insert = insertBack;
 
-    version (assert)
-    {
     private bool checkRangeBelonging(ref const Range r) const
+    {
+        version (assert)
         {
             const(Entry)* pos = this.head;
             for (; pos !is *r.head && pos !is null; pos = pos.next)
@@ -1612,6 +1617,10 @@ struct DList(T)
             }
             return pos is *r.head;
         }
+        else
+        {
+            return true;
+        }
     }
 
     /**

source/tanya/container/package.d

@@ -16,8 +16,8 @@ module tanya.container;
 
 public import tanya.container.array;
 public import tanya.container.buffer;
+public import tanya.container.hashtable;
 public import tanya.container.list;
-public import tanya.container.queue;
 public import tanya.container.set;
 public import tanya.container.string;
 
@@ -25,6 +25,7 @@ public import tanya.container.string;
  * Thrown if $(D_PSYMBOL Set) cannot insert a new element because the container
  * is full.
  */
+deprecated
 class HashContainerFullException : Exception
 {
     /**
@@ -37,7 +38,7 @@ class HashContainerFullException : Exception
     this(string msg,
          string file = __FILE__,
          size_t line = __LINE__,
-         Throwable next = null) @nogc @safe pure nothrow
+         Throwable next = null) @nogc nothrow pure @safe
     {
         super(msg, file, line, next);
     }

source/tanya/container/queue.d

@@ -1,291 +0,0 @@
-/* This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
-
-/**
- * FIFO queue.
- *
- * Copyright: Eugene Wissner 2016-2018.
- * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
- *                  Mozilla Public License, v. 2.0).
- * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)
- * Source: $(LINK2 https://github.com/caraus-ecms/tanya/blob/master/source/tanya/container/queue.d,
- *                 tanya/container/queue.d)
- */
-deprecated("Use tanya.container.list.DList instead")
-module tanya.container.queue;
-
-import tanya.algorithm.mutation;
-import tanya.container.entry;
-import tanya.exception;
-import tanya.memory;
-import tanya.meta.trait;
-
-/**
- * FIFO queue.
- *
- * Params:
- *  T = Content type.
- */
-struct Queue(T)
-{
-    /**
-     * Removes all elements from the queue.
-     */
-    ~this()
-    {
-        while (!empty)
-        {
-            dequeue();
-        }
-    }
-
-    /**
-     * Returns how many elements are in the queue. It iterates through the queue
-     * to count the elements.
-     *
-     * Returns: How many elements are in the queue.
-     */
-    size_t length() const
-    {
-        size_t len;
-        for (const(SEntry!T)* i = first; i !is null; i = i.next)
-        {
-            ++len;
-        }
-        return len;
-    }
-
-    ///
-    unittest
-    {
-        Queue!int q;
-
-        assert(q.length == 0);
-        q.enqueue(5);
-        assert(q.length == 1);
-        q.enqueue(4);
-        assert(q.length == 2);
-        q.enqueue(9);
-        assert(q.length == 3);
-
-        q.dequeue();
-        assert(q.length == 2);
-        q.dequeue();
-        assert(q.length == 1);
-        q.dequeue();
-        assert(q.length == 0);
-    }
-
-    private void enqueueEntry(ref SEntry!T* entry)
-    {
-        if (empty)
-        {
-            first = rear = entry;
-        }
-        else
-        {
-            rear.next = entry;
-            rear = rear.next;
-        }
-    }
-
-    private SEntry!T* allocateEntry()
-    {
-        auto temp = cast(SEntry!T*) allocator.allocate(SEntry!T.sizeof);
-        if (temp is null)
-        {
-            onOutOfMemoryError();
-        }
-        return temp;
-    }
-
-    /**
-     * Inserts a new element.
-     *
-     * Params:
-     *  x = New element.
-     */
-    void enqueue(ref T x)
-    {
-        auto temp = allocateEntry();
-
-        *temp = SEntry!T.init;
-        temp.content = x;
-
-        enqueueEntry(temp);
-    }
-
-    /// ditto
-    void enqueue(T x)
-    {
-        auto temp = allocateEntry();
-
-        moveEmplace(x, (*temp).content);
-        (*temp).next = null;
-
-        enqueueEntry(temp);
-    }
-
-    ///
-    unittest
-    {
-        Queue!int q;
-
-        assert(q.empty);
-        q.enqueue(8);
-        q.enqueue(9);
-        assert(q.dequeue() == 8);
-        assert(q.dequeue() == 9);
-    }
-
-    /**
-     * Returns: $(D_KEYWORD true) if the queue is empty.
-     */
-    @property bool empty() const
-    {
-        return first is null;
-    }
-
-    ///
-    unittest
-    {
-        Queue!int q;
-        int value = 7;
-
-        assert(q.empty);
-        q.enqueue(value);
-        assert(!q.empty);
-    }
-
-    /**
-     * Move the position to the next element.
-     *
-     * Returns: Dequeued element.
-     */
-    T dequeue()
-    in
-    {
-        assert(!empty);
-    }
-    do
-    {
-        auto n = first.next;
-        T ret = move(first.content);
-
-        allocator.dispose(first);
-        first = n;
-        return ret;
-    }
-
-    ///
-    unittest
-    {
-        Queue!int q;
-
-        q.enqueue(8);
-        q.enqueue(9);
-        assert(q.dequeue() == 8);
-        assert(q.dequeue() == 9);
-    }
-
-    /**
-     * $(D_KEYWORD foreach) iteration. The elements will be automatically
-     * dequeued.
-     *
-     * Params:
-     *  dg = $(D_KEYWORD foreach) body.
-     *
-     * Returns: The value returned from $(D_PARAM dg).
-     */
-    int opApply(scope int delegate(ref size_t i, ref T) @nogc dg)
-    {
-        int result;
-
-        for (size_t i; !empty; ++i)
-        {
-            auto e = dequeue();
-            if ((result = dg(i, e)) != 0)
-            {
-                return result;
-            }
-        }
-        return result;
-    }
-
-    /// ditto
-    int opApply(scope int delegate(ref T) @nogc dg)
-    {
-        int result;
-
-        while (!empty)
-        {
-            auto e = dequeue();
-            if ((result = dg(e)) != 0)
-            {
-                return result;
-            }
-        }
-        return result;
-    }
-
-    ///
-    unittest
-    {
-        Queue!int q;
-
-        size_t j;
-        q.enqueue(5);
-        q.enqueue(4);
-        q.enqueue(9);
-        foreach (i, e; q)
-        {
-            assert(i != 2 || e == 9);
-            assert(i != 1 || e == 4);
-            assert(i != 0 || e == 5);
-            ++j;
-        }
-        assert(j == 3);
-        assert(q.empty);
-
-        j = 0;
-        q.enqueue(5);
-        q.enqueue(4);
-        q.enqueue(9);
-        foreach (e; q)
-        {
-            assert(j != 2 || e == 9);
-            assert(j != 1 || e == 4);
-            assert(j != 0 || e == 5);
-            ++j;
-        }
-        assert(j == 3);
-        assert(q.empty);
-    }
-
-    private SEntry!T* first;
-    private SEntry!T* rear;
-
-    mixin DefaultAllocator;
-}
-
-///
-unittest
-{
-    Queue!int q;
-
-    q.enqueue(5);
-    assert(!q.empty);
-
-    q.enqueue(4);
-    q.enqueue(9);
-
-    assert(q.dequeue() == 5);
-
-    foreach (i, ref e; q)
-    {
-        assert(i != 0 || e == 4);
-        assert(i != 1 || e == 9);
-    }
-    assert(q.empty);
-}

source/tanya/container/set.d

@@ -16,27 +16,30 @@
 module tanya.container.set;
 
 import tanya.algorithm.mutation;
-import tanya.container;
+import tanya.container.array;
 import tanya.container.entry;
+import tanya.hash.lookup;
 import tanya.memory;
 import tanya.meta.trait;
 import tanya.meta.transform;
+import tanya.range.primitive;
 
 /**
  * Bidirectional range that iterates over the $(D_PSYMBOL Set)'s values.
  *
  * Params:
- *  E = Element type.
+ *  T = Type of the internal hash storage.
  */
-struct Range(E)
+struct Range(T)
 {
-    static if (isMutable!E)
+    private alias E = CopyConstness!(T, T.Key);
+    static if (isMutable!T)
     {
-        private alias DataRange = Array!(Bucket!(Unqual!E)).Range;
+        private alias DataRange = T.array.Range;
     }
     else
     {
-        private alias DataRange = Array!(Bucket!(Unqual!E)).ConstRange;
+        private alias DataRange = T.array.ConstRange;
     }
     private DataRange dataRange;
 
@@ -68,63 +71,61 @@ struct Range(E)
     @property void popFront()
     in
     {
-        assert(!this.dataRange.empty);
+        assert(!empty);
         assert(this.dataRange.front.status == BucketStatus.used);
     }
     out
     {
-        assert(this.dataRange.empty
-            || this.dataRange.back.status == BucketStatus.used);
+        assert(empty || this.dataRange.back.status == BucketStatus.used);
     }
     do
     {
         do
         {
-            dataRange.popFront();
+            this.dataRange.popFront();
         }
-        while (!dataRange.empty && dataRange.front.status != BucketStatus.used);
+        while (!empty && dataRange.front.status != BucketStatus.used);
     }
 
     @property void popBack()
     in
     {
-        assert(!this.dataRange.empty);
+        assert(!empty);
         assert(this.dataRange.back.status == BucketStatus.used);
     }
     out
     {
-        assert(this.dataRange.empty
-            || this.dataRange.back.status == BucketStatus.used);
+        assert(empty || this.dataRange.back.status == BucketStatus.used);
     }
     do
     {
         do
         {
-            dataRange.popBack();
+            this.dataRange.popBack();
         }
-        while (!dataRange.empty && dataRange.back.status != BucketStatus.used);
+        while (!empty && dataRange.back.status != BucketStatus.used);
     }
 
     @property ref inout(E) front() inout
     in
     {
-        assert(!this.dataRange.empty);
+        assert(!empty);
         assert(this.dataRange.front.status == BucketStatus.used);
     }
     do
     {
-        return dataRange.front.content;
+        return this.dataRange.front.key;
     }
 
     @property ref inout(E) back() inout
     in
     {
-        assert(!this.dataRange.empty);
+        assert(!empty);
         assert(this.dataRange.back.status == BucketStatus.used);
     }
     do
     {
-        return dataRange.back.content;
+        return this.dataRange.back.key;
     }
 
     Range opIndex()
@@ -132,7 +133,7 @@ struct Range(E)
         return typeof(return)(this.dataRange[]);
     }
 
-    Range!(const E) opIndex() const
+    Range!(const T) opIndex() const
     {
         return typeof(return)(this.dataRange[]);
     }
@@ -145,25 +146,33 @@ struct Range(E)
  * This $(D_PSYMBOL Set) is implemented using closed hashing. Hash collisions
  * are resolved with linear probing.
  *
- * Currently works only with integral types.
+ * $(D_PARAM T) should be hashable with $(D_PARAM hasher). $(D_PARAM hasher) is
+ * a callable that accepts an argument of type $(D_PARAM T) and returns a hash
+ * value for it ($(D_KEYWORD size_t)).
  *
  * Params:
  *  T      = Element type.
+ *  hasher = Hash function for $(D_PARAM T).
  */
-struct Set(T)
-    if (isIntegral!T || is(Unqual!T == bool))
+struct Set(T, alias hasher = hash)
+if (is(typeof(hasher(T.init)) == size_t))
 {
+    private alias HashArray = .HashArray!(hasher, T);
+    private alias Buckets = HashArray.Buckets;
+
+    private HashArray data;
+
     /// The range types for $(D_PSYMBOL Set).
-    alias Range = .Range!T;
+    alias Range = .Range!HashArray;
 
     /// ditto
-    alias ConstRange = .Range!(const T);
+    alias ConstRange = .Range!(const HashArray);
 
     invariant
     {
-        assert(this.lengthIndex < primes.length);
-        assert(this.data.length == 0
-            || this.data.length == primes[this.lengthIndex]);
+        assert(this.data.lengthIndex < primes.length);
+        assert(this.data.array.length == 0
+            || this.data.array.length == primes[this.data.lengthIndex]);
     }
 
     /**
@@ -175,7 +184,7 @@ struct Set(T)
      *
      * Precondition: $(D_INLINECODE allocator !is null).
      */
-    this(const size_t n, shared Allocator allocator = defaultAllocator)
+    this(size_t n, shared Allocator allocator = defaultAllocator)
     in
     {
         assert(allocator !is null);
@@ -183,7 +192,14 @@ struct Set(T)
     do
     {
         this(allocator);
-        rehash(n);
+        this.data.rehash(n);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        auto set = Set!int(5);
+        assert(set.capacity == 7);
     }
 
     /// ditto
@@ -194,20 +210,7 @@ struct Set(T)
     }
     do
     {
-        this.data = typeof(this.data)(allocator);
-    }
-
-    ///
-    unittest
-    {
-        {
-            auto set = Set!int(defaultAllocator);
-            assert(set.capacity == 0);
-        }
-        {
-            auto set = Set!int(8);
-            assert(set.capacity == 13);
-        }
+        this.data = HashArray(allocator);
     }
 
     /**
@@ -220,6 +223,8 @@ struct Set(T)
      *  S         = Source set type.
      *  init      = Source set.
      *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
      */
     this(S)(ref S init, shared Allocator allocator = defaultAllocator)
     if (is(Unqual!S == Set))
@@ -229,7 +234,7 @@ struct Set(T)
     }
     do
     {
-        this.data = typeof(this.data)(init.data, allocator);
+        this.data = HashArray(init.data, allocator);
     }
 
     /// ditto
@@ -241,9 +246,67 @@ struct Set(T)
     }
     do
     {
-        this.data = typeof(this.data)(move(init.data), allocator);
-        this.lengthIndex = init.lengthIndex;
-        init.lengthIndex = 0;
+        this.data.move(init.data, allocator);
+    }
+
+    /**
+     * Initializes the set from a forward range.
+     *
+     * Params:
+     *  R         = Range type.
+     *  range     = Forward range.
+     *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
+     */
+    this(R)(R range, shared Allocator allocator = defaultAllocator)
+    if (isForwardRange!R && isImplicitlyConvertible!(ElementType!R, T))
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        insert(range);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        int[2] range = [1, 2];
+        Set!int set = Set!int(range[]);
+
+        assert(1 in set);
+        assert(2 in set);
+    }
+
+    /**
+     * Initializes the set from a static array.
+     *
+     * Params:
+     *  n         = Array size.
+     *  array     = Static array.
+     *  allocator = Allocator.
+     *
+     * Precondition: $(D_INLINECODE allocator !is null).
+     */
+    this(size_t n)(T[n] array, shared Allocator allocator = defaultAllocator)
+    in
+    {
+        assert(allocator !is null);
+    }
+    do
+    {
+        insert(array[]);
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        Set!int set = Set!int([1, 2]);
+
+        assert(1 in set);
+        assert(2 in set);
     }
 
     /**
@@ -262,7 +325,6 @@ struct Set(T)
     if (is(Unqual!S == Set))
     {
         this.data = that.data;
-        this.lengthIndex = that.lengthIndex;
         return this;
     }
 
@@ -270,8 +332,7 @@ struct Set(T)
     ref typeof(this) opAssign(S)(S that) @trusted
     if (is(S == Set))
     {
-        swap(this.data, that.data);
-        swap(this.lengthIndex, that.lengthIndex);
+        this.data.swap(that.data);
         return this;
     }
 
@@ -287,7 +348,7 @@ struct Set(T)
     }
     do
     {
-        return cast(shared Allocator) this.data.allocator;
+        return this.data.array.allocator;
     }
 
     /**
@@ -301,11 +362,11 @@ struct Set(T)
      */
     @property size_t capacity() const
     {
-        return this.data.length;
+        return this.data.capacity;
     }
 
     ///
-    unittest
+    @nogc nothrow pure @safe unittest
     {
         Set!int set;
         assert(set.capacity == 0);
@@ -321,19 +382,11 @@ struct Set(T)
      */
     @property size_t length() const
     {
-        size_t count;
-        foreach (ref e; this.data[])
-        {
-            if (e.status == BucketStatus.used)
-            {
-                ++count;
-            }
-        }
-        return count;
+        return this.data.length;
     }
 
     ///
-    unittest
+    @nogc nothrow pure @safe unittest
     {
         Set!int set;
         assert(set.length == 0);
@@ -342,81 +395,46 @@ struct Set(T)
         assert(set.length == 1);
     }
 
-    private static const size_t[41] primes = [
-        3, 7, 13, 23, 29, 37, 53, 71, 97, 131, 163, 193, 239, 293, 389, 521,
-        769, 919, 1103, 1327, 1543, 2333, 3079, 4861, 6151, 12289, 24593,
-        49157, 98317, 196613, 393241, 786433, 1572869, 3145739, 6291469,
-        12582917, 25165843, 139022417, 282312799, 573292817, 1164186217,
-    ];
+    /**
+     * Tells whether the container contains any elements.
+     *
+     * Returns: Whether the container is empty.
+     */
+    @property bool empty() const
+    {
+        return length == 0;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        Set!int set;
+        assert(set.empty);
+        set.insert(5);
+        assert(!set.empty);
+    }
+
+    /**
+     * Removes all elements.
+     */
+    void clear()
+    {
+        this.data.clear();
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        Set!int set;
+        set.insert(5);
+        assert(!set.empty);
+        set.clear();
+        assert(set.empty);
+    }
 
     /// The maximum number of buckets the container can have.
     enum size_t maxBucketCount = primes[$ - 1];
 
-    static private size_t calculateHash(U)(ref const U value)
-    if (is(U == Unqual!T))
-    {
-        static if (isIntegral!T || isSomeChar!T || is(T == bool))
-        {
-            return (cast(size_t) value);
-        }
-        else
-        {
-            static assert(false);
-        }
-    }
-
-    static private size_t locateBucket(ref const DataType buckets,
-                                       const size_t hash)
-    in
-    {
-        assert(buckets.length > 0);
-    }
-    do
-    {
-        return hash % buckets.length;
-    }
-
-    /*
-     * Returns bucket position for `hash`. `0` may mean the 0th position or an
-     * empty `buckets` array.
-     */
-    private size_t locateBucket(const size_t hash) const
-    {
-        return this.data.length == 0 ? 0 : locateBucket(this.data, hash);
-    }
-
-    private enum InsertStatus : byte
-    {
-        found = -1,
-        failed = 0,
-        added = 1,
-    }
-
-    /*
-     * Inserts the value in an empty or deleted bucket. If the value is
-     * already in there, does nothing and returns InsertStatus.found. If the
-     * hash array is full returns InsertStatus.failed. Otherwise,
-     * InsertStatus.added is returned.
-     */
-    private InsertStatus insertInUnusedBucket(ref T value)
-    {
-        auto bucketPosition = locateBucket(this.data, calculateHash(value));
-
-        foreach (ref e; this.data[bucketPosition .. $])
-        {
-            if (e == value) // Already in the set.
-            {
-                return InsertStatus.found;
-            }
-            else if (e.status != BucketStatus.used) // Insert the value.
-            {
-                e.content = value;
-                return InsertStatus.added;
-            }
-        }
-        return InsertStatus.failed;
-    }
-
     /**
      * Inserts a new element.
      *
@@ -424,31 +442,20 @@ struct Set(T)
      *  value = Element value.
      *
      * Returns: Amount of new elements inserted.
-     *
-     * Throws: $(D_PSYMBOL HashContainerFullException) if the insertion failed.
      */
     size_t insert(T value)
     {
-        if (this.data.length == 0)
+        auto e = ((ref v) @trusted => &this.data.insert(v))(value);
+        if (e.status != BucketStatus.used)
         {
-            this.data = DataType(primes[0], allocator);
+            e.key = value;
+            return 1;
         }
-
-        InsertStatus status = insertInUnusedBucket(value);
-        for (; !status; status = insertInUnusedBucket(value))
-        {
-            if (this.primes.length == (this.lengthIndex + 1))
-            {
-                throw make!HashContainerFullException(defaultAllocator,
-                                                      "Set is full");
-            }
-            rehashToSize(this.lengthIndex + 1);
-        }
-        return status == InsertStatus.added;
+        return 0;
     }
 
     ///
-    unittest
+    @nogc nothrow pure @safe unittest
     {
         Set!int set;
         assert(8 !in set);
@@ -465,6 +472,38 @@ struct Set(T)
         assert(set.insert(8) == 1);
     }
 
+    /**
+     * Inserts the value from a forward range into the set.
+     *
+     * Params:
+     *  R     = Range type.
+     *  range = Forward range.
+     *
+     * Returns: The number of new elements inserted.
+     */
+    size_t insert(R)(R range)
+    if (isForwardRange!R && isImplicitlyConvertible!(ElementType!R, T))
+    {
+        size_t count;
+        foreach (e; range)
+        {
+            count += insert(e);
+        }
+        return count;
+    }
+
+    ///
+    @nogc nothrow pure @safe unittest
+    {
+        Set!int set;
+
+        int[3] range = [2, 1, 2];
+
+        assert(set.insert(range[]) == 2);
+        assert(1 in set);
+        assert(2 in set);
+    }
+
     /**
      * Removes an element.
      *
@@ -476,31 +515,16 @@ struct Set(T)
      */
     size_t remove(T value)
     {
-        auto bucketPosition = locateBucket(calculateHash(value));
-        foreach (ref e; this.data[bucketPosition .. $])
-        {
-            if (e == value) // Found.
-            {
-                e.remove();
-                return 1;
-            }
-            else if (e.status == BucketStatus.empty)
-            {
-                break;
-            }
-        }
-        return 0;
+        return this.data.remove(value);
     }
 
     ///
-    @nogc unittest
+    @nogc nothrow pure @safe unittest
     {
         Set!int set;
-        assert(8 !in set);
-
         set.insert(8);
-        assert(8 in set);
 
+        assert(8 in set);
         assert(set.remove(8) == 1);
         assert(set.remove(8) == 0);
         assert(8 !in set);
@@ -515,25 +539,13 @@ struct Set(T)
      * Returns: $(D_KEYWORD true) if the given element exists in the container,
      *          $(D_KEYWORD false) otherwise.
      */
-    bool opBinaryRight(string op : "in")(auto ref const T value) const
+    bool opBinaryRight(string op : "in")(auto ref inout(T) value) inout
     {
-        auto bucketPosition = locateBucket(calculateHash(value));
-        foreach (ref e; this.data[bucketPosition .. $])
-        {
-            if (e == value) // Found.
-            {
-                return true;
-            }
-            else if (e.status == BucketStatus.empty)
-            {
-                break;
-            }
-        }
-        return false;
+        return value in this.data;
     }
 
     ///
-    @nogc unittest
+    @nogc nothrow pure @safe unittest
     {
         Set!int set;
 
@@ -566,62 +578,29 @@ struct Set(T)
      * Params:
      *  n = Minimum number of buckets.
      */
-    void rehash(const size_t n)
+    void rehash(size_t n)
     {
-        size_t lengthIndex;
-        for (; lengthIndex < primes.length; ++lengthIndex)
-        {
-            if (primes[lengthIndex] >= n)
-            {
-                break;
-            }
-        }
-        rehashToSize(lengthIndex);
-    }
-
-    // Takes an index in the primes array.
-    private void rehashToSize(const size_t n)
-    {
-        auto storage = DataType(primes[n], allocator);
-        DataLoop: foreach (ref e1; this.data[])
-        {
-            if (e1.status == BucketStatus.used)
-            {
-                auto bucketPosition = locateBucket(storage,
-                                                   calculateHash(e1.content));
-
-                foreach (ref e2; storage[bucketPosition .. $])
-                {
-                    if (e2.status != BucketStatus.used) // Insert the value.
-                    {
-                        e2.content = e1.content;
-                        continue DataLoop;
-                    }
-                }
-                return; // Rehashing failed.
-            }
-        }
-        move(storage, this.data);
-        this.lengthIndex = n;
+        this.data.rehash(n);
     }
 
     /**
-     * Returns: A bidirectional range that iterates over the $(D_PSYMBOL Set)'s
-     *          elements.
+     * Returns a bidirectional range over the container.
+     *
+     * Returns: A bidirectional range that iterates over the container.
      */
     Range opIndex()
     {
-        return typeof(return)(this.data[]);
+        return typeof(return)(this.data.array[]);
     }
 
     /// ditto
     ConstRange opIndex() const
     {
-        return typeof(return)(this.data[]);
+        return typeof(return)(this.data.array[]);
     }
 
     ///
-    @nogc unittest
+    @nogc nothrow pure @safe unittest
     {
         Set!int set;
         assert(set[].empty);
@@ -630,77 +609,42 @@ struct Set(T)
         assert(!set[].empty);
         assert(set[].front == 8);
         assert(set[].back == 8);
-
-        set.remove(8);
-        assert(set[].empty);
     }
-
-    private @nogc unittest
-    {
-        const Set!int set;
-        assert(set[].empty);
-    }
-
-    private @nogc unittest
-    {
-        Set!int set;
-        set.insert(8);
-
-        auto r1 = set[];
-        auto r2 = r1.save();
-
-        r1.popFront();
-        assert(r1.empty);
-
-        r2.popBack();
-        assert(r2.empty);
-    }
-
-    private alias DataType = Array!(Bucket!T);
-    private DataType data;
-    private size_t lengthIndex;
 }
 
 // Basic insertion logic.
-private @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     Set!int set;
 
     assert(set.insert(5) == 1);
-    assert(set.data[0].status == BucketStatus.empty);
-    assert(set.data[1].status == BucketStatus.empty);
-    assert(set.data[2].content == 5 && set.data[2].status == BucketStatus.used);
-    assert(set.data.length == 3);
+    assert(5 in set);
+    assert(set.data.array.length == 3);
 
     assert(set.insert(5) == 0);
-    assert(set.data[0].status == BucketStatus.empty);
-    assert(set.data[1].status == BucketStatus.empty);
-    assert(set.data[2].content == 5 && set.data[2].status == BucketStatus.used);
-    assert(set.data.length == 3);
+    assert(5 in set);
+    assert(set.data.array.length == 3);
 
     assert(set.insert(9) == 1);
-    assert(set.data[0].content == 9 && set.data[0].status == BucketStatus.used);
-    assert(set.data[1].status == BucketStatus.empty);
-    assert(set.data[2].content == 5 && set.data[2].status == BucketStatus.used);
-    assert(set.data.length == 3);
+    assert(9 in set);
+    assert(5 in set);
+    assert(set.data.array.length == 3);
 
     assert(set.insert(7) == 1);
     assert(set.insert(8) == 1);
-    assert(set.data[0].content == 7);
-    assert(set.data[1].content == 8);
-    assert(set.data[2].content == 9);
-    assert(set.data[3].status == BucketStatus.empty);
-    assert(set.data[5].content == 5);
-    assert(set.data.length == 7);
+    assert(8 in set);
+    assert(5 in set);
+    assert(9 in set);
+    assert(7 in set);
+    assert(set.data.array.length == 7);
 
     assert(set.insert(16) == 1);
-    assert(set.data[2].content == 9);
-    assert(set.data[3].content == 16);
-    assert(set.data[4].status == BucketStatus.empty);
+    assert(16 in set);
+    assert(set.data.array.length == 7);
 }
 
 // Static checks.
-private unittest
+@nogc nothrow pure @safe unittest
 {
     import tanya.range.primitive;
 
@@ -717,3 +661,83 @@ private unittest
     static assert(is(Set!ushort));
     static assert(is(Set!bool));
 }
+
+@nogc nothrow pure @safe unittest
+{
+    const Set!int set;
+    assert(set[].empty);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    Set!int set;
+    set.insert(8);
+
+    auto r1 = set[];
+    auto r2 = r1.save();
+
+    r1.popFront();
+    assert(r1.empty);
+
+    r2.popBack();
+    assert(r2.empty);
+}
+
+// Initial capacity is 0.
+@nogc nothrow pure @safe unittest
+{
+    auto set = Set!int(defaultAllocator);
+    assert(set.capacity == 0);
+}
+
+// Capacity is set to a prime.
+@nogc nothrow pure @safe unittest
+{
+    auto set = Set!int(8);
+    assert(set.capacity == 13);
+}
+
+// Constructs by reference
+@nogc nothrow pure @safe unittest
+{
+    auto set1 = Set!int(7);
+    auto set2 = Set!int(set1);
+    assert(set1.length == set2.length);
+    assert(set1.capacity == set2.capacity);
+}
+
+// Constructs by value
+@nogc nothrow pure @safe unittest
+{
+    auto set = Set!int(Set!int(7));
+    assert(set.capacity == 7);
+}
+
+// Assigns by reference
+@nogc nothrow pure @safe unittest
+{
+    auto set1 = Set!int(7);
+    Set!int set2;
+    set1 = set2;
+    assert(set1.length == set2.length);
+    assert(set1.capacity == set2.capacity);
+}
+
+// Assigns by value
+@nogc nothrow pure @safe unittest
+{
+    Set!int set;
+    set = Set!int(7);
+    assert(set.capacity == 7);
+}
+
+// Postblit copies
+@nogc nothrow pure @safe unittest
+{
+    auto set = Set!int(7);
+    void testFunc(Set!int set)
+    {
+        assert(set.capacity == 7);
+    }
+    testFunc(set);
+}

source/tanya/container/string.d

@@ -26,9 +26,10 @@
  */
 module tanya.container.string;
 
-import std.algorithm.comparison;
+import std.algorithm.comparison : cmp, equal;
 import std.algorithm.mutation : bringToFront, copy;
 import std.algorithm.searching;
+import tanya.algorithm.comparison;
 import tanya.algorithm.mutation;
 import tanya.memory;
 import tanya.meta.trait;

source/tanya/conv.d

@@ -264,6 +264,30 @@ final class ConvException : Exception
     }
 }
 
+package bool stringToInt(R)(R range, ref ushort n)
+{
+    import tanya.encoding.ascii;
+    import tanya.range.array;
+
+    size_t i = 1;
+    uint lPort;
+
+    for (; !range.empty && range.front.isDigit() && i <= 6; ++i, range.popFront())
+    {
+        lPort = lPort * 10 + (range.front - '0');
+    }
+    if (i != 1 && (range.empty || range.front == '/'))
+    {
+        if (lPort > ushort.max)
+        {
+            return false;
+        }
+        n = cast(ushort) lPort;
+        return true;
+    }
+    return false;
+}
+
 /**
  * If the source type $(D_PARAM From) and the target type $(D_PARAM To) are
  * equal, does nothing. If $(D_PARAM From) can be implicitly converted to

source/tanya/encoding/ascii.d

@@ -8,7 +8,7 @@
  * ASCII is $(B A)merican $(B S)tandard $(B C)ode for $(B I)nformation
  * $(B I)nterchange.
  *
- * Copyright: Eugene Wissner 2017.
+ * Copyright: Eugene Wissner 2017-2018.
  * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
  *                  Mozilla Public License, v. 2.0).
  * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)
@@ -19,23 +19,23 @@ module tanya.encoding.ascii;
 
 import tanya.meta.trait;
 
-const string fullHexDigits = "0123456789ABCDEFabcdef"; /// 0..9A..Fa..f.
-const string hexDigits = "0123456789ABCDEF"; /// 0..9A..F.
-const string lowerHexDigits = "0123456789abcdef"; /// 0..9a..f.
-const string digits = "0123456789"; /// 0..9.
-const string octalDigits = "01234567"; /// 0..7.
+immutable string fullHexDigits = "0123456789ABCDEFabcdef"; /// 0..9A..Fa..f.
+immutable string hexDigits = "0123456789ABCDEF"; /// 0..9A..F.
+immutable string lowerHexDigits = "0123456789abcdef"; /// 0..9a..f.
+immutable string digits = "0123456789"; /// 0..9.
+immutable string octalDigits = "01234567"; /// 0..7.
 
 /// A..Za..z.
-const string letters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+immutable string letters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
 
-const string uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; /// A..Z.
-const string lowercase = "abcdefghijklmnopqrstuvwxyz"; /// a..z.
+immutable string uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; /// A..Z.
+immutable string lowercase = "abcdefghijklmnopqrstuvwxyz"; /// a..z.
 
 /**
  * Whitespace, Horizontal Tab (HT), Line Feed (LF), Carriage Return (CR),
  * Vertical Tab (VT) or Form Feed (FF).
  */
-const string whitespace = "\t\n\v\f\r ";
+immutable string whitespace = "\t\n\v\f\r ";
 
 /// Letter case specifier.
 enum LetterCase : bool
@@ -61,7 +61,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isUpper('A'));
     assert(isUpper('Z'));
@@ -87,7 +87,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isLower('a'));
     assert(isLower('z'));
@@ -113,7 +113,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isAlpha('A'));
     assert(isAlpha('Z'));
@@ -141,7 +141,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isDigit('0'));
     assert(isDigit('1'));
@@ -174,7 +174,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isAlphaNum('0'));
     assert(isAlphaNum('1'));
@@ -205,7 +205,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isASCII('0'));
     assert(isASCII('L'));
@@ -240,7 +240,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isControl('\t'));
     assert(isControl('\0'));
@@ -281,7 +281,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isWhite('\t'));
     assert(isWhite('\n'));
@@ -312,7 +312,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isGraphical('a'));
     assert(isGraphical('0'));
@@ -343,7 +343,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isPrintable('a'));
     assert(isPrintable('0'));
@@ -372,7 +372,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isHexDigit('0'));
     assert(isHexDigit('1'));
@@ -403,7 +403,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isOctalDigit('0'));
     assert(isOctalDigit('1'));
@@ -436,7 +436,7 @@ if (isSomeChar!C)
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(isPunctuation('!'));
     assert(isPunctuation(':'));
@@ -459,14 +459,14 @@ pure nothrow @safe @nogc unittest
  * Returns: The lowercase of $(D_PARAM c) if available, just $(D_PARAM c)
  *          otherwise.
  */
-C toUpper(C)(const C c)
+C toUpper(C)(C c)
 if (isSomeChar!C)
 {
     return isLower(c) ? (cast(C) (c - 32)) : c;
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(toUpper('a') == 'A');
     assert(toUpper('A') == 'A');
@@ -486,14 +486,14 @@ pure nothrow @safe @nogc unittest
  * Returns: The uppercase of $(D_PARAM c) if available, just $(D_PARAM c)
  *          otherwise.
  */
-C toLower(C)(const C c)
+C toLower(C)(C c)
 if (isSomeChar!C)
 {
     return isUpper(c) ? (cast(C) (c + 32)) : c;
 }
 
 ///
-pure nothrow @safe @nogc unittest
+@nogc nothrow pure @safe unittest
 {
     assert(toLower('A') == 'a');
     assert(toLower('a') == 'a');

source/tanya/encoding/package.d

@@ -5,7 +5,7 @@
 /**
  * This package provides tools to work with text encodings.
  *
- * Copyright: Eugene Wissner 2017.
+ * Copyright: Eugene Wissner 2017-2018.
  * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
  *                  Mozilla Public License, v. 2.0).
  * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)

source/tanya/hash/lookup.d

@@ -77,10 +77,11 @@ private struct FNV
 }
 
 /**
- * Takes an a argument of an arbitrary type $(D_PARAM T) and calculates the hash value.
+ * Takes an argument of an arbitrary type $(D_PARAM T) and calculates the hash
+ * value.
  *
  * Hash calculation is supported for all scalar types. Aggregate types, like
- *$(D_KEYWORD struct)s should implement `toHash`-function:
+ * $(D_KEYWORD struct)s, should implement `toHash`-function:
  * ---
  * size_t toHash() const
  * {
@@ -124,7 +125,7 @@ version (unittest)
                                ~ r10!x ~ r10!x ~ r10!x ~ r10!x ~ r10!x;
     enum string r500(string x) = r100!x ~ r100!x ~ r100!x ~ r100!x ~ r100!x;
 
-    private struct ToHash
+    private static struct ToHash
     {
         size_t toHash() const @nogc nothrow pure @safe
         {
@@ -132,7 +133,7 @@ version (unittest)
         }
     }
 
-    private struct HashRange
+    private static struct HashRange
     {
         string fo = "fo";
 
@@ -152,7 +153,7 @@ version (unittest)
         }
     }
 
-    private struct ToHashRange
+    private static struct ToHashRange
     {
         bool empty_;
 

source/tanya/math/mp.d

@@ -14,9 +14,10 @@
  */
 module tanya.math.mp;
 
-import std.algorithm.comparison;
+import std.algorithm.comparison : cmp, equal;
 import std.algorithm.mutation : copy, fill, reverse;
 import std.range;
+import tanya.algorithm.comparison;
 import tanya.algorithm.mutation;
 import tanya.container.array;
 import tanya.encoding.ascii;
@@ -1256,7 +1257,7 @@ struct Integer
 
         for (size_t i; i < this.size; ++i)
         {
-            const limit = min(factor.size, digits - i);
+            const limit = min(cast(size_t) factor.size, digits - i);
             word carry;
             auto k = i;
 

source/tanya/math/nbtheory.d

@@ -16,9 +16,17 @@ module tanya.math.nbtheory;
 
 import tanya.math.mp;
 import tanya.meta.trait;
+import tanya.meta.transform;
 
 version (TanyaNative)
 {
+    private extern float fabs(float) @nogc nothrow pure @safe;
+    private extern double fabs(double) @nogc nothrow pure @safe;
+    private extern real fabs(real) @nogc nothrow pure @safe;
+
+    private extern double log(double) @nogc nothrow pure @safe;
+    private extern float logf(float) @nogc nothrow pure @safe;
+    private extern real logl(real) @nogc nothrow pure @safe;
 }
 else
 {
@@ -35,7 +43,7 @@ else
  *
  * Returns: Absolute value of $(D_PARAM x).
  */
-T abs(T)(T x)
+Unqual!T abs(T)(T x)
 if (isIntegral!T)
 {
     static if (isSigned!T)
@@ -60,24 +68,11 @@ if (isIntegral!T)
     static assert(is(typeof(u.abs) == uint));
 }
 
-version (D_Ddoc)
-{
 /// ditto
-    T abs(T)(T x)
-    if (isFloatingPoint!T);
-}
-else version (TanyaNative)
-{
-    extern T abs(T)(T number) @nogc nothrow pure @safe
-    if (isFloatingPoint!T);
-}
-else
-{
-    T abs(T)(T x)
+Unqual!T abs(T)(T x)
 if (isFloatingPoint!T)
 {
-        return fabs(cast(real) x);
-    }
+    return fabs(x);
 }
 
 ///
@@ -122,17 +117,31 @@ version (D_Ddoc)
      *
      * Returns: Natural logarithm of $(D_PARAM x).
      */
-    T ln(T)(T x)
+    Unqual!T ln(T)(T x)
     if (isFloatingPoint!T);
 }
 else version (TanyaNative)
 {
-    extern T ln(T)(T x) @nogc nothrow pure @safe
-    if (isFloatingPoint!T);
+    Unqual!T ln(T)(T x) @nogc nothrow pure @safe
+    if (isFloatingPoint!T)
+    {
+        static if (is(Unqual!T == float))
+        {
+            return logf(x);
+        }
+        else static if (is(Unqual!T == double))
+        {
+            return log(x);
         }
         else
         {
-    T ln(T)(T x)
+            return logl(x);
+        }
+    }
+}
+else
+{
+    Unqual!T ln(T)(T x)
     if (isFloatingPoint!T)
     {
         return log(x);

source/tanya/math/package.d

@@ -89,7 +89,7 @@ if (isFloatingPoint!F)
 
 private union FloatBits(F)
 {
-    F floating;
+    Unqual!F floating;
     static if (ieeePrecision!F == IEEEPrecision.single)
     {
         uint integral;
@@ -632,7 +632,6 @@ do
     size_t i;
     auto tmp1 = Integer(x, x.allocator);
     auto result = Integer(x.allocator);
-    bool firstBit;
 
     if (x.size == 0 && y.size != 0)
     {
@@ -741,32 +740,14 @@ bool isPseudoprime(ulong x) @nogc nothrow pure @safe
     assert(982451653.isPseudoprime);
 }
 
-/**
- * Determines minimum of two numbers.
- *
- * Params:
- *  x = First number.
- *  y = Second number.
- *
- * Returns: $(D_PARAM x) if $(D_PARAM x) is smaller than $(D_PSYMBOL y),
- *          $(D_PARAM y) otherwise.
- *
- * See_Also: $(D_PSYMBOL max).
- */
+deprecated("Use tanya.algorithm.comparison.min instead")
 T min(T)(T x, T y)
 if (isIntegral!T)
 {
     return x < y ? x : y;
 }
 
-///
-@nogc nothrow pure @safe unittest
-{
-    assert(min(5, 3) == 3);
-    assert(min(4, 4) == 4);
-}
-
-/// ditto
+deprecated("Use tanya.algorithm.comparison.min instead")
 T min(T)(T x, T y)
 if (isFloatingPoint!T)
 {
@@ -781,62 +762,33 @@ if (isFloatingPoint!T)
     return x < y ? x : y;
 }
 
-///
-@nogc nothrow pure @safe unittest
-{
-    assert(min(5.2, 3.0) == 3.0);
-
-    assert(min(5.2, double.nan) == 5.2);
-    assert(min(double.nan, 3.0) == 3.0);
-    assert(isNaN(min(double.nan, double.nan)));
-}
-
-/// ditto
+deprecated("Use tanya.algorithm.comparison.min instead")
 ref T min(T)(ref T x, ref T y)
 if (is(Unqual!T == Integer))
 {
     return x < y ? x : y;
 }
 
-/// ditto
+deprecated("Use tanya.algorithm.comparison.min instead")
 T min(T)(T x, T y)
 if (is(T == Integer))
 {
     return x < y ? move(x) : move(y);
 }
 
-///
 @nogc nothrow pure @safe unittest
 {
     assert(min(Integer(5), Integer(3)) == 3);
 }
 
-/**
- * Determines maximum of two numbers.
- *
- * Params:
- *  x = First number.
- *  y = Second number.
- *
- * Returns: $(D_PARAM x) if $(D_PARAM x) is larger than $(D_PSYMBOL y),
- *          $(D_PARAM y) otherwise.
- *
- * See_Also: $(D_PSYMBOL min).
- */
+deprecated("Use tanya.algorithm.comparison.max instead")
 T max(T)(T x, T y)
 if (isIntegral!T)
 {
     return x > y ? x : y;
 }
 
-///
-@nogc nothrow pure @safe unittest
-{
-    assert(max(5, 3) == 5);
-    assert(max(4, 4) == 4);
-}
-
-/// ditto
+deprecated("Use tanya.algorithm.comparison.max instead")
 T max(T)(T x, T y)
 if (isFloatingPoint!T)
 {
@@ -851,24 +803,14 @@ if (isFloatingPoint!T)
     return x > y ? x : y;
 }
 
-///
-@nogc nothrow pure @safe unittest
-{
-    assert(max(5.2, 3.0) == 5.2);
-
-    assert(max(5.2, double.nan) == 5.2);
-    assert(max(double.nan, 3.0) == 3.0);
-    assert(isNaN(max(double.nan, double.nan)));
-}
-
-/// ditto
+deprecated("Use tanya.algorithm.comparison.max instead")
 ref T max(T)(ref T x, ref T y)
 if (is(Unqual!T == Integer))
 {
     return x > y ? x : y;
 }
 
-/// ditto
+deprecated("Use tanya.algorithm.comparison.max instead")
 T max(T)(T x, T y)
 if (is(T == Integer))
 {

source/tanya/memory/allocator.d

@@ -35,7 +35,7 @@ interface Allocator
      *
      * Returns: Pointer to the new allocated memory.
      */
-    void[] allocate(const size_t size) shared pure nothrow @nogc;
+    void[] allocate(size_t size) shared pure nothrow @nogc;
 
     /**
      * Deallocates a memory block.
@@ -56,7 +56,7 @@ interface Allocator
      *
      * Returns: Pointer to the allocated memory.
      */
-    bool reallocate(ref void[] p, const size_t size) shared pure nothrow @nogc;
+    bool reallocate(ref void[] p, size_t size) shared pure nothrow @nogc;
 
     /**
      * Reallocates a memory block in place if possible or returns
@@ -70,7 +70,7 @@ interface Allocator
      *
      * Returns: $(D_KEYWORD true) if successful, $(D_KEYWORD false) otherwise.
      */
-    bool reallocateInPlace(ref void[] p, const size_t size)
+    bool reallocateInPlace(ref void[] p, size_t size)
     shared pure nothrow @nogc;
 }
 

source/tanya/memory/mallocator.d

@@ -29,11 +29,11 @@ import tanya.memory.allocator;
 final class Mallocator : Allocator
 {
     private alias MallocType = extern (C) void* function(size_t)
-                               pure nothrow @system @nogc;
+                               @nogc nothrow pure @system;
     private alias FreeType = extern (C) void function(void*)
-                             pure nothrow @system @nogc;
+                             @nogc nothrow pure @system;
     private alias ReallocType = extern (C) void* function(void*, size_t)
-                                pure nothrow @system @nogc;
+                                @nogc nothrow pure @system;
 
     /**
      * Allocates $(D_PARAM size) bytes of memory.
@@ -43,7 +43,7 @@ final class Mallocator : Allocator
      *
      * Returns: The pointer to the new allocated memory.
      */
-    void[] allocate(const size_t size) shared pure nothrow @nogc
+    void[] allocate(size_t size) @nogc nothrow pure shared @system
     {
         if (size == 0)
         {
@@ -55,7 +55,7 @@ final class Mallocator : Allocator
     }
 
     ///
-    @nogc nothrow unittest
+    @nogc nothrow pure @system unittest
     {
         auto p = Mallocator.instance.allocate(20);
         assert(p.length == 20);
@@ -73,7 +73,7 @@ final class Mallocator : Allocator
      *
      * Returns: Whether the deallocation was successful.
      */
-    bool deallocate(void[] p) shared pure nothrow @nogc
+    bool deallocate(void[] p) @nogc nothrow pure shared @system
     {
         if (p !is null)
         {
@@ -83,7 +83,7 @@ final class Mallocator : Allocator
     }
 
     ///
-    @nogc nothrow unittest
+    @nogc nothrow pure @system unittest
     {
         void[] p;
         assert(Mallocator.instance.deallocate(p));
@@ -101,14 +101,15 @@ final class Mallocator : Allocator
      *
      * Returns: $(D_KEYWORD false).
      */
-    bool reallocateInPlace(ref void[] p, const size_t size)
-    shared pure nothrow @nogc
+    bool reallocateInPlace(ref void[] p, size_t size)
+    @nogc nothrow pure shared @system
     {
+        cast(void) size;
         return false;
     }
 
     ///
-    @nogc nothrow unittest
+    @nogc nothrow pure @system unittest
     {
         void[] p;
         assert(!Mallocator.instance.reallocateInPlace(p, 8));
@@ -123,7 +124,8 @@ final class Mallocator : Allocator
      *
      * Returns: Whether the reallocation was successful.
      */
-    bool reallocate(ref void[] p, const size_t size) shared pure nothrow @nogc
+    bool reallocate(ref void[] p, size_t size)
+    @nogc nothrow pure shared @system
     {
         if (size == 0)
         {
@@ -152,7 +154,7 @@ final class Mallocator : Allocator
     }
 
     ///
-    @nogc nothrow unittest
+    @nogc nothrow pure @system unittest
     {
         void[] p;
 
@@ -169,8 +171,8 @@ final class Mallocator : Allocator
         assert(p is null);
     }
 
-    // Fails with false.
-    private @nogc nothrow unittest
+    // Fails with false
+    @nogc nothrow pure @system unittest
     {
         void[] p = Mallocator.instance.allocate(20);
         void[] oldP = p;
@@ -182,7 +184,7 @@ final class Mallocator : Allocator
     /**
      * Returns: The alignment offered.
      */
-    @property uint alignment() shared const pure nothrow @safe @nogc
+    @property uint alignment() const @nogc nothrow pure @safe shared
     {
         return (void*).alignof;
     }
@@ -192,7 +194,7 @@ final class Mallocator : Allocator
         assert(Mallocator.instance.alignment == (void*).alignof);
     }
 
-    static private shared(Mallocator) instantiate() nothrow @nogc
+    static private shared(Mallocator) instantiate() @nogc nothrow @system
     {
         if (instance_ is null)
         {
@@ -213,13 +215,13 @@ final class Mallocator : Allocator
      *
      * Returns: The global $(D_PSYMBOL Allocator) instance.
      */
-    static @property shared(Mallocator) instance() pure nothrow @nogc
+    static @property shared(Mallocator) instance() @nogc nothrow pure @system
     {
         return (cast(GetPureInstance!Mallocator) &instantiate)();
     }
 
     ///
-    @nogc nothrow unittest
+    @nogc nothrow pure @system unittest
     {
         assert(instance is instance);
     }

source/tanya/memory/mmappool.d

@@ -14,45 +14,32 @@
  */
 module tanya.memory.mmappool;
 
-import std.algorithm.comparison;
-import tanya.memory.allocator;
-import tanya.memory.op;
-
 version (TanyaNative):
 
-import core.sys.posix.sys.mman : MAP_ANON,
-                                 MAP_FAILED,
-                                 MAP_PRIVATE,
-                                 PROT_READ,
-                                 PROT_WRITE;
-import core.sys.posix.unistd;
+import mir.linux._asm.unistd;
+import tanya.algorithm.comparison;
+import tanya.memory.allocator;
+import tanya.memory.op;
+import tanya.os.error;
+import tanya.sys.linux.syscall;
+import tanya.sys.posix.mman;
 
-extern(C)
-private void* mmap(void* addr,
-                   size_t len,
-                   int prot,
-                   int flags,
-                   int fd,
-                   off_t offset) pure nothrow @system @nogc;
-
-extern(C)
-private int munmap(void* addr, size_t len) pure nothrow @system @nogc;
-
-private void* mapMemory(const size_t len) pure nothrow @system @nogc
+private void* mapMemory(const size_t length) @nogc nothrow pure @system
 {
-    void* p = mmap(null,
-                   len,
+    auto p = syscall_(0,
+                      length,
                       PROT_READ | PROT_WRITE,
-                   MAP_PRIVATE | MAP_ANON,
+                      MAP_PRIVATE | MAP_ANONYMOUS,
                       -1,
-                   0);
-    return p is MAP_FAILED ? null : p;
+                      0,
+                      NR_mmap);
+    return p == -ErrorCode.noMemory ? null : cast(void*) p;
 }
 
-private bool unmapMemory(shared void* addr, const size_t len)
-pure nothrow @system @nogc
+private bool unmapMemory(shared void* addr, const size_t length)
+@nogc nothrow pure @system
 {
-    return munmap(cast(void*) addr, len) == 0;
+    return syscall_(cast(ptrdiff_t) addr, length, NR_munmap) == 0;
 }
 
 /*
@@ -83,7 +70,7 @@ final class MmapPool : Allocator
 {
     version (none)
     {
-        pure nothrow @nogc invariant
+        @nogc nothrow pure @system invariant
         {
             for (auto r = &head; *r !is null; r = &((*r).next))
             {
@@ -107,7 +94,7 @@ final class MmapPool : Allocator
      *
      * Returns: Pointer to the new allocated memory.
      */
-    void[] allocate(const size_t size) shared pure nothrow @nogc
+    void[] allocate(size_t size) @nogc nothrow pure shared @system
     {
         if (size == 0)
         {
@@ -128,7 +115,7 @@ final class MmapPool : Allocator
         return data is null ? null : data[0 .. size];
     }
 
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         auto p = MmapPool.instance.allocate(20);
         assert(p);
@@ -138,15 +125,14 @@ final class MmapPool : Allocator
         assert(p.length == 0);
     }
 
-    // Issue 245: https://issues.caraus.io/issues/245.
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         // allocate() check.
         size_t tooMuchMemory = size_t.max
                              - MmapPool.alignment_
                              - BlockEntry.sizeof * 2
                              - RegionEntry.sizeof
-                             - MmapPool.instance.pageSize;
+                             - pageSize;
         assert(MmapPool.instance.allocate(tooMuchMemory) is null);
 
         assert(MmapPool.instance.allocate(size_t.max) is null);
@@ -165,7 +151,8 @@ final class MmapPool : Allocator
      *
      * Returns: Data the block points to or $(D_KEYWORD null).
      */
-    private void* findBlock(const ref size_t size) shared pure nothrow @nogc
+    private void* findBlock(const ref size_t size)
+    @nogc nothrow pure shared @system
     {
         Block block1;
         RegionLoop: for (auto r = head; r !is null; r = r.next)
@@ -207,7 +194,7 @@ final class MmapPool : Allocator
     }
 
     // Merge block with the next one.
-    private void mergeNext(Block block) shared const pure nothrow @safe @nogc
+    private void mergeNext(Block block) const @nogc nothrow pure @safe shared
     {
         block.size = block.size + BlockEntry.sizeof + block.next.size;
         if (block.next.next !is null)
@@ -225,7 +212,7 @@ final class MmapPool : Allocator
      *
      * Returns: Whether the deallocation was successful.
      */
-    bool deallocate(void[] p) shared pure nothrow @nogc
+    bool deallocate(void[] p) @nogc nothrow pure shared @system
     {
         if (p.ptr is null)
         {
@@ -271,7 +258,7 @@ final class MmapPool : Allocator
         return true;
     }
 
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         auto p = MmapPool.instance.allocate(20);
 
@@ -290,8 +277,8 @@ final class MmapPool : Allocator
      *
      * Returns: $(D_KEYWORD true) if successful, $(D_KEYWORD false) otherwise.
      */
-    bool reallocateInPlace(ref void[] p, const size_t size)
-    shared pure nothrow @nogc
+    bool reallocateInPlace(ref void[] p, size_t size)
+    @nogc nothrow pure shared @system
     {
         if (p is null || size == 0)
         {
@@ -354,7 +341,7 @@ final class MmapPool : Allocator
         return true;
     }
 
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         void[] p;
         assert(!MmapPool.instance.reallocateInPlace(p, 5));
@@ -387,7 +374,8 @@ final class MmapPool : Allocator
      *
      * Returns: Whether the reallocation was successful.
      */
-    bool reallocate(ref void[] p, const size_t size) shared pure nothrow @nogc
+    bool reallocate(ref void[] p, size_t size)
+    @nogc nothrow pure shared @system
     {
         if (size == 0)
         {
@@ -419,7 +407,7 @@ final class MmapPool : Allocator
         return true;
     }
 
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         void[] p;
         MmapPool.instance.reallocate(p, 10 * int.sizeof);
@@ -447,28 +435,20 @@ final class MmapPool : Allocator
         MmapPool.instance.deallocate(p);
     }
 
-    static private shared(MmapPool) instantiate() nothrow @nogc
+    static private shared(MmapPool) instantiate() @nogc nothrow @system
     {
         if (instance_ is null)
         {
-            // Get system dependend page size.
-            size_t pageSize = sysconf(_SC_PAGE_SIZE);
-            if (pageSize < 65536)
-            {
-                pageSize = pageSize * 65536 / pageSize;
-            }
-
             const instanceSize = addAlignment(__traits(classInstanceSize,
                                               MmapPool));
 
             Region head; // Will become soon our region list head
-            void* data = initializeRegion(instanceSize, head, pageSize);
+            void* data = initializeRegion(instanceSize, head);
             if (data !is null)
             {
                 copy(typeid(MmapPool).initializer, data[0 .. instanceSize]);
                 instance_ = cast(shared MmapPool) data;
                 instance_.head = head;
-                instance_.pageSize = pageSize;
             }
         }
         return instance_;
@@ -479,12 +459,12 @@ final class MmapPool : Allocator
      *
      * Returns: Global $(D_PSYMBOL MmapPool) instance.
      */
-    static @property shared(MmapPool) instance() pure nothrow @nogc
+    static @property shared(MmapPool) instance() @nogc nothrow pure @system
     {
         return (cast(GetPureInstance!MmapPool) &instantiate)();
     }
 
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         assert(instance is instance);
     }
@@ -498,12 +478,10 @@ final class MmapPool : Allocator
      *
      * Returns: A pointer to the data.
      */
-    private static void* initializeRegion(const size_t size,
-                                          ref Region head,
-                                          const size_t pageSize)
-    pure nothrow @nogc
+    private static void* initializeRegion(const size_t size, ref Region head)
+    @nogc nothrow pure @system
     {
-        const regionSize = calculateRegionSize(size, pageSize);
+        const regionSize = calculateRegionSize(size);
         if (regionSize < size)
         {
             return null;
@@ -550,9 +528,10 @@ final class MmapPool : Allocator
         return data;
     }
 
-    private void* initializeRegion(const size_t size) shared pure nothrow @nogc
+    private void* initializeRegion(const size_t size)
+    @nogc nothrow pure shared @system
     {
-        return initializeRegion(size, this.head, this.pageSize);
+        return initializeRegion(size, this.head);
     }
 
     /*
@@ -561,7 +540,7 @@ final class MmapPool : Allocator
      *
      * Returns: Aligned size of $(D_PARAM x).
      */
-    private static size_t addAlignment(const size_t x) pure nothrow @safe @nogc
+    private static size_t addAlignment(const size_t x) @nogc nothrow pure @safe
     {
         return (x - 1) / alignment_ * alignment_ + alignment_;
     }
@@ -569,13 +548,11 @@ final class MmapPool : Allocator
     /*
      * Params:
      *  x = Required space.
-     *  pageSize = Page size.
      *
      * Returns: Minimum region size (a multiple of $(D_PSYMBOL pageSize)).
      */
-    private static size_t calculateRegionSize(ref const size_t x,
-                                              ref const size_t pageSize)
-    pure nothrow @safe @nogc
+    private static size_t calculateRegionSize(ref const size_t x)
+    @nogc nothrow pure @safe
     {
         return (x + RegionEntry.sizeof + BlockEntry.sizeof * 2)
              / pageSize * pageSize + pageSize;
@@ -584,12 +561,12 @@ final class MmapPool : Allocator
     /*
      * Returns: Alignment offered.
      */
-    @property uint alignment() shared const pure nothrow @safe @nogc
+    @property uint alignment() const @nogc nothrow pure @safe shared
     {
         return alignment_;
     }
 
-    @nogc nothrow pure unittest
+    @nogc nothrow pure @system unittest
     {
         assert(MmapPool.instance.alignment == MmapPool.alignment_);
     }
@@ -597,7 +574,9 @@ final class MmapPool : Allocator
     private enum uint alignment_ = 8;
 
     private shared static MmapPool instance_;
-    private shared size_t pageSize;
+
+    // Page size.
+    enum size_t pageSize = 65536;
 
     private shared struct RegionEntry
     {
@@ -622,7 +601,7 @@ final class MmapPool : Allocator
 
 // A lot of allocations/deallocations, but it is the minimum caused a
 // segmentation fault because MmapPool reallocateInPlace moves a block wrong.
-@nogc nothrow pure unittest
+@nogc nothrow pure @system unittest
 {
     auto a = MmapPool.instance.allocate(16);
     auto d = MmapPool.instance.allocate(16);

source/tanya/memory/package.d

@@ -38,7 +38,7 @@ mixin template DefaultAllocator()
      *
      * Precondition: $(D_INLINECODE allocator_ !is null)
      */
-    this(shared Allocator allocator) pure nothrow @safe @nogc
+    this(shared Allocator allocator) @nogc nothrow pure @safe
     in
     {
         assert(allocator !is null);
@@ -56,7 +56,7 @@ mixin template DefaultAllocator()
      *
      * Postcondition: $(D_INLINECODE allocator !is null)
      */
-    protected @property shared(Allocator) allocator() pure nothrow @safe @nogc
+    @property shared(Allocator) allocator() @nogc nothrow pure @safe
     out (allocator)
     {
         assert(allocator !is null);
@@ -71,7 +71,7 @@ mixin template DefaultAllocator()
     }
 
     /// ditto
-    @property shared(Allocator) allocator() const pure nothrow @trusted @nogc
+    @property shared(Allocator) allocator() const @nogc nothrow pure @trusted
     out (allocator)
     {
         assert(allocator !is null);
@@ -88,11 +88,11 @@ mixin template DefaultAllocator()
 
 // From druntime
 extern (C)
-private void _d_monitordelete(Object h, bool det) pure nothrow @nogc;
+private void _d_monitordelete(Object h, bool det) @nogc nothrow pure;
 
 shared Allocator allocator;
 
-private shared(Allocator) getAllocatorInstance() nothrow @nogc
+private shared(Allocator) getAllocatorInstance() @nogc nothrow
 {
     if (allocator is null)
     {
@@ -115,7 +115,7 @@ private shared(Allocator) getAllocatorInstance() nothrow @nogc
  *
  * Postcondition: $(D_INLINECODE allocator !is null).
  */
-@property shared(Allocator) defaultAllocator() pure nothrow @trusted @nogc
+@property shared(Allocator) defaultAllocator() @nogc nothrow pure @trusted
 out (allocator)
 {
     assert(allocator !is null);
@@ -133,7 +133,7 @@ do
  *
  * Precondition: $(D_INLINECODE allocator !is null).
  */
-@property void defaultAllocator(shared(Allocator) allocator) nothrow @safe @nogc
+@property void defaultAllocator(shared(Allocator) allocator) @nogc nothrow @safe
 in
 {
     assert(allocator !is null);
@@ -285,7 +285,7 @@ package(tanya) void[] finalize(T)(ref T* p)
 }
 
 package(tanya) void[] finalize(T)(ref T p)
-    if (is(T == class) || is(T == interface))
+if (isPolymorphicType!T)
 {
     if (p is null)
     {

source/tanya/memory/smartref.d

@@ -23,7 +23,7 @@
  */
 module tanya.memory.smartref;
 
-import std.algorithm.comparison;
+import tanya.algorithm.comparison;
 import tanya.algorithm.mutation;
 import tanya.conv;
 import tanya.exception;

source/tanya/meta/metafunction.d

@@ -44,7 +44,7 @@ import tanya.meta.transform;
  * See_Also: $(D_PSYMBOL isLess).
  */
 template Min(alias pred, Args...)
-if (Args.length > 0 && isTemplate!pred)
+if (Args.length > 0 && __traits(isTemplate, pred))
 {
     static if (Args.length == 1)
     {
@@ -91,7 +91,7 @@ if (Args.length > 0 && isTemplate!pred)
  * See_Also: $(D_PSYMBOL isLess).
  */
 template Max(alias pred, Args...)
-if (Args.length > 0 && isTemplate!pred)
+if (Args.length > 0 && __traits(isTemplate, pred))
 {
     static if (Args.length == 1)
     {
@@ -148,7 +148,7 @@ if (Args.length > 0 && isTemplate!pred)
  */
 template ZipWith(alias f, Tuples...)
 if (Tuples.length > 0
- && isTemplate!f
+ && __traits(isTemplate, f)
  && allSatisfy!(ApplyLeft!(isInstanceOf, Tuple), Tuples))
 {
     private template GetIth(size_t i, Args...)
@@ -448,7 +448,7 @@ if (isInstanceOf!(Set, S1) && isInstanceOf!(Set, S2))
  *          to $(D_INLINECODE Args[1]), $(D_KEYWORD false) otherwise.
  */
 template isLessEqual(alias cmp, Args...)
-if (Args.length == 2 && isTemplate!cmp)
+if (Args.length == 2 && __traits(isTemplate, cmp))
 {
     private enum result = cmp!(Args[1], Args[0]);
     static if (is(typeof(result) == bool))
@@ -495,7 +495,7 @@ if (Args.length == 2 && isTemplate!cmp)
  *          equal to $(D_INLINECODE Args[1]), $(D_KEYWORD false) otherwise.
  */
 template isGreaterEqual(alias cmp, Args...)
-if (Args.length == 2 && isTemplate!cmp)
+if (Args.length == 2 && __traits(isTemplate, cmp))
 {
     private enum result = cmp!Args;
     static if (is(typeof(result) == bool))
@@ -542,7 +542,7 @@ if (Args.length == 2 && isTemplate!cmp)
  *          $(D_INLINECODE Args[1]), $(D_KEYWORD false) otherwise.
  */
 template isLess(alias cmp, Args...)
-if (Args.length == 2 && isTemplate!cmp)
+if (Args.length == 2 && __traits(isTemplate, cmp))
 {
     private enum result = cmp!Args;
     static if (is(typeof(result) == bool))
@@ -589,7 +589,7 @@ if (Args.length == 2 && isTemplate!cmp)
  *          $(D_INLINECODE Args[1]), $(D_KEYWORD false) otherwise.
  */
 template isGreater(alias cmp, Args...)
-if (Args.length == 2 && isTemplate!cmp)
+if (Args.length == 2 && __traits(isTemplate, cmp))
 {
     private enum result = cmp!Args;
     static if (is(typeof(result) == bool))
@@ -637,7 +637,7 @@ if (Args.length == 2)
 {
     static if ((is(typeof(Args[0] == Args[1])) && (Args[0] == Args[1]))
             || (isTypeTuple!Args && is(Args[0] == Args[1]))
-            || isSame!Args)
+            || __traits(isSame, Args[0], Args[1]))
     {
         enum bool isEqual = true;
     }
@@ -804,7 +804,7 @@ alias AliasSeq(Args...) = Args;
  *          $(D_PARAM F), $(D_KEYWORD false) otherwise.
  */
 template allSatisfy(alias F, L...)
-if (isTemplate!F)
+if (__traits(isTemplate, F))
 {
     static if (L.length == 0)
     {
@@ -842,7 +842,7 @@ if (isTemplate!F)
  *          $(D_PARAM F), $(D_KEYWORD false) otherwise.
  */
 template anySatisfy(alias F, L...)
-if (isTemplate!F)
+if (__traits(isTemplate, F))
 {
     static if (L.length == 0)
     {
@@ -945,6 +945,32 @@ template canFind(alias T, L...)
     static assert(canFind!(3, () {}, uint, 5, 3));
 }
 
+/*
+ * Tests whether $(D_PARAM T) is a template.
+ *
+ * $(D_PSYMBOL isTemplate) isn't $(D_KEYWORD true) for template instances,
+ * since the latter already represent some type. Only not instantiated
+ * templates, i.e. that accept some template parameters, are considered
+ * templates.
+ *
+ * Params:
+ *  T = A symbol.
+ *
+ * Returns: $(D_KEYWORD true) if $(D_PARAM T) is a template,
+ *          $(D_KEYWORD false) otherwise.
+ */
+private enum bool isTemplate(alias T) = __traits(isTemplate, T);
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static struct S(T)
+    {
+    }
+    static assert(isTemplate!S);
+    static assert(!isTemplate!(S!int));
+}
+
 /**
  * Combines multiple templates with logical AND. So $(D_PSYMBOL templateAnd)
  * evaluates to $(D_INLINECODE Preds[0] && Preds[1] && Preds[2]) and so on.
@@ -1049,7 +1075,7 @@ if (allSatisfy!(isTemplate, Preds))
  * Returns: Negated $(D_PARAM pred).
  */
 template templateNot(alias pred)
-if (isTemplate!pred)
+if (__traits(isTemplate, pred))
 {
     enum bool templateNot(T...) = !pred!T;
 }
@@ -1083,7 +1109,7 @@ if (isTemplate!pred)
  *          if not.
  */
 template isSorted(alias cmp, L...)
-if (isTemplate!cmp)
+if (__traits(isTemplate, cmp))
 {
     static if (L.length <= 1)
     {
@@ -1359,7 +1385,7 @@ template Reverse(L...)
  * Returns: Elements $(D_PARAM T) after applying $(D_PARAM F) to them.
  */
 template Map(alias F, T...)
-if (isTemplate!F)
+if (__traits(isTemplate, F))
 {
     static if (T.length == 0)
     {
@@ -1401,7 +1427,7 @@ if (isTemplate!F)
  * See_Also: $(LINK2 https://en.wikipedia.org/wiki/Merge_sort, Merge sort).
  */
 template Sort(alias cmp, L...)
-if (isTemplate!cmp)
+if (__traits(isTemplate, cmp))
 {
     private template merge(size_t A, size_t B)
     {

source/tanya/meta/trait.d

@@ -70,17 +70,7 @@ enum bool isWideString(T) = is(T : const dchar[]) && !isStaticArray!T;
     static assert(!isWideString!(dchar[10]));
 }
 
-/**
- * Finds the type with the smallest size in the $(D_PARAM Args) list. If
- * several types have the same type, the leftmost is returned.
- *
- * Params:
- *  Args = Type list.
- *
- * Returns: The smallest type.
- *
- * See_Also: $(D_PSYMBOL Largest).
- */
+deprecated("Use tanya.meta.transform.Smallest instead")
 template Smallest(Args...)
 if (Args.length >= 1)
 {
@@ -100,15 +90,6 @@ if (Args.length >= 1)
     }
 }
 
-///
-@nogc nothrow pure @safe unittest
-{
-    static assert(is(Smallest!(int, ushort, uint, short) == ushort));
-    static assert(is(Smallest!(short) == short));
-    static assert(is(Smallest!(ubyte[8], ubyte[5]) == ubyte[5]));
-    static assert(!is(Smallest!(short, 5)));
-}
-
 /**
  * Determines whether $(D_PARAM T) is a complex type.
  *
@@ -150,137 +131,7 @@ enum bool isComplex(T) = is(Unqual!(OriginalType!T) == cfloat)
     static assert(!isComplex!real);
 }
 
-/**
- * POD (Plain Old Data) is a $(D_KEYWORD struct) without constructors,
- * destructors and member functions.
- *
- * Params:
- *  T = A type.
- *
- * Returns: $(D_KEYWORD true) if $(D_PARAM T) is a POD type,
- *          $(D_KEYWORD false) otherwise.
- */
-deprecated("Use __traits(isPOD) instead")
-enum bool isPOD(T) = __traits(isPOD, T);
-
-///
-@nogc nothrow pure @safe unittest
-{
-    struct S1
-    {
-        void method()
-        {
-        }
-    }
-    static assert(!isPOD!S1);
-
-    struct S2
-    {
-        void function() val; // Function pointer, not a member function.
-    }
-    static assert(isPOD!S2);
-
-    struct S3
-    {
-        this(this)
-        {
-        }
-    }
-    static assert(!isPOD!S3);
-}
-
-/**
- * Returns size of the type $(D_PARAM T).
- *
- * Params:
- *  T = A type.
- *
- * Returns: Size of the type $(D_PARAM T).
- */
-deprecated("Use T.sizeof instead")
-enum size_t sizeOf(T) = T.sizeof;
-
-///
-@nogc nothrow pure @safe unittest
-{
-    static assert(sizeOf!(bool function()) == size_t.sizeof);
-    static assert(sizeOf!bool == 1);
-    static assert(sizeOf!short == 2);
-    static assert(sizeOf!int == 4);
-    static assert(sizeOf!long == 8);
-    static assert(sizeOf!(void[16]) == 16);
-}
-
-/**
- * Returns the alignment of the type $(D_PARAM T).
- *
- * Params:
- *  T = A type.
- *
- * Returns: Alignment of the type $(D_PARAM T).
- */
-deprecated("Use T.alignof instead")
-enum size_t alignOf(T) = T.alignof;
-
-///
-@nogc nothrow pure @safe unittest
-{
-    static assert(alignOf!bool == bool.alignof);
-    static assert(is(typeof(alignOf!bool) == typeof(bool.alignof)));
-}
-
-/**
- * Tests whether $(D_INLINECODE Args[0]) and $(D_INLINECODE Args[1]) are the
- * same symbol.
- *
- * Params:
- *  Args = Two symbols to be tested.
- *
- * Returns: $(D_KEYWORD true) if $(D_PARAM Args) are the same symbol,
- *          $(D_KEYWORD false) otherwise.
- */
-deprecated("Use __traits(isSame) instead")
-template isSame(Args...)
-if (Args.length == 2)
-{
-    enum bool isSame = __traits(isSame, Args[0], Args[1]);
-}
-
-///
-@nogc nothrow pure @safe unittest
-{
-    static assert(isSame!("string", "string"));
-    static assert(!isSame!(string, immutable(char)[]));
-}
-
-/**
- * Tests whether $(D_PARAM T) is a template.
- *
- * $(D_PSYMBOL isTemplate) isn't $(D_KEYWORD true) for template instances,
- * since the latter already represent some type. Only not instantiated
- * templates, i.e. that accept some template parameters, are considered
- * templates.
- *
- * Params:
- *  T = A symbol.
- *
- * Returns: $(D_KEYWORD true) if $(D_PARAM T) is a template,
- *          $(D_KEYWORD false) otherwise.
- */
-deprecated("Use __traits(isTemplate) instead")
-enum bool isTemplate(alias T) = __traits(isTemplate, T);
-
-///
-@nogc nothrow pure @safe unittest
-{
-    static struct S(T)
-    {
-    }
-    static assert(isTemplate!S);
-    static assert(!isTemplate!(S!int));
-}
-
-/**
+/*
  * Tests whether $(D_PARAM T) is an interface.
  *
  * Params:
@@ -289,44 +140,7 @@ enum bool isTemplate(alias T) = __traits(isTemplate, T);
  * Returns: $(D_KEYWORD true) if $(D_PARAM T) is an interface,
  *          $(D_KEYWORD false) otherwise.
  */
-deprecated("Use is(T == interface) instead")
-enum bool isInterface(T) = is(T == interface);
-
-/**
- * Tests whether $(D_PARAM T) is a class.
- *
- * Params:
- *  T = A type.
- *
- * Returns: $(D_KEYWORD true) if $(D_PARAM T) is a class,
- *          $(D_KEYWORD false) otherwise.
- */
-deprecated("Use is(T == class) instead")
-enum bool isClass(T) = is(T == class);
-
-/**
- * Tests whether $(D_PARAM T) is a struct.
- *
- * Params:
- *  T = A type.
- *
- * Returns: $(D_KEYWORD true) if $(D_PARAM T) is a struct,
- *          $(D_KEYWORD false) otherwise.
- */
-deprecated("Use is(T == struct) instead")
-enum bool isStruct(T) = is(T == struct);
-
-/**
- * Tests whether $(D_PARAM T) is a enum.
- *
- * Params:
- *  T = A type.
- *
- * Returns: $(D_KEYWORD true) if $(D_PARAM T) is an enum,
- *          $(D_KEYWORD false) otherwise.
- */
-deprecated("Use is(T == enum) instead")
-enum bool isEnum(T) = is(T == enum);
+private enum bool isInterface(T) = is(T == interface);
 
 /**
  * Determines whether $(D_PARAM T) is a polymorphic type, i.e. a
@@ -352,6 +166,9 @@ enum bool isPolymorphicType(T) = is(T == class) || is(T == interface);
 }
 
 /**
+ * Determines whether the type $(D_PARAM T) has a static method
+ * named $(D_PARAM member).
+ *
  * Params:
  *  T      = Aggregate type.
  *  member = Symbol name.
@@ -1111,17 +928,7 @@ template mostNegative(T)
     static assert(mostNegative!cfloat == -cfloat.max);
 }
 
-/**
- * Finds the type with the largest size in the $(D_PARAM Args) list. If several
- * types have the same type, the leftmost is returned.
- *
- * Params:
- *  Args = Type list.
- *
- * Returns: The largest type.
- *
- * See_Also: $(D_PSYMBOL Smallest).
- */
+deprecated("Use tanya.meta.transform.Largest instead")
 template Largest(Args...)
 if (Args.length >= 1)
 {
@@ -1141,15 +948,6 @@ if (Args.length >= 1)
     }
 }
 
-///
-@nogc nothrow pure @safe unittest
-{
-    static assert(is(Largest!(int, short, uint) == int));
-    static assert(is(Largest!(short) == short));
-    static assert(is(Largest!(ubyte[8], ubyte[5]) == ubyte[8]));
-    static assert(!is(Largest!(short, 5)));
-}
-
 /**
  * Determines whether the type $(D_PARAM T) is copyable.
  *
@@ -1243,8 +1041,19 @@ enum bool isAbstractClass(T) = __traits(isAbstractClass, T);
     static assert(!isAbstractClass!E);
 }
 
-private enum bool isType(alias T) = is(T);
-private enum bool isType(T) = true;
+/**
+ * Checks whether $(D_PARAM T) is a type, same as `is(T)` does.
+ *
+ * Params:
+ *  T = A symbol.
+ *
+ * Returns: $(D_KEYWORD true) if $(D_PARAM T) is a type, $(D_KEYWORD false)
+ *          otherwise.
+ */
+enum bool isType(alias T) = is(T);
+
+/// ditto
+enum bool isType(T) = true;
 
 /**
  * Determines whether $(D_PARAM Args) contains only types.
@@ -2007,17 +1816,17 @@ alias TemplateOf(alias T : Base!Args, alias Base, Args...) = Base;
     static struct S(T)
     {
     }
-    static assert(isSame!(TemplateOf!(S!int), S));
+    static assert(__traits(isSame, TemplateOf!(S!int), S));
 
     static void func(T)()
     {
     }
-    static assert(isSame!(TemplateOf!(func!int), func));
+    static assert(__traits(isSame, TemplateOf!(func!int), func));
 
     template T(U)
     {
     }
-    static assert(isSame!(TemplateOf!(T!int), T));
+    static assert(__traits(isSame, TemplateOf!(T!int), T));
 }
 
 /**
@@ -2049,7 +1858,7 @@ template isInstanceOf(alias T, alias I)
 {
     static if (is(typeof(TemplateOf!I)))
     {
-        enum bool isInstanceOf = isSame!(TemplateOf!I, T);
+        enum bool isInstanceOf = __traits(isSame, TemplateOf!I, T);
     }
     else
     {
@@ -3179,3 +2988,99 @@ template Fields(T)
 
     static assert(is(Fields!short == AliasSeq!short));
 }
+
+/**
+ * Determines whether all $(D_PARAM Types) are the same.
+ *
+ * If $(D_PARAM Types) is empty, returns $(D_KEYWORD true).
+ *
+ * Params:
+ *  Types = Type sequence.
+ *
+ * Returns: $(D_KEYWORD true) if all $(D_PARAM Types) are the same,
+ *          $(D_KEYWORD false) otherwise.
+ */
+template allSameType(Types...)
+{
+    static if (Types.length == 0)
+    {
+        enum bool allSameType = true;
+    }
+    else
+    {
+        private enum bool sameType(T) = is(T == Types[0]);
+
+        enum bool allSameType = allSatisfy!(sameType, Types[1 .. $]);
+    }
+}
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static assert(allSameType!());
+    static assert(allSameType!int);
+    static assert(allSameType!(int, int, int));
+    static assert(!allSameType!(int, uint, int));
+    static assert(!allSameType!(int, uint, short));
+}
+
+/**
+ * Determines whether values of type $(D_PARAM T) can be compared for equality,
+ * i.e. using `==` or `!=` binary operators.
+ *
+ * Params:
+ *  T = Type to test.
+ *
+ * Returns: $(D_KEYWORD true) if $(D_PARAM T) can be compared for equality,
+ *          $(D_KEYWORD false) otherwise.
+ */
+enum bool isEqualityComparable(T) = ifTestable!(T, a => a == a);
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static assert(isEqualityComparable!int);
+}
+
+/**
+ * Determines whether values of type $(D_PARAM T) can be compared for ordering,
+ * i.e. using `>`, `>=`, `<` or `<=` binary operators.
+ *
+ * Params:
+ *  T = Type to test.
+ *
+ * Returns: $(D_KEYWORD true) if $(D_PARAM T) can be compared for ordering,
+ *          $(D_KEYWORD false) otherwise.
+ */
+enum bool isOrderingComparable(T) = ifTestable!(T, a => a > a);
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static assert(isOrderingComparable!int);
+}
+
+@nogc nothrow pure @safe unittest
+{
+    static struct DisabledOpEquals
+    {
+        @disable bool opEquals(typeof(this)) @nogc nothrow pure @safe;
+
+        int opCmp(typeof(this)) @nogc nothrow pure @safe
+        {
+            return 0;
+        }
+    }
+    static assert(!isEqualityComparable!DisabledOpEquals);
+    static assert(isOrderingComparable!DisabledOpEquals);
+
+    static struct OpEquals
+    {
+        bool opEquals(typeof(this)) @nogc nothrow pure @safe
+        {
+            return true;
+        }
+    }
+    static assert(isEqualityComparable!OpEquals);
+    static assert(!isOrderingComparable!OpEquals);
+}

source/tanya/meta/transform.d

@@ -18,6 +18,7 @@
  */
 module tanya.meta.transform;
 
+import tanya.meta.metafunction;
 import tanya.meta.trait;
 
 /**
@@ -701,7 +702,7 @@ alias TypeOf(T) = T;
 
 /// ditto
 template TypeOf(alias T)
-if (isExpressions!T || isTemplate!T)
+if (isExpressions!T || __traits(isTemplate, T))
 {
     alias TypeOf = typeof(T);
 }
@@ -717,3 +718,264 @@ if (isExpressions!T || isTemplate!T)
     static assert(is(TypeOf!true == bool));
     static assert(!is(TypeOf!(tanya.meta)));
 }
+
+// e.g. returns int for int**.
+private template FinalPointerTarget(T)
+{
+    static if (isPointer!T)
+    {
+        alias FinalPointerTarget = FinalPointerTarget!(PointerTarget!T);
+    }
+    else
+    {
+        alias FinalPointerTarget = T;
+    }
+}
+
+// Returns true if T1 is void* and T2 is some pointer.
+private template voidAndPointer(T1, T2)
+{
+    enum bool voidAndPointer = is(Unqual!(PointerTarget!T1) == void)
+                            && isPointer!T2;
+}
+
+// Type returned by the ternary operator.
+private alias TernaryType(T, U) = typeof(true ? T.init : U.init);
+
+/**
+ * Determines the type all $(D_PARAM Args) can be implicitly converted to.
+ *
+ * $(OL
+ *  $(LI If one of the arguments is $(D_KEYWORD void), the common type is
+ *       $(D_KEYWORD void).)
+ *  $(LI The common type of integers with the same sign is the type with a
+ *       larger size. Signed and unsigned integers don't have a common type.
+ *       Type qualifiers are only preserved if all arguments are the same
+ *       type.)
+ *  $(LI The common type of floating point numbers is the type with more
+ *       precision. Type qualifiers are only preserved if all arguments are
+ *       the same type.)
+ *  $(LI The common type of polymorphic objects is the next, more generic type
+ *       both objects inherit from, e.g. $(D_PSYMBOL Object).)
+ *  $(LI `void*` is concerned as a common type of pointers only if one of the
+ *       arguments is a void pointer.)
+ *  $(LI Other types have a common type only if their pointers have a common
+ *       type. It means that for example $(D_KEYWORD bool) and $(D_KEYWORD int)
+         don't have a common type. If the types fullfill this condition, the
+         common type is determined with the ternary operator, i.e.
+         `typeof(true ? T1.init : T2.init)` is evaluated.)
+ * )
+ *
+ * If $(D_PARAM Args) don't have a common type, $(D_PSYMBOL CommonType) is
+ * $(D_KEYWORD void).
+ *
+ * Params:
+ *  Args = Type list.
+ *
+ * Returns: Common type for $(D_PARAM Args) or $(D_KEYWORD void) if
+ *          $(D_PARAM Args) don't have a common type.
+ */
+template CommonType(Args...)
+if (allSatisfy!(isType, Args))
+{
+    static if (Args.length == 0
+            || is(Unqual!(Args[0]) == void)
+            || is(Unqual!(Args[1]) == void))
+    {
+        alias CommonType = void;
+    }
+    else static if (Args.length == 1)
+    {
+        alias CommonType = Args[0];
+    }
+    else
+    {
+        private alias Pair = Args[0 .. 2];
+        private enum bool sameSigned = allSatisfy!(isIntegral, Pair)
+                                    && isSigned!(Args[0]) == isSigned!(Args[1]);
+
+        static if (is(Args[0] == Args[1]))
+        {
+            alias CommonType = CommonType!(Args[0], Args[2 .. $]);
+        }
+        else static if (sameSigned || allSatisfy!(isFloatingPoint, Pair))
+        {
+            alias CommonType = CommonType!(Unqual!(Largest!Pair),
+                                           Args[2 .. $]);
+        }
+        else static if (voidAndPointer!Pair
+                     || voidAndPointer!(Args[1], Args[0]))
+        {
+            // Workaround for https://issues.dlang.org/show_bug.cgi?id=15557.
+            // Determine the qualifiers returned by the ternary operator as if
+            // both pointers were int*. Then copy the qualifiers to void*.
+            alias P1 = CopyTypeQualifiers!(FinalPointerTarget!(Args[0]), int)*;
+            alias P2 = CopyTypeQualifiers!(FinalPointerTarget!(Args[1]), int)*;
+            static if (is(TernaryType!(P1, P2) U))
+            {
+                alias CommonType = CopyTypeQualifiers!(PointerTarget!U, void)*;
+            }
+            else
+            {
+                alias CommonType = void;
+            }
+        }
+        else static if ((isPointer!(Args[0]) || isPolymorphicType!(Args[0]))
+                     && is(TernaryType!Pair U))
+        {
+            alias CommonType = CommonType!(U, Args[2 .. $]);
+        }
+        else static if (is(TernaryType!(Args[0]*, Args[1]*)))
+        {
+            alias CommonType = CommonType!(TernaryType!Pair, Args[2 .. $]);
+        }
+        else
+        {
+            alias CommonType = void;
+        }
+    }
+}
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static assert(is(CommonType!(int, int, int) == int));
+    static assert(is(CommonType!(ubyte, ushort, uint) == uint));
+    static assert(is(CommonType!(int, uint) == void));
+
+    static assert(is(CommonType!(int, const int) == int));
+    static assert(is(CommonType!(const int, const int) == const int));
+
+    static assert(is(CommonType!(int[], const(int)[]) == const(int)[]));
+    static assert(is(CommonType!(string, char[]) == const(char)[]));
+
+    class A
+    {
+    }
+    static assert(is(CommonType!(const A, Object) == const Object));
+}
+
+@nogc nothrow pure @safe unittest
+{
+    static assert(is(CommonType!(void*, int*) == void*));
+    static assert(is(CommonType!(void*, const(int)*) == const(void)*));
+    static assert(is(CommonType!(void*, const(void)*) == const(void)*));
+    static assert(is(CommonType!(int*, void*) == void*));
+    static assert(is(CommonType!(const(int)*, void*) == const(void)*));
+    static assert(is(CommonType!(const(void)*, void*) == const(void)*));
+
+    static assert(is(CommonType!() == void));
+    static assert(is(CommonType!(int*, const(int)*) == const(int)*));
+    static assert(is(CommonType!(int**, const(int)**) == const(int*)*));
+
+    static assert(is(CommonType!(float, double) == double));
+    static assert(is(CommonType!(float, int) == void));
+
+    static assert(is(CommonType!(bool, const bool) == bool));
+    static assert(is(CommonType!(int, bool) == void));
+    static assert(is(CommonType!(int, void) == void));
+    static assert(is(CommonType!(Object, void*) == void));
+
+    class A
+    {
+    }
+    static assert(is(CommonType!(A, Object) == Object));
+    static assert(is(CommonType!(const(A)*, Object*) == const(Object)*));
+    static assert(is(CommonType!(A, typeof(null)) == A));
+
+    class B : A
+    {
+    }
+    class C : A
+    {
+    }
+    static assert(is(CommonType!(B, C) == A));
+
+    static struct S
+    {
+        int opCast(T : int)()
+        {
+            return 1;
+        }
+    }
+    static assert(is(CommonType!(S, int) == void));
+    static assert(is(CommonType!(const S, S) == const S));
+}
+
+/**
+ * Finds the type with the smallest size in the $(D_PARAM Args) list. If
+ * several types have the same type, the leftmost is returned.
+ *
+ * Params:
+ *  Args = Type list.
+ *
+ * Returns: The smallest type.
+ *
+ * See_Also: $(D_PSYMBOL Largest).
+ */
+template Smallest(Args...)
+if (Args.length >= 1)
+{
+    static assert(is(Args[0]), T.stringof ~ " doesn't have .sizeof property");
+
+    static if (Args.length == 1)
+    {
+        alias Smallest = Args[0];
+    }
+    else static if (Smallest!(Args[1 .. $]).sizeof < Args[0].sizeof)
+    {
+        alias Smallest = Smallest!(Args[1 .. $]);
+    }
+    else
+    {
+        alias Smallest = Args[0];
+    }
+}
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static assert(is(Smallest!(int, ushort, uint, short) == ushort));
+    static assert(is(Smallest!(short) == short));
+    static assert(is(Smallest!(ubyte[8], ubyte[5]) == ubyte[5]));
+    static assert(!is(Smallest!(short, 5)));
+}
+
+/**
+ * Finds the type with the largest size in the $(D_PARAM Args) list. If several
+ * types have the same type, the leftmost is returned.
+ *
+ * Params:
+ *  Args = Type list.
+ *
+ * Returns: The largest type.
+ *
+ * See_Also: $(D_PSYMBOL Smallest).
+ */
+template Largest(Args...)
+if (Args.length >= 1)
+{
+    static assert(is(Args[0]), T.stringof ~ " doesn't have .sizeof property");
+
+    static if (Args.length == 1)
+    {
+        alias Largest = Args[0];
+    }
+    else static if (Largest!(Args[1 .. $]).sizeof > Args[0].sizeof)
+    {
+        alias Largest = Largest!(Args[1 .. $]);
+    }
+    else
+    {
+        alias Largest = Args[0];
+    }
+}
+
+///
+@nogc nothrow pure @safe unittest
+{
+    static assert(is(Largest!(int, short, uint) == int));
+    static assert(is(Largest!(short) == short));
+    static assert(is(Largest!(ubyte[8], ubyte[5]) == ubyte[8]));
+    static assert(!is(Largest!(short, 5)));
+}

source/tanya/net/inet.d

@@ -14,7 +14,6 @@
  */
 module tanya.net.inet;
 
-import std.math;
 import tanya.meta.trait;
 import tanya.meta.transform;
 import tanya.range.primitive;
@@ -53,7 +52,7 @@ struct NetworkOrder(uint L)
     private StorageType value;
     private size_t size = L;
 
-    const pure nothrow @safe @nogc invariant
+    invariant
     {
         assert(this.size <= L);
     }
@@ -69,13 +68,13 @@ struct NetworkOrder(uint L)
      *  T      = Value type.
      *  value  = The value should be represented by this range.
      *
-     * Precondition: $(D_INLINECODE value <= 2 ^^ (length * 8) - 1).
+     * Precondition: $(D_INLINECODE value <= (2 ^^ (L * 8)) - 1).
      */
-    this(T)(const T value)
+    this(T)(T value)
     if (isUnsigned!T)
     in
     {
-        assert(value <= pow(2, L * 8) - 1);
+        assert(value <= (2 ^^ (L * 8)) - 1);
     }
     do
     {

source/tanya/net/uri.d

@@ -14,6 +14,7 @@
  */
 module tanya.net.uri;
 
+import tanya.conv;
 import tanya.encoding.ascii;
 import tanya.memory;
 
@@ -37,7 +38,7 @@ final class URIException : Exception
     this(string msg,
          string file = __FILE__,
          size_t line = __LINE__,
-         Throwable next = null) @nogc @safe pure nothrow
+         Throwable next = null) @nogc nothrow pure @safe
     {
         super(msg, file, line, next);
     }
@@ -82,7 +83,7 @@ struct URL
      *
      * Throws: $(D_PSYMBOL URIException) if the URL is malformed.
      */
-    this(const char[] source) pure @nogc
+    this(const char[] source) @nogc pure
     {
         ptrdiff_t pos = -1, endPos = source.length, start;
 
@@ -152,18 +153,15 @@ struct URL
                     goto ParsePath;
                 }
             }
-            else
+            else if (!parsePort(source[pos .. $]))
             {
                 // Schemas like mailto: and zlib: may not have any slash after
                 // them.
-                if (!parsePort(source[pos .. $]))
-                {
                 this.scheme = source[0 .. pos];
                 start = pos + 1;
                 goto ParsePath;
             }
         }
-        }
         else if (pos == 0 && parsePort(source[pos .. $]))
         {
             // An URL shouldn't begin with a port number.
@@ -305,26 +303,9 @@ struct URL
      *
      * Returns: Whether the port could be found.
      */
-    private bool parsePort(const char[] port) pure nothrow @safe @nogc
+    private bool parsePort(const(char)[] port) @nogc nothrow pure @safe
     {
-        ptrdiff_t i = 1;
-        float lPort = 0;
-
-        for (; i < port.length && port[i].isDigit() && i <= 6; ++i)
-        {
-            lPort += (port[i] - '0') / cast(float) (10 ^^ (i - 1));
-        }
-        if (i != 1 && (i == port.length || port[i] == '/'))
-        {
-            lPort *= 10 ^^ (i - 2);
-            if (lPort > ushort.max)
-            {
-                return false;
-            }
-            this.port = cast(ushort) lPort;
-            return true;
-        }
-        return false;
+        return stringToInt(port[1 .. $], this.port);
     }
 }
 

source/tanya/network/socket.d

@@ -16,11 +16,12 @@ module tanya.network.socket;
 
 import core.stdc.errno;
 import core.time;
-import std.algorithm.comparison;
 public import std.socket : SocketOption, SocketOptionLevel;
 import std.traits;
 import std.typecons;
+import tanya.algorithm.comparison;
 import tanya.memory;
+import tanya.os.error;
 
 /// Value returned by socket operations on error.
 enum int socketError = -1;
@@ -44,10 +45,8 @@ version (Posix)
 }
 else version (Windows)
 {
-    import core.sys.windows.winbase : ERROR_IO_INCOMPLETE,
-                                      ERROR_IO_PENDING,
-                                      GetModuleHandle,
-                                      GetProcAddress;
+    import core.sys.windows.winbase;
+    import core.sys.windows.winerror;
     import core.sys.windows.winsock2 : accept,
                                        addrinfo,
                                        bind,
@@ -68,6 +67,7 @@ else version (Windows)
                                        send,
                                        setsockopt,
                                        shutdown,
+                                       SO_TYPE,
                                        SOCKADDR,
                                        sockaddr,
                                        sockaddr_in,
@@ -76,7 +76,6 @@ else version (Windows)
                                        socket,
                                        socklen_t,
                                        SOL_SOCKET,
-                                       SO_TYPE,
                                        WSAGetLastError;
     import tanya.async.iocp;
     import tanya.sys.windows.def;
@@ -581,9 +580,7 @@ enum AddressFamily : int
     inet6     = 10,    /// IP version 6.
 }
 
-/**
- * Error codes for $(D_PSYMBOL Socket).
- */
+deprecated("Use tanya.os.error.ErrorCode.ErrorNo instead")
 enum SocketError : int
 {
     /// Unknown error.
@@ -621,7 +618,7 @@ enum SocketError : int
  */
 class SocketException : Exception
 {
-    const SocketError error = SocketError.unknown;
+    const ErrorCode.ErrorNo error = ErrorCode.ErrorNo.success;
 
     /**
      * Params:
@@ -637,7 +634,7 @@ class SocketException : Exception
     {
         super(msg, file, line, next);
 
-        foreach (member; EnumMembers!SocketError)
+        foreach (member; EnumMembers!(ErrorCode.ErrorNo))
         {
             if (member == lastError)
             {
@@ -647,24 +644,24 @@ class SocketException : Exception
         }
         if (lastError == ENOMEM)
         {
-            error = SocketError.noBufferSpaceAvailable;
+            error = ErrorCode.ErrorNo.noBufferSpace;
         }
         else if (lastError == EMFILE)
         {
-            error = SocketError.tooManyOpenSockets;
+            error = ErrorCode.ErrorNo.tooManyDescriptors;
         }
         else version (linux)
         {
             if (lastError == ENOSR)
             {
-                error = SocketError.networkDown;
+                error = ErrorCode.ErrorNo.networkDown;
             }
         }
         else version (Posix)
         {
             if (lastError == EPROTO)
             {
-                error = SocketError.networkDown;
+                error = ErrorCode.ErrorNo.networkDown;
             }
         }
     }

source/tanya/sys/linux/syscall.d

@@ -0,0 +1,47 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/*
+ * Copyright: Eugene Wissner 2018.
+ * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
+ *                  Mozilla Public License, v. 2.0).
+ * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)
+ * Source: $(LINK2 https://github.com/caraus-ecms/tanya/blob/master/source/tanya/sys/linux/syscall.d,
+ *                 tanya/sys/linux/syscall.d)
+ */
+module tanya.sys.linux.syscall;
+
+version (TanyaNative):
+
+extern ptrdiff_t syscall(ptrdiff_t, ptrdiff_t, ptrdiff_t)
+@nogc nothrow @system;
+
+extern ptrdiff_t syscall(ptrdiff_t,
+                         ptrdiff_t,
+                         ptrdiff_t,
+                         ptrdiff_t,
+                         ptrdiff_t,
+                         ptrdiff_t,
+                         ptrdiff_t) @nogc nothrow @system;
+
+// Same syscalls as above but pure.
+private template getOverloadMangling(size_t n)
+{
+    enum string getOverloadMangling = __traits(getOverloads,
+                                               tanya.sys.linux.syscall,
+                                               "syscall")[n].mangleof;
+}
+
+pragma(mangle, getOverloadMangling!0)
+extern ptrdiff_t syscall_(ptrdiff_t, ptrdiff_t, ptrdiff_t)
+@nogc nothrow pure @system;
+
+pragma(mangle, getOverloadMangling!1)
+extern ptrdiff_t syscall_(ptrdiff_t,
+                          ptrdiff_t,
+                          ptrdiff_t,
+                          ptrdiff_t,
+                          ptrdiff_t,
+                          ptrdiff_t,
+                          ptrdiff_t) @nogc nothrow pure @system;

source/tanya/sys/posix/mman.d

@@ -0,0 +1,31 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/*
+ * Copyright: Eugene Wissner 2018.
+ * License: $(LINK2 https://www.mozilla.org/en-US/MPL/2.0/,
+ *                  Mozilla Public License, v. 2.0).
+ * Authors: $(LINK2 mailto:info@caraus.de, Eugene Wissner)
+ * Source: $(LINK2 https://github.com/caraus-ecms/tanya/blob/master/source/tanya/sys/posix/mman.d,
+ *                 tanya/sys/posix/mman.d)
+ */
+module tanya.sys.posix.mman;
+
+version (TanyaNative):
+
+enum
+{
+    PROT_EXEC = 0x4, // Page can be executed.
+    PROT_NONE = 0x0, // Page cannot be accessed.
+    PROT_READ = 0x1, // Page can be read.
+    PROT_WRITE = 0x2, // Page can be written.
+}
+
+enum
+{
+    MAP_FIXED = 0x10, // Interpret addr exactly.
+    MAP_PRIVATE = 0x02, // Changes are private.
+    MAP_SHARED = 0x01, // Share changes.
+    MAP_ANONYMOUS = 0x20, // Don't use a file.
+}

source/tanya/sys/windows/error.d

@@ -10,6 +10,7 @@
  * Source: $(LINK2 https://github.com/caraus-ecms/tanya/blob/master/source/tanya/sys/windows/error.d,
  *                 tanya/sys/windows/error.d)
  */
+ deprecated("Use core.sys.windows.winerror instead")
 module tanya.sys.windows.error;
 
 version (Windows):

source/tanya/typecons.d

@@ -17,23 +17,9 @@
  */
 module tanya.typecons;
 
-import tanya.meta.metafunction;
+import tanya.meta.metafunction : AliasSeq, AliasTuple = Tuple, Map;
 
-/**
- * $(D_PSYMBOL Pair) can store two heterogeneous objects.
- *
- * The objects can by accessed by index as $(D_INLINECODE obj[0]) and
- * $(D_INLINECODE obj[1]) or by optional names (e.g.
- * $(D_INLINECODE obj.first)).
- *
- * $(D_PARAM Specs) contains a list of object types and names. First
- * comes the object type, then an optional string containing the name.
- * If you want the object be accessible only by its index (`0` or `1`),
- * just skip the name.
- *
- * Params:
- *  Specs = Field types and names.
- */
+deprecated("Use tanya.typecons.Tuple instead")
 template Pair(Specs...)
 {
     template parseSpecs(size_t fieldCount, Specs...)
@@ -47,13 +33,13 @@ template Pair(Specs...)
             static if (is(typeof(Specs[1]) == string))
             {
                 alias parseSpecs
-                    = AliasSeq!(Tuple!(Specs[0], Specs[1]),
+                    = AliasSeq!(AliasTuple!(Specs[0], Specs[1]),
                                 parseSpecs!(fieldCount + 1, Specs[2 .. $]));
             }
             else
             {
                 alias parseSpecs
-                    = AliasSeq!(Tuple!(Specs[0]),
+                    = AliasSeq!(AliasTuple!(Specs[0]),
                                 parseSpecs!(fieldCount + 1, Specs[1 .. $]));
             }
         }
@@ -90,10 +76,81 @@ template Pair(Specs...)
     }
 }
 
+/**
+ * $(D_PSYMBOL Tuple) can store two heterogeneous objects.
+ *
+ * The objects can by accessed by index as $(D_INLINECODE obj[0]) and
+ * $(D_INLINECODE obj[1]) or by optional names (e.g.
+ * $(D_INLINECODE obj.first)).
+ *
+ * $(D_PARAM Specs) contains a list of object types and names. First
+ * comes the object type, then an optional string containing the name.
+ * If you want the object be accessible only by its index (`0` or `1`),
+ * just skip the name.
+ *
+ * Params:
+ *  Specs = Field types and names.
+ */
+template Tuple(Specs...)
+{
+    template parseSpecs(size_t fieldCount, Specs...)
+    {
+        static if (Specs.length == 0)
+        {
+            alias parseSpecs = AliasSeq!();
+        }
+        else static if (is(Specs[0]) && fieldCount < 2)
+        {
+            static if (is(typeof(Specs[1]) == string))
+            {
+                alias parseSpecs
+                    = AliasSeq!(AliasTuple!(Specs[0], Specs[1]),
+                                parseSpecs!(fieldCount + 1, Specs[2 .. $]));
+            }
+            else
+            {
+                alias parseSpecs
+                    = AliasSeq!(AliasTuple!(Specs[0]),
+                                parseSpecs!(fieldCount + 1, Specs[1 .. $]));
+            }
+        }
+        else
+        {
+            static assert(false, "Invalid argument: " ~ Specs[0].stringof);
+        }
+    }
+
+    alias ChooseType(alias T) = T.Seq[0];
+    alias ParsedSpecs = parseSpecs!(0, Specs);
+
+    static assert(ParsedSpecs.length == 2, "Invalid argument count");
+
+    struct Tuple
+    {
+        /// Field types.
+        alias Types = Map!(ChooseType, ParsedSpecs);
+
+        // Create field aliases.
+        static if (ParsedSpecs[0].length == 2)
+        {
+            mixin("alias " ~ ParsedSpecs[0][1] ~ " = expand[0];");
+        }
+        static if (ParsedSpecs[1].length == 2)
+        {
+            mixin("alias " ~ ParsedSpecs[1][1] ~ " = expand[1];");
+        }
+
+        /// Represents the values of the $(D_PSYMBOL Tuple) as a list of values.
+        Types expand;
+
+        alias expand this;
+    }
+}
+
 ///
 @nogc nothrow pure @safe unittest
 {
-    auto pair = Pair!(int, "first", string, "second")(1, "second");
+    auto pair = Tuple!(int, "first", string, "second")(1, "second");
     assert(pair.first == 1);
     assert(pair[0] == 1);
     assert(pair.second == "second");
@@ -102,16 +159,16 @@ template Pair(Specs...)
 
 @nogc nothrow pure @safe unittest
 {
-    static assert(is(Pair!(int, int)));
-    static assert(!is(Pair!(int, 5)));
+    static assert(is(Tuple!(int, int)));
+    static assert(!is(Tuple!(int, 5)));
 
-    static assert(is(Pair!(int, "first", int)));
-    static assert(is(Pair!(int, "first", int, "second")));
-    static assert(is(Pair!(int, "first", int)));
+    static assert(is(Tuple!(int, "first", int)));
+    static assert(is(Tuple!(int, "first", int, "second")));
+    static assert(is(Tuple!(int, "first", int)));
 
-    static assert(is(Pair!(int, int, "second")));
-    static assert(!is(Pair!("first", int, "second", int)));
-    static assert(!is(Pair!(int, int, int)));
+    static assert(is(Tuple!(int, int, "second")));
+    static assert(!is(Tuple!("first", int, "second", int)));
+    static assert(!is(Tuple!(int, int, int)));
 
-    static assert(!is(Pair!(int, "first")));
+    static assert(!is(Tuple!(int, "first")));
 }