blob: 46eb0d0aac338c29a434fad4bbdc12cc85cadd42 [file] [log] [blame]
akmhoque3d06e792014-05-27 16:23:20 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -04002/*
3 * Copyright (c) 2014-2022, 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/>.
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040020 */
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
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040027#include <initializer_list>
akmhoque53353462014-04-22 08:43:45 -050028#include <list>
29#include <string>
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040030#include <tuple>
31#include <vector>
32
akmhoque31d1d4b2014-05-05 22:08:14 -050033#include <ndn-cxx/name.hpp>
akmhoquec8a10f72014-04-25 18:42:55 -050034
akmhoque53353462014-04-22 08:43:45 -050035namespace nlsr {
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080036
akmhoquec8a10f72014-04-25 18:42:55 -050037class NamePrefixList
akmhoque53353462014-04-22 08:43:45 -050038{
akmhoque53353462014-04-22 08:43:45 -050039public:
Nick Gordonf14ec352017-07-24 16:09:58 -050040 using NamePair = std::tuple<ndn::Name, std::vector<std::string>>;
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040041
Nick Gordonf14ec352017-07-24 16:09:58 -050042 enum NamePairIndex {
43 NAME,
44 SOURCES
45 };
46
akmhoquec8a10f72014-04-25 18:42:55 -050047 NamePrefixList();
akmhoque53353462014-04-22 08:43:45 -050048
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040049 explicit
50 NamePrefixList(ndn::span<const ndn::Name> names);
Nick Gordon96861ca2017-10-17 18:25:21 -050051
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040052#ifdef WITH_TESTS
53 NamePrefixList(std::initializer_list<ndn::Name> names)
54 : NamePrefixList(ndn::span<const ndn::Name>(names))
Nick Gordon96861ca2017-10-17 18:25:21 -050055 {
Nick Gordon96861ca2017-10-17 18:25:21 -050056 }
57
Davide Pesaventoc1d0e8e2022-06-15 14:26:02 -040058 NamePrefixList(std::initializer_list<NamePair> namesAndSources)
59 : m_names(namesAndSources)
60 {
61 }
62#endif
akmhoque53353462014-04-22 08:43:45 -050063
Nick G97e34942016-07-11 14:46:27 -050064 /*! \brief inserts name into NamePrefixList
65 \retval true If the name was successfully inserted.
66 \retval false If the name could not be inserted.
alvy297f4162015-03-03 17:15:33 -060067 */
68 bool
Nick Gordonf14ec352017-07-24 16:09:58 -050069 insert(const ndn::Name& name, const std::string& source = "");
akmhoque53353462014-04-22 08:43:45 -050070
Nick G97e34942016-07-11 14:46:27 -050071 /*! \brief removes name from NamePrefixList
72 \retval true If the name is removed
73 \retval false If the name failed to be removed.
alvy297f4162015-03-03 17:15:33 -060074 */
75 bool
Nick Gordonf14ec352017-07-24 16:09:58 -050076 remove(const ndn::Name& name, const std::string& source = "");
akmhoque53353462014-04-22 08:43:45 -050077
78 void
79 sort();
80
akmhoque31d1d4b2014-05-05 22:08:14 -050081 size_t
Nick Gordonff9a6272017-10-12 13:38:29 -050082 size() const
akmhoque53353462014-04-22 08:43:45 -050083 {
Nick Gordonf14ec352017-07-24 16:09:58 -050084 return m_names.size();
akmhoque53353462014-04-22 08:43:45 -050085 }
86
Nick Gordonf14ec352017-07-24 16:09:58 -050087 std::list<ndn::Name>
88 getNames() const;
Nick Gordon56d1fae2017-05-26 16:39:25 -050089
90 bool
91 operator==(const NamePrefixList& other) const;
92
Nick Gordonf14ec352017-07-24 16:09:58 -050093 /*! Returns how many unique sources this name has.
akmhoque53353462014-04-22 08:43:45 -050094
Nick Gordonf14ec352017-07-24 16:09:58 -050095 \retval 0 if the name is not in the list, else the number of sources.
96 */
97 uint32_t
98 countSources(const ndn::Name& name) const;
99
100 /*! Returns the sources that this name has.
101
102 \retval an empty vector if the name is not in the list, else a
103 vector containing the sources.
104 */
105 const std::vector<std::string>
106 getSources(const ndn::Name& name) const;
107
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -0800108 void
109 clear()
110 {
111 m_names.clear();
112 }
113
Nick Gordonf14ec352017-07-24 16:09:58 -0500114private:
115 /*! Obtain an iterator to the entry matching name.
116
117 \note We could do this quite easily inline with a lambda, but this
118 is slightly more efficient.
119 */
120 std::vector<NamePair>::iterator
121 get(const ndn::Name& name);
122
123 /*! Obtain an iterator to a specific source in an entry
124 */
125 std::vector<std::string>::iterator
126 getSource(const std::string& source, std::vector<NamePair>::iterator& entry);
127
128 std::vector<NamePair> m_names;
akmhoque53353462014-04-22 08:43:45 -0500129};
130
Nick Gordon56d1fae2017-05-26 16:39:25 -0500131std::ostream&
132operator<<(std::ostream& os, const NamePrefixList& list);
133
Nick Gordonfad8e252016-08-11 14:21:38 -0500134} // namespace nlsr
akmhoque53353462014-04-22 08:43:45 -0500135
Nick Gordon56d1fae2017-05-26 16:39:25 -0500136#endif // NLSR_NAME_PREFIX_LIST_HPP