Documentation
Tagion
RedBlackTree.opBinaryRight
tagion
std
container
rbtree
RedBlackTree
in
operator. Check to see if the given element exists in the container.
Complexity:
O
(log(n))
class
RedBlackTree
(T, alias less = "a < b", bool allowDuplicates = false)
const
bool
opBinaryRight
(
string
op
)
(
Elem
e
)
if
(
op
== "in"
)
if
(
is
(
typeof
(
binaryFun
!
less
(
T.init
,
T.init
)))
)
tagion
std
container
rbtree
RedBlackTree
aliases
Elem
Range
insert
constructors
this
functions
back
clear
equalRange
front
lowerBound
opBinaryRight
opEquals
opSlice
remove
removeAny
removeBack
removeFront
removeKey
stableInsert
toHash
toString
upperBound
properties
dup
empty
length
in operator. Check to see if the given element exists in the container.
Complexity: O(log(n))