fix docs

Author: 9il

.travis.yml

@@ -9,6 +9,7 @@ d:
  - ldc-1.4.0
  - ldc-1.5.0
  - ldc-1.6.0
+ - ldc-1.7.0
  - ldc
  - ldc-beta
  - dmd-nightly

appveyor.yml

@@ -8,7 +8,7 @@ environment:
     DVersion: 2.078.1
     arch: x86
   - DC: ldc
-    DVersion: '1.4.0'
+    DVersion: '1.7.0'
     arch: x64
 
 matrix:

source/mir/graph/tarjan.d

@@ -15,11 +15,13 @@ module mir.graph.tarjan;
 import std.traits;
 
 /++
-Tarjan's strongly connected components algorithm.
+Classic Tarjan's strongly connected components algorithm.
 
 Tarjan's algorithm is an algorithm in graph theory for finding the strongly connected components of a graph.
 It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm.
 
+The implementation is loop based. It does not use recursion and does not have stack overflow issues.
+
 Complexity: worst-case `O(|V| + |E|)`.
 
 Params:
@@ -209,7 +211,7 @@ auto tarjan(G, I = Unqual!(ForeachType!(ForeachType!G)))(G graph)
   0 -> 1 -> 2 -> 3 -> 10     9 <---
 ------
 +/
-@safe pure version(mir_test) unittest
+pure version(mir_test) unittest
 {
     import mir.graph.utility;
     import mir.ndslice.algorithm: each;
@@ -244,9 +246,9 @@ auto tarjan(G, I = Unqual!(ForeachType!(ForeachType!G)))(G graph)
 }
 
 /++
-Tests that the graph `0 -> 1 -> 2 -> 3 -> 4`` returns 4 components.
+Tests that the graph `0 -> 1 -> 2 -> 3 -> 4` returns 4 components.
 +/
-@safe pure version(mir_test) unittest
+pure version(mir_test) unittest
 {
     import mir.graph.utility;
 
@@ -276,7 +278,7 @@ Tests that the graph `0 -> 1 -> 2 -> 3 -> 4`` returns 4 components.
  1 <- 3 <-> 4 <-- 7 <--(links to self)
 ----
 +/
-@safe pure version(mir_test) unittest
+pure version(mir_test) unittest
 {
     import mir.graph.utility;
     import mir.ndslice.algorithm: each;
@@ -313,7 +315,7 @@ Tests that the graph `0 -> 1 -> 2 -> 3 -> 4`` returns 4 components.
   0
 -----
 +/
-@safe pure version(mir_test) unittest
+pure version(mir_test) unittest
 {
     import mir.graph.utility;
     import mir.ndslice.algorithm: each;
@@ -341,7 +343,7 @@ This test demonstrates a hard to detect bug, where vertices
 were being marked 'off-stack' after they were first visited,
 not when they were actually removed from the stack
 +/
-@safe pure version(mir_test) unittest
+pure version(mir_test) unittest
 {
     import mir.graph.utility;
     import mir.ndslice.algorithm: each;

source/mir/graph/utility.d

@@ -27,7 +27,7 @@ alias GraphSeries(T, I) = Series!(T*, Contiguous, [1], GraphIterator!I);
 Param:
     aaGraph = graph that is represented as associative array
 Returns:
-    A graph series composed of keys (`.index``) and arrays of indeces (`.d`)
+    A graph series composed of keys (`.index`) and arrays of indeces (`.d`)
 Complexity: `O(log(V) (V + E))`
 +/
 GraphSeries!(T, uint) graphSeries(T, Range)(in Range[T] aaGraph)
@@ -62,7 +62,7 @@ GraphSeries!(T, uint) graphSeries(T, Range)(in Range[T] aaGraph)
 }
 
 ///
-@safe pure version(mir_test) unittest
+pure version(mir_test) unittest
 {
     auto gs = [
         "b" : ["a"],

source/mir/series.d

@@ -1327,7 +1327,11 @@ ref V[K] insert(V, K, IndexIterator, SliceKind kind, size_t[] packs, Iterator)(r
     assert(a.series == series([1, 2, 3, 4], [3.0, 20, 30, 2]));
 }
 
+
+static if (__VERSION__ < 2078)
 //////////////////// OBJECT.d
+{
+
 private:
 
 extern (C)
@@ -1348,7 +1352,8 @@ extern (C)
     // alias _dg2_t = extern(D) int delegate(void*, void*);
     // int _aaApply2(void* aa, size_t keysize, _dg2_t dg);
 
-    private struct AARange { void* impl; size_t idx; }
+    // private struct AARange { void* impl; size_t idx; }
+    alias AARange = ReturnType!(object._aaRange);
     AARange _aaRange(void* aa) pure nothrow @nogc @safe;
     bool _aaRangeEmpty(AARange r) pure nothrow @nogc @safe;
     void* _aaRangeFrontKey(AARange r) pure nothrow @nogc @safe;
@@ -1412,3 +1417,5 @@ private AARange _aaToRange(T: V[K], K, V)(ref T aa) pure nothrow @nogc @safe
         const(V[K]) realAA = aa;
     return _aaRange(() @trusted { return cast(void*)realAA; } ());
 }
+
+}