You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
`ndslice` design was changed. New ndslices can be created on top of random access iterators including pointers. There are three kinds of ndslice:
236
+
)
237
+
238
+
$(P
239
+
$(UL
240
+
$(LI `Contiguous` - Contiguous in memory representation. It does not store strides and can be always flattened to 1 dimensional ndslice on top of the same iterator type. )
241
+
$(LI `Canonical` - BLAS like. Stride for row dimension assumed to be equal to 1.)
242
+
$(LI `Universal` - Numpy like. Each dimension has strides. All dimensions can be exchanged without reallocation. The old ndslice ABI corresponds to to the `Universal` ndslice.)
243
+
)
219
244
)
220
245
)
221
246
@@ -277,7 +302,7 @@ anyone using the `MersenneTwisterEngine` template directly.
277
302
278
303
$(P
279
304
The internal implementation has been reworked to use Ilya Yaroshenko's
280
-
highly optimized algorithm from `mir.random`. This should have a very
305
+
highly optimized algorithm from $(LINK2 https://github.com/libmir/mir-random, mir-random). This should have a very
281
306
noticeable positive effect for anyone who cares about generating a lot
0 commit comments