Alexander Afanasyev | 3ecec50 | 2014-04-16 13:42:44 -0700 | [diff] [blame] | 1 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /** |
| 3 | * Copyright (c) 2014 Regents of the University of California, |
| 4 | * Arizona Board of Regents, |
| 5 | * Colorado State University, |
| 6 | * University Pierre & Marie Curie, Sorbonne University, |
| 7 | * Washington University in St. Louis, |
| 8 | * Beijing Institute of Technology, |
| 9 | * The University of Memphis |
| 10 | * |
| 11 | * This file is part of NFD (Named Data Networking Forwarding Daemon). |
| 12 | * See AUTHORS.md for complete list of NFD authors and contributors. |
| 13 | * |
| 14 | * NFD is free software: you can redistribute it and/or modify it under the terms |
| 15 | * of the GNU General Public License as published by the Free Software Foundation, |
| 16 | * either version 3 of the License, or (at your option) any later version. |
| 17 | * |
| 18 | * NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; |
| 19 | * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR |
| 20 | * PURPOSE. See the GNU General Public License for more details. |
| 21 | * |
| 22 | * You should have received a copy of the GNU General Public License along with |
| 23 | * NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>. |
| 24 | **/ |
| 25 | |
| 26 | #ifndef NFD_RIB_RIB_HPP |
| 27 | #define NFD_RIB_RIB_HPP |
| 28 | |
| 29 | #include "common.hpp" |
| 30 | |
| 31 | #include <ndn-cpp-dev/management/nrd-prefix-reg-options.hpp> |
| 32 | |
| 33 | namespace nfd { |
| 34 | namespace rib { |
| 35 | |
| 36 | using ndn::nrd::PrefixRegOptions; |
| 37 | namespace tlv = ndn::tlv; |
| 38 | |
| 39 | /** \brief represents the RIB |
| 40 | */ |
| 41 | class Rib |
| 42 | { |
| 43 | public: |
| 44 | typedef std::list<PrefixRegOptions> RibTable; |
| 45 | typedef RibTable::const_iterator const_iterator; |
| 46 | |
| 47 | Rib(); |
| 48 | |
| 49 | ~Rib(); |
| 50 | |
| 51 | const_iterator |
| 52 | find(const PrefixRegOptions& options) const; |
| 53 | |
| 54 | void |
| 55 | insert(const PrefixRegOptions& options); |
| 56 | |
| 57 | void |
| 58 | erase(const PrefixRegOptions& options); |
| 59 | |
| 60 | void |
| 61 | erase(uint64_t faceId); |
| 62 | |
| 63 | const_iterator |
| 64 | begin() const; |
| 65 | |
| 66 | const_iterator |
| 67 | end() const; |
| 68 | |
| 69 | size_t |
| 70 | size() const; |
| 71 | |
| 72 | size_t |
| 73 | empty() const; |
| 74 | |
| 75 | private: |
| 76 | // Note: Taking a list right now. A Trie will be used later to store |
| 77 | // prefixes |
| 78 | RibTable m_rib; |
| 79 | }; |
| 80 | |
| 81 | inline Rib::const_iterator |
| 82 | Rib::begin() const |
| 83 | { |
| 84 | return m_rib.begin(); |
| 85 | } |
| 86 | |
| 87 | inline Rib::const_iterator |
| 88 | Rib::end() const |
| 89 | { |
| 90 | return m_rib.end(); |
| 91 | } |
| 92 | |
| 93 | inline size_t |
| 94 | Rib::size() const |
| 95 | { |
| 96 | return m_rib.size(); |
| 97 | } |
| 98 | |
| 99 | inline size_t |
| 100 | Rib::empty() const |
| 101 | { |
| 102 | return m_rib.empty(); |
| 103 | } |
| 104 | |
| 105 | } // namespace rib |
| 106 | } // namespace nfd |
| 107 | |
| 108 | #endif // NFD_RIB_RIB_HPP |