Line data Source code
1 : // EnergyPlus, Copyright (c) 1996-2023, The Board of Trustees of the University of Illinois,
2 : // The Regents of the University of California, through Lawrence Berkeley National Laboratory
3 : // (subject to receipt of any required approvals from the U.S. Dept. of Energy), Oak Ridge
4 : // National Laboratory, managed by UT-Battelle, Alliance for Sustainable Energy, LLC, and other
5 : // contributors. All rights reserved.
6 : //
7 : // NOTICE: This Software was developed under funding from the U.S. Department of Energy and the
8 : // U.S. Government consequently retains certain rights. As such, the U.S. Government has been
9 : // granted for itself and others acting on its behalf a paid-up, nonexclusive, irrevocable,
10 : // worldwide license in the Software to reproduce, distribute copies to the public, prepare
11 : // derivative works, and perform publicly and display publicly, and to permit others to do so.
12 : //
13 : // Redistribution and use in source and binary forms, with or without modification, are permitted
14 : // provided that the following conditions are met:
15 : //
16 : // (1) Redistributions of source code must retain the above copyright notice, this list of
17 : // conditions and the following disclaimer.
18 : //
19 : // (2) Redistributions in binary form must reproduce the above copyright notice, this list of
20 : // conditions and the following disclaimer in the documentation and/or other materials
21 : // provided with the distribution.
22 : //
23 : // (3) Neither the name of the University of California, Lawrence Berkeley National Laboratory,
24 : // the University of Illinois, U.S. Dept. of Energy nor the names of its contributors may be
25 : // used to endorse or promote products derived from this software without specific prior
26 : // written permission.
27 : //
28 : // (4) Use of EnergyPlus(TM) Name. If Licensee (i) distributes the software in stand-alone form
29 : // without changes from the version obtained under this License, or (ii) Licensee makes a
30 : // reference solely to the software portion of its product, Licensee must refer to the
31 : // software as "EnergyPlus version X" software, where "X" is the version number Licensee
32 : // obtained under this License and may not use a different name for the software. Except as
33 : // specifically required in this Section (4), Licensee shall not use in a company name, a
34 : // product name, in advertising, publicity, or other promotional activities any name, trade
35 : // name, trademark, logo, or other designation of "EnergyPlus", "E+", "e+" or confusingly
36 : // similar designation, without the U.S. Department of Energy's prior written consent.
37 : //
38 : // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
39 : // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
40 : // AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
41 : // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
42 : // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
43 : // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
44 : // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
45 : // OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
46 : // POSSIBILITY OF SUCH DAMAGE.
47 :
48 : #ifndef DataStorage_hh_INCLUDED
49 : #define DataStorage_hh_INCLUDED
50 :
51 : #include <functional>
52 : #include <memory>
53 : #include <string>
54 : #include <unordered_map>
55 :
56 : #include <nlohmann/json.hpp>
57 :
58 3084 : class DataStorage
59 : {
60 : public:
61 : using json = nlohmann::json;
62 :
63 : template <typename T> T *addObject(std::string const &name, json const &fields)
64 : {
65 : T *ptr = new T(name, fields);
66 : storage[T::objectTypeHash()][name] = std::move(unique_void(ptr));
67 : return ptr;
68 : }
69 :
70 : template <typename T> T *addObject(json const &fields)
71 : {
72 : static const std::string blankString;
73 : T *ptr = new T(fields);
74 : storage[T::objectTypeHash()][blankString] = std::move(unique_void(ptr));
75 : return ptr;
76 : }
77 :
78 : template <typename T> std::vector<T *> addObjects(json const &objs)
79 : {
80 : assert(objs.is_object());
81 : std::vector<T *> output;
82 : output.reserve(objs.size());
83 : for (auto it = objs.begin(); it != objs.end(); ++it) {
84 : T *ptr = new T(it.key(), it.value());
85 : output.emplace_back(ptr);
86 : storage[T::objectTypeHash()][it.key()] = std::move(unique_void(ptr));
87 : }
88 : return output;
89 : }
90 :
91 : template <typename T> T *objectFactory(std::string const &name)
92 : {
93 : auto const it = storage.find(T::objectTypeHash());
94 : if (it == storage.end()) return nullptr;
95 : auto const it2 = it->second.find(name);
96 : if (it2 == it->second.end()) return nullptr;
97 : T *p = static_cast<T *>(it2->second.get());
98 : return p;
99 : }
100 :
101 : template <typename T> T *objectFactory()
102 : {
103 : static const std::string blankString;
104 : auto const it = storage.find(T::objectTypeHash());
105 : if (it == storage.end()) return nullptr;
106 : auto const it2 = it->second.find(blankString);
107 : if (it2 == it->second.end()) return nullptr;
108 : T *p = static_cast<T *>(it2->second.get());
109 : return p;
110 : }
111 :
112 : // template< typename T >
113 : // std::vector< T * >
114 : // objectsFactory()
115 : // {
116 : // auto const it = storage.find( T::objectTypeHash() );
117 : // if ( it == storage.end() ) return nullptr;
118 : // std::vector< T * > output;
119 : // output.reserve( it->second.size() );
120 : // for ( auto const & obj : it->second ) {
121 : // output.emplace_back( obj->second.get() );
122 : // }
123 : // return output;
124 : // }
125 :
126 : private:
127 : // taken from https://stackoverflow.com/a/39288979/2358662
128 : using deleter_t = std::function<void(void *)>;
129 : using unique_void_ptr = std::unique_ptr<void, deleter_t>;
130 :
131 : template <typename T> auto unique_void(T *ptr) -> unique_void_ptr
132 : {
133 : auto deleter = [](void *data) -> void {
134 : T *p = static_cast<T *>(data);
135 : delete p;
136 : };
137 : return std::unique_ptr<void, deleter_t>(ptr, deleter);
138 : }
139 :
140 : std::unordered_map<std::size_t, std::unordered_map<std::string, unique_void_ptr>> storage;
141 : };
142 :
143 : #endif // DataStorage_hh_INCLUDED
|
