Struct Scope 

pub struct Scope(pub BTreeSet<MoveId>);

What something is about: some moves and whatever hangs under them.

Roots and not a free set, which is what makes it affordable. The whole encoder branch is a root, this step is a root, the whole investigation is none. An arbitrary set would be truer and would turn do they overlap? into something to materialise rather than walk.

Tuple Fields

0: BTreeSet<MoveId>

Implementations

impl Scope

pub fn everything() -> Self

About everything. What makes a general question general.

pub fn of(roots: impl IntoIterator<Item = MoveId>) -> Self

pub fn is_everything(&self) -> bool

pub fn covers(&self, under: &Undernath) -> HashSet<MoveId>

The moves it covers: its roots and everything hanging under them.

pub fn touches(&self, other: &Self, under: &Undernath) -> bool

Whether two scopes touch. What separates a contradiction from two facts about two different situations.

Trait Implementations

impl Clone for Scope

fn clone(&self) -> Scope

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Scope

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

Formats the value using the given formatter.

impl Default for Scope

fn default() -> Scope

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Scope

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Scope

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Scope

impl StructuralPartialEq for Scope