SUMO - Simulation of Urban MObility
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
InstancePool.h
Go to the documentation of this file.
1 /****************************************************************************/
7 // A pool of resuable instances
8 /****************************************************************************/
9 // SUMO, Simulation of Urban MObility; see http://sumo-sim.org/
10 // Copyright (C) 2001-2014 DLR (http://www.dlr.de/) and contributors
11 /****************************************************************************/
12 //
13 // This file is part of SUMO.
14 // SUMO is free software: you can redistribute it and/or modify
15 // it under the terms of the GNU General Public License as published by
16 // the Free Software Foundation, either version 3 of the License, or
17 // (at your option) any later version.
18 //
19 /****************************************************************************/
20 #ifndef InstancePool_h
21 #define InstancePool_h
22 
23 
24 // ===========================================================================
25 // included modules
26 // ===========================================================================
27 #ifdef _MSC_VER
28 #include <windows_config.h>
29 #else
30 #include <config.h>
31 #endif
32 
33 #include <vector>
34 #include <algorithm>
35 
36 
37 // ===========================================================================
38 // class definitions
39 // ===========================================================================
44 template<typename T>
45 class InstancePool {
46 public:
51  InstancePool(bool deleteOnQuit) : myDeleteOnQuit(deleteOnQuit) { }
52 
53 
56  typedef typename std::vector<T*>::iterator It;
57  if (myDeleteOnQuit) {
58  for (It i = myFreeInstances.begin(); i != myFreeInstances.end(); i++) {
59  delete *i;
60  }
61  }
62  }
63 
64 
73  if (myFreeInstances.size() == 0) {
74  return 0;
75  } else {
76  T* instance = myFreeInstances.back();
77  myFreeInstances.pop_back();
78  return instance;
79  }
80  }
81 
82 
87  void addFreeInstance(T* instance) {
88  myFreeInstances.push_back(instance);
89  }
90 
91 
96  void addFreeInstances(const std::vector<T*> instances) {
97  std::copy(instances.begin(), instances.end(),
98  std::back_inserter(myFreeInstances));
99  }
100 
101 
102 private:
104  std::vector<T*> myFreeInstances;
105 
108 
109 
110 };
111 
112 
113 #endif
114 
115 /****************************************************************************/
116