Struct bio::stats::probs::LogProb

source ·
pub struct LogProb(pub f64);
Expand description

A newtype for log-scale probabilities. For performance reasons, we use an approximation of the exp method implemented in bio::utils::FastExp. This can lead to slight errors, but should not matter given that most of the probability differences are reflected within the integer part of the log probability.

Example

#[macro_use]
extern crate approx;
use bio::stats::{LogProb, Prob};

// convert from probability
let p = LogProb::from(Prob(0.5));
// convert manually
let q = LogProb(0.2f64.ln());
// obtain zero probability in log-space
let o = LogProb::ln_one();

assert_relative_eq!(*Prob::from(p.ln_add_exp(q) + o), *Prob(0.7), epsilon=0.000001);

Tuple Fields§

§0: f64

Implementations§

source§

impl LogProb

source

pub fn is_valid(&self) -> bool

source

pub fn ln_zero() -> LogProb

Log-space representation of Pr=0

source

pub fn ln_one() -> LogProb

Log-space representation of Pr=1

source

pub fn cap_numerical_overshoot(&self, epsilon: f64) -> LogProb

sums of LogProbs, e.g. with ln_sum_exp() can end up slightly above the maximum of LogProb <= 0 due to numerical imprecisions – this function can rescue such values before panics due to asserts in other functions handling LogProbs, e.g. ln_1m_exp

source

pub fn ln_one_minus_exp(&self) -> LogProb

Numerically stable calculation of 1 - p in log-space.

source

pub fn ln_sum_exp(probs: &[LogProb]) -> LogProb

Numerically stable sum of probabilities in log-space.

source

pub fn ln_add_exp(self, other: LogProb) -> LogProb

Numerically stable addition of probabilities in log-space.

source

pub fn ln_sub_exp(self, other: LogProb) -> LogProb

Numerically stable subtraction of probabilities in log-space.

source

pub fn ln_cumsum_exp<I: IntoIterator<Item = LogProb>>(probs: I) -> ScanIter<I>

Calculate the cumulative sum of the given probabilities in a numerically stable way (Durbin 1998).

source

pub fn ln_trapezoidal_integrate_exp<T, D>( density: D, a: T, b: T, n: usize ) -> LogProbwhere T: Copy + Add<Output = T> + Sub<Output = T> + Div<Output = T> + Mul<Output = T> + Float, D: FnMut(usize, T) -> LogProb, f64: From<T>,

Integrate numerically stable over given log-space density in the interval [a, b]. Uses the trapezoidal rule with n grid points.

source

pub fn ln_simpsons_integrate_exp<T, D>( density: D, a: T, b: T, n: usize ) -> LogProbwhere T: Copy + Add<Output = T> + Sub<Output = T> + Div<Output = T> + Mul<Output = T> + Float, D: FnMut(usize, T) -> LogProb, f64: From<T>,

Integrate numerically stable over given log-space density in the interval [a, b]. Uses Simpson’s rule with n (odd) grid points.

source

pub fn ln_trapezoidal_integrate_grid_exp<T, D>( density: D, grid: &[T] ) -> LogProbwhere T: Copy + Add<Output = T> + Sub<Output = T> + Div<Output = T> + Mul<Output = T> + Float, D: FnMut(usize, T) -> LogProb, f64: From<T>,

Integrate numerically stable over given log-space density and grid points. Uses the trapezoidal rule.

Methods from Deref<Target = f64>§

1.43.0 · source

pub const RADIX: u32 = 2u32

1.43.0 · source

pub const MANTISSA_DIGITS: u32 = 53u32

1.43.0 · source

pub const DIGITS: u32 = 15u32

1.43.0 · source

pub const EPSILON: f64 = 2.2204460492503131E-16f64

1.43.0 · source

pub const MIN: f64 = -1.7976931348623157E+308f64

1.43.0 · source

pub const MIN_POSITIVE: f64 = 2.2250738585072014E-308f64

1.43.0 · source

pub const MAX: f64 = 1.7976931348623157E+308f64

1.43.0 · source

pub const MIN_EXP: i32 = -1_021i32

1.43.0 · source

pub const MAX_EXP: i32 = 1_024i32

1.43.0 · source

pub const MIN_10_EXP: i32 = -307i32

1.43.0 · source

pub const MAX_10_EXP: i32 = 308i32

1.43.0 · source

pub const NAN: f64 = NaNf64

1.43.0 · source

pub const INFINITY: f64 = +Inff64

1.43.0 · source

pub const NEG_INFINITY: f64 = -Inff64

1.62.0 · source

pub fn total_cmp(&self, other: &f64) -> Ordering

Return the ordering between self and other.

Unlike the standard partial comparison between floating point numbers, this comparison always produces an ordering in accordance to the totalOrder predicate as defined in the IEEE 754 (2008 revision) floating point standard. The values are ordered in the following sequence:

  • negative quiet NaN
  • negative signaling NaN
  • negative infinity
  • negative numbers
  • negative subnormal numbers
  • negative zero
  • positive zero
  • positive subnormal numbers
  • positive numbers
  • positive infinity
  • positive signaling NaN
  • positive quiet NaN.

The ordering established by this function does not always agree with the PartialOrd and PartialEq implementations of f64. For example, they consider negative and positive zero equal, while total_cmp doesn’t.

The interpretation of the signaling NaN bit follows the definition in the IEEE 754 standard, which may not match the interpretation by some of the older, non-conformant (e.g. MIPS) hardware implementations.

Example
struct GoodBoy {
    name: String,
    weight: f64,
}

