NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.5: NDN, CCN, CCNx, content centric networks
API Documentation
regex-matcher.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2013-2018 Regents of the University of California.
4  *
5  * This file is part of ndn-cxx library (NDN C++ library with eXperimental eXtensions).
6  *
7  * ndn-cxx library is free software: you can redistribute it and/or modify it under the
8  * terms of the GNU Lesser General Public License as published by the Free Software
9  * Foundation, either version 3 of the License, or (at your option) any later version.
10  *
11  * ndn-cxx library is distributed in the hope that it will be useful, but WITHOUT ANY
12  * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
13  * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
14  *
15  * You should have received copies of the GNU General Public License and GNU Lesser
16  * General Public License along with ndn-cxx, e.g., in COPYING.md file. If not, see
17  * <http://www.gnu.org/licenses/>.
18  *
19  * See AUTHORS.md for complete list of ndn-cxx authors and contributors.
20  *
21  * @author Yingdi Yu <http://irl.cs.ucla.edu/~yingdi/>
22  */
23 
25 
26 namespace ndn {
27 
28 RegexMatcher::RegexMatcher(const std::string& expr, const RegexExprType& type,
29  shared_ptr<RegexBackrefManager> backrefManager)
30  : m_expr(expr)
31  , m_type(type)
32 {
33  if (backrefManager)
34  m_backrefManager = std::move(backrefManager);
35  else
36  m_backrefManager = make_shared<RegexBackrefManager>();
37 }
38 
39 RegexMatcher::~RegexMatcher() = default;
40 
41 bool
42 RegexMatcher::match(const Name& name, size_t offset, size_t len)
43 {
44  m_matchResult.clear();
45 
46  if (recursiveMatch(0, name, offset, len)) {
47  for (size_t i = offset; i < offset + len; i++)
48  m_matchResult.push_back(name.get(i));
49  return true;
50  }
51 
52  return false;
53 }
54 
55 bool
56 RegexMatcher::recursiveMatch(size_t matcherNo, const Name& name, size_t offset, size_t len)
57 {
58  if (matcherNo >= m_matchers.size())
59  return len == 0;
60 
61  ssize_t tried = len;
62  auto matcher = m_matchers[matcherNo];
63 
64  while (tried >= 0) {
65  if (matcher->match(name, offset, tried) &&
66  recursiveMatch(matcherNo + 1, name, offset + tried, len - tried))
67  return true;
68  tried--;
69  }
70 
71  return false;
72 }
73 
74 std::ostream&
75 operator<<(std::ostream& os, const RegexMatcher& rm)
76 {
77  return os << rm.getExpr();
78 }
79 
80 } // namespace ndn
Copyright (c) 2011-2015 Regents of the University of California.
std::ostream & operator<<(std::ostream &os, const Data &data)
Definition: data.cpp:322
virtual ~RegexMatcher()
shared_ptr< RegexBackrefManager > m_backrefManager
std::vector< shared_ptr< RegexMatcher > > m_matchers
const std::string & getExpr() const
std::vector< name::Component > m_matchResult
Represents an absolute name.
Definition: name.hpp:43
virtual bool match(const Name &name, size_t offset, size_t len)
RegexMatcher(const std::string &expr, const RegexExprType &type, shared_ptr< RegexBackrefManager > backrefManager=nullptr)