cache2.h 33.1 KB
Newer Older
Damien Leroux's avatar
Damien Leroux committed
1
2
3
4
5
6
7
8
9
#ifndef _SPEL_CACHE_2_H_
#define _SPEL_CACHE_2_H_

#include <future>
#include <tuple>
#include <unordered_map>
#include <iostream>
#include <string>
#include <sstream>
10
11
#include "function_wrapper.h"
#include "chrono.h"
Damien Leroux's avatar
Damien Leroux committed
12

13

14
15
16
17
18
19
20
21


struct chrono_trace {
    const std::string& name;
    chrono_trace(const std::string& n) : name(n) { chrono::increment(name); chrono::start(name); }
    ~chrono_trace() { chrono::stop(name); }
};

22
23
24
25
enum CachingPolicy : int { Oneshot = 0, Mem = 1, Disk = 2, Sync = 4 };
constexpr CachingPolicy operator | (CachingPolicy c1, CachingPolicy c2) { return CachingPolicy(int(c1) | int(c2)); }
constexpr CachingPolicy operator & (CachingPolicy c1, CachingPolicy c2) { return CachingPolicy(int(c1) & int(c2)); }

Damien Leroux's avatar
Damien Leroux committed
26
27
28
29
30
#include "error.h"
#include "input.h"
#include "cache/md5.h"
#include "cache/file.h"

31
extern "C" {
32
/*#include <dlfcn.h>*/
33
#include <malloc.h>
34
/*#include <string.h>*/
35
}
36
/*#include <cxxabi.h>*/
37
38
39
40
41
42
43
44

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

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

45
#if 0
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
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);
}
83
#endif
84

Damien Leroux's avatar
Damien Leroux committed
85
86
87
88
89
90
91
92
/* 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; };


93
static inline std::string& cache_directory() { return active_settings->work_directory; }
Damien Leroux's avatar
Damien Leroux committed
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

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;
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145

        bool operator == (const generic_value_interface<T>& gvi) const
        {
            return **this == *gvi;
        }
#if 0
        /*virtual bool equal(const generic_value_interface<T>&) const { return false; }*/
        virtual
            bool equal(const generic_value_interface<T>& gvi) const
            /*override*/
            {
                return **this == *gvi;
                /*return gvi.__equal__(m_storage);*/
            }

        /*virtual bool __equal__(const T&) const = 0;  // { return false; }*/
#endif
Damien Leroux's avatar
Damien Leroux committed
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
    };

/* 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); }

165
        value<T>& operator = (const T& immed)
Damien Leroux's avatar
Damien Leroux committed
166
167
168
169
170
171
        {
            /*m_impl = new immediate_value<T>(immed);*/
            m_impl = std::make_shared<immediate_value<T>>(immed);
            return *this;
        }

172
        value<T>& operator = (std::shared_ptr<generic_value_interface<T>>& new_impl)
Damien Leroux's avatar
Damien Leroux committed
173
174
175
176
177
        {
            m_impl = new_impl;
            return *this;
        }

178
        value<T>& operator = (const value<T>& new_impl)
Damien Leroux's avatar
Damien Leroux committed
179
180
181
182
183
184
185
        {
            m_impl = new_impl.m_impl;
            return *this;
        }

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

186
187
		operator bool () const { return valid(); }

188
189
        /*bool equal(const value<T>& v) const { return m_impl == v.m_impl || m_impl->equal(*v.m_impl); }*/
        bool equal(const value<T>& v) const { return m_impl == v.m_impl || *m_impl == *v.m_impl; }
Damien Leroux's avatar
Damien Leroux committed
190
191
192
193
194
195
196
197

    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); }

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

Damien Leroux's avatar
Damien Leroux committed
201
202
203
204
205
206
207
208
namespace std {
    template <typename T>
        struct hash<value<T>> {
            size_t operator () (const value<T>& v) const
            {
                return v.hash();
            }
        };
209
210
211
212
213
214
215
216
217
218

    template <typename T>
        struct hash<collection<T>> {
            size_t operator () (const collection<T>& c) const
            {
                md5_digest h;
                h.update(c.begin(), c.end());
                return h.context;
            }
        };
Damien Leroux's avatar
Damien Leroux committed
219
220
221
222
223
}

