RedBlackTree.back

The last element in the container

Complexity: O(log(n))

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

ref inout

inout(Elem)

back

()

if (

(

ref const T a

)

=> binaryFun!less(a, a)))

)

Meta

Source

See Implementation

std container rbtree RedBlackTree aliases

constructors

this

functions

properties