Struct AlgaeSet 

pub struct AlgaeSet<E> { /* private fields */ }

A representation of a ZF set.

All elements must belong to a “supertype” E. Subsets of the supertype are determined by a given set of conditions (similar to the conditions used in the set construction paradigm of traditional ZF set theory).

Element existence (ie. whether or not a certain element is a member of a given set) is given through the has function. Set unions are given by the or function, and set intersections are given by the and function.

Examples

use algae_rs::algaeset::AlgaeSet;

let mut pos_floats = AlgaeSet::new(vec![
    Box::new(|e: f32| e > 0_f32)
]);

assert!(pos_floats.has(12_f32));

let neg_floats = AlgaeSet::new(vec![
    Box::new(|e: f32| e < 0_f32)
]);

pos_floats.or(neg_floats);
let all_floats = pos_floats;
assert!(all_floats.has(12_f32));
assert!(all_floats.has(-12_f32));

Implementations

impl<E> AlgaeSet<E>

pub fn new(pos_conditions: Vec<Box<dyn Fn(E) -> bool>>) -> Self

Returns an AlgaeSet defined by a Vec of conditions

pub fn mono(condition: Box<dyn Fn(E) -> bool>) -> Self

Returns an AlgaeSet defined by a single condition

pub fn all() -> Self

Returns an AlgaeSet containing all members of the type E

impl<E: Copy + Clone> AlgaeSet<E>

pub fn has(&self, element: E) -> bool

Returns whether or not element is in the given set

impl<E: PartialEq + Copy + Clone + 'static> AlgaeSet<E>

pub fn add(&mut self, element: E)

Adds element to the given set

pub fn remove(&mut self, element: E)

Removes element from the given set

pub fn or(&mut self, other: Self)

Adds all elements from other to self

pub fn and(&mut self, other: Self)

Removes all elements from self that aren’t in other