Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 1 | /* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /* |
| 3 | * Copyright (c) 2011 University of California, Los Angeles |
| 4 | * |
| 5 | * This program is free software; you can redistribute it and/or modify |
| 6 | * it under the terms of the GNU General Public License version 2 as |
| 7 | * published by the Free Software Foundation; |
| 8 | * |
| 9 | * This program is distributed in the hope that it will be useful, |
| 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 12 | * GNU General Public License for more details. |
| 13 | * |
| 14 | * You should have received a copy of the GNU General Public License |
| 15 | * along with this program; if not, write to the Free Software |
| 16 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 17 | * |
| 18 | * Author: Alexander Afanasyev <alexander.afanasyev@ucla.edu> |
| 19 | */ |
| 20 | |
Alexander Afanasyev | 9a98970 | 2012-06-29 17:44:00 -0700 | [diff] [blame] | 21 | #ifndef TRIE_H_ |
| 22 | #define TRIE_H_ |
| 23 | |
| 24 | #include "ns3/ptr.h" |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 25 | |
| 26 | #include <boost/intrusive/unordered_set.hpp> |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 27 | #include <boost/intrusive/list.hpp> |
Alexander Afanasyev | 9a98970 | 2012-06-29 17:44:00 -0700 | [diff] [blame] | 28 | #include <boost/intrusive/set.hpp> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 29 | #include <boost/functional/hash.hpp> |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 30 | #include <boost/interprocess/smart_ptr/unique_ptr.hpp> |
| 31 | #include <boost/tuple/tuple.hpp> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 32 | |
Alexander Afanasyev | 30cb117 | 2012-07-06 10:47:39 -0700 | [diff] [blame] | 33 | namespace ndnSIM |
| 34 | { |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 35 | |
| 36 | ///////////////////////////////////////////////////// |
| 37 | // Allow customization for payload |
| 38 | // |
| 39 | template<typename Payload> |
| 40 | struct pointer_payload_traits |
| 41 | { |
Alexander Afanasyev | 9e96e36 | 2012-07-02 23:04:39 -0700 | [diff] [blame] | 42 | typedef Payload payload_type; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 43 | typedef Payload* pointer_type; |
| 44 | typedef const Payload* const_pointer_type; |
| 45 | |
| 46 | static const Payload* empty_payload; |
| 47 | }; |
| 48 | |
| 49 | template<typename Payload> |
| 50 | const Payload* |
| 51 | pointer_payload_traits<Payload>::empty_payload = 0; |
| 52 | |
| 53 | template<typename Payload> |
| 54 | struct smart_pointer_payload_traits |
| 55 | { |
Alexander Afanasyev | 9e96e36 | 2012-07-02 23:04:39 -0700 | [diff] [blame] | 56 | typedef Payload payload_type; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 57 | typedef ns3::Ptr<Payload> pointer_type; |
| 58 | typedef ns3::Ptr<const Payload> const_pointer_type; |
| 59 | |
| 60 | static const ns3::Ptr<const Payload> empty_payload; |
| 61 | }; |
| 62 | |
| 63 | template<typename Payload> |
| 64 | const ns3::Ptr<const Payload> |
| 65 | smart_pointer_payload_traits<Payload>::empty_payload = 0; |
| 66 | |
| 67 | |
| 68 | //////////////////////////////////////////////////// |
| 69 | // forward declarations |
| 70 | // |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 71 | template<typename FullKey, |
| 72 | typename Payload, |
Alexander Afanasyev | 9a98970 | 2012-06-29 17:44:00 -0700 | [diff] [blame] | 73 | typename PayloadTraits, |
| 74 | typename PolicyHook > |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 75 | class trie; |
| 76 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 77 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 78 | inline std::ostream& |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 79 | operator << (std::ostream &os, |
| 80 | const trie<FullKey, Payload, PayloadTraits, PolicyHook> &trie_node); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 81 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 82 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 83 | bool |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 84 | operator== (const trie<FullKey, Payload, PayloadTraits, PolicyHook> &a, |
| 85 | const trie<FullKey, Payload, PayloadTraits, PolicyHook> &b); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 86 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 87 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook > |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 88 | std::size_t |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 89 | hash_value (const trie<FullKey, Payload, PayloadTraits, PolicyHook> &trie_node); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 90 | |
| 91 | /////////////////////////////////////////////////// |
| 92 | // actual definition |
| 93 | // |
| 94 | |
| 95 | |
| 96 | template<typename FullKey, |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 97 | typename Payload, typename PayloadTraits, |
| 98 | typename PolicyHook > |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 99 | class trie |
| 100 | { |
| 101 | public: |
| 102 | typedef typename FullKey::partial_type Key; |
| 103 | |
| 104 | typedef trie* iterator; |
| 105 | typedef const trie* const_iterator; |
| 106 | |
| 107 | inline |
| 108 | trie (const Key &key, size_t bucketSize = 10, size_t bucketIncrement = 10); |
| 109 | |
| 110 | inline |
| 111 | ~trie (); |
| 112 | |
| 113 | // actual entry |
| 114 | friend bool |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 115 | operator== <> (const trie<FullKey, Payload, PayloadTraits, PolicyHook> &a, |
| 116 | const trie<FullKey, Payload, PayloadTraits, PolicyHook> &b); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 117 | |
| 118 | friend std::size_t |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 119 | hash_value <> (const trie<FullKey, Payload, PayloadTraits, PolicyHook> &trie_node); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 120 | |
| 121 | inline std::pair<iterator, bool> |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 122 | insert (const FullKey &key, |
| 123 | typename PayloadTraits::const_pointer_type payload); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 124 | |
| 125 | /** |
| 126 | * @brief Removes payload (if it exists) and if there are no children, prunes parents trie |
| 127 | */ |
| 128 | inline void |
| 129 | erase (); |
| 130 | |
| 131 | /** |
| 132 | * @brief Do exactly as erase, but without erasing the payload |
| 133 | */ |
| 134 | inline void |
| 135 | prune (); |
| 136 | |
| 137 | /** |
| 138 | * @brief Perform the longest prefix match |
| 139 | * @param key the key for which to perform the longest prefix match |
| 140 | * |
| 141 | * @return ->second is true if prefix in ->first is longer than key |
| 142 | */ |
| 143 | inline boost::tuple<iterator, bool, iterator> |
| 144 | find (const FullKey &key); |
| 145 | |
| 146 | /** |
| 147 | * @brief Find next payload of the sub-trie |
| 148 | * @returns end() or a valid iterator pointing to the trie leaf (order is not defined, enumeration ) |
| 149 | */ |
| 150 | inline iterator |
| 151 | find (); |
| 152 | |
| 153 | /** |
| 154 | * @brief Find next payload of the sub-trie satisfying the predicate |
| 155 | * @param pred predicate |
| 156 | * @returns end() or a valid iterator pointing to the trie leaf (order is not defined, enumeration ) |
| 157 | */ |
| 158 | template<class Predicate> |
| 159 | inline iterator |
| 160 | find_if (Predicate pred); |
| 161 | |
| 162 | iterator end () |
| 163 | { |
| 164 | return 0; |
| 165 | } |
| 166 | |
| 167 | const_iterator end () const |
| 168 | { |
| 169 | return 0; |
| 170 | } |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 171 | |
| 172 | typename PayloadTraits::const_pointer_type |
| 173 | payload () const |
| 174 | { |
| 175 | return payload_; |
| 176 | } |
| 177 | |
| 178 | void |
| 179 | set_payload (typename PayloadTraits::const_pointer_type payload) |
| 180 | { |
| 181 | payload_ = payload; |
| 182 | } |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 183 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 184 | inline void |
| 185 | PrintStat (std::ostream &os) const; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 186 | |
| 187 | private: |
| 188 | //The disposer object function |
| 189 | struct trie_delete_disposer |
| 190 | { |
| 191 | void operator() (trie *delete_this) |
| 192 | { |
| 193 | // std::cout << "Deleting " << delete_this << "\n"; |
| 194 | delete delete_this; |
| 195 | } |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 196 | }; |
| 197 | |
| 198 | template<class D> |
| 199 | struct array_disposer |
| 200 | { |
| 201 | void operator() (D *array) |
| 202 | { |
| 203 | delete [] array; |
| 204 | } |
| 205 | }; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 206 | |
| 207 | friend |
| 208 | std::ostream& |
| 209 | operator<< < > (std::ostream &os, const trie &trie_node); |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 210 | |
| 211 | public: |
| 212 | PolicyHook policy_hook_; |
| 213 | |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 214 | private: |
Alexander Afanasyev | 30cb117 | 2012-07-06 10:47:39 -0700 | [diff] [blame] | 215 | boost::intrusive::unordered_set_member_hook<> unordered_set_member_hook_; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 216 | |
| 217 | // necessary typedefs |
| 218 | typedef trie self_type; |
Alexander Afanasyev | 30cb117 | 2012-07-06 10:47:39 -0700 | [diff] [blame] | 219 | typedef boost::intrusive::member_hook< trie, |
| 220 | boost::intrusive::unordered_set_member_hook< >, |
| 221 | &trie::unordered_set_member_hook_ > member_hook; |
| 222 | typedef boost::intrusive::unordered_set< trie, member_hook > unordered_set; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 223 | typedef typename unordered_set::bucket_type bucket_type; |
| 224 | typedef typename unordered_set::bucket_traits bucket_traits; |
| 225 | |
| 226 | //////////////////////////////////////////////// |
| 227 | // Actual data |
| 228 | //////////////////////////////////////////////// |
| 229 | |
| 230 | Key key_; ///< name component |
| 231 | |
| 232 | size_t initialBucketSize_; |
| 233 | size_t bucketIncrement_; |
| 234 | |
| 235 | size_t bucketSize_; |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 236 | typedef boost::interprocess::unique_ptr< bucket_type, array_disposer<bucket_type> > buckets_array; |
| 237 | buckets_array buckets_; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 238 | unordered_set children_; |
| 239 | |
| 240 | typename PayloadTraits::const_pointer_type payload_; |
| 241 | trie *parent_; // to make cleaning effective |
| 242 | }; |
| 243 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 244 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
| 245 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 246 | ::trie (const trie::Key &key, size_t bucketSize, size_t bucketIncrement) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 247 | : key_ (key) |
| 248 | , initialBucketSize_ (bucketSize) |
| 249 | , bucketIncrement_ (bucketIncrement) |
| 250 | , bucketSize_ (initialBucketSize_) |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 251 | , buckets_ (new bucket_type [bucketSize_]) //cannot use normal pointer, because lifetime of buckets should be larger than lifetime of the container |
| 252 | , children_ (bucket_traits (buckets_.get (), bucketSize_)) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 253 | , payload_ (PayloadTraits::empty_payload) |
| 254 | , parent_ (0) |
| 255 | { |
| 256 | } |
| 257 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 258 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
| 259 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 260 | ::~trie () |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 261 | { |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 262 | payload_ = PayloadTraits::empty_payload; // necessary for smart pointers... |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 263 | children_.clear_and_dispose (trie_delete_disposer ()); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 264 | } |
| 265 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 266 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 267 | inline |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 268 | std::pair<typename trie<FullKey, Payload, PayloadTraits, PolicyHook>::iterator, bool> |
| 269 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 270 | ::insert (const FullKey &key, typename PayloadTraits::const_pointer_type payload) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 271 | { |
| 272 | trie *trieNode = this; |
| 273 | |
| 274 | BOOST_FOREACH (const Key &subkey, key) |
| 275 | { |
| 276 | typename unordered_set::iterator item = trieNode->children_.find (subkey); |
| 277 | if (item == trieNode->children_.end ()) |
| 278 | { |
| 279 | trie *newNode = new trie (subkey, initialBucketSize_, bucketIncrement_); |
| 280 | // std::cout << "new " << newNode << "\n"; |
| 281 | newNode->parent_ = trieNode; |
| 282 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 283 | if (trieNode->children_.size () >= trieNode->bucketSize_) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 284 | { |
| 285 | trieNode->bucketSize_ += trieNode->bucketIncrement_; |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 286 | buckets_array newBuckets (new bucket_type [trieNode->bucketSize_]); |
| 287 | trieNode->children_.rehash (bucket_traits (newBuckets.get (), trieNode->bucketSize_)); |
| 288 | trieNode->buckets_.swap (newBuckets); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 289 | } |
| 290 | |
| 291 | std::pair< typename unordered_set::iterator, bool > ret = |
| 292 | trieNode->children_.insert (*newNode); |
| 293 | |
| 294 | trieNode = &(*ret.first); |
| 295 | } |
| 296 | else |
| 297 | trieNode = &(*item); |
| 298 | } |
| 299 | |
| 300 | if (trieNode->payload_ == 0) |
| 301 | { |
| 302 | trieNode->payload_ = payload; |
| 303 | return std::make_pair (trieNode, true); |
| 304 | } |
| 305 | else |
| 306 | return std::make_pair (trieNode, false); |
| 307 | } |
| 308 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 309 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 310 | inline |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 311 | boost::tuple<typename trie<FullKey, Payload, PayloadTraits, PolicyHook>::iterator, |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 312 | bool, |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 313 | typename trie<FullKey, Payload, PayloadTraits, PolicyHook>::iterator> |
| 314 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 315 | ::find (const FullKey &key) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 316 | { |
| 317 | trie *trieNode = this; |
| 318 | iterator foundNode = (payload_ != PayloadTraits::empty_payload) ? this : 0; |
| 319 | bool reachLast = true; |
| 320 | |
| 321 | BOOST_FOREACH (const Key &subkey, key) |
| 322 | { |
| 323 | typename unordered_set::iterator item = trieNode->children_.find (subkey); |
| 324 | if (item == trieNode->children_.end ()) |
| 325 | { |
| 326 | reachLast = false; |
| 327 | break; |
| 328 | } |
| 329 | else |
| 330 | { |
| 331 | trieNode = &(*item); |
| 332 | |
| 333 | if (trieNode->payload_ != PayloadTraits::empty_payload) |
| 334 | foundNode = trieNode; |
| 335 | } |
| 336 | } |
| 337 | |
| 338 | return boost::make_tuple (foundNode, reachLast, trieNode); |
| 339 | } |
| 340 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 341 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
| 342 | inline typename trie<FullKey, Payload, PayloadTraits, PolicyHook>::iterator |
| 343 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 344 | ::find () |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 345 | { |
| 346 | if (payload_ != PayloadTraits::empty_payload) |
| 347 | return this; |
| 348 | |
Alexander Afanasyev | 9a98970 | 2012-06-29 17:44:00 -0700 | [diff] [blame] | 349 | typedef trie<FullKey, Payload, PayloadTraits, PolicyHook> trie; |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 350 | for (typename trie::unordered_set::iterator subnode = children_.begin (); |
| 351 | subnode != children_.end (); |
| 352 | subnode++ ) |
| 353 | // BOOST_FOREACH (trie &subnode, children_) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 354 | { |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 355 | iterator value = subnode->find (); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 356 | if (value != 0) |
| 357 | return value; |
| 358 | } |
| 359 | |
| 360 | return 0; |
| 361 | } |
| 362 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 363 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 364 | template<class Predicate> |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 365 | inline typename trie<FullKey, Payload, PayloadTraits, PolicyHook>::iterator |
| 366 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 367 | ::find_if (Predicate pred) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 368 | { |
| 369 | if (payload_ != PayloadTraits::empty_payload && pred (payload_)) |
| 370 | return this; |
| 371 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 372 | typedef trie<FullKey, Payload, PayloadTraits, PolicyHook> trie; |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 373 | for (typename trie::unordered_set::iterator subnode = children_.begin (); |
| 374 | subnode != children_.end (); |
| 375 | subnode++ ) |
| 376 | // BOOST_FOREACH (const trie &subnode, children_) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 377 | { |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 378 | iterator value = subnode->find (); |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 379 | if (value != 0) |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 380 | return value; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 381 | } |
| 382 | |
| 383 | return 0; |
| 384 | } |
| 385 | |
| 386 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 387 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 388 | inline void |
Alexander Afanasyev | b0c4389 | 2012-06-13 00:52:58 -0700 | [diff] [blame] | 389 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 390 | ::erase () |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 391 | { |
| 392 | payload_ = PayloadTraits::empty_payload; |
| 393 | prune (); |
| 394 | } |
| 395 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 396 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 397 | inline void |
Alexander Afanasyev | b0c4389 | 2012-06-13 00:52:58 -0700 | [diff] [blame] | 398 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 399 | ::prune () |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 400 | { |
| 401 | if (payload_ == 0 && children_.size () == 0) |
| 402 | { |
| 403 | if (parent_ == 0) return; |
| 404 | |
| 405 | trie *parent = parent_; |
| 406 | parent->children_.erase_and_dispose (*this, trie_delete_disposer ()); // delete this; basically, committing a suicide |
| 407 | |
| 408 | parent->prune (); |
| 409 | } |
| 410 | } |
| 411 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 412 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 413 | inline std::ostream& |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 414 | operator << (std::ostream &os, const trie<FullKey, Payload, PayloadTraits, PolicyHook> &trie_node) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 415 | { |
| 416 | os << "# " << trie_node.key_ << ((trie_node.payload_ != 0)?"*":"") << std::endl; |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 417 | typedef trie<FullKey, Payload, PayloadTraits, PolicyHook> trie; |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 418 | |
| 419 | for (typename trie::unordered_set::const_iterator subnode = trie_node.children_.begin (); |
| 420 | subnode != trie_node.children_.end (); |
| 421 | subnode++ ) |
| 422 | // BOOST_FOREACH (const trie &subnode, trie_node.children_) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 423 | { |
| 424 | os << "\"" << &trie_node << "\"" << " [label=\"" << trie_node.key_ << ((trie_node.payload_ != 0)?"*":"") << "\"]\n"; |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 425 | os << "\"" << &(*subnode) << "\"" << " [label=\"" << subnode->key_ << ((subnode->payload_ != 0)?"*":"") << "\"]""\n"; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 426 | |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 427 | os << "\"" << &trie_node << "\"" << " -> " << "\"" << &(*subnode) << "\"" << "\n"; |
| 428 | os << *subnode; |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 429 | } |
| 430 | |
| 431 | return os; |
| 432 | } |
| 433 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 434 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
| 435 | inline void |
Alexander Afanasyev | b0c4389 | 2012-06-13 00:52:58 -0700 | [diff] [blame] | 436 | trie<FullKey, Payload, PayloadTraits, PolicyHook> |
| 437 | ::PrintStat (std::ostream &os) const |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 438 | { |
| 439 | os << "# " << key_ << ((payload_ != 0)?"*":"") << ": " << children_.size() << " children" << std::endl; |
| 440 | for (size_t bucket = 0, maxbucket = children_.bucket_count (); |
| 441 | bucket < maxbucket; |
| 442 | bucket++) |
| 443 | { |
| 444 | os << " " << children_.bucket_size (bucket); |
| 445 | } |
| 446 | os << "\n"; |
| 447 | |
| 448 | typedef trie<FullKey, Payload, PayloadTraits, PolicyHook> trie; |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 449 | for (typename trie::unordered_set::const_iterator subnode = children_.begin (); |
| 450 | subnode != children_.end (); |
| 451 | subnode++ ) |
| 452 | // BOOST_FOREACH (const trie &subnode, children_) |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 453 | { |
Alexander Afanasyev | 051d378 | 2012-07-03 10:10:15 -0700 | [diff] [blame] | 454 | subnode->PrintStat (os); |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 455 | } |
| 456 | } |
| 457 | |
| 458 | |
| 459 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 460 | inline bool |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 461 | operator == (const trie<FullKey, Payload, PayloadTraits, PolicyHook> &a, |
| 462 | const trie<FullKey, Payload, PayloadTraits, PolicyHook> &b) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 463 | { |
| 464 | return a.key_ == b.key_; |
| 465 | } |
| 466 | |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 467 | template<typename FullKey, typename Payload, typename PayloadTraits, typename PolicyHook> |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 468 | inline std::size_t |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 469 | hash_value (const trie<FullKey, Payload, PayloadTraits, PolicyHook> &trie_node) |
Alexander Afanasyev | fd0c41c | 2012-06-11 22:15:49 -0700 | [diff] [blame] | 470 | { |
| 471 | return boost::hash_value (trie_node.key_); |
| 472 | } |
Alexander Afanasyev | 89fb535 | 2012-06-12 22:43:16 -0700 | [diff] [blame] | 473 | |
Alexander Afanasyev | 30cb117 | 2012-07-06 10:47:39 -0700 | [diff] [blame] | 474 | } // ndnSIM |
| 475 | |
Alexander Afanasyev | 9a98970 | 2012-06-29 17:44:00 -0700 | [diff] [blame] | 476 | #endif // TRIE_H_ |