let mut bois = vec![
    GoodBoy { name: "Pucci".to_owned(), weight: 0.1 },
    GoodBoy { name: "Woofer".to_owned(), weight: 99.0 },
    GoodBoy { name: "Yapper".to_owned(), weight: 10.0 },
    GoodBoy { name: "Chonk".to_owned(), weight: f64::INFINITY },
    GoodBoy { name: "Abs. Unit".to_owned(), weight: f64::NAN },
    GoodBoy { name: "Floaty".to_owned(), weight: -5.0 },
];

bois.sort_by(|a, b| a.weight.total_cmp(&b.weight));

Trait Implementations§

source§

impl<'a> Add<&'a LogProb> for &'a LogProb

§

type Output = LogProb

The resulting type after applying the + operator.
source§

fn add(self, rhs: Self) -> LogProb

Performs the + operation. Read more
source§

impl<'a> Add<&'a LogProb> for LogProb

§

type Output = LogProb

The resulting type after applying the + operator.
source§

fn add(self, rhs: &'a LogProb) -> LogProb

Performs the + operation. Read more
source§

impl<'a> Add<LogProb> for &'a LogProb

§

type Output = LogProb

The resulting type after applying the + operator.
source§

fn add(self, rhs: LogProb) -> LogProb

Performs the + operation. Read more
source§

impl Add<LogProb> for LogProb

§

type Output = LogProb

The resulting type after applying the + operator.
source§

fn add(self, rhs: Self) -> LogProb

Performs the + operation. Read more
source§

impl AddAssign<LogProb> for LogProb

source§

fn add_assign(&mut self, other: LogProb)

Performs the += operation. Read more
source§

impl Clone for LogProb

source§

fn clone(&self) -> LogProb

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for LogProb

source§

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

Formats the value using the given formatter. Read more
source§

impl Default for LogProb

source§

fn default() -> LogProb

Returns the “default value” for a type. Read more
source§

impl Deref for LogProb

§

type Target = f64

The resulting type after dereferencing.
source§

fn deref(&self) -> &Self::Target

Dereferences the value.
source§

impl<'de> Deserialize<'de> for LogProb

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl From<LogProb> for PHREDProb

source§

fn from(p: LogProb) -> PHREDProb

Converts to this type from the input type.
source§

impl From<LogProb> for Prob

source§

fn from(p: LogProb) -> Prob

Converts to this type from the input type.
source§

impl From<LogProb> for f64

source§

fn from(v: LogProb) -> Self

Converts to this type from the input type.
source§

impl From<NotNan<f64>> for LogProb

source§

fn from(p: NotNan<f64>) -> LogProb

Converts to this type from the input type.
source§

impl From<PHREDProb> for LogProb

source§

fn from(p: PHREDProb) -> LogProb

Converts to this type from the input type.
source§

impl From<Prob> for LogProb

source§

fn from(p: Prob) -> LogProb

Converts to this type from the input type.
source§

impl From<f64> for LogProb

source§

fn from(v: f64) -> Self

Converts to this type from the input type.
source§

impl PartialEq<LogProb> for LogProb

source§

fn eq(&self, other: &LogProb) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl PartialOrd<LogProb> for LogProb

source§

fn partial_cmp(&self, other: &LogProb) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl Serialize for LogProb

source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl<'a> Sub<&'a LogProb> for &'a LogProb

§

type Output = LogProb

The resulting type after applying the - operator.
source§

fn sub(self, rhs: Self) -> LogProb

Performs the - operation. Read more
source§

impl<'a> Sub<&'a LogProb> for LogProb

§

type Output = LogProb

The resulting type after applying the - operator.
source§

fn sub(self, rhs: &'a LogProb) -> LogProb

Performs the - operation. Read more
source§

impl<'a> Sub<LogProb> for &'a LogProb

§

type Output = LogProb

The resulting type after applying the - operator.
source§

fn sub(self, rhs: LogProb) -> LogProb

Performs the - operation. Read more
source§

impl Sub<LogProb> for LogProb

§

type Output = LogProb

The resulting type after applying the - operator.
source§

fn sub(self, rhs: Self) -> LogProb

Performs the - operation. Read more
source§

impl SubAssign<LogProb> for LogProb

source§

fn sub_assign(&mut self, other: LogProb)

Performs the -= operation. Read more
source§

impl<'a> Sum<&'a LogProb> for LogProb

source§

fn sum<I: Iterator<Item = &'a LogProb>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by “summing up” the items.
source§

impl Sum<LogProb> for LogProb

source§

fn sum<I: Iterator<Item = LogProb>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by “summing up” the items.
source§

impl TryFrom<LogProb> for NotNan<f64>

§

type Error = FloatIsNan

The type returned in the event of a conversion error.
source§

fn try_from(p: LogProb) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl Zero for LogProb

source§

fn zero() -> Self

Returns the additive identity element of Self, 0. Read more
source§

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.
source§

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.
source§

impl Copy for LogProb

source§

impl StructuralPartialEq for LogProb

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T, Right> ClosedAdd<Right> for Twhere T: Add<Right, Output = T> + AddAssign<Right>,

§

impl<T, Right> ClosedSub<Right> for Twhere T: Sub<Right, Output = T> + SubAssign<Right>,

source§

impl<T> DeserializeOwned for Twhere T: for<'de> Deserialize<'de>,

source§

impl<M> Measure for Mwhere M: Debug + PartialOrd<M> + Add<M, Output = M> + Default + Clone,

source§

impl<T> Scalar for Twhere T: 'static + Clone + PartialEq<T> + Debug,