fixup docs

Author: 9il

source/mir/ndslice/filling.d

@@ -20,6 +20,7 @@ Fills a matrix with the terms of a geometric progression in each row.
 Params:
     matrix = `m × n` matrix to fill
     vec = vector of progression coefficients length of `m`
+See_also: $(LINK2 https://en.wikipedia.org/wiki/Vandermonde_matrix, Vandermonde matrix)
 +/
 void fillVandermonde(F, SliceKind matrixKind, SliceKind kind)(Slice!(F*, 2, matrixKind) matrix, Slice!(const(F)*, 1, kind) vec)
 in {

source/mir/ndslice/slice.d

@@ -260,17 +260,6 @@ auto sliced(size_t N, Iterator)(Iterator iterator, size_t[N] lengths...)
 /// $(LINK2 https://en.wikipedia.org/wiki/Vandermonde_matrix, Vandermonde matrix)
 @safe pure nothrow version(mir_test) unittest
 {
-    auto vandermondeMatrix(Slice!(double*) x)
-        @safe nothrow pure
-    {
-        import mir.ndslice.allocation: slice;
-        auto ret = slice!double(x.length, x.length);
-        foreach (i; 0 .. x.length)
-        foreach (j; 0 .. x.length)
-            ret[i][j] = x[i] ^^ j;
-        return ret;
-    }
-
     import mir.ndslice.filling: fillVandermonde;
     import mir.ndslice.allocation: uninitSlice;
     auto x = [1.0, 2, 3, 4, 5].sliced;