isotree 0.2.2 → 0.3.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (151) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +8 -1
  3. data/LICENSE.txt +2 -2
  4. data/README.md +32 -14
  5. data/ext/isotree/ext.cpp +144 -31
  6. data/ext/isotree/extconf.rb +7 -7
  7. data/lib/isotree/isolation_forest.rb +110 -30
  8. data/lib/isotree/version.rb +1 -1
  9. data/vendor/isotree/LICENSE +1 -1
  10. data/vendor/isotree/README.md +165 -27
  11. data/vendor/isotree/include/isotree.hpp +2111 -0
  12. data/vendor/isotree/include/isotree_oop.hpp +394 -0
  13. data/vendor/isotree/inst/COPYRIGHTS +62 -0
  14. data/vendor/isotree/src/RcppExports.cpp +525 -52
  15. data/vendor/isotree/src/Rwrapper.cpp +1931 -268
  16. data/vendor/isotree/src/c_interface.cpp +953 -0
  17. data/vendor/isotree/src/crit.hpp +4232 -0
  18. data/vendor/isotree/src/dist.hpp +1886 -0
  19. data/vendor/isotree/src/exp_depth_table.hpp +134 -0
  20. data/vendor/isotree/src/extended.hpp +1444 -0
  21. data/vendor/isotree/src/external_facing_generic.hpp +399 -0
  22. data/vendor/isotree/src/fit_model.hpp +2401 -0
  23. data/vendor/isotree/src/{dealloc.cpp → headers_joined.hpp} +38 -22
  24. data/vendor/isotree/src/helpers_iforest.hpp +813 -0
  25. data/vendor/isotree/src/{impute.cpp → impute.hpp} +353 -122
  26. data/vendor/isotree/src/indexer.cpp +515 -0
  27. data/vendor/isotree/src/instantiate_template_headers.cpp +118 -0
  28. data/vendor/isotree/src/instantiate_template_headers.hpp +240 -0
  29. data/vendor/isotree/src/isoforest.hpp +1659 -0
  30. data/vendor/isotree/src/isotree.hpp +1804 -392
  31. data/vendor/isotree/src/isotree_exportable.hpp +99 -0
  32. data/vendor/isotree/src/merge_models.cpp +159 -16
  33. data/vendor/isotree/src/mult.hpp +1321 -0
  34. data/vendor/isotree/src/oop_interface.cpp +842 -0
  35. data/vendor/isotree/src/oop_interface.hpp +278 -0
  36. data/vendor/isotree/src/other_helpers.hpp +219 -0
  37. data/vendor/isotree/src/predict.hpp +1932 -0
  38. data/vendor/isotree/src/python_helpers.hpp +134 -0
  39. data/vendor/isotree/src/ref_indexer.hpp +154 -0
  40. data/vendor/isotree/src/robinmap/LICENSE +21 -0
  41. data/vendor/isotree/src/robinmap/README.md +483 -0
  42. data/vendor/isotree/src/robinmap/include/tsl/robin_growth_policy.h +406 -0
  43. data/vendor/isotree/src/robinmap/include/tsl/robin_hash.h +1620 -0
  44. data/vendor/isotree/src/robinmap/include/tsl/robin_map.h +807 -0
  45. data/vendor/isotree/src/robinmap/include/tsl/robin_set.h +660 -0
  46. data/vendor/isotree/src/serialize.cpp +4300 -139
  47. data/vendor/isotree/src/sql.cpp +141 -59
  48. data/vendor/isotree/src/subset_models.cpp +174 -0
  49. data/vendor/isotree/src/utils.hpp +3808 -0
  50. data/vendor/isotree/src/xoshiro.hpp +467 -0
  51. data/vendor/isotree/src/ziggurat.hpp +405 -0
  52. metadata +38 -104
  53. data/vendor/cereal/LICENSE +0 -24
  54. data/vendor/cereal/README.md +0 -85
  55. data/vendor/cereal/include/cereal/access.hpp +0 -351
  56. data/vendor/cereal/include/cereal/archives/adapters.hpp +0 -163
  57. data/vendor/cereal/include/cereal/archives/binary.hpp +0 -169
  58. data/vendor/cereal/include/cereal/archives/json.hpp +0 -1019
  59. data/vendor/cereal/include/cereal/archives/portable_binary.hpp +0 -334
  60. data/vendor/cereal/include/cereal/archives/xml.hpp +0 -956
  61. data/vendor/cereal/include/cereal/cereal.hpp +0 -1089
  62. data/vendor/cereal/include/cereal/details/helpers.hpp +0 -422
  63. data/vendor/cereal/include/cereal/details/polymorphic_impl.hpp +0 -796
  64. data/vendor/cereal/include/cereal/details/polymorphic_impl_fwd.hpp +0 -65
  65. data/vendor/cereal/include/cereal/details/static_object.hpp +0 -127
  66. data/vendor/cereal/include/cereal/details/traits.hpp +0 -1411
  67. data/vendor/cereal/include/cereal/details/util.hpp +0 -84
  68. data/vendor/cereal/include/cereal/external/base64.hpp +0 -134
  69. data/vendor/cereal/include/cereal/external/rapidjson/allocators.h +0 -284
  70. data/vendor/cereal/include/cereal/external/rapidjson/cursorstreamwrapper.h +0 -78
  71. data/vendor/cereal/include/cereal/external/rapidjson/document.h +0 -2652
  72. data/vendor/cereal/include/cereal/external/rapidjson/encodedstream.h +0 -299
  73. data/vendor/cereal/include/cereal/external/rapidjson/encodings.h +0 -716
  74. data/vendor/cereal/include/cereal/external/rapidjson/error/en.h +0 -74
  75. data/vendor/cereal/include/cereal/external/rapidjson/error/error.h +0 -161
  76. data/vendor/cereal/include/cereal/external/rapidjson/filereadstream.h +0 -99
  77. data/vendor/cereal/include/cereal/external/rapidjson/filewritestream.h +0 -104
  78. data/vendor/cereal/include/cereal/external/rapidjson/fwd.h +0 -151
  79. data/vendor/cereal/include/cereal/external/rapidjson/internal/biginteger.h +0 -290
  80. data/vendor/cereal/include/cereal/external/rapidjson/internal/diyfp.h +0 -271
  81. data/vendor/cereal/include/cereal/external/rapidjson/internal/dtoa.h +0 -245
  82. data/vendor/cereal/include/cereal/external/rapidjson/internal/ieee754.h +0 -78
  83. data/vendor/cereal/include/cereal/external/rapidjson/internal/itoa.h +0 -308
  84. data/vendor/cereal/include/cereal/external/rapidjson/internal/meta.h +0 -186
  85. data/vendor/cereal/include/cereal/external/rapidjson/internal/pow10.h +0 -55
  86. data/vendor/cereal/include/cereal/external/rapidjson/internal/regex.h +0 -740
  87. data/vendor/cereal/include/cereal/external/rapidjson/internal/stack.h +0 -232
  88. data/vendor/cereal/include/cereal/external/rapidjson/internal/strfunc.h +0 -69
  89. data/vendor/cereal/include/cereal/external/rapidjson/internal/strtod.h +0 -290
  90. data/vendor/cereal/include/cereal/external/rapidjson/internal/swap.h +0 -46
  91. data/vendor/cereal/include/cereal/external/rapidjson/istreamwrapper.h +0 -128
  92. data/vendor/cereal/include/cereal/external/rapidjson/memorybuffer.h +0 -70
  93. data/vendor/cereal/include/cereal/external/rapidjson/memorystream.h +0 -71
  94. data/vendor/cereal/include/cereal/external/rapidjson/msinttypes/inttypes.h +0 -316
  95. data/vendor/cereal/include/cereal/external/rapidjson/msinttypes/stdint.h +0 -300
  96. data/vendor/cereal/include/cereal/external/rapidjson/ostreamwrapper.h +0 -81
  97. data/vendor/cereal/include/cereal/external/rapidjson/pointer.h +0 -1414
  98. data/vendor/cereal/include/cereal/external/rapidjson/prettywriter.h +0 -277
  99. data/vendor/cereal/include/cereal/external/rapidjson/rapidjson.h +0 -656
  100. data/vendor/cereal/include/cereal/external/rapidjson/reader.h +0 -2230
  101. data/vendor/cereal/include/cereal/external/rapidjson/schema.h +0 -2497
  102. data/vendor/cereal/include/cereal/external/rapidjson/stream.h +0 -223
  103. data/vendor/cereal/include/cereal/external/rapidjson/stringbuffer.h +0 -121
  104. data/vendor/cereal/include/cereal/external/rapidjson/writer.h +0 -709
  105. data/vendor/cereal/include/cereal/external/rapidxml/license.txt +0 -52
  106. data/vendor/cereal/include/cereal/external/rapidxml/manual.html +0 -406
  107. data/vendor/cereal/include/cereal/external/rapidxml/rapidxml.hpp +0 -2624
  108. data/vendor/cereal/include/cereal/external/rapidxml/rapidxml_iterators.hpp +0 -175
  109. data/vendor/cereal/include/cereal/external/rapidxml/rapidxml_print.hpp +0 -428
  110. data/vendor/cereal/include/cereal/external/rapidxml/rapidxml_utils.hpp +0 -123
  111. data/vendor/cereal/include/cereal/macros.hpp +0 -154
  112. data/vendor/cereal/include/cereal/specialize.hpp +0 -139
  113. data/vendor/cereal/include/cereal/types/array.hpp +0 -79
  114. data/vendor/cereal/include/cereal/types/atomic.hpp +0 -55
  115. data/vendor/cereal/include/cereal/types/base_class.hpp +0 -203
  116. data/vendor/cereal/include/cereal/types/bitset.hpp +0 -176
  117. data/vendor/cereal/include/cereal/types/boost_variant.hpp +0 -164
  118. data/vendor/cereal/include/cereal/types/chrono.hpp +0 -72
  119. data/vendor/cereal/include/cereal/types/common.hpp +0 -129
  120. data/vendor/cereal/include/cereal/types/complex.hpp +0 -56
  121. data/vendor/cereal/include/cereal/types/concepts/pair_associative_container.hpp +0 -73
  122. data/vendor/cereal/include/cereal/types/deque.hpp +0 -62
  123. data/vendor/cereal/include/cereal/types/forward_list.hpp +0 -68
  124. data/vendor/cereal/include/cereal/types/functional.hpp +0 -43
  125. data/vendor/cereal/include/cereal/types/list.hpp +0 -62
  126. data/vendor/cereal/include/cereal/types/map.hpp +0 -36
  127. data/vendor/cereal/include/cereal/types/memory.hpp +0 -425
  128. data/vendor/cereal/include/cereal/types/optional.hpp +0 -66
  129. data/vendor/cereal/include/cereal/types/polymorphic.hpp +0 -483
  130. data/vendor/cereal/include/cereal/types/queue.hpp +0 -132
  131. data/vendor/cereal/include/cereal/types/set.hpp +0 -103
  132. data/vendor/cereal/include/cereal/types/stack.hpp +0 -76
  133. data/vendor/cereal/include/cereal/types/string.hpp +0 -61
  134. data/vendor/cereal/include/cereal/types/tuple.hpp +0 -123
  135. data/vendor/cereal/include/cereal/types/unordered_map.hpp +0 -36
  136. data/vendor/cereal/include/cereal/types/unordered_set.hpp +0 -99
  137. data/vendor/cereal/include/cereal/types/utility.hpp +0 -47
  138. data/vendor/cereal/include/cereal/types/valarray.hpp +0 -89
  139. data/vendor/cereal/include/cereal/types/variant.hpp +0 -109
  140. data/vendor/cereal/include/cereal/types/vector.hpp +0 -112
  141. data/vendor/cereal/include/cereal/version.hpp +0 -52
  142. data/vendor/isotree/src/Makevars +0 -4
  143. data/vendor/isotree/src/crit.cpp +0 -912
  144. data/vendor/isotree/src/dist.cpp +0 -749
  145. data/vendor/isotree/src/extended.cpp +0 -790
  146. data/vendor/isotree/src/fit_model.cpp +0 -1090
  147. data/vendor/isotree/src/helpers_iforest.cpp +0 -324
  148. data/vendor/isotree/src/isoforest.cpp +0 -771
  149. data/vendor/isotree/src/mult.cpp +0 -607
  150. data/vendor/isotree/src/predict.cpp +0 -853
  151. data/vendor/isotree/src/utils.cpp +0 -1566
