Struct Cards 

pub struct Cards { /* private fields */ }

The ordered card table: value -> word, in descending key order.

Python uses an OrderedDict whose insertion order (high, then mid, then low) happens to be descending. splitnum iterates it in that order, so a sorted Vec reproduces the semantics while allowing binary search.

Implementations

impl Cards

pub fn new() -> Self

pub fn insert(&mut self, key: BigInt, word: impl Into<String>)

pub fn get(&self, key: &BigInt) -> Option<&str>

pub fn iter(&self) -> impl Iterator<Item = &(BigInt, String)>

Descending iteration, matching the Python insertion order.

pub fn iter_from( &self, value: &BigInt, ) -> impl Iterator<Item = &(BigInt, String)>

Entries from the first card <= value, descending.

Python does for elem in self.cards: if elem > value: continue, an O(n) scan that costs ~100 BigInt comparisons to reach “forty” from 10^303. Entries are sorted descending, so the first card <= value is a binary-search partition point — identical result, O(log n).

pub fn highest(&self) -> Option<&BigInt>

pub fn is_empty(&self) -> bool

Trait Implementations

impl Clone for Cards

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Cards

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

Formats the value using the given formatter.

impl Default for Cards

fn default() -> Self

Returns the “default value” for a type.