blob: 0be579fdca6ca1ce351e9f6f53c1aac3b09e9171 [file] [log] [blame]
akmhoque3d06e792014-05-27 16:23:20 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
3 * Copyright (c) 2014 University of Memphis,
4 * Regents of the University of California
5 *
6 * This file is part of NLSR (Named-data Link State Routing).
7 * See AUTHORS.md for complete list of NLSR authors and contributors.
8 *
9 * NLSR is free software: you can redistribute it and/or modify it under the terms
10 * of the GNU General Public License as published by the Free Software Foundation,
11 * either version 3 of the License, or (at your option) any later version.
12 *
13 * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
14 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along with
18 * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
19 *
20 * \author A K M Mahmudul Hoque <ahoque1@memphis.edu>
21 *
22 **/
akmhoque53353462014-04-22 08:43:45 -050023#include <iostream>
24#include <algorithm>
25
akmhoquec8a10f72014-04-25 18:42:55 -050026#include <ndn-cxx/common.hpp>
27
28#include "name-prefix-list.hpp"
akmhoque674b0b12014-05-20 14:33:28 -050029#include "logger.hpp"
akmhoque53353462014-04-22 08:43:45 -050030
31namespace nlsr {
32
akmhoque674b0b12014-05-20 14:33:28 -050033INIT_LOGGER("NamePrefixList");
34
akmhoque53353462014-04-22 08:43:45 -050035using namespace std;
36
akmhoquec8a10f72014-04-25 18:42:55 -050037NamePrefixList::NamePrefixList()
akmhoque53353462014-04-22 08:43:45 -050038{
39}
40
akmhoquec8a10f72014-04-25 18:42:55 -050041NamePrefixList::~NamePrefixList()
akmhoque53353462014-04-22 08:43:45 -050042{
43}
44
45static bool
akmhoque31d1d4b2014-05-05 22:08:14 -050046nameCompare(const ndn::Name& name1, const ndn::Name& name2)
akmhoque53353462014-04-22 08:43:45 -050047{
akmhoque31d1d4b2014-05-05 22:08:14 -050048 return name1 == name2;
akmhoque53353462014-04-22 08:43:45 -050049}
50
akmhoquefdbddb12014-05-02 18:35:19 -050051int32_t
akmhoque31d1d4b2014-05-05 22:08:14 -050052NamePrefixList::insert(const ndn::Name& name)
akmhoque53353462014-04-22 08:43:45 -050053{
akmhoque31d1d4b2014-05-05 22:08:14 -050054 std::list<ndn::Name>::iterator it = std::find_if(m_nameList.begin(),
55 m_nameList.end(),
56 ndn::bind(&nameCompare, _1 ,
57 ndn::cref(name)));
akmhoque157b0a42014-05-13 00:26:37 -050058 if (it != m_nameList.end()) {
akmhoque53353462014-04-22 08:43:45 -050059 return -1;
60 }
61 m_nameList.push_back(name);
62 return 0;
63}
64
akmhoquefdbddb12014-05-02 18:35:19 -050065int32_t
akmhoque31d1d4b2014-05-05 22:08:14 -050066NamePrefixList::remove(const ndn::Name& name)
akmhoque53353462014-04-22 08:43:45 -050067{
akmhoque31d1d4b2014-05-05 22:08:14 -050068 std::list<ndn::Name>::iterator it = std::find_if(m_nameList.begin(),
69 m_nameList.end(),
70 ndn::bind(&nameCompare, _1 ,
71 ndn::cref(name)));
akmhoque157b0a42014-05-13 00:26:37 -050072 if (it != m_nameList.end()) {
akmhoque53353462014-04-22 08:43:45 -050073 m_nameList.erase(it);
74 }
75 return -1;
76}
77
78void
akmhoquec8a10f72014-04-25 18:42:55 -050079NamePrefixList::sort()
akmhoque53353462014-04-22 08:43:45 -050080{
81 m_nameList.sort();
82}
83
84void
akmhoque674b0b12014-05-20 14:33:28 -050085NamePrefixList::writeLog()
86{
87 _LOG_DEBUG("-------Name Prefix List--------");
88 int i = 1;
89 for (std::list<ndn::Name>::iterator it = m_nameList.begin();
90 it != m_nameList.end(); it++) {
91 _LOG_DEBUG("Name " << i << " : " << (*it));
92 i++;
93 }
94}
95
akmhoque53353462014-04-22 08:43:45 -050096}//namespace nlsr