Struct bio::stats::probs::Prob [−][src]
pub struct Prob(pub f64);
A newtype for probabilities.
Example
#[macro_use] extern crate approx; use bio::stats::Prob; let p = Prob(0.5); let q = Prob(0.2); assert_relative_eq!(*(p + q), *Prob(0.7));
Implementations
Methods from Deref<Target = f64>
pub const RADIX: u32
1.43.0[src]
pub const MANTISSA_DIGITS: u32
1.43.0[src]
pub const DIGITS: u32
1.43.0[src]
pub const EPSILON: f64
1.43.0[src]
pub const MIN: f64
1.43.0[src]
pub const MIN_POSITIVE: f64
1.43.0[src]
pub const MAX: f64
1.43.0[src]
pub const MIN_EXP: i32
1.43.0[src]
pub const MAX_EXP: i32
1.43.0[src]
pub const MIN_10_EXP: i32
1.43.0[src]
pub const MAX_10_EXP: i32
1.43.0[src]
pub const NAN: f64
1.43.0[src]
pub const INFINITY: f64
1.43.0[src]
pub const NEG_INFINITY: f64
1.43.0[src]
pub fn as_ne_bytes(&self) -> &[u8; 8]
[src]
🔬 This is a nightly-only experimental API. (
num_as_ne_bytes
)Return the memory representation of this floating point number as a byte array in native byte order.
to_ne_bytes
should be preferred over this whenever possible.
Examples
#![feature(num_as_ne_bytes)] let num = 12.5f64; let bytes = num.as_ne_bytes(); assert_eq!( bytes, if cfg!(target_endian = "big") { &[0x40, 0x29, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00] } else { &[0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x29, 0x40] } );
pub fn total_cmp(&self, other: &f64) -> Ordering
[src]
🔬 This is a nightly-only experimental API. (
total_cmp
)Returns an ordering between self and other values. Unlike the standard partial comparison between floating point numbers, this comparison always produces an ordering in accordance to the totalOrder predicate as defined in IEEE 754 (2008 revision) floating point standard. The values are ordered in following order:
- 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
Note that this function does not always agree with the PartialOrd
and PartialEq
implementations of f64
. In particular, they regard
negative and positive zero as equal, while total_cmp
doesn’t.
Example
#![feature(total_cmp)] 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
impl<'de> Deserialize<'de> for Prob
[src]
impl<'de> Deserialize<'de> for Prob
[src]fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
impl PartialOrd<Prob> for Prob
[src]
impl PartialOrd<Prob> for Prob
[src]impl StructuralPartialEq for Prob
[src]
impl StructuralPartialEq for Prob
[src]Auto Trait Implementations
impl RefUnwindSafe for Prob
impl RefUnwindSafe for Prob
impl UnwindSafe for Prob
impl UnwindSafe for Prob
Blanket Implementations
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn is_in_subset(&self) -> bool
pub unsafe fn to_subset_unchecked(&self) -> SS
pub fn from_subset(element: &SS) -> SP
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,