Functions — github.com/Stoeoef/spade

CodeHub MCPcopy Create free account

hub / github.com/Stoeoef/spade / functions

Functions805 in github.com/Stoeoef/spade

⨍ Functions 805◇ Types & classes 106

(&self, f: &mut core::fmt::Formatter)

src/delaunay_core/handles/handle_impls.rs:16

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

examples/svg_renderer/quicksketch/color.rs:11

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

fuzz/fuzz_targets/fuzz_shared.rs:17

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

fuzz/fuzz_targets/bulk_load_int_fuzz.rs:30

(point: Point2<S>)

src/point.rs:93

(value: mint::Point2<S>)

src/mint_support.rs:15

(color: SketchColor)

examples/svg_renderer/quicksketch/mod.rs:21

( cdt: ConstrainedDelaunayTriangulation<V, DE, UE, F, L>, )

src/delaunay_triangulation.rs:360

Create a new angle limit from an angle given in degrees. Note that angles larger than 30 degrees will quickly lead to overrefinement as the algorithm

src/delaunay_core/refinement.rs:62

Methodfrom_determinant

src/delaunay_core/line_side_info.rs:21

Methodfrom_index

Creates a new vertex handle from a `usize`. Ideally, this method should only be used in advanced scenarios as it allows to create invalid vertex hand

src/delaunay_core/handles/handle_defs.rs:57

Methodfrom_iterator

(iterator: impl IntoIterator<Item = SketchElement>)

examples/svg_renderer/quicksketch/mod.rs:632

Methodfrom_parts