template <typename VT>
std::ostream& operator << (std::ostream& os, const value<VT>& v)
{
224
225
226
227
228
    if (v.valid()) {
        return os << (*v);
    } else {
        return os << "<nil>";
    }
Damien Leroux's avatar
Damien Leroux committed
229
230
231
232
233
234
235
236
237
238
}

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


struct md5_hash_type {
239
    md5_digest md5;
Damien Leroux's avatar
Damien Leroux committed
240
241
242
243
244
245
    std::string accum;
    std::string append;
};



246
#define do_with_arg_pack(_expr) do { using _ = int[]; (void)_{0, ((_expr), void(), 0)...}; } while(0)
Damien Leroux's avatar
Damien Leroux committed
247

248
249
namespace new_redux {
    /* pattern found on http://stackoverflow.com/a/19098481 */
Damien Leroux's avatar
Damien Leroux committed
250

251
252
    template <typename... Args>
        size_t hash(Args... args)
253
        {
254
255
256
257
            size_t accum = 0;
            do_with_arg_pack(accum ^= std::hash<Args>()(args));
            /*using apply_to_pack = int[];*/
            /*(void)apply_to_pack{0, (accum ^= std::hash<Args>()(args), void(), 0)...};*/
258
259
260
            return accum;
        }

261
262
    template <typename... Args>
        md5_digest feed_md5(Args... args)
263
        {
264
265
266
            md5_digest m;
            do_with_arg_pack(m << args);
            return m;
267
268
        }

269
270
    template <typename... Args>
        std::string md5(Args... args)
Damien Leroux's avatar
Damien Leroux committed
271
        {
272
273
            /*do_with_arg_pack(std::cout << args << std::endl);*/
            return feed_md5(args...);
Damien Leroux's avatar
Damien Leroux committed
274
275
        }

276
277
    template <typename... Args>
        std::string md5_append(Args... args)
Damien Leroux's avatar
Damien Leroux committed
278
        {
279
280
281
282
            std::stringstream s;
            do_with_arg_pack(s << md5(args));
            /*std::cout << "* Long MD5 " << s.str() << std::endl;*/
            return s.str();
Damien Leroux's avatar
Damien Leroux committed
283
284
        }

285
}
Damien Leroux's avatar
Damien Leroux committed
286
287

template <typename... Elems>
288
289
290
291
292
size_t compute_hash(const Elems&... e)
{
    /*redux::hash h; return redux::reduce()(0, h, e...);*/
    return new_redux::hash(e...);
}
Damien Leroux's avatar
Damien Leroux committed
293
294
295
296

template <typename... Elems>
std::string compute_md5(const Elems&... e)
{
297
298
299
300
301
    /*md5_digest md;*/
    /*redux::md5 m;*/
    /*redux::reduce()(md, m, e...);*/
    /*return md;*/
    return new_redux::md5(e...);
Damien Leroux's avatar
Damien Leroux committed
302
303
304
}

template <typename... Elems>
305
306
307
308
309
std::string append_md5(const Elems&... e)
{
    /*std::stringstream ss; redux::md5_append ma; return redux::reduce()(ss, ma, e...).str();*/
    return new_redux::md5_append(e...);
}
Damien Leroux's avatar
Damien Leroux committed
310
311
312
313
314
315
316
317
318
319


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)) {}
320
321
        template <typename... Args>
            immediate_value(Args... x) : m_storage(x...) {}
Damien Leroux's avatar
Damien Leroux committed
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341

        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; }
342
#if 0
Damien Leroux's avatar
Damien Leroux committed
343
344
345
346
347
348
        virtual
            bool __equal__(const ValueType& v) const
            override
            {
                return m_storage == v;
            }
349
#endif
Damien Leroux's avatar
Damien Leroux committed
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
395
396
    };


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;

397
        async_computation(CachingPolicy _Sync, computation_function_pointer_type func,
Damien Leroux's avatar
Damien Leroux committed
398
399
400
                          const value<typename clean_type<Args>::type>&... args)
            : dependencies(args...)
            , m_storage()
401
            , m_future(active_settings->enqueue(_Sync, [=] (Args... args) { chrono_trace _(get_func_name(func)); return func(args...); }, *args...))
402
403
            /*, m_future(std::async(std::launch::async, func, *args...))*/
            /*, m_future(std::async(std::launch::deferred, func, *args...))*/
404
            , mutex()
