SortedList.put

Adds a new element while keeping the order intact.

TO DO: Maybe even more optimizations? Maybe look where the element would fit, then shift that position?

struct SortedList(E, alias cmp = "a < b", bool allowDuplicates = true, alias equal = "a == b")

@safe nothrow pure

void

put

(

E a

)

Meta

Source

See Implementation

collections sortedlist SortedList constructors

this

functions