sot 0.0.2

Simple Object Tree
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

// Copyright (c) 2022 Yegor Bugayenko
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

use serde::{Deserialize, Serialize};
use std::collections::HashMap;
use std::fmt;

mod inconsistencies;
mod inspect;
mod merge;
mod ops;
mod parse;
mod serialization;
mod slice;
mod xml;

#[derive(Clone, Serialize, Deserialize, Eq, PartialOrd, PartialEq, Ord)]
struct Edge {
    to: u32,
    a: String,
}

impl Edge {
    fn new(to: u32, a: String) -> Edge {
        Edge { to, a }
    }
}

#[derive(Clone, Serialize, Deserialize)]
struct Vertex {
    edges: Vec<Edge>,
    data: Vec<u8>,
}

impl Vertex {
    /// Make an empty one.
    pub fn empty() -> Self {
        Vertex {
            edges: vec![],
            data: vec![],
        }
    }
}

#[derive(Serialize, Deserialize)]
pub struct Sot {
    vertices: HashMap<u32, Vertex>,
}

impl fmt::Debug for Sot {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        let mut lines = vec![];
        for (i, v) in self.vertices.iter() {
            let mut attrs = v
                .edges
                .iter()
                .map(|e| format!("\n\t{} ➞ ν{}", e.a, e.to))
                .collect::<Vec<String>>();
            if !&v.data.is_empty() {
                attrs.push(format!("{}b", v.data.len()));
            }
            lines.push(format!("ν{} -> ⟦{}⟧", i, attrs.join(", ")));
        }
        f.write_str(lines.join("\n").as_str())
    }
}

impl Sot {
    /// Makes an empty Sot, with no vertices and no edges.
    pub fn empty() -> Self {
        Sot {
            vertices: HashMap::new(),
        }
    }

    /// Get max ID of a vertex.
    pub fn max(&self) -> u32 {
        let mut id = 0;
        for v in self.vertices.keys() {
            if *v > id {
                id = *v;
            }
        }
        id
    }
}

#[cfg(test)]
use anyhow::Result;

#[test]
fn makes_an_empty_sot() -> Result<()> {
    let mut sot = Sot::empty();
    sot.add(0)?;
    assert_eq!(1, sot.vertices.len());
    Ok(())
}

#[test]
fn calculates_max() -> Result<()> {
    let mut sot = Sot::empty();
    sot.add(0)?;
    sot.add(1)?;
    assert_eq!(1, sot.max());
    Ok(())
}