Open Sidebar
Close Sidebar
CrystalDoc.info
Source code
Shards.info
crystalline
master
Array
Crystalline
Algorithms
Search
Containers
Heap
Node
KDTree
Node
MaxHeap
MinHeap
PriorityQueue
Priority
Queue
RBTreeMap
Pair
RBTreeSet
Color
Node
SplayTreeMap
Node
Stack
SuffixArray
Trie
Node
Graph
AbstractIterator
EndOfIteratorException
AdjacencyGraph
BFSIterator
CollectionIterator
DFSIterator
DirectedAdjacencyGraph
DirectedEdge
Edge
Graph
GraphIterator
GraphVisitor
Mark
MutableGraph
NoVertexError
UndirectedEdge
Built with Crystal 1.9.2
2023-10-08 10:01:03 UTC
class
Crystalline::Containers::RBTreeMap::Pair(K, V)
Crystalline::Containers::RBTreeMap::Pair(K, V)
Reference
Object
Defined in:
containers/rb_tree_map.cr
Constructors
.new
(key : K, value : V | Nil)
Instance Method Summary
#<=>
(other : Pair(K, V))
#key
: K
#key=
(key : K)
#value
: V | Nil
#value=
(value : V | Nil)
Constructor Detail
def self.
new
(key : K, value : V | Nil)
#
[
View source
]
Instance Method Detail
def
<=>
(other :
Pair
(K, V))
#
[
View source
]
def
key
: K
#
[
View source
]
def
key=
(key : K)
#
[
View source
]
def
value
: V | Nil
#
[
View source
]
def
value=
(value : V | Nil)
#
[
View source
]