mors 0.1.1

A crate for converting morsecode to text and reverse
Documentation 
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147

use crate::code::Cod;
use std::collections::HashSet;
#[derive(Hash, Eq, PartialEq, Debug, Clone)]

pub struct Code {
    letter: String,
    sequence: String,
    depth: usize,
    left_code: Option<Box<Code>>,
    right_code: Option<Box<Code>>,
}

impl Code {
    pub fn new(letter: String, sequence: String) -> Code {
        return Code {
            letter,
            sequence,
            depth: 0,
            left_code: None,
            right_code: None,
        };
    }

    pub fn get_lenght_of_seq(&self) -> i32 {
        return self.sequence.len() as i32;
    }
    pub fn get_sequence(&self) -> String {
        return self.sequence.to_string();
    }

    pub fn get_letter(&self) -> String {
        return self.letter.to_string();
    }

    pub fn to_string(&self) -> String {
        let left = match &self.left_code {
            Some(c) => String::from(c.get_letter()),
            None => String::from("None"),
        };
        let right = match &self.right_code {
            Some(c) => String::from(c.get_letter()),
            None => String::from("None"),
        };
        return format!(
            "Letter: {} | Sequence: {} | depth: {} | left: {} | right: {}",
            self.letter, self.sequence, self.depth, left, right
        );
    }

    pub fn find_letter_for_sequence(&self, mut sequence: String) -> String {
        if sequence.len() == 0 {
            return self.letter.to_string();
        }
        let character: char = sequence.remove(0);
        if character == '.' {
            return search_in_node(sequence, self.left_code.clone());
        }
        return search_in_node(sequence, self.right_code.clone());
    }

    pub fn get_children(&self, mut stack: HashSet<Cod>) -> HashSet<Cod> {
        let t = match &self.left_code {
            Some(x) => {
                for codec_element in x.get_children(stack.clone()) {
                    stack.insert(Cod::new(
                        codec_element.get_letter(),
                        codec_element.get_sequence(),
                    ));
                }
                let code = self.clone();
                stack.insert(Cod::new(code.get_letter(), code.get_sequence()));
                true
            }
            None => true,
        };
        let m = match &self.right_code {
            Some(x) => {
                for codec_element in x.get_children(stack.clone()) {
                    stack.insert(Cod::new(
                        codec_element.get_letter(),
                        codec_element.get_sequence(),
                    ));
                }
                let code = self.clone();
                stack.insert(Cod::new(code.get_letter(), code.get_sequence()));
                true
            }
            None => true,
        };
        return stack;
    }

    fn insert_on_right(&mut self, code: Code) {
        match self.right_code.as_mut() {
            Some(c) => c.insert_node(code),
            None => self.right_code = Option::from(Box::new(code)),
        }
    }

    fn insert_on_left(&mut self, code: Code) {
        match self.left_code.as_mut() {
            Some(c) => c.insert_node(code),

            None => self.left_code = Option::from(Box::new(code)),
        }
    }

    pub fn insert_node(&mut self, mut code: Code) {
        let current_character = code.seq_at(code.depth);
        code.increment_depth();
        if current_character == "." {
            self.insert_on_left(code);
        } else {
            self.insert_on_right(code);
        }
    }

    pub fn seq_at(&self, index: usize) -> String {
        assert!(self.get_lenght_of_seq() > index as i32);
        return (self.sequence.as_bytes()[index] as char).to_string();
    }

    pub fn increment_depth(&mut self) {
        self.depth += 1;
    }
}
pub fn search_in_node(sequence: String, node: Option<Box<Code>>) -> String {
    match &node {
        Some(c) => return c.find_letter_for_sequence(sequence),
        None => return "".to_string(),
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn test_flatening() {
        let mut codes = Code::new(String::from(""), String::from(""));
        codes.insert_node(Code::new(String::from("E"), String::from(".")));
        let stack = codes.get_children(HashSet::new());
        println!("{}", stack.len());
        for code in stack {
            println!("{}", code.to_string());
        }
    }
}