std/container/array.d

49     // set elements
240  * This means that pointers to elements of an `Array` will become
333         void reserve(size_t elements)
335             if (elements <= capacity) return;
338             const sz = mulu(elements, T.sizeof, overflow);
359                         (elements - oldLength) * T.sizeof);
373             _capacity = elements;
469      *  `ConstRange` is a variant with `const` elements.
470      *  `ImmutableRange` is a variant with `immutable` elements.
481      * Duplicates the array. The elements themselves are not transitively
493      * Returns: `true` if and only if the array has no elements.
503      * Returns: The number of elements in the array.
519      * Returns: The maximum number of elements the array can store without
536      * iterators to the elements are invalidated.
540     void reserve(size_t elements)
544             if (!elements) return;
547             const sz = mulu(elements, T.sizeof, overflow);
556             _data._capacity = elements;
560             _data.reserve(elements);
565      * Returns: A range that iterates over elements of the array in
586      * Returns: A range that iterates over elements of the array from
708      * $(BIGOH length + m), where `m` is the number of elements in `stuff`.
744      * Removes all the elements from the array and releases allocated memory.
756      * Sets the number of elements in the array to `newLength`. If `newLength`
757      * is greater than `length`, the new elements are added to the end of the
796      * Inserts the specified elements at the back of the array. `stuff` can be
799      * Returns: The number of elements inserted.
803      * where `m` is the number of elements in `stuff`.
842      * do not throw if they could not remove `howMany` elements. Instead,
843      * if `howMany > n`, all elements are removed. The returned value is
844      * the effective number of elements removed. Both stable and non-stable
848      * Returns: The number of elements removed.
886         // Move elements over by one slot
908             // Move elements over by extra slots
993      * Removes all elements belonging to `r`, which must be a range
996      * Returns: A range spanning the remaining elements in the array that
1070     // check if overlapping elements properly initialized
1648      * no elements.
1670      * Returns the number of elements in the array.
1684      * Returns: The maximum number of elements the array can store without
1703      * iterators to the elements are invalidated.
1715      * Returns: A range that iterates over all elements of the array in forward order.
1841      * $(BIGOH length + m), where `m` is the number of elements in `stuff`.
1872      * Removes all the elements from the array and releases allocated memory.
1884      * Sets the number of elements in the array to `newLength`. If `newLength`
1885      * is greater than `length`, the new elements are added to the end of the
1928      * Inserts the specified elements at the back of the array. `stuff` can be
1931      * Returns: The number of elements inserted.
1935      * where `m` is the number of elements in `stuff`.
2025      * they could not remove `howMany` elements. Instead, if `howMany > n`,
2026      * all elements are removed. The returned value is the effective number
2027      * of elements removed. Both stable and non-stable versions behave the same
2030      * Returns: The number of elements removed.
2116      * Removes all elements belonging to `r`, which must be a range
2119      * Returns: A range spanning the remaining elements in the array that