NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.3: NDN, CCN, CCNx, content centric networks
API Documentation
interest-filter.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
22 #include "interest-filter.hpp"
24 
25 namespace ndn {
26 
28  : m_prefix(prefix)
29 {
30 }
31 
32 InterestFilter::InterestFilter(const char* prefixUri)
33  : m_prefix(prefixUri)
34 {
35 }
36 
37 InterestFilter::InterestFilter(const std::string& prefixUri)
38  : m_prefix(prefixUri)
39 {
40 }
41 
42 InterestFilter::InterestFilter(const Name& prefix, const std::string& regexFilter)
43  : m_prefix(prefix)
44  , m_regexFilter(make_shared<RegexPatternListMatcher>(regexFilter, nullptr))
45 {
46 }
47 
48 InterestFilter::operator const Name&() const
49 {
50  if (hasRegexFilter()) {
51  BOOST_THROW_EXCEPTION(Error("Please update InterestCallback to accept const InterestFilter&"
52  " (non-trivial InterestFilter is being used)"));
53  }
54  return m_prefix;
55 }
56 
57 bool
59 {
60  return m_prefix.isPrefixOf(name) &&
61  (!hasRegexFilter() ||
62  m_regexFilter->match(name, m_prefix.size(), name.size() - m_prefix.size()));
63 }
64 
65 std::ostream&
66 operator<<(std::ostream& os, const InterestFilter& filter)
67 {
68  os << filter.getPrefix();
69  if (filter.hasRegexFilter()) {
70  os << "?regex=" << filter.getRegexFilter();
71  }
72  return os;
73 }
74 
75 } // namespace ndn
Copyright (c) 2011-2015 Regents of the University of California.
const Name & getPrefix() const
std::ostream & operator<<(std::ostream &os, const Data &data)
Definition: data.cpp:320
declares the set of Interests a producer can serve, which starts with a name prefix, plus an optional regular expression
bool doesMatch(const Name &name) const
Check if specified Interest name matches the filter.
const RegexPatternListMatcher & getRegexFilter() const
Name abstraction to represent an absolute name.
Definition: name.hpp:46
bool isPrefixOf(const Name &name) const
Check if the N components of this name are the same as the first N components of the given name...
Definition: name.cpp:308
bool hasRegexFilter() const
size_t size() const
Get the number of components.
Definition: name.hpp:400
InterestFilter(const Name &prefix)
Construct an InterestFilter to match Interests by prefix.