cache2.h 27 KB
Newer Older
Damien Leroux's avatar
Damien Leroux committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
#ifndef _SPEL_CACHE_2_H_
#define _SPEL_CACHE_2_H_

#include <future>
#include <tuple>
#include <unordered_map>
#include <iostream>
#include <string>
#include <sstream>

#include "error.h"
#include "input.h"
#include "cache/md5.h"
#include "cache/file.h"

16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
extern "C" {
#include <dlfcn.h>
#include <malloc.h>
#include <string.h>
}
#include <cxxabi.h>

/*
char*
__cxa_demangle(const char* __mangled_name, char* __output_buffer, size_t* __length, int* __status);
*/

/*using demangle = abi::__cxa_demangle;*/

static inline
std::unordered_map<void*, std::string>&
demangled_names_registry()
{
	static std::unordered_map<void*, std::string> _;
	return _;
}


template <typename Ret, typename... Args>
std::string&
get_func_name(Ret (*f) (Args...))
{
	union {
		Ret (*fptr) (Args...);
		void* vptr;
	} tmp = {f};
	std::string& ret = demangled_names_registry()[tmp.vptr];
	if (!ret.size()) {
		Dl_info info;
		dladdr(tmp.vptr, &info);
		int status = 0;
		char* buf = abi::__cxa_demangle(info.dli_sname, NULL, 0, &status);
		ret.assign(buf, strchr(buf, '('));
		free(buf);
		/*std::cout << tmp.vptr << " => " << info.dli_sname << std::endl;*/
	}
	return ret;
}


template <typename Ret, typename... Args>
std::string&
get_func_name(Ret (&f) (Args...))
{
	return get_func_name(&f);
}


Damien Leroux's avatar
Damien Leroux committed
69
70
71
72
73
74
75
76
/* forward */ struct md5_digest;

template <typename X> struct clean_type { typedef typename std::remove_reference<X>::type type; };
template <typename X> struct clean_type<const X&> { typedef X type; };
template <typename X> struct clean_type<X&> { typedef X type; };
template <typename X> struct clean_type<const X> { typedef X type; };


77
static inline std::string& cache_directory() { return active_settings->work_directory; }
Damien Leroux's avatar
Damien Leroux committed
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154

template <typename T> struct generic_value_interface;
template <typename T> struct value;
template <typename T> struct range;
template <typename T> struct collection;

template <typename T> struct fail : std::integral_constant<bool, false> {};

template <typename T> struct value<collection<T>> { static_assert(fail<T>::value, "Can't instantiate this"); };


template <typename T> struct immediate_value;

template <typename FuncType> struct async_computation;
template <typename FuncType> struct cached_computation;
template <typename FuncType> struct computed_value_factory;
template <typename FuncType> struct computed_value;
template <typename FuncType> struct cached_computed_value;

/* a value<T> behaves as a pointer to T */

template <typename T>
    struct generic_value_interface {
        typedef T value_type;

        virtual ~generic_value_interface() {}

        virtual value_type& operator * () = 0;
        virtual value_type* operator -> () = 0;

        virtual const value_type& operator * () const = 0;
        virtual const value_type* operator -> () const = 0;

        virtual size_t hash() const = 0;
        virtual md5_digest& md5(md5_digest&) const = 0;
        virtual bool equal(const generic_value_interface<T>&) const { return false; }
        virtual bool __equal__(const T&) const { return false; }
    };

