fn extend(&mut self, vertex: usize, edge_origin: Origin, edge_curve: &BezPath) -> bool {
		self.vertices.push((vertex, edge_origin));
		self.area += path_area(edge_curve);
		vertex == self.vertices[0].0
	}
/// Returns true when the cycle is complete, a cycle is complete when it revisits its first vertex where edge is the edge traversed in order to get to vertex.
/// For purposes of computing direction this function assumes vertices are traversed in order
Returns true when the cycle is complete, a cycle is complete when it revisits its first vertex where edge is the edge traversed in order to get to vertex.
For purposes of computing direction this function assumes vertices are traversed in order
Returns true when the cycle is complete a cycle is complete when it revisits its first vertex where edge is the edge traversed in order to get to vertex . For purposes of computing direction this function assumes vertices are traversed in order
fn extend(&mut self, vertex: usize, edge_origin: Origin, edge_curve: &BezPath) -> bool {
		self.vertices.push((vertex, edge_origin));
		self.area += path_area(edge_curve);
		vertex == self.vertices[0].0
	}
fn extend ( & mut self , vertex : usize , edge_origin : Origin , edge_curve : & BezPath ) -> bool { self . vertices . push ( ( vertex , edge_origin ) ) ; self . area += path_area ( edge_curve ) ; vertex == self . vertices [ 0 ] . 0 }
Returns true when the cycle is complete, a cycle is complete when it revisits its first vertex where edge is the edge traversed in order to get to vertex.
Returns true when the cycle is complete a cycle is complete when it revisits its first vertex where edge is the edge traversed in order to get to vertex .
&mut self
vertex
usize
edge_origin
Origin
edge_curve
&BezPath
&mut self
vertex
usize
edge_origin
Origin
edge_curve
&BezPath