Struct pschema_rs::shape::shape_tree::ShapeTree

pub struct ShapeTree { /* private fields */ }

The ShapeTree struct contains a vector of ShapeTreeItem objects.

Properties:

• shapes: shapes is a vector of ShapeTreeItem structs that represents the collection of shapes in the ShapeTree. Each ShapeTreeItem struct contains information about a single shape, such as its type, position, and size.

Implementations

impl ShapeTree

pub fn new(shape: Shape) -> Self

The approach to the problem is using Reverse Level Order Traversal and storing all the levels in a 2D vector having each of the levels stored in a different row. The steps to follow are described below:

1. Create a vector nodes to store the nodes to be evaluated.
2. Create the shapes vector to store the different levels.
3. Push the root node, provided node, into the queue.
4. Iterate over the nodes until there’s no value left: 4.1 Iterate over all the nodes that were there at the beginning of the iteration. 4.2 Take the first node in the queue and match it against its Enum 4.2.1 If it is a TripleConstraint => push it to the temporary vector for the current iteration 4.2.2 If it is a ShapeReference => push it to the temporary vector and enqueue its child 4.2.3 If it is a ShapeComposite => push it to the temporary vector and enqueue its children 4.2.4 If it is a ShapeLiteral => push it to the temporary vector for the current iteration 4.2.5 If it is a NumericFacet => push it to the temporary vector and enqueue its child 4.3 Push the temporary results into the shapes vector 4.4 Clear the temporary results.
5. Return the shapes vector in reverse order

pub fn iterations(&self) -> u8

The function returns the number of iterations needed to generate all possible combinations of shapes in a given object. This is a Theorem than can be seen in further detail in the paper associated with this project.

Returns:

The function iterations returns a u8 value which represents the number of iterations required to generate all possible combinations of shapes in the self object. If the self object contains an n-ary shape, then the number of iterations is equal to the number of shapes minus one, otherwise it is equal to the number of shapes.

Trait Implementations

impl Clone for ShapeTree

fn clone(&self) -> ShapeTree

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl IntoIterator for ShapeTree

type Item = Vec<Shape, Global>

The type of the elements being iterated over.

type IntoIter = IntoIter<<ShapeTree as IntoIterator>::Item, Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.