blob: f5bac1d1f7011ceeef4fd418c9c6559cf508e384 [file] [log] [blame]
akmhoque3d06e792014-05-27 16:23:20 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -08003 * Copyright (c) 2014-2020, The University of Memphis,
alvy297f4162015-03-03 17:15:33 -06004 * Regents of the University of California,
5 * Arizona Board of Regents.
akmhoque3d06e792014-05-27 16:23:20 -05006 *
7 * This file is part of NLSR (Named-data Link State Routing).
8 * See AUTHORS.md for complete list of NLSR authors and contributors.
9 *
10 * NLSR is free software: you can redistribute it and/or modify it under the terms
11 * of the GNU General Public License as published by the Free Software Foundation,
12 * either version 3 of the License, or (at your option) any later version.
13 *
14 * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
15 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
16 * PURPOSE. See the GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License along with
19 * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
akmhoque3d06e792014-05-27 16:23:20 -050020 **/
alvy297f4162015-03-03 17:15:33 -060021
akmhoquefdbddb12014-05-02 18:35:19 -050022#ifndef NLSR_NAME_PREFIX_LIST_HPP
23#define NLSR_NAME_PREFIX_LIST_HPP
akmhoque53353462014-04-22 08:43:45 -050024
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080025#include "test-access-control.hpp"
26
akmhoque53353462014-04-22 08:43:45 -050027#include <list>
28#include <string>
akmhoque31d1d4b2014-05-05 22:08:14 -050029#include <ndn-cxx/name.hpp>
akmhoquec8a10f72014-04-25 18:42:55 -050030
akmhoque53353462014-04-22 08:43:45 -050031namespace nlsr {
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080032
akmhoquec8a10f72014-04-25 18:42:55 -050033class NamePrefixList
akmhoque53353462014-04-22 08:43:45 -050034{
akmhoque53353462014-04-22 08:43:45 -050035public:
Nick Gordonf14ec352017-07-24 16:09:58 -050036 using NamePair = std::tuple<ndn::Name, std::vector<std::string>>;
37 enum NamePairIndex {
38 NAME,
39 SOURCES
40 };
41
akmhoquec8a10f72014-04-25 18:42:55 -050042 NamePrefixList();
akmhoque53353462014-04-22 08:43:45 -050043
Nick Gordon96861ca2017-10-17 18:25:21 -050044 NamePrefixList(const std::initializer_list<ndn::Name>& names);
45
46 NamePrefixList(const std::initializer_list<NamePrefixList::NamePair>& namesAndSources);
47
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080048PUBLIC_WITH_TESTS_ELSE_PRIVATE:
Nick Gordon96861ca2017-10-17 18:25:21 -050049 template<class ContainerType>
50 NamePrefixList(const ContainerType& names)
51 {
52 for (const auto& elem : names) {
53 m_names.push_back(NamePair{elem, {""}});
54 }
55 }
56
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080057public:
akmhoquec8a10f72014-04-25 18:42:55 -050058 ~NamePrefixList();
akmhoque53353462014-04-22 08:43:45 -050059
Nick G97e34942016-07-11 14:46:27 -050060 /*! \brief inserts name into NamePrefixList
61 \retval true If the name was successfully inserted.
62 \retval false If the name could not be inserted.
alvy297f4162015-03-03 17:15:33 -060063 */
64 bool
Nick Gordonf14ec352017-07-24 16:09:58 -050065 insert(const ndn::Name& name, const std::string& source = "");
akmhoque53353462014-04-22 08:43:45 -050066
Nick G97e34942016-07-11 14:46:27 -050067 /*! \brief removes name from NamePrefixList
68 \retval true If the name is removed
69 \retval false If the name failed to be removed.
alvy297f4162015-03-03 17:15:33 -060070 */
71 bool
Nick Gordonf14ec352017-07-24 16:09:58 -050072 remove(const ndn::Name& name, const std::string& source = "");
akmhoque53353462014-04-22 08:43:45 -050073
74 void
75 sort();
76
akmhoque31d1d4b2014-05-05 22:08:14 -050077 size_t
Nick Gordonff9a6272017-10-12 13:38:29 -050078 size() const
akmhoque53353462014-04-22 08:43:45 -050079 {
Nick Gordonf14ec352017-07-24 16:09:58 -050080 return m_names.size();
akmhoque53353462014-04-22 08:43:45 -050081 }
82
Nick Gordonf14ec352017-07-24 16:09:58 -050083 std::list<ndn::Name>
84 getNames() const;
Nick Gordon56d1fae2017-05-26 16:39:25 -050085
86 bool
87 operator==(const NamePrefixList& other) const;
88
Nick Gordonf14ec352017-07-24 16:09:58 -050089 /*! Returns how many unique sources this name has.
akmhoque53353462014-04-22 08:43:45 -050090
Nick Gordonf14ec352017-07-24 16:09:58 -050091 \retval 0 if the name is not in the list, else the number of sources.
92 */
93 uint32_t
94 countSources(const ndn::Name& name) const;
95
96 /*! Returns the sources that this name has.
97
98 \retval an empty vector if the name is not in the list, else a
99 vector containing the sources.
100 */
101 const std::vector<std::string>
102 getSources(const ndn::Name& name) const;
103
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -0800104 void
105 clear()
106 {
107 m_names.clear();
108 }
109
Nick Gordonf14ec352017-07-24 16:09:58 -0500110private:
111 /*! Obtain an iterator to the entry matching name.
112
113 \note We could do this quite easily inline with a lambda, but this
114 is slightly more efficient.
115 */
116 std::vector<NamePair>::iterator
117 get(const ndn::Name& name);
118
119 /*! Obtain an iterator to a specific source in an entry
120 */
121 std::vector<std::string>::iterator
122 getSource(const std::string& source, std::vector<NamePair>::iterator& entry);
123
124 std::vector<NamePair> m_names;
akmhoque53353462014-04-22 08:43:45 -0500125};
126
Nick Gordon56d1fae2017-05-26 16:39:25 -0500127std::ostream&
128operator<<(std::ostream& os, const NamePrefixList& list);
129
Nick Gordonfad8e252016-08-11 14:21:38 -0500130} // namespace nlsr
akmhoque53353462014-04-22 08:43:45 -0500131
Nick Gordon56d1fae2017-05-26 16:39:25 -0500132#endif // NLSR_NAME_PREFIX_LIST_HPP