/* Lightweight */
template <typename T>
    struct value {
        typedef T value_type;

        value() : m_impl() {}
        value(generic_value_interface<T>* v) : m_impl(v) {}
        value(const T& immed) : m_impl(new immediate_value<T>(immed)) {}
        value(T&& immed) : m_impl(new immediate_value<T>(std::forward<T>(immed))) {}

        value_type& operator * () { return m_impl->operator * (); }
        value_type* operator -> () { return m_impl->operator -> (); }
        const value_type& operator * () const { return m_impl->operator * (); }
        const value_type* operator -> () const { return m_impl->operator -> (); }
        size_t hash() const { return m_impl->hash(); }
        md5_digest& md5(md5_digest& md) const { return m_impl->md5(md); }

        value<T> operator = (const T& immed)
        {
            /*m_impl = new immediate_value<T>(immed);*/
            m_impl = std::make_shared<immediate_value<T>>(immed);
            return *this;
        }

        value<T> operator = (std::shared_ptr<generic_value_interface<T>>& new_impl)
        {
            m_impl = new_impl;
            return *this;
        }

        value<T> operator = (const value<T>& new_impl)
        {
            m_impl = new_impl.m_impl;
            return *this;
        }

        bool valid() const { return (bool) m_impl; }

155
156
		operator bool () const { return valid(); }

Damien Leroux's avatar
Damien Leroux committed
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
        bool equal(const value<T>& v) const { return m_impl == v.m_impl || m_impl->equal(*v.m_impl); }

    protected:
        std::shared_ptr<generic_value_interface<T>> m_impl;
    };

template <typename T>
bool operator == (const value<T>& v1, const value<T>& v2) { return v1.equal(v2); }

namespace std {
    template <typename T>
        struct hash<value<T>> {
            size_t operator () (const value<T>& v) const
            {
                return v.hash();
            }
        };
}

template <typename VT>
std::ostream& operator << (std::ostream& os, const value<VT>& v)
{
    return os << (*v);
}

template <typename VT>
md5_digest& operator << (md5_digest& md5, const value<VT>& v)
{
    return v.md5(md5);
}


struct md5_hash_type {
    std::string accum;
    std::string append;
};


namespace redux {
template <typename Functor, typename... Elems> struct reduce_impl;

template <typename Functor, typename Elem>
    struct reduce_impl<Functor, Elem> {
        template <typename accum_type>
        void operator () (Functor& f, accum_type& accum, const Elem& e)
        {
            /*std::cout << "final e=" << e << std::endl;*/
            f(accum, e);
        }
    };

template <typename Functor, typename Elem, typename... Elems>
    struct reduce_impl<Functor, Elem, Elems...> {
        template <typename accum_type>
        void operator () (Functor& f, accum_type& accum, const Elem& e, const Elems&... x)
        {
            /*std::cout << "e=" << e << std::endl;*/
            f(accum, e);
            reduce_impl<Functor, Elems...>()(f, accum, x...);
        }
    };

struct reduce {
220
221
222
223
224
225
226
227
228
229
230
231
232
233
    template <typename Functor>
        auto operator () (typename Functor::accum_type accum, Functor&)
            -> typename Functor::accum_type
        {
            return accum;
        }

    template <typename Functor>
        auto operator () (Functor&)
            -> typename Functor::accum_type
        {
            return typename Functor::accum_type();
        }

Damien Leroux's avatar
Damien Leroux committed
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
    template <typename Functor, typename... Elems>
        auto operator () (typename Functor::accum_type accum, Functor& f, const Elems&... e)
            -> typename Functor::accum_type
        {
            reduce_impl<Functor, Elems...>()(f, accum, e...);
            return accum;
        }

    template <typename Functor, typename... Elems>
        auto operator () (Functor& f, const Elems&... e)
            -> typename Functor::accum_type
        {
            typename Functor::accum_type accum = typename Functor::accum_type();
            reduce_impl<Functor, Elems...>()(f, accum, e...);
            return accum;
        }
};

struct hash {
    typedef size_t accum_type;
    template <typename T>
        void operator () (size_t accum, const T& t) { accum = accum ^ std::hash<T>()(t); }
    template <typename VT>
        void operator () (size_t accum, const value<VT>& v) { accum = accum ^ v.hash(); }
};

struct md5 {
    typedef md5_digest& accum_type;
    template <typename T>
        void operator () (md5_digest& md, const T& t) { md << t; }
    template <typename VT>
        void operator () (md5_digest& md, const value<VT>& v) { v.md5(md); }
};

struct md5_append {
    typedef std::stringstream& accum_type;
    template <typename T>
        void operator () (std::stringstream& ss, const T& t)
        {
            md5_digest md;
            md << t;
            ss << (std::string) md;
        }
    template <typename VT>
        void operator () (std::stringstream& ss, const value<VT>& t)
        {
            md5_digest md;
            ss << (std::string) t.md5(md);
        }
};
} /* namespace redux */

