OrderedIndex.insert

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

Complexity: O(n stuff * i(n));
O(n stuff * log(n)) for this index

  1. size_t insert(Stuff stuff)
  2. size_t insert(Stuff stuff)
    mixintemplate OrderedIndex(size_t N, bool allowDuplicates, alias KeyFromValue, alias Compare, ThisContainer)
    size_t
    insert
    (
    Stuff
    )
    (
    Stuff stuff
    )
    if (
    isInputRange!Stuff &&
    isImplicitlyConvertible!(ElementType!Stuff, Elem)
    )
    out (r) { version (RBDoChecks) _Check(); }

Meta