Damien Leroux's avatar
Damien Leroux committed
405
406
        {}

407
        async_computation(CachingPolicy _Sync, std::function<Ret(Args...)>& func,
Damien Leroux's avatar
Damien Leroux committed
408
409
410
                          const value<typename clean_type<Args>::type>&... args)
            : dependencies(args...)
            , m_storage()
411
            , m_future(active_settings->enqueue(_Sync, func, *args...))
412
            /*, m_future(std::async(func, *args...))*/
413
            , mutex()
Damien Leroux's avatar
Damien Leroux committed
414
415
416
417
        {}

        value_type& __get_noconst()
        {
418
            std::unique_lock<std::mutex> read_guard(mutex);
Damien Leroux's avatar
Damien Leroux committed
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
            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;
434
        std::mutex mutex;
Damien Leroux's avatar
Damien Leroux committed
435
436
437
438
439
440
441
    };


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

442
        cached_computation(const std::string& name, Ret (*f) (Args...), const value<typename clean_type<Args>::type>&... args)
Damien Leroux's avatar
Damien Leroux committed
443
444
            : m_name(name)
            , m_func(f)
445
446
447
448
449
450
451
452
453
454
455
456
            /*, m_md5_hash{.accum = compute_md5(args...), .append = append_md5(args...)}*/
        {
            m_md5_hash.md5 = new_redux::feed_md5(args...);
            m_md5_hash.accum = m_md5_hash.md5;
            m_md5_hash.append = new_redux::md5_append(args...);
            /*std::cout << "NEW CACHED_COMPUTATION WITH ARGS" << std::endl;*/
            /*do_with_arg_pack(std::cout << args << std::endl);*/
            /*std::cout << "================================" << std::endl;*/
            /*std::cout << m_md5_hash.accum << std::endl;*/
            /*std::cout << m_md5_hash.append << std::endl;*/
            /*std::cout << "NEW CACHED_COMPUTATION " << m_md5_hash.accum << ' ' << m_md5_hash.append << std::endl;*/
        }
Damien Leroux's avatar
Damien Leroux committed
457
458
459
460

        std::string get_path() const
        {
            std::stringstream ss;
461
462
            ss << cache_directory() << '/' << m_name;
            ensure_directory_exists(ss.str());
463
            /*ss << cache_directory() << '/' << m_name << '_' << m_md5_hash.accum << '_' << typeid(Ret).name();*/
464
            ss << '/' << m_md5_hash.accum;
Damien Leroux's avatar
Damien Leroux committed
465
466
467
            return ss.str();
        }

468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
        bool __load(const std::string& path, Ret& data)
        {
            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('(' << m_name << ") Found data in cache");*/
                ci & data;
            /*     return value read from file */
                return true;
483
484
            } else {
                MSG_WARNING("Collision in cache! " << path);
485
486
487
488
            }
            return false;
        }

Damien Leroux's avatar
Damien Leroux committed
489
490
491
492
493
        Ret operator () (Args... x)
        {
            Ret data;
            std::string path = get_path();
            /* if cache file found */
494
            if (check_file(path, false, true, false)) {
Damien Leroux's avatar
Damien Leroux committed
495
496
497
498
499
500
501
502
503
                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 */
504
                    /*MSG_INFO('(' << m_name << ") Found data in cache");*/
Damien Leroux's avatar
Damien Leroux committed
505
506
507
508
509
                    ci & data;
            /*     return value read from file */
                    return data;
                }
            /*   CACHE INVALID */
510
                /*MSG_INFO('(' << m_name << ") Cache is invalid. Computing data.");*/
Damien Leroux's avatar
Damien Leroux committed
511
512
513
            } else {
            /* else */
            /*   COMPUTE AND SAVE */
514
                /*MSG_INFO('(' << m_name << ") Computing data.");*/
Damien Leroux's avatar
Damien Leroux committed
515
516
517
518
519
            }
            /* compute value = m_func(x...) */
            data = m_func(x...);
            /* write m_md5_hash.append to file */
            std::ofstream ofs(path);
520
521
522
523
524
525
526
527
528
529
530
531
532
533
            {
                cache_output co(ofs);
                co & m_md5_hash.append;
                /* write value to file */
                co & data;
            }
            if (0) { /* check stored data */
                Ret check;
                if (!__load(path, check)) {
                    MSG_ERROR("Failed to load the data we just saved :(", "Call 911");
                } else if (!(check == data)) {
                    MSG_ERROR("The data we just saved is bogus :(", "Call 911");
                }
            }
