Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/andelf/rust-adivon
/ functions
Functions
355 in github.com/andelf/rust-adivon
⨍
Functions
355
◇
Types & classes
50
↓ 87 callers
Method
take
(&mut self)
src/queue.rs:17
↓ 55 callers
Method
is_none
(&self)
src/skip_list.rs:395
↓ 47 callers
Method
is_some
(&self)
src/skip_list.rs:391
↓ 42 callers
Method
add_edge
(&mut self, v: usize, w: usize)
src/graph/directed.rs:35
↓ 41 callers
Method
push
(&mut self, val: T)
src/stack.rs:30
↓ 28 callers
Method
enqueue
(&mut self, val: T)
src/queue.rs:81
↓ 24 callers
Method
put
(&mut self, key: K, val: V)
src/kdtree.rs:232
↓ 23 callers
Method
len
(&self)
src/rope/mod.rs:91
↓ 21 callers
Method
insert
insert a key into the priority queue
src/priority_queue/binary_heaps.rs:71
↓ 20 callers
Method
resolve
Convert the `Rawlink` into an immutable Option value.
src/skip_list.rs:404
↓ 19 callers
Method
collect
(x: Option<&Box<Node<V, K>>>, mut prefix: Vec<K>, queue: &mut Queue<Vec<K>>)
src/tries.rs:91
↓ 15 callers
Method
into_iter
(self)
src/stack.rs:91
↓ 14 callers
Method
add
(&mut self, val: T)
src/bag.rs:54
↓ 13 callers
Method
append
(self, rhs: RHS)
src/rope/mod.rs:111
↓ 12 callers
Method
iter
(&self)
src/graph/directed.rs:131
↓ 11 callers
Method
resolve_mut
Convert the `Rawlink` into a mutable Option value.
src/skip_list.rs:413
↓ 9 callers
Method
add_edge
(&mut self, v: usize, w: usize)
src/graph/undirected.rs:33
↓ 9 callers
Method
is_null
(&self)
src/suffix_tree.rs:48
↓ 8 callers
Method
add_first
(&mut self, item: T)
src/deque.rs:63
↓ 8 callers
Method
iter
(&self)
src/bag.rs:104
↓ 8 callers
Method
union
(&mut self, p: usize, q: usize)
src/union_find.rs:38
↓ 7 callers
Method
add_last
(&mut self, item: T)
src/deque.rs:81
↓ 7 callers
Method
adj
(&self, v: usize)
src/graph/directed.rs:77
↓ 7 callers
Method
clone
(&self)
src/bag.rs:9
↓ 7 callers
Method
dequeue
(&mut self)
src/queue.rs:92
↓ 7 callers
Method
len
(&self)
src/skip_list.rs:322
↓ 7 callers
Method
len
(&self)
src/bag.rs:60
↓ 6 callers
Method
contains
(&self, i: usize)
src/priority_queue/index_pq.rs:31
↓ 6 callers
Method
get
(&self, d: usize)
src/kdtree.rs:24
↓ 6 callers
Method
insert
(self, offset: usize, s: T)
src/rope/mod.rs:271
↓ 6 callers
Function
is_red
(x: &NodeCell<K, V>)
src/rbtree.rs:133
↓ 6 callers
Method
pop
(&mut self)
src/stack.rs:35
↓ 6 callers
Function
put
(x: NodeCell<K, V>, key: K, val: V, depth: usize)
src/kdtree.rs:99
↓ 6 callers
Method
put
( mut x: Option<Box<Node<V, K>>>, key: &[K], val: Option<V>, d: usize, )
src/tries.rs:22
↓ 6 callers
Method
v
(&self)
src/graph/directed.rs:27
↓ 5 callers
Method
insert
Splay tree insertion.
src/splay_tree.rs:230
↓ 5 callers
Method
level
(&self)
src/skip_list.rs:69
↓ 5 callers
Method
resolve
Convert the `Rawlink` into an immutable Option value.
src/suffix_tree.rs:57
↓ 5 callers
Method
resolve_mut
Convert the `Rawlink` into a mutable Option value.
src/suffix_tree.rs:66
↓ 5 callers
Method
take
(&mut self)
src/deque.rs:18
↓ 4 callers
Method
comparator_for_current_dim
(&self)
src/kdtree.rs:69
↓ 4 callers
Function
compare
(a: &T, b: &T)
src/splay_tree.rs:5
↓ 4 callers
Method
count
(&self)
src/union_find.rs:29
↓ 4 callers
Method
exch
(&mut self, i: usize, j: usize)
src/priority_queue/index_pq.rs:140
↓ 4 callers
Method
find
root_of
src/union_find.rs:20
↓ 4 callers
Method
get
(&self, key: &K)
src/rbtree.rs:229
↓ 4 callers
Method
insert
Due to head node must be of same level as List, inserting with decreasing order will lead to almost same bad performance as a linked list
src/skip_list.rs:155
↓ 4 callers
Method
is_root
(&self)
src/suffix_tree.rs:213
↓ 4 callers
Method
resize
(&mut self, capacity: usize)
src/priority_queue/binary_heaps.rs:18
↓ 4 callers
Method
reverse
(self)
src/rope/mod.rs:121
↓ 4 callers
Method
sink
(&mut self, k: usize)
src/priority_queue/index_pq.rs:153
↓ 4 callers
Method
swim
(&mut self, k: usize)
src/priority_queue/index_pq.rs:145
↓ 3 callers
Method
add_child
(&mut self, x: Node<'a, T>)
src/suffix_tree.rs:121
↓ 3 callers
Method
add_suffix_link
(&mut self, slink: Rawlink<Node<'a, T>>)
src/suffix_tree.rs:258
↓ 3 callers
Function
concatenate
(left: Rope, right: Rope)
src/rope/mod.rs:61
↓ 3 callers
Method
delete
FIXME: clone?
src/rope/mod.rs:210
↓ 3 callers
Method
dfs
(&self, s: usize)
src/graph/directed.rs:96
↓ 3 callers
Method
greater
(&self, i: usize, j: usize)
src/priority_queue/index_pq.rs:136
↓ 3 callers
Method
insert
add the point to the KdTree
src/kdtree.rs:273
↓ 3 callers
Method
is_empty
(&self)
src/kdtree.rs:240
↓ 3 callers
Method
is_empty
(&self)
src/bag.rs:64
↓ 3 callers
Method
is_empty
(&self)
src/rope/mod.rs:99
↓ 3 callers
Method
iter
(&self)
src/deque.rs:149
↓ 3 callers
Method
put
(&mut self, key: K, val: V)
src/hashst.rs:82
↓ 3 callers
Method
slice
(self, start: usize, end: usize)
src/rope/mod.rs:224
↓ 3 callers
Method
take
(&mut self)
src/suffix_tree.rs:52
↓ 3 callers
Method
validate_vertex
(&self, v: usize)
src/graph/directed.rs:23
↓ 3 callers
Method
validate_vertex
(&self, v: usize)
src/graph/undirected.rs:21
↓ 2 callers
Method
contains
(&self, p: T)
src/primitive.rs:81
↓ 2 callers
Method
del_min
(&mut self)
src/priority_queue/index_pq.rs:67
↓ 2 callers
Function
delete_min
delete_min helper returns: top, deleted
src/rbtree.rs:317
↓ 2 callers
Method
depth
(&self)
src/rope/mod.rs:103
↓ 2 callers
Method
distance_squared_to
(&self, that: T)
src/primitive.rs:24
↓ 2 callers
Method
distance_to
(&self, that: T)
src/primitive.rs:20
↓ 2 callers
Function
dot_id
(x: &T)
src/suffix_tree.rs:432
↓ 2 callers
Method
get_mut
(&mut self, key: T)
src/hashst.rs:69
↓ 2 callers
Method
init
(&mut self)
src/graph/directed.rs:238
↓ 2 callers
Method
insert
Associates key with index i
src/priority_queue/index_pq.rs:41
↓ 2 callers
Method
into_chars
(self)
src/rope/mod.rs:291
↓ 2 callers
Method
into_rope
(self)
src/rope/mod.rs:360
↓ 2 callers
Method
is_empty
(&self)
src/priority_queue/index_pq.rs:27
↓ 2 callers
Method
iter_children
(&'t self)
src/suffix_tree.rs:207
↓ 2 callers
Method
keys
(&self)
src/tries.rs:199
↓ 2 callers
Method
len
(&self)
src/deque.rs:59
↓ 2 callers
Method
peek
(self, mut f: F)
src/rope/mod.rs:283
↓ 2 callers
Method
put
(&mut self, key: K, val: V)
src/rbtree.rs:245
↓ 2 callers
Method
remove
(&mut self, key: &Key)
src/skip_list.rs:254
↓ 2 callers
Method
remove_first
(&mut self)
src/deque.rs:98
↓ 2 callers
Method
remove_last
(&mut self)
src/deque.rs:113
↓ 2 callers
Method
reverse_dfs_postorder
(&self)
src/graph/directed.rs:114
↓ 2 callers
Method
sink
(&mut self, k: usize)
src/priority_queue/binary_heaps.rs:39
↓ 2 callers
Method
size
(&self)
src/rbtree.rs:62
↓ 2 callers
Method
slice_from
(self, start: usize)
src/rope/mod.rs:215
↓ 2 callers
Method
slice_to
(self, end: usize)
src/rope/mod.rs:220
↓ 2 callers
Method
swim
(&mut self, k: usize)
src/priority_queue/binary_heaps.rs:31
↓ 2 callers
Method
terminates_any
(&self)
src/suffix_tree.rs:176
↓ 2 callers
Method
to_string
(&self)
src/rope/mod.rs:115
↓ 1 callers
Method
add
(&mut self, txt: &'a [T])
src/suffix_tree.rs:328
↓ 1 callers
Method
adj
(&self, v: usize)
src/graph/undirected.rs:73
↓ 1 callers
Method
adjust_head
(&mut self, new_level: usize)
src/skip_list.rs:141
next →
1–100 of 355, ranked by callers