@@ -603,12 +603,12 @@ package(mir) template allFlattened(args...)
603603 static if (args.length)
604604 {
605605 alias arg = args[0 ];
606- @optmath @property ls ()()
606+ @optmath @property allFlattenedMod ()()
607607 {
608608 import mir.ndslice.topology: flattened;
609609 return flattened (arg);
610610 }
611- alias allFlattened = AliasSeq! (ls , allFlattened! (args[1 .. $]));
611+ alias allFlattened = AliasSeq! (allFlattenedMod , allFlattened! (args[1 .. $]));
612612 }
613613 else
614614 alias allFlattened = AliasSeq! ();
697697 private enum Mir_disable_inlining_in_reduce = false ;
698698}
699699
700- S reduceImpl (alias fun, S, Slices... )(S seed, scope Slices slices)
700+ S reduceImpl (alias fun, S, Slices... )(S seed, Slices slices)
701701{
702702 do
703703 {
@@ -744,7 +744,7 @@ template reduce(alias fun)
744744 Returns:
745745 the accumulated `result`
746746 +/
747- @optmath auto reduce(S, Slices... )(S seed, scope Slices slices)
747+ @optmath auto reduce(S, Slices... )(S seed, Slices slices)
748748 if (Slices.length)
749749 {
750750 static if (Slices.length > 1 )
@@ -767,7 +767,7 @@ template reduce(alias fun)
767767 }
768768 else version (Mir_disable_inlining_in_reduce)
769769 // As above, but with inlining disabled.
770- @optmath auto reduce(S, Slices... )(S seed, scope Slices slices)
770+ @optmath auto reduce(S, Slices... )(S seed, Slices slices)
771771 if (Slices.length)
772772 {
773773 static if (Slices.length > 1 )
@@ -952,7 +952,7 @@ version(mir_test) unittest
952952 assert (a == 7 );
953953}
954954
955- void eachImpl (alias fun, Slices... )(scope Slices slices)
955+ void eachImpl (alias fun, Slices... )(Slices slices)
956956{
957957 foreach (ref slice; slices)
958958 assert (! slice.empty);
@@ -961,14 +961,14 @@ void eachImpl(alias fun, Slices...)(scope Slices slices)
961961 static if (DimensionCount! (Slices[0 ]) == 1 )
962962 fun(frontOf! slices);
963963 else
964- .eachImpl! fun(frontOf ! slices);
964+ .eachImpl! fun(frontOf2 ! slices);
965965 foreach_reverse (i; Iota! (Slices.length))
966966 slices[i].popFront;
967967 }
968968 while (! slices[0 ].empty);
969969}
970970
971- void chequerEachImpl (alias fun, Slices... )(Chequer color, scope Slices slices)
971+ void chequerEachImpl (alias fun, Slices... )(Chequer color, Slices slices)
972972{
973973 foreach (ref slice; slices)
974974 assert (! slice.empty);
@@ -1116,7 +1116,7 @@ template each(alias fun)
11161116 Params:
11171117 slices = One or more slices, ranges, and arrays.
11181118 +/
1119- @optmath auto each(Slices... )(scope Slices slices)
1119+ @optmath auto each(Slices... )(Slices slices)
11201120 if (Slices.length && ! is (Slices[0 ] : Chequer))
11211121 {
11221122 static if (Slices.length > 1 )
@@ -1140,7 +1140,7 @@ template each(alias fun)
11401140 color = $(LREF Chequer).
11411141 slices = One or more slices.
11421142 +/
1143- @optmath auto each(Slices... )(Chequer color, scope Slices slices)
1143+ @optmath auto each(Slices... )(Chequer color, Slices slices)
11441144 if (Slices.length && allSatisfy! (isSlice, Slices))
11451145 {
11461146 static if (Slices.length > 1 )
@@ -2139,7 +2139,7 @@ version(mir_test) unittest
21392139 assert (bi == [0 , 0 ]);
21402140}
21412141
2142- size_t anyImpl (alias fun, Slices... )(scope Slices slices)
2142+ size_t anyImpl (alias fun, Slices... )(Slices slices)
21432143 if (Slices.length)
21442144{
21452145 static if (__traits(isSame, fun, naryFun! " a" ) && is (S : Slice! (FieldIterator! (BitField! (Field , I))), Field , I))
@@ -2164,7 +2164,7 @@ size_t anyImpl(alias fun, Slices...)(scope Slices slices)
21642164 }
21652165 else
21662166 {
2167- if (anyImpl! fun(frontOf ! slices))
2167+ if (anyImpl! fun(frontOf2 ! slices))
21682168 return true ;
21692169 }
21702170 foreach_reverse (ref slice; slices)
@@ -2195,7 +2195,7 @@ template any(alias pred = "a")
21952195 Constraints:
21962196 All slices must have the same shape.
21972197 +/
2198- @optmath bool any(Slices... )(scope Slices slices)
2198+ @optmath bool any(Slices... )(Slices slices)
21992199 if ((Slices.length == 1 || ! __traits(isSame, pred, " a" )) && Slices.length)
22002200 {
22012201 static if (Slices.length > 1 )
@@ -2299,7 +2299,7 @@ version(mir_test) unittest
22992299 [8 , 8 , 5 ]]);
23002300}
23012301
2302- size_t allImpl (alias fun, Slices... )(scope Slices slices)
2302+ size_t allImpl (alias fun, Slices... )(Slices slices)
23032303 if (Slices.length)
23042304{
23052305 static if (__traits(isSame, fun, naryFun! " a" ) && is (S : Slice! (FieldIterator! (BitField! (Field , I))), Field , I))
@@ -2324,7 +2324,7 @@ size_t allImpl(alias fun, Slices...)(scope Slices slices)
23242324 }
23252325 else
23262326 {
2327- if (! allImpl! fun(frontOf ! slices))
2327+ if (! allImpl! fun(frontOf2 ! slices))
23282328 return false ;
23292329 }
23302330 foreach_reverse (ref slice; slices)
@@ -2355,7 +2355,7 @@ template all(alias pred = "a")
23552355 Constraints:
23562356 All slices must have the same shape.
23572357 +/
2358- @optmath bool all(Slices... )(scope Slices slices)
2358+ @optmath bool all(Slices... )(Slices slices)
23592359 if ((Slices.length == 1 || ! __traits(isSame, pred, " a" )) && Slices.length)
23602360 {
23612361 static if (Slices.length > 1 )
@@ -2485,7 +2485,7 @@ template count(alias fun)
24852485 Constraints:
24862486 All slices must have the same shape.
24872487 +/
2488- @optmath size_t count(Slices... )(scope Slices slices)
2488+ @optmath size_t count(Slices... )(Slices slices)
24892489 if (Slices.length)
24902490 {
24912491 static if (Slices.length > 1 )
@@ -2605,7 +2605,7 @@ template equal(alias pred = "a == b")
26052605 Returns:
26062606 `true` any of the elements verify `pred` and `false` otherwise.
26072607 +/
2608- bool equal (Slices... )(scope Slices slices)
2608+ bool equal (Slices... )(Slices slices)
26092609 if (Slices.length >= 2 )
26102610 {
26112611 import mir.internal.utility;
@@ -2823,7 +2823,7 @@ version(mir_test) unittest
28232823 assert (cmp(sl1[0 .. $ - 1 , 0 .. $ - 3 ], sl1[0 .. $, 0 .. $ - 3 ]) < 0 );
28242824}
28252825
2826- size_t countImpl (alias fun, Slices... )(scope Slices slices)
2826+ size_t countImpl (alias fun, Slices... )(Slices slices)
28272827{
28282828 size_t ret;
28292829 alias S = Slices[0 ];
@@ -2850,7 +2850,7 @@ size_t countImpl(alias fun, Slices...)(scope Slices slices)
28502850 ret++ ;
28512851 }
28522852 else
2853- ret += .countImpl! fun(frontOf ! slices);
2853+ ret += .countImpl! fun(frontOf2 ! slices);
28542854 foreach_reverse (ref slice; slices)
28552855 slice.popFront;
28562856 }
0 commit comments