Damien Leroux's avatar
Damien Leroux committed
534
535
536
537
            /* return value */
            return data;
        }

538
    /*protected:*/
Damien Leroux's avatar
Damien Leroux committed
539
540
541
542
543
544
545
546
547
548
        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;

549
        computed_value(CachingPolicy _Sync, Ret (*func) (Args...), const value<typename clean_type<Args>::type>&... args)
Damien Leroux's avatar
Damien Leroux committed
550
            : m_hash(compute_hash(args...))
551
            , m_task(_Sync, func, args...)
Damien Leroux's avatar
Damien Leroux committed
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
        {}

        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; }

574
    /*protected:*/
Damien Leroux's avatar
Damien Leroux committed
575
576
577
578
579
580
581
582
583
        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;

584
        cached_computed_value(CachingPolicy _Sync, Ret (*func) (Args...), const value<typename clean_type<Args>::type>&... args)
585
            : m_comp(get_func_name(func), func, args...)
Damien Leroux's avatar
Damien Leroux committed
586
            , m_comp_proxy([this](Args... x) { return m_comp(x...); })
587
            , m_task(_Sync, m_comp_proxy, args...)
Damien Leroux's avatar
Damien Leroux committed
588
        {}
589
590
            /*m_hash = m_comp.m_md5_hash.md5.context;*/
        /*}*/
Damien Leroux's avatar
Damien Leroux committed
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605

        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
606
607
608
609
610
611
            size_t hash() const override
            /*override { return m_hash; }*/
            {
                (void)m_task.__get_const();
                return m_comp.m_md5_hash.md5.context;
            }
Damien Leroux's avatar
Damien Leroux committed
612
        virtual
613
614
615
616
617
618
            md5_digest& md5(md5_digest& md) const override
            {
                (void)m_task.__get_const();
                return md.blend(m_comp.m_md5_hash.md5.context);
            }
            /*override { return md; }*/
Damien Leroux's avatar
Damien Leroux committed
619

620
    /*protected:*/
Damien Leroux's avatar
Damien Leroux committed
621
622
623
        cached_computation<Ret(Args...)> m_comp;
        std::function<Ret(Args...)> m_comp_proxy;
        async_computation<Ret(Args...)> m_task;
624
        /*size_t m_hash;*/
Damien Leroux's avatar
Damien Leroux committed
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
    };


/* 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}; }
    };


667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
template <typename _Coll>
    struct as_collection {
        typedef typename _Coll::value_type T;
        typedef typename _Coll::const_iterator ci_type;

        ci_type m_begin, m_end;

        as_collection(const _Coll& c)
            : m_begin(c.begin()), m_end(c.end())
        {}

        struct iterator {
            ci_type ci;
            iterator(const ci_type& it)
                : ci(it)
            {}
            iterator& operator ++ ()
            {
                ++ci;
                return *this;
            }
            bool operator == (const iterator& i) const
            {
                return ci == i.ci;
            }
            bool operator != (const iterator& i) const
            {
                return ci != i.ci;
            }
            value<T> operator * () const { return value<T>{*ci}; }
        };

        iterator begin() const { return {m_begin}; }
        iterator end() const { return {m_end}; }
    };

template <typename _Coll>
as_collection<_Coll> values_of(const _Coll& c) { return {c}; }

Damien Leroux's avatar
Damien Leroux committed
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
#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)
            {
727
                /*MSG_DEBUG("size=" << size() << " finding " << arg << "... " << m_registry[arg]);*/
Damien Leroux's avatar
Damien Leroux committed
728
729
730
731
732
733
734
735
736
737
738
                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)
            {
739
                /*MSG_DEBUG("size=" << size() << " finding " << car << "...");*/
Damien Leroux's avatar
Damien Leroux committed
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
                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_;
}

774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
#if 0
static inline
std::mutex& __get_lock(void* fptr)
{
    struct m_wrap { std::mutex mutex; m_wrap() : mutex() {} m_wrap(const m_wrap&) : mutex() {} };
    static std::unordered_map<void*, m_wrap> _;
    return _[fptr].mutex;
    /*auto it = _.find(fptr);*/
    /*if (it == _.end()) {*/
        /*bool discard;*/
        /*std::tie(it, discard) = _.insert({fptr, {}});*/
    /*}*/
    /*return it->second;*/
}
#endif
Damien Leroux's avatar
Damien Leroux committed
789
790
791
792
793
794

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


