Struct HashedAs 

pub struct HashedAs<T>(/* private fields */);

HashedAs<U> can encode any feature that’s hashable. Here, U can be u8, u16, u32 or u64. Hash collisions are usually not a big problem for most uses (especially with HashedAs<u64>) HashedAs can really speed things up where you need to do a lot of equality comparisons and your feature is longer that U. It can also provide more balanced nodes in a BTree. Currently uses FxHash.

Example: Succinctly implementing MinHash

use creature_feature::ftzrs::bigram;
use creature_feature::traits::*;
use creature_feature::HashedAs;
use std::cmp::Reverse;
use std::collections::BinaryHeap;

// jaccard similarity is very fast on two sorted vecs, left as an exercise
fn min_hash(s: &str, n: usize) -> Vec<HashedAs<u64>> {

   let heap: BinaryHeap<Reverse<HashedAs<u64>>> = bigram().featurize(s);

   heap
    .into_iter_sorted()
    .map(|r| r.0)
    .take(10)
    .collect()
}

Trait Implementations

impl<T: Clone> Clone for HashedAs<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for HashedAs<T>

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

Formats the value using the given formatter.

impl<T: Hash> FeatureFrom<T> for HashedAs<u16>

fn from(token_group: T) -> Self

impl<T: Hash> FeatureFrom<T> for HashedAs<u32>

fn from(token_group: T) -> Self

impl<T: Hash> FeatureFrom<T> for HashedAs<u64>

fn from(token_group: T) -> Self

impl<T: Hash> FeatureFrom<T> for HashedAs<u8>

fn from(token_group: T) -> Self

impl<T: Hash, V: Hash> From<GapPair<T, V>> for HashedAs<u16>

fn from(x: GapPair<T, V>) -> Self

Converts to this type from the input type.

impl<T: Hash, V: Hash> From<GapPair<T, V>> for HashedAs<u32>

fn from(x: GapPair<T, V>) -> Self

Converts to this type from the input type.

impl<T: Hash, V: Hash> From<GapPair<T, V>> for HashedAs<u64>

fn from(x: GapPair<T, V>) -> Self

Converts to this type from the input type.

impl<T: Hash, V: Hash> From<GapPair<T, V>> for HashedAs<u8>

fn from(x: GapPair<T, V>) -> Self

Converts to this type from the input type.

impl<A: Hash> FromIterator<A> for HashedAs<u16>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = A>,

Creates a value from an iterator.

impl<A: Hash> FromIterator<A> for HashedAs<u32>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = A>,

Creates a value from an iterator.

impl<A: Hash> FromIterator<A> for HashedAs<u64>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = A>,

Creates a value from an iterator.

impl<A: Hash> FromIterator<A> for HashedAs<u8>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = A>,

Creates a value from an iterator.

impl<T: Hash> Hash for HashedAs<T>

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 Into<u16> for HashedAs<u16>

fn into(self) -> u16

Converts this type into the (usually inferred) input type.

impl Into<u32> for HashedAs<u32>

fn into(self) -> u32

Converts this type into the (usually inferred) input type.

impl Into<u64> for HashedAs<u64>

fn into(self) -> u64

Converts this type into the (usually inferred) input type.

impl Into<u8> for HashedAs<u8>

fn into(self) -> u8

Converts this type into the (usually inferred) input type.

impl<T: Ord> Ord for HashedAs<T>

fn cmp(&self, other: &HashedAs<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for HashedAs<T>

fn eq(&self, other: &HashedAs<T>) -> 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<T: PartialOrd> PartialOrd for HashedAs<T>

fn partial_cmp(&self, other: &HashedAs<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Copy> Copy for HashedAs<T>

impl<T: Eq> Eq for HashedAs<T>

impl IsEnabled for HashedAs<u16>

impl IsEnabled for HashedAs<u32>

impl IsEnabled for HashedAs<u64>

impl IsEnabled for HashedAs<u8>

impl<T> StructuralPartialEq for HashedAs<T>