diff --git a/source/tanya/container/list.d b/source/tanya/container/list.d index f7b13bb..23467e5 100644 --- a/source/tanya/container/list.d +++ b/source/tanya/container/list.d @@ -178,7 +178,6 @@ struct SList(T) @nogc nothrow pure @safe unittest { auto l = SList!int(2, 3); - assert(l.length == 2); assert(l.front == 3); } @@ -192,7 +191,6 @@ struct SList(T) @nogc nothrow pure @safe unittest { auto l = SList!int(2); - assert(l.length == 2); assert(l.front == 0); } @@ -432,7 +430,6 @@ struct SList(T) assert(l2.front == 25); l2.insertFront(l1[]); - assert(l2.length == 5); assert(l2.front == 9); } @@ -566,12 +563,6 @@ struct SList(T) assert(l1 == l2); } - deprecated - @property size_t length() const - { - return count(this[]); - } - /** * Comparison for equality. * @@ -1154,7 +1145,6 @@ struct DList(T) @nogc nothrow pure @safe unittest { auto l = DList!int(2, 3); - assert(l.length == 2); assert(l.front == 3); assert(l.back == 3); } @@ -1169,7 +1159,6 @@ struct DList(T) @nogc nothrow pure @safe unittest { auto l = DList!int(2); - assert(l.length == 2); assert(l.front == 0); } @@ -1480,7 +1469,6 @@ struct DList(T) assert(l2.back == 15); l2.insertFront(l1[]); - assert(l2.length == 5); assert(l2.front == 9); assert(l2.back == 15); } @@ -1600,7 +1588,6 @@ struct DList(T) assert(l2.back == 15); l2.insertBack(l1[]); - assert(l2.length == 5); assert(l2.back == 9); } @@ -1855,12 +1842,6 @@ struct DList(T) return insertAfter!(T[])(r, el[]); } - deprecated - @property size_t length() const - { - return count(this[]); - } - /** * Comparison for equality. * @@ -2354,7 +2335,6 @@ struct DList(T) l.insertAfter(l[], 234); assert(l.front == 234); assert(l.back == 234); - assert(l.length == 1); } @nogc nothrow pure @safe unittest