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
//! Core Chebyshev primitives.
//!
//! # Theory
//!
//! Every approximation in `cheby` is a finite Chebyshev expansion
//! `f(x) ≈ Σ aₖ Tₖ(τ)` over a normalised parameter `τ ∈ [-1, 1]`.
//! [`Domain`] handles the affine map between user coordinates and `τ`,
//! [`nodes`] returns Chebyshev abscissae (`Gauss` or `GaussLobatto`),
//! [`evaluate`] uses Clenshaw's recurrence, and [`ChebySeries`] /
//! [`ChebySeriesOn`] hold coefficients with optional unit safety via
//! [`ChebyScalar`].
//!
//! # Features
//!
//! Always available; `no_std` and allocation-free. Enable `alloc` for
//! the dynamic [`ChebySeriesDyn`] type.
//!
//! # Performance
//!
//! All hot paths are `const`-generic on the polynomial degree. Evaluation
//! is `O(N)` per query with no heap traffic; node generation is `O(N)`.
pub use Domain;
pub use ChebyError;
pub use ;
pub use ;
pub use ;
pub use ;
pub use ;