OrderedIndex.insert

Insert a single element in the container. Note that this does not invalidate any ranges currently iterating the container.

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

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

Meta