|
at()
|
Access elements from an object |
|
bimap-class
|
Bimap class |
|
bimap()
|
Create a new bimap |
|
binomial_heap-class
|
Binomial heap class |
|
binomial_heap()
|
Create a new binomial_heap |
|
clear()
|
Remove all elements from a datastructure |
|
datastructures-package
|
datastructures |
|
decrease_key()
|
Decreases the key of a node in a heap |
|
deque-class
|
Deque class |
|
erase()
|
Erase an entry from a map |
|
fibonacci_heap-class
|
Fibonacci heap class |
|
fibonacci_heap()
|
Create a new fibonacci_heap |
|
handle()
|
Get the handles and values for nodes of a specific key in a heap. |
|
hashmap-class
|
Hashmap class |
|
hashmap()
|
Create a new hashmap |
|
heap-class
|
Abstract heap class |
|
insert()
|
Add elements to an object |
|
keys()
|
Get keys from an object |
|
map-class
|
Map class |
|
multimap-class
|
Multimap class |
|
multimap()
|
Create a new multimap |
|
peek()
|
Have a look at the first element from an object without removing it |
|
pop()
|
Pop a single element from an object |
|
queue-class
|
Queue class |
|
queue()
|
Create a new queue |
|
size()
|
Get the size of an object |
|
stack-class
|
Stack class |
|
stack()
|
Create a new stack |
|
`[`(<unordered_map>,<vector>,<missing>,<missing>)
|
Extract elements from an object |
|
`[<-`(<bimap>,<vector>,<missing>,<vector>)
|
Insert parts to an object |
|
`[<-`(<heap>,<vector>,<missing>,<list>)
|
Insert parts to an object |
|
`[<-`(<heap>,<vector>,<missing>,<matrix>)
|
Insert parts to an object |
|
`[<-`(<heap>,<vector>,<missing>,<vector>)
|
Insert parts to an object |
|
`[<-`(<unordered_map>,<vector>,<missing>,<ANY>)
|
Insert parts to an object |
|
`[<-`(<unordered_map>,<vector>,<missing>,<list>)
|
Insert parts to an object |
|
`[<-`(<unordered_map>,<vector>,<missing>,<vector>)
|
Insert parts to an object |
|
unordered_map-class
|
Abstract unordered map class |
|
values()
|
Get values from an object |