template <typename Ret, typename... Args>
795
796
797
struct with_disk_cache_traits {
	typedef cached_computed_value<Ret(Args...)> type;
};
Damien Leroux's avatar
Damien Leroux committed
798
799

template <typename Ret, typename... Args>
800
801
802
struct without_disk_cache_traits {
	typedef computed_value<Ret(Args...)> type;
};
Damien Leroux's avatar
Damien Leroux committed
803

804
805
template <int _Policy, typename Ret, typename... Args>
struct disk_cache_traits;
Damien Leroux's avatar
Damien Leroux committed
806

807
template <typename Ret, typename... Args>
808
struct disk_cache_traits<Oneshot, Ret, Args...> : without_disk_cache_traits<Ret, Args...> {};
809
810

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

813
814
815
816
817
818
819
template <typename Ret, typename... Args>
struct with_mem_cache_traits {
	typedef value<Ret>& return_type;

	template <typename _Maker>
		static
		return_type
820
		create(CachingPolicy _Sync, Ret (&f) (Args...), const clean_value_type<Args>&... x)
821
		{
822
823
            static std::mutex _;
            std::unique_lock<std::mutex> lock_guard(_);
824
825
826
			/*MSG_DEBUG("new value with mem cache");*/
			return_type ret = __get_registry<Ret, Args...>().get(&f, x...);
			if (!ret.valid()) {
827
				ret = new _Maker(_Sync, f, x...);
828
829
830
831
832
833
834
835
836
837
838
839
			}
			return ret;
		}
};

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

	template <typename _Maker>
		static
		return_type
840
		create(CachingPolicy _Sync, Ret (&f) (Args...), const clean_value_type<Args>&... x)
841
842
		{
			/*MSG_DEBUG("new value without mem cache");*/
843
			return_type ret = new _Maker(_Sync, f, x...);
844
845
846
847
848
849
850
851
			return ret;
		}
};

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

template <typename Ret, typename... Args>
852
struct mem_cache_traits<Oneshot, Ret, Args...> : without_mem_cache_traits<Ret, Args...> {};
853
854

template <typename Ret, typename... Args>
855
struct mem_cache_traits<Mem, Ret, Args...> : with_mem_cache_traits<Ret, Args...> {};
856

857
858
template <CachingPolicy _Policy = Oneshot, typename Ret, typename... Args>
typename mem_cache_traits<_Policy & Mem, Ret, Args...>::return_type
859
860
make_value(Ret (&f) (Args...), const clean_value_type<Args>&... x)
{
861
862
863
	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>(_Policy & Sync, f, x...);
864
}
Damien Leroux's avatar
Damien Leroux committed
865
866
867

template <typename T> struct collection : std::vector<value<T>> {
    using std::vector<value<T>>::vector;
868
869
870
871
872
873
874
875
876
    using std::vector<value<T>>::operator [];
    template <typename INTEGRAL_TYPE>
        value<T>&
        operator [] (const value<INTEGRAL_TYPE>& i)
        { return (*this)[*i]; }
    template <typename INTEGRAL_TYPE>
        const value<T>&
        operator [] (const value<INTEGRAL_TYPE>& i) const
        { return (*this)[*i]; }
Damien Leroux's avatar
Damien Leroux committed
877
878
};

879
880
template <typename... X> struct tuple;

881
template <CachingPolicy C, typename F, typename R, typename P> struct make_coll_impl;
Damien Leroux's avatar
Damien Leroux committed
882
883
884
885
886
887
888
889
890
891

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;
892
template <> struct type_lists_must_be_identical<tuple<>, tuple<>> {};
Damien Leroux's avatar
Damien Leroux committed
893
894

template <typename A0, typename... A, typename B0, typename... B>
895
896
    struct type_lists_must_be_identical<tuple<A0, A...>, tuple<B0, B...>>
            : type_lists_must_be_identical<tuple<A...>, tuple<B...>> {
Damien Leroux's avatar
Damien Leroux committed
897
898
899
        static_assert(types_must_be_identical<A0, B0>::value, "INVALID PARAMETER TYPE.");
    };

