Struct RankedValues

pub struct RankedValues<T> { /* private fields */ }

RankedValues compactly represents rank-indexed values of type T. It stores contiguous values in a set of intervals; thus it is efficient and compact when the cardinality of T-typed values is low.

Implementations

impl<T> RankedValues<T>

pub fn iter(&self) -> impl Iterator<Item = &(Range<usize>, T)> + '_

Iterate over contiguous rank intervals of values.

pub fn rank(&self, value: usize) -> usize

The (set) rank of the RankedValues is the number of values stored with rank less than value.

impl<T: Eq + Clone> RankedValues<T>

pub fn merge_from(&mut self, other: Self)

Merge other into this set of ranked values. Values in other that overlap with self take prededence.

This currently uses a simple algorithm that merges the full set of RankedValues. This remains efficient when the cardinality of T-typed values is low. However, it does not efficiently merge high cardinality value sets. Consider using interval trees or bitmap techniques like Roaring Bitmaps in these cases.

Trait Implementations

impl<T: Eq + Clone + Named> Accumulator for RankedValues<T>

type State = RankedValues<T>

The type of the accumulated state.

type Update = RankedValues<T>

The type of the updates sent to the accumulator. Updates will be accumulated into type Self::State.

fn accumulate( &self, state: &mut Self::State, update: Self::Update, ) -> Result<()>

Accumulate an update into the current state.

fn reducer_spec(&self) -> Option<ReducerSpec>

The specification used to build the reducer.

impl<T: Clone> Clone for RankedValues<T>

fn clone(&self) -> RankedValues<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RankedValues<T>

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

Formats the value using the given formatter.

impl<T> Default for RankedValues<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for RankedValues<T>

where T: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> From<(usize, T)> for RankedValues<T>

fn from((rank, value): (usize, T)) -> Self

Converts to this type from the input type.

impl<T: Named> Named for RankedValues<T>

fn typename() -> &'static str

The globally unique type name for the type. This should typically be the fully qualified Rust name of the type.

fn typehash() -> u64

A globally unique hash for this type. TODO: actually enforce perfect hashing

fn typeid() -> TypeId

The TypeId for this type. TypeIds are unique only within a binary, and should not be used for global identification.

fn port() -> u64

The globally unique port for this type. Typed ports are in the range of 1<<63..1<<64-1.

fn arm(&self) -> Option<&'static str>

If the named type is an enum, this returns the name of the arm of the value self.

unsafe fn arm_unchecked(self_: *const ()) -> Option<&'static str>

An unsafe version of ‘arm’, accepting a pointer to the value, for use in type-erased settings.

impl<T> Serialize for RankedValues<T>

where T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.