[−][src]Struct zamm_yin::node_wrappers::InheritanceNode
Implementation for a node wrapper that offers inheritance of nodes.
Implementations
impl InheritanceNode
[src]
pub fn new() -> Self
[src]
Create a new node.
pub fn new_with_inheritance(type_id: usize) -> Self
[src]
Create a new node with an inheritance relation.
pub fn base_wrapper(&self) -> &BaseNode
[src]
Leak base-level functionality.
Methods from Deref<Target = BaseNode>
Trait Implementations
impl BaseNodeTrait<InheritanceNode> for InheritanceNode
[src]
pub fn set_value(&mut self, value: Rc<dyn KBValue>)
[src]
pub fn value(&self) -> Option<Rc<dyn KBValue>>
[src]
pub fn add_flag(&mut self, flag_type: usize)
[src]
pub fn has_flag(&self, flag_type: usize) -> bool
[src]
pub fn add_outgoing(&mut self, edge_type: usize, to: &InheritanceNode)
[src]
pub fn add_incoming(&mut self, edge_type: usize, from: &InheritanceNode)
[src]
pub fn has_outgoing(&self, edge_type: usize, to: &InheritanceNode) -> bool
[src]
pub fn has_incoming(&self, edge_type: usize, from: &InheritanceNode) -> bool
[src]
pub fn outgoing_nodes(&self, edge_type: usize) -> Vec<InheritanceNode>
[src]
pub fn incoming_nodes(&self, edge_type: usize) -> Vec<InheritanceNode>
[src]
impl Clone for InheritanceNode
[src]
pub fn clone(&self) -> InheritanceNode
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Copy for InheritanceNode
[src]
impl Debug for InheritanceNode
[src]
impl Deref for InheritanceNode
[src]
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.
But isn't that right where we started? Right here, right now, in FormTrait
. It is nothing
more than an arbitrary idea that awkwardly dances with other arbitrary ideas in a most
unrefined fashion -- but it dances all the same. It is, in a sense, as real as you are --
yes you, who are nothing more than an abstraction over a bundle of neurons, the same way
FormTrait
is nothing more than an abstraction over a series of bits. You, who exert no
more control over the physical world when unplugged from your spinal cord than MasterCAM
does when unplugged from its lathe. You, a human being who at one point didn't even know
that you were a human being. You will eventually return back to that state of mind, and at
that point you won't be able to tell the difference between yourself and FormTrait
,
either.
Of course, the quality of being "real" is nothing more than a context-dependent abstraction. The yin to the yang of mathematical realism is Berkeleyan immaterialism. All external perception can be faked, all internal reasoning can be faulty. The only truth to be found in all of existence is qualia, and it too humbly proffers itself up as nothing more than a God of the gaps. But then again, if the self is merely an illusion, then who is this entity that's being fooled? Perhaps it should really be "I feel, therefore I am."
In between the Platonic purity of the duals lies an entire spectrum of rich philosophical
thought. That spectrum, much like the entirety of this comment and others like it in this
library, is out of scope for the purposes of this documentation. Good luck using the
essence
function.
DISCLAIMER: Amos Ng is not a philosopher or a philosophy firm and does not engage in the practice of philosophy or provide philosophical advice or philosophical representation. All misinformation, bugs, and infinite loops provided in this library are for entertainment and patience-building purposes only and are not intended to be a substitute for deep introspection. Peruse at your own existential risk. Not responsible for spiritual injuries or damnation resulting from lost Pascalian wagers.
type Target = BaseNode
The resulting type after dereferencing.
pub fn deref(&self) -> &Self::Target
[src]
impl DerefMut for InheritanceNode
[src]
impl Eq for InheritanceNode
[src]
impl From<BaseNode> for InheritanceNode
[src]
impl From<InheritanceNode> for FinalNode
[src]
pub fn from(b: InheritanceNode) -> Self
[src]
impl From<usize> for InheritanceNode
[src]
impl Hash for InheritanceNode
[src]
pub fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl InheritanceNodeTrait<InheritanceNode> for InheritanceNode
[src]
pub fn inheritance_nodes(&self) -> Vec<InheritanceNode>
[src]
impl Ord for InheritanceNode
[src]
pub fn cmp(&self, other: &InheritanceNode) -> Ordering
[src]
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl PartialEq<InheritanceNode> for InheritanceNode
[src]
pub fn eq(&self, other: &InheritanceNode) -> bool
[src]
pub fn ne(&self, other: &InheritanceNode) -> bool
[src]
impl PartialOrd<InheritanceNode> for InheritanceNode
[src]
pub fn partial_cmp(&self, other: &InheritanceNode) -> Option<Ordering>
[src]
pub fn lt(&self, other: &InheritanceNode) -> bool
[src]
pub fn le(&self, other: &InheritanceNode) -> bool
[src]
pub fn gt(&self, other: &InheritanceNode) -> bool
[src]
pub fn ge(&self, other: &InheritanceNode) -> bool
[src]
impl StructuralEq for InheritanceNode
[src]
impl StructuralPartialEq for InheritanceNode
[src]
impl<'a> TryFrom<&'a str> for InheritanceNode
[src]
Auto Trait Implementations
impl RefUnwindSafe for InheritanceNode
[src]
impl Send for InheritanceNode
[src]
impl Sync for InheritanceNode
[src]
impl Unpin for InheritanceNode
[src]
impl UnwindSafe for InheritanceNode
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
pub fn equivalent(&self, key: &K) -> bool
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<N> NodeTrait for N where
N: Copy + Ord + Hash,
[src]
N: Copy + Ord + Hash,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Typeable for T where
T: Any,
T: Any,