emmylua_codestyle 0.6.0

Lua code formatting lib with EmmyLuaCodeStyle
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166

#include "Util/InfoTree/InfoNode.h"
#include "Util/InfoTree/InfoTree.h"

InfoNode::InfoNode(std::size_t index, InfoTree *tree)
    : _index(index), _tree(tree) {
}

InfoKind InfoNode::GetKind() const {
    if (_index < _tree->_nodeOrInfos.size()) {
        return _tree->_nodeOrInfos[_index].Kind;
    }
    return InfoKind::None;
}

bool InfoNode::IsNull() const {
    return _index == 0;
}

bool InfoNode::IsObject() const {
    return GetKind() == InfoKind::Object;
}

bool InfoNode::IsArray() const {
    return GetKind() == InfoKind::Array;
}

bool InfoNode::IsNumber() const {
    return GetKind() == InfoKind::Number;
}

bool InfoNode::IsString() const {
    return GetKind() == InfoKind::String;
}

bool InfoNode::IsBool() const {
    return GetKind() == InfoKind::Bool;
}

void InfoNode::AddChild(InfoNode n) {
    if (_index < _tree->_nodeOrInfos.size()) {
        auto node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Array) {
            _tree->_arrayChildren[node.Data.ChildIndex].push_back(n._index);
        }
    }
}

void InfoNode::AddChild(std::string s) {
    auto c = _tree->CreateString(s);
    AddChild(c);
}

void InfoNode::AddChild(bool b) {
    auto c = _tree->CreateBool(b);
    AddChild(c);
}

void InfoNode::AddChild(double d) {
    auto c = _tree->CreateNumber(d);
    AddChild(c);
}

void InfoNode::AddChild(std::string_view key, InfoNode n) {
    if (_index < _tree->_nodeOrInfos.size()) {
        auto node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Object) {
            _tree->_mapChildren[node.Data.ChildIndex].insert({std::string(key), n._index});
        }
    }
}

void InfoNode::AddChild(std::string_view key, std::string s) {
    auto c = _tree->CreateString(s);
    AddChild(key, c);
}

void InfoNode::AddChild(std::string_view key, bool b) {
    auto c = _tree->CreateBool(b);
    AddChild(key, c);
}

void InfoNode::AddChild(std::string_view key, double d) {
    auto c = _tree->CreateNumber(d);
    AddChild(key, c);
}

std::string InfoNode::AsString() const {
    if (_index < _tree->_nodeOrInfos.size()) {
        if (_tree->_nodeOrInfos[_index].Kind == InfoKind::String) {
            return _tree->_stringValues[_tree->_nodeOrInfos[_index].Data.StringIndex];
        }
    }
    return "";
}

double InfoNode::AsDouble() const {
    if (_index < _tree->_nodeOrInfos.size()) {
        auto &node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Number) {
            return node.Data.NumberValue;
        }
    }
    return 0.0;
}

int InfoNode::AsInt() const {
    if (_index < _tree->_nodeOrInfos.size()) {
        auto &node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Number) {
            return node.Data.IntValue;
        }
    }
    return 0;
}

bool InfoNode::AsBool() const {
    if (_index < _tree->_nodeOrInfos.size()) {
        auto &node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Bool) {
            return node.Data.BoolValue;
        }
    }
    return false;
}

std::vector<InfoNode> InfoNode::AsArray() const {
    std::vector<InfoNode> result;
    if (_index < _tree->_nodeOrInfos.size()) {
        auto &node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Array) {
            for (auto i: _tree->_arrayChildren[node.Data.ChildIndex]) {
                result.emplace_back(i, _tree);
            }
        }
    }
    return result;
}

std::unordered_map<std::string, InfoNode> InfoNode::AsMap() const {
    std::unordered_map<std::string, InfoNode> umap;
    if (_index < _tree->_nodeOrInfos.size()) {
        auto &node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Object) {
            auto &innerUmap = _tree->_mapChildren[node.Data.ChildIndex];
            for (auto &p: innerUmap) {
                umap.insert({p.first, InfoNode(p.second, _tree)});
            }
        }
    }
    return umap;
}

InfoNode InfoNode::GetValue(std::string_view key) const {
    if (_index < _tree->_nodeOrInfos.size()) {
        auto &node = _tree->_nodeOrInfos[_index];
        if (node.Kind == InfoKind::Object) {
            auto &umap = _tree->_mapChildren[node.Data.ChildIndex];
            std::string keyString(key);
            auto it = umap.find(keyString);
            if (it != umap.end()) {
                return InfoNode(it->second, _tree);
            }
        }
    }
    return InfoNode(0, _tree);
}