900
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename... ErrArgs>
901
struct make_coll_impl<_Policy, Ret(FuncArgs...), tuple<>, tuple<ErrArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
902
903
904
905
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      ErrArgs... errargs)
    {
906
        type_lists_must_be_identical<tuple<FuncArgs...>, tuple<typename ErrArgs::value_type...>>();
907
        coll.push_back(make_value<_Policy>(f, errargs...));
Damien Leroux's avatar
Damien Leroux committed
908
909
910
    }
};

911
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs>
912
struct make_coll_impl<_Policy, Ret(FuncArgs...), tuple<>, tuple<clean_value_type<FuncArgs>...>> {
Damien Leroux's avatar
Damien Leroux committed
913
914
915
916
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const value<typename clean_type<FuncArgs>::type>&... pargs)
    {
917
        coll.push_back(make_value<_Policy>(f, pargs...));
Damien Leroux's avatar
Damien Leroux committed
918
919
920
921
    }
};


922
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename VT, typename... ArgsRemaining, typename... PreviousArgs>
923
struct make_coll_impl<_Policy, Ret(FuncArgs...), tuple<value<VT>, ArgsRemaining...>, tuple<PreviousArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
924
925
926
927
928
929
930
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const value<VT>& car,
                      const ArgsRemaining&... cdr,
                      const PreviousArgs&... pargs)
    {
        make_coll_impl<
931
			_Policy,
Damien Leroux's avatar
Damien Leroux committed
932
            Ret(FuncArgs...),
933
934
            tuple<ArgsRemaining...>,
            tuple<PreviousArgs..., value<VT>>>() (coll, f, cdr..., pargs..., car);
Damien Leroux's avatar
Damien Leroux committed
935
936
937
    }
};

938
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename T, typename... ArgsRemaining, typename... PreviousArgs>
939
struct make_coll_impl<_Policy, Ret(FuncArgs...), tuple<range<T>, ArgsRemaining...>, tuple<PreviousArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
940
941
942
943
944
945
946
947
948
    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<
949
				_Policy,
Damien Leroux's avatar
Damien Leroux committed
950
                Ret(FuncArgs...),
951
952
                tuple<ArgsRemaining...>,
                tuple<PreviousArgs..., vtype>>() (coll, f, cdr..., pargs..., v);
Damien Leroux's avatar
Damien Leroux committed
953
954
955
956
        }
    }
};

957
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename T, typename... ArgsRemaining, typename... PreviousArgs>
958
struct make_coll_impl<_Policy, Ret(FuncArgs...), tuple<collection<T>, ArgsRemaining...>, tuple<PreviousArgs...>> {
Damien Leroux's avatar
Damien Leroux committed
959
960
961
962
963
964
965
966
967
    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<
968
				_Policy,
Damien Leroux's avatar
Damien Leroux committed
969
                Ret(FuncArgs...),
970
971
                tuple<ArgsRemaining...>,
                tuple<PreviousArgs..., vtype>>() (coll, f, cdr..., pargs..., v);
Damien Leroux's avatar
Damien Leroux committed
972
973
974
975
        }
    }
};

976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
template <CachingPolicy _Policy, typename Ret, typename... FuncArgs, typename T, typename... ArgsRemaining, typename... PreviousArgs>
struct make_coll_impl<_Policy, Ret(FuncArgs...), tuple<as_collection<T>, ArgsRemaining...>, tuple<PreviousArgs...>> {
    void operator () (collection<Ret>& coll,
                      Ret (&f) (FuncArgs...),
                      const as_collection<T>& car,
                      const ArgsRemaining&... cdr,
                      const PreviousArgs&... pargs)
    {
        typedef value<typename T::value_type> vtype;
        for (const vtype& v: car) {
            make_coll_impl<
				_Policy,
                Ret(FuncArgs...),
                tuple<ArgsRemaining...>,
                tuple<PreviousArgs..., vtype>>() (coll, f, cdr..., pargs..., v);
        }
    }
};

Damien Leroux's avatar
Damien Leroux committed
995
996


997
template <CachingPolicy _Policy = Oneshot, typename Ret, typename... Args, typename... CollArgs>
Damien Leroux's avatar
Damien Leroux committed
998
999
1000
collection<Ret>
make_collection(Ret (&f) (Args...), CollArgs... args)
{