Struct Link 

pub struct Link { /* private fields */ }

Implementations

impl Link

pub const MAX_CROSSING: usize = State::MAX_LEN

The maximum number of crossings a Link can carry, bounded by the State width (64 by default, 128 under the big-link feature).

pub fn new( nodes: impl IntoIterator<Item = Node>, loops: impl IntoIterator<Item = Edge>, ) -> Self

pub fn from_nodes(nodes: impl IntoIterator<Item = Node>) -> Self

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

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

pub fn empty() -> Link

pub fn is_empty(&self) -> bool

pub fn unknot() -> Link

pub fn unlink(n: usize) -> Link

pub fn is_knot(&self) -> bool

pub fn is_oriented(&self) -> bool

pub fn verify_ori(&self)

pub fn writhe(&self) -> i32

pub fn n_nodes(&self) -> usize

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

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

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

pub fn n_crossings(&self) -> usize

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

pub fn loops(&self) -> &[Edge]

pub fn n_loops(&self) -> usize

pub fn n_edges(&self) -> usize

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

pub fn n_comps(&self) -> usize

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

pub fn traverse_comps<F>(&self, f: F)

where F: FnMut(usize, usize, Slot),

pub fn traverse_from<F>(&self, start: (usize, Slot), f: F)

where F: FnMut(usize, Slot),

pub fn unoriented(&self) -> Self

pub fn reindexed(&self, start_edge: Edge, base: Edge) -> Link

pub fn reindexed_canon(&self) -> Link

impl Link

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

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

pub fn mirror(&self) -> Self

pub fn reversed(&self) -> Self

pub fn cc_at(&self, i: usize) -> Self

pub fn resolve_at(&self, i: usize, r: Bit) -> Self

pub fn resolve_by(&self, s: &State) -> Self

pub fn seifert_state(&self) -> State

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

pub fn seifert_graph(&self) -> Graph<Path, usize>

impl Link

pub fn from_pd_code<I>(pd_code: I) -> Self

where I: IntoIterator<Item = PDCodeX>,

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

The KnotAtlas PD code — one X[i,j,k,l] per crossing, CCW from the incoming under-strand i. Built by traversing the components and emitting each crossing at its under-pass, so i is the under-strand’s incoming edge; round-trips through from_pd_code. Resolved (V/H) nodes are skipped. Panics on free loops, which a PD code has no way to express.

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

impl Link

pub fn twist_knot(n: i32) -> Link

pub fn pretzel(a: i32, b: i32, c: i32) -> Link

pub fn cable2(l: &Link) -> Link

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

pub fn whitehead_double_bbf(l: &Link, positive: bool, tw: i32) -> Link

Trait Implementations

impl Clone for Link

fn clone(&self) -> Link

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Link

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

Formats the value using the given formatter.

impl Display for Link

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

Formats the value using the given formatter.

impl Eq for Link

impl PartialEq for Link

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Link