A Discrete-Event Network Simulator
API
node-container.cc
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2008 INRIA
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: Mathieu Lacage <mathieu.lacage@sophia.inria.fr>
19  */
20 #include "node-container.h"
21 #include "ns3/node-list.h"
22 #include "ns3/names.h"
23 
24 namespace ns3 {
25 
27 {
28 }
29 
31 {
32  m_nodes.push_back (node);
33 }
34 NodeContainer::NodeContainer (std::string nodeName)
35 {
36  Ptr<Node> node = Names::Find<Node> (nodeName);
37  m_nodes.push_back (node);
38 }
39 NodeContainer::NodeContainer (uint32_t n, uint32_t systemId /* = 0 */)
40 {
41  m_nodes.reserve (n);
42  Create (n, systemId);
43 }
45 {
46  Add (a);
47  Add (b);
48 }
50  const NodeContainer &c)
51 {
52  Add (a);
53  Add (b);
54  Add (c);
55 }
57  const NodeContainer &c, const NodeContainer &d)
58 {
59  Add (a);
60  Add (b);
61  Add (c);
62  Add (d);
63 }
64 
66  const NodeContainer &c, const NodeContainer &d,
67  const NodeContainer &e)
68 {
69  Add (a);
70  Add (b);
71  Add (c);
72  Add (d);
73  Add (e);
74 }
75 
78 {
79  return m_nodes.begin ();
80 }
82 NodeContainer::End (void) const
83 {
84  return m_nodes.end ();
85 }
86 
87 uint32_t
88 NodeContainer::GetN (void) const
89 {
90  return m_nodes.size ();
91 }
92 Ptr<Node>
93 NodeContainer::Get (uint32_t i) const
94 {
95  return m_nodes[i];
96 }
97 void
99 {
100  for (uint32_t i = 0; i < n; i++)
101  {
102  m_nodes.push_back (CreateObject<Node> ());
103  }
104 }
105 void
106 NodeContainer::Create (uint32_t n, uint32_t systemId)
107 {
108  for (uint32_t i = 0; i < n; i++)
109  {
110  m_nodes.push_back (CreateObject<Node> (systemId));
111  }
112 }
113 void
115 {
116  for (Iterator i = other.Begin (); i != other.End (); i++)
117  {
118  m_nodes.push_back (*i);
119  }
120 }
121 void
123 {
124  m_nodes.push_back (node);
125 }
126 void
127 NodeContainer::Add (std::string nodeName)
128 {
129  Ptr<Node> node = Names::Find<Node> (nodeName);
130  m_nodes.push_back (node);
131 }
132 
135 {
136  NodeContainer c;
137  for (NodeList::Iterator i = NodeList::Begin (); i != NodeList::End (); ++i)
138  {
139  c.Add (*i);
140  }
141  return c;
142 }
143 
144 bool
145 NodeContainer::Contains (uint32_t id) const
146 {
147  for (uint32_t i = 0; i < m_nodes.size (); i++)
148  {
149  if (m_nodes[i]->GetId () == id)
150  {
151  return true;
152  }
153  }
154  return false;
155 }
156 
157 } // namespace ns3
std::vector< Ptr< Node > >::const_iterator Iterator
Node container iterator.
std::vector< Ptr< Node > > m_nodes
Nodes smart pointers.
Iterator End(void) const
Get an iterator which indicates past-the-last Node in the container.
bool Contains(uint32_t id) const
Return true if container contains a Node with index id.
static Iterator End(void)
Definition: node-list.cc:235
uint32_t GetN(void) const
Get the number of Ptr<Node> stored in this container.
NodeContainer()
Create an empty NodeContainer.
Every class exported by the ns3 library is enclosed in the ns3 namespace.
keep track of a set of node pointers.
std::vector< Ptr< Node > >::const_iterator Iterator
Node container iterator.
Definition: node-list.h:44
static NodeContainer GetGlobal(void)
Create a NodeContainer that contains a list of all nodes created through NodeContainer::Create() and ...
void Add(NodeContainer other)
Append the contents of another NodeContainer to the end of this container.
static Iterator Begin(void)
Definition: node-list.cc:229
Ptr< Node > Get(uint32_t i) const
Get the Ptr<Node> stored in this container at a given index.
void Create(uint32_t n)
Create n nodes and append pointers to them to the end of this NodeContainer.
Iterator Begin(void) const
Get an iterator which refers to the first Node in the container.