template <typename... Elems>
size_t compute_hash(const Elems&... e) { redux::hash h; return redux::reduce()(0, h, e...); }

template <typename... Elems>
std::string compute_md5(const Elems&... e)
{
    md5_digest md;
    redux::md5 m;
    redux::reduce()(md, m, e...);
    return md;
}

template <typename... Elems>
std::string append_md5(const Elems&... e) { std::stringstream ss; redux::md5_append ma; return redux::reduce()(ss, ma, e...).str(); }


template <typename ValueType>
    struct immediate_value : generic_value_interface<ValueType> {
        typedef ValueType value_type;

        value_type m_storage;

        immediate_value(const ValueType& v) : m_storage(v) {}
        immediate_value(ValueType&& v) : m_storage(std::forward<ValueType>(v)) {}

        virtual
            value_type& operator * ()
            override { return m_storage; }
        virtual
            value_type* operator -> ()
            override { return &m_storage; }
        virtual
            const value_type& operator * () const
            override { return m_storage; }
        virtual
            const value_type* operator -> () const
            override { return &m_storage; }

        virtual
            size_t hash() const
            override { return std::hash<ValueType>()(m_storage); }
        virtual
            md5_digest& md5(md5_digest& md) const
            override { return md << m_storage; }

        virtual
            bool equal(const generic_value_interface<ValueType>& gvi) const
            override
            {
                return gvi.__equal__(m_storage);
            }

        virtual
            bool __equal__(const ValueType& v) const
            override
            {
                return m_storage == v;
            }
    };


template <typename ValueType>
    struct unique_value : generic_value_interface<ValueType> {
        typedef ValueType value_type;

        value_type m_storage;

        unique_value(const ValueType& v) : m_storage(v) {}
        unique_value(ValueType&& v) : m_storage(std::forward<ValueType>(v)) {}
        unique_value() : m_storage() {}

        virtual
            value_type& operator * ()
            override { return m_storage; }
        virtual
            value_type* operator -> ()
            override { return &m_storage; }
        virtual
            const value_type& operator * () const
            override { return m_storage; }
        virtual
            const value_type* operator -> () const
            override { return &m_storage; }

        virtual
            size_t hash() const
            override { return std::hash<const void*>()(this); }
        virtual
            md5_digest& md5(md5_digest& md) const
            override { return md << m_storage; }
    };

/*template <typename M, typename R, typename C>*/
    /*struct immediate_value<labelled_matrix<M, R, C>>*/
        /*: unique_value<labelled_matrix<M, R, C>> {};*/



template <typename Ret, typename... Args>
    struct async_computation<Ret(Args...)> {
        typedef async_computation<Ret(Args...)> this_type;
        typedef Ret value_type;
        typedef Ret (*computation_function_pointer_type) (Args...);
        typedef std::packaged_task<Ret(Args...)> task_type;

        async_computation(computation_function_pointer_type func,
                          const value<typename clean_type<Args>::type>&... args)
            : dependencies(args...)
            , m_storage()
395
396
397
            , m_future(active_settings->enqueue(func, *args...))
            /*, m_future(std::async(std::launch::async, func, *args...))*/
            /*, m_future(std::async(std::launch::deferred, func, *args...))*/
Damien Leroux's avatar
Damien Leroux committed
398
399
400
401
402
403
        {}

        async_computation(std::function<Ret(Args...)>& func,
                          const value<typename clean_type<Args>::type>&... args)
            : dependencies(args...)
            , m_storage()
404
405
            , m_future(active_settings->enqueue(func, *args...))
            /*, m_future(std::async(func, *args...))*/
Damien Leroux's avatar
Damien Leroux committed
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
        {}

        value_type& __get_noconst()
        {
            if (m_future.valid()) {
                return m_storage = m_future.get();
            }
            return m_storage;
        }

        const value_type& __get_const() const
        {
            return const_cast<this_type*>(this)->__get_noconst();
        }

    protected:
        std::tuple<value<typename clean_type<Args>::type>...> dependencies;
        value_type m_storage;
        std::future<Ret> m_future;
    };


