Struct ScottOpen 

pub struct ScottOpen {
    pub domain_size: usize,
    pub elements: Vec<usize>,
}

A Scott-open set on a finite flat domain {bottom=0, 1, …, domain_size-1}.

Fields

domain_size: usize

Total domain size (bottom at index 0).

elements: Vec<usize>

Elements in the open set (sorted, all > 0).

Implementations

impl ScottOpen

pub fn new(domain_size: usize, elems: impl IntoIterator<Item = usize>) -> Self

Create a Scott-open set (bottom is automatically excluded).

pub fn top(domain_size: usize) -> Self

The whole domain minus bottom is Scott-open.

pub fn empty(domain_size: usize) -> Self

The empty set is Scott-open.

pub fn contains(&self, x: usize) -> bool

Test membership.

pub fn union(&self, other: &Self) -> Self

Union (stays Scott-open).

pub fn intersection(&self, other: &Self) -> Self

Intersection (stays Scott-open).

pub fn is_scott_open(&self) -> bool

Verify Scott-openness: bottom must not be in the set.

pub fn characteristic(&self, x: usize) -> bool

Characteristic membership function.

Trait Implementations

impl Clone for ScottOpen

fn clone(&self) -> ScottOpen

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ScottOpen

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

Formats the value using the given formatter.

impl PartialEq for ScottOpen

fn eq(&self, other: &ScottOpen) -> 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 Eq for ScottOpen

impl StructuralPartialEq for ScottOpen