Skip to main content

InvLink

Struct InvLink 

Source
pub struct InvLink { /* private fields */ }

Implementations§

Source

pub fn new<I>(inner: Link, e_map: I) -> InvLink
where I: IntoIterator<Item = (Edge, Edge)>,

Source

pub fn from_symmetric_pd_code<I1>(pd_code: I1) -> Self
where I1: IntoIterator<Item = PDCodeX>,

Source

pub fn si_knot_from(inner: Link) -> InvLink

Source

pub fn inner(&self) -> &Link

Source

pub fn pd_code(&self) -> Vec<PDCodeX>

The symmetric PD code — the inner diagram’s PD, with edges numbered so the strong inversion is the standard e ↦ (n+1-e)%n+1. Feeding this to from_symmetric_pd_code (or the ykh CLI) reconstructs the same InvLink. The builders (from_symmetric_pd_code, conn_sum, whitehead_double) already reindex to this involution, so an arbitrary e_map is rejected.

Source

pub fn is_empty(&self) -> bool

Source

pub fn is_knot(&self) -> bool

Source

pub fn is_oriented(&self) -> bool

Source

pub fn writhe(&self) -> i32

Source

pub fn n_nodes(&self) -> usize

Source

pub fn nodes(&self) -> impl Iterator<Item = &Node>

Source

pub fn node(&self, i: usize) -> &Node

Source

pub fn crossings(&self) -> impl Iterator<Item = &Node>

Source

pub fn n_crossings(&self) -> usize

Source

pub fn n_signed_crossings(&self) -> (usize, usize)

Source

pub fn n_edges(&self) -> usize

Source

pub fn edges(&self) -> Vec<Edge>

Source

pub fn n_comps(&self) -> usize

Source

pub fn comps(&self) -> Vec<Path>

Source

pub fn seifert_state(&self) -> State

Source

pub fn seifert_circles(&self) -> Vec<Path>

Source

pub fn base_pt(&self) -> Option<Edge>

Source

pub fn with_base_pt(self, e: Edge) -> Self

Source

pub fn inv_edge(&self, e: Edge) -> Edge

Source

pub fn inv_node(&self, x: &Node) -> &Node

Source

pub fn is_on_axis(&self, e: Edge) -> bool

Source

pub fn on_axis_edges(&self) -> Vec<Edge>

Source

pub fn is_transvergent(&self) -> bool

Source

pub fn is_strongly_invertible(&self) -> bool

Source

pub fn is_2periodic(&self) -> bool

Source

pub fn mirror(&self) -> Self

Source

pub fn reversed(&self) -> Self

Source

pub fn conn_sum(&self, other: &InvLink) -> InvLink

Source

pub fn conn_sum_at( &self, other: &InvLink, self_e: Edge, other_e: Edge, ) -> InvLink

Source

pub fn load(name: &str) -> Result<InvLink, Box<dyn Error>>

Source

pub fn sym_pretzel(a: i32, b: i32, c: i32) -> InvLink

The 3-pretzel P(a, b, a) with its strong inversion (the π-rotation through the middle band), reindexed to the standard involution. Standard convention: all-odd 3-pretzel bands are anti-parallel, so a positive (right-handed) half-twist is a NEGATIVE crossing — writhe(P(a, b, a)) = -(2a + b).

Source

pub fn whitehead_double(l: &InvLink, positive: bool, tw: i32) -> InvLink

Source

pub fn whitehead_double_at( l: &InvLink, positive: bool, tw: i32, cut: Edge, ) -> InvLink

Trait Implementations§

Source§

fn clone(&self) -> InvLink

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneAnd for T
where T: Clone,

Source§

fn clone_and<F>(&self, f: F) -> Self
where F: FnOnce(&mut Self),

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.