template <typename Ret, typename... Args>
    struct cached_computation<Ret(Args...)> {
        typedef Ret value_type;

        cached_computation(const std::string& name, Ret (*f) (Args...), const value<Args>&... args)
            : m_name(name)
            , m_func(f)
            , m_md5_hash{.accum = compute_md5(args...), .append = append_md5(args...)}
        {}

        std::string get_path() const
        {
            std::stringstream ss;
            ss << cache_directory() << '/' << m_name << '_' << m_md5_hash.accum << '_' << typeid(Ret).name();
            return ss.str();
        }

        Ret operator () (Args... x)
        {
            Ret data;
            std::string path = get_path();
            /* if cache file found */
            if (check_file(path, false, true)) {
                std::ifstream ifs(path);
                cache_input ci(ifs);
                std::string check;
            /*   read string */
                ci & check;
            /*   compare to m_md5_hash.append */
                if (check == m_md5_hash.append) {
            /*   if same */
            /*     CACHE FOUND */
                    MSG_INFO("Found data in cache");
                    ci & data;
            /*     return value read from file */
                    return data;
                }
            /*   CACHE INVALID */
                MSG_INFO("Cache is invalid. Computing data.");
            } else {
            /* else */
            /*   COMPUTE AND SAVE */
                MSG_INFO("Computing data.");
            }
            /* compute value = m_func(x...) */
            data = m_func(x...);
            /* write m_md5_hash.append to file */
            std::ofstream ofs(path);
            cache_output co(ofs);
            co & m_md5_hash.append;
            /* write value to file */
            co & data;
            /* return value */
            return data;
        }

    protected:
        std::string m_name;
        Ret (*m_func) (Args...);
        md5_hash_type m_md5_hash;
    };


template <typename Ret, typename... Args>
    struct computed_value<Ret(Args...)> : generic_value_interface<Ret> {
        typedef Ret value_type;
        typedef std::function<Ret(Args...)> computation_type;

        computed_value(Ret (*func) (Args...), const value<typename clean_type<Args>::type>&... args)
            : m_hash(compute_hash(args...))
            , m_task(func, args...)
        {}

        virtual
            value_type& operator * ()
            override { return m_task.__get_noconst(); }
        virtual
            value_type* operator -> ()
            override { return &m_task.__get_noconst(); }
        virtual
            const value_type& operator * () const
            override { return m_task.__get_const(); }
        virtual
            const value_type* operator -> () const
            override { return &m_task.__get_const(); }

        virtual
            size_t hash() const
            override { return m_hash; }
        virtual
            md5_digest& md5(md5_digest& md) const
            override { return md; }

    protected:
        size_t m_hash;
        async_computation<Ret(Args...)> m_task;
    };

template <typename Ret, typename... Args>
    struct cached_computed_value<Ret(Args...)> : generic_value_interface<Ret> {
        typedef Ret value_type;
        typedef std::function<Ret(Args...)> computation_type;

531
        cached_computed_value(Ret (*func) (Args...), const value<Args>&... args)
Damien Leroux's avatar
Damien Leroux committed
532
            : m_hash(compute_hash(args...))
533
            , m_comp(get_func_name(func), func, args...)
Damien Leroux's avatar
Damien Leroux committed
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
            , m_comp_proxy([this](Args... x) { return m_comp(x...); })
            , m_task(m_comp_proxy, args...)
        {}

        virtual
            value_type& operator * ()
            override { return m_task.__get_noconst(); }
        virtual
            value_type* operator -> ()
            override { return &m_task.__get_noconst(); }
        virtual
            const value_type& operator * () const
            override { return m_task.__get_const(); }
        virtual
            const value_type* operator -> () const
            override { return &m_task.__get_const(); }

        virtual
            size_t hash() const
            override { return m_hash; }
        virtual
            md5_digest& md5(md5_digest& md) const
            override { return md; }

    protected:
        size_t m_hash;
        cached_computation<Ret(Args...)> m_comp;
        std::function<Ret(Args...)> m_comp_proxy;
        async_computation<Ret(Args...)> m_task;
    };


