Struct libreda_db::layout::prelude::PointString [−][src]
pub struct PointString<T> where
T: CoordinateType, {
pub points: Vec<Point<T>, Global>,
}
Expand description
A point string is a finite sequence of points.
TODO: Implement Deref
for accessing the list of points.
Fields
points: Vec<Point<T>, Global>
The points defining this point string.
Implementations
Create new point string by taking vertices from a type that implements Into<PointString<T>>
.
Get the sequence of edges of the point string starting from the first point to the last.
Examples
use iron_shapes::point_string::PointString;
use iron_shapes::edge::Edge;
let coords = vec![(0, 0), (1, 0), (2, 0)];
let point_string = PointString::new(coords);
let edges: Vec<_> = point_string.edges().collect();
assert_eq!(edges, vec![Edge::new((0, 0), (1, 0)), Edge::new((1, 0), (2, 0))]);
Same as edges
but in reverse order.
Get the sequence of edges of the point string starting from the last point to the first.
Examples
use iron_shapes::point_string::PointString;
use iron_shapes::edge::Edge;
let coords = vec![(0, 0), (1, 0), (2, 0)];
let point_string = PointString::new(coords);
let edges: Vec<_> = point_string.edges_reversed().collect();
assert_eq!(edges, vec![Edge::new((2, 0), (1, 0)), Edge::new((1, 0), (0, 0))]);
Compute geometrical length of the path defined by the point string.
Examples
use iron_shapes::point_string::PointString;
let coords = vec![(0, 0), (1, 0), (2, 0)];
let point_string = PointString::new(coords);
assert_eq!(point_string.path_length::<f64>(), 2.0);
Trait Implementations
pub fn deserialize<__D>(
__deserializer: __D
) -> Result<PointString<T>, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
pub fn deserialize<__D>(
__deserializer: __D
) -> Result<PointString<T>, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl<I, T, P> From<I> for PointString<T> where
T: CoordinateType,
I: IntoIterator<Item = P>,
Point<T>: From<P>,
impl<I, T, P> From<I> for PointString<T> where
T: CoordinateType,
I: IntoIterator<Item = P>,
Point<T>: From<P>,
Create a point string from something that can be turned into an iterator of values convertible to Point
s.
Performs the conversion.
Create a point string from a iterator of values convertible to Point
s.
Creates a value from an iterator. Read more
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
pub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
pub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
Compute the bounding box of all the points in this string.
Returns None
if the string is empty.
Examples
use iron_shapes::point_string::PointString;
use iron_shapes::traits::TryBoundingBox;
use iron_shapes::rect::Rect;
let coords = vec![(0, 0), (1, 0), (2, 1), (-1, -3)];
let point_string = PointString::new(coords);
assert_eq!(point_string.try_bounding_box(), Some(Rect::new((2, 1), (-1, -3))));
impl<T, Dst> TryCastCoord<T, Dst> for PointString<T> where
T: CoordinateType + NumCast,
Dst: CoordinateType + NumCast,
impl<T, Dst> TryCastCoord<T, Dst> for PointString<T> where
T: CoordinateType + NumCast,
Dst: CoordinateType + NumCast,
type Output = PointString<Dst>
type Output = PointString<Dst>
Output type of the cast. This is likely the same geometrical type just with other coordinate types. Read more
Try to cast to target data type. Read more
Auto Trait Implementations
impl<T> RefUnwindSafe for PointString<T> where
T: RefUnwindSafe,
impl<T> Send for PointString<T> where
T: Send,
impl<T> Sync for PointString<T> where
T: Sync,
impl<T> Unpin for PointString<T> where
T: Unpin,
impl<T> UnwindSafe for PointString<T> where
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Rotate the geometrical shape by a multiple of 90 degrees.