| 124 | } |
| 125 | |
| 126 | std::vector<InfoNode> InfoNode::AsArray() const { |
| 127 | std::vector<InfoNode> result; |
| 128 | if (_index < _tree->_nodeOrInfos.size()) { |
| 129 | auto &node = _tree->_nodeOrInfos[_index]; |
| 130 | if (node.Kind == InfoKind::Array) { |
| 131 | for (auto i: _tree->_arrayChildren[node.Data.ChildIndex]) { |
| 132 | result.emplace_back(i, _tree); |
| 133 | } |
| 134 | } |
| 135 | } |
| 136 | return result; |
| 137 | } |
| 138 | |
| 139 | std::unordered_map<std::string, InfoNode> InfoNode::AsMap() const { |
| 140 | std::unordered_map<std::string, InfoNode> umap; |
no test coverage detected