Struct ByCondition

pub struct ByCondition<F>(/* private fields */);

The structure is an implementation of Location to search for cells with a specified condition.

Implementations

impl<F> ByCondition<F>

pub fn new(search: F) -> Self

where F: Fn(&str) -> bool,

Constructs a new object of the structure.

Trait Implementations

impl<F: Clone> Clone for ByCondition<F>

fn clone(&self) -> ByCondition<F>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug> Debug for ByCondition<F>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<F: Default> Default for ByCondition<F>

fn default() -> ByCondition<F>

Returns the “default value” for a type.

impl<F: Hash> Hash for ByCondition<F>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<F, R> Location<R> for ByCondition<F>

where F: Fn(&str) -> bool, R: Records + ExactRecords + PeekableRecords,

type Coordinate = Position

A coordinate of the finding.

type IntoIter = Vec<Position>

An iterator of the coordinates. If it’s empty it’s considered that nothing is found.

fn locate(&mut self, records: &R) -> Self::IntoIter

Search for the thing in Records, returning a list of coordinates.

impl<F, R> Object<R> for ByCondition<F>

where F: Fn(&str) -> bool, R: Records + ExactRecords + PeekableRecords,

type Iter = IntoIter<Entity>

An Iterator which returns a list of cells.

fn cells(&self, records: &R) -> Self::Iter

Cells returns a set of coordinates of cells.

fn and<O>(self, rhs: O) -> UnionCombination<Self, O, R>

where Self: Sized,

Combines cells. It doesn’t repeat cells.

fn not<O>(self, rhs: O) -> DiffCombination<Self, O, R>

where Self: Sized,

Excludes rhs cells from this cells.

fn intersect<O>(self, rhs: O) -> IntersectionCombination<Self, O, R>

where Self: Sized,

Returns cells which are present in both Objects only.

fn inverse(self) -> InversionCombination<Self, R>

where Self: Sized,

Returns cells which are not present in target Object.

impl<F: Ord> Ord for ByCondition<F>

fn cmp(&self, other: &ByCondition<F>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<F: PartialEq> PartialEq for ByCondition<F>

fn eq(&self, other: &ByCondition<F>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<F: PartialOrd> PartialOrd for ByCondition<F>

fn partial_cmp(&self, other: &ByCondition<F>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<F: Copy> Copy for ByCondition<F>

impl<F: Eq> Eq for ByCondition<F>

impl<F> StructuralPartialEq for ByCondition<F>