Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2018 CESNET, https://photonics.cesnet.cz/ |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 3 | * Copyright (C) 2018 FIT CVUT, https://fit.cvut.cz/ |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 4 | * |
| 5 | * Written by Václav Kubernát <kubervac@fit.cvut.cz> |
| 6 | * |
| 7 | */ |
| 8 | |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 9 | #include <iostream> |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 10 | #include "CTree.hpp" |
Václav Kubernát | 94938b7 | 2018-05-04 15:12:24 +0200 | [diff] [blame] | 11 | #include "utils.hpp" |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 12 | |
| 13 | InvalidNodeException::~InvalidNodeException() = default; |
| 14 | |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 15 | |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 16 | |
| 17 | CTree::CTree() |
| 18 | { |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 19 | m_nodes.emplace("", std::unordered_map<std::string, NodeType>()); |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 20 | } |
| 21 | |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 22 | const std::unordered_map<std::string, NodeType>& CTree::children(const std::string& name) const |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 23 | { |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 24 | return m_nodes.at(name); |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 25 | } |
| 26 | |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 27 | bool CTree::nodeExists(const std::string& location, const std::string& name) const |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 28 | { |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 29 | if (name.empty()) |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 30 | return true; |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 31 | const auto& childrenRef = children(location); |
| 32 | |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 33 | return childrenRef.find(name) != childrenRef.end(); |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 34 | } |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 35 | |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 36 | bool CTree::isContainer(const std::string& location, const std::string& name) const |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 37 | { |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 38 | if (!nodeExists(location, name)) |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 39 | return false; |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 40 | |
| 41 | return children(location).at(name).type() == typeid(schema::container); |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 42 | } |
| 43 | |
| 44 | void CTree::addContainer(const std::string& location, const std::string& name) |
| 45 | { |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 46 | m_nodes.at(location).emplace(name, schema::container{}); |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 47 | |
| 48 | //create a new set of children for the new node |
| 49 | std::string key = joinPaths(location, name); |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 50 | m_nodes.emplace(key, std::unordered_map<std::string, NodeType>()); |
Václav Kubernát | d666296 | 2018-03-22 17:41:33 +0100 | [diff] [blame] | 51 | } |
| 52 | |
| 53 | |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 54 | bool CTree::listHasKey(const std::string& location, const std::string& name, const std::string& key) const |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 55 | { |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 56 | assert(isList(location, name)); |
| 57 | |
| 58 | const auto& child = children(location).at(name); |
| 59 | const auto& list = boost::get<schema::list>(child); |
| 60 | return list.m_keys.find(key) != list.m_keys.end(); |
| 61 | } |
| 62 | |
| 63 | const std::set<std::string>& CTree::listKeys(const std::string& location, const std::string& name) const |
| 64 | { |
| 65 | assert(isList(location, name)); |
| 66 | |
| 67 | const auto& child = children(location).at(name); |
| 68 | const auto& list = boost::get<schema::list>(child); |
| 69 | return list.m_keys; |
| 70 | } |
| 71 | |
| 72 | bool CTree::isList(const std::string& location, const std::string& name) const |
| 73 | { |
| 74 | if (!nodeExists(location, name)) |
| 75 | return false; |
| 76 | const auto& child = children(location).at(name); |
| 77 | if (child.type() != typeid(schema::list)) |
| 78 | return false; |
| 79 | |
| 80 | return true; |
| 81 | } |
| 82 | |
| 83 | void CTree::addList(const std::string& location, const std::string& name, const std::set<std::string>& keys) |
| 84 | { |
| 85 | m_nodes.at(location).emplace(name, schema::list{keys}); |
| 86 | |
| 87 | m_nodes.emplace(name, std::unordered_map<std::string, NodeType>()); |
| 88 | } |
| 89 | |
| 90 | |
| 91 | void CTree::changeNode(const std::string& name) |
| 92 | { |
| 93 | if (name.empty()) { |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 94 | m_curDir = ""; |
| 95 | return; |
| 96 | } |
Václav Kubernát | b96eef7 | 2018-05-04 19:10:22 +0200 | [diff] [blame] | 97 | m_curDir += joinPaths(m_curDir, name); |
Václav Kubernát | 624a887 | 2018-03-02 17:28:47 +0100 | [diff] [blame] | 98 | } |
| 99 | std::string CTree::currentNode() const |
| 100 | { |
| 101 | return m_curDir; |
| 102 | } |