Struct Precision10

pub struct Precision10;

Trait Implementations

impl Clone for Precision10

fn clone(&self) -> Precision10

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Precision10

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

Formats the value using the given formatter.

impl Default for Precision10

fn default() -> Precision10

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Precision10

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for Precision10

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Precision10

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Precision for Precision10

const EXPONENT: usize = 10usize

The exponent of the number of registers, meaning the number of registers that will be used is 2^EXPONENT. This is the p parameter in the HyperLogLog.

const SMALL_CORRECTIONS: Self::SmallCorrections

The precomputed small corrections used in the HyperLogLog algorithm for better performance.

type NumberOfZeros = u16

The data type to use for the number of zeros registers counter. This should be the smallest possinle data type that allows us to count all the registers without overflowing. We can tollerate a one-off error when counting the number of zeros, as it will be corrected when computing the cardinality as it is known before hand whether this can happen at all.

type SmallCorrections = [f32; 1024]

Type for small corrections:

type Registers = [u32; 1024]

const NUMBER_OF_REGISTERS: usize = _

The number of registers that will be used.

impl Serialize for Precision10

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl WordType<1> for Precision10

type Words = [u32; 32]

The type to use for the associated vector of words. The type of Words is always an array of u32, as this is the smallest type that can be used to store the number of registers.

type RegisterMultiplicities = [<Precision10 as Precision>::NumberOfZeros; 2]

The register multiplicities is an array with the length of the largest possible value that can appear in a register. The value at index i is the number of registers that have a value equal to i, meaning the largest value that any register can have is the number of registers, i.e. 2^EXPONENT. This is the m parameter in the HyperLogLog. The lenth of the multiplicities array varies depending on the exponent and the number of bits, as the length of the array is equal to the maximal value that can be stored in a register. The value being stored in the register is the number of leading zeros in the hash of the value that is being inserted. When the register is of 1 bit, the maximal value is 1, and the length of the array is 2. When the register is of 2 bits, the maximal value is 3, and the length of the array is 4. When the register is of 3 bits, the maximal value is 7, and the length of the array is 8. When the register is of 4 bits, the maximal value is 15, and the length of the array is 16. When the register is of 5 bits, the maximal value is 31, and the length of the array is 32. Things start to get interesting for the cases of register at least 6 bits, as the maximal value representable in 6 bits is 63, but here we have to take into account the fact that the precision will be the limiting factor. In fact, the higher the precision, the larger the number of registers, and therefore more bits of the hash will be used to sample the register associated to a given value. For this reason, in those cases, the maximal value that we may encounter stored in the register is not 63, but 64 - (PRECISION - 1) + 1. So, when the register is of 6 bits, we need to consider the precision as follows: When the precision is 4, the maximal value is 61, and the length of the array is 62. When the precision is 5, the length of the array is 61. When the precision is 6, the length of the array is 60. The decrease in length continues linearly until the maximal precision for which we have experimental parameters, which is 18, where the length of the array is 48.

type FloatMultiplicities = [f32; 2]

impl WordType<2> for Precision10

type Words = [u32; 64]

The type to use for the associated vector of words. The type of Words is always an array of u32, as this is the smallest type that can be used to store the number of registers.

type RegisterMultiplicities = [<Precision10 as Precision>::NumberOfZeros; 4]

The register multiplicities is an array with the length of the largest possible value that can appear in a register. The value at index i is the number of registers that have a value equal to i, meaning the largest value that any register can have is the number of registers, i.e. 2^EXPONENT. This is the m parameter in the HyperLogLog. The lenth of the multiplicities array varies depending on the exponent and the number of bits, as the length of the array is equal to the maximal value that can be stored in a register. The value being stored in the register is the number of leading zeros in the hash of the value that is being inserted. When the register is of 1 bit, the maximal value is 1, and the length of the array is 2. When the register is of 2 bits, the maximal value is 3, and the length of the array is 4. When the register is of 3 bits, the maximal value is 7, and the length of the array is 8. When the register is of 4 bits, the maximal value is 15, and the length of the array is 16. When the register is of 5 bits, the maximal value is 31, and the length of the array is 32. Things start to get interesting for the cases of register at least 6 bits, as the maximal value representable in 6 bits is 63, but here we have to take into account the fact that the precision will be the limiting factor. In fact, the higher the precision, the larger the number of registers, and therefore more bits of the hash will be used to sample the register associated to a given value. For this reason, in those cases, the maximal value that we may encounter stored in the register is not 63, but 64 - (PRECISION - 1) + 1. So, when the register is of 6 bits, we need to consider the precision as follows: When the precision is 4, the maximal value is 61, and the length of the array is 62. When the precision is 5, the length of the array is 61. When the precision is 6, the length of the array is 60. The decrease in length continues linearly until the maximal precision for which we have experimental parameters, which is 18, where the length of the array is 48.

