Functions — github.com/Jondolf/Algorust

hub / github.com/Jondolf/Algorust / functions

Functions120 in github.com/Jondolf/Algorust

⨍ Functions 120◇ Types & classes 57

↓ 27 callersMethodlen

(&self)

src/pathfinding/src/lib.rs:77

↓ 12 callersMethodget

(&self, vertex: V)

src/pathfinding/src/lib.rs:280

↓ 8 callersMethodget_neighbors

(&self, vertex: &V)

src/pathfinding/src/graph.rs:72

↓ 5 callersMethodadd_vertex_with_directed_edges

(&mut self, vertex: V, edges: BTreeMap<V, E>)

src/pathfinding/src/graph.rs:21

↓ 4 callersFunctiongen_u32_vec

Generate a sorted `Vec<u32>` with a given length. The numbers start from 1, and are in order, e.g. 1, 2, 3...

src/utils/mod.rs:7

↓ 4 callersFunctiongenerate_graph

( width: usize, height: usize, diagonals: bool, walls: &BTreeSet<Coord>, )

src/pathfinding/src/lib.rs:285

↓ 4 callersMethodget_neighbors_mut

(&mut self, vertex: &V)

src/pathfinding/src/graph.rs:75

↓ 4 callersFunctionget_sorting_algorithms

()

src/pages/sorting.rs:59

↓ 4 callersMethodinit_step

(&mut self)

src/pathfinding/src/lib.rs:222

↓ 4 callersFunctioninput_title_to_id

(title: &str)

src/components/input_items/mod.rs:13

↓ 4 callersMethodinsert_state_to_last_step

( &mut self, vertex: V, state: VertexState, )

src/pathfinding/src/lib.rs:239

↓ 4 callersFunctionknuth_shuffle

Shuffle a vector with the Fisher-Yates shuffle, aka Knuth shuffle.

src/utils/mod.rs:12

↓ 3 callersMethodadjacent

(self, diagonals: bool)

src/pathfinding/src/lib.rs:142

↓ 3 callersFunctionget_output_at_step_index

Gets the output at a given step's index by running [`SortCommand`]s on the input.

src/pages/sorting.rs:355

↓ 3 callersFunctionget_pathfinding_algorithms

( )

src/pages/pathfinding.rs:61

↓ 3 callersFunctionrand_num

(range: R)

src/pathfinding/src/maze_generation/recursive_division/mod.rs:155

↓ 2 callersFunctionfetch

Fetch from a given url.

src/utils/mod.rs:27

↓ 2 callersFunctionfloat_even

(num: f32)

src/pathfinding/src/maze_generation/recursive_division/mod.rs:163

↓ 2 callersFunctionheapify