( dcel: Dcel<Self::Vertex, Self::DirectedEdge, Self::UndirectedEdge, Self::Face>, hint_generat

src/delaunay_triangulation.rs:435

Methodfrom_parts

( dcel: Dcel<Self::Vertex, Self::DirectedEdge, Self::UndirectedEdge, Self::Face>, hint_generat

Create a new angle limit from an angle given in radians. Note angles larger than 30 degrees (≈0.52rad = PI / 6) will quickly lead to poor refinement

src/delaunay_core/refinement.rs:72

Methodfrom_radius_to_shortest_edge_ratio

Creates a new angle limit by specifying the circumradius to shortest edge ratio that must be kept. For each face, this ratio is calculated by dividin

src/delaunay_core/refinement.rs:116

(red: u8, green: u8, blue: u8)

examples/svg_renderer/quicksketch/color.rs:17

Methodfrom_triangulation

(triangulation: &T, center: Point2<f64>)

src/delaunay_core/bulk_load.rs:813

Functionfuzz_test_bulk_load_cdt

src/cdt.rs:2466

Functionfuzz_test_bulk_load_cdt_2

src/cdt.rs:2483

Functionfuzz_test_bulk_load_cdt_3

src/cdt.rs:2502

Functionfuzz_test_bulk_load_cdt_4

src/cdt.rs:2547

Functionfuzz_test_on_grid

src/cdt.rs:1716

Functionfuzz_test_on_line

src/cdt.rs:1691

Methodget_conflicting_edges_between_points

Returns all constraint edges that would prevent creating a new constraint between two points. # See also See also [Self::get_conflicting_edges_betwe

Methodget_conflicting_edges_between_vertices

Returns all constraint edges that would prevent inserting a new constraint connecting two existing vertices. # See also See also [Self::get_conflict

Methodget_edge_from_neighbors

( &self, from: FixedVertexHandle, to: FixedVertexHandle, )

src/triangulation.rs:456

Methodget_first_intersection

( delaunay: &'a T, line_from: Point2<V::Scalar>, line_to: Point2<V::Scalar>, )

src/intersection_iterator.rs:216

Methodget_item_bounding_box

(item: &SketchElement)

examples/svg_renderer/quicksketch/convert.rs:291

Methodget_items_bounding_box

examples/svg_renderer/quicksketch/convert.rs:277

Methodget_start_edges

( t: &'a T, metric: &M, start_point: Point2<<T::Vertex as HasPosition>::Scalar>, )

src/flood_fill_iterator.rs:333

Methodget_style_attribute

examples/svg_renderer/quicksketch/mod.rs:51

Functionget_try_cdt_for_duplicate_vertices

src/cdt.rs:2026

Methodget_vertex

( &self, handle: FixedVertexHandle, )

src/triangulation.rs:348

Methodget_vertex

(&self, handle: FixedVertexHandle)

src/delaunay_core/dcel.rs:128

Methodhandle_legal_edge_split

(&mut self, _: [FixedDirectedEdgeHandle; 2])

src/triangulation.rs:77

(&self, state: &mut HA)

src/delaunay_core/handles/handle_impls.rs:139

Functionhierarchy_hint_generator_removal_test

src/delaunay_core/hint_generator.rs:405

Functionhierarchy_hint_generator_test

src/delaunay_core/hint_generator.rs:336

Methodhint_generator_mut

src/delaunay_triangulation.rs:431

Functioninfinite_loop_2

src/cdt.rs:1979

Functioninfinite_loop_bug

src/cdt.rs:1919

(&mut self, vertices: impl Iterator<Item = [f64; 2]>)

delaunay_compare/src/delaunator_crate.rs:11

(&mut self, vertices: impl IntoIterator<Item = [f64; 2]>)

delaunay_compare/src/spade_crate.rs:36

Methodinitialize_from_triangulation

src/delaunay_core/hint_generator.rs:118

Methodinner_faces

An iterator visiting all inner faces. The iterator type is [FaceHandle<InnerTag, ...>](FaceHandle).

src/triangulation.rs:371

Inserts a new vertex into the triangulation. This operation runs in O(log(n)) on average when using a tree lookup to back up the triangulation, or in

src/triangulation.rs:572

Functioninterpolation_benchmark

(c: &mut Criterion)

benches/interpolation_benchmark.rs:7

Methodintersects_constraint

Checks if a line intersects a constraint edge. Returns `true` if the edge from `from` to `to` intersects a constraint edge.

Methodis_defined_legal

(&self, _: FixedUndirectedEdgeHandle)

src/triangulation.rs:72

Methodis_fixed_edge

(edge: UndirectedEdgeHandle<V, DE, CdtEdge<UE>, F>)

src/delaunay_core/refinement.rs:757

Methodis_point_inside

(&self, point: Point2<S>)

src/flood_fill_iterator.rs:36

Methodis_uniform_insertion_expensive

delaunay_compare/src/spade_crate.rs:19

(from: Point, to: Point)

examples/svg_renderer/quicksketch/mod.rs:534

Functionlocate_benchmark

(c: &mut Criterion)

benches/locate_benchmark.rs:12

Used for rendering SVGs for documentation. These are inlined (via #[doc = include_str!(...)]) into the doc comment of a few items. That makes sure the

examples/svg_renderer/main.rs:14

examples/interpolation/main.rs:54

delaunay_compare/examples/real_data_benchmark.rs:7

Methodmap_vertices

src/delaunay_core/dcel.rs:132

Methodnearest_point

Yields the nearest point on this edge.

src/delaunay_core/handles/handle_impls.rs:561

(center: Point2<S>, radius_2: S)

src/flood_fill_iterator.rs:52

Creates a new triangulation. A newly created triangulation contains no vertices, no edges and the single outer face. # Example ``` use spade::{Delau

src/triangulation.rs:131

src/point.rs:41

Creates a new `LineIntersectionIterator` covering an arbitrary line. See [LineIntersectionIterator] for more information.

src/intersection_iterator.rs:154

(triangulation: &'a T)

src/delaunay_core/interpolation.rs:156

(normalized: HalfEdgeEntry, not_normalized: HalfEdgeEntry)

src/delaunay_core/dcel.rs:49

(from: FloatOrd<f64>, to: FloatOrd<f64>)

src/delaunay_core/bulk_load.rs:750

(factor: S, length_2: S)

src/delaunay_core/math.rs:172

Creates a new set of `RefinementParameters`. The following values will be used by `new` and `Self::default`: `exclude_outer_faces`: disabled - all fa

src/delaunay_core/refinement.rs:204

src/delaunay_core/handles/handle_defs.rs:65

(start_edge: DirectedEdgeHandle<'a, V, DE, UE, F>)

src/delaunay_core/handles/iterators/circular_iterator.rs:23

(dcel: &'a Dcel<V, DE, UE, F>)

src/delaunay_core/handles/iterators/hull_iterator.rs:28

src/delaunay_core/handles/iterators/fixed_iterators.rs:15

(x: f64, y: f64)

examples/svg_renderer/scenario.rs:20

examples/svg_renderer/quicksketch/mod.rs:134

(unique_prefix: S)

examples/svg_renderer/quicksketch/convert.rs:23

(x: f64, y: f64, height: f64)

examples/interpolation/main.rs:17

Methodnew_empty

(some_edge: DirectedEdgeHandle<'a, V, DE, UE, F>)

src/delaunay_core/handles/iterators/circular_iterator.rs:32

Methodnew_from_handles

Creates a new line iterator covering the line spanned by two existing vertices. Both start and end vertex are part of the iteration result. # Exampl

src/intersection_iterator.rs:196

Methodnew_internal

src/delaunay_core/handles/handle_defs.rs:97

Methodnew_normalized

src/delaunay_core/handles/handle_impls.rs:72

Returns the edge that is connected to this edge in counterclockwise order. See also [prev](Self::prev)

src/delaunay_core/handles/public_handles.rs:334

src/delaunay_core/handles/iterators/circular_iterator.rs:45

( edge_handle: DirectedEdgeHandle<V, DE, UE, F>, )

src/delaunay_core/handles/iterators/hull_iterator.rs:14

src/delaunay_core/handles/iterators/fixed_iterators.rs:29

Methodnext_back

( edge_handle: DirectedEdgeHandle<V, DE, UE, F>, )

src/delaunay_core/handles/handle_impls.rs:728

Methodnext_back

src/delaunay_core/handles/iterators/circular_iterator.rs:61

Methodnext_back

( edge_handle: DirectedEdgeHandle<V, DE, UE, F>, )

src/delaunay_core/handles/iterators/hull_iterator.rs:20

Methodnext_back

src/delaunay_core/handles/iterators/fixed_iterators.rs:50

(&mut self, n: usize)

src/delaunay_core/handles/iterators/fixed_iterators.rs:54

Methodnum_elements

(dcel: &Dcel<V, DE, UE, F>)

src/delaunay_core/handles/handle_defs.rs:181

Methodnum_vertices

Returns the number vertices in this triangulation.

src/triangulation.rs:322

Returns a voronoi edge going out of this vertex.

src/delaunay_core/handles/public_handles.rs:262

Methodouter_face

Returns a reference handle to the single outer face of this triangulation.

src/triangulation.rs:215

examples/svg_renderer/quicksketch/mod.rs:549

src/point.rs:137

src/mint_support.rs:9

examples/interpolation/main.rs:28

fuzz/fuzz_targets/fuzz_shared.rs:11

Returns the edge that is connected to this edge in clockwise order. See also [next](Self::next)

src/delaunay_core/handles/public_handles.rs:341

← previous next →501–600 of 805, ranked by callers