RedBlackTree.stableInsert

Insert a range of elements in the container. Note that this does not invalidate any ranges currently iterating the container.

  1. size_t stableInsert(Stuff stuff)
  2. size_t stableInsert(Stuff stuff)
    class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false)
    size_t
    stableInsert
    (
    Stuff
    )
    (
    scope Stuff stuff
    )
    if (
    is(typeof(
    (
    ref const T a
    )
    => binaryFun!less(a, a)
    ))
    )

Return Value

Type: size_t

The number of elements inserted.

Complexity: O(m * log(n))

Meta