adic 0.5.1

Arithmetic and rootfinding for p-adic numbers
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

#![allow(dead_code)]

use std::rc::Rc;
use itertools::Itertools;
use super::Sequence;


#[derive(Clone)]
/// Enum for the possible bounding behaviors
pub (crate) enum BoundingBehavior<'t, T>
where T: 't {
    Bounded(Rc<dyn Sequence<Term=T> + 't>,),
    Unbounded,
    Unknown,
}


impl<T> std::fmt::Debug for BoundingBehavior<'_, T>
where T: std::fmt::Debug {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            BoundingBehavior::Bounded(s) => {
                let term_str = match s.approx_num_terms() {
                    Some(n) if n <= 5 => s.terms()
                        .enumerate()
                        .map(|(idx, t)| format!("{t:?} * k_{idx}"))
                        .join(" + "),
                    _ => s.terms()
                        .enumerate()
                        .take(5)
                        .map(|(idx, t)| format!("{t:?} * k_{idx}"))
                        .chain(std::iter::once("...".to_string()))
                        .join(" + "),
                };
                write!(f, "Bounded({term_str}")
            },
            BoundingBehavior::Unbounded => write!(f, "Unbounded"),
            BoundingBehavior::Unknown => write!(f, "Unknown"),
        }
    }
}