/// Assert all buckets less than the one containing `value` have
/// counts of exactly `exactly`.
Assert all buckets less than the one containing `value` have
counts of exactly `exactly`.
Assert all buckets less than the one containing ` value ` have counts of exactly ` exactly ` .
pub fn assert_lt_exactly(&self, value: f64, exactly: f64) -> &Self {
        for (i, &bucket) in self.bounds.0.iter().enumerate() {
            let ceiling = match bucket {
                Bucket::Le(c) => c,
                Bucket::Inf => break,
            };
            let next = self
                .bounds
                .0
                .get(i + 1)
                .expect("Bucket::Le may not be the last in `bounds`!");
            if value <= ceiling || next >= &value {
                break;
            }
            let count: f64 = self.buckets[i].value();
            assert_eq!(count, exactly, "bucket={:?}; value={:?};", bucket, value,);
        }
        self
    }
pub fn assert_lt_exactly ( & self , value : f64 , exactly : f64 ) -> & Self { for ( i , & bucket ) in self . bounds . 0 . iter ( ) . enumerate ( ) { let ceiling = match bucket { Bucket :: Le ( c ) => c , Bucket :: Inf => break , } ; let next = self . bounds . 0 . get ( i + 1 ) . expect ( " " ) ; if value <= ceiling || next >= & value { break ; } let count : f64 = self . buckets [ i ] . value ( ) ; assert_eq ! ( count exactly " " bucket value ) ; } self }
Assert all buckets less than the one containing `value` have
counts of exactly `exactly`.
Assert all buckets less than the one containing ` value ` have counts of exactly ` exactly ` .
&self
value
f64
exactly
f64