RBTree.insert

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

Complexity: O(m * log(n))

  1. size_t insert(Stuff stuff)
  2. size_t insert(Stuff stuff)
    struct RBTree(T, alias less = "a < b", bool allowDuplicates = true, ALLOC = ThreadMem, bool NOGC_ = false)
    pragma(inline, true)
    size_t
    insert
    (
    Stuff
    )
    (
    Stuff stuff
    )
    if (
    isInputRange!Stuff &&
    isImplicitlyConvertibleLegacy!(ElementType!Stuff, Elem)
    )
    if (
    is(typeof(binaryFun!less(T.init, T.init)))
    )

Meta