Showing with 0 additions and 24 deletions.
  1. +0 −12 std/experimental/ndslice/selection.d
  2. +0 −12 std/experimental/ndslice/slice.d
12 changes: 0 additions & 12 deletions std/experimental/ndslice/selection.d
Original file line number Diff line number Diff line change
Expand Up @@ -940,13 +940,11 @@ auto byElement(size_t N, Range)(auto ref Slice!(N, Range) slice)

bool empty() const @property
{
pragma(inline, true);
return _length == 0;
}

size_t length() const @property
{
pragma(inline, true);
return _length;
}

Expand Down Expand Up @@ -1007,7 +1005,6 @@ auto byElement(size_t N, Range)(auto ref Slice!(N, Range) slice)

void popBack()
{
pragma(inline, true);
assert(_length != 0);
_length--;
}
Expand Down Expand Up @@ -1047,7 +1044,6 @@ auto byElement(size_t N, Range)(auto ref Slice!(N, Range) slice)
}
body
{
pragma(inline, true);
_length -= n;
}

Expand Down Expand Up @@ -1164,13 +1160,11 @@ auto byElement(size_t N, Range)(auto ref Slice!(N, Range) slice)
}
body
{
pragma(inline, true);
return typeof(return)(i, j);
}

size_t[N] index() @property
{
pragma(inline, true);
return _indexes;
}
}
Expand Down Expand Up @@ -1454,13 +1448,11 @@ auto byElementInStandardSimplex(size_t N, Range)(auto ref Slice!(N, Range) slice

bool empty() const @property
{
pragma(inline, true);
return _length == 0;
}

size_t length() const @property
{
pragma(inline, true);
return _length;
}

Expand All @@ -1479,14 +1471,12 @@ auto byElementInStandardSimplex(size_t N, Range)(auto ref Slice!(N, Range) slice
static if (PureN == 1 && isMutable!DeepElemType && !hasAccessByRef)
auto front(E)(E elem) @property
{
pragma(inline, true);
assert(!this.empty);
return _slice._ptr[0] = elem;
}

void popFront()
{
pragma(inline, true);
assert(_length != 0);
_length--;
popFrontImpl;
Expand All @@ -1511,7 +1501,6 @@ auto byElementInStandardSimplex(size_t N, Range)(auto ref Slice!(N, Range) slice

size_t[N] index() @property
{
pragma(inline, true);
return _indexes;
}
}
Expand Down Expand Up @@ -1688,7 +1677,6 @@ template IndexSlice(size_t N)

size_t[N] opIndex(size_t index) const
{
pragma(inline, true);
size_t[N] indexes = void;
foreach_reverse (i; Iota!(0, N - 1))
{
Expand Down
12 changes: 0 additions & 12 deletions std/experimental/ndslice/slice.d
Original file line number Diff line number Diff line change
Expand Up @@ -1279,7 +1279,6 @@ struct Slice(size_t _N, _Range)
+/
size_t[N] shape() @property const
{
pragma(inline, true);
return _lengths[0 .. N];
}

Expand Down Expand Up @@ -1308,7 +1307,6 @@ struct Slice(size_t _N, _Range)
+/
Structure!N structure() @property const
{
pragma(inline, true);
return typeof(return)(_lengths[0 .. N], _strides[0 .. N]);
}

Expand Down Expand Up @@ -1377,7 +1375,6 @@ struct Slice(size_t _N, _Range)
size_t length(size_t dimension = 0)() @property const
if (dimension < N)
{
pragma(inline, true);
return _lengths[dimension];
}

Expand Down Expand Up @@ -1438,7 +1435,6 @@ struct Slice(size_t _N, _Range)
@property const
if (dimension < N)
{
pragma(inline, true);
return _lengths[dimension] == 0;
}

Expand Down Expand Up @@ -1534,7 +1530,6 @@ struct Slice(size_t _N, _Range)
void popFront(size_t dimension = 0)()
if (dimension < N)
{
pragma(inline, true);
assert(_lengths[dimension], __FUNCTION__ ~ ": length!" ~ dimension.stringof ~ " should be greater than 0.");
_lengths[dimension]--;
_ptr += _strides[dimension];
Expand All @@ -1544,7 +1539,6 @@ struct Slice(size_t _N, _Range)
void popBack(size_t dimension = 0)()
if (dimension < N)
{
pragma(inline, true);
assert(_lengths[dimension], __FUNCTION__ ~ ": length!" ~ dimension.stringof ~ " should be greater than 0.");
_lengths[dimension]--;
}
Expand All @@ -1553,7 +1547,6 @@ struct Slice(size_t _N, _Range)
void popFrontExactly(size_t dimension = 0)(size_t n)
if (dimension < N)
{
pragma(inline, true);
assert(n <= _lengths[dimension],
__FUNCTION__ ~ ": n should be less than or equal to length!" ~ dimension.stringof);
_lengths[dimension] -= n;
Expand All @@ -1564,7 +1557,6 @@ struct Slice(size_t _N, _Range)
void popBackExactly(size_t dimension = 0)(size_t n)
if (dimension < N)
{
pragma(inline, true);
assert(n <= _lengths[dimension],
__FUNCTION__ ~ ": n should be less than or equal to length!" ~ dimension.stringof);
_lengths[dimension] -= n;
Expand All @@ -1574,7 +1566,6 @@ struct Slice(size_t _N, _Range)
void popFrontN(size_t dimension = 0)(size_t n)
if (dimension < N)
{
pragma(inline, true);
import std.algorithm.comparison : min;
popFrontExactly!dimension(min(n, _lengths[dimension]));
}
Expand All @@ -1583,7 +1574,6 @@ struct Slice(size_t _N, _Range)
void popBackN(size_t dimension = 0)(size_t n)
if (dimension < N)
{
pragma(inline, true);
import std.algorithm.comparison : min;
popBackExactly!dimension(min(n, _lengths[dimension]));
}
Expand Down Expand Up @@ -1958,7 +1948,6 @@ struct Slice(size_t _N, _Range)
}
body
{
pragma(inline, true);
return typeof(return)(i, j);
}

Expand Down Expand Up @@ -3114,7 +3103,6 @@ private struct PtrShell(Range)
void opOpAssign(string op)(sizediff_t shift)
if (op == `+` || op == `-`)
{
pragma(inline, true);
mixin (`_shift ` ~ op ~ `= shift;`);
}

Expand Down