Functions — github.com/andresilva/rust-okasaki

CodeHub MCPcopy Create free account

hub / github.com/andresilva/rust-okasaki / functions

Functions74 in github.com/andresilva/rust-okasaki

⨍ Functions 74 ◇ Types & classes 9

↓ 25 callersMethodinsert

↓ 19 callersMethodbind

(&self, k: K, v: V)

↓ 15 callersFunctionaux

(current: Vec<Tree<(T, f64)>>, mut next: Vec<Tree<(T, f64)>>, offset: f64)

src/tree_layout.rs:19

↓ 12 callersMethodcons

src/stack.rs:53

↓ 12 callersMethodinsert

↓ 10 callersFunctionrank

(t: &BinomialTree<T>)

src/heap.rs:146

↓ 9 callersMethodbind

(&self, k: String, v: T)

↓ 9 callersMethodtail

src/stack.rs:67

↓ 3 callersMethodmerge

(&self, h: &LeftistHeap<T>)

↓ 3 callersFunctionroot

(t: &BinomialTree<T>)

src/heap.rs:151

↓ 2 callersFunctionfit_list_left

(es: Vec<Extent>)

src/tree_layout.rs:167

↓ 2 callersMethodhead

src/stack.rs:60

↓ 2 callersFunctioninsert_tree

(h: &BinomialHeap<T>, t: &BinomialTree<T>)

src/heap.rs:156

↓ 2 callersMethodis_empty

src/stack.rs:46

↓ 2 callersFunctionlink

(t1: &BinomialTree<T>, t2: &BinomialTree<T>)

src/heap.rs:131

↓ 2 callersFunctionmerge_extent

(e1: Extent, e2: Extent)

src/tree_layout.rs:194

↓ 2 callersFunctionmove_extent

(e: Extent, x: f64)

src/tree_layout.rs:212

↓ 2 callersFunctionremove_min_tree

(h: &BinomialHeap<T>)

src/heap.rs:172

↓ 1 callersFunctionfind_leftmost

(t: &Tree<(T, f64)>, current: f64)

src/tree_layout.rs:63

↓ 1 callersFunctionfit

(e1: Extent, e2: Extent)

src/tree_layout.rs:186

↓ 1 callersFunctionfit_list

(es: Vec<Extent>)

src/tree_layout.rs:144

↓ 1 callersFunctionfit_list_right

(es: Vec<Extent>)

src/tree_layout.rs:154

↓ 1 callersFunctionflip_extent

src/tree_layout.rs:155

↓ 1 callersFunctionheap

↓ 1 callersMethodis_empty

↓ 1 callersFunctionlist

↓ 1 callersFunctionlongest_common_prefix

(s1: &str, s2: &str)

↓ 1 callersFunctionmap

↓ 1 callersFunctionmean

(x: f64, y: f64)

src/tree_layout.rs:145

↓ 1 callersFunctionmerge_extents

(es: Vec<Extent>)

src/tree_layout.rs:206

↓ 1 callersFunctionmove_by_offset

(t: &Tree<(T, f64)>, o: f64)

src/tree_layout.rs:54

↓ 1 callersFunctionmove_tree

(t: &Tree<(T, f64)>, x1: f64)

src/tree_layout.rs:135

↓ 1 callersFunctionprint_spaces

src/tree_layout.rs:13

↓ 1 callersFunctionrmax

(p: f64, q: f64)

src/tree_layout.rs:182

↓ 1 callersFunctiontree

↓ 1 callersFunctiontrie

(f: &mut Formatter, l: &List<T>, first: bool)

src/stack.rs:79

Functionabsolute

(t: &Tree<(T, f64)>)

src/tree_layout.rs:93

Functionabsolute_new

(t: &Tree<(T, f64)>)

src/tree_layout.rs:76

Methodadd_children

(t: &PatriciaTrie<T>, k: String, v: T)

(&self, y: &Self)

src/stack.rs:12

(f: &mut Formatter, t: &Tree<T>, right: bool, indent: &str)

(f: &mut Formatter, t: &LeftistHeap<T>, right: bool, indent: &str)

(t: &PatriciaTrie<T>, mut indent: String, last: bool, f: &mut Formatter)

src/trie.rs:111

Functionbinomialheap

src/heap.rs:256

Methoddelete_min

src/tree_layout.rs:107

src/stack.rs:42

(&self, f: &mut Formatter)

(&self, f: &mut Formatter)

src/stack.rs:76

(&self, f: &mut Formatter)

(&self, f: &mut Formatter)

src/trie.rs:110

Functionleftistheap

src/heap.rs:244

src/stack.rs:98

(&self, k: String)

Methodmake_node

(x: T, l: Rc<LeftistHeap<T>>, r: Rc<LeftistHeap<T>>)

Exercise 2.2: only performs at most d + 1 comparisons, where d is the depth of the tree

Methodmember_aux

(t: &Tree<T>, x: T, c: &T)

Functionmove_by_leftmost

(t: &Tree<(T, f64)>)

src/tree_layout.rs:53

Functionpatricia_trie

src/trie.rs:148

Functionpretty_print

(t: &Tree<(T, f64)>)

src/tree_layout.rs:12

(h: &LeftistHeap<T>)

Functionsuffixes

Exercise 2.1: O(n) time and space

Functiontreemap

Functiontreeset

(&self, i: usize, x: T)

src/stack.rs:20