MCPcopy Create free account

hub / github.com/douchuan/algorithm / functions

Functions655 in github.com/douchuan/algorithm

↓ 119 callersMethoditer
Returns an iterator to this stack that iterates through the items in LIFO order.
src/common/stack.rs:27
↓ 97 callersMethodpush
Adds the item to this stack.
src/common/stack.rs:12
↓ 54 callersMethodlen
(&self)
src/strings/tst.rs:18
↓ 43 callersMethodleft
(node: Option<NonNull<Self>>)
src/tree/binary/node.rs:77
↓ 42 callersFunctionsort
希尔排序 (Shell's Sort) 又称“缩小增量排序”(Diminishing Increment Sort), 是直接插入排序算法的一种更高效的改进版本。希尔排序是 非稳定排序算法。该方法因 D.L.Shell 于 1959 年提出而得名。
src/sort/shell.rs:7
↓ 40 callersMethodis_some
(&self)
src/tree/binary/node.rs:223
↓ 39 callersMethodput
Inserts the key-value pair into the symbol table, overwriting the old value with the new value if the key is already in the symbol table. If the value
src/strings/tst.rs:53
↓ 35 callersMethodright
(node: Option<NonNull<Self>>)
src/tree/binary/node.rs:81
↓ 30 callersMethodinsert
(&mut self, v: T)
src/common/top_m.rs:19
↓ 30 callersMethodis_red
(&self)
src/tree/binary/node.rs:211
↓ 28 callersMethodis_none
(&self)
src/tree/binary/node.rs:227
↓ 27 callersMethodclone
(&self)
src/math/sparse_vector.rs:126
↓ 26 callersMethodenqueue
Adds the item to this queue
src/common/queue.rs:20
↓ 26 callersMethodfind
Returns the canonical element of the set containing element p
src/common/uf.rs:94
↓ 20 callersMethodparent
(node: Option<NonNull<Self>>)
src/tree/binary/node.rs:85
↓ 19 callersMethodset_color
(&mut self, v: Color)
src/tree/binary/node.rs:186
↓ 18 callersMethodpush_front
(&mut self, element: T)
src/ll/linked_list.rs:61
↓ 18 callersMethodweight
(&self)
src/graph/shortest/directed_edge.rs:18
↓ 17 callersFunctionbyte_at
(s: &str, d: usize)
src/common/util.rs:32
↓ 17 callersMethodother
(&self, v: usize)
src/graph/mst/edge.rs:27
↓ 14 callersMethodV
(&self)
src/graph/mst/ew_graph.rs:26
↓ 14 callersMethodV
(&self)
src/graph/shortest/ew_digraph.rs:15
↓ 14 callersMethodcmp
(&self, other: &Self)
src/graph/mst/edge.rs:52
↓ 14 callersMethoddequeue
Removes and returns the item on this queue that was least recently added
src/common/queue.rs:25
↓ 14 callersMethodeither
(&self)
src/graph/mst/edge.rs:23
↓ 13 callersFunctiondo_sort
(a: &mut [T], l: usize, u: usize, ws: &mut [T])
src/sort/merge.rs:109
↓ 13 callersMethodget_key
(&self)
src/tree/binary/node.rs:285
↓ 13 callersMethodto
(&self)
src/graph/shortest/directed_edge.rs:26
↓ 13 callersFunctionwith
(f: F)
src/common/drop.rs:29
↓ 12 callersMethodkeys
Returns all keys in the symbol table as an Queue.
src/strings/tst.rs:32
↓ 12 callersMethodpop
Removes and returns the item most recently added to this stack.
src/common/stack.rs:17
↓ 11 callersMethoddelete
Removes the key from the set if the key is present
src/strings/tries.rs:99
↓ 11 callersMethodget
Returns the value associated with the given key.
src/strings/tst.rs:42
↓ 11 callersMethodpush_back
(&mut self, element: T)
src/ll/linked_list.rs:46
↓ 10 callersMethodadj
(&self, v: usize)
src/graph/undirected/graph.rs:67
↓ 10 callersMethodfrom
(&self)
src/graph/shortest/directed_edge.rs:22
↓ 9 callersMethodV
(&self)
src/graph/undirected/graph.rs:50
↓ 9 callersFunctioncreate_digraph
(i: &str)
tests/test_directed_graph.rs:169
↓ 9 callersFunctioncreate_graph
(i: &str)
tests/test_shortest_paths.rs:204
↓ 9 callersMethodreverse
反转链表
src/ll/linked_list.rs:109
↓ 9 callersMethodset_right
(&mut self, node: Option<NonNull<Node<K, V>>>)
src/tree/binary/node.rs:148
↓ 8 callersMethodget
Returns the ith coordinate of this vector
src/math/sparse_vector.rs:37
↓ 7 callersMethodadd_edge
(&mut self, v: usize, w: usize, weight: f32)
src/graph/shortest/ew_digraph.rs:23
↓ 7 callersMethodadj
(&self, v: usize)
src/graph/directed/digraph.rs:28
↓ 7 callersMethodadj
(&self, v: usize)
src/graph/shortest/ew_digraph.rs:30
↓ 7 callersFunctioncreate_graph
(i: &str)
tests/test_undirected_graph.rs:185
↓ 7 callersFunctiongen_random_data
(len: usize)
benches/sort.rs:231
↓ 7 callersMethodget
count of Drop::drop called
src/common/drop.rs:24
↓ 7 callersMethodis_empty
(&self)
src/strings/tst.rs:22
↓ 7 callersMethodis_empty
(&self)
src/tree/binary/tree.rs:22
↓ 7 callersMethodlen
Returns the number of key-value pairs in this symbol table.
src/strings/tries.rs:65
↓ 7 callersMethodlen
(&self)
src/common/stack.rs:31
↓ 7 callersMethodpop_front
(&mut self)
src/ll/linked_list.rs:75
↓ 7 callersMethodset_left
(&mut self, node: Option<NonNull<Node<K, V>>>)
src/tree/binary/node.rs:136
↓ 7 callersMethodunion
Merges the set containing element p with the the set containing element q
src/common/uf.rs:100
↓ 6 callersMethodcompare
(&self, i: usize, j: usize)
src/common/priority_queue.rs:122
↓ 6 callersFunctioncreate
()
tests/test_sparse_vec.rs:57
↓ 6 callersMethodedges
(&self)
src/graph/mst/kruskal_mst.rs:95
↓ 6 callersFunctionextract_words
(i: &str)
tests/test_strings.rs:371
↓ 6 callersFunctionfind
# Safety This is highly unsafe, due to pointer
src/tree/binary/bst.rs:108
↓ 6 callersMethodgrandparent
(&self)
src/tree/binary/node.rs:268
↓ 6 callersMethodlen
number of jobs
src/graph/shortest/cpm.rs:35
↓ 6 callersMethodmid
middle subtries
src/strings/tst.rs:268
↓ 6 callersMethodsort
Rearranges the array of w-character strings in ascending order. `a` the array to be sorted `w` the number of characters per string
src/strings/lsd.rs:52
↓ 6 callersMethodto_string
(&self)
src/graph/mst/edge.rs:60
↓ 5 callersMethodadj
(&self, v: usize)
src/graph/mst/ew_graph.rs:41
↓ 5 callersMethodcolor
(&self)
src/tree/binary/node.rs:207
↓ 5 callersFunctionfind_min
# Safety This is highly unsafe, due to pointer
src/tree/binary/bst.rs:122
↓ 5 callersFunctionflip_colors
flip the colors of a node and its two children
src/tree/binary/rb2.rs:335
↓ 5 callersFunctiongen_asc_data
(len: usize)
benches/sort.rs:237
↓ 5 callersFunctioninsert
(root: Option<NonNull<Node<K, V>>>, key: K, val: V)
src/tree/binary/rb.rs:141
↓ 5 callersMethodinto_iter
(self)
src/ll/linked_list.rs:123
↓ 5 callersMethodis_empty
(&self)
src/graph/shortest/cpm.rs:39
↓ 5 callersMethodleft
left subtries
src/strings/tst.rs:263
↓ 5 callersMethodnext
(&mut self)
src/ll/linked_list.rs:132
↓ 5 callersMethodpath_to
Returns a shortest path from the source vertex s to vertex v
src/graph/shortest/acyclic_sp.rs:60
↓ 5 callersMethodright
right subtries
src/strings/tst.rs:273
↓ 5 callersFunctionrotate_right
h x / \ / \ R(x) C => A R(h) / \ / \ A B B C */ m
src/tree/binary/rb2.rs:324
↓ 5 callersMethodset_entry
(&mut self, (key, val): (K, Option<V>))
src/tree/binary/node.rs:177
↓ 5 callersMethodset_size
(&mut self, size: usize)
src/tree/binary/tree.rs:18
↓ 5 callersFunctionshuffle
(data: &mut [T])
src/common/util.rs:4
↓ 5 callersMethodsize
(&self)
src/tree/binary/tree.rs:14
↓ 5 callersFunctionsort_dth
insertion sort a[lo..=hi], starting at d-th character lo & hi, is inclusive
src/sort/insert.rs:25
↓ 5 callersMethodto_string
(&self)
src/common/uf.rs:225
↓ 5 callersMethodto_string
(&self)
src/graph/shortest/directed_edge.rs:52
↓ 4 callersFunctionbalance
restore red-black tree invariant
src/tree/binary/rb2.rs:343
↓ 4 callersFunctionbyte_at_checked
(s: &str, d: usize)
src/common/util.rs:22
↓ 4 callersFunctioncreate_graph
(i: &str)
tests/test_graph_mst.rs:71
↓ 4 callersMethodedges
Returns the edges in a minimum spanning tree (or forest)
src/graph/mst/prim_mst.rs:43
↓ 4 callersMethodedges
(&self)
src/graph/mst/lazy_prim_mst.rs:35
↓ 4 callersFunctionextract_words
(i: &str)
benches/strings.rs:102
↓ 4 callersMethodfrom
(nv: usize)
src/graph/directed/digraph.rs:47
↓ 4 callersFunctiongen_desc_data
(len: usize)
benches/sort.rs:241
↓ 4 callersFunctiongen_eq_data
(len: usize)
benches/sort.rs:247
↓ 4 callersFunctiongen_vec_data
()
tests/test_sort.rs:94
↓ 4 callersMethodget_v
(&self)
src/graph/util/parser.rs:62
↓ 4 callersMethodinsert
(&mut self, key: K, val: V)
src/tree/binary/rb2.rs:125
↓ 4 callersMethodkeys_slice
for test
src/common/max_heap.rs:64
↓ 4 callersFunctionparent
(i: usize)
src/common/binary_tree.rs:19
↓ 4 callersFunctionparse
()
tests/test_graph_mst.rs:10
next →1–100 of 655, ranked by callers