MCPcopy Create free account

hub / github.com/andelf/rust-adivon / functions

Functions355 in github.com/andelf/rust-adivon

↓ 87 callersMethodtake
(&mut self)
src/queue.rs:17
↓ 55 callersMethodis_none
(&self)
src/skip_list.rs:395
↓ 47 callersMethodis_some
(&self)
src/skip_list.rs:391
↓ 42 callersMethodadd_edge
(&mut self, v: usize, w: usize)
src/graph/directed.rs:35
↓ 41 callersMethodpush
(&mut self, val: T)
src/stack.rs:30
↓ 28 callersMethodenqueue
(&mut self, val: T)
src/queue.rs:81
↓ 24 callersMethodput
(&mut self, key: K, val: V)
src/kdtree.rs:232
↓ 23 callersMethodlen
(&self)
src/rope/mod.rs:91
↓ 21 callersMethodinsert
insert a key into the priority queue
src/priority_queue/binary_heaps.rs:71
↓ 20 callersMethodresolve
Convert the `Rawlink` into an immutable Option value.
src/skip_list.rs:404
↓ 19 callersMethodcollect
(x: Option<&Box<Node<V, K>>>, mut prefix: Vec<K>, queue: &mut Queue<Vec<K>>)
src/tries.rs:91
↓ 15 callersMethodinto_iter
(self)
src/stack.rs:91
↓ 14 callersMethodadd
(&mut self, val: T)
src/bag.rs:54
↓ 13 callersMethodappend
(self, rhs: RHS)
src/rope/mod.rs:111
↓ 12 callersMethoditer
(&self)
src/graph/directed.rs:131
↓ 11 callersMethodresolve_mut
Convert the `Rawlink` into a mutable Option value.
src/skip_list.rs:413
↓ 9 callersMethodadd_edge
(&mut self, v: usize, w: usize)
src/graph/undirected.rs:33
↓ 9 callersMethodis_null
(&self)
src/suffix_tree.rs:48
↓ 8 callersMethodadd_first
(&mut self, item: T)
src/deque.rs:63
↓ 8 callersMethoditer
(&self)
src/bag.rs:104
↓ 8 callersMethodunion
(&mut self, p: usize, q: usize)
src/union_find.rs:38
↓ 7 callersMethodadd_last
(&mut self, item: T)
src/deque.rs:81
↓ 7 callersMethodadj
(&self, v: usize)
src/graph/directed.rs:77
↓ 7 callersMethodclone
(&self)
src/bag.rs:9
↓ 7 callersMethoddequeue
(&mut self)
src/queue.rs:92
↓ 7 callersMethodlen
(&self)
src/skip_list.rs:322
↓ 7 callersMethodlen
(&self)
src/bag.rs:60
↓ 6 callersMethodcontains
(&self, i: usize)
src/priority_queue/index_pq.rs:31
↓ 6 callersMethodget
(&self, d: usize)
src/kdtree.rs:24
↓ 6 callersMethodinsert
(self, offset: usize, s: T)
src/rope/mod.rs:271
↓ 6 callersFunctionis_red
(x: &NodeCell<K, V>)
src/rbtree.rs:133
↓ 6 callersMethodpop
(&mut self)
src/stack.rs:35
↓ 6 callersFunctionput
(x: NodeCell<K, V>, key: K, val: V, depth: usize)
src/kdtree.rs:99
↓ 6 callersMethodput
( mut x: Option<Box<Node<V, K>>>, key: &[K], val: Option<V>, d: usize, )
src/tries.rs:22
↓ 6 callersMethodv
(&self)
src/graph/directed.rs:27
↓ 5 callersMethodinsert
Splay tree insertion.
src/splay_tree.rs:230
↓ 5 callersMethodlevel
(&self)
src/skip_list.rs:69
↓ 5 callersMethodresolve
Convert the `Rawlink` into an immutable Option value.
src/suffix_tree.rs:57
↓ 5 callersMethodresolve_mut
Convert the `Rawlink` into a mutable Option value.
src/suffix_tree.rs:66
↓ 5 callersMethodtake
(&mut self)
src/deque.rs:18
↓ 4 callersMethodcomparator_for_current_dim
(&self)
src/kdtree.rs:69
↓ 4 callersFunctioncompare
(a: &T, b: &T)
src/splay_tree.rs:5
↓ 4 callersMethodcount
(&self)
src/union_find.rs:29
↓ 4 callersMethodexch
(&mut self, i: usize, j: usize)
src/priority_queue/index_pq.rs:140
↓ 4 callersMethodfind
root_of
src/union_find.rs:20
↓ 4 callersMethodget
(&self, key: &K)
src/rbtree.rs:229
↓ 4 callersMethodinsert
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 callersMethodis_root
(&self)
src/suffix_tree.rs:213
↓ 4 callersMethodresize
(&mut self, capacity: usize)
src/priority_queue/binary_heaps.rs:18
↓ 4 callersMethodreverse
(self)
src/rope/mod.rs:121
↓ 4 callersMethodsink
(&mut self, k: usize)
src/priority_queue/index_pq.rs:153
↓ 4 callersMethodswim
(&mut self, k: usize)
src/priority_queue/index_pq.rs:145
↓ 3 callersMethodadd_child
(&mut self, x: Node<'a, T>)
src/suffix_tree.rs:121
↓ 3 callersMethodadd_suffix_link
(&mut self, slink: Rawlink<Node<'a, T>>)
src/suffix_tree.rs:258
↓ 3 callersFunctionconcatenate
(left: Rope, right: Rope)
src/rope/mod.rs:61
↓ 3 callersMethoddelete
FIXME: clone?
src/rope/mod.rs:210
↓ 3 callersMethoddfs
(&self, s: usize)
src/graph/directed.rs:96
↓ 3 callersMethodgreater
(&self, i: usize, j: usize)
src/priority_queue/index_pq.rs:136
↓ 3 callersMethodinsert
add the point to the KdTree
src/kdtree.rs:273
↓ 3 callersMethodis_empty
(&self)
src/kdtree.rs:240
↓ 3 callersMethodis_empty
(&self)
src/bag.rs:64
↓ 3 callersMethodis_empty
(&self)
src/rope/mod.rs:99
↓ 3 callersMethoditer
(&self)
src/deque.rs:149
↓ 3 callersMethodput
(&mut self, key: K, val: V)
src/hashst.rs:82
↓ 3 callersMethodslice
(self, start: usize, end: usize)
src/rope/mod.rs:224
↓ 3 callersMethodtake
(&mut self)
src/suffix_tree.rs:52
↓ 3 callersMethodvalidate_vertex
(&self, v: usize)
src/graph/directed.rs:23
↓ 3 callersMethodvalidate_vertex
(&self, v: usize)
src/graph/undirected.rs:21
↓ 2 callersMethodcontains
(&self, p: T)
src/primitive.rs:81
↓ 2 callersMethoddel_min
(&mut self)
src/priority_queue/index_pq.rs:67
↓ 2 callersFunctiondelete_min
delete_min helper returns: top, deleted
src/rbtree.rs:317
↓ 2 callersMethoddepth
(&self)
src/rope/mod.rs:103
↓ 2 callersMethoddistance_squared_to
(&self, that: T)
src/primitive.rs:24
↓ 2 callersMethoddistance_to
(&self, that: T)
src/primitive.rs:20
↓ 2 callersFunctiondot_id
(x: &T)
src/suffix_tree.rs:432
↓ 2 callersMethodget_mut
(&mut self, key: T)
src/hashst.rs:69
↓ 2 callersMethodinit
(&mut self)
src/graph/directed.rs:238
↓ 2 callersMethodinsert
Associates key with index i
src/priority_queue/index_pq.rs:41
↓ 2 callersMethodinto_chars
(self)
src/rope/mod.rs:291
↓ 2 callersMethodinto_rope
(self)
src/rope/mod.rs:360
↓ 2 callersMethodis_empty
(&self)
src/priority_queue/index_pq.rs:27
↓ 2 callersMethoditer_children
(&'t self)
src/suffix_tree.rs:207
↓ 2 callersMethodkeys
(&self)
src/tries.rs:199
↓ 2 callersMethodlen
(&self)
src/deque.rs:59
↓ 2 callersMethodpeek
(self, mut f: F)
src/rope/mod.rs:283
↓ 2 callersMethodput
(&mut self, key: K, val: V)
src/rbtree.rs:245
↓ 2 callersMethodremove
(&mut self, key: &Key)
src/skip_list.rs:254
↓ 2 callersMethodremove_first
(&mut self)
src/deque.rs:98
↓ 2 callersMethodremove_last
(&mut self)
src/deque.rs:113
↓ 2 callersMethodreverse_dfs_postorder
(&self)
src/graph/directed.rs:114
↓ 2 callersMethodsink
(&mut self, k: usize)
src/priority_queue/binary_heaps.rs:39
↓ 2 callersMethodsize
(&self)
src/rbtree.rs:62
↓ 2 callersMethodslice_from
(self, start: usize)
src/rope/mod.rs:215
↓ 2 callersMethodslice_to
(self, end: usize)
src/rope/mod.rs:220
↓ 2 callersMethodswim
(&mut self, k: usize)
src/priority_queue/binary_heaps.rs:31
↓ 2 callersMethodterminates_any
(&self)
src/suffix_tree.rs:176
↓ 2 callersMethodto_string
(&self)
src/rope/mod.rs:115
↓ 1 callersMethodadd
(&mut self, txt: &'a [T])
src/suffix_tree.rs:328
↓ 1 callersMethodadj
(&self, v: usize)
src/graph/undirected.rs:73
↓ 1 callersMethodadjust_head
(&mut self, new_level: usize)
src/skip_list.rs:141
next →1–100 of 355, ranked by callers