rsmorphy 0.4.0

Morphological analyzer / inflection engine for Russian and Ukrainian (soon) languages (WIP)
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
50
51
52
53
54
55
56
57
58

use std::borrow::Cow;
use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};

use container::paradigm::ParadigmId;
use opencorpora::tag::OpencorporaTagReg;

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct Seen<'a> {
    pub word: Cow<'a, str>,
    pub tag: &'a OpencorporaTagReg,
    pub para_id: Option<ParadigmId>,
}

impl<'a> Seen<'a> {
    pub fn new<W, P, PID>(word: W, tag: &'a OpencorporaTagReg, para_id: P) -> Self
    where
        W: Into<Cow<'a, str>>,
        P: Into<Option<PID>>,
        PID: Into<ParadigmId>,
    {
        let word = word.into();
        let para_id = para_id.into().map(Into::into);
        Seen { word, tag, para_id }
    }
}

/// A thin hash set
#[derive(Default, Debug, Clone)]
pub struct SeenSet {
    vec: Vec<u64>,
}

impl SeenSet {
    pub fn insert(&mut self, s: &Seen) -> bool {
        let hash = Self::eval_hash(s);
        if self.vec.contains(&hash) {
            false
        } else {
            self.vec.push(hash);
            true
        }
    }

    pub fn contains(&self, s: &Seen) -> bool {
        self.vec.contains(&Self::eval_hash(s))
    }

    pub fn is_empty(&self) -> bool {
        self.vec.is_empty()
    }

    fn eval_hash(s: &Seen) -> u64 {
        let mut hasher = DefaultHasher::default();
        s.hash(&mut hasher);
        hasher.finish()
    }
}