A Discrete-Event Network Simulator
API
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
propagation-cache.h
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2012 Telum (www.telum.ru)
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: Kirill Andreev <andreev@telum.ru>
19  */
20 #ifndef PROPAGATION_CACHE_H_
21 #define PROPAGATION_CACHE_H_
22 
23 #include "ns3/mobility-model.h"
24 #include <map>
25 
26 namespace ns3
27 {
34 template<class T>
36 {
37 public:
41  {
42  PropagationPathIdentifier key = PropagationPathIdentifier (a, b, modelUid);
43  typename PathCache::iterator it = m_pathCache.find (key);
44  if (it == m_pathCache.end ())
45  {
46  return 0;
47  }
48  return it->second;
49  };
51  {
52  PropagationPathIdentifier key = PropagationPathIdentifier (a, b, modelUid);
53  NS_ASSERT (m_pathCache.find (key) == m_pathCache.end ());
54  m_pathCache.insert (std::make_pair (key, data));
55  };
56 private:
59  {
62  {};
66  bool operator < (const PropagationPathIdentifier & other) const
67  {
69  {
71  }
73  if (std::min (m_dstMobility, m_srcMobility) != std::min (other.m_dstMobility, other.m_srcMobility))
74  {
75  return std::min (m_dstMobility, m_srcMobility) < std::min (other.m_dstMobility, other.m_srcMobility);
76  }
77  if (std::max (m_dstMobility, m_srcMobility) != std::max (other.m_dstMobility, other.m_srcMobility))
78  {
79  return std::max (m_dstMobility, m_srcMobility) < std::max (other.m_dstMobility, other.m_srcMobility);
80  }
81  return false;
82  }
83  };
84  typedef std::map<PropagationPathIdentifier, Ptr<T> > PathCache;
85 private:
87 };
88 } // namespace ns3
89 
90 #endif // PROPAGATION_CACHE_H_
smart pointer class similar to boost::intrusive_ptr
Definition: ptr.h:60
std::map< PropagationPathIdentifier, Ptr< T > > PathCache
#define NS_ASSERT(condition)
At runtime, in debugging builds, if this condition is not true, the program prints the source file...
Definition: assert.h:61
Ptr< T > GetPathData(Ptr< const MobilityModel > a, Ptr< const MobilityModel > b, uint32_t modelUid)
bool operator<(const PropagationPathIdentifier &other) const
uint8_t data[writeSize]
void AddPathData(Ptr< T > data, Ptr< const MobilityModel > a, Ptr< const MobilityModel > b, uint32_t modelUid)
Constructs a cache of objects, where each obect is responsible for a single propagation path loss cal...
PropagationPathIdentifier(Ptr< const MobilityModel > a, Ptr< const MobilityModel > b, uint32_t modelUid)