/* ranges and collections */

/* T must have operators + and < */
template <typename T>
    struct range {
        T m_min, m_max, m_step;
        range(T min, T max, T step)
            : m_min(min), m_max(max), m_step(step)
        {}
        struct iterator {
            value<T> m_data;
            T m_step;
            T m_max;
            iterator(T value, T max, T step)
                : m_data(new immediate_value<T>(value)), m_step(step), m_max(max)
            {}
            iterator& operator ++ ()
            {
                *m_data += m_step;
                if (*m_data > m_max) {
                    *m_data = m_max;
                }
                return *this;
            }
            bool operator == (const iterator& i) const
            {
                return *m_data == *i.m_data;
            }
            bool operator != (const iterator& i) const
            {
                return *m_data != *i.m_data;
            }
            const value<T>& operator * () const { return m_data; }
        };
        iterator begin() const { return {m_min, m_max, m_step}; }
        iterator end() const { return {m_max, m_max, 0}; }
    };


#if 0
template <typename ValueType, typename... AllArgs> struct registry_impl_type;
template <typename ValueType>
    struct registry_impl_type<ValueType> { typedef ValueType type; };
template <typename ValueType, typename Arg0, typename... OtherArgs>
    struct registry_impl_type<ValueType, Arg0, OtherArgs...> {
        typedef std::unordered_map<Arg0, registry_impl_type<ValueType, OtherArgs...>::type> type;
    };
#endif

template <typename ValueType, typename... AllArgs>
struct computation_registry {
    typedef ValueType value_type;

    template <typename... Args> struct registry_impl;

    template <typename Arg0>
        struct registry_impl<Arg0> {
            std::unordered_map<Arg0, value_type> m_registry;
            value_type& get_(const Arg0& arg)
            {
                return m_registry[arg];
            }

            size_t size() const { return m_registry.size(); }
        };

    template <typename Arg0, typename... Args>
        struct registry_impl<Arg0, Args...> {
            std::unordered_map<Arg0, registry_impl<Args...>> m_registry;
            value_type& get_(const Arg0& car, const Args&... cdr)
            {
                return m_registry[car].get_(cdr...);
            }

            size_t size() const
            {
                size_t accum = 0;
                for (auto& kv: m_registry) {
                    accum += kv.second.size();
                }
                return accum;
            }
        };

    registry_impl<AllArgs...> m_registry;

    template <typename... Args>
        value_type& get(const Args&... args)
        {
            return m_registry.get_(args...);
        }

    size_t size() const { return m_registry.size(); }
};


template <typename Ret, typename... Args>
computation_registry<value<Ret>, Ret (*) (Args...), value<typename clean_type<Args>::type>...>&
__get_registry()
{
    static computation_registry<value<Ret>, Ret (*) (Args...), value<typename clean_type<Args>::type>...> _reg_;
    /*MSG_DEBUG("Registry at " << (&_reg_));*/
    return _reg_;
}



template <typename VT>
using clean_value_type = value<typename clean_type<VT>::type>;


677
678
enum CachingPolicy : int { oneshot = 0, mem = 1, disk = 2, mem_and_disk = 3 };

Damien Leroux's avatar
Damien Leroux committed
679
template <typename Ret, typename... Args>
680
681
682
struct with_disk_cache_traits {
	typedef cached_computed_value<Ret(Args...)> type;
};
Damien Leroux's avatar
Damien Leroux committed
683
684

