Struct libbgs::numbers::FactorTrie

pub struct FactorTrie<S, const L: usize, C, T> {
    pub data: T,
    /* private fields */
}

A trie of prime factors in increasing order; that is, a none with word $p$ will have only children with word $q \geq p$.

Fields

data: T

Data associated with the key given by the concatenation of this node’s ancestors’ words.

Implementations

impl<S, const L: usize, C> FactorTrie<S, L, C, ()>where C: Factor<S>,

pub fn new() -> FactorTrie<S, L, C, ()>

Creates a new trie associated to the given factorization. The trie contains the divisors of C::FACTORS. The words of a divisor are its prime factors, with multiplicities, in ascending order.

impl<S, const L: usize, C, T> FactorTrie<S, L, C, T>where C: Factor<S>,

pub fn new_with<F>(f: F) -> FactorTrie<S, L, C, T>where F: Fn(&[usize; L], usize) -> T,

Creates a new trie associated to the given factorization. The trie contains the divisors of C::FACTORS. The words of a divisor are its prime factors, with multiplicities, in ascending order. The trie is seeded with data generated by f.

impl<S, const L: usize, C, T> FactorTrie<S, L, C, T>

pub fn get_or_new_child<F>( &mut self, i: usize, data: F ) -> &mut FactorTrie<S, L, C, T>where F: FnOnce() -> T,

Returns this node’s child at index i, or creates the child, initialized with the result of the lazily-evaluated data.

pub fn update<F>(&mut self, t: &[usize; L], gen: F)where F: Fn(&[usize; L], &mut T),

Updates a single node in the trie.

pub fn map<U, F>(self, f: &F) -> FactorTrie<S, L, C, U>where F: Fn(T, &[usize; L], usize) -> U,

Transforms this trie into an equivalent trie with the same shape, but all data mapped via f.

pub fn as_ref(&self) -> FactorTrie<S, L, C, &T>

Returns a trie of borrowed data.

pub fn as_mut(&mut self) -> FactorTrie<S, L, C, &mut T>

Returns a trie of mutably borrowed data.

pub fn for_each<F>(&self, f: &mut F)where F: FnMut(&T, [usize; L]),

Runs f on each node, in a pre-order traversal.

pub fn index(&self) -> usize

The index of this node’s word in the prime factorization array.

pub fn ds(&self) -> &[usize; L]

The array of powers on this node’s prime factoraziton.

pub fn children(&self) -> &[Option<Box<FactorTrie<S, L, C, T>>>]

This node’s array of children.

pub fn child(&self, i: usize) -> Option<&FactorTrie<S, L, C, T>>

Returns a reference to the child at index i, if there is one.

pub fn child_mut(&mut self, i: usize) -> Option<&mut FactorTrie<S, L, C, T>>

Returns a mutable reference to the child at index i, if there is one.

Trait Implementations

impl<S, const L: usize, C, T: Clone> Clone for FactorTrie<S, L, C, T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.