@@ -1,483 +0,0 @@
1
- /*! \file polymorphic.hpp
2
- \brief Support for pointers to polymorphic base classes
3
- \ingroup OtherTypes */
4
- /*
5
- Copyright (c) 2014, Randolph Voorhies, Shane Grant
6
- All rights reserved.
7
-
8
- Redistribution and use in source and binary forms, with or without
9
- modification, are permitted provided that the following conditions are met:
10
- * Redistributions of source code must retain the above copyright
11
- notice, this list of conditions and the following disclaimer.
12
- * Redistributions in binary form must reproduce the above copyright
13
- notice, this list of conditions and the following disclaimer in the
14
- documentation and/or other materials provided with the distribution.
15
- * Neither the name of cereal nor the
16
- names of its contributors may be used to endorse or promote products
17
- derived from this software without specific prior written permission.
18
-
19
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
20
- ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
21
- WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22
- DISCLAIMED. IN NO EVENT SHALL RANDOLPH VOORHIES OR SHANE GRANT BE LIABLE FOR ANY
23
- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
24
- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25
- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
26
- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28
- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29
- */
30
- #ifndef CEREAL_TYPES_POLYMORPHIC_HPP_
31
- #define CEREAL_TYPES_POLYMORPHIC_HPP_
32
-
33
- #include "cereal/cereal.hpp"
34
- #include "cereal/types/memory.hpp"
35
-
36
- #include "cereal/details/util.hpp"
37
- #include "cereal/details/helpers.hpp"
38
- #include "cereal/details/traits.hpp"
39
- #include "cereal/details/polymorphic_impl.hpp"
40
-
41
- #ifdef _MSC_VER
42
- #define CEREAL_STATIC_CONSTEXPR static
43
- #else
44
- #define CEREAL_STATIC_CONSTEXPR static constexpr
45
- #endif
46
-
47
- //! Registers a derived polymorphic type with cereal
48
- /*! Polymorphic types must be registered before smart
49
- pointers to them can be serialized. Note that base
50
- classes do not need to be registered.
51
-
52
- Registering a type lets cereal know how to properly
53
- serialize it when a smart pointer to a base object is
54
- used in conjunction with a derived class.
55
-
56
- This assumes that all relevant archives have also
57
- previously been registered. Registration for archives
58
- is usually done in the header file in which they are
59
- defined. This means that type registration needs to
60
- happen after specific archives to be used are included.
61
-
62
- It is recommended that type registration be done in
63
- the header file in which the type is declared.
64
-
65
- Registration can also be placed in a source file,
66
- but this may require the use of the
67
- CEREAL_REGISTER_DYNAMIC_INIT macro (see below).
68
-
69
- Registration may be called repeatedly for the same
70
- type in different translation units to add support
71
- for additional archives if they are not initially
72
- available (included and registered).
73
-
74
- When building serialization support as a DLL on
75
- Windows, registration must happen in the header file.
76
- On Linux and Mac things should still work properly
77
- if placed in a source file, but see the above comments
78
- on registering in source files.
79
-
80
- Polymorphic support in cereal requires RTTI to be
81
- enabled */
82
- #define CEREAL_REGISTER_TYPE(...) \
83
- namespace cereal { \
84
- namespace detail { \
85
- template <> \
86
- struct binding_name<__VA_ARGS__> \
87
- { \
88
- CEREAL_STATIC_CONSTEXPR char const * name() { return #__VA_ARGS__; } \
89
- }; \
90
- } } /* end namespaces */ \
91
- CEREAL_BIND_TO_ARCHIVES(__VA_ARGS__)
92
-
93
- //! Registers a polymorphic type with cereal, giving it a
94
- //! user defined name
95
- /*! In some cases the default name used with
96
- CEREAL_REGISTER_TYPE (the name of the type) may not be
97
- suitable. This macro allows any name to be associated
98
- with the type. The name should be unique */
99
- #define CEREAL_REGISTER_TYPE_WITH_NAME(T, Name) \
100
- namespace cereal { \
101
- namespace detail { \
102
- template <> \
103
- struct binding_name<T> \
104
- { CEREAL_STATIC_CONSTEXPR char const * name() { return Name; } }; \
105
- } } /* end namespaces */ \
106
- CEREAL_BIND_TO_ARCHIVES(T)
107
-
108
- //! Registers the base-derived relationship for a polymorphic type
109
- /*! When polymorphic serialization occurs, cereal needs to know how to
110
- properly cast between derived and base types for the polymorphic
111
- type. Normally this happens automatically whenever cereal::base_class
112
- or cereal::virtual_base_class are used to serialize a base class. In
113
- cases where neither of these is ever called but a base class still
114
- exists, this explicit registration is required.
115
-
116
- The Derived class should be the most derived type that will be serialized,
117
- and the Base type any possible base that has not been covered under a base
118
- class serialization that will be used to store a Derived pointer.
119
-
120
- Placement of this is the same as for CEREAL_REGISTER_TYPE. */
121
- #define CEREAL_REGISTER_POLYMORPHIC_RELATION(Base, Derived) \
122
- namespace cereal { \
123
- namespace detail { \
124
- template <> \
125
- struct PolymorphicRelation<Base, Derived> \
126
- { static void bind() { RegisterPolymorphicCaster<Base, Derived>::bind(); } }; \
127
- } } /* end namespaces */
128
-
129
- //! Adds a way to force initialization of a translation unit containing
130
- //! calls to CEREAL_REGISTER_TYPE
131
- /*! In C++, dynamic initialization of non-local variables of a translation
132
- unit may be deferred until "the first odr-use of any function or variable
133
- defined in the same translation unit as the variable to be initialized."
134
-
135
- Informally, odr-use means that your program takes the address of or binds
136
- a reference directly to an object, which must have a definition.
137
-
138
- Since polymorphic type support in cereal relies on the dynamic
139
- initialization of certain global objects happening before
140
- serialization is performed, it is important to ensure that something
141
- from files that call CEREAL_REGISTER_TYPE is odr-used before serialization
142
- occurs, otherwise the registration will never take place. This may often
143
- be the case when serialization is built as a shared library external from
144
- your main program.
145
-
146
- This macro, with any name of your choosing, should be placed into the
147
- source file that contains calls to CEREAL_REGISTER_TYPE.
148
-
149
- Its counterpart, CEREAL_FORCE_DYNAMIC_INIT, should be placed in its
150
- associated header file such that it is included in the translation units
151
- (source files) in which you want the registration to appear.
152
-
153
- @relates CEREAL_FORCE_DYNAMIC_INIT
154
- */
155
- #define CEREAL_REGISTER_DYNAMIC_INIT(LibName) \
156
- namespace cereal { \
157
- namespace detail { \
158
- void CEREAL_DLL_EXPORT dynamic_init_dummy_##LibName() {} \
159
- } } /* end namespaces */
160
-
161
- //! Forces dynamic initialization of polymorphic support in a
162
- //! previously registered source file
163
- /*! @sa CEREAL_REGISTER_DYNAMIC_INIT
164
-
165
- See CEREAL_REGISTER_DYNAMIC_INIT for detailed explanation
166
- of how this macro should be used. The name used should
167
- match that for CEREAL_REGISTER_DYNAMIC_INIT. */
168
- #define CEREAL_FORCE_DYNAMIC_INIT(LibName) \
169
- namespace cereal { \
170
- namespace detail { \
171
- void CEREAL_DLL_EXPORT dynamic_init_dummy_##LibName(); \
172
- } /* end detail */ \
173
- } /* end cereal */ \
174
- namespace { \
175
- struct dynamic_init_##LibName { \
176
- dynamic_init_##LibName() { \
177
- ::cereal::detail::dynamic_init_dummy_##LibName(); \
178
- } \
179
- } dynamic_init_instance_##LibName; \
180
- } /* end anonymous namespace */
181
-
182
- namespace cereal
183
- {
184
- namespace polymorphic_detail
185
- {
186
- //! Error message used for unregistered polymorphic types
187
- /*! @internal */
188
- #define UNREGISTERED_POLYMORPHIC_EXCEPTION(LoadSave, Name) \
189
- throw cereal::Exception("Trying to " #LoadSave " an unregistered polymorphic type (" + Name + ").\n" \
190
- "Make sure your type is registered with CEREAL_REGISTER_TYPE and that the archive " \
191
- "you are using was included (and registered with CEREAL_REGISTER_ARCHIVE) prior to calling CEREAL_REGISTER_TYPE.\n" \
192
- "If your type is already registered and you still see this error, you may need to use CEREAL_REGISTER_DYNAMIC_INIT.");
193
-
194
- //! Get an input binding from the given archive by deserializing the type meta data
195
- /*! @internal */
196
- template<class Archive> inline
197
- typename ::cereal::detail::InputBindingMap<Archive>::Serializers getInputBinding(Archive & ar, std::uint32_t const nameid)
198
- {
199
- // If the nameid is zero, we serialized a null pointer
200
- if(nameid == 0)
201
- {
202
- typename ::cereal::detail::InputBindingMap<Archive>::Serializers emptySerializers;
203
- emptySerializers.shared_ptr = [](void*, std::shared_ptr<void> & ptr, std::type_info const &) { ptr.reset(); };
204
- emptySerializers.unique_ptr = [](void*, std::unique_ptr<void, ::cereal::detail::EmptyDeleter<void>> & ptr, std::type_info const &) { ptr.reset( nullptr ); };
205
- return emptySerializers;
206
- }
207
-
208
- std::string name;
209
- if(nameid & detail::msb_32bit)
210
- {
211
- ar( CEREAL_NVP_("polymorphic_name", name) );
212
- ar.registerPolymorphicName(nameid, name);
213
- }
214
- else
215
- name = ar.getPolymorphicName(nameid);
216
-
217
- auto const & bindingMap = detail::StaticObject<detail::InputBindingMap<Archive>>::getInstance().map;
218
-
219
- auto binding = bindingMap.find(name);
220
- if(binding == bindingMap.end())
221
- UNREGISTERED_POLYMORPHIC_EXCEPTION(load, name)
222
- return binding->second;
223
- }
224
-
225
- //! Serialize a shared_ptr if the 2nd msb in the nameid is set, and if we can actually construct the pointee
226
- /*! This check lets us try and skip doing polymorphic machinery if we can get away with
227
- using the derived class serialize function
228
-
229
- Note that on MSVC 2013 preview, is_default_constructible<T> returns true for abstract classes with
230
- default constructors, but on clang/gcc this will return false. So we also need to check for that here.
231
- @internal */
232
- template<class Archive, class T> inline
233
- typename std::enable_if<(traits::is_default_constructible<T>::value
234
- || traits::has_load_and_construct<T, Archive>::value)
235
- && !std::is_abstract<T>::value, bool>::type
236
- serialize_wrapper(Archive & ar, std::shared_ptr<T> & ptr, std::uint32_t const nameid)
237
- {
238
- if(nameid & detail::msb2_32bit)
239
- {
240
- ar( CEREAL_NVP_("ptr_wrapper", memory_detail::make_ptr_wrapper(ptr)) );
241
- return true;
242
- }
243
- return false;
244
- }
245
-
246
- //! Serialize a unique_ptr if the 2nd msb in the nameid is set, and if we can actually construct the pointee
247
- /*! This check lets us try and skip doing polymorphic machinery if we can get away with
248
- using the derived class serialize function
249
- @internal */
250
- template<class Archive, class T, class D> inline
251
- typename std::enable_if<(traits::is_default_constructible<T>::value
252
- || traits::has_load_and_construct<T, Archive>::value)
253
- && !std::is_abstract<T>::value, bool>::type
254
- serialize_wrapper(Archive & ar, std::unique_ptr<T, D> & ptr, std::uint32_t const nameid)
255
- {
256
- if(nameid & detail::msb2_32bit)
257
- {
258
- ar( CEREAL_NVP_("ptr_wrapper", memory_detail::make_ptr_wrapper(ptr)) );
259
- return true;
260
- }
261
- return false;
262
- }
263
-
264
- //! Serialize a shared_ptr if the 2nd msb in the nameid is set, and if we can actually construct the pointee
265
- /*! This case is for when we can't actually construct the shared pointer. Normally this would be caught
266
- as the pointer itself is serialized, but since this is a polymorphic pointer, if we tried to serialize
267
- the pointer we'd end up back here recursively. So we have to catch the error here as well, if
268
- this was a polymorphic type serialized by its proper pointer type
269
- @internal */
270
- template<class Archive, class T> inline
271
- typename std::enable_if<(!traits::is_default_constructible<T>::value
272
- && !traits::has_load_and_construct<T, Archive>::value)
273
- || std::is_abstract<T>::value, bool>::type
274
- serialize_wrapper(Archive &, std::shared_ptr<T> &, std::uint32_t const nameid)
275
- {
276
- if(nameid & detail::msb2_32bit)
277
- throw cereal::Exception("Cannot load a polymorphic type that is not default constructable and does not have a load_and_construct function");
278
- return false;
279
- }
280
-
281
- //! Serialize a unique_ptr if the 2nd msb in the nameid is set, and if we can actually construct the pointee
282
- /*! This case is for when we can't actually construct the unique pointer. Normally this would be caught
283
- as the pointer itself is serialized, but since this is a polymorphic pointer, if we tried to serialize
284
- the pointer we'd end up back here recursively. So we have to catch the error here as well, if
285
- this was a polymorphic type serialized by its proper pointer type
286
- @internal */
287
- template<class Archive, class T, class D> inline
288
- typename std::enable_if<(!traits::is_default_constructible<T>::value
289
- && !traits::has_load_and_construct<T, Archive>::value)
290
- || std::is_abstract<T>::value, bool>::type
291
- serialize_wrapper(Archive &, std::unique_ptr<T, D> &, std::uint32_t const nameid)
292
- {
293
- if(nameid & detail::msb2_32bit)
294
- throw cereal::Exception("Cannot load a polymorphic type that is not default constructable and does not have a load_and_construct function");
295
- return false;
296
- }
297
- } // polymorphic_detail
298
-
299
- // ######################################################################
300
- // Pointer serialization for polymorphic types
301
-
302
- //! Saving std::shared_ptr for polymorphic types, abstract
303
- template <class Archive, class T> inline
304
- typename std::enable_if<std::is_polymorphic<T>::value && std::is_abstract<T>::value, void>::type
305
- CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::shared_ptr<T> const & ptr )
306
- {
307
- if(!ptr)
308
- {
309
- // same behavior as nullptr in memory implementation
310
- ar( CEREAL_NVP_("polymorphic_id", std::uint32_t(0)) );
311
- return;
312
- }
313
-
314
- std::type_info const & ptrinfo = typeid(*ptr.get());
315
- static std::type_info const & tinfo = typeid(T);
316
- // ptrinfo can never be equal to T info since we can't have an instance
317
- // of an abstract object
318
- // this implies we need to do the lookup
319
-
320
- auto const & bindingMap = detail::StaticObject<detail::OutputBindingMap<Archive>>::getInstance().map;
321
-
322
- auto binding = bindingMap.find(std::type_index(ptrinfo));
323
- if(binding == bindingMap.end())
324
- UNREGISTERED_POLYMORPHIC_EXCEPTION(save, cereal::util::demangle(ptrinfo.name()))
325
-
326
- binding->second.shared_ptr(&ar, ptr.get(), tinfo);
327
- }
328
-
329
- //! Saving std::shared_ptr for polymorphic types, not abstract
330
- template <class Archive, class T> inline
331
- typename std::enable_if<std::is_polymorphic<T>::value && !std::is_abstract<T>::value, void>::type
332
- CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::shared_ptr<T> const & ptr )
333
- {
334
- if(!ptr)
335
- {
336
- // same behavior as nullptr in memory implementation
337
- ar( CEREAL_NVP_("polymorphic_id", std::uint32_t(0)) );
338
- return;
339
- }
340
-
341
- std::type_info const & ptrinfo = typeid(*ptr.get());
342
- static std::type_info const & tinfo = typeid(T);
343
-
344
- if(ptrinfo == tinfo)
345
- {
346
- // The 2nd msb signals that the following pointer does not need to be
347
- // cast with our polymorphic machinery
348
- ar( CEREAL_NVP_("polymorphic_id", detail::msb2_32bit) );
349
-
350
- ar( CEREAL_NVP_("ptr_wrapper", memory_detail::make_ptr_wrapper(ptr)) );
351
-
352
- return;
353
- }
354
-
355
- auto const & bindingMap = detail::StaticObject<detail::OutputBindingMap<Archive>>::getInstance().map;
356
-
357
- auto binding = bindingMap.find(std::type_index(ptrinfo));
358
- if(binding == bindingMap.end())
359
- UNREGISTERED_POLYMORPHIC_EXCEPTION(save, cereal::util::demangle(ptrinfo.name()))
360
-
361
- binding->second.shared_ptr(&ar, ptr.get(), tinfo);
362
- }
363
-
364
- //! Loading std::shared_ptr for polymorphic types
365
- template <class Archive, class T> inline
366
- typename std::enable_if<std::is_polymorphic<T>::value, void>::type
367
- CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::shared_ptr<T> & ptr )
368
- {
369
- std::uint32_t nameid;
370
- ar( CEREAL_NVP_("polymorphic_id", nameid) );
371
-
372
- // Check to see if we can skip all of this polymorphism business
373
- if(polymorphic_detail::serialize_wrapper(ar, ptr, nameid))
374
- return;
375
-
376
- auto binding = polymorphic_detail::getInputBinding(ar, nameid);
377
- std::shared_ptr<void> result;
378
- binding.shared_ptr(&ar, result, typeid(T));
379
- ptr = std::static_pointer_cast<T>(result);
380
- }
381
-
382
- //! Saving std::weak_ptr for polymorphic types
383
- template <class Archive, class T> inline
384
- typename std::enable_if<std::is_polymorphic<T>::value, void>::type
385
- CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::weak_ptr<T> const & ptr )
386
- {
387
- auto const sptr = ptr.lock();
388
- ar( CEREAL_NVP_("locked_ptr", sptr) );
389
- }
390
-
391
- //! Loading std::weak_ptr for polymorphic types
392
- template <class Archive, class T> inline
393
- typename std::enable_if<std::is_polymorphic<T>::value, void>::type
394
- CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::weak_ptr<T> & ptr )
395
- {
396
- std::shared_ptr<T> sptr;
397
- ar( CEREAL_NVP_("locked_ptr", sptr) );
398
- ptr = sptr;
399
- }
400
-
401
- //! Saving std::unique_ptr for polymorphic types that are abstract
402
- template <class Archive, class T, class D> inline
403
- typename std::enable_if<std::is_polymorphic<T>::value && std::is_abstract<T>::value, void>::type
404
- CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::unique_ptr<T, D> const & ptr )
405
- {
406
- if(!ptr)
407
- {
408
- // same behavior as nullptr in memory implementation
409
- ar( CEREAL_NVP_("polymorphic_id", std::uint32_t(0)) );
410
- return;
411
- }
412
-
413
- std::type_info const & ptrinfo = typeid(*ptr.get());
414
- static std::type_info const & tinfo = typeid(T);
415
- // ptrinfo can never be equal to T info since we can't have an instance
416
- // of an abstract object
417
- // this implies we need to do the lookup
418
-
419
- auto const & bindingMap = detail::StaticObject<detail::OutputBindingMap<Archive>>::getInstance().map;
420
-
421
- auto binding = bindingMap.find(std::type_index(ptrinfo));
422
- if(binding == bindingMap.end())
423
- UNREGISTERED_POLYMORPHIC_EXCEPTION(save, cereal::util::demangle(ptrinfo.name()))
424
-
425
- binding->second.unique_ptr(&ar, ptr.get(), tinfo);
426
- }
427
-
428
- //! Saving std::unique_ptr for polymorphic types, not abstract
429
- template <class Archive, class T, class D> inline
430
- typename std::enable_if<std::is_polymorphic<T>::value && !std::is_abstract<T>::value, void>::type
431
- CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::unique_ptr<T, D> const & ptr )
432
- {
433
- if(!ptr)
434
- {
435
- // same behavior as nullptr in memory implementation
436
- ar( CEREAL_NVP_("polymorphic_id", std::uint32_t(0)) );
437
- return;
438
- }
439
-
440
- std::type_info const & ptrinfo = typeid(*ptr.get());
441
- static std::type_info const & tinfo = typeid(T);
442
-
443
- if(ptrinfo == tinfo)
444
- {
445
- // The 2nd msb signals that the following pointer does not need to be
446
- // cast with our polymorphic machinery
447
- ar( CEREAL_NVP_("polymorphic_id", detail::msb2_32bit) );
448
-
449
- ar( CEREAL_NVP_("ptr_wrapper", memory_detail::make_ptr_wrapper(ptr)) );
450
-
451
- return;
452
- }
453
-
454
- auto const & bindingMap = detail::StaticObject<detail::OutputBindingMap<Archive>>::getInstance().map;
455
-
456
- auto binding = bindingMap.find(std::type_index(ptrinfo));
457
- if(binding == bindingMap.end())
458
- UNREGISTERED_POLYMORPHIC_EXCEPTION(save, cereal::util::demangle(ptrinfo.name()))
459
-
460
- binding->second.unique_ptr(&ar, ptr.get(), tinfo);
461
- }
462
-
463
- //! Loading std::unique_ptr, case when user provides load_and_construct for polymorphic types
464
- template <class Archive, class T, class D> inline
465
- typename std::enable_if<std::is_polymorphic<T>::value, void>::type
466
- CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::unique_ptr<T, D> & ptr )
467
- {
468
- std::uint32_t nameid;
469
- ar( CEREAL_NVP_("polymorphic_id", nameid) );
470
-
471
- // Check to see if we can skip all of this polymorphism business
472
- if(polymorphic_detail::serialize_wrapper(ar, ptr, nameid))
473
- return;
474
-
475
- auto binding = polymorphic_detail::getInputBinding(ar, nameid);
476
- std::unique_ptr<void, ::cereal::detail::EmptyDeleter<void>> result;
477
- binding.unique_ptr(&ar, result, typeid(T));
478
- ptr.reset(static_cast<T*>(result.release()));
479
- }
480
-
481
- #undef UNREGISTERED_POLYMORPHIC_EXCEPTION
482
- } // namespace cereal
483
- #endif // CEREAL_TYPES_POLYMORPHIC_HPP_
@@ -1,132 +0,0 @@
1
- /*! \file queue.hpp
2
- \brief Support for types found in \<queue\>
3
- \ingroup STLSupport */
4
- /*
5
- Copyright (c) 2014, Randolph Voorhies, Shane Grant
6
- All rights reserved.
7
-
8
- Redistribution and use in source and binary forms, with or without
9
- modification, are permitted provided that the following conditions are met:
10
- * Redistributions of source code must retain the above copyright
11
- notice, this list of conditions and the following disclaimer.
12
- * Redistributions in binary form must reproduce the above copyright
13
- notice, this list of conditions and the following disclaimer in the
14
- documentation and/or other materials provided with the distribution.
15
- * Neither the name of cereal nor the
16
- names of its contributors may be used to endorse or promote products
17
- derived from this software without specific prior written permission.
18
-
19
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
20
- ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
21
- WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22
- DISCLAIMED. IN NO EVENT SHALL RANDOLPH VOORHIES OR SHANE GRANT BE LIABLE FOR ANY
23
- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
24
- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25
- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
26
- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28
- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29
- */
30
- #ifndef CEREAL_TYPES_QUEUE_HPP_
31
- #define CEREAL_TYPES_QUEUE_HPP_
32
-
33
- #include "cereal/details/helpers.hpp"
34
- #include <queue>
35
-
36
- // The default container for queue is deque, so let's include that too
37
- #include "cereal/types/deque.hpp"
38
- // The default comparator for queue is less
39
- #include "cereal/types/functional.hpp"
40
-
41
- namespace cereal
42
- {
43
- namespace queue_detail
44
- {
45
- //! Allows access to the protected container in queue
46
- /*! @internal */
47
- template <class T, class C> inline
48
- C const & container( std::queue<T, C> const & queue )
49
- {
50
- struct H : public std::queue<T, C>
51
- {
52
- static C const & get( std::queue<T, C> const & q )
53
- {
54
- return q.*(&H::c);
55
- }
56
- };
57
-
58
- return H::get( queue );
59
- }
60
-
61
- //! Allows access to the protected container in priority queue
62
- /*! @internal */
63
- template <class T, class C, class Comp> inline
64
- C const & container( std::priority_queue<T, C, Comp> const & priority_queue )
65
- {
66
- struct H : public std::priority_queue<T, C, Comp>
67
- {
68
- static C const & get( std::priority_queue<T, C, Comp> const & pq )
69
- {
70
- return pq.*(&H::c);
71
- }
72
- };
73
-
74
- return H::get( priority_queue );
75
- }
76
-
77
- //! Allows access to the protected comparator in priority queue
78
- /*! @internal */
79
- template <class T, class C, class Comp> inline
80
- Comp const & comparator( std::priority_queue<T, C, Comp> const & priority_queue )
81
- {
82
- struct H : public std::priority_queue<T, C, Comp>
83
- {
84
- static Comp const & get( std::priority_queue<T, C, Comp> const & pq )
85
- {
86
- return pq.*(&H::comp);
87
- }
88
- };
89
-
90
- return H::get( priority_queue );
91
- }
92
- }
93
-
94
- //! Saving for std::queue
95
- template <class Archive, class T, class C> inline
96
- void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::queue<T, C> const & queue )
97
- {
98
- ar( CEREAL_NVP_("container", queue_detail::container( queue )) );
99
- }
100
-
101
- //! Loading for std::queue
102
- template <class Archive, class T, class C> inline
103
- void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::queue<T, C> & queue )
104
- {
105
- C container;
106
- ar( CEREAL_NVP_("container", container) );
107
- queue = std::queue<T, C>( std::move( container ) );
108
- }
109
-
110
- //! Saving for std::priority_queue
111
- template <class Archive, class T, class C, class Comp> inline
112
- void CEREAL_SAVE_FUNCTION_NAME( Archive & ar, std::priority_queue<T, C, Comp> const & priority_queue )
113
- {
114
- ar( CEREAL_NVP_("comparator", queue_detail::comparator( priority_queue )) );
115
- ar( CEREAL_NVP_("container", queue_detail::container( priority_queue )) );
116
- }
117
-
118
- //! Loading for std::priority_queue
119
- template <class Archive, class T, class C, class Comp> inline
120
- void CEREAL_LOAD_FUNCTION_NAME( Archive & ar, std::priority_queue<T, C, Comp> & priority_queue )
121
- {
122
- Comp comparator;
123
- ar( CEREAL_NVP_("comparator", comparator) );
124
-
125
- C container;
126
- ar( CEREAL_NVP_("container", container) );
127
-
128
- priority_queue = std::priority_queue<T, C, Comp>( comparator, std::move( container ) );
129
- }
130
- } // namespace cereal
131
-
132
- #endif // CEREAL_TYPES_QUEUE_HPP_