type FloatMultiplicities = [f32; 4]

impl WordType<3> for Precision10

type Words = [u32; 103]

The type to use for the associated vector of words. The type of Words is always an array of u32, as this is the smallest type that can be used to store the number of registers.

type RegisterMultiplicities = [<Precision10 as Precision>::NumberOfZeros; 8]

The register multiplicities is an array with the length of the largest possible value that can appear in a register. The value at index i is the number of registers that have a value equal to i, meaning the largest value that any register can have is the number of registers, i.e. 2^EXPONENT. This is the m parameter in the HyperLogLog. The lenth of the multiplicities array varies depending on the exponent and the number of bits, as the length of the array is equal to the maximal value that can be stored in a register. The value being stored in the register is the number of leading zeros in the hash of the value that is being inserted. When the register is of 1 bit, the maximal value is 1, and the length of the array is 2. When the register is of 2 bits, the maximal value is 3, and the length of the array is 4. When the register is of 3 bits, the maximal value is 7, and the length of the array is 8. When the register is of 4 bits, the maximal value is 15, and the length of the array is 16. When the register is of 5 bits, the maximal value is 31, and the length of the array is 32. Things start to get interesting for the cases of register at least 6 bits, as the maximal value representable in 6 bits is 63, but here we have to take into account the fact that the precision will be the limiting factor. In fact, the higher the precision, the larger the number of registers, and therefore more bits of the hash will be used to sample the register associated to a given value. For this reason, in those cases, the maximal value that we may encounter stored in the register is not 63, but 64 - (PRECISION - 1) + 1. So, when the register is of 6 bits, we need to consider the precision as follows: When the precision is 4, the maximal value is 61, and the length of the array is 62. When the precision is 5, the length of the array is 61. When the precision is 6, the length of the array is 60. The decrease in length continues linearly until the maximal precision for which we have experimental parameters, which is 18, where the length of the array is 48.

type FloatMultiplicities = [f32; 8]

impl WordType<4> for Precision10

type Words = [u32; 128]

The type to use for the associated vector of words. The type of Words is always an array of u32, as this is the smallest type that can be used to store the number of registers.

type RegisterMultiplicities = [<Precision10 as Precision>::NumberOfZeros; 16]

The register multiplicities is an array with the length of the largest possible value that can appear in a register. The value at index i is the number of registers that have a value equal to i, meaning the largest value that any register can have is the number of registers, i.e. 2^EXPONENT. This is the m parameter in the HyperLogLog. The lenth of the multiplicities array varies depending on the exponent and the number of bits, as the length of the array is equal to the maximal value that can be stored in a register. The value being stored in the register is the number of leading zeros in the hash of the value that is being inserted. When the register is of 1 bit, the maximal value is 1, and the length of the array is 2. When the register is of 2 bits, the maximal value is 3, and the length of the array is 4. When the register is of 3 bits, the maximal value is 7, and the length of the array is 8. When the register is of 4 bits, the maximal value is 15, and the length of the array is 16. When the register is of 5 bits, the maximal value is 31, and the length of the array is 32. Things start to get interesting for the cases of register at least 6 bits, as the maximal value representable in 6 bits is 63, but here we have to take into account the fact that the precision will be the limiting factor. In fact, the higher the precision, the larger the number of registers, and therefore more bits of the hash will be used to sample the register associated to a given value. For this reason, in those cases, the maximal value that we may encounter stored in the register is not 63, but 64 - (PRECISION - 1) + 1. So, when the register is of 6 bits, we need to consider the precision as follows: When the precision is 4, the maximal value is 61, and the length of the array is 62. When the precision is 5, the length of the array is 61. When the precision is 6, the length of the array is 60. The decrease in length continues linearly until the maximal precision for which we have experimental parameters, which is 18, where the length of the array is 48.

