RedBlackTree.back

The last element in the container

Complexity: O(log(n))

class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false)

inout

inout(Elem)

back

()

if (

is(typeof(binaryFun!less(T.init, T.init)))

)

Meta

Source

See Implementation

std container rbtree RedBlackTree aliases

constructors

this

functions

properties