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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81

use std::{collections::HashMap, mem};

/// An indexed map of VCF strings.
///
/// This is also called a dictionary of strings.
///
/// See ยง 6.2.1 Dictionary of strings (2021-05-13).
#[derive(Clone, Debug, Default, Eq, PartialEq)]
pub struct StringMap {
    pub(super) indices: HashMap<String, usize>,
    pub(super) entries: Vec<Option<String>>,
}

impl StringMap {
    /// Returns an entry by index.
    ///
    /// # Examples
    ///
    /// ```
    /// use noodles_vcf::header::string_maps::StringMap;
    /// let string_map = StringMap::default();
    /// assert!(string_map.get_index(0).is_none());
    /// ```
    pub fn get_index(&self, i: usize) -> Option<&str> {
        self.entries.get(i).and_then(|entry| entry.as_deref())
    }

    /// Returns the index of the entry of the given value.
    ///
    /// # Examples
    ///
    /// ```
    /// use noodles_vcf::header::string_maps::StringMap;
    /// let string_map = StringMap::default();
    /// assert!(string_map.get_index_of("PASS").is_none());
    /// ```
    pub fn get_index_of(&self, value: &str) -> Option<usize> {
        self.indices.get(value).copied()
    }

    pub(super) fn get_full(&self, value: &str) -> Option<(usize, &str)> {
        self.get_index_of(value)
            .and_then(|i| self.get_index(i).map(|entry| (i, entry)))
    }

    #[doc(hidden)]
    pub fn insert(&mut self, value: String) -> Option<String> {
        self.insert_full(value).1
    }

    fn insert_full(&mut self, value: String) -> (usize, Option<String>) {
        match self.get_index_of(&value) {
            Some(i) => {
                let entry = mem::replace(&mut self.entries[i], Some(value));
                (i, entry)
            }
            None => {
                let i = self.push(value);
                (i, None)
            }
        }
    }

    pub(super) fn insert_at(&mut self, i: usize, value: String) -> Option<String> {
        if i >= self.entries.len() {
            self.entries.resize(i + 1, None);
        }

        self.indices.insert(value.clone(), i);
        mem::replace(&mut self.entries[i], Some(value))
    }

    fn push(&mut self, value: String) -> usize {
        let i = self.entries.len();

        self.indices.insert(value.clone(), i);
        self.entries.push(Some(value));

        i
    }
}