NFD: Named Data Networking Forwarding Daemon 24.07-28-gdcc0e6e0
Loading...
Searching...
No Matches
strategy-info-host.hpp
Go to the documentation of this file.
1/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/*
3 * Copyright (c) 2014-2022, 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#ifndef NFD_DAEMON_TABLE_STRATEGY_INFO_HOST_HPP
27#define NFD_DAEMON_TABLE_STRATEGY_INFO_HOST_HPP
28
29#include "fw/strategy-info.hpp"
30
31#include <unordered_map>
32
33namespace nfd {
34
38{
39public:
44 template<typename T>
45 T*
47 {
48 static_assert(std::is_base_of_v<fw::StrategyInfo, T>);
49
50 auto it = m_items.find(T::getTypeId());
51 if (it == m_items.end()) {
52 return nullptr;
53 }
54 return static_cast<T*>(it->second.get());
55 }
56
62 template<typename T, typename ...A>
63 std::pair<T*, bool>
64 insertStrategyInfo(A&&... args)
65 {
66 static_assert(std::is_base_of_v<fw::StrategyInfo, T>);
67
68 auto& item = m_items[T::getTypeId()];
69 bool isNew = item == nullptr;
70 if (isNew) {
71 item = make_unique<T>(std::forward<A>(args)...);
72 }
73 return {static_cast<T*>(item.get()), isNew};
74 }
75
80 template<typename T>
81 size_t
83 {
84 static_assert(std::is_base_of_v<fw::StrategyInfo, T>);
85
86 return m_items.erase(T::getTypeId());
87 }
88
91 void
93 {
94 m_items.clear();
95 }
96
97private:
98 std::unordered_map<int, unique_ptr<fw::StrategyInfo>> m_items;
99};
100
101} // namespace nfd
102
103#endif // NFD_DAEMON_TABLE_STRATEGY_INFO_HOST_HPP
Base class for an entity onto which StrategyInfo items may be placed.
T * getStrategyInfo() const
Get a StrategyInfo item.
size_t eraseStrategyInfo()
Erase a StrategyInfo item.
void clearStrategyInfo()
Clear all StrategyInfo items.
std::pair< T *, bool > insertStrategyInfo(A &&... args)
Insert a StrategyInfo item.
Definition common.hpp:71