forked from DlangScience/scid
-
Notifications
You must be signed in to change notification settings - Fork 8
/
vector.d
468 lines (392 loc) · 12.6 KB
/
vector.d
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
module scid.vector;
import scid.storage.array;
import scid.storage.arrayview;
import scid.storage.external;
import scid.storage.cowarray;
import scid.storage.constant;
import scid.common.traits;
import scid.common.meta;
import scid.ops.eval;
import std.traits, std.range, std.algorithm, std.conv;
import scid.internal.assertmessages;
enum VectorType {
Row, Column
}
/**
This template allows for the creation of SciD's vector storage type. A
SciD Vector is a one-dimensional array-like object that has reference-counted
copy-on-write semantics. It can be used in SciD expressions. VectorType
controls whether the vector is treated as a row or column vector.
Examples:
---
// Create a Vector from an existing array.
double[] arr = [1.0, 2.0, 3.0];
auto vec1 = Vector!double(arr);
vec1[0] = 42;
assert(arr[0] == 1); // The array is copied, not aliased.
auto vec2 = vec1;
vec2[1] = 84;
assert(vec1[1] == 2); // Value semantics.
// Create a Vector from a type and a length.
auto vec3 = Vector!(double, VectorType.Row)(3);
vec3[0] = 8;
vec3[1] = 6;
vec3[2] = 7;
// This is allowed because vec3 is a row vector and vec1 is a column
// vector.
auto expr = vec3 * vec1;
// This is not allowed because vec1 and vec2 are both column vectors.
auto fails = vec1 * vec2;
---
*/
template Vector( ElementOrStorage, VectorType vectorType = VectorType.Column )
if( isScalar!(BaseElementType!ElementOrStorage) ) {
static if( isScalar!ElementOrStorage )
alias BasicVector!( ArrayStorage!( ElementOrStorage, vectorType ) ) Vector;
else
alias BasicVector!( ElementOrStorage ) Vector;
}
/**
Convenience function for creating a Vector from an existing array, using the
array's element type.
Examples:
---
double[] arr = [1.0, 2.0, 3.0];
// The following are equivalent:
auto vec1 = vector(arr);
auto vec2 = Vector!double(arr);
---
*/
Vector!( T, vectorType )
vector( T, VectorType vectorType = VectorType.Column )( T[] array ) {
return typeof(return)(array);
}
unittest {
// Test examples, except use convenience functions where possible.
// Create a Vector from an existing array.
double[] arr = [1.0, 2.0, 3.0];
auto vec1 = vector(arr);
vec1[0] = 42;
assert(arr[0] == 1); // The array is copied, not aliased.
auto vec2 = vec1;
vec2[1] = 84;
assert(vec1[1] == 2); // Value semantics.
// Create a Vector from a type and a length.
auto vec3 = Vector!(double, VectorType.Row)(3);
vec3[0] = 8;
vec3[1] = 6;
vec3[2] = 7;
// This is allowed because vec3 is a row vector and vec1 is a column
// vector.
auto expr = vec3 * vec1;
}
template VectorView( ElementOrStorage, VectorType vectorType = VectorType.Column )
if( isScalar!(BaseElementType!ElementOrStorage) ) {
alias BasicVector!( ArrayViewStorage!( ElementOrStorage, vectorType ) ) VectorView;
}
template StridedVectorView( ElementOrStorage, VectorType vectorType = VectorType.Column )
if( isScalar!(BaseElementType!ElementOrStorage) ) {
alias BasicVector!( StridedArrayViewStorage!( ElementOrStorage, vectorType ) ).View StridedVectorView;
}
/**
Template for creating a Vector-like view of a D array. These have reference
semantics, since they are views instead of full-blown copy-on-write containers.
vectorType controls whether the view is treated by SciD as a row or column
vector. This can be used in multiple ways:
---
// Create a Vector-like view of an existing array. This object will have
// reference semantics and will use the storage from the existing array.
double[] arr = [1.0, 2.0, 3.0];
auto view1 = ExternalVectorView!double(arr);
view1[0] = 42;
assert(arr[0] == 42); // Same storage.
auto view2 = view1;
view2[1] = 84;
assert(view1[1] == 84); // Reference semantics.
assert(arr[1] == 84); // Still using the same storage.
---
---
// Create a copy of an existing array using a custom allocator, and obtain
// a vector view of the copy.
auto alloc = newRegionAllocator();
double[] arr = [1.0, 2.0, 3.0];
auto view1 = ExternalVectorView!double(arr, alloc);
view1[0] = 42;
assert(arr[0] == 1); // Different storage.
auto view2 = view1;
view2[1] = 84;
assert(view1[1] == 84); // Reference semantics.
assert(arr[1] == 2);
---
---
// Create a new vector view of length 3 using a custom allocator.
auto alloc = newRegionAllocator();
auto vec1 = ExternalVectorView!double(3, alloc);
vec1[0] = 1;
auto vec2 = vec1;
vec2[0] = 84;
assert(vec1[0] == 84); // Reference semantics.
---
*/
template ExternalVectorView( ElementOrContainer, VectorType vectorType = VectorType.Column )
if( isScalar!( BaseElementType!ElementOrContainer ) ) {
static if( isScalar!ElementOrContainer ) {
alias BasicVector!(
ArrayViewStorage!(
ExternalArray!( ElementOrContainer, CowArrayRef!ElementOrContainer ),
vectorType
)
) ExternalVectorView;
} else {
alias BasicVector!(
ArrayViewStorage!(
ExternalArray!( BaseElementType!ElementOrContainer, ElementOrContainer ),
vectorType
)
) ExternalVectorView;
}
}
/**
Convenience functions for creating an ExternalVectorView from an array,
using the inferred element type of the array.
Examples:
---
double[] arr = [1.0, 2, 3];
// These two lines are equivalent:
auto view1 = externalVectorView(arr);
auto view2 = ExternalVectorView!(double)(arr);
auto alloc = newRegionAllocator();
// These two lines are also equivalent.
auto view3 = externalVectorView(arr, alloc);
auto view4 = ExternalVectorView!double(arr, alloc);
---
*/
ExternalVectorView!( T, vectorType )
externalVectorView( VectorType vectorType = VectorType.Column, T )( T[] array ) {
return typeof(return)(array);
}
/// Ditto
ExternalVectorView!( T, vectorType )
externalVectorView( VectorType vectorType = VectorType.Column, T, Allocator )
( T[] array, Allocator alloc ) {
return typeof(return)(array, alloc);
}
unittest {
// Test the examples, except use the convenience functions where possible.
double[] arr = [1.0, 2.0, 3.0];
auto view1 = externalVectorView(arr);
view1[0] = 42;
assert(arr[0] == 42); // Same storage.
auto view2 = view1;
view2[1] = 84;
assert(view1[1] == 84); // Reference semantics.
assert(arr[1] == 84); // Still using the same storage.
}
unittest {
import scid.internal.regionallocator;
auto alloc = newRegionAllocator();
double[] arr = [1.0, 2.0, 3.0];
auto view1 = externalVectorView(arr, alloc);
view1[0] = 42;
assert(arr[0] == 1); // Different storage.
auto view2 = view1;
view2[1] = 84;
assert(view1[1] == 84); // Reference semantics.
assert(arr[1] == 2);
}
unittest {
import scid.internal.regionallocator;
auto alloc = newRegionAllocator();
auto vec1 = ExternalVectorView!double(3, alloc);
vec1[0] = 1;
auto vec2 = vec1;
vec2[0] = 84;
assert(vec1[0] == 84); // Reference semantics.
}
struct BasicVector( Storage_ ) {
alias BaseElementType!Storage ElementType;
alias Storage_ Storage;
alias BasicVector!( typeof(Storage.init.view(0,0)) ) View;
alias BasicVector!( Storage.Transposed ) Transposed;
alias storage this;
static if( is( Storage.Temporary ) )
alias BasicVector!( Storage.Temporary ) Temporary;
else
alias typeof( this ) Temporary;
static if( is( typeof(Storage.vectorType) ) )
alias Storage.vectorType vectorType;
else
alias VectorType.Column vectorType;
/** Whether the storage can be resized. */
enum isResizable = is( typeof( Storage.init.resize(0) ) );
static if( is( typeof(Storage.init.view(0,0,0)) R ) )
alias BasicVector!R StridedView;
//static assert( isVectorStorage!Storage );
this( A... )( A args ) if( A.length > 0 && !is( A[0] : Storage ) && !isVector!(A[0]) && !isExpression!(A[0]) ) {
storage = Storage(args);
}
this( Expr )( Expr expr ) if( isExpression!Expr ) {
this[] = expr;
}
this( A )( BasicVector!A other ) {
static if( is( A : Storage ) ) storage = other.storage;
else this[] = other;
}
this()( auto ref Storage stor ) {
storage = stor;
}
ElementType opIndex( size_t i ) const {
return storage.index( i );
}
ElementType opIndexAssign( ElementType rhs, size_t i ) {
storage.indexAssign( rhs, i );
return rhs;
}
ElementType opIndexOpAssign( string op )( ElementType rhs, size_t i ) {
storage.indexAssign!op( rhs, i );
return storage.index( i );
}
ref typeof(this) opAssign( typeof(this) rhs ) {
move( rhs.storage, storage );
return this;
}
typeof( this ) opSlice() {
return typeof(this)( storage );
}
typeof( this ) opSlice( size_t start, size_t end ) {
return typeof(this)( storage.slice( start, end ) );
}
bool opEquals( Rhs )( Rhs rhs ) const if( isInputRange!Rhs ) {
size_t i = 0;
foreach( x ; rhs ) {
if( i >= length || this[ i ++ ] != x )
return false;
}
return true;
}
/** Resize the vector and leave the memory uninitialized. If not resizeable simply check that the length is
correct.
*/
void resize( size_t newLength, void* ) {
static if( isResizable ) {
storage.resize( newLength, null );
} else {
assert( length == newLength );
}
}
/** Resize the vectors and set all the elements to zero. If not resizeable, check that the length is correct
and just set the elements to zero.
*/
void resize( size_t newLength ) {
static if( isResizable ) {
storage.resize( newLength );
} else {
this.resize( newLength, null );
evalScaling( Zero!ElementType, this );
}
}
void opSliceAssign( Rhs )( auto ref Rhs rhs ) {
static if( is( Rhs E : E[] ) && isConvertible!( E, ElementType ) )
evalCopy( ExternalVectorView!( E, vectorType )( rhs ), this );
else static if( closureOf!Rhs == Closure.Scalar )
evalCopy( relatedConstant( rhs, this ), this );
else {
evalCopy( rhs, this );
}
}
void opSliceAssign( Rhs )( Rhs rhs, size_t start, size_t end ) {
view( start, end )[] = rhs;
}
void opSliceOpAssign( string op, Rhs )( auto ref Rhs rhs ) if( op == "+" || op == "-" ) {
enum scalarRhs = closureOf!Rhs == Closure.Scalar;
static if( op == "+" ) {
static if( scalarRhs ) evalScaledAddition( One!ElementType, relatedConstant(rhs, this), this );
else evalScaledAddition( One!ElementType, rhs, this );
} else static if( op == "-" ) {
static if( scalarRhs ) evalScaledAddition( One!ElementType, relatedConstant(-rhs, this), this );
else evalScaledAddition( MinusOne!ElementType, rhs, this );
}
}
void opSliceOpAssign( string op, Rhs )( auto ref Rhs rhs ) if( (op == "*" || op == "/") && isConvertible!(Rhs,ElementType) ) {
static if( op == "/" )
rhs = One!ElementType / rhs;
evalScaling( to!ElementType(rhs), this );
}
void opSliceOpAssign( string op, Rhs )( auto ref Rhs rhs, size_t start, size_t end ) {
mixin( "view( start, end )[] " ~ op ~ "= rhs;" );
}
View view( size_t start, size_t end ) {
return typeof( return )( storage.view( start, end ) );
}
static if( is( StridedView ) ) {
StridedView view( size_t start, size_t end, size_t stride ) {
return typeof( return )( storage.view( start, end, stride ) );
}
}
static if( isInputRange!Storage ) {
void popFront() { storage.popFront(); }
void popBack() { storage.popBack(); }
}
@property {
bool empty() const {
static if( is(typeof(Storage.init.empty)) )
return storage.empty;
else
return storage.length == 0;
}
size_t length() const {
return storage.length;
}
ElementType front() const
in {
checkNotEmpty_!"front"();
} body {
static if( is( typeof(Storage.init.front) ) )
return storage.front;
else
return storage.index( 0 );
}
ElementType back() const
in {
checkNotEmpty_!"front"();
} body {
static if( is( typeof(Storage.init.back) ) )
return storage.back;
else
return storage.index( storage.length - 1 );
}
typeof( this ) save() {
return typeof( this )( storage );
}
}
string toString() const {
if( empty )
return "[]";
auto r = appender!string("[");
r.put( to!string( this[ 0 ] ) );
foreach( i ; 1 .. length ) {
r.put( ", " );
r.put( to!string( this[i] ) );
}
r.put( "]" );
return r.data();
}
alias toString pretty;
static if( vectorType == VectorType.Column ) mixin Operand!( Closure.ColumnVector );
else mixin Operand!( Closure.RowVector );
template Promote( T ) {
static if( isVector!T ) {
alias BasicVector!( Promotion!(Storage,T.Storage) ) Promote;
} else static if( isMatrix!T ) {
alias BasicVector!( Promotion!(Storage,T.Storage) ) Promote;
} else static if( isScalar!T ) {
alias BasicVector!( Promotion!(Storage,T) ) Promote;
}
}
Storage storage;
private:
mixin ArrayChecks;
}
unittest {
// TODO: Write tests for Vector.
}