Struct HashedSequence 

pub struct HashedSequence<Hasher>
where
    Hasher: RollingHasher + ?Sized,
{
    hashed: Vec<Hasher::Hash>,
    _marker: PhantomData<fn() -> Hasher>,
}

Fields

hashed: Vec<Hasher::Hash>

_marker: PhantomData<fn() -> Hasher>

Implementations

impl<Hasher> HashedSequence<Hasher>

where Hasher: RollingHasher + ?Sized,

fn new(hashed: Vec<Hasher::Hash>) -> Self

pub fn len(&self) -> usize

Examples found in repository

crates/competitive/src/string/rolling_hash.rs (line 49)

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }
    pub fn range<R>(&self, range: R) -> HashedRange<'_, Hasher>
    where
        R: RangeBounds<usize>,
    {
        HashedRange::new(&self.hashed[to_range(range, self.len())])
    }

pub fn is_empty(&self) -> bool

pub fn range<R>(&self, range: R) -> HashedRange<'_, Hasher>

where R: RangeBounds<usize>,

Examples found in repository

crates/competitive/src/string/rolling_hash.rs (line 61)

    pub fn hash_range<R>(&self, range: R) -> Hashed<Hasher>
    where
        R: RangeBounds<usize>,
    {
        self.range(range).hash()
    }

crates/library_checker/src/string/zalgorithm.rs (line 18)

pub fn zalgorithm_rolling_hash(reader: impl Read, writer: impl Write) {
    prepare_io!(reader, writer);
    sc!(s: Bytes);
    Mersenne61x1::init(s.len());
    let h = Mersenne61x1::hash_sequence(s.iter().map(|&c| c as _));
    let ans = (0..s.len()).map(|i| h.range(..).longest_common_prefix(&h.range(i..)));
    pp!(@it ans);
}

pub fn hash_range<R>(&self, range: R) -> Hashed<Hasher>

where R: RangeBounds<usize>,

Trait Implementations

impl<Hasher> Debug for HashedSequence<Hasher>

where Hasher: RollingHasher + ?Sized + Debug, Hasher::Hash: Debug,

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

Formats the value using the given formatter.