Sorted.insert

Insert values into this.

  1. bool insert(U value)
  2. size_t insert(R values)
    struct Sorted(A, bool uniqueElements = true, alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable)
    scope @trusted
    static if(isDynamic)
    static if(!(uniqueElements))
    size_t
    insert
    (
    R
    )
    ()
    if (
    isInputRange!R &&
    isAssignable!(E, typeof(R.init.front))
    )
    if (
    is(typeof(A.init[]))
    )

Return Value

Type: size_t

number of elements inserted.

Meta