View source code
Display the source code in std/container/rbtree.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.rbtree.RedBlackTree.stableInsert - multiple declarations
Function RedBlackTree.stableInsert
Insert a single element in the container. Note that this does not invalidate any ranges currently iterating the container.
size_t stableInsert(Stuff)
(
Stuff stuff
)
if (isImplicitlyConvertible!(Stuff, Elem));
Returns
The number of elements inserted.
Complexity
Ο(log(n))
Function RedBlackTree.stableInsert
Insert a range of elements in the container. Note that this does not invalidate any ranges currently iterating the container.
size_t stableInsert(Stuff)
(
Stuff stuff
)
if (isInputRange!Stuff && isImplicitlyConvertible!(ElementType!Stuff, Elem));
Returns
The number of elements inserted.
Complexity
Ο(m * log(n))
Authors
Steven Schveighoffer, Andrei Alexandrescu
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.