( mut items: &mut Vec<T>, size: usize, i: usize, mut steps: &mut Vec<Vec<SortCommand<T>>>,

src/sorting/src/sorting_algorithms/heapsort/mod.rs:22

↓ 2 callersFunctionset_stroke_style

(ctx: &CanvasRenderingContext2d, stroke_style: String)

src/components/sorting/sort_graph.rs:202

↓ 2 callersMethodsort

(&self, input: Rc<RefCell<Vec<u32>>>)

src/pages/sorting.rs:37

↓ 2 callersFunctionupdate_graph_at_pathfinding_step

( graph: &mut BTreeMap<V, VertexState>, steps: &[PathfindingStep<V>], step_i: usize, prev_

src/pages/pathfinding.rs:515

↓ 1 callersFunction_iterative_dfs

( adjacency_list: AdjacencyList<V, E>, start: V, end: V, steps: &mut PathfindingSteps<V>,

src/pathfinding/src/pathfinding_algorithms/dfs/mod.rs:15

↓ 1 callersFunction_merge_sort

( items: &mut Vec<T>, mut steps: &mut Vec<Vec<SortCommand<T>>>, start_i: usize, )

src/sorting/src/sorting_algorithms/merge_sort/mod.rs:7

↓ 1 callersFunction_quicksort

( mut items: &mut Vec<T>, mut steps: &mut Vec<Vec<SortCommand<T>>>, low: isize, high: isiz

src/sorting/src/sorting_algorithms/quicksort/mod.rs:8

↓ 1 callersMethodadd_edge_undirected

Adds a new undirected edge between `a` and `b` with a given `weight`.\ If `a` doesn't exist, it is created along with the edge to `b`.\ If `b` doesn't

src/pathfinding/src/graph.rs:40

↓ 1 callersFunctionadd_offset_to_step_indices

Adds a given offset to the indices in [`SortCommand`]s. Useful when running a sorting algorithm inside another sorting algorithm.

src/sorting/src/sorting_algorithms/bucket_sort/mod.rs:43

↓ 1 callersMethodadd_vertex_with_undirected_edges

(&mut self, vertex: V, edges: BTreeMap<V, E>)

src/pathfinding/src/graph.rs:16

↓ 1 callersMethodcmp

(&self, other: &Self)

src/pathfinding/src/pathfinding_algorithms/dijkstra/mod.rs:69

↓ 1 callersMethoddistance

(&self, from: Self)

src/pathfinding/src/lib.rs:182

↓ 1 callersFunctiondistance_map_shortest_path

Finds the shortest path from start to end according to a given distance map.

src/pathfinding/src/pathfinding_algorithms/dijkstra/mod.rs:89

↓ 1 callersFunctiondivide

( width: isize, height: isize, start: Coord, walls: &mut Vec<Coord>, steps: &mut Vec<MazeG

src/pathfinding/src/maze_generation/recursive_division/mod.rs:48

↓ 1 callersFunctionexecute_steps

( graph: &mut BTreeMap<V, VertexState>, steps: &[PathfindingStep<V>], reverse: bool, )

src/pages/pathfinding.rs:547

↓ 1 callersMethodfind_path

Finds a path from `start` to `end`. The path is not guaranteed to be the shortest path depending on the algorithm.

src/pages/pathfinding.rs:43

↓ 1 callersFunctiongenerate_maze

( config: &PathfindingConfig<E>, start: Coord, end: Coord, )

src/pages/pathfinding.rs:573

↓ 1 callersFunctionget_orientation

(width: isize, height: isize)

src/pathfinding/src/maze_generation/recursive_division/mod.rs:141

↓ 1 callersFunctionget_path

(vertex_parents: HashMap<V, V>, mut vertex: V)

src/pathfinding/src/pathfinding_algorithms/dfs/mod.rs:56

↓ 1 callersMethodget_perimeter

(&self)

src/pathfinding/src/lib.rs:38

↓ 1 callersMethodget_points

Gets the points of a straight line between two points with the [Bresenham's line algorithm](https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm

src/pathfinding/src/lib.rs:62

↓ 1 callersFunctioninsertion_sort

( items: &mut Vec<T>, steps: &mut Vec<Vec<SortCommand<T>>>, )

src/sorting/src/sorting_algorithms/insertion_sort/mod.rs:3

↓ 1 callersFunctionmerge

( a: Vec<T>, b: Vec<T>, steps: &mut Vec<Vec<SortCommand<T>>>, start_i: usize, )

src/sorting/src/sorting_algorithms/merge_sort/mod.rs:22

↓ 1 callersMethodnew_to_old_visited

(&mut self)

src/pathfinding/src/lib.rs:267

↓ 1 callersMethodpartial_cmp

(&self, other: &Self)

src/pathfinding/src/pathfinding_algorithms/a_star/mod.rs:99

↓ 1 callersMethodpartial_cmp

(&self, other: &Self)

src/pathfinding/src/pathfinding_algorithms/dijkstra/mod.rs:75

↓ 1 callersFunctionpartition

( items: &mut Vec<T>, steps: &mut Vec<Vec<SortCommand<T>>>, low: isize, high: isize, )

src/sorting/src/sorting_algorithms/quicksort/mod.rs:21

↓ 1 callersMethodplay

Play `Note`s for a given duration.

src/utils/audio.rs:30

↓ 1 callersFunctionrecursive_division

( width: usize, height: usize, mut steps: Vec<MazeGenerationStep>, )

src/pathfinding/src/maze_generation/recursive_division/mod.rs:18

↓ 1 callersMethodremove_old_visited

(&mut self)

src/pathfinding/src/lib.rs:275

↓ 1 callersMethodremove_vertex

(&mut self, vertex: &V)

src/pathfinding/src/graph.rs:52

↓ 1 callersFunctionrun_pathfinding

Tracks the duration of running the algorithm and returns a [`PathfindingResult`].

src/pathfinding/src/lib.rs:202

↓ 1 callersFunctionrun_sort

Runs a given sorting algorithm on given items. Tracks the duration of running the algorithm and returns a [`SortResult`].

src/sorting/src/lib.rs:8

↓ 1 callersFunctionrun_sort_steps

Runs given sorting operations on a vector of type T.

src/sorting/src/lib.rs:47

↓ 1 callersMethodset_g

(&mut self, g: E)

src/pathfinding/src/pathfinding_algorithms/a_star/mod.rs:130

↓ 1 callersMethodset_parent

(&mut self, parent: Option<V>)

src/pathfinding/src/pathfinding_algorithms/a_star/mod.rs:127

↓ 1 callersMethodstop_all

Stops all currently playing notes with a 0.5 second fade.

src/utils/audio.rs:54

↓ 1 callersFunctionuse_color_scheme

()

src/hooks/use_color_scheme.rs:35

↓ 1 callersFunctionuse_mouse_pos

()

src/hooks/use_mouse_pos.rs:6

↓ 1 callersFunctionuse_sort_audio

( items: UseStateHandle<Vec<u32>>, step: UseStateHandle<Vec<SortCommand<u32>>>, config: AudioCo

src/hooks/use_sort_audio.rs:12

FunctionAlgoDesc

(props: &AlgoDescProps)

src/components/algo_desc.rs:14

FunctionApp

()

src/main.rs:53

FunctionAudioControls

(props: &AudioControlsProps)

src/components/sorting/audio_controls.rs:36

FunctionButton

(props: &ButtonProps)

src/components/input_items/button.rs:10

FunctionCheckbox

(props: &CheckboxProps)

src/components/input_items/checkbox.rs:13

FunctionCollapsible

(props: &CollapsibleProps)

src/components/collapsible.rs:13

FunctionFloatInput

( props: &FloatInputProps<T>, )

src/components/input_items/number_input.rs:72

( props: &IntInputProps<T>, )

src/components/input_items/number_input.rs:23

FunctionPathGrid

(props: &PathGridProps)

src/components/pathfinding/path_grid.rs:47

FunctionPathToolbar

(props: &PathToolbarProps)

src/components/pathfinding/toolbar.rs:26

FunctionPathfinding404Page

(props: &Pathfinding404PageProps)

src/pages/pathfinding.rs:610

FunctionPathfindingControls

(props: &PathfindingControlsProps<E>)

src/components/pathfinding/pathfinding_controls.rs:21

FunctionPathfindingPage

(props: &PathfindingPageProps)

src/pages/pathfinding.rs:134

FunctionRawHtml

(props: &RawHtmlProps)

src/components/raw_html.rs:10

FunctionSelectInput

(props: &SelectInputProps)

src/components/input_items/select_input.rs:15

FunctionSidebar

(props: &SidebarProps)

src/components/sidebar.rs:19

FunctionSortControls

(props: &SortControlsProps)

src/components/sorting/sort_controls.rs:18

FunctionSortGraph

(props: &SortGraphProps)

src/components/sorting/sort_graph.rs:36

FunctionSorting404Page

(props: &Sorting404PageProps)

src/pages/sorting.rs:371

FunctionSortingAlgorithmsPage

(props: &SortingAlgorithmsPageProps)

src/pages/sorting.rs:138

FunctionStepSlider

(props: &StepSliderProps)

src/components/step_slider.rs:20

FunctionWallControls

(props: &WallControlsProps)

src/components/pathfinding/wall_controls.rs:12

Function_recursive_dfs

( adjacency_list: AdjacencyList<V, E>, (vertex, cost): (V, E), mut visited: BTreeMap<V, E>,

src/pathfinding/src/pathfinding_algorithms/dfs/mod.rs:67

Functiona_star

( adjacency_list: AdjacencyList<V, E>, start: V, end: V, mut steps: PathfindingSteps<V>, )

src/pathfinding/src/pathfinding_algorithms/a_star/mod.rs:9

Methodadd

(self, other: Self)

src/pathfinding/src/lib.rs:173

Methodadd_edge_directed

Adds a new directed edge from `a` to `b` with a given `weight`.\ If `a` doesn't exist, it is created along with the edge to `b`.\ If `b` doesn't exist

src/pathfinding/src/graph.rs:27

Methodadd_vertex

(&mut self, vertex: V)

src/pathfinding/src/graph.rs:13

Functionbubble_sort

( items: &mut Vec<T>, steps: &mut Vec<Vec<SortCommand<T>>>, )

src/sorting/src/sorting_algorithms/bubble_sort/mod.rs:3

Functionbucket_sort

(items: &mut Vec<u32>, steps: &mut Vec<Vec<SortCommand<u32>>>)

src/sorting/src/sorting_algorithms/bucket_sort/mod.rs:3

Methodcmp

(&self, other: &Self)

src/pathfinding/src/pathfinding_algorithms/a_star/mod.rs:104

Methoddefault

()

src/components/sorting/audio_controls.rs:18

Methoddefault

()

src/pages/sorting.rs:43

Methoddefault

()

src/pages/pathfinding.rs:53

Functiondfs

( adjacency_list: AdjacencyList<V, E>, start: V, end: V, mut steps: PathfindingSteps<V>,

src/pathfinding/src/pathfinding_algorithms/dfs/mod.rs:5

Functiondijkstra

( adjacency_list: AdjacencyList<V, E>, start: V, end: V, mut steps: PathfindingSteps<V>,

src/pathfinding/src/pathfinding_algorithms/dijkstra/mod.rs:9

Methodeq

(&self, other: &Self)

src/pages/sorting.rs:54

Methodeq

(&self, other: &Self)

src/pathfinding/src/pathfinding_algorithms/dijkstra/mod.rs:81

Methodfmt

(&self, f: &mut fmt::Formatter<'_>)

src/pathfinding/src/lib.rs:166

Methodfmt

(&self, f: &mut std::fmt::Formatter<'_>)

src/hooks/use_color_scheme.rs:14

Methodget_all

(self)

src/pathfinding/src/lib.rs:250

Methodget_points_high

(from: Coord, to: Coord)

src/pathfinding/src/lib.rs:104

next →1–100 of 120, ranked by callers