123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367 |
- /**
- * @file artis/kernel/Any.hpp
- * @author See the AUTHORS file
- */
- /*
- * Copyright (C) 2012-2019 ULCO http://www.univ-littoral.fr
- *
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program. If not, see <http://www.gnu.org/licenses/>.
- */
- #ifndef __ARTIS_KERNEL_ANY_HPP
- #define __ARTIS_KERNEL_ANY_HPP
- #include <artis/context/Value.hpp>
- #include <string>
- #include <tuple>
- #include <utility>
- #include <vector>
- namespace artis {
- namespace kernel {
- enum ValueTypeID {
- DOUBLE, INT, BOOL, DOUBLE_VECTOR, INT_VECTOR, BOOL_VECTOR,
- STRING, USER
- };
- // template < typename H, typename T >
- // struct typelist
- // {
- // typedef H head;
- // typedef T tail;
- // };
- // struct null_typelist
- // { };
- // template < typename Fun >
- // struct cons;
- // template < typename T1 >
- // struct cons < void (*)(T1)>
- // {
- // typedef typelist < T1, null_typelist > type;
- // };
- // template < typename T1, typename T2 >
- // struct cons < void (*)(T1, T2)>
- // {
- // typedef typelist < T1, typelist < T2, null_typelist > > type;
- // };
- // template < typename T1, typename T2, typename T3 >
- // struct cons < void (*)(T1, T2, T3)>
- // {
- // typedef typelist < T1, typelist < T2, typelist < T3,
- // null_typelist > > > type;
- // };
- // #define TYPELIST(a) cons < void (*)a >::type
- // typedef TYPELIST((double, int, bool)) value_types;
- class Any {
- private:
- struct base {
- virtual ~base() { }
- virtual base* clone() const = 0;
- };
- template<typename T, typename V>
- struct data : base {
- data(V T::* const& value)
- :value_(value) { }
- base* clone() const { return new data<T, V>(*this); }
- V T::* value_;
- };
- base* ptr_;
- /* template < typename V >
- friend struct ValueType; */
- public:
- Any()
- :ptr_(nullptr) { }
- template<typename T, typename V>
- Any(V T::* const& value)
- : ptr_(new data<T, V>(value)) { }
- Any(Any const& other)
- :ptr_(other.ptr_ ? other.ptr_->clone() : nullptr) { }
- virtual ~Any() { if (ptr_) delete ptr_; }
- void operator=(Any const& other) { Any(other).swap(*this); }
- void swap(Any& other) { std::swap(ptr_, other.ptr_); }
- template<typename T, typename V>
- V T::* get() const { return dynamic_cast < data<T, V>* >(ptr_)->value_; }
- bool is_null() const { return ptr_ == nullptr; }
- template<typename T, typename V>
- void put(T* o, const V& value)
- {
- V T::* p = dynamic_cast <
- data<T, V>* >(ptr_)->value_;
- o->*(p) = value;
- }
- template<typename T>
- void restore(T* o, const context::Value& value)
- {
- if (value.is_type<double>()) {
- double v;
- value.get_content(v);
- put(o, v);
- } else if (value.is_type<int>()) {
- int v;
- value.get_content(v);
- put(o, v);
- } else if (value.is_type<bool>()) {
- bool v;
- value.get_content(v);
- put(o, v);
- } else if (value.is_type<std::vector<double> >()) {
- std::vector<double> v;
- value.get_content(v);
- put(o, v);
- } else if (value.is_type<std::vector<int> >()) {
- std::vector<int> v;
- value.get_content(v);
- put(o, v);
- } else if (value.is_type<std::vector<bool> >()) {
- std::vector<bool> v;
- value.get_content(v);
- put(o, v);
- } else {
- assert(false);
- }
- }
- template<typename T>
- context::Value save(const T* o) const
- {
- if (ptr_) {
- data<T, double>* q_double =
- dynamic_cast < data<T, double>* >(ptr_);
- if (q_double) {
- return context::Value(o->*(q_double->value_));
- } else {
- data<T, int>* q_int =
- dynamic_cast < data<T, int>* >(ptr_);
- if (q_int) {
- return context::Value(o->*(q_int->value_));
- } else {
- data<T, bool>* q_bool =
- dynamic_cast < data<T, bool>* >(ptr_);
- if (q_bool) {
- return context::Value(o->*(q_bool->value_));
- } else {
- data<T, std::vector<double> >* q_double_v =
- dynamic_cast < data<T, std::vector<
- double> >* >(ptr_);
- if (q_double_v) {
- return context::Value(o->*(q_double_v->value_));
- } else {
- data<T, std::vector<int> >* q_int_v =
- dynamic_cast < data<T, std::vector<
- int> >* >(ptr_);
- if (q_int_v) {
- return context::Value(o->*(q_int_v->value_));
- } else {
- data<T, std::vector<bool> >* q_bool_v =
- dynamic_cast < data<T, std::vector<
- bool> >* >(ptr_);
- if (q_bool_v) {
- return context::Value(
- o->*(q_bool_v->value_));
- }
- }
- }
- }
- }
- }
- }
- assert(false);
- return context::Value();
- }
- template<typename T>
- std::string to_string(const T* o) const
- {
- if (ptr_) {
- data<T, double>* q_double =
- dynamic_cast < data<T, double>* >(ptr_);
- if (q_double) {
- return std::to_string(o->*(q_double->value_));
- } else {
- data<T, int>* q_int =
- dynamic_cast < data<T, int>* >(ptr_);
- if (q_int) {
- return std::to_string(o->*(q_int->value_));
- } else {
- data<T, bool>* q_bool =
- dynamic_cast < data<T, bool>* >(ptr_);
- if (q_bool) {
- return o->*(q_bool->value_) ? "true" : "false";
- } else {
- data<T, std::vector<double> >* q_double_v =
- dynamic_cast < data<T, std::vector<
- double> >* >(ptr_);
- if (q_double_v) {
- return "";
- } else {
- data<T, std::vector<int> >* q_int_v =
- dynamic_cast < data<T, std::vector<
- int> >* >(ptr_);
- if (q_int_v) {
- return "";
- } else {
- data<T, std::vector<bool> >* q_bool_v =
- dynamic_cast < data<T, std::vector<
- bool> >* >(ptr_);
- if (q_bool_v) {
- return "";
- } else {
- return "NA";
- }
- }
- }
- }
- }
- }
- } else {
- return "NA";
- }
- }
- };
- // template < typename C,
- // typename T,
- // typename Seq = std::make_integer_sequence
- // < int, std::tuple_size < T >::value > >
- // struct TupleIterator;
- // template < typename C,
- // typename T,
- // int... S >
- // struct TupleIterator < C, T, std::integer_sequence < int, S... > >
- // {
- // TupleIterator(C caller, const T& val)
- // { result = std::make_tuple(caller(std::get < S >(val))...); }
- // std::tuple < context::Value, context::Value, context::Value > result;
- // };
- // template < typename C, typename T >
- // TupleIterator < C, T > tuple_iterator(C caller, const T& val)
- // {
- // return TupleIterator < C, T >(caller, val);
- // }
- // template < typename T >
- // struct ToValueCaller
- // {
- // ToValueCaller(const Any& any, const T* o) : _any(any), _object(o)
- // { }
- // template < typename Z >
- // context::Value operator()(const Z& data) const
- // { return data.to_value(_any, _object); }
- // const Any& _any;
- // const T* _object;
- // };
- // template < typename V >
- // struct ValueType
- // {
- // template < typename T >
- // context::Value to_value(const Any& any, const T* o) const
- // {
- // Any::data < T, V >* q = dynamic_cast < Any::data < T, V >* >(any.ptr_);
- // if (q) {
- // return context::Value(o->*(q->value_));
- // } else {
- // return context::Value();
- // }
- // }
- // };
- // template < typename Tuple, typename F, size_t... Is >
- // constexpr auto apply_impl(Tuple t, F f, std::index_sequence < Is... >)
- // { return f(std::get < Is >(t)...); }
- // template < typename Tuple, typename F >
- // constexpr auto apply(Tuple t, F f)
- // { return apply_impl(t, f, std::make_index_sequence <
- // std::tuple_size < Tuple >{}>{}); }
- // struct find_not_null_value
- // {
- // context::Value operator()(const context::Value& left,
- // const context::Value& right) const;
- // };
- // template < typename T >
- // static context::Value to_value(const Any& any, const T* o)
- // {
- // auto value_types =
- // std::make_tuple(ValueType < double >(),
- // ValueType < int >(),
- // ValueType < bool >());
- // auto list = tuple_iterator(ToValueCaller < T >(any, o), value_types);
- // auto result = apply(list.result, find_not_null_value{});
- // std::cout << result.to_string() << std::endl;
- // assert(false);
- // }
- }
- }
- #endif
|