Functions — github.com/Stoeoef/spade

CodeHub MCPcopy Index your code

hub / github.com/Stoeoef/spade / functions

Functions805 in github.com/Stoeoef/spade

⨍ Functions 805◇ Types & classes 106

↓ 1,084 callersFunctionnew

src/delaunay_core/dcel_operations.rs:998

↓ 334 callersMethodinsert

Updates the hull after the insertion of a vertex. This method should be called after a vertex `v` has been inserted into the outer face of the triang

src/delaunay_core/bulk_load.rs:918

↓ 205 callersMethodfix

Converts this dynamic handle to its fixed variant. See also the [handles module](crate::handles)

src/delaunay_core/handles/handle_impls.rs:166

↓ 123 callersMethodrev

src/delaunay_core/handles/handle_impls.rs:96

↓ 97 callersMethodadd

(&mut self, item: T)

examples/svg_renderer/quicksketch/mod.rs:672

↓ 93 callersMethodhalf_edge_mut

(&mut self, handle: FixedDirectedEdgeHandle)

src/delaunay_core/dcel.rs:233

↓ 87 callersMethodposition

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

src/delaunay_core/triangulation_ext.rs:40

↓ 79 callersMethodindex

Returns the internal index of this element. Indices of the same handle type are guaranteed to be unique (e.g. different vertices will have different

src/delaunay_core/handles/handle_defs.rs:87

↓ 70 callersMethodas_undirected

src/delaunay_core/handles/handle_impls.rs:105

↓ 68 callersMethodto

Returns the edge's destination vertex.

src/delaunay_core/handles/handle_impls.rs:225

↓ 64 callersMethodvertex

(&self, handle: FixedVertexHandle)

src/delaunay_core/dcel.rs:185

↓ 61 callersFunctionconvert_point

(point: spade::Point2<f64>)

examples/svg_renderer/main.rs:123

↓ 60 callersMethoddirected_edge

( &self, handle: FixedDirectedEdgeHandle, )

src/delaunay_core/dcel.rs:195

↓ 57 callersMethodnext

Returns the oriented next edge. The oriented next edge shares the same face as this edge. When traversing the face's edges in oriented order, this ed

src/delaunay_core/handles/handle_impls.rs:254

↓ 57 callersMethodposition

(mut self, position: Point)

examples/svg_renderer/quicksketch/mod.rs:279

↓ 53 callersFunctionbulk_load

Implements a circle-sweep bulk loading algorithm for efficient initialization of Delaunay triangulations. The algorithm is motivated by: A faster ci

src/delaunay_core/bulk_load.rs:94

↓ 50 callersMethodsanity_check

src/delaunay_core/triangulation_ext.rs:891

↓ 45 callersMethods_mut

↓ 43 callersMethodfrom

Returns the edge's origin vertex.

src/delaunay_core/handles/handle_impls.rs:219

↓ 42 callersMethodcdt_sanity_check

↓ 41 callersMethodface

( &self, handle: FixedHandleImpl<FaceTag, InnerOuter>, )

src/delaunay_core/dcel.rs:259

↓ 40 callersMethodprev

Returns the oriented previous edge. The oriented previous edge shares the same face as this edge. When traversing the face's edges in oriented order,

src/delaunay_core/handles/handle_impls.rs:266

↓ 39 callersMethodadd_constraint

Adds a constraint edge between to vertices. Returns `true` if at least one constraint edge was added. Note that the given constraint might be split i

↓ 39 callersMethodfont_size

(mut self, font_size: f64)

examples/svg_renderer/quicksketch/mod.rs:304

↓ 37 callersFunctionsave_svg

(doc: Sketch, name: &'static str)

examples/svg_renderer/main.rs:15

↓ 35 callersMethods

↓ 34 callersMethodnum_vertices

src/delaunay_core/dcel.rs:169

↓ 33 callersFunctioncheck

(from: Point2<f64>, to: Point2<f64>, expected: bool)

src/flood_fill_iterator.rs:787

↓ 33 callersMethodsanity_check

src/delaunay_core/dcel.rs:385

↓ 32 callersFunctionrandom_points_with_seed

(size: usize, seed: &[u8; 32])

src/test_utilities.rs:25

↓ 32 callersMethodstroke_color

(mut self, color: SketchColor)

examples/svg_renderer/quicksketch/mod.rs:212

↓ 32 callersMethodto_f64

src/point.rs:53

↓ 30 callersMethodvertices

src/delaunay_core/dcel.rs:331

↓ 29 callersFunctionappend_unconnected_vertex

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

src/delaunay_core/dcel_operations.rs:826

↓ 28 callersMethodline_to

(mut self, point: Point)

examples/svg_renderer/quicksketch/mod.rs:367

↓ 27 callersMethoddy

(mut self, dy: f64)

examples/svg_renderer/quicksketch/mod.rs:314

↓ 25 callersFunctioncheck

( delaunay: &Triangulation, from: Point2<f64>, to: Point2<f64>, mut expected:

src/intersection_iterator.rs:538

↓ 25 callersMethodpositions

Returns the start and end position of this edge. The first returned position is `self.from().position()`, the second is `self.to().position()`.

src/delaunay_core/handles/handle_impls.rs:339

↓ 25 callersMethodstroke_width

(mut self, width: f64)

examples/svg_renderer/quicksketch/mod.rs:207

↓ 24 callersMethodget_edge_from_neighbors

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

src/delaunay_core/dcel.rs:301

↓ 24 callersMethodhalf_edge

(&self, handle: FixedDirectedEdgeHandle)

src/delaunay_core/dcel.rs:228

↓ 24 callersMethodremove

Removes a vertex from the triangulation. This operation runs in O(n²), where n is the degree of the removed vertex. # Handle invalidation This metho

↓ 23 callersFunctionfuzz_test

(vertices: Vec<Point2<f64>>)

src/delaunay_core/bulk_load_fuzz_tests.rs:5

↓ 23 callersMethodmul

(&self, factor: S)

src/point.rs:57

↓ 22 callersMethodclone

src/intersection_iterator.rs:127

↓ 21 callersMethodas_inner

Converts this face handle to an inner face. Returns `None` if this handle refers to the single outer face.

src/delaunay_core/handles/handle_impls.rs:195

↓ 21 callersFunctionconvert_triangulation

(triangulation: &T, options: &ConversionOptions)

examples/svg_renderer/scenario.rs:104

↓ 21 callersMethodside_query

Identifies on which side of this edge a point lies.

src/delaunay_core/handles/handle_impls.rs:359

↓ 20 callersFunctionbulk_load_cdt

Returns the [`ConstrainedDelaunayTriangulation`]. Panics if it encounters any conflicting edges. See [try_bulk_load_cdt] for a non-panicking version.

src/delaunay_core/bulk_load.rs:189

↓ 19 callersMethodadd

(&self, other: Self)

src/point.rs:64

↓ 19 callersMethodas_directed

src/delaunay_core/handles/handle_impls.rs:449

↓ 19 callersMethodfill

(mut self, fill: impl Into<SketchFill>)

examples/svg_renderer/quicksketch/mod.rs:202

↓ 19 callersMethodis_on_line

src/delaunay_core/line_side_info.rs:57

↓ 19 callersMethodsub

(&self, other: Self)

src/point.rs:75

↓ 18 callersMethodout_edges

A possible iteration order of `v.out_edges()` Note*: The returned iterator implements `DoubleEndedIterator`, allowing traversal in clockwise order.

src/delaunay_core/handles/handle_impls.rs:747

↓ 18 callersMethodset_width

(&mut self, width: u32)

examples/svg_renderer/quicksketch/mod.rs:642

↓ 17 callersMethodis_constraint_edge

Returns `true` if this edge is a constraint edge.

↓ 17 callersMethodposition

Returns the position of this vertex.

src/delaunay_core/handles/handle_impls.rs:714

↓ 17 callersFunctionside_query

(p1: Point2<S>, p2: Point2<S>, query_point: Point2<S>)

src/delaunay_core/math.rs:298

↓ 16 callersMethodadjust_inner_outer

src/delaunay_core/handles/handle_defs.rs:91

↓ 16 callersMethodmove_to

(mut self, point: Point)

examples/svg_renderer/quicksketch/mod.rs:357

↓ 15 callersMethodadd_constraint_edges

Creates a several constraint edges by taking and connecting vertices from an iterator. Every two sequential vertices in the input iterator will be co

↓ 15 callersMethodfrom

(point: Point2<f64>)

examples/svg_renderer/scenario.rs:14

↓ 15 callersMethodlength2

src/point.rs:71

↓ 14 callersMethodcreate_adjacent_text

(&self, text: S)

examples/svg_renderer/quicksketch/mod.rs:491

↓ 14 callersMethodhorizontal_alignment

(mut self, horizontal_alignment: HorizontalAlignment)

examples/svg_renderer/quicksketch/mod.rs:299

↓ 14 callersMethodis_outer_edge

Returns `true` if this edge is adjacent to the outer face.

src/delaunay_core/handles/handle_impls.rs:314

↓ 14 callersMethodlocate

Returns information about the location of a point in a triangulation. # Panics Panics if the target point has any `NAN` coordinate.

src/triangulation.rs:423

↓ 14 callersMethodundirected_edge_data_mut

(&mut self, handle: FixedUndirectedEdgeHandle)

src/delaunay_core/dcel.rs:255

↓ 13 callersMethodcircumcenter

Returns the face's circumcenter. The circumcenter is the center of the circumcircle.

src/delaunay_core/handles/handle_impls.rs:670

↓ 13 callersMethodclone

src/delaunay_core/hint_generator.rs:86

↓ 13 callersMethodis_on_left_side

Returns `true` if a point lies on the left side of a line. For left-handed coordinate systems, this method returns if a point lies on the right side

src/delaunay_core/line_side_info.rs:29

↓ 13 callersMethodnatural_neighbor

Allows using natural neighbor interpolation on this triangulation. Refer to the documentation of [NaturalNeighbor] for more information.

src/delaunay_triangulation.rs:400

↓ 13 callersFunctionround

examples/svg_renderer/quicksketch/convert.rs:47

↓ 12 callersMethodclear

src/delaunay_core/dcel.rs:122

↓ 12 callersMethoddata

Returns the wrapped undirected edge data type.

↓ 12 callersFunctionproject_point

(p1: Point2<S>, p2: Point2<S>, query_point: Point2<S>)

src/delaunay_core/math.rs:247

↓ 12 callersMethodrefine

(&mut self, parameters: RefinementParameters<V::Scalar>)

src/delaunay_core/refinement.rs:463

↓ 12 callersMethodundirected_edges

src/delaunay_core/dcel.rs:327

↓ 11 callersMethodas_voronoi_edge

Converts this edge into its dual voronoi edge. See also [as_delaunay_edge](DirectedVoronoiEdge::as_delaunay_edge).

src/delaunay_core/handles/handle_impls.rs:326

↓ 10 callersMethodadjacent_edges

The edges are returned in counterclockwise order.

src/delaunay_core/handles/handle_impls.rs:595

↓ 10 callersMethoddata

Returns a reference to the data associated with this directed edge. Use [Triangulation::directed_edge_data_mut](crate::Triangulation::directed_edge_d

src/delaunay_core/handles/handle_impls.rs:297

↓ 10 callersFunctiondefault_triangle

src/delaunay_core/dcel_operations.rs:1331

↓ 10 callersMethoddistance_2

(&self, other: Self)

src/point.rs:49

↓ 10 callersMethodinner_faces

src/delaunay_core/dcel.rs:343

↓ 10 callersMethodnum_undirected_edges

src/delaunay_core/dcel.rs:177

↓ 10 callersMethodopposite_position

src/delaunay_core/handles/handle_impls.rs:348

↓ 9 callersMethodadd_constraint_and_split

# Code example ``` use spade::{ConstrainedDelaunayTriangulation, Point2, Triangulation}; # fn try_main() -> Result<(), spade::InsertionError> { use s

src/cdt.rs:1227

↓ 9 callersMethodadd_constraint_edge

Insert two points and creates a constraint between them. Returns `true` if at least one constraint edge was added. # Panics Panics if the new const

↓ 9 callersMethodadd_with_layer

( &mut self, item: T, layer: SketchLayer, )

examples/svg_renderer/quicksketch/mod.rs:676

↓ 9 callersFunctionbig_triangulation

examples/svg_renderer/scenario_list.rs:27

↓ 9 callersMethoddata_mut

Returns the wrapped undirected edge data type.

↓ 9 callersMethodhint_generator

↓ 9 callersMethodindex

Returns the internal index of this element. Indices of the same handle type are guaranteed to be unique (e.g. different vertices will have different

src/delaunay_core/handles/handle_impls.rs:180

↓ 9 callersMethodnum_faces

src/delaunay_core/dcel.rs:181

↓ 9 callersMethodpartial_cmp

(&self, other: &Self)

src/delaunay_core/handles/handle_impls.rs:155

↓ 9 callersMethodposition

src/delaunay_core/interpolation.rs:840

↓ 9 callersMethodshift_to

(mut self, shift_to: f64)

examples/svg_renderer/quicksketch/mod.rs:467

↓ 9 callersFunctiontest_rectangle_iterator

(d: &impl Triangulation<Vertex = Point2<f64>>)

src/flood_fill_iterator.rs:650

↓ 9 callersMethodwith_arrow_end

(mut self, arrow_type: ArrowType)

examples/svg_renderer/quicksketch/mod.rs:420

next →1–100 of 805, ranked by callers