NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.5: NDN, CCN, CCNx, content centric networks
API Documentation
pit-iterator.cpp
Go to the documentation of this file.
1
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2
/*
3
* Copyright (c) 2014-2018, 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
#include "
pit-iterator.hpp
"
27
28
#include <
ndn-cxx/util/concepts.hpp
>
29
30
namespace
nfd
{
31
namespace
pit {
32
33
NDN_CXX_ASSERT_FORWARD_ITERATOR
(Iterator);
34
35
Iterator::Iterator
(
const
NameTree::const_iterator
& ntIt,
size_t
iPitEntry)
36
: m_ntIt(ntIt)
37
, m_iPitEntry(iPitEntry)
38
{
39
}
40
41
Iterator
&
42
Iterator::operator++
()
43
{
44
BOOST_ASSERT(m_ntIt !=
NameTree::const_iterator
());
45
BOOST_ASSERT(m_iPitEntry < m_ntIt->getPitEntries().
size
());
46
47
if
(++m_iPitEntry >= m_ntIt->
getPitEntries
().size()) {
48
++m_ntIt;
49
m_iPitEntry = 0;
50
BOOST_ASSERT(m_ntIt ==
NameTree::const_iterator
() || m_ntIt->
hasPitEntries
());
51
}
52
53
return
*
this
;
54
}
55
56
Iterator
57
Iterator::operator++
(
int
)
58
{
59
Iterator
copy = *
this
;
60
this->
operator++
();
61
return
copy;
62
}
63
64
}
// namespace pit
65
}
// namespace nfd
pit-iterator.hpp
nfd::pit::Iterator::Iterator
Iterator(const NameTree::const_iterator &ntIt=NameTree::const_iterator(), size_t iPitEntry=0)
constructor
Definition:
pit-iterator.cpp:35
nfd::name_tree::Entry::getPitEntries
const std::vector< shared_ptr< pit::Entry > > & getPitEntries() const
Definition:
name-tree-entry.hpp:125
nfd::pit::Iterator
PIT iterator.
Definition:
pit-iterator.hpp:37
nfd::pit::NDN_CXX_ASSERT_FORWARD_ITERATOR
NDN_CXX_ASSERT_FORWARD_ITERATOR(Iterator)
nfd
Copyright (c) 2011-2015 Regents of the University of California.
Definition:
ndn-common.hpp:39
nfd::name_tree::Iterator
NameTree iterator.
Definition:
name-tree-iterator.hpp:72
concepts.hpp
nfd::name_tree::Entry::hasPitEntries
bool hasPitEntries() const
Definition:
name-tree-entry.hpp:119
nonstd::span_lite::size
span_constexpr std::size_t size(span< T, Extent > const &spn)
Definition:
span-lite.hpp:1535
nfd::pit::Iterator::operator++
Iterator & operator++()
Definition:
pit-iterator.cpp:42
ndnSIM
NFD
daemon
table
pit-iterator.cpp
Generated on Fri May 6 2022 12:34:14 for ndnSIM by
1.8.13