malachite-base 0.14.0

A collection of utilities, including new arithmetic traits and iterators that generate all values of a type.
Documentation 
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
40
41
42
43
44
45
46
47
48
49

// Copyright © 2026 Mikhail Hogrefe
//
// This file is part of Malachite.
//
// Malachite is free software: you can redistribute it and/or modify it under the terms of the GNU
// Lesser General Public License (LGPL) as published by the Free Software Foundation; either version
// 3 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>.

use crate::num::basic::unsigneds::PrimitiveUnsigned;
use crate::num::logic::traits::SignificantBits;
use crate::unsigned_vector::UnsignedVector;

impl<T: PrimitiveUnsigned> SignificantBits for &UnsignedVector<T> {
    /// Returns the sum of the numbers of significant bits of the elements of an [`UnsignedVector`].
    ///
    /// This is the number of bits needed to store all of the elements, and 0 for the 0-dimensional
    /// vector.
    ///
    /// # Worst-case complexity
    /// $T(n) = O(n)$
    ///
    /// $M(n) = O(1)$
    ///
    /// where $T$ is time, $M$ is additional memory, and $n$ is `self.dimension()`.
    ///
    /// # Examples
    /// ```
    /// use core::str::FromStr;
    /// use malachite_base::num::logic::traits::SignificantBits;
    /// use malachite_base::unsigned_vector::UnsignedVector;
    ///
    /// assert_eq!(
    ///     UnsignedVector::<u8>::from_str("(1, 5, 2)")
    ///         .unwrap()
    ///         .significant_bits(),
    ///     6
    /// );
    /// assert_eq!(
    ///     UnsignedVector::<u8>::from_str("()")
    ///         .unwrap()
    ///         .significant_bits(),
    ///     0
    /// );
    /// ```
    #[inline]
    fn significant_bits(self) -> u64 {
        self.elements.iter().map(|&x| x.significant_bits()).sum()
    }
}