pub trait Vecu8 {
// Required methods
fn pdfu8(self) -> Vec<f64>;
fn entropyu8(self) -> f64;
fn jointpdfu8(self, v: &[u8]) -> Result<Vec<Vec<u32>>, RE>;
fn jointentropyu8(self, v: &[u8]) -> Result<f64, RE>;
fn dependenceu8(self, v: &[u8]) -> Result<f64, RE>;
fn independenceu8(self, v: &[u8]) -> Result<f64, RE>;
}
Expand description
Methods specialised to and more efficient, for &[u8]
Required Methods§
sourcefn jointpdfu8(self, v: &[u8]) -> Result<Vec<Vec<u32>>, RE>
fn jointpdfu8(self, v: &[u8]) -> Result<Vec<Vec<u32>>, RE>
Joint probability density function (here just co-occurence counts) of paired values in two vectors of bytes of the same length. Needs n^2 x 32bits of memory.
Implementations on Foreign Types§
source§impl Vecu8 for &[u8]
impl Vecu8 for &[u8]
source§fn jointpdfu8(self, v: &[u8]) -> Result<Vec<Vec<u32>>, RE>
fn jointpdfu8(self, v: &[u8]) -> Result<Vec<Vec<u32>>, RE>
Joint probability density function (here just co-occurence counts) of successive pairs of values from two vectors of bytes of the same lenghts n. Needs 4*256^2=262144 bytes of heap memory, which will be sparse except for long input vectors.