@@ -179,13 +179,13 @@ alias Observation = mir_observation;
179
179
// / Convenient function for $(LREF Observation) construction.
180
180
auto observation (Index, Data)(Index index, Data data)
181
181
{
182
- return Observation ! (Index, Data)(index, data);
182
+ return mir_observation ! (Index, Data)(index, data);
183
183
}
184
184
185
185
/+ +
186
186
Convinient alias for 1D Contiguous $(LREF Series).
187
187
+/
188
- alias SeriesMap (K, V) = Series ! (K* , V* );
188
+ alias SeriesMap (K, V) = mir_series ! (K* , V* );
189
189
190
190
// /
191
191
version (mir_test) unittest
@@ -219,12 +219,24 @@ Plain index series data structure.
219
219
Index is assumed to be sorted.
220
220
$(LREF sort) can be used to normalise a series.
221
221
+/
222
- struct mir_series (IndexIterator, Iterator , size_t N = 1 , SliceKind kind = Contiguous)
222
+ struct mir_series (IndexIterator_, Iterator_ , size_t N_ = 1 , SliceKind kind_ = Contiguous)
223
223
{
224
224
import std.range : SearchPolicy, assumeSorted;
225
225
226
226
private enum doUnittest = is (typeof (this ) == Series! (int * , double * ));
227
227
228
+ // /
229
+ alias IndexIterator = IndexIterator_;
230
+
231
+ // /
232
+ alias Iterator = Iterator_;
233
+
234
+ // /
235
+ enum size_t N = N_ ;
236
+
237
+ // /
238
+ enum SliceKind kind = kind_;
239
+
228
240
// /
229
241
Slice! (Iterator, N, kind) _data;
230
242
0 commit comments