Struct DtmfTable 

pub struct DtmfTable;

Zero-sized table wrapper for const and runtime utilities.

Implementations

impl DtmfTable

pub const LOWS: [u16; 4]

Canonical low-/high-band frequencies (Hz).

pub const HIGHS: [u16; 4]

pub const ALL_KEYS: [DtmfKey; 16]

All keys in keypad order (row-major).

pub const ALL_TONES: [DtmfTone; 16]

All tones as (key, low, high). Kept explicit to stay const.

pub const fn new() -> Self

Constructor (zero-sized instance).

pub const fn lookup_key(key: DtmfKey) -> (u16, u16)

Forward: key → (low, high) (const).

pub const fn from_pair_exact(low: u16, high: u16) -> Option<DtmfKey>

Reverse: exact (low, high) → key (const). Order-sensitive.

pub const fn from_pair_normalised(a: u16, b: u16) -> Option<DtmfKey>

Reverse with normalisation (const): accepts (high, low) as well.

pub fn iter_keys(&self) -> Iter<'static, DtmfKey>

Iterate keys in keypad order (no allocation).

pub fn iter_tones(&self) -> Iter<'static, DtmfTone>

Iterate tones (key + freqs) in keypad order (no allocation).

pub fn from_pair_tol_u32( &self, low: u32, high: u32, tol_hz: u32, ) -> Option<DtmfKey>

Reverse lookup with tolerance in Hz (integer inputs). Matches only when both low and high fall within ±tol_hz of a canonical pair.

pub fn from_pair_tol_f64( &self, low: f64, high: f64, tol_hz: f64, ) -> Option<DtmfKey>

Reverse lookup with tolerance for floating-point estimates (e.g., FFT bin centres).

pub fn nearest_u32(&self, low: u32, high: u32) -> (DtmfKey, u16, u16)

Snap an arbitrary (low, high) estimate to the nearest canonical pair and return (key, snapped_low, snapped_high). Uses absolute distance independently on low and high bands.

pub fn nearest_f64(&self, low: f64, high: f64) -> (DtmfKey, u16, u16)

Floating-point variant of nearest snap.

Trait Implementations

impl Default for DtmfTable

fn default() -> Self

Returns the “default value” for a type.

impl Display for DtmfTable

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

Formats the value using the given formatter.