Merge branch 'master' of https://github.com/libmir/mir-algorithm

Author: 9il

source/mir/ndslice/slice.d

@@ -609,8 +609,6 @@ Slice!(Universal, N, Iterator)
     Iterator      _iterator
 -------
 +/
-alias Slice = mir_slice;
-/// ditto
 struct mir_slice(Iterator_, size_t N_ = 1, SliceKind kind_ = Contiguous)
     if (0 < N_ && N_ < 255 && !(kind_ == Canonical && N_ == 1))
 {
@@ -747,7 +745,7 @@ struct mir_slice(Iterator_, size_t N_ = 1, SliceKind kind_ = Contiguous)
         }
     }
 
-    public:
+public:
 
     static if (S == 0)
     {
@@ -2964,6 +2962,9 @@ struct mir_slice(Iterator_, size_t N_ = 1, SliceKind kind_ = Contiguous)
     }
 }
 
+/// ditto
+alias Slice = mir_slice;
+
 /++
 Slicing, indexing, and arithmetic operations.
 +/

source/mir/series.d

@@ -159,8 +159,6 @@ import std.meta;
 Plain index/time observation data structure.
 Observation are used as return tuple for for indexing $(LREF Series).
 +/
-alias Observation = mir_observation;
-/// ditto
 struct mir_observation(Index, Data)
 {
     /// Date, date-time, time, or index.
@@ -175,6 +173,9 @@ struct mir_observation(Index, Data)
     alias value = data;
 }
 
+/// ditto
+alias Observation = mir_observation;
+
 /// Convenient function for $(LREF Observation) construction.
 auto observation(Index, Data)(Index index, Data data)
 {
@@ -218,8 +219,6 @@ Plain index series data structure.
 Index is assumed to be sorted.
 $(LREF sort) can be used to normalise a series.
 +/
-alias Series = mir_series;
-/// ditto
 struct mir_series(IndexIterator, Iterator, size_t N = 1, SliceKind kind = Contiguous)
 {
     import std.range: SearchPolicy, assumeSorted;
@@ -1051,6 +1050,9 @@ struct mir_series(IndexIterator, Iterator, size_t N = 1, SliceKind kind = Contig
     }
 }
 
+/// ditto
+alias Series = mir_series;
+
 /// 1-dimensional data
 @safe pure version(mir_test) unittest
 {