std/container/array.d

104     // set elements
349         static if (display) writefln("@%*Xh: This is where the array elements are.", nDigitsForPointer, &a [0]);
374  * This means that pointers to elements of an `Array` will become
453                 assert(0, "Cannot add elements to array because `" ~
464         void reserve(size_t elements)
466             if (elements <= capacity) return;
469                 const sz = elements;
475                 const sz = mulu(elements, T.sizeof, overflow);
496                         (elements - oldLength) * T.sizeof);
509             _capacity = elements;
625      *  `ConstRange` is a variant with `const` elements.
626      *  `ImmutableRange` is a variant with `immutable` elements.
637      * Duplicates the array. The elements themselves are not transitively
649      * Returns: `true` if and only if the array has no elements.
659      * Returns: The number of elements in the array.
675      * Returns: The maximum number of elements the array can store without
703      * iterators to the elements are invalidated.
707     void reserve(size_t elements)
709         if (elements > capacity)
712             _data.reserve(elements);
713             assert(capacity == elements); // Might need changing to ">=" if implementation of Payload.reserve is changed.
718      * Returns: A range that iterates over elements of the array in
739      * Returns: A range that iterates over elements of the array from
864      * $(BIGOH length + m), where `m` is the number of elements in `stuff`.
900      * Removes all the elements from the array and releases allocated memory.
912      * Sets the number of elements in the array to `newLength`. If `newLength`
913      * is greater than `length`, the new elements are added to the end of the
956      * Inserts the specified elements at the back of the array. `stuff` can be
959      * Returns: The number of elements inserted.
963      * where `m` is the number of elements in `stuff`.
1002      * do not throw if they could not remove `howMany` elements. Instead,
1003      * if `howMany > n`, all elements are removed. The returned value is
1004      * the effective number of elements removed. Both stable and non-stable
1008      * Returns: The number of elements removed.
1047         // Move elements over by one slot
1070             // Move elements over by extra slots
1157      * Removes all elements belonging to `r`, which must be a range
1160      * Returns: A range spanning the remaining elements in the array that
1234     // check if overlapping elements properly initialized
1921      * no elements.
1943      * Returns the number of elements in the array.
1954      * Returns: The maximum number of elements the array can store without
1973      * iterators to the elements are invalidated.
1985      * Returns: A range that iterates over all elements of the array in forward order.
2111      * $(BIGOH length + m), where `m` is the number of elements in `stuff`.
2142      * Removes all the elements from the array and releases allocated memory.
2154      * Sets the number of elements in the array to `newLength`. If `newLength`
2155      * is greater than `length`, the new elements are added to the end of the
2198      * Inserts the specified elements at the back of the array. `stuff` can be
2201      * Returns: The number of elements inserted.
2205      * where `m` is the number of elements in `stuff`.
2298      * they could not remove `howMany` elements. Instead, if `howMany > n`,
2299      * all elements are removed. The returned value is the effective number
2300      * of elements removed. Both stable and non-stable versions behave the same
2303      * Returns: The number of elements removed.
2391      * Removes all elements belonging to `r`, which must be a range
2394      * Returns: A range spanning the remaining elements in the array that