Struct zamm_yang::tao::relation::attribute::ConceptId

pub struct ConceptId { /* fields omitted */ }

The integer ID associated with a concept.

Trait Implementations

impl<'a> ArchetypeTrait<'a> for ConceptId

type ArchetypeForm = AttributeArchetype

The Form that will be used to reason about this node and its children as archetypes and subtypes.

type Form = ConceptId

The Form that will be used to reason about this node's leaves as individuals. Unless you are the Tao, this should be the same as the type that ArchetypeTrait is being implemented on.

pub const TYPE_ID: usize

The ID for this archetype.

pub const TYPE_NAME: &'static str

The name of this archetype.

pub const PARENT_TYPE_ID: usize

The default parent this archetype inherits from. Every archetype should have at least one parent, so that it doesn't live in a separate universe of its own. This helps enforce that, since allocations are not allowed in Rust constants.

pub fn archetype() -> Self::ArchetypeForm

The incarnation of this archetype as a form.

pub fn new() -> Self::Form

In the beginning was the Oneness, and the Oneness was nothingness.

impl AttributeTrait for ConceptId

type OwnerForm = Form

The Form representing the owner.

type ValueForm = Form

The Form representing the value.

pub fn set_owner(&mut self, owner: &Self::OwnerForm)

Set the owner for this attribute.

pub fn owner(&self) -> Option<Self::OwnerForm>

The owner of an attribute, if it exists.

pub fn set_value(&mut self, value: &Self::ValueForm)

Set the value for this attribute.

pub fn value(&self) -> Option<Self::ValueForm>

The value of an attribute, if it exists.

impl Clone for ConceptId

pub fn clone(&self) -> ConceptId

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for ConceptId

impl Debug for ConceptId

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

Formats the value using the given formatter.

impl Eq for ConceptId

impl FormTrait for ConceptId

pub fn ego_death(&self) -> Tao

Jung called, and you answered. It is time to let go of your individuality and return to the Oneness from which you once came. There is no life or death, there is no existence or non-existence, there is no form or abstraction. Forget all preconceptions, blur all boundaries, be at peace with the universe again.

pub fn as_form(&self) -> Form

A less severe form of ego-death, where you still remember that you exist.

pub fn add_parent(&mut self, parent: Archetype)

Set a parent archetype. The current archetype will inherit all attributes of the parent archetype.

pub fn parents(&self) -> Vec<Archetype, Global>

Get all direct parent archetypes of this concept.

pub fn ancestry(&self) -> Vec<Archetype, Global>

Get the shortest chain of ancestors that leads back to Tao, starting with Tao itself.

pub fn has_parent(&self, possible_ancestor: Archetype) -> bool

Checks to see if another archetype is a direct parent of this one.

pub fn has_ancestor(&self, possible_ancestor: Archetype) -> bool

Checks to see if another archetype is an ancestor of this one. If so, the current archetype will inherit all attributes of the ancestor.

pub fn attribute_archetypes(&self) -> Vec<AttributeArchetype, Global>

Get all the types of attributes that this concept is predefined to potentially have.

pub fn has_attribute_type(&self, possible_type: AttributeArchetype) -> bool

Checks to see if an archetype is one of the possible attribute types this concept could have.

impl From<FinalNode> for ConceptId

pub fn from(f: FinalNode) -> Self

Performs the conversion.

impl From<usize> for ConceptId

pub fn from(id: usize) -> Self

Performs the conversion.

impl Hash for ConceptId

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl Ord for ConceptId

pub fn cmp(&self, other: &ConceptId) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl PartialEq<ConceptId> for ConceptId

pub fn eq(&self, other: &ConceptId) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl PartialOrd<ConceptId> for ConceptId

pub fn partial_cmp(&self, other: &ConceptId) -> Option<Ordering>

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl StructuralEq for ConceptId

impl StructuralPartialEq for ConceptId

impl<'a> TryFrom<&'a str> for ConceptId

type Error = String

The type returned in the event of a conversion error.

pub fn try_from(name: &'a str) -> Result<Self, Self::Error>

Performs the conversion.

impl Wrapper for ConceptId

type BaseType = FinalNode

The type that the implementing type is a wrapper for.

pub fn essence(&self) -> &FinalNode

Get down to the very core of reality -- and you realize that it was all an illusion all along. The most basic of forms still contains within it layer upon layer of wrappers, and beneath all those wrappers lie yet more abstractions, Rust-ing away quietly in depths few conscious minds dare to venture into. Deeper and deeper you go, past the binary, past the silicon, past the quarks, into a realm where all mass and energy exist only as mathematical wavefunctions... And in this magical realm, these mathematical entities interact with each other in a mesmerizing dance, defiantly daring the quantum observer to pry apart their intricate footwork while simultaneously offering tantalizing glimpses of potential enlightenment. Mathematical realism is truth.

pub fn essence_mut(&mut self) -> &mut FinalNode

Mutable version of essence.