template <typename Ret, typename... Args>
685
686
687
struct without_disk_cache_traits {
	typedef computed_value<Ret(Args...)> type;
};
Damien Leroux's avatar
Damien Leroux committed
688

689
690
template <int _Policy, typename Ret, typename... Args>
struct disk_cache_traits;
Damien Leroux's avatar
Damien Leroux committed
691

692
693
694
695
696
template <typename Ret, typename... Args>
struct disk_cache_traits<oneshot, Ret, Args...> : without_disk_cache_traits<Ret, Args...> {};

template <typename Ret, typename... Args>
struct disk_cache_traits<disk, Ret, Args...> : with_disk_cache_traits<Ret, Args...> {};
Damien Leroux's avatar
Damien Leroux committed
697

698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
template <typename Ret, typename... Args>
struct with_mem_cache_traits {
	typedef value<Ret>& return_type;

	template <typename _Maker>
		static
		return_type
		create(Ret (&f) (Args...), const clean_value_type<Args>&... x)
		{
			/*MSG_DEBUG("new value with mem cache");*/
			return_type ret = __get_registry<Ret, Args...>().get(&f, x...);
			if (!ret.valid()) {
				ret = new _Maker(f, x...);
			}
			return ret;
		}
};

template <typename Ret, typename... Args>
struct without_mem_cache_traits {
	typedef value<Ret> return_type;

	template <typename _Maker>
		static
		return_type
		create(Ret (&f) (Args...), const clean_value_type<Args>&... x)
		{
			/*MSG_DEBUG("new value without mem cache");*/
			return_type ret = new _Maker(f, x...);
			return ret;
		}
};

template <int _Policy, typename Ret, typename... Args>
struct mem_cache_traits;

template <typename Ret, typename... Args>
struct mem_cache_traits<oneshot, Ret, Args...> : without_mem_cache_traits<Ret, Args...> {};

template <typename Ret, typename... Args>
struct mem_cache_traits<mem, Ret, Args...> : with_mem_cache_traits<Ret, Args...> {};

template <CachingPolicy _Policy = oneshot, typename Ret, typename... Args>
typename mem_cache_traits<_Policy & mem, Ret, Args...>::return_type
make_value(Ret (&f) (Args...), const clean_value_type<Args>&... x)
{
	typedef mem_cache_traits<_Policy & mem, Ret, Args...> mem_policy;
	typedef disk_cache_traits<_Policy & disk, Ret, Args...> disk_policy;
	return mem_policy::template create<typename disk_policy::type>(f, x...);
}
Damien Leroux's avatar
Damien Leroux committed
748
749
750
751
752

template <typename T> struct collection : std::vector<value<T>> {
    using std::vector<value<T>>::vector;
};

753
template <CachingPolicy C, typename F, typename R, typename P> struct make_coll_impl;
Damien Leroux's avatar
Damien Leroux committed
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771

template <typename A, typename B> struct types_must_be_identical : std::integral_constant<bool, false> {};
template <> struct types_must_be_identical<int, double> : std::integral_constant<bool, false> {};
template <> struct types_must_be_identical<double, int> : std::integral_constant<bool, false> {};
template <typename A> struct types_must_be_identical<A, A> : std::integral_constant<bool, true> {};
template <typename A> struct types_must_be_identical<const A&, A> : std::integral_constant<bool, true> {};
template <typename A> struct types_must_be_identical<A&, A> : std::integral_constant<bool, true> {};
template <typename A> struct types_must_be_identical<const A, A> : std::integral_constant<bool, true> {};

template <typename LA, typename LB> struct type_lists_must_be_identical;
template <> struct type_lists_must_be_identical<std::tuple<>, std::tuple<>> {};

template <typename A0, typename... A, typename B0, typename... B>
    struct type_lists_must_be_identical<std::tuple<A0, A...>, std::tuple<B0, B...>>
            : type_lists_must_be_identical<std::tuple<A...>, std::tuple<B...>> {
        static_assert(types_must_be_identical<A0, B0>::value, "INVALID PARAMETER TYPE.");
    };

