View source code
Display the source code in std/container/array.d from which this
page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a
Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page.
Requires a signed-in GitHub account. This works well for small changes.
If you'd like to make larger changes you may want to consider using
local clone.
std.container.array.Array.reserve - multiple declarations
Function Array.reserve
Ensures sufficient capacity to accommodate e elements.
If e < capacity, this method does nothing.
void reserve
(
size_t elements
);
Postcondition
capacity >= e
Note
If the capacity is increased, one should assume that all iterators to the elements are invalidated.
Complexity
at most Ο(length) if e > capacity, otherwise Ο(1).
Function Array.reserve
Ensures sufficient capacity to accommodate e elements.
If e < capacity, this method does nothing.
void reserve
(
size_t e
);
Postcondition
capacity >= e
Note
If the capacity is increased, one should assume that all iterators to the elements are invalidated.
Complexity
Authors
License
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at ).
Copyright © 1999-2022 by the D Language Foundation | Page generated by ddox.