View source code
Display the source code in std/container/slist.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.
Alias std.container.slist.SList.stableInsertAfter
Similar to insertAfter
above, but accepts a range bounded in
count. This is important for ensuring fast insertions in the middle of
the list. For fast insertions after a specified position r
, use
insertAfter(take(r, 1), stuff)
. The complexity of that operation
only depends on the number of elements in stuff
.
Precondition
r
Returns
The number of values inserted.
Complexity
Ο(k + m
), where k
is the number of elements in
r
and m
is the length of stuff
.
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.