tom 0.0.1

Yet another format-preserving TOML parser/manipulator.
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

mod generated;

use std::borrow::Cow;

use {ast, AstChildren, AstNode, Position::*, TomlDoc};
pub use self::generated::*;

pub trait EntryOwner: AstNode {
    fn entries(self, doc: &TomlDoc) -> AstChildren<ast::Entry>;
    fn append_entry(self, doc: &mut TomlDoc, entry: ast::Entry);
}

pub trait TableHeaderOwner: AstNode {
    fn header(self, doc: &TomlDoc) -> ast::TableHeader;
}

pub trait KeyOwner: AstNode {
    fn keys(self, doc: &TomlDoc) -> AstChildren<ast::Key>;
}

impl ast::Key {
    pub fn name(self, doc: &TomlDoc) -> Cow<str> {
        match self.kind(doc) {
            ast::KeyKind::StringLit(lit) => lit.value(doc),
            ast::KeyKind::BareKey(key) => Cow::from(key.text(doc)),
        }
    }
}

impl ast::StringLit {
    pub fn value(self, doc: &TomlDoc) -> Cow<str> {
        //TODO: broken completely
        let text = self.text(doc);
        let len = text.len();
        Cow::from(&text[1..len - 1])
    }
}

impl ast::Bool {
    pub fn value(self, doc: &TomlDoc) -> bool {
        self.text(doc) == "true"
    }
}

impl ast::Number {
    pub fn value(self, _doc: &TomlDoc) -> i64 {
        unimplemented!()
    }
}

impl ast::DateTime {
    // chrono?
    pub fn value(self, _doc: &TomlDoc) -> ::std::time::SystemTime {
        unimplemented!()
    }
}

impl EntryOwner for ast::Dict {
    fn entries(self, doc: &TomlDoc) -> AstChildren<ast::Entry> {
        self.entries(doc)
    }

    fn append_entry(self, doc: &mut TomlDoc, entry: Entry) {
        match self.entries(doc).last() {
            Some(old_entry) => {
                let comma = doc.new_comma();
                doc.insert(comma, After(old_entry.into()));
                doc.insert(entry, After(comma));
            }
            None => {
                let l_curly = self.cst().children(doc).first().unwrap();
                doc.insert(entry, After(l_curly));
                return;
            }
        }
    }
}

impl EntryOwner for ast::Table {
    fn entries(self, doc: &TomlDoc) -> AstChildren<ast::Entry> {
        self.entries(doc)
    }
    fn append_entry(self, doc: &mut TomlDoc, entry: Entry) {
        doc.insert(entry, AppendTo(self.cst()));
    }
}

impl EntryOwner for ast::ArrayTable {
    fn entries(self, doc: &TomlDoc) -> AstChildren<ast::Entry> {
        self.entries(doc)
    }
    fn append_entry(self, doc: &mut TomlDoc, entry: Entry) {
        doc.insert(entry, AppendTo(self.cst()));
    }
}

impl EntryOwner for ast::Doc {
    fn entries(self, doc: &TomlDoc) -> AstChildren<ast::Entry> {
        self.entries(doc)
    }

    fn append_entry(self, doc: &mut TomlDoc, entry: Entry) {
        match self.entries(doc).last() {
            Some(old_entry) => doc.insert(entry, After(old_entry.into())),
            None => doc.insert(entry, PrependTo(self.into())),
        }
    }
}

impl TableHeaderOwner for ast::Table {
    fn header(self, doc: &TomlDoc) -> ast::TableHeader {
        self.header(doc)
    }
}

impl TableHeaderOwner for ast::ArrayTable {
    fn header(self, doc: &TomlDoc) -> ast::TableHeader {
        self.header(doc)
    }
}

impl KeyOwner for ast::TableHeader {
    fn keys(self, doc: &TomlDoc) -> AstChildren<ast::Key> {
        self.keys(doc)
    }
}

impl KeyOwner for ast::Entry {
    fn keys(self, doc: &TomlDoc) -> AstChildren<ast::Key> {
        self.keys(doc)
    }
}