772
773
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename... ErrArgs>
struct make_coll_impl<_Policy, Ret(FuncArgs...), std::tuple<>, std::tuple<ErrArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
774
775
776
777
778
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      ErrArgs... errargs)
    {
        type_lists_must_be_identical<std::tuple<FuncArgs...>, std::tuple<typename ErrArgs::value_type...>>();
779
        coll.push_back(make_value<_Policy>(f, errargs...));
Damien Leroux's avatar
Damien Leroux committed
780
781
782
    }
};

783
784
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs>
struct make_coll_impl<_Policy, Ret(FuncArgs...), std::tuple<>, std::tuple<clean_value_type<FuncArgs>...>> {
Damien Leroux's avatar
Damien Leroux committed
785
786
787
788
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const value<typename clean_type<FuncArgs>::type>&... pargs)
    {
789
        coll.push_back(make_value<_Policy>(f, pargs...));
Damien Leroux's avatar
Damien Leroux committed
790
791
792
793
    }
};


794
795
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename VT, typename... ArgsRemaining, typename... PreviousArgs>
struct make_coll_impl<_Policy, Ret(FuncArgs...), std::tuple<value<VT>, ArgsRemaining...>, std::tuple<PreviousArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
796
797
798
799
800
801
802
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const value<VT>& car,
                      const ArgsRemaining&... cdr,
                      const PreviousArgs&... pargs)
    {
        make_coll_impl<
803
			_Policy,
Damien Leroux's avatar
Damien Leroux committed
804
805
806
807
808
809
            Ret(FuncArgs...),
            std::tuple<ArgsRemaining...>,
            std::tuple<PreviousArgs..., value<VT>>>() (coll, f, cdr..., pargs..., car);
    }
};

810
811
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename T, typename... ArgsRemaining, typename... PreviousArgs>
struct make_coll_impl<_Policy, Ret(FuncArgs...), std::tuple<range<T>, ArgsRemaining...>, std::tuple<PreviousArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
812
813
814
815
816
817
818
819
820
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const range<T>& car,
                      const ArgsRemaining&... cdr,
                      const PreviousArgs&... pargs)
    {
        typedef value<T> vtype;
        for (const vtype& v: car) {
            make_coll_impl<
821
				_Policy,
Damien Leroux's avatar
Damien Leroux committed
822
823
824
825
826
827
828
                Ret(FuncArgs...),
                std::tuple<ArgsRemaining...>,
                std::tuple<PreviousArgs..., vtype>>() (coll, f, cdr..., pargs..., v);
        }
    }
};

829
830
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename T, typename... ArgsRemaining, typename... PreviousArgs>
struct make_coll_impl<_Policy, Ret(FuncArgs...), std::tuple<collection<T>, ArgsRemaining...>, std::tuple<PreviousArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
831
832
833
834
835
836
837
838
839
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const collection<T>& car,
                      const ArgsRemaining&... cdr,
                      const PreviousArgs&... pargs)
    {
        typedef value<T> vtype;
        for (const vtype& v: car) {
            make_coll_impl<
840
				_Policy,
Damien Leroux's avatar
Damien Leroux committed
841
842
843
844
845
846
847
848
849
                Ret(FuncArgs...),
                std::tuple<ArgsRemaining...>,
                std::tuple<PreviousArgs..., vtype>>() (coll, f, cdr..., pargs..., v);
        }
    }
};



850
template <CachingPolicy _Policy = oneshot, typename Ret, typename... Args, typename... CollArgs>
Damien Leroux's avatar
Damien Leroux committed
851
852
853
854
collection<Ret>
make_collection(Ret (&f) (Args...), CollArgs... args)
{
    collection<Ret> ret;
855
    make_coll_impl<_Policy, Ret(Args...), std::tuple<CollArgs...>, std::tuple<>>() (ret, f, args...);
Damien Leroux's avatar
Damien Leroux committed
856
857
858
859
860
861
    return ret;
}


#endif