Václav Kubernát | bddbb17 | 2018-06-13 16:27:39 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2018 CESNET, https://photonics.cesnet.cz/ |
| 3 | * Copyright (C) 2018 FIT CVUT, https://fit.cvut.cz/ |
| 4 | * |
| 5 | * Written by Václav Kubernát <kubervac@fit.cvut.cz> |
| 6 | * |
| 7 | */ |
| 8 | |
| 9 | #pragma once |
| 10 | |
| 11 | #include <boost/variant.hpp> |
| 12 | #include <set> |
| 13 | #include <stdexcept> |
| 14 | #include <unordered_map> |
| 15 | #include "ast_path.hpp" |
| 16 | #include "schema.hpp" |
| 17 | |
| 18 | |
| 19 | /*! \class StaticSchema |
| 20 | * \brief Static schema, used mainly for testing |
| 21 | * */ |
| 22 | |
| 23 | class StaticSchema : public Schema { |
| 24 | public: |
| 25 | StaticSchema(); |
| 26 | |
| 27 | bool isContainer(const path_& location, const std::string& name) const override; |
| 28 | bool isLeaf(const path_& location, const std::string& name) const override; |
| 29 | bool isList(const path_& location, const std::string& name) const override; |
| 30 | bool isPresenceContainer(const path_& location, const std::string& name) const override; |
| 31 | bool leafEnumHasValue(const path_& location, const std::string& name, const std::string& value) const override; |
| 32 | bool listHasKey(const path_& location, const std::string& name, const std::string& key) const override; |
| 33 | bool nodeExists(const std::string& location, const std::string& name) const override; |
| 34 | const std::set<std::string>& listKeys(const path_& location, const std::string& name) const override; |
| 35 | yang::LeafDataTypes leafType(const path_& location, const std::string& name) const override; |
| 36 | |
| 37 | void addContainer(const std::string& location, const std::string& name, yang::ContainerTraits isPresence = yang::ContainerTraits::None); |
| 38 | void addLeaf(const std::string& location, const std::string& name, const yang::LeafDataTypes& type); |
| 39 | void addLeafEnum(const std::string& location, const std::string& name, std::set<std::string> enumValues); |
| 40 | void addList(const std::string& location, const std::string& name, const std::set<std::string>& keys); |
| 41 | |
| 42 | private: |
| 43 | const std::unordered_map<std::string, NodeType>& children(const std::string& name) const; |
| 44 | |
| 45 | std::unordered_map<std::string, std::unordered_map<std::string, NodeType>> m_nodes; |
| 46 | }; |