type FloatMultiplicities = [f32; 16]

impl WordType<5> for Precision10

type Words = [u32; 171]

The type to use for the associated vector of words. The type of Words is always an array of u32, as this is the smallest type that can be used to store the number of registers.

type RegisterMultiplicities = [<Precision10 as Precision>::NumberOfZeros; 32]

The register multiplicities is an array with the length of the largest possible value that can appear in a register. The value at index i is the number of registers that have a value equal to i, meaning the largest value that any register can have is the number of registers, i.e. 2^EXPONENT. This is the m parameter in the HyperLogLog. The lenth of the multiplicities array varies depending on the exponent and the number of bits, as the length of the array is equal to the maximal value that can be stored in a register. The value being stored in the register is the number of leading zeros in the hash of the value that is being inserted. When the register is of 1 bit, the maximal value is 1, and the length of the array is 2. When the register is of 2 bits, the maximal value is 3, and the length of the array is 4. When the register is of 3 bits, the maximal value is 7, and the length of the array is 8. When the register is of 4 bits, the maximal value is 15, and the length of the array is 16. When the register is of 5 bits, the maximal value is 31, and the length of the array is 32. Things start to get interesting for the cases of register at least 6 bits, as the maximal value representable in 6 bits is 63, but here we have to take into account the fact that the precision will be the limiting factor. In fact, the higher the precision, the larger the number of registers, and therefore more bits of the hash will be used to sample the register associated to a given value. For this reason, in those cases, the maximal value that we may encounter stored in the register is not 63, but 64 - (PRECISION - 1) + 1. So, when the register is of 6 bits, we need to consider the precision as follows: When the precision is 4, the maximal value is 61, and the length of the array is 62. When the precision is 5, the length of the array is 61. When the precision is 6, the length of the array is 60. The decrease in length continues linearly until the maximal precision for which we have experimental parameters, which is 18, where the length of the array is 48.

type FloatMultiplicities = [f32; 32]

impl WordType<6> for Precision10

type Words = [u32; 205]

The type to use for the associated vector of words. The type of Words is always an array of u32, as this is the smallest type that can be used to store the number of registers.

type RegisterMultiplicities = [<Precision10 as Precision>::NumberOfZeros; 56]

The register multiplicities is an array with the length of the largest possible value that can appear in a register. The value at index i is the number of registers that have a value equal to i, meaning the largest value that any register can have is the number of registers, i.e. 2^EXPONENT. This is the m parameter in the HyperLogLog. The lenth of the multiplicities array varies depending on the exponent and the number of bits, as the length of the array is equal to the maximal value that can be stored in a register. The value being stored in the register is the number of leading zeros in the hash of the value that is being inserted. When the register is of 1 bit, the maximal value is 1, and the length of the array is 2. When the register is of 2 bits, the maximal value is 3, and the length of the array is 4. When the register is of 3 bits, the maximal value is 7, and the length of the array is 8. When the register is of 4 bits, the maximal value is 15, and the length of the array is 16. When the register is of 5 bits, the maximal value is 31, and the length of the array is 32. Things start to get interesting for the cases of register at least 6 bits, as the maximal value representable in 6 bits is 63, but here we have to take into account the fact that the precision will be the limiting factor. In fact, the higher the precision, the larger the number of registers, and therefore more bits of the hash will be used to sample the register associated to a given value. For this reason, in those cases, the maximal value that we may encounter stored in the register is not 63, but 64 - (PRECISION - 1) + 1. So, when the register is of 6 bits, we need to consider the precision as follows: When the precision is 4, the maximal value is 61, and the length of the array is 62. When the precision is 5, the length of the array is 61. When the precision is 6, the length of the array is 60. The decrease in length continues linearly until the maximal precision for which we have experimental parameters, which is 18, where the length of the array is 48.

type FloatMultiplicities = [f32; 56]

impl Copy for Precision10

impl Eq for Precision10

impl StructuralPartialEq for Precision10