├── sample
    ├── fib.cpp
    ├── instantiation_diagram.png
    ├── Makefile
    ├── fib.hpp
    ├── instantiated_templates.txt
    ├── instantiation_diagram.dot
    ├── fib.xml
    └── instantiation_diagram.svg
├── instantiated_templates
├── instantiation_diagram
├── README.md
└── LICENSE.md


/sample/fib.cpp:
--------------------------------------------------------------------------------
1 | #include "fib.hpp"
2 | 
3 | int main()
4 | {
5 |   return lazy_fib<int_<3> >::type::value;
6 | }
7 | 
8 | 


--------------------------------------------------------------------------------
/sample/instantiation_diagram.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/sabel83/templight/master/sample/instantiation_diagram.png


--------------------------------------------------------------------------------
/sample/Makefile:
--------------------------------------------------------------------------------
 1 | # Copyright (C) 2013, Abel Sinkovics (abel@sinkovics.hu)
 2 | #
 3 | # This program is free software: you can redistribute it and/or modify
 4 | # it under the terms of the GNU General Public License as published by
 5 | # the Free Software Foundation, either version 3 of the License, or
 6 | # (at your option) any later version.
 7 | #
 8 | # This program is distributed in the hope that it will be useful,
 9 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
10 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11 | # GNU General Public License for more details.
12 | #
13 | # You should have received a copy of the GNU General Public License
14 | # along with this program.  If not, see <http://www.gnu.org/licenses/>.
15 | 
16 | BIN=..
17 | 
18 | all : generate
19 | 
20 | instantiated_templates.txt : fib.xml ; $(BIN)/instantiated_templates $< > $@
21 | OUT+=instantiated_templates.txt
22 | 
23 | instantiation_diagram.dot : fib.xml ; $(BIN)/instantiation_diagram $< > $@
24 | OUT+=instantiation_diagram.dot
25 | 
26 | instantiation_diagram.svg : instantiation_diagram.dot ; dot -Tsvg $< -o $@
27 | OUT+=instantiation_diagram.svg
28 | 
29 | instantiation_diagram.png : instantiation_diagram.dot ; dot -Tpng $< -o $@
30 | OUT+=instantiation_diagram.png
31 | 
32 | generate : $(OUT)
33 | 
34 | clean : ; -rm $(OUT)
35 | 
36 | 


--------------------------------------------------------------------------------
/instantiated_templates:
--------------------------------------------------------------------------------
 1 | #!/usr/bin/python
 2 | 
 3 | # Copyright (C) 2013, Abel Sinkovics (abel@sinkovics.hu)
 4 | #
 5 | # This program is free software: you can redistribute it and/or modify
 6 | # it under the terms of the GNU General Public License as published by
 7 | # the Free Software Foundation, either version 3 of the License, or
 8 | # (at your option) any later version.
 9 | #
10 | # This program is distributed in the hope that it will be useful,
11 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13 | # GNU General Public License for more details.
14 | #
15 | # You should have received a copy of the GNU General Public License
16 | # along with this program.  If not, see <http://www.gnu.org/licenses/>.
17 | 
18 | import sys
19 | import xml.sax
20 | 
21 | class TemplightHandler(xml.sax.ContentHandler):
22 |   def __init__(self):
23 |     self.result = []
24 | 
25 |   def startElement(self, name, attrs):
26 |     if name == 'Context':
27 |       self.result.append(attrs['context'])
28 | 
29 | def main():
30 |   if len(sys.argv) == 2:
31 |     h = TemplightHandler()
32 |     xml.sax.parse(sys.argv[1], h)
33 |     for t in sorted(h.result):
34 |       print t
35 |   else:
36 |     print 'Usage: %s <name of xml trace file>' % (sys.argv[0])
37 | 
38 | if __name__ == '__main__':
39 |   main()
40 | 
41 | 


--------------------------------------------------------------------------------
/sample/fib.hpp:
--------------------------------------------------------------------------------
 1 | 
 2 | template <int N>
 3 | struct int_
 4 | {
 5 |   typedef int_ type;
 6 |   static const int value;
 7 | };
 8 | 
 9 | template <int N>
10 | const int int_<N>::value = N;
11 | 
12 | 
13 | 
14 | 
15 | template <bool B>
16 | struct bool_
17 | {
18 |   typedef bool_ type;
19 |   static const bool value;
20 | };
21 | 
22 | template <bool B>
23 | const bool bool_<B>::value = B;
24 | 
25 | 
26 | 
27 | 
28 | template <class A, class B>
29 | struct plus
30 | {
31 |   typedef int_<A::type::value + B::type::value> type;
32 | };
33 | 
34 | template <class A, class B>
35 | struct minus
36 | {
37 |   typedef int_<A::type::value - B::type::value> type;
38 | };
39 | 
40 | template <class A, class B>
41 | struct less
42 | {
43 |   typedef bool_<(A::type::value < B::type::value)> type;
44 | };
45 | 
46 | 
47 | 
48 | template <bool C, class T, class F>
49 | struct if_c
50 | {
51 |   typedef T type;
52 | };
53 | 
54 | template <class T, class F>
55 | struct if_c<false, T, F>
56 | {
57 |   typedef F type;
58 | };
59 | 
60 | template <class C, class T, class F>
61 | struct eval_if : if_c<C::type::value, T, F>::type {};
62 | 
63 | 
64 | template <class N>
65 | struct lazy_fib :
66 |   eval_if<
67 |     less<N, int_<2> >,
68 |     int_<1>,
69 |     plus<
70 |       lazy_fib<minus<N, int_<1> > >,
71 |       lazy_fib<minus<N, int_<2> > >
72 |     >
73 |   >
74 | {};
75 | 
76 | template <class N>
77 | struct strict_fib;
78 | 
79 | template <class N>
80 | struct strict_fib_impl :
81 |   plus<
82 |     typename strict_fib<typename minus<N, int_<1> >::type>::type,
83 |     typename strict_fib<typename minus<N, int_<2> >::type>::type
84 |   >
85 | {};
86 | 
87 | template <class N>
88 | struct strict_fib :
89 |   eval_if<
90 |     typename less<N, int_<2> >::type,
91 |     int_<1>,
92 |     strict_fib_impl<N>
93 |   >
94 | {};
95 | 
96 | 
97 | 
98 | 


--------------------------------------------------------------------------------
/instantiation_diagram:
--------------------------------------------------------------------------------
 1 | #!/usr/bin/python
 2 | 
 3 | # Copyright (C) 2013, Abel Sinkovics (abel@sinkovics.hu)
 4 | #
 5 | # This program is free software: you can redistribute it and/or modify
 6 | # it under the terms of the GNU General Public License as published by
 7 | # the Free Software Foundation, either version 3 of the License, or
 8 | # (at your option) any later version.
 9 | #
10 | # This program is distributed in the hope that it will be useful,
11 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13 | # GNU General Public License for more details.
14 | #
15 | # You should have received a copy of the GNU General Public License
16 | # along with this program.  If not, see <http://www.gnu.org/licenses/>.
17 | 
18 | import sys
19 | import xml.sax
20 | 
21 | class TemplightHandler(xml.sax.ContentHandler):
22 |   def __init__(self):
23 |     # A context -> unique id mapping
24 |     self._ids = {}
25 |     self._next_id = 0
26 | 
27 |     # Elements: (<from>, <to>, <memoizated>)
28 |     self._edges = []
29 | 
30 |     # instantiation stack (The call-stack of template metaprograms)
31 |     self._stack = []
32 | 
33 |     self._in_template_begin = False
34 | 
35 |   def startElement(self, name, attrs):
36 |     if name == 'TemplateBegin':
37 |       self._in_template_begin = True
38 |     elif name == 'TemplateEnd':
39 |       self._stack.pop()
40 |       self._in_template_begin = False
41 |     elif name == 'Context' and self._in_template_begin:
42 |       self.instantiation_requested(attrs['context'])
43 |   
44 |   def instantiation_requested(self, name):
45 |     memoized = self.store(name)
46 |     tid = self._ids[name]
47 |     if len(self._stack) > 0:
48 |       self._edges.append((self._stack[len(self._stack) - 1], tid, memoized))
49 |     self._stack.append(tid)
50 | 
51 |   # returns: was the node in the map?
52 |   def store(self, name):
53 |     if not self._ids.has_key(name):
54 |       self._ids[name] = 't%d' % (self._next_id)
55 |       self._next_id = self._next_id + 1
56 |       return False
57 |     else:
58 |       return True
59 | 
60 |   def display(self):
61 |     print 'digraph G {'
62 |     print
63 |     for name in self._ids.keys():
64 |       shortname = name[:name.find('<')]
65 |       print '  %s [label="%s", shape=rectangle];' % (self._ids[name], shortname)
66 |     print
67 |     for (f, t, m) in self._edges:
68 |       if m:
69 |         style = "dashed"
70 |       else:
71 |         style = "solid"
72 |       print '  %s -> %s [style=%s];' % (f, t, style)
73 |     print
74 |     print '}'
75 | 
76 | def main():
77 |   if len(sys.argv) == 2:
78 |     h = TemplightHandler()
79 |     xml.sax.parse(sys.argv[1], h)
80 |     h.display()
81 |   else:
82 |     print 'Usage: %s <name of xml trace file>' % (sys.argv[0])
83 | 
84 | if __name__ == '__main__':
85 |   main()
86 | 
87 | 


--------------------------------------------------------------------------------
/sample/instantiated_templates.txt:
--------------------------------------------------------------------------------
 1 | bool_<false>
 2 | bool_<false>
 3 | bool_<false>::value
 4 | bool_<true>
 5 | bool_<true>
 6 | bool_<true>
 7 | bool_<true>::value
 8 | eval_if<less<int_<3>, int_<2> >, int_<1>, plus<lazy_fib<minus<int_<3>, int_<1> > >, lazy_fib<minus<int_<3>, int_<2> > > > >
 9 | eval_if<less<minus<int_<3>, int_<1> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > > > >
10 | eval_if<less<minus<int_<3>, int_<2> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<2> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<2> >, int_<2> > > > >
11 | eval_if<less<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> > > > >
12 | eval_if<less<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> > > > >
13 | if_c<false, int_<1>, plus<lazy_fib<minus<int_<3>, int_<1> > >, lazy_fib<minus<int_<3>, int_<2> > > > >
14 | if_c<false, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > > > >
15 | if_c<false, type-parameter-0-0, type-parameter-0-1>
16 | if_c<false, type-parameter-0-0, type-parameter-0-1>
17 | if_c<true, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<2> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<2> >, int_<2> > > > >
18 | if_c<true, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> > > > >
19 | if_c<true, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> > > > >
20 | int_<0>
21 | int_<0>::value
22 | int_<1>
23 | int_<1>
24 | int_<1>
25 | int_<1>
26 | int_<1>
27 | int_<1>
28 | int_<1>
29 | int_<1>
30 | int_<1>
31 | int_<1>
32 | int_<1>
33 | int_<1>::value
34 | int_<2>
35 | int_<2>
36 | int_<2>
37 | int_<2>
38 | int_<2>
39 | int_<2>
40 | int_<2>
41 | int_<2>
42 | int_<2>
43 | int_<2>
44 | int_<2>::value
45 | int_<3>
46 | int_<3>
47 | int_<3>
48 | int_<3>
49 | int_<3>
50 | int_<3>::value
51 | lazy_fib<int_<3> >
52 | lazy_fib<minus<int_<3>, int_<1> > >
53 | lazy_fib<minus<int_<3>, int_<2> > >
54 | lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >
55 | lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > >
56 | less<int_<3>, int_<2> >
57 | less<minus<int_<3>, int_<1> >, int_<2> >
58 | less<minus<int_<3>, int_<2> >, int_<2> >
59 | less<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> >
60 | less<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> >
61 | minus<int_<3>, int_<1> >
62 | minus<int_<3>, int_<1> >
63 | minus<int_<3>, int_<1> >
64 | minus<int_<3>, int_<2> >
65 | minus<minus<int_<3>, int_<1> >, int_<1> >
66 | minus<minus<int_<3>, int_<1> >, int_<2> >
67 | plus<lazy_fib<minus<int_<3>, int_<1> > >, lazy_fib<minus<int_<3>, int_<2> > > >
68 | plus<lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > > >
69 | 


--------------------------------------------------------------------------------
/sample/instantiation_diagram.dot:
--------------------------------------------------------------------------------
  1 | digraph G {
  2 | 
  3 |   t35 [label="eval_if", shape=rectangle];
  4 |   t11 [label="plus", shape=rectangle];
  5 |   t8 [label="bool_", shape=rectangle];
  6 |   t2 [label="less", shape=rectangle];
  7 |   t16 [label="int_", shape=rectangle];
  8 |   t14 [label="less", shape=rectangle];
  9 |   t3 [label="int_", shape=rectangle];
 10 |   t37 [label="minus", shape=rectangle];
 11 |   t28 [label="eval_if", shape=rectangle];
 12 |   t24 [label="bool_", shape=rectangle];
 13 |   t13 [label="eval_if", shape=rectangle];
 14 |   t0 [label="lazy_fib", shape=rectangle];
 15 |   t33 [label="if_c", shape=rectangle];
 16 |   t6 [label="int_", shape=rectangle];
 17 |   t9 [label="if_c", shape=rectangle];
 18 |   t20 [label="lazy_fib", shape=rectangle];
 19 |   t4 [label="int_", shape=rectangle];
 20 |   t27 [label="lazy_fib", shape=rectangle];
 21 |   t7 [label="bool_", shape=rectangle];
 22 |   t26 [label="if_c", shape=rectangle];
 23 |   t18 [label="if_c", shape=rectangle];
 24 |   t30 [label="minus", shape=rectangle];
 25 |   t19 [label="plus", shape=rectangle];
 26 |   t38 [label="if_c", shape=rectangle];
 27 |   t17 [label="int_", shape=rectangle];
 28 |   t5 [label="int_", shape=rectangle];
 29 |   t12 [label="lazy_fib", shape=rectangle];
 30 |   t10 [label="if_c", shape=rectangle];
 31 |   t34 [label="lazy_fib", shape=rectangle];
 32 |   t31 [label="int_", shape=rectangle];
 33 |   t32 [label="int_", shape=rectangle];
 34 |   t36 [label="less", shape=rectangle];
 35 |   t29 [label="less", shape=rectangle];
 36 |   t1 [label="eval_if", shape=rectangle];
 37 |   t25 [label="bool_", shape=rectangle];
 38 |   t22 [label="less", shape=rectangle];
 39 |   t15 [label="minus", shape=rectangle];
 40 |   t21 [label="eval_if", shape=rectangle];
 41 |   t23 [label="minus", shape=rectangle];
 42 | 
 43 |   t0 -> t1 [style=solid];
 44 |   t1 -> t2 [style=solid];
 45 |   t2 -> t3 [style=solid];
 46 |   t2 -> t3 [style=dashed];
 47 |   t2 -> t4 [style=solid];
 48 |   t2 -> t5 [style=solid];
 49 |   t2 -> t5 [style=dashed];
 50 |   t2 -> t6 [style=solid];
 51 |   t1 -> t7 [style=solid];
 52 |   t1 -> t8 [style=solid];
 53 |   t1 -> t9 [style=solid];
 54 |   t1 -> t10 [style=solid];
 55 |   t1 -> t11 [style=solid];
 56 |   t11 -> t12 [style=solid];
 57 |   t12 -> t13 [style=solid];
 58 |   t13 -> t14 [style=solid];
 59 |   t14 -> t15 [style=solid];
 60 |   t15 -> t3 [style=dashed];
 61 |   t15 -> t16 [style=solid];
 62 |   t15 -> t16 [style=dashed];
 63 |   t15 -> t17 [style=solid];
 64 |   t14 -> t5 [style=dashed];
 65 |   t13 -> t7 [style=dashed];
 66 |   t13 -> t9 [style=dashed];
 67 |   t13 -> t18 [style=solid];
 68 |   t13 -> t19 [style=solid];
 69 |   t19 -> t20 [style=solid];
 70 |   t20 -> t21 [style=solid];
 71 |   t21 -> t22 [style=solid];
 72 |   t22 -> t23 [style=solid];
 73 |   t23 -> t15 [style=dashed];
 74 |   t23 -> t5 [style=dashed];
 75 |   t23 -> t16 [style=dashed];
 76 |   t22 -> t16 [style=dashed];
 77 |   t22 -> t5 [style=dashed];
 78 |   t21 -> t24 [style=solid];
 79 |   t21 -> t25 [style=solid];
 80 |   t21 -> t26 [style=solid];
 81 |   t21 -> t16 [style=dashed];
 82 |   t19 -> t16 [style=dashed];
 83 |   t19 -> t27 [style=solid];
 84 |   t27 -> t28 [style=solid];
 85 |   t28 -> t29 [style=solid];
 86 |   t29 -> t30 [style=solid];
 87 |   t30 -> t15 [style=dashed];
 88 |   t30 -> t5 [style=dashed];
 89 |   t29 -> t31 [style=solid];
 90 |   t29 -> t32 [style=solid];
 91 |   t29 -> t5 [style=dashed];
 92 |   t28 -> t24 [style=dashed];
 93 |   t28 -> t33 [style=solid];
 94 |   t28 -> t16 [style=dashed];
 95 |   t19 -> t16 [style=dashed];
 96 |   t11 -> t5 [style=dashed];
 97 |   t11 -> t34 [style=solid];
 98 |   t34 -> t35 [style=solid];
 99 |   t35 -> t36 [style=solid];
100 |   t36 -> t37 [style=solid];
101 |   t37 -> t3 [style=dashed];
102 |   t37 -> t5 [style=dashed];
103 |   t36 -> t16 [style=dashed];
104 |   t36 -> t5 [style=dashed];
105 |   t35 -> t24 [style=dashed];
106 |   t35 -> t38 [style=solid];
107 |   t35 -> t16 [style=dashed];
108 |   t11 -> t16 [style=dashed];
109 | 
110 | }
111 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
  1 | # Utilities for templight
  2 | 
  3 | Here you can find scripts for getting information from an XML trace
  4 | generated by [Templight](http://plc.inf.elte.hu/templight):
  5 | 
  6 | * `instantiated_templates` prints the list of templates that were instantiated.
  7 |   Every template goes into its own line. You can use tools like `grep` or `wc`
  8 |   to get further information.
  9 | * `instantiation_diagram` generates a [Grapviz](http://www.graphviz.org/)
 10 |   diagram of the templates that were instantiated.
 11 | 
 12 | ## Example
 13 | 
 14 | In the `sample` directory you can find an example source code, the XML trace
 15 | file and the generated output.
 16 | 
 17 | The generated diagram:
 18 | 
 19 | ![Sample instantiation diagram](sample/instantiation_diagram.png)
 20 | 
 21 | The list of templates that were instantiated:
 22 | 
 23 | ```cpp
 24 | bool_<false>
 25 | bool_<false>
 26 | bool_<false>::value
 27 | bool_<true>
 28 | bool_<true>
 29 | bool_<true>
 30 | bool_<true>::value
 31 | eval_if<less<int_<3>, int_<2> >, int_<1>, plus<lazy_fib<minus<int_<3>, int_<1> > >, lazy_fib<minus<int_<3>, int_<2> > > > >
 32 | eval_if<less<minus<int_<3>, int_<1> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > > > >
 33 | eval_if<less<minus<int_<3>, int_<2> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<2> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<2> >, int_<2> > > > >
 34 | eval_if<less<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> > > > >
 35 | eval_if<less<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> >, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> > > > >
 36 | if_c<false, int_<1>, plus<lazy_fib<minus<int_<3>, int_<1> > >, lazy_fib<minus<int_<3>, int_<2> > > > >
 37 | if_c<false, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > > > >
 38 | if_c<false, type-parameter-0-0, type-parameter-0-1>
 39 | if_c<false, type-parameter-0-0, type-parameter-0-1>
 40 | if_c<true, int_<1>, plus<lazy_fib<minus<minus<int_<3>, int_<2> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<2> >, int_<2> > > > >
 41 | if_c<true, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> > > > >
 42 | if_c<true, int_<1>, plus<lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<1> > >, lazy_fib<minus<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> > > > >
 43 | int_<0>
 44 | int_<0>::value
 45 | int_<1>
 46 | int_<1>
 47 | int_<1>
 48 | int_<1>
 49 | int_<1>
 50 | int_<1>
 51 | int_<1>
 52 | int_<1>
 53 | int_<1>
 54 | int_<1>
 55 | int_<1>
 56 | int_<1>::value
 57 | int_<2>
 58 | int_<2>
 59 | int_<2>
 60 | int_<2>
 61 | int_<2>
 62 | int_<2>
 63 | int_<2>
 64 | int_<2>
 65 | int_<2>
 66 | int_<2>
 67 | int_<2>::value
 68 | int_<3>
 69 | int_<3>
 70 | int_<3>
 71 | int_<3>
 72 | int_<3>
 73 | int_<3>::value
 74 | lazy_fib<int_<3> >
 75 | lazy_fib<minus<int_<3>, int_<1> > >
 76 | lazy_fib<minus<int_<3>, int_<2> > >
 77 | lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >
 78 | lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > >
 79 | less<int_<3>, int_<2> >
 80 | less<minus<int_<3>, int_<1> >, int_<2> >
 81 | less<minus<int_<3>, int_<2> >, int_<2> >
 82 | less<minus<minus<int_<3>, int_<1> >, int_<1> >, int_<2> >
 83 | less<minus<minus<int_<3>, int_<1> >, int_<2> >, int_<2> >
 84 | minus<int_<3>, int_<1> >
 85 | minus<int_<3>, int_<1> >
 86 | minus<int_<3>, int_<1> >
 87 | minus<int_<3>, int_<2> >
 88 | minus<minus<int_<3>, int_<1> >, int_<1> >
 89 | minus<minus<int_<3>, int_<1> >, int_<2> >
 90 | plus<lazy_fib<minus<int_<3>, int_<1> > >, lazy_fib<minus<int_<3>, int_<2> > > >
 91 | plus<lazy_fib<minus<minus<int_<3>, int_<1> >, int_<1> > >, lazy_fib<minus<minus<int_<3>, int_<1> >, int_<2> > > >
 92 | ```
 93 |   
 94 | ## License
 95 | 
 96 | The tools are published under the
 97 | [GNU General Public License, version 3](http://www.gnu.org/licenses/gpl.html).
 98 | 
 99 | 
100 | 


--------------------------------------------------------------------------------
/sample/fib.xml:
--------------------------------------------------------------------------------
  1 | <?xml version="1.0" standalone="yes"?>
  2 | <Trace>
  3 | <TemplateBegin>
  4 |     <Kind>TemplateInstantiation</Kind>
  5 |     <Context context = "lazy_fib&lt;int_&lt;3&gt; &gt;"/>
  6 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
  7 |     <TimeStamp time = "418647494.419957"/>
  8 |     <MemoryUsage bytes = "0"/>
  9 | </TemplateBegin>
 10 | <TemplateBegin>
 11 |     <Kind>TemplateInstantiation</Kind>
 12 |     <Context context = "eval_if&lt;less&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
 13 |     <PointOfInstantiation>./fib.hpp|66|3</PointOfInstantiation>
 14 |     <TimeStamp time = "418647494.419986"/>
 15 |     <MemoryUsage bytes = "0"/>
 16 | </TemplateBegin>
 17 | <TemplateBegin>
 18 |     <Kind>TemplateInstantiation</Kind>
 19 |     <Context context = "less&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;"/>
 20 |     <PointOfInstantiation>./fib.hpp|61|23</PointOfInstantiation>
 21 |     <TimeStamp time = "418647494.419992"/>
 22 |     <MemoryUsage bytes = "0"/>
 23 | </TemplateBegin>
 24 | <TemplateBegin>
 25 |     <Kind>TemplateInstantiation</Kind>
 26 |     <Context context = "int_&lt;3&gt;"/>
 27 |     <PointOfInstantiation>./fib.hpp|43|18</PointOfInstantiation>
 28 |     <TimeStamp time = "418647494.420003"/>
 29 |     <MemoryUsage bytes = "0"/>
 30 | </TemplateBegin>
 31 | <TemplateEnd>
 32 |     <Kind>TemplateInstantiation</Kind>
 33 |     <TimeStamp time = "418647494.420014"/>
 34 |     <MemoryUsage bytes = "0"/>
 35 | </TemplateEnd>
 36 | <TemplateBegin>
 37 |     <Kind>Memoization</Kind>
 38 |     <Context context = "int_&lt;3&gt;"/>
 39 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
 40 |     <TimeStamp time = "418647494.420017"/>
 41 |     <MemoryUsage bytes = "0"/>
 42 | </TemplateBegin>
 43 | <TemplateEnd>
 44 |     <Kind>Memoization</Kind>
 45 |     <TimeStamp time = "418647494.420017"/>
 46 |     <MemoryUsage bytes = "0"/>
 47 | </TemplateEnd>
 48 | <TemplateBegin>
 49 |     <Kind>TemplateInstantiation</Kind>
 50 |     <Context context = "int_&lt;3&gt;::value"/>
 51 |     <PointOfInstantiation>./fib.hpp|43|27</PointOfInstantiation>
 52 |     <TimeStamp time = "418647494.420023"/>
 53 |     <MemoryUsage bytes = "0"/>
 54 | </TemplateBegin>
 55 | <TemplateEnd>
 56 |     <Kind>TemplateInstantiation</Kind>
 57 |     <TimeStamp time = "418647494.420077"/>
 58 |     <MemoryUsage bytes = "0"/>
 59 | </TemplateEnd>
 60 | <TemplateBegin>
 61 |     <Kind>TemplateInstantiation</Kind>
 62 |     <Context context = "int_&lt;2&gt;"/>
 63 |     <PointOfInstantiation>./fib.hpp|43|35</PointOfInstantiation>
 64 |     <TimeStamp time = "418647494.420081"/>
 65 |     <MemoryUsage bytes = "0"/>
 66 | </TemplateBegin>
 67 | <TemplateEnd>
 68 |     <Kind>TemplateInstantiation</Kind>
 69 |     <TimeStamp time = "418647494.420091"/>
 70 |     <MemoryUsage bytes = "0"/>
 71 | </TemplateEnd>
 72 | <TemplateBegin>
 73 |     <Kind>Memoization</Kind>
 74 |     <Context context = "int_&lt;2&gt;"/>
 75 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
 76 |     <TimeStamp time = "418647494.420093"/>
 77 |     <MemoryUsage bytes = "0"/>
 78 | </TemplateBegin>
 79 | <TemplateEnd>
 80 |     <Kind>Memoization</Kind>
 81 |     <TimeStamp time = "418647494.420094"/>
 82 |     <MemoryUsage bytes = "0"/>
 83 | </TemplateEnd>
 84 | <TemplateBegin>
 85 |     <Kind>TemplateInstantiation</Kind>
 86 |     <Context context = "int_&lt;2&gt;::value"/>
 87 |     <PointOfInstantiation>./fib.hpp|43|44</PointOfInstantiation>
 88 |     <TimeStamp time = "418647494.420096"/>
 89 |     <MemoryUsage bytes = "0"/>
 90 | </TemplateBegin>
 91 | <TemplateEnd>
 92 |     <Kind>TemplateInstantiation</Kind>
 93 |     <TimeStamp time = "418647494.420113"/>
 94 |     <MemoryUsage bytes = "0"/>
 95 | </TemplateEnd>
 96 | <TemplateEnd>
 97 |     <Kind>TemplateInstantiation</Kind>
 98 |     <TimeStamp time = "418647494.420148"/>
 99 |     <MemoryUsage bytes = "0"/>
100 | </TemplateEnd>
101 | <TemplateBegin>
102 |     <Kind>TemplateInstantiation</Kind>
103 |     <Context context = "bool_&lt;false&gt;"/>
104 |     <PointOfInstantiation>./fib.hpp|61|26</PointOfInstantiation>
105 |     <TimeStamp time = "418647494.420151"/>
106 |     <MemoryUsage bytes = "0"/>
107 | </TemplateBegin>
108 | <TemplateEnd>
109 |     <Kind>TemplateInstantiation</Kind>
110 |     <TimeStamp time = "418647494.420157"/>
111 |     <MemoryUsage bytes = "0"/>
112 | </TemplateEnd>
113 | <TemplateBegin>
114 |     <Kind>TemplateInstantiation</Kind>
115 |     <Context context = "bool_&lt;false&gt;::value"/>
116 |     <PointOfInstantiation>./fib.hpp|61|32</PointOfInstantiation>
117 |     <TimeStamp time = "418647494.420159"/>
118 |     <MemoryUsage bytes = "0"/>
119 | </TemplateBegin>
120 | <TemplateEnd>
121 |     <Kind>TemplateInstantiation</Kind>
122 |     <TimeStamp time = "418647494.420175"/>
123 |     <MemoryUsage bytes = "0"/>
124 | </TemplateEnd>
125 | <TemplateBegin>
126 |     <Kind>DeducedTemplateArgumentSubstitution</Kind>
127 |     <Context context = "if_c&lt;false, type-parameter-0-0, type-parameter-0-1&gt;"/>
128 |     <PointOfInstantiation>./fib.hpp|55|8</PointOfInstantiation>
129 |     <TimeStamp time = "418647494.420192"/>
130 |     <MemoryUsage bytes = "0"/>
131 | </TemplateBegin>
132 | <TemplateEnd>
133 |     <Kind>DeducedTemplateArgumentSubstitution</Kind>
134 |     <TimeStamp time = "418647494.420202"/>
135 |     <MemoryUsage bytes = "0"/>
136 | </TemplateEnd>
137 | <TemplateBegin>
138 |     <Kind>TemplateInstantiation</Kind>
139 |     <Context context = "if_c&lt;false, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
140 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
141 |     <TimeStamp time = "418647494.420203"/>
142 |     <MemoryUsage bytes = "0"/>
143 | </TemplateBegin>
144 | <TemplateEnd>
145 |     <Kind>TemplateInstantiation</Kind>
146 |     <TimeStamp time = "418647494.420206"/>
147 |     <MemoryUsage bytes = "0"/>
148 | </TemplateEnd>
149 | <TemplateBegin>
150 |     <Kind>TemplateInstantiation</Kind>
151 |     <Context context = "plus&lt;lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt; &gt; &gt;"/>
152 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
153 |     <TimeStamp time = "418647494.420212"/>
154 |     <MemoryUsage bytes = "0"/>
155 | </TemplateBegin>
156 | <TemplateBegin>
157 |     <Kind>TemplateInstantiation</Kind>
158 |     <Context context = "lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt; &gt;"/>
159 |     <PointOfInstantiation>./fib.hpp|31|16</PointOfInstantiation>
160 |     <TimeStamp time = "418647494.420215"/>
161 |     <MemoryUsage bytes = "0"/>
162 | </TemplateBegin>
163 | <TemplateBegin>
164 |     <Kind>TemplateInstantiation</Kind>
165 |     <Context context = "eval_if&lt;less&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
166 |     <PointOfInstantiation>./fib.hpp|66|3</PointOfInstantiation>
167 |     <TimeStamp time = "418647494.420226"/>
168 |     <MemoryUsage bytes = "0"/>
169 | </TemplateBegin>
170 | <TemplateBegin>
171 |     <Kind>TemplateInstantiation</Kind>
172 |     <Context context = "less&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;"/>
173 |     <PointOfInstantiation>./fib.hpp|61|23</PointOfInstantiation>
174 |     <TimeStamp time = "418647494.420229"/>
175 |     <MemoryUsage bytes = "0"/>
176 | </TemplateBegin>
177 | <TemplateBegin>
178 |     <Kind>TemplateInstantiation</Kind>
179 |     <Context context = "minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;"/>
180 |     <PointOfInstantiation>./fib.hpp|43|18</PointOfInstantiation>
181 |     <TimeStamp time = "418647494.420237"/>
182 |     <MemoryUsage bytes = "0"/>
183 | </TemplateBegin>
184 | <TemplateBegin>
185 |     <Kind>Memoization</Kind>
186 |     <Context context = "int_&lt;3&gt;"/>
187 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
188 |     <TimeStamp time = "418647494.420242"/>
189 |     <MemoryUsage bytes = "0"/>
190 | </TemplateBegin>
191 | <TemplateEnd>
192 |     <Kind>Memoization</Kind>
193 |     <TimeStamp time = "418647494.420243"/>
194 |     <MemoryUsage bytes = "0"/>
195 | </TemplateEnd>
196 | <TemplateBegin>
197 |     <Kind>TemplateInstantiation</Kind>
198 |     <Context context = "int_&lt;1&gt;"/>
199 |     <PointOfInstantiation>./fib.hpp|37|33</PointOfInstantiation>
200 |     <TimeStamp time = "418647494.420249"/>
201 |     <MemoryUsage bytes = "0"/>
202 | </TemplateBegin>
203 | <TemplateEnd>
204 |     <Kind>TemplateInstantiation</Kind>
205 |     <TimeStamp time = "418647494.420256"/>
206 |     <MemoryUsage bytes = "0"/>
207 | </TemplateEnd>
208 | <TemplateBegin>
209 |     <Kind>Memoization</Kind>
210 |     <Context context = "int_&lt;1&gt;"/>
211 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
212 |     <TimeStamp time = "418647494.420257"/>
213 |     <MemoryUsage bytes = "0"/>
214 | </TemplateBegin>
215 | <TemplateEnd>
216 |     <Kind>Memoization</Kind>
217 |     <TimeStamp time = "418647494.420258"/>
218 |     <MemoryUsage bytes = "0"/>
219 | </TemplateEnd>
220 | <TemplateBegin>
221 |     <Kind>TemplateInstantiation</Kind>
222 |     <Context context = "int_&lt;1&gt;::value"/>
223 |     <PointOfInstantiation>./fib.hpp|37|42</PointOfInstantiation>
224 |     <TimeStamp time = "418647494.420259"/>
225 |     <MemoryUsage bytes = "0"/>
226 | </TemplateBegin>
227 | <TemplateEnd>
228 |     <Kind>TemplateInstantiation</Kind>
229 |     <TimeStamp time = "418647494.420277"/>
230 |     <MemoryUsage bytes = "0"/>
231 | </TemplateEnd>
232 | <TemplateEnd>
233 |     <Kind>TemplateInstantiation</Kind>
234 |     <TimeStamp time = "418647494.420293"/>
235 |     <MemoryUsage bytes = "0"/>
236 | </TemplateEnd>
237 | <TemplateBegin>
238 |     <Kind>Memoization</Kind>
239 |     <Context context = "int_&lt;2&gt;"/>
240 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
241 |     <TimeStamp time = "418647494.420296"/>
242 |     <MemoryUsage bytes = "0"/>
243 | </TemplateBegin>
244 | <TemplateEnd>
245 |     <Kind>Memoization</Kind>
246 |     <TimeStamp time = "418647494.420296"/>
247 |     <MemoryUsage bytes = "0"/>
248 | </TemplateEnd>
249 | <TemplateEnd>
250 |     <Kind>TemplateInstantiation</Kind>
251 |     <TimeStamp time = "418647494.420311"/>
252 |     <MemoryUsage bytes = "0"/>
253 | </TemplateEnd>
254 | <TemplateBegin>
255 |     <Kind>Memoization</Kind>
256 |     <Context context = "bool_&lt;false&gt;"/>
257 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
258 |     <TimeStamp time = "418647494.420313"/>
259 |     <MemoryUsage bytes = "0"/>
260 | </TemplateBegin>
261 | <TemplateEnd>
262 |     <Kind>Memoization</Kind>
263 |     <TimeStamp time = "418647494.420313"/>
264 |     <MemoryUsage bytes = "0"/>
265 | </TemplateEnd>
266 | <TemplateBegin>
267 |     <Kind>DeducedTemplateArgumentSubstitution</Kind>
268 |     <Context context = "if_c&lt;false, type-parameter-0-0, type-parameter-0-1&gt;"/>
269 |     <PointOfInstantiation>./fib.hpp|55|8</PointOfInstantiation>
270 |     <TimeStamp time = "418647494.420325"/>
271 |     <MemoryUsage bytes = "0"/>
272 | </TemplateBegin>
273 | <TemplateEnd>
274 |     <Kind>DeducedTemplateArgumentSubstitution</Kind>
275 |     <TimeStamp time = "418647494.420328"/>
276 |     <MemoryUsage bytes = "0"/>
277 | </TemplateEnd>
278 | <TemplateBegin>
279 |     <Kind>TemplateInstantiation</Kind>
280 |     <Context context = "if_c&lt;false, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
281 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
282 |     <TimeStamp time = "418647494.420329"/>
283 |     <MemoryUsage bytes = "0"/>
284 | </TemplateBegin>
285 | <TemplateEnd>
286 |     <Kind>TemplateInstantiation</Kind>
287 |     <TimeStamp time = "418647494.420332"/>
288 |     <MemoryUsage bytes = "0"/>
289 | </TemplateEnd>
290 | <TemplateBegin>
291 |     <Kind>TemplateInstantiation</Kind>
292 |     <Context context = "plus&lt;lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt;"/>
293 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
294 |     <TimeStamp time = "418647494.420335"/>
295 |     <MemoryUsage bytes = "0"/>
296 | </TemplateBegin>
297 | <TemplateBegin>
298 |     <Kind>TemplateInstantiation</Kind>
299 |     <Context context = "lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt; &gt;"/>
300 |     <PointOfInstantiation>./fib.hpp|31|16</PointOfInstantiation>
301 |     <TimeStamp time = "418647494.420337"/>
302 |     <MemoryUsage bytes = "0"/>
303 | </TemplateBegin>
304 | <TemplateBegin>
305 |     <Kind>TemplateInstantiation</Kind>
306 |     <Context context = "eval_if&lt;less&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
307 |     <PointOfInstantiation>./fib.hpp|66|3</PointOfInstantiation>
308 |     <TimeStamp time = "418647494.420354"/>
309 |     <MemoryUsage bytes = "0"/>
310 | </TemplateBegin>
311 | <TemplateBegin>
312 |     <Kind>TemplateInstantiation</Kind>
313 |     <Context context = "less&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;"/>
314 |     <PointOfInstantiation>./fib.hpp|61|23</PointOfInstantiation>
315 |     <TimeStamp time = "418647494.420356"/>
316 |     <MemoryUsage bytes = "0"/>
317 | </TemplateBegin>
318 | <TemplateBegin>
319 |     <Kind>TemplateInstantiation</Kind>
320 |     <Context context = "minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;"/>
321 |     <PointOfInstantiation>./fib.hpp|43|18</PointOfInstantiation>
322 |     <TimeStamp time = "418647494.420359"/>
323 |     <MemoryUsage bytes = "0"/>
324 | </TemplateBegin>
325 | <TemplateBegin>
326 |     <Kind>Memoization</Kind>
327 |     <Context context = "minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;"/>
328 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
329 |     <TimeStamp time = "418647494.420364"/>
330 |     <MemoryUsage bytes = "0"/>
331 | </TemplateBegin>
332 | <TemplateEnd>
333 |     <Kind>Memoization</Kind>
334 |     <TimeStamp time = "418647494.420364"/>
335 |     <MemoryUsage bytes = "0"/>
336 | </TemplateEnd>
337 | <TemplateBegin>
338 |     <Kind>Memoization</Kind>
339 |     <Context context = "int_&lt;2&gt;"/>
340 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
341 |     <TimeStamp time = "418647494.420367"/>
342 |     <MemoryUsage bytes = "0"/>
343 | </TemplateBegin>
344 | <TemplateEnd>
345 |     <Kind>Memoization</Kind>
346 |     <TimeStamp time = "418647494.420367"/>
347 |     <MemoryUsage bytes = "0"/>
348 | </TemplateEnd>
349 | <TemplateBegin>
350 |     <Kind>Memoization</Kind>
351 |     <Context context = "int_&lt;1&gt;"/>
352 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
353 |     <TimeStamp time = "418647494.420370"/>
354 |     <MemoryUsage bytes = "0"/>
355 | </TemplateBegin>
356 | <TemplateEnd>
357 |     <Kind>Memoization</Kind>
358 |     <TimeStamp time = "418647494.420370"/>
359 |     <MemoryUsage bytes = "0"/>
360 | </TemplateEnd>
361 | <TemplateEnd>
362 |     <Kind>TemplateInstantiation</Kind>
363 |     <TimeStamp time = "418647494.420383"/>
364 |     <MemoryUsage bytes = "0"/>
365 | </TemplateEnd>
366 | <TemplateBegin>
367 |     <Kind>Memoization</Kind>
368 |     <Context context = "int_&lt;1&gt;"/>
369 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
370 |     <TimeStamp time = "418647494.420385"/>
371 |     <MemoryUsage bytes = "0"/>
372 | </TemplateBegin>
373 | <TemplateEnd>
374 |     <Kind>Memoization</Kind>
375 |     <TimeStamp time = "418647494.420385"/>
376 |     <MemoryUsage bytes = "0"/>
377 | </TemplateEnd>
378 | <TemplateBegin>
379 |     <Kind>Memoization</Kind>
380 |     <Context context = "int_&lt;2&gt;"/>
381 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
382 |     <TimeStamp time = "418647494.420388"/>
383 |     <MemoryUsage bytes = "0"/>
384 | </TemplateBegin>
385 | <TemplateEnd>
386 |     <Kind>Memoization</Kind>
387 |     <TimeStamp time = "418647494.420388"/>
388 |     <MemoryUsage bytes = "0"/>
389 | </TemplateEnd>
390 | <TemplateEnd>
391 |     <Kind>TemplateInstantiation</Kind>
392 |     <TimeStamp time = "418647494.420397"/>
393 |     <MemoryUsage bytes = "0"/>
394 | </TemplateEnd>
395 | <TemplateBegin>
396 |     <Kind>TemplateInstantiation</Kind>
397 |     <Context context = "bool_&lt;true&gt;"/>
398 |     <PointOfInstantiation>./fib.hpp|61|26</PointOfInstantiation>
399 |     <TimeStamp time = "418647494.420400"/>
400 |     <MemoryUsage bytes = "0"/>
401 | </TemplateBegin>
402 | <TemplateEnd>
403 |     <Kind>TemplateInstantiation</Kind>
404 |     <TimeStamp time = "418647494.420404"/>
405 |     <MemoryUsage bytes = "0"/>
406 | </TemplateEnd>
407 | <TemplateBegin>
408 |     <Kind>TemplateInstantiation</Kind>
409 |     <Context context = "bool_&lt;true&gt;::value"/>
410 |     <PointOfInstantiation>./fib.hpp|61|32</PointOfInstantiation>
411 |     <TimeStamp time = "418647494.420406"/>
412 |     <MemoryUsage bytes = "0"/>
413 | </TemplateBegin>
414 | <TemplateEnd>
415 |     <Kind>TemplateInstantiation</Kind>
416 |     <TimeStamp time = "418647494.420424"/>
417 |     <MemoryUsage bytes = "0"/>
418 | </TemplateEnd>
419 | <TemplateBegin>
420 |     <Kind>TemplateInstantiation</Kind>
421 |     <Context context = "if_c&lt;true, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
422 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
423 |     <TimeStamp time = "418647494.420434"/>
424 |     <MemoryUsage bytes = "0"/>
425 | </TemplateBegin>
426 | <TemplateEnd>
427 |     <Kind>TemplateInstantiation</Kind>
428 |     <TimeStamp time = "418647494.420437"/>
429 |     <MemoryUsage bytes = "0"/>
430 | </TemplateEnd>
431 | <TemplateBegin>
432 |     <Kind>Memoization</Kind>
433 |     <Context context = "int_&lt;1&gt;"/>
434 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
435 |     <TimeStamp time = "418647494.420439"/>
436 |     <MemoryUsage bytes = "0"/>
437 | </TemplateBegin>
438 | <TemplateEnd>
439 |     <Kind>Memoization</Kind>
440 |     <TimeStamp time = "418647494.420440"/>
441 |     <MemoryUsage bytes = "0"/>
442 | </TemplateEnd>
443 | <TemplateEnd>
444 |     <Kind>TemplateInstantiation</Kind>
445 |     <TimeStamp time = "418647494.420445"/>
446 |     <MemoryUsage bytes = "0"/>
447 | </TemplateEnd>
448 | <TemplateEnd>
449 |     <Kind>TemplateInstantiation</Kind>
450 |     <TimeStamp time = "418647494.420447"/>
451 |     <MemoryUsage bytes = "0"/>
452 | </TemplateEnd>
453 | <TemplateBegin>
454 |     <Kind>Memoization</Kind>
455 |     <Context context = "int_&lt;1&gt;"/>
456 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
457 |     <TimeStamp time = "418647494.420452"/>
458 |     <MemoryUsage bytes = "0"/>
459 | </TemplateBegin>
460 | <TemplateEnd>
461 |     <Kind>Memoization</Kind>
462 |     <TimeStamp time = "418647494.420452"/>
463 |     <MemoryUsage bytes = "0"/>
464 | </TemplateEnd>
465 | <TemplateBegin>
466 |     <Kind>TemplateInstantiation</Kind>
467 |     <Context context = "lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt; &gt;"/>
468 |     <PointOfInstantiation>./fib.hpp|31|33</PointOfInstantiation>
469 |     <TimeStamp time = "418647494.420456"/>
470 |     <MemoryUsage bytes = "0"/>
471 | </TemplateBegin>
472 | <TemplateBegin>
473 |     <Kind>TemplateInstantiation</Kind>
474 |     <Context context = "eval_if&lt;less&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
475 |     <PointOfInstantiation>./fib.hpp|66|3</PointOfInstantiation>
476 |     <TimeStamp time = "418647494.420471"/>
477 |     <MemoryUsage bytes = "0"/>
478 | </TemplateBegin>
479 | <TemplateBegin>
480 |     <Kind>TemplateInstantiation</Kind>
481 |     <Context context = "less&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt;"/>
482 |     <PointOfInstantiation>./fib.hpp|61|23</PointOfInstantiation>
483 |     <TimeStamp time = "418647494.420473"/>
484 |     <MemoryUsage bytes = "0"/>
485 | </TemplateBegin>
486 | <TemplateBegin>
487 |     <Kind>TemplateInstantiation</Kind>
488 |     <Context context = "minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;"/>
489 |     <PointOfInstantiation>./fib.hpp|43|18</PointOfInstantiation>
490 |     <TimeStamp time = "418647494.420476"/>
491 |     <MemoryUsage bytes = "0"/>
492 | </TemplateBegin>
493 | <TemplateBegin>
494 |     <Kind>Memoization</Kind>
495 |     <Context context = "minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;"/>
496 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
497 |     <TimeStamp time = "418647494.420478"/>
498 |     <MemoryUsage bytes = "0"/>
499 | </TemplateBegin>
500 | <TemplateEnd>
501 |     <Kind>Memoization</Kind>
502 |     <TimeStamp time = "418647494.420478"/>
503 |     <MemoryUsage bytes = "0"/>
504 | </TemplateEnd>
505 | <TemplateBegin>
506 |     <Kind>Memoization</Kind>
507 |     <Context context = "int_&lt;2&gt;"/>
508 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
509 |     <TimeStamp time = "418647494.420479"/>
510 |     <MemoryUsage bytes = "0"/>
511 | </TemplateBegin>
512 | <TemplateEnd>
513 |     <Kind>Memoization</Kind>
514 |     <TimeStamp time = "418647494.420480"/>
515 |     <MemoryUsage bytes = "0"/>
516 | </TemplateEnd>
517 | <TemplateEnd>
518 |     <Kind>TemplateInstantiation</Kind>
519 |     <TimeStamp time = "418647494.420493"/>
520 |     <MemoryUsage bytes = "0"/>
521 | </TemplateEnd>
522 | <TemplateBegin>
523 |     <Kind>TemplateInstantiation</Kind>
524 |     <Context context = "int_&lt;0&gt;"/>
525 |     <PointOfInstantiation>./fib.hpp|43|21</PointOfInstantiation>
526 |     <TimeStamp time = "418647494.420495"/>
527 |     <MemoryUsage bytes = "0"/>
528 | </TemplateBegin>
529 | <TemplateEnd>
530 |     <Kind>TemplateInstantiation</Kind>
531 |     <TimeStamp time = "418647494.420500"/>
532 |     <MemoryUsage bytes = "0"/>
533 | </TemplateEnd>
534 | <TemplateBegin>
535 |     <Kind>TemplateInstantiation</Kind>
536 |     <Context context = "int_&lt;0&gt;::value"/>
537 |     <PointOfInstantiation>./fib.hpp|43|27</PointOfInstantiation>
538 |     <TimeStamp time = "418647494.420501"/>
539 |     <MemoryUsage bytes = "0"/>
540 | </TemplateBegin>
541 | <TemplateEnd>
542 |     <Kind>TemplateInstantiation</Kind>
543 |     <TimeStamp time = "418647494.420518"/>
544 |     <MemoryUsage bytes = "0"/>
545 | </TemplateEnd>
546 | <TemplateBegin>
547 |     <Kind>Memoization</Kind>
548 |     <Context context = "int_&lt;2&gt;"/>
549 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
550 |     <TimeStamp time = "418647494.420521"/>
551 |     <MemoryUsage bytes = "0"/>
552 | </TemplateBegin>
553 | <TemplateEnd>
554 |     <Kind>Memoization</Kind>
555 |     <TimeStamp time = "418647494.420521"/>
556 |     <MemoryUsage bytes = "0"/>
557 | </TemplateEnd>
558 | <TemplateEnd>
559 |     <Kind>TemplateInstantiation</Kind>
560 |     <TimeStamp time = "418647494.420533"/>
561 |     <MemoryUsage bytes = "0"/>
562 | </TemplateEnd>
563 | <TemplateBegin>
564 |     <Kind>Memoization</Kind>
565 |     <Context context = "bool_&lt;true&gt;"/>
566 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
567 |     <TimeStamp time = "418647494.420535"/>
568 |     <MemoryUsage bytes = "0"/>
569 | </TemplateBegin>
570 | <TemplateEnd>
571 |     <Kind>Memoization</Kind>
572 |     <TimeStamp time = "418647494.420536"/>
573 |     <MemoryUsage bytes = "0"/>
574 | </TemplateEnd>
575 | <TemplateBegin>
576 |     <Kind>TemplateInstantiation</Kind>
577 |     <Context context = "if_c&lt;true, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;1&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
578 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
579 |     <TimeStamp time = "418647494.420545"/>
580 |     <MemoryUsage bytes = "0"/>
581 | </TemplateBegin>
582 | <TemplateEnd>
583 |     <Kind>TemplateInstantiation</Kind>
584 |     <TimeStamp time = "418647494.420547"/>
585 |     <MemoryUsage bytes = "0"/>
586 | </TemplateEnd>
587 | <TemplateBegin>
588 |     <Kind>Memoization</Kind>
589 |     <Context context = "int_&lt;1&gt;"/>
590 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
591 |     <TimeStamp time = "418647494.420549"/>
592 |     <MemoryUsage bytes = "0"/>
593 | </TemplateBegin>
594 | <TemplateEnd>
595 |     <Kind>Memoization</Kind>
596 |     <TimeStamp time = "418647494.420549"/>
597 |     <MemoryUsage bytes = "0"/>
598 | </TemplateEnd>
599 | <TemplateEnd>
600 |     <Kind>TemplateInstantiation</Kind>
601 |     <TimeStamp time = "418647494.420552"/>
602 |     <MemoryUsage bytes = "0"/>
603 | </TemplateEnd>
604 | <TemplateEnd>
605 |     <Kind>TemplateInstantiation</Kind>
606 |     <TimeStamp time = "418647494.420553"/>
607 |     <MemoryUsage bytes = "0"/>
608 | </TemplateEnd>
609 | <TemplateBegin>
610 |     <Kind>Memoization</Kind>
611 |     <Context context = "int_&lt;1&gt;"/>
612 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
613 |     <TimeStamp time = "418647494.420556"/>
614 |     <MemoryUsage bytes = "0"/>
615 | </TemplateBegin>
616 | <TemplateEnd>
617 |     <Kind>Memoization</Kind>
618 |     <TimeStamp time = "418647494.420556"/>
619 |     <MemoryUsage bytes = "0"/>
620 | </TemplateEnd>
621 | <TemplateEnd>
622 |     <Kind>TemplateInstantiation</Kind>
623 |     <TimeStamp time = "418647494.420569"/>
624 |     <MemoryUsage bytes = "0"/>
625 | </TemplateEnd>
626 | <TemplateEnd>
627 |     <Kind>TemplateInstantiation</Kind>
628 |     <TimeStamp time = "418647494.420571"/>
629 |     <MemoryUsage bytes = "0"/>
630 | </TemplateEnd>
631 | <TemplateEnd>
632 |     <Kind>TemplateInstantiation</Kind>
633 |     <TimeStamp time = "418647494.420573"/>
634 |     <MemoryUsage bytes = "0"/>
635 | </TemplateEnd>
636 | <TemplateBegin>
637 |     <Kind>Memoization</Kind>
638 |     <Context context = "int_&lt;2&gt;"/>
639 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
640 |     <TimeStamp time = "418647494.420575"/>
641 |     <MemoryUsage bytes = "0"/>
642 | </TemplateBegin>
643 | <TemplateEnd>
644 |     <Kind>Memoization</Kind>
645 |     <TimeStamp time = "418647494.420576"/>
646 |     <MemoryUsage bytes = "0"/>
647 | </TemplateEnd>
648 | <TemplateBegin>
649 |     <Kind>TemplateInstantiation</Kind>
650 |     <Context context = "lazy_fib&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt; &gt;"/>
651 |     <PointOfInstantiation>./fib.hpp|31|33</PointOfInstantiation>
652 |     <TimeStamp time = "418647494.420579"/>
653 |     <MemoryUsage bytes = "0"/>
654 | </TemplateBegin>
655 | <TemplateBegin>
656 |     <Kind>TemplateInstantiation</Kind>
657 |     <Context context = "eval_if&lt;less&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
658 |     <PointOfInstantiation>./fib.hpp|66|3</PointOfInstantiation>
659 |     <TimeStamp time = "418647494.420592"/>
660 |     <MemoryUsage bytes = "0"/>
661 | </TemplateBegin>
662 | <TemplateBegin>
663 |     <Kind>TemplateInstantiation</Kind>
664 |     <Context context = "less&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt;"/>
665 |     <PointOfInstantiation>./fib.hpp|61|23</PointOfInstantiation>
666 |     <TimeStamp time = "418647494.420595"/>
667 |     <MemoryUsage bytes = "0"/>
668 | </TemplateBegin>
669 | <TemplateBegin>
670 |     <Kind>TemplateInstantiation</Kind>
671 |     <Context context = "minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;"/>
672 |     <PointOfInstantiation>./fib.hpp|43|18</PointOfInstantiation>
673 |     <TimeStamp time = "418647494.420597"/>
674 |     <MemoryUsage bytes = "0"/>
675 | </TemplateBegin>
676 | <TemplateBegin>
677 |     <Kind>Memoization</Kind>
678 |     <Context context = "int_&lt;3&gt;"/>
679 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
680 |     <TimeStamp time = "418647494.420602"/>
681 |     <MemoryUsage bytes = "0"/>
682 | </TemplateBegin>
683 | <TemplateEnd>
684 |     <Kind>Memoization</Kind>
685 |     <TimeStamp time = "418647494.420603"/>
686 |     <MemoryUsage bytes = "0"/>
687 | </TemplateEnd>
688 | <TemplateBegin>
689 |     <Kind>Memoization</Kind>
690 |     <Context context = "int_&lt;2&gt;"/>
691 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
692 |     <TimeStamp time = "418647494.420606"/>
693 |     <MemoryUsage bytes = "0"/>
694 | </TemplateBegin>
695 | <TemplateEnd>
696 |     <Kind>Memoization</Kind>
697 |     <TimeStamp time = "418647494.420607"/>
698 |     <MemoryUsage bytes = "0"/>
699 | </TemplateEnd>
700 | <TemplateEnd>
701 |     <Kind>TemplateInstantiation</Kind>
702 |     <TimeStamp time = "418647494.420616"/>
703 |     <MemoryUsage bytes = "0"/>
704 | </TemplateEnd>
705 | <TemplateBegin>
706 |     <Kind>Memoization</Kind>
707 |     <Context context = "int_&lt;1&gt;"/>
708 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
709 |     <TimeStamp time = "418647494.420618"/>
710 |     <MemoryUsage bytes = "0"/>
711 | </TemplateBegin>
712 | <TemplateEnd>
713 |     <Kind>Memoization</Kind>
714 |     <TimeStamp time = "418647494.420619"/>
715 |     <MemoryUsage bytes = "0"/>
716 | </TemplateEnd>
717 | <TemplateBegin>
718 |     <Kind>Memoization</Kind>
719 |     <Context context = "int_&lt;2&gt;"/>
720 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
721 |     <TimeStamp time = "418647494.420621"/>
722 |     <MemoryUsage bytes = "0"/>
723 | </TemplateBegin>
724 | <TemplateEnd>
725 |     <Kind>Memoization</Kind>
726 |     <TimeStamp time = "418647494.420622"/>
727 |     <MemoryUsage bytes = "0"/>
728 | </TemplateEnd>
729 | <TemplateEnd>
730 |     <Kind>TemplateInstantiation</Kind>
731 |     <TimeStamp time = "418647494.420630"/>
732 |     <MemoryUsage bytes = "0"/>
733 | </TemplateEnd>
734 | <TemplateBegin>
735 |     <Kind>Memoization</Kind>
736 |     <Context context = "bool_&lt;true&gt;"/>
737 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
738 |     <TimeStamp time = "418647494.420632"/>
739 |     <MemoryUsage bytes = "0"/>
740 | </TemplateBegin>
741 | <TemplateEnd>
742 |     <Kind>Memoization</Kind>
743 |     <TimeStamp time = "418647494.420632"/>
744 |     <MemoryUsage bytes = "0"/>
745 | </TemplateEnd>
746 | <TemplateBegin>
747 |     <Kind>TemplateInstantiation</Kind>
748 |     <Context context = "if_c&lt;true, int_&lt;1&gt;, plus&lt;lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;1&gt; &gt; &gt;, lazy_fib&lt;minus&lt;minus&lt;int_&lt;3&gt;, int_&lt;2&gt; &gt;, int_&lt;2&gt; &gt; &gt; &gt; &gt;"/>
749 |     <PointOfInstantiation>./fib.hpp|61|18</PointOfInstantiation>
750 |     <TimeStamp time = "418647494.420642"/>
751 |     <MemoryUsage bytes = "0"/>
752 | </TemplateBegin>
753 | <TemplateEnd>
754 |     <Kind>TemplateInstantiation</Kind>
755 |     <TimeStamp time = "418647494.420644"/>
756 |     <MemoryUsage bytes = "0"/>
757 | </TemplateEnd>
758 | <TemplateBegin>
759 |     <Kind>Memoization</Kind>
760 |     <Context context = "int_&lt;1&gt;"/>
761 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
762 |     <TimeStamp time = "418647494.420646"/>
763 |     <MemoryUsage bytes = "0"/>
764 | </TemplateBegin>
765 | <TemplateEnd>
766 |     <Kind>Memoization</Kind>
767 |     <TimeStamp time = "418647494.420646"/>
768 |     <MemoryUsage bytes = "0"/>
769 | </TemplateEnd>
770 | <TemplateEnd>
771 |     <Kind>TemplateInstantiation</Kind>
772 |     <TimeStamp time = "418647494.420648"/>
773 |     <MemoryUsage bytes = "0"/>
774 | </TemplateEnd>
775 | <TemplateEnd>
776 |     <Kind>TemplateInstantiation</Kind>
777 |     <TimeStamp time = "418647494.420650"/>
778 |     <MemoryUsage bytes = "0"/>
779 | </TemplateEnd>
780 | <TemplateBegin>
781 |     <Kind>Memoization</Kind>
782 |     <Context context = "int_&lt;1&gt;"/>
783 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
784 |     <TimeStamp time = "418647494.420652"/>
785 |     <MemoryUsage bytes = "0"/>
786 | </TemplateBegin>
787 | <TemplateEnd>
788 |     <Kind>Memoization</Kind>
789 |     <TimeStamp time = "418647494.420653"/>
790 |     <MemoryUsage bytes = "0"/>
791 | </TemplateEnd>
792 | <TemplateEnd>
793 |     <Kind>TemplateInstantiation</Kind>
794 |     <TimeStamp time = "418647494.420662"/>
795 |     <MemoryUsage bytes = "0"/>
796 | </TemplateEnd>
797 | <TemplateEnd>
798 |     <Kind>TemplateInstantiation</Kind>
799 |     <TimeStamp time = "418647494.420664"/>
800 |     <MemoryUsage bytes = "0"/>
801 | </TemplateEnd>
802 | <TemplateEnd>
803 |     <Kind>TemplateInstantiation</Kind>
804 |     <TimeStamp time = "418647494.420666"/>
805 |     <MemoryUsage bytes = "0"/>
806 | </TemplateEnd>
807 | <TemplateBegin>
808 |     <Kind>Memoization</Kind>
809 |     <Context context = "int_&lt;3&gt;"/>
810 |     <PointOfInstantiation>fib_lazy_3.cpp|5|10</PointOfInstantiation>
811 |     <TimeStamp time = "418647494.420669"/>
812 |     <MemoryUsage bytes = "0"/>
813 | </TemplateBegin>
814 | <TemplateEnd>
815 |     <Kind>Memoization</Kind>
816 |     <TimeStamp time = "418647494.420669"/>
817 |     <MemoryUsage bytes = "0"/>
818 | </TemplateEnd>
819 | </Trace>
820 | 


--------------------------------------------------------------------------------
/LICENSE.md:
--------------------------------------------------------------------------------
  1 | # GNU GENERAL PUBLIC LICENSE
  2 | 
  3 | Version 3, 29 June 2007
  4 | 
  5 | Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  6 | Everyone is permitted to copy and distribute verbatim copies
  7 | of this license document, but changing it is not allowed.
  8 | 
  9 | ## Preamble
 10 | 
 11 | The GNU General Public License is a free, copyleft license for
 12 | software and other kinds of works.
 13 | 
 14 | The licenses for most software and other practical works are designed
 15 | to take away your freedom to share and change the works.  By contrast,
 16 | the GNU General Public License is intended to guarantee your freedom to
 17 | share and change all versions of a program--to make sure it remains free
 18 | software for all its users.  We, the Free Software Foundation, use the
 19 | GNU General Public License for most of our software; it applies also to
 20 | any other work released this way by its authors.  You can apply it to
 21 | your programs, too.
 22 | 
 23 | When we speak of free software, we are referring to freedom, not
 24 | price.  Our General Public Licenses are designed to make sure that you
 25 | have the freedom to distribute copies of free software (and charge for
 26 | them if you wish), that you receive source code or can get it if you
 27 | want it, that you can change the software or use pieces of it in new
 28 | free programs, and that you know you can do these things.
 29 | 
 30 | To protect your rights, we need to prevent others from denying you
 31 | these rights or asking you to surrender the rights.  Therefore, you have
 32 | certain responsibilities if you distribute copies of the software, or if
 33 | you modify it: responsibilities to respect the freedom of others.
 34 | 
 35 | For example, if you distribute copies of such a program, whether
 36 | gratis or for a fee, you must pass on to the recipients the same
 37 | freedoms that you received.  You must make sure that they, too, receive
 38 | or can get the source code.  And you must show them these terms so they
 39 | know their rights.
 40 | 
 41 | Developers that use the GNU GPL protect your rights with two steps:
 42 | (1) assert copyright on the software, and (2) offer you this License
 43 | giving you legal permission to copy, distribute and/or modify it.
 44 | 
 45 | For the developers' and authors' protection, the GPL clearly explains
 46 | that there is no warranty for this free software.  For both users' and
 47 | authors' sake, the GPL requires that modified versions be marked as
 48 | changed, so that their problems will not be attributed erroneously to
 49 | authors of previous versions.
 50 | 
 51 | Some devices are designed to deny users access to install or run
 52 | modified versions of the software inside them, although the manufacturer
 53 | can do so.  This is fundamentally incompatible with the aim of
 54 | protecting users' freedom to change the software.  The systematic
 55 | pattern of such abuse occurs in the area of products for individuals to
 56 | use, which is precisely where it is most unacceptable.  Therefore, we
 57 | have designed this version of the GPL to prohibit the practice for those
 58 | products.  If such problems arise substantially in other domains, we
 59 | stand ready to extend this provision to those domains in future versions
 60 | of the GPL, as needed to protect the freedom of users.
 61 | 
 62 | Finally, every program is threatened constantly by software patents.
 63 | States should not allow patents to restrict development and use of
 64 | software on general-purpose computers, but in those that do, we wish to
 65 | avoid the special danger that patents applied to a free program could
 66 | make it effectively proprietary.  To prevent this, the GPL assures that
 67 | patents cannot be used to render the program non-free.
 68 | 
 69 | The precise terms and conditions for copying, distribution and
 70 | modification follow.
 71 | 
 72 | ## TERMS AND CONDITIONS
 73 | 
 74 | ### 0. Definitions.
 75 | 
 76 | "This License" refers to version 3 of the GNU General Public License.
 77 | 
 78 | "Copyright" also means copyright-like laws that apply to other kinds of
 79 | works, such as semiconductor masks.
 80 | 
 81 | "The Program" refers to any copyrightable work licensed under this
 82 | License.  Each licensee is addressed as "you".  "Licensees" and
 83 | "recipients" may be individuals or organizations.
 84 | 
 85 | To "modify" a work means to copy from or adapt all or part of the work
 86 | in a fashion requiring copyright permission, other than the making of an
 87 | exact copy.  The resulting work is called a "modified version" of the
 88 | earlier work or a work "based on" the earlier work.
 89 | 
 90 | A "covered work" means either the unmodified Program or a work based
 91 | on the Program.
 92 | 
 93 | To "propagate" a work means to do anything with it that, without
 94 | permission, would make you directly or secondarily liable for
 95 | infringement under applicable copyright law, except executing it on a
 96 | computer or modifying a private copy.  Propagation includes copying,
 97 | distribution (with or without modification), making available to the
 98 | public, and in some countries other activities as well.
 99 | 
100 | To "convey" a work means any kind of propagation that enables other
101 | parties to make or receive copies.  Mere interaction with a user through
102 | a computer network, with no transfer of a copy, is not conveying.
103 | 
104 | An interactive user interface displays "Appropriate Legal Notices"
105 | to the extent that it includes a convenient and prominently visible
106 | feature that (1) displays an appropriate copyright notice, and (2)
107 | tells the user that there is no warranty for the work (except to the
108 | extent that warranties are provided), that licensees may convey the
109 | work under this License, and how to view a copy of this License.  If
110 | the interface presents a list of user commands or options, such as a
111 | menu, a prominent item in the list meets this criterion.
112 | 
113 | ### 1. Source Code.
114 | 
115 | The "source code" for a work means the preferred form of the work
116 | for making modifications to it.  "Object code" means any non-source
117 | form of a work.
118 | 
119 | A "Standard Interface" means an interface that either is an official
120 | standard defined by a recognized standards body, or, in the case of
121 | interfaces specified for a particular programming language, one that
122 | is widely used among developers working in that language.
123 | 
124 | The "System Libraries" of an executable work include anything, other
125 | than the work as a whole, that (a) is included in the normal form of
126 | packaging a Major Component, but which is not part of that Major
127 | Component, and (b) serves only to enable use of the work with that
128 | Major Component, or to implement a Standard Interface for which an
129 | implementation is available to the public in source code form.  A
130 | "Major Component", in this context, means a major essential component
131 | (kernel, window system, and so on) of the specific operating system
132 | (if any) on which the executable work runs, or a compiler used to
133 | produce the work, or an object code interpreter used to run it.
134 | 
135 | The "Corresponding Source" for a work in object code form means all
136 | the source code needed to generate, install, and (for an executable
137 | work) run the object code and to modify the work, including scripts to
138 | control those activities.  However, it does not include the work's
139 | System Libraries, or general-purpose tools or generally available free
140 | programs which are used unmodified in performing those activities but
141 | which are not part of the work.  For example, Corresponding Source
142 | includes interface definition files associated with source files for
143 | the work, and the source code for shared libraries and dynamically
144 | linked subprograms that the work is specifically designed to require,
145 | such as by intimate data communication or control flow between those
146 | subprograms and other parts of the work.
147 | 
148 | The Corresponding Source need not include anything that users
149 | can regenerate automatically from other parts of the Corresponding
150 | Source.
151 | 
152 | The Corresponding Source for a work in source code form is that
153 | same work.
154 | 
155 | ### 2. Basic Permissions.
156 | 
157 | All rights granted under this License are granted for the term of
158 | copyright on the Program, and are irrevocable provided the stated
159 | conditions are met.  This License explicitly affirms your unlimited
160 | permission to run the unmodified Program.  The output from running a
161 | covered work is covered by this License only if the output, given its
162 | content, constitutes a covered work.  This License acknowledges your
163 | rights of fair use or other equivalent, as provided by copyright law.
164 | 
165 | You may make, run and propagate covered works that you do not
166 | convey, without conditions so long as your license otherwise remains
167 | in force.  You may convey covered works to others for the sole purpose
168 | of having them make modifications exclusively for you, or provide you
169 | with facilities for running those works, provided that you comply with
170 | the terms of this License in conveying all material for which you do
171 | not control copyright.  Those thus making or running the covered works
172 | for you must do so exclusively on your behalf, under your direction
173 | and control, on terms that prohibit them from making any copies of
174 | your copyrighted material outside their relationship with you.
175 | 
176 | Conveying under any other circumstances is permitted solely under
177 | the conditions stated below.  Sublicensing is not allowed; section 10
178 | makes it unnecessary.
179 | 
180 | ### 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
181 | 
182 | No covered work shall be deemed part of an effective technological
183 | measure under any applicable law fulfilling obligations under article
184 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
185 | similar laws prohibiting or restricting circumvention of such
186 | measures.
187 | 
188 | When you convey a covered work, you waive any legal power to forbid
189 | circumvention of technological measures to the extent such circumvention
190 | is effected by exercising rights under this License with respect to
191 | the covered work, and you disclaim any intention to limit operation or
192 | modification of the work as a means of enforcing, against the work's
193 | users, your or third parties' legal rights to forbid circumvention of
194 | technological measures.
195 | 
196 | ### 4. Conveying Verbatim Copies.
197 | 
198 | You may convey verbatim copies of the Program's source code as you
199 | receive it, in any medium, provided that you conspicuously and
200 | appropriately publish on each copy an appropriate copyright notice;
201 | keep intact all notices stating that this License and any
202 | non-permissive terms added in accord with section 7 apply to the code;
203 | keep intact all notices of the absence of any warranty; and give all
204 | recipients a copy of this License along with the Program.
205 | 
206 | You may charge any price or no price for each copy that you convey,
207 | and you may offer support or warranty protection for a fee.
208 | 
209 | ### 5. Conveying Modified Source Versions.
210 | 
211 | You may convey a work based on the Program, or the modifications to
212 | produce it from the Program, in the form of source code under the
213 | terms of section 4, provided that you also meet all of these conditions:
214 | 
215 | -   a) The work must carry prominent notices stating that you modified
216 |     it, and giving a relevant date.
217 | -   b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | -   c) You must license the entire work, as a whole, under this
222 |     License to anyone who comes into possession of a copy.  This
223 |     License will therefore apply, along with any applicable section 7
224 |     additional terms, to the whole of the work, and all its parts,
225 |     regardless of how they are packaged.  This License gives no
226 |     permission to license the work in any other way, but it does not
227 |     invalidate such permission if you have separately received it.
228 | -   d) If the work has interactive user interfaces, each must display
229 |     Appropriate Legal Notices; however, if the Program has interactive
230 |     interfaces that do not display Appropriate Legal Notices, your
231 |     work need not make them do so.
232 | 
233 | A compilation of a covered work with other separate and independent
234 | works, which are not by their nature extensions of the covered work,
235 | and which are not combined with it such as to form a larger program,
236 | in or on a volume of a storage or distribution medium, is called an
237 | "aggregate" if the compilation and its resulting copyright are not
238 | used to limit the access or legal rights of the compilation's users
239 | beyond what the individual works permit.  Inclusion of a covered work
240 | in an aggregate does not cause this License to apply to the other
241 | parts of the aggregate.
242 | 
243 | ### 6. Conveying Non-Source Forms.
244 | 
245 | You may convey a covered work in object code form under the terms
246 | of sections 4 and 5, provided that you also convey the
247 | machine-readable Corresponding Source under the terms of this License,
248 | in one of these ways:
249 | 
250 | -   a) Convey the object code in, or embodied in, a physical product
251 |     (including a physical distribution medium), accompanied by the
252 |     Corresponding Source fixed on a durable physical medium
253 |     customarily used for software interchange.
254 | -   b) Convey the object code in, or embodied in, a physical product
255 |     (including a physical distribution medium), accompanied by a
256 |     written offer, valid for at least three years and valid for as
257 |     long as you offer spare parts or customer support for that product
258 |     model, to give anyone who possesses the object code either (1) a
259 |     copy of the Corresponding Source for all the software in the
260 |     product that is covered by this License, on a durable physical
261 |     medium customarily used for software interchange, for a price no
262 |     more than your reasonable cost of physically performing this
263 |     conveying of source, or (2) access to copy the
264 |     Corresponding Source from a network server at no charge.
265 | -   c) Convey individual copies of the object code with a copy of the
266 |     written offer to provide the Corresponding Source.  This
267 |     alternative is allowed only occasionally and noncommercially, and
268 |     only if you received the object code with such an offer, in accord
269 |     with subsection 6b.
270 | -   d) Convey the object code by offering access from a designated
271 |     place (gratis or for a charge), and offer equivalent access to the
272 |     Corresponding Source in the same way through the same place at no
273 |     further charge.  You need not require recipients to copy the
274 |     Corresponding Source along with the object code.  If the place to
275 |     copy the object code is a network server, the Corresponding Source
276 |     may be on a different server (operated by you or a third party)
277 |     that supports equivalent copying facilities, provided you maintain
278 |     clear directions next to the object code saying where to find the
279 |     Corresponding Source.  Regardless of what server hosts the
280 |     Corresponding Source, you remain obligated to ensure that it is
281 |     available for as long as needed to satisfy these requirements.
282 | -   e) Convey the object code using peer-to-peer transmission, provided
283 |     you inform other peers where the object code and Corresponding
284 |     Source of the work are being offered to the general public at no
285 |     charge under subsection 6d.
286 | 
287 | A separable portion of the object code, whose source code is excluded
288 | from the Corresponding Source as a System Library, need not be
289 | included in conveying the object code work.
290 | 
291 | A "User Product" is either (1) a "consumer product", which means any
292 | tangible personal property which is normally used for personal, family,
293 | or household purposes, or (2) anything designed or sold for incorporation
294 | into a dwelling.  In determining whether a product is a consumer product,
295 | doubtful cases shall be resolved in favor of coverage.  For a particular
296 | product received by a particular user, "normally used" refers to a
297 | typical or common use of that class of product, regardless of the status
298 | of the particular user or of the way in which the particular user
299 | actually uses, or expects or is expected to use, the product.  A product
300 | is a consumer product regardless of whether the product has substantial
301 | commercial, industrial or non-consumer uses, unless such uses represent
302 | the only significant mode of use of the product.
303 | 
304 | "Installation Information" for a User Product means any methods,
305 | procedures, authorization keys, or other information required to install
306 | and execute modified versions of a covered work in that User Product from
307 | a modified version of its Corresponding Source.  The information must
308 | suffice to ensure that the continued functioning of the modified object
309 | code is in no case prevented or interfered with solely because
310 | modification has been made.
311 | 
312 | If you convey an object code work under this section in, or with, or
313 | specifically for use in, a User Product, and the conveying occurs as
314 | part of a transaction in which the right of possession and use of the
315 | User Product is transferred to the recipient in perpetuity or for a
316 | fixed term (regardless of how the transaction is characterized), the
317 | Corresponding Source conveyed under this section must be accompanied
318 | by the Installation Information.  But this requirement does not apply
319 | if neither you nor any third party retains the ability to install
320 | modified object code on the User Product (for example, the work has
321 | been installed in ROM).
322 | 
323 | The requirement to provide Installation Information does not include a
324 | requirement to continue to provide support service, warranty, or updates
325 | for a work that has been modified or installed by the recipient, or for
326 | the User Product in which it has been modified or installed.  Access to a
327 | network may be denied when the modification itself materially and
328 | adversely affects the operation of the network or violates the rules and
329 | protocols for communication across the network.
330 | 
331 | Corresponding Source conveyed, and Installation Information provided,
332 | in accord with this section must be in a format that is publicly
333 | documented (and with an implementation available to the public in
334 | source code form), and must require no special password or key for
335 | unpacking, reading or copying.
336 | 
337 | ### 7. Additional Terms.
338 | 
339 | "Additional permissions" are terms that supplement the terms of this
340 | License by making exceptions from one or more of its conditions.
341 | Additional permissions that are applicable to the entire Program shall
342 | be treated as though they were included in this License, to the extent
343 | that they are valid under applicable law.  If additional permissions
344 | apply only to part of the Program, that part may be used separately
345 | under those permissions, but the entire Program remains governed by
346 | this License without regard to the additional permissions.
347 | 
348 | When you convey a copy of a covered work, you may at your option
349 | remove any additional permissions from that copy, or from any part of
350 | it.  (Additional permissions may be written to require their own
351 | removal in certain cases when you modify the work.)  You may place
352 | additional permissions on material, added by you to a covered work,
353 | for which you have or can give appropriate copyright permission.
354 | 
355 | Notwithstanding any other provision of this License, for material you
356 | add to a covered work, you may (if authorized by the copyright holders of
357 | that material) supplement the terms of this License with terms:
358 | 
359 | -   a) Disclaiming warranty or limiting liability differently from the
360 |     terms of sections 15 and 16 of this License; or
361 | -   b) Requiring preservation of specified reasonable legal notices or
362 |     author attributions in that material or in the Appropriate Legal
363 |     Notices displayed by works containing it; or
364 | -   c) Prohibiting misrepresentation of the origin of that material, or
365 |     requiring that modified versions of such material be marked in
366 |     reasonable ways as different from the original version; or
367 | -   d) Limiting the use for publicity purposes of names of licensors or
368 |     authors of the material; or
369 | -   e) Declining to grant rights under trademark law for use of some
370 |     trade names, trademarks, or service marks; or
371 | -   f) Requiring indemnification of licensors and authors of that
372 |     material by anyone who conveys the material (or modified versions of
373 |     it) with contractual assumptions of liability to the recipient, for
374 |     any liability that these contractual assumptions directly impose on
375 |     those licensors and authors.
376 | 
377 | All other non-permissive additional terms are considered "further
378 | restrictions" within the meaning of section 10.  If the Program as you
379 | received it, or any part of it, contains a notice stating that it is
380 | governed by this License along with a term that is a further
381 | restriction, you may remove that term.  If a license document contains
382 | a further restriction but permits relicensing or conveying under this
383 | License, you may add to a covered work material governed by the terms
384 | of that license document, provided that the further restriction does
385 | not survive such relicensing or conveying.
386 | 
387 | If you add terms to a covered work in accord with this section, you
388 | must place, in the relevant source files, a statement of the
389 | additional terms that apply to those files, or a notice indicating
390 | where to find the applicable terms.
391 | 
392 | Additional terms, permissive or non-permissive, may be stated in the
393 | form of a separately written license, or stated as exceptions;
394 | the above requirements apply either way.
395 | 
396 | ### 8. Termination.
397 | 
398 | You may not propagate or modify a covered work except as expressly
399 | provided under this License.  Any attempt otherwise to propagate or
400 | modify it is void, and will automatically terminate your rights under
401 | this License (including any patent licenses granted under the third
402 | paragraph of section 11).
403 | 
404 | However, if you cease all violation of this License, then your
405 | license from a particular copyright holder is reinstated (a)
406 | provisionally, unless and until the copyright holder explicitly and
407 | finally terminates your license, and (b) permanently, if the copyright
408 | holder fails to notify you of the violation by some reasonable means
409 | prior to 60 days after the cessation.
410 | 
411 | Moreover, your license from a particular copyright holder is
412 | reinstated permanently if the copyright holder notifies you of the
413 | violation by some reasonable means, this is the first time you have
414 | received notice of violation of this License (for any work) from that
415 | copyright holder, and you cure the violation prior to 30 days after
416 | your receipt of the notice.
417 | 
418 | Termination of your rights under this section does not terminate the
419 | licenses of parties who have received copies or rights from you under
420 | this License.  If your rights have been terminated and not permanently
421 | reinstated, you do not qualify to receive new licenses for the same
422 | material under section 10.
423 | 
424 | ### 9. Acceptance Not Required for Having Copies.
425 | 
426 | You are not required to accept this License in order to receive or
427 | run a copy of the Program.  Ancillary propagation of a covered work
428 | occurring solely as a consequence of using peer-to-peer transmission
429 | to receive a copy likewise does not require acceptance.  However,
430 | nothing other than this License grants you permission to propagate or
431 | modify any covered work.  These actions infringe copyright if you do
432 | not accept this License.  Therefore, by modifying or propagating a
433 | covered work, you indicate your acceptance of this License to do so.
434 | 
435 | ### 10. Automatic Licensing of Downstream Recipients.
436 | 
437 | Each time you convey a covered work, the recipient automatically
438 | receives a license from the original licensors, to run, modify and
439 | propagate that work, subject to this License.  You are not responsible
440 | for enforcing compliance by third parties with this License.
441 | 
442 | An "entity transaction" is a transaction transferring control of an
443 | organization, or substantially all assets of one, or subdividing an
444 | organization, or merging organizations.  If propagation of a covered
445 | work results from an entity transaction, each party to that
446 | transaction who receives a copy of the work also receives whatever
447 | licenses to the work the party's predecessor in interest had or could
448 | give under the previous paragraph, plus a right to possession of the
449 | Corresponding Source of the work from the predecessor in interest, if
450 | the predecessor has it or can get it with reasonable efforts.
451 | 
452 | You may not impose any further restrictions on the exercise of the
453 | rights granted or affirmed under this License.  For example, you may
454 | not impose a license fee, royalty, or other charge for exercise of
455 | rights granted under this License, and you may not initiate litigation
456 | (including a cross-claim or counterclaim in a lawsuit) alleging that
457 | any patent claim is infringed by making, using, selling, offering for
458 | sale, or importing the Program or any portion of it.
459 | 
460 | ### 11. Patents.
461 | 
462 | A "contributor" is a copyright holder who authorizes use under this
463 | License of the Program or a work on which the Program is based.  The
464 | work thus licensed is called the contributor's "contributor version".
465 | 
466 | A contributor's "essential patent claims" are all patent claims
467 | owned or controlled by the contributor, whether already acquired or
468 | hereafter acquired, that would be infringed by some manner, permitted
469 | by this License, of making, using, or selling its contributor version,
470 | but do not include claims that would be infringed only as a
471 | consequence of further modification of the contributor version.  For
472 | purposes of this definition, "control" includes the right to grant
473 | patent sublicenses in a manner consistent with the requirements of
474 | this License.
475 | 
476 | Each contributor grants you a non-exclusive, worldwide, royalty-free
477 | patent license under the contributor's essential patent claims, to
478 | make, use, sell, offer for sale, import and otherwise run, modify and
479 | propagate the contents of its contributor version.
480 | 
481 | In the following three paragraphs, a "patent license" is any express
482 | agreement or commitment, however denominated, not to enforce a patent
483 | (such as an express permission to practice a patent or covenant not to
484 | sue for patent infringement).  To "grant" such a patent license to a
485 | party means to make such an agreement or commitment not to enforce a
486 | patent against the party.
487 | 
488 | If you convey a covered work, knowingly relying on a patent license,
489 | and the Corresponding Source of the work is not available for anyone
490 | to copy, free of charge and under the terms of this License, through a
491 | publicly available network server or other readily accessible means,
492 | then you must either (1) cause the Corresponding Source to be so
493 | available, or (2) arrange to deprive yourself of the benefit of the
494 | patent license for this particular work, or (3) arrange, in a manner
495 | consistent with the requirements of this License, to extend the patent
496 | license to downstream recipients.  "Knowingly relying" means you have
497 | actual knowledge that, but for the patent license, your conveying the
498 | covered work in a country, or your recipient's use of the covered work
499 | in a country, would infringe one or more identifiable patents in that
500 | country that you have reason to believe are valid.
501 | 
502 | If, pursuant to or in connection with a single transaction or
503 | arrangement, you convey, or propagate by procuring conveyance of, a
504 | covered work, and grant a patent license to some of the parties
505 | receiving the covered work authorizing them to use, propagate, modify
506 | or convey a specific copy of the covered work, then the patent license
507 | you grant is automatically extended to all recipients of the covered
508 | work and works based on it.
509 | 
510 | A patent license is "discriminatory" if it does not include within
511 | the scope of its coverage, prohibits the exercise of, or is
512 | conditioned on the non-exercise of one or more of the rights that are
513 | specifically granted under this License.  You may not convey a covered
514 | work if you are a party to an arrangement with a third party that is
515 | in the business of distributing software, under which you make payment
516 | to the third party based on the extent of your activity of conveying
517 | the work, and under which the third party grants, to any of the
518 | parties who would receive the covered work from you, a discriminatory
519 | patent license (a) in connection with copies of the covered work
520 | conveyed by you (or copies made from those copies), or (b) primarily
521 | for and in connection with specific products or compilations that
522 | contain the covered work, unless you entered into that arrangement,
523 | or that patent license was granted, prior to 28 March 2007.
524 | 
525 | Nothing in this License shall be construed as excluding or limiting
526 | any implied license or other defenses to infringement that may
527 | otherwise be available to you under applicable patent law.
528 | 
529 | ### 12. No Surrender of Others' Freedom.
530 | 
531 | If conditions are imposed on you (whether by court order, agreement or
532 | otherwise) that contradict the conditions of this License, they do not
533 | excuse you from the conditions of this License.  If you cannot convey a
534 | covered work so as to satisfy simultaneously your obligations under this
535 | License and any other pertinent obligations, then as a consequence you may
536 | not convey it at all.  For example, if you agree to terms that obligate you
537 | to collect a royalty for further conveying from those to whom you convey
538 | the Program, the only way you could satisfy both those terms and this
539 | License would be to refrain entirely from conveying the Program.
540 | 
541 | ### 13. Use with the GNU Affero General Public License.
542 | 
543 | Notwithstanding any other provision of this License, you have
544 | permission to link or combine any covered work with a work licensed
545 | under version 3 of the GNU Affero General Public License into a single
546 | combined work, and to convey the resulting work.  The terms of this
547 | License will continue to apply to the part which is the covered work,
548 | but the special requirements of the GNU Affero General Public License,
549 | section 13, concerning interaction through a network will apply to the
550 | combination as such.
551 | 
552 | ### 14. Revised Versions of this License.
553 | 
554 | The Free Software Foundation may publish revised and/or new versions of
555 | the GNU General Public License from time to time.  Such new versions will
556 | be similar in spirit to the present version, but may differ in detail to
557 | address new problems or concerns.
558 | 
559 | Each version is given a distinguishing version number.  If the
560 | Program specifies that a certain numbered version of the GNU General
561 | Public License "or any later version" applies to it, you have the
562 | option of following the terms and conditions either of that numbered
563 | version or of any later version published by the Free Software
564 | Foundation.  If the Program does not specify a version number of the
565 | GNU General Public License, you may choose any version ever published
566 | by the Free Software Foundation.
567 | 
568 | If the Program specifies that a proxy can decide which future
569 | versions of the GNU General Public License can be used, that proxy's
570 | public statement of acceptance of a version permanently authorizes you
571 | to choose that version for the Program.
572 | 
573 | Later license versions may give you additional or different
574 | permissions.  However, no additional obligations are imposed on any
575 | author or copyright holder as a result of your choosing to follow a
576 | later version.
577 | 
578 | ### 15. Disclaimer of Warranty.
579 | 
580 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
581 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
582 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
583 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
584 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
585 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
586 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
587 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
588 | 
589 | ### 16. Limitation of Liability.
590 | 
591 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
592 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
593 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
594 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
595 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
596 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
597 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
598 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
599 | SUCH DAMAGES.
600 | 
601 | ### 17. Interpretation of Sections 15 and 16.
602 | 
603 | If the disclaimer of warranty and limitation of liability provided
604 | above cannot be given local legal effect according to their terms,
605 | reviewing courts shall apply local law that most closely approximates
606 | an absolute waiver of all civil liability in connection with the
607 | Program, unless a warranty or assumption of liability accompanies a
608 | copy of the Program in return for a fee.
609 | 
610 | END OF TERMS AND CONDITIONS
611 | 
612 | 


--------------------------------------------------------------------------------
/sample/instantiation_diagram.svg:
--------------------------------------------------------------------------------
  1 | <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  2 | <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
  3 |  "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
  4 | <!-- Generated by graphviz version 2.26.3 (20100126.1600)
  5 |  -->
  6 | <!-- Title: G Pages: 1 -->
  7 | <svg width="1113pt" height="836pt"
  8 |  viewBox="0.00 0.00 1113.00 836.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
  9 | <g id="graph1" class="graph" transform="scale(1 1) rotate(0) translate(4 832)">
 10 | <title>G</title>
 11 | <polygon fill="white" stroke="white" points="-4,5 -4,-832 1110,-832 1110,5 -4,5"/>
 12 | <!-- t35 -->
 13 | <g id="node1" class="node"><title>t35</title>
 14 | <polygon fill="none" stroke="black" points="130,-324 70,-324 70,-288 130,-288 130,-324"/>
 15 | <text text-anchor="middle" x="100" y="-302.4" font-family="Times Roman,serif" font-size="14.00">eval_if</text>
 16 | </g>
 17 | <!-- t16 -->
 18 | <g id="node5" class="node"><title>t16</title>
 19 | <polygon fill="none" stroke="black" points="287,-36 233,-36 233,-1.77636e-14 287,-3.55271e-15 287,-36"/>
 20 | <text text-anchor="middle" x="260" y="-14.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
 21 | </g>
 22 | <!-- t35&#45;&gt;t16 -->
 23 | <g id="edge130" class="edge"><title>t35&#45;&gt;t16</title>
 24 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M97.1566,-287.935C91.5176,-245.435 83.4796,-137.758 134,-72 155.372,-44.1821 193.904,-30.496 222.751,-23.8903"/>
 25 | <polygon fill="black" stroke="black" points="223.821,-27.242 232.89,-21.7639 222.385,-20.391 223.821,-27.242"/>
 26 | </g>
 27 | <!-- t24 -->
 28 | <g id="node10" class="node"><title>t24</title>
 29 | <polygon fill="none" stroke="black" points="248,-252 194,-252 194,-216 248,-216 248,-252"/>
 30 | <text text-anchor="middle" x="221" y="-230.4" font-family="Times Roman,serif" font-size="14.00">bool_</text>
 31 | </g>
 32 | <!-- t35&#45;&gt;t24 -->
 33 | <g id="edge126" class="edge"><title>t35&#45;&gt;t24</title>
 34 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M130.221,-288.017C146.792,-278.157 167.447,-265.866 184.866,-255.501"/>
 35 | <polygon fill="black" stroke="black" points="186.837,-258.401 193.641,-250.28 183.258,-252.385 186.837,-258.401"/>
 36 | </g>
 37 | <!-- t38 -->
 38 | <g id="node24" class="node"><title>t38</title>
 39 | <polygon fill="none" stroke="black" points="82,-252 28,-252 28,-216 82,-216 82,-252"/>
 40 | <text text-anchor="middle" x="55" y="-230.4" font-family="Times Roman,serif" font-size="14.00">if_c</text>
 41 | </g>
 42 | <!-- t35&#45;&gt;t38 -->
 43 | <g id="edge128" class="edge"><title>t35&#45;&gt;t38</title>
 44 | <path fill="none" stroke="black" d="M88.6446,-287.831C83.5674,-279.708 77.4773,-269.964 71.8824,-261.012"/>
 45 | <polygon fill="black" stroke="black" points="74.7763,-259.038 66.5083,-252.413 68.8403,-262.748 74.7763,-259.038"/>
 46 | </g>
 47 | <!-- t36 -->
 48 | <g id="node32" class="node"><title>t36</title>
 49 | <polygon fill="none" stroke="black" points="468,-252 414,-252 414,-216 468,-216 468,-252"/>
 50 | <text text-anchor="middle" x="441" y="-230.4" font-family="Times Roman,serif" font-size="14.00">less</text>
 51 | </g>
 52 | <!-- t35&#45;&gt;t36 -->
 53 | <g id="edge114" class="edge"><title>t35&#45;&gt;t36</title>
 54 | <path fill="none" stroke="black" d="M130.144,-303.562C184.019,-298.594 300.173,-285.105 404.132,-251.78"/>
 55 | <polygon fill="black" stroke="black" points="405.418,-255.042 413.83,-248.601 403.238,-248.39 405.418,-255.042"/>
 56 | </g>
 57 | <!-- t11 -->
 58 | <g id="node2" class="node"><title>t11</title>
 59 | <polygon fill="none" stroke="black" points="777,-684 723,-684 723,-648 777,-648 777,-684"/>
 60 | <text text-anchor="middle" x="750" y="-662.4" font-family="Times Roman,serif" font-size="14.00">plus</text>
 61 | </g>
 62 | <!-- t11&#45;&gt;t16 -->
 63 | <g id="edge132" class="edge"><title>t11&#45;&gt;t16</title>
 64 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M722.864,-663.734C588.404,-652.149 0,-597.16 0,-522 0,-522 0,-522 0,-162 0,-61.4251 150.723,-30.5249 222.653,-21.5047"/>
 65 | <polygon fill="black" stroke="black" points="223.144,-24.9712 232.667,-20.327 222.326,-18.0191 223.144,-24.9712"/>
 66 | </g>
 67 | <!-- t5 -->
 68 | <g id="node26" class="node"><title>t5</title>
 69 | <polygon fill="none" stroke="black" points="682,-108 628,-108 628,-72 682,-72 682,-108"/>
 70 | <text text-anchor="middle" x="655" y="-86.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
 71 | </g>
 72 | <!-- t11&#45;&gt;t5 -->
 73 | <g id="edge108" class="edge"><title>t11&#45;&gt;t5</title>
 74 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M750,-647.815C750,-620.498 750,-567.25 750,-522 750,-522 750,-522 750,-234 750,-193.118 753.423,-178.184 731,-144 721.149,-128.981 705.558,-116.837 691.054,-107.896"/>
 75 | <polygon fill="black" stroke="black" points="692.626,-104.762 682.225,-102.747 689.099,-110.808 692.626,-104.762"/>
 76 | </g>
 77 | <!-- t12 -->
 78 | <g id="node27" class="node"><title>t12</title>
 79 | <polygon fill="none" stroke="black" points="846,-612 778,-612 778,-576 846,-576 846,-612"/>
 80 | <text text-anchor="middle" x="812" y="-590.4" font-family="Times Roman,serif" font-size="14.00">lazy_fib</text>
 81 | </g>
 82 | <!-- t11&#45;&gt;t12 -->
 83 | <g id="edge28" class="edge"><title>t11&#45;&gt;t12</title>
 84 | <path fill="none" stroke="black" d="M765.645,-647.831C772.859,-639.454 781.557,-629.353 789.46,-620.175"/>
 85 | <polygon fill="black" stroke="black" points="792.271,-622.275 796.144,-612.413 786.967,-617.707 792.271,-622.275"/>
 86 | </g>
 87 | <!-- t34 -->
 88 | <g id="node29" class="node"><title>t34</title>
 89 | <polygon fill="none" stroke="black" points="443,-540 375,-540 375,-504 443,-504 443,-540"/>
 90 | <text text-anchor="middle" x="409" y="-518.4" font-family="Times Roman,serif" font-size="14.00">lazy_fib</text>
 91 | </g>
 92 | <!-- t11&#45;&gt;t34 -->
 93 | <g id="edge110" class="edge"><title>t11&#45;&gt;t34</title>
 94 | <path fill="none" stroke="black" d="M722.957,-654.58C664.206,-629.77 524.457,-570.756 452.888,-540.533"/>
 95 | <polygon fill="black" stroke="black" points="453.831,-537.132 443.257,-536.466 451.107,-543.581 453.831,-537.132"/>
 96 | </g>
 97 | <!-- t8 -->
 98 | <g id="node3" class="node"><title>t8</title>
 99 | <polygon fill="none" stroke="black" points="995,-684 941,-684 941,-648 995,-648 995,-684"/>
100 | <text text-anchor="middle" x="968" y="-662.4" font-family="Times Roman,serif" font-size="14.00">bool_</text>
101 | </g>
102 | <!-- t2 -->
103 | <g id="node4" class="node"><title>t2</title>
104 | <polygon fill="none" stroke="black" points="1014,-180 960,-180 960,-144 1014,-144 1014,-180"/>
105 | <text text-anchor="middle" x="987" y="-158.4" font-family="Times Roman,serif" font-size="14.00">less</text>
106 | </g>
107 | <!-- t3 -->
108 | <g id="node7" class="node"><title>t3</title>
109 | <polygon fill="none" stroke="black" points="886,-36 832,-36 832,-1.77636e-14 886,-3.55271e-15 886,-36"/>
110 | <text text-anchor="middle" x="859" y="-14.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
111 | </g>
112 | <!-- t2&#45;&gt;t3 -->
113 | <g id="edge6" class="edge"><title>t2&#45;&gt;t3</title>
114 | <path fill="none" stroke="black" d="M970.527,-143.915C957.383,-124.853 938.726,-94.5251 918,-72 908.158,-61.3034 896.083,-51.0038 885.334,-42.3197"/>
115 | <polygon fill="black" stroke="black" points="887.432,-39.5157 877.432,-36.014 883.066,-44.9871 887.432,-39.5157"/>
116 | </g>
117 | <!-- t2&#45;&gt;t3 -->
118 | <g id="edge8" class="edge"><title>t2&#45;&gt;t3</title>
119 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M983.881,-143.915C975.383,-124.853 956.726,-94.5251 936,-72 923.997,-58.9546 908.672,-46.4999 894.739,-36.8458"/>
120 | <polygon fill="black" stroke="black" points="896.548,-33.8458 886.285,-31.2164 892.669,-39.6723 896.548,-33.8458"/>
121 | </g>
122 | <!-- t6 -->
123 | <g id="node14" class="node"><title>t6</title>
124 | <polygon fill="none" stroke="black" points="1046,-108 992,-108 992,-72 1046,-72 1046,-108"/>
125 | <text text-anchor="middle" x="1019" y="-86.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
126 | </g>
127 | <!-- t2&#45;&gt;t6 -->
128 | <g id="edge16" class="edge"><title>t2&#45;&gt;t6</title>
129 | <path fill="none" stroke="black" d="M995.075,-143.831C998.61,-135.877 1002.84,-126.369 1006.75,-117.572"/>
130 | <polygon fill="black" stroke="black" points="1009.95,-118.973 1010.82,-108.413 1003.56,-116.13 1009.95,-118.973"/>
131 | </g>
132 | <!-- t4 -->
133 | <g id="node17" class="node"><title>t4</title>
134 | <polygon fill="none" stroke="black" points="918,-108 864,-108 864,-72 918,-72 918,-108"/>
135 | <text text-anchor="middle" x="891" y="-86.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
136 | </g>
137 | <!-- t2&#45;&gt;t4 -->
138 | <g id="edge10" class="edge"><title>t2&#45;&gt;t4</title>
139 | <path fill="none" stroke="black" d="M962.775,-143.831C950.837,-134.878 936.274,-123.956 923.394,-114.295"/>
140 | <polygon fill="black" stroke="black" points="925.317,-111.363 915.217,-108.163 921.117,-116.963 925.317,-111.363"/>
141 | </g>
142 | <!-- t2&#45;&gt;t5 -->
143 | <g id="edge12" class="edge"><title>t2&#45;&gt;t5</title>
144 | <path fill="none" stroke="black" d="M959.694,-152.642C952.311,-149.534 944.43,-146.287 937,-144 851.186,-117.588 746.943,-102.073 692.271,-94.885"/>
145 | <polygon fill="black" stroke="black" points="692.704,-91.4118 682.337,-93.5982 691.804,-98.3538 692.704,-91.4118"/>
146 | </g>
147 | <!-- t2&#45;&gt;t5 -->
148 | <g id="edge14" class="edge"><title>t2&#45;&gt;t5</title>
149 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M959.948,-145.637C958.291,-145.053 956.635,-144.503 955,-144 862.998,-115.683 749.811,-99.8922 692.188,-93.4588"/>
150 | <polygon fill="black" stroke="black" points="692.412,-89.9626 682.093,-92.3655 691.658,-96.9219 692.412,-89.9626"/>
151 | </g>
152 | <!-- t14 -->
153 | <g id="node6" class="node"><title>t14</title>
154 | <polygon fill="none" stroke="black" points="494,-180 440,-180 440,-144 494,-144 494,-180"/>
155 | <text text-anchor="middle" x="467" y="-158.4" font-family="Times Roman,serif" font-size="14.00">less</text>
156 | </g>
157 | <!-- t14&#45;&gt;t5 -->
158 | <g id="edge44" class="edge"><title>t14&#45;&gt;t5</title>
159 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M494.248,-149.758C498.819,-147.785 503.529,-145.801 508,-144 545.273,-128.989 588.504,-113.312 618.39,-102.741"/>
160 | <polygon fill="black" stroke="black" points="619.717,-105.985 627.986,-99.3607 617.391,-99.3825 619.717,-105.985"/>
161 | </g>
162 | <!-- t15 -->
163 | <g id="node37" class="node"><title>t15</title>
164 | <polygon fill="none" stroke="black" points="483,-108 425,-108 425,-72 483,-72 483,-108"/>
165 | <text text-anchor="middle" x="454" y="-86.4" font-family="Times Roman,serif" font-size="14.00">minus</text>
166 | </g>
167 | <!-- t14&#45;&gt;t15 -->
168 | <g id="edge34" class="edge"><title>t14&#45;&gt;t15</title>
169 | <path fill="none" stroke="black" d="M463.72,-143.831C462.329,-136.131 460.676,-126.974 459.131,-118.417"/>
170 | <polygon fill="black" stroke="black" points="462.546,-117.632 457.325,-108.413 455.657,-118.876 462.546,-117.632"/>
171 | </g>
172 | <!-- t37 -->
173 | <g id="node8" class="node"><title>t37</title>
174 | <polygon fill="none" stroke="black" points="722,-180 664,-180 664,-144 722,-144 722,-180"/>
175 | <text text-anchor="middle" x="693" y="-158.4" font-family="Times Roman,serif" font-size="14.00">minus</text>
176 | </g>
177 | <!-- t37&#45;&gt;t3 -->
178 | <g id="edge118" class="edge"><title>t37&#45;&gt;t3</title>
179 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M714.024,-143.762C743.46,-118.227 797.059,-71.7316 830.191,-42.9906"/>
180 | <polygon fill="black" stroke="black" points="832.886,-45.2863 838.147,-36.0896 828.299,-39.9986 832.886,-45.2863"/>
181 | </g>
182 | <!-- t37&#45;&gt;t5 -->
183 | <g id="edge120" class="edge"><title>t37&#45;&gt;t5</title>
184 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M683.411,-143.831C679.168,-135.792 674.088,-126.167 669.404,-117.292"/>
185 | <polygon fill="black" stroke="black" points="672.481,-115.623 664.718,-108.413 666.29,-118.891 672.481,-115.623"/>
186 | </g>
187 | <!-- t28 -->
188 | <g id="node9" class="node"><title>t28</title>
189 | <polygon fill="none" stroke="black" points="434,-324 374,-324 374,-288 434,-288 434,-324"/>
190 | <text text-anchor="middle" x="404" y="-302.4" font-family="Times Roman,serif" font-size="14.00">eval_if</text>
191 | </g>
192 | <!-- t28&#45;&gt;t16 -->
193 | <g id="edge104" class="edge"><title>t28&#45;&gt;t16</title>
194 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M374.023,-287.98C360.216,-278.568 344.406,-266.079 333,-252 282.923,-190.185 267.055,-93.8716 262.138,-46.4049"/>
195 | <polygon fill="black" stroke="black" points="265.603,-45.8675 261.178,-36.2412 258.634,-46.5263 265.603,-45.8675"/>
196 | </g>
197 | <!-- t28&#45;&gt;t24 -->
198 | <g id="edge100" class="edge"><title>t28&#45;&gt;t24</title>
199 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M373.972,-293.303C369.628,-291.503 365.205,-289.691 361,-288 326.082,-273.961 285.989,-258.57 257.683,-247.824"/>
200 | <polygon fill="black" stroke="black" points="258.781,-244.497 248.19,-244.226 256.3,-251.043 258.781,-244.497"/>
201 | </g>
202 | <!-- t33 -->
203 | <g id="node13" class="node"><title>t33</title>
204 | <polygon fill="none" stroke="black" points="684,-252 630,-252 630,-216 684,-216 684,-252"/>
205 | <text text-anchor="middle" x="657" y="-230.4" font-family="Times Roman,serif" font-size="14.00">if_c</text>
206 | </g>
207 | <!-- t28&#45;&gt;t33 -->
208 | <g id="edge102" class="edge"><title>t28&#45;&gt;t33</title>
209 | <path fill="none" stroke="black" d="M434.105,-300.683C474.761,-293.039 549.404,-277.364 620.244,-251.887"/>
210 | <polygon fill="black" stroke="black" points="621.576,-255.126 629.759,-248.396 619.165,-248.555 621.576,-255.126"/>
211 | </g>
212 | <!-- t29 -->
213 | <g id="node33" class="node"><title>t29</title>
214 | <polygon fill="none" stroke="black" points="832,-252 778,-252 778,-216 832,-216 832,-252"/>
215 | <text text-anchor="middle" x="805" y="-230.4" font-family="Times Roman,serif" font-size="14.00">less</text>
216 | </g>
217 | <!-- t28&#45;&gt;t29 -->
218 | <g id="edge86" class="edge"><title>t28&#45;&gt;t29</title>
219 | <path fill="none" stroke="black" d="M434.14,-300.588C506.394,-287.615 689.309,-254.772 768.035,-240.637"/>
220 | <polygon fill="black" stroke="black" points="768.766,-244.062 777.99,-238.85 767.528,-237.172 768.766,-244.062"/>
221 | </g>
222 | <!-- t13 -->
223 | <g id="node11" class="node"><title>t13</title>
224 | <polygon fill="none" stroke="black" points="840,-540 780,-540 780,-504 840,-504 840,-540"/>
225 | <text text-anchor="middle" x="810" y="-518.4" font-family="Times Roman,serif" font-size="14.00">eval_if</text>
226 | </g>
227 | <!-- t13&#45;&gt;t14 -->
228 | <g id="edge32" class="edge"><title>t13&#45;&gt;t14</title>
229 | <path fill="none" stroke="black" d="M786.775,-503.768C757.795,-478.78 712,-430.92 712,-378 712,-378 712,-378 712,-306 712,-265.118 721.522,-245.288 693,-216 679.83,-202.477 565.106,-179.862 504.369,-168.679"/>
230 | <polygon fill="black" stroke="black" points="504.867,-165.212 494.4,-166.857 503.608,-172.098 504.867,-165.212"/>
231 | </g>
232 | <!-- t9 -->
233 | <g id="node15" class="node"><title>t9</title>
234 | <polygon fill="none" stroke="black" points="904,-468 850,-468 850,-432 904,-432 904,-468"/>
235 | <text text-anchor="middle" x="877" y="-446.4" font-family="Times Roman,serif" font-size="14.00">if_c</text>
236 | </g>
237 | <!-- t13&#45;&gt;t9 -->
238 | <g id="edge48" class="edge"><title>t13&#45;&gt;t9</title>
239 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M826.907,-503.831C834.781,-495.369 844.292,-485.149 852.901,-475.897"/>
240 | <polygon fill="black" stroke="black" points="855.615,-478.118 859.865,-468.413 850.491,-473.35 855.615,-478.118"/>
241 | </g>
242 | <!-- t7 -->
243 | <g id="node19" class="node"><title>t7</title>
244 | <polygon fill="none" stroke="black" points="976,-468 922,-468 922,-432 976,-432 976,-468"/>
245 | <text text-anchor="middle" x="949" y="-446.4" font-family="Times Roman,serif" font-size="14.00">bool_</text>
246 | </g>
247 | <!-- t13&#45;&gt;t7 -->
248 | <g id="edge46" class="edge"><title>t13&#45;&gt;t7</title>
249 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M840.161,-506.377C861.495,-495.326 890.202,-480.456 912.778,-468.763"/>
250 | <polygon fill="black" stroke="black" points="914.455,-471.836 921.725,-464.128 911.235,-465.62 914.455,-471.836"/>
251 | </g>
252 | <!-- t18 -->
253 | <g id="node21" class="node"><title>t18</title>
254 | <polygon fill="none" stroke="black" points="832,-468 778,-468 778,-432 832,-432 832,-468"/>
255 | <text text-anchor="middle" x="805" y="-446.4" font-family="Times Roman,serif" font-size="14.00">if_c</text>
256 | </g>
257 | <!-- t13&#45;&gt;t18 -->
258 | <g id="edge50" class="edge"><title>t13&#45;&gt;t18</title>
259 | <path fill="none" stroke="black" d="M808.738,-503.831C808.204,-496.131 807.568,-486.974 806.973,-478.417"/>
260 | <polygon fill="black" stroke="black" points="810.463,-478.147 806.279,-468.413 803.48,-478.632 810.463,-478.147"/>
261 | </g>
262 | <!-- t19 -->
263 | <g id="node23" class="node"><title>t19</title>
264 | <polygon fill="none" stroke="black" points="345,-468 291,-468 291,-432 345,-432 345,-468"/>
265 | <text text-anchor="middle" x="318" y="-446.4" font-family="Times Roman,serif" font-size="14.00">plus</text>
266 | </g>
267 | <!-- t13&#45;&gt;t19 -->
268 | <g id="edge52" class="edge"><title>t13&#45;&gt;t19</title>
269 | <path fill="none" stroke="black" d="M779.964,-517.604C694.297,-505.068 448.921,-469.159 355.096,-455.429"/>
270 | <polygon fill="black" stroke="black" points="355.601,-451.965 345.2,-453.98 354.587,-458.892 355.601,-451.965"/>
271 | </g>
272 | <!-- t0 -->
273 | <g id="node12" class="node"><title>t0</title>
274 | <polygon fill="none" stroke="black" points="974,-828 906,-828 906,-792 974,-792 974,-828"/>
275 | <text text-anchor="middle" x="940" y="-806.4" font-family="Times Roman,serif" font-size="14.00">lazy_fib</text>
276 | </g>
277 | <!-- t1 -->
278 | <g id="node34" class="node"><title>t1</title>
279 | <polygon fill="none" stroke="black" points="970,-756 910,-756 910,-720 970,-720 970,-756"/>
280 | <text text-anchor="middle" x="940" y="-734.4" font-family="Times Roman,serif" font-size="14.00">eval_if</text>
281 | </g>
282 | <!-- t0&#45;&gt;t1 -->
283 | <g id="edge2" class="edge"><title>t0&#45;&gt;t1</title>
284 | <path fill="none" stroke="black" d="M940,-791.831C940,-784.131 940,-774.974 940,-766.417"/>
285 | <polygon fill="black" stroke="black" points="943.5,-766.413 940,-756.413 936.5,-766.413 943.5,-766.413"/>
286 | </g>
287 | <!-- t20 -->
288 | <g id="node16" class="node"><title>t20</title>
289 | <polygon fill="none" stroke="black" points="352,-396 284,-396 284,-360 352,-360 352,-396"/>
290 | <text text-anchor="middle" x="318" y="-374.4" font-family="Times Roman,serif" font-size="14.00">lazy_fib</text>
291 | </g>
292 | <!-- t21 -->
293 | <g id="node38" class="node"><title>t21</title>
294 | <polygon fill="none" stroke="black" points="352,-324 292,-324 292,-288 352,-288 352,-324"/>
295 | <text text-anchor="middle" x="322" y="-302.4" font-family="Times Roman,serif" font-size="14.00">eval_if</text>
296 | </g>
297 | <!-- t20&#45;&gt;t21 -->
298 | <g id="edge56" class="edge"><title>t20&#45;&gt;t21</title>
299 | <path fill="none" stroke="black" d="M319.009,-359.831C319.437,-352.131 319.946,-342.974 320.421,-334.417"/>
300 | <polygon fill="black" stroke="black" points="323.917,-334.592 320.977,-324.413 316.928,-334.204 323.917,-334.592"/>
301 | </g>
302 | <!-- t27 -->
303 | <g id="node18" class="node"><title>t27</title>
304 | <polygon fill="none" stroke="black" points="438,-396 370,-396 370,-360 438,-360 438,-396"/>
305 | <text text-anchor="middle" x="404" y="-374.4" font-family="Times Roman,serif" font-size="14.00">lazy_fib</text>
306 | </g>
307 | <!-- t27&#45;&gt;t28 -->
308 | <g id="edge84" class="edge"><title>t27&#45;&gt;t28</title>
309 | <path fill="none" stroke="black" d="M404,-359.831C404,-352.131 404,-342.974 404,-334.417"/>
310 | <polygon fill="black" stroke="black" points="407.5,-334.413 404,-324.413 400.5,-334.413 407.5,-334.413"/>
311 | </g>
312 | <!-- t26 -->
313 | <g id="node20" class="node"><title>t26</title>
314 | <polygon fill="none" stroke="black" points="540,-252 486,-252 486,-216 540,-216 540,-252"/>
315 | <text text-anchor="middle" x="513" y="-230.4" font-family="Times Roman,serif" font-size="14.00">if_c</text>
316 | </g>
317 | <!-- t30 -->
318 | <g id="node22" class="node"><title>t30</title>
319 | <polygon fill="none" stroke="black" points="646,-180 588,-180 588,-144 646,-144 646,-180"/>
320 | <text text-anchor="middle" x="617" y="-158.4" font-family="Times Roman,serif" font-size="14.00">minus</text>
321 | </g>
322 | <!-- t30&#45;&gt;t5 -->
323 | <g id="edge92" class="edge"><title>t30&#45;&gt;t5</title>
324 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M626.589,-143.831C630.832,-135.792 635.912,-126.167 640.596,-117.292"/>
325 | <polygon fill="black" stroke="black" points="643.71,-118.891 645.282,-108.413 637.519,-115.623 643.71,-118.891"/>
326 | </g>
327 | <!-- t30&#45;&gt;t15 -->
328 | <g id="edge90" class="edge"><title>t30&#45;&gt;t15</title>
329 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M587.859,-149.128C561.285,-137.39 521.833,-119.963 492.638,-107.067"/>
330 | <polygon fill="black" stroke="black" points="493.725,-103.721 483.163,-102.882 490.896,-110.124 493.725,-103.721"/>
331 | </g>
332 | <!-- t19&#45;&gt;t16 -->
333 | <g id="edge80" class="edge"><title>t19&#45;&gt;t16</title>
334 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M294.494,-431.871C259.787,-399.301 197.576,-327.232 176,-252 154.169,-175.88 203.43,-87.1194 235.594,-44.071"/>
335 | <polygon fill="black" stroke="black" points="238.42,-46.1383 241.773,-36.0881 232.885,-41.8537 238.42,-46.1383"/>
336 | </g>
337 | <!-- t19&#45;&gt;t16 -->
338 | <g id="edge106" class="edge"><title>t19&#45;&gt;t16</title>
339 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M305.25,-431.871C277.787,-399.301 215.576,-327.232 194,-252 172.305,-176.356 220.817,-88.2284 246.255,-44.8835"/>
340 | <polygon fill="black" stroke="black" points="249.377,-46.4792 251.445,-36.0881 243.349,-42.9217 249.377,-46.4792"/>
341 | </g>
342 | <!-- t19&#45;&gt;t20 -->
343 | <g id="edge54" class="edge"><title>t19&#45;&gt;t20</title>
344 | <path fill="none" stroke="black" d="M318,-431.831C318,-424.131 318,-414.974 318,-406.417"/>
345 | <polygon fill="black" stroke="black" points="321.5,-406.413 318,-396.413 314.5,-406.413 321.5,-406.413"/>
346 | </g>
347 | <!-- t19&#45;&gt;t27 -->
348 | <g id="edge82" class="edge"><title>t19&#45;&gt;t27</title>
349 | <path fill="none" stroke="black" d="M339.701,-431.831C350.192,-423.048 362.946,-412.371 374.319,-402.849"/>
350 | <polygon fill="black" stroke="black" points="376.885,-405.266 382.306,-396.163 372.391,-399.899 376.885,-405.266"/>
351 | </g>
352 | <!-- t17 -->
353 | <g id="node25" class="node"><title>t17</title>
354 | <polygon fill="none" stroke="black" points="481,-36 427,-36 427,-1.77636e-14 481,-3.55271e-15 481,-36"/>
355 | <text text-anchor="middle" x="454" y="-14.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
356 | </g>
357 | <!-- t12&#45;&gt;t13 -->
358 | <g id="edge30" class="edge"><title>t12&#45;&gt;t13</title>
359 | <path fill="none" stroke="black" d="M811.495,-575.831C811.281,-568.131 811.027,-558.974 810.789,-550.417"/>
360 | <polygon fill="black" stroke="black" points="814.288,-550.312 810.511,-540.413 807.291,-550.507 814.288,-550.312"/>
361 | </g>
362 | <!-- t10 -->
363 | <g id="node28" class="node"><title>t10</title>
364 | <polygon fill="none" stroke="black" points="1105,-684 1051,-684 1051,-648 1105,-648 1105,-684"/>
365 | <text text-anchor="middle" x="1078" y="-662.4" font-family="Times Roman,serif" font-size="14.00">if_c</text>
366 | </g>
367 | <!-- t34&#45;&gt;t35 -->
368 | <g id="edge112" class="edge"><title>t34&#45;&gt;t35</title>
369 | <path fill="none" stroke="black" d="M374.779,-513.996C319.459,-499.439 209.941,-463.689 144,-396 126.948,-378.495 115.359,-353.094 108.374,-333.737"/>
370 | <polygon fill="black" stroke="black" points="111.675,-332.575 105.136,-324.24 105.05,-334.834 111.675,-332.575"/>
371 | </g>
372 | <!-- t31 -->
373 | <g id="node30" class="node"><title>t31</title>
374 | <polygon fill="none" stroke="black" points="832,-180 778,-180 778,-144 832,-144 832,-180"/>
375 | <text text-anchor="middle" x="805" y="-158.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
376 | </g>
377 | <!-- t32 -->
378 | <g id="node31" class="node"><title>t32</title>
379 | <polygon fill="none" stroke="black" points="904,-180 850,-180 850,-144 904,-144 904,-180"/>
380 | <text text-anchor="middle" x="877" y="-158.4" font-family="Times Roman,serif" font-size="14.00">int_</text>
381 | </g>
382 | <!-- t36&#45;&gt;t16 -->
383 | <g id="edge122" class="edge"><title>t36&#45;&gt;t16</title>
384 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M413.655,-218.828C392.058,-206.487 364.096,-189.597 355,-180 317.227,-140.146 323.282,-119.066 295,-72 289.619,-63.0449 283.499,-53.4265 277.897,-44.8244"/>
385 | <polygon fill="black" stroke="black" points="280.714,-42.7377 272.301,-36.2984 274.863,-46.5789 280.714,-42.7377"/>
386 | </g>
387 | <!-- t36&#45;&gt;t37 -->
388 | <g id="edge116" class="edge"><title>t36&#45;&gt;t37</title>
389 | <path fill="none" stroke="black" d="M468.194,-219.472C471.122,-218.19 474.093,-217.001 477,-216 550.335,-190.75 576.37,-204.298 654.091,-179.852"/>
390 | <polygon fill="black" stroke="black" points="655.409,-183.104 663.832,-176.678 653.24,-176.449 655.409,-183.104"/>
391 | </g>
392 | <!-- t36&#45;&gt;t5 -->
393 | <g id="edge124" class="edge"><title>t36&#45;&gt;t5</title>
394 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M468.402,-220.117C487.817,-209.878 514.184,-195.149 536,-180 556.473,-165.784 559.27,-159.23 579,-144 592.138,-133.858 606.944,-123.178 619.975,-114.017"/>
395 | <polygon fill="black" stroke="black" points="622.054,-116.834 628.246,-108.237 618.044,-111.096 622.054,-116.834"/>
396 | </g>
397 | <!-- t29&#45;&gt;t30 -->
398 | <g id="edge88" class="edge"><title>t29&#45;&gt;t30</title>
399 | <path fill="none" stroke="black" d="M777.874,-225.118C749.43,-215.613 703.315,-199.665 655.578,-180.071"/>
400 | <polygon fill="black" stroke="black" points="656.91,-176.835 646.332,-176.238 654.229,-183.301 656.91,-176.835"/>
401 | </g>
402 | <!-- t29&#45;&gt;t5 -->
403 | <g id="edge98" class="edge"><title>t29&#45;&gt;t5</title>
404 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M832.219,-228.829C858.059,-222.317 895.477,-208.353 913,-180 921.412,-166.39 923.088,-156.419 913,-144 885.599,-110.27 756.848,-96.8661 692.212,-92.194"/>
405 | <polygon fill="black" stroke="black" points="692.259,-88.689 682.042,-91.4929 691.778,-95.6724 692.259,-88.689"/>
406 | </g>
407 | <!-- t29&#45;&gt;t31 -->
408 | <g id="edge94" class="edge"><title>t29&#45;&gt;t31</title>
409 | <path fill="none" stroke="black" d="M805,-215.831C805,-208.131 805,-198.974 805,-190.417"/>
410 | <polygon fill="black" stroke="black" points="808.5,-190.413 805,-180.413 801.5,-190.413 808.5,-190.413"/>
411 | </g>
412 | <!-- t29&#45;&gt;t32 -->
413 | <g id="edge96" class="edge"><title>t29&#45;&gt;t32</title>
414 | <path fill="none" stroke="black" d="M823.169,-215.831C831.715,-207.285 842.056,-196.944 851.38,-187.62"/>
415 | <polygon fill="black" stroke="black" points="853.991,-189.959 858.587,-180.413 849.041,-185.009 853.991,-189.959"/>
416 | </g>
417 | <!-- t1&#45;&gt;t11 -->
418 | <g id="edge26" class="edge"><title>t1&#45;&gt;t11</title>
419 | <path fill="none" stroke="black" d="M909.894,-726.591C876.513,-713.942 822.657,-693.533 786.799,-679.945"/>
420 | <polygon fill="black" stroke="black" points="787.786,-676.576 777.195,-676.305 785.306,-683.122 787.786,-676.576"/>
421 | </g>
422 | <!-- t1&#45;&gt;t8 -->
423 | <g id="edge20" class="edge"><title>t1&#45;&gt;t8</title>
424 | <path fill="none" stroke="black" d="M947.066,-719.831C950.126,-711.962 953.778,-702.571 957.168,-693.853"/>
425 | <polygon fill="black" stroke="black" points="960.477,-695.002 960.839,-684.413 953.953,-692.465 960.477,-695.002"/>
426 | </g>
427 | <!-- t1&#45;&gt;t2 -->
428 | <g id="edge4" class="edge"><title>t1&#45;&gt;t2</title>
429 | <path fill="none" stroke="black" d="M969.049,-719.959C981.632,-710.702 995.419,-698.348 1004,-684 1024.98,-648.914 1023,-634.882 1023,-594 1023,-594 1023,-594 1023,-306 1023,-264.507 1008.76,-218.243 998.19,-189.624"/>
430 | <polygon fill="black" stroke="black" points="1001.46,-188.377 994.635,-180.274 994.918,-190.865 1001.46,-188.377"/>
431 | </g>
432 | <!-- t1&#45;&gt;t9 -->
433 | <g id="edge22" class="edge"><title>t1&#45;&gt;t9</title>
434 | <path fill="none" stroke="black" d="M934.989,-719.559C932.218,-709.149 928.783,-695.882 926,-684 908.688,-610.078 891.099,-522.327 882.467,-478.249"/>
435 | <polygon fill="black" stroke="black" points="885.871,-477.414 880.52,-468.269 879,-478.755 885.871,-477.414"/>
436 | </g>
437 | <!-- t1&#45;&gt;t7 -->
438 | <g id="edge18" class="edge"><title>t1&#45;&gt;t7</title>
439 | <path fill="none" stroke="black" d="M936.585,-719.58C934.829,-709.177 932.877,-695.909 932,-684 926.526,-609.695 937.554,-522.108 944.296,-478.156"/>
440 | <polygon fill="black" stroke="black" points="947.765,-478.629 945.865,-468.206 940.85,-477.538 947.765,-478.629"/>
441 | </g>
442 | <!-- t1&#45;&gt;t10 -->
443 | <g id="edge24" class="edge"><title>t1&#45;&gt;t10</title>
444 | <path fill="none" stroke="black" d="M970.285,-722.199C991.251,-711.261 1019.27,-696.643 1041.47,-685.058"/>
445 | <polygon fill="black" stroke="black" points="1043.35,-688.027 1050.6,-680.298 1040.11,-681.821 1043.35,-688.027"/>
446 | </g>
447 | <!-- t25 -->
448 | <g id="node35" class="node"><title>t25</title>
449 | <polygon fill="none" stroke="black" points="612,-252 558,-252 558,-216 612,-216 612,-252"/>
450 | <text text-anchor="middle" x="585" y="-230.4" font-family="Times Roman,serif" font-size="14.00">bool_</text>
451 | </g>
452 | <!-- t22 -->
453 | <g id="node36" class="node"><title>t22</title>
454 | <polygon fill="none" stroke="black" points="396,-252 342,-252 342,-216 396,-216 396,-252"/>
455 | <text text-anchor="middle" x="369" y="-230.4" font-family="Times Roman,serif" font-size="14.00">less</text>
456 | </g>
457 | <!-- t22&#45;&gt;t16 -->
458 | <g id="edge68" class="edge"><title>t22&#45;&gt;t16</title>
459 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M350.266,-215.787C340.847,-205.872 329.807,-192.999 322,-180 295.767,-136.322 277.128,-79.6182 267.503,-46.1839"/>
460 | <polygon fill="black" stroke="black" points="270.771,-44.8734 264.697,-36.1923 264.032,-46.7662 270.771,-44.8734"/>
461 | </g>
462 | <!-- t22&#45;&gt;t5 -->
463 | <g id="edge70" class="edge"><title>t22&#45;&gt;t5</title>
464 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M396.368,-219.921C399.262,-218.552 402.178,-217.219 405,-216 447.595,-197.596 464.455,-205.833 503,-180 521.03,-167.916 518.429,-156.742 536,-144 561.182,-125.739 593.525,-111.548 618.135,-102.307"/>
465 | <polygon fill="black" stroke="black" points="619.633,-105.486 627.828,-98.7708 617.234,-98.9098 619.633,-105.486"/>
466 | </g>
467 | <!-- t23 -->
468 | <g id="node39" class="node"><title>t23</title>
469 | <polygon fill="none" stroke="black" points="422,-180 364,-180 364,-144 422,-144 422,-180"/>
470 | <text text-anchor="middle" x="393" y="-158.4" font-family="Times Roman,serif" font-size="14.00">minus</text>
471 | </g>
472 | <!-- t22&#45;&gt;t23 -->
473 | <g id="edge60" class="edge"><title>t22&#45;&gt;t23</title>
474 | <path fill="none" stroke="black" d="M375.056,-215.831C377.651,-208.046 380.742,-198.773 383.622,-190.135"/>
475 | <polygon fill="black" stroke="black" points="387.02,-191.007 386.862,-180.413 380.38,-188.793 387.02,-191.007"/>
476 | </g>
477 | <!-- t15&#45;&gt;t16 -->
478 | <g id="edge38" class="edge"><title>t15&#45;&gt;t16</title>
479 | <path fill="none" stroke="black" d="M424.757,-80.8812C390.468,-69.0361 333.907,-48.1706 296.723,-33.742"/>
480 | <polygon fill="black" stroke="black" points="297.837,-30.4194 287.249,-30.0391 295.289,-36.9392 297.837,-30.4194"/>
481 | </g>
482 | <!-- t15&#45;&gt;t16 -->
483 | <g id="edge40" class="edge"><title>t15&#45;&gt;t16</title>
484 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M424.633,-77.1278C390.288,-63.6494 333.699,-42.6702 296.555,-29.6627"/>
485 | <polygon fill="black" stroke="black" points="297.687,-26.351 287.092,-26.3776 295.391,-32.9638 297.687,-26.351"/>
486 | </g>
487 | <!-- t15&#45;&gt;t3 -->
488 | <g id="edge36" class="edge"><title>t15&#45;&gt;t3</title>
489 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M483.127,-84.8219C555.162,-72.0156 741.617,-38.8681 821.63,-24.6436"/>
490 | <polygon fill="black" stroke="black" points="822.511,-28.042 831.744,-22.8456 821.285,-21.15 822.511,-28.042"/>
491 | </g>
492 | <!-- t15&#45;&gt;t17 -->
493 | <g id="edge42" class="edge"><title>t15&#45;&gt;t17</title>
494 | <path fill="none" stroke="black" d="M454,-71.8314C454,-64.131 454,-54.9743 454,-46.4166"/>
495 | <polygon fill="black" stroke="black" points="457.5,-46.4132 454,-36.4133 450.5,-46.4133 457.5,-46.4132"/>
496 | </g>
497 | <!-- t21&#45;&gt;t16 -->
498 | <g id="edge78" class="edge"><title>t21&#45;&gt;t16</title>
499 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M306.626,-287.878C288.037,-264.658 257.778,-222.331 246,-180 233.3,-134.354 243.27,-78.9286 251.643,-46.1663"/>
500 | <polygon fill="black" stroke="black" points="255.062,-46.9323 254.275,-36.3667 248.301,-45.1166 255.062,-46.9323"/>
501 | </g>
502 | <!-- t21&#45;&gt;t24 -->
503 | <g id="edge72" class="edge"><title>t21&#45;&gt;t24</title>
504 | <path fill="none" stroke="black" d="M296.513,-287.831C283.834,-278.793 268.34,-267.748 254.694,-258.02"/>
505 | <polygon fill="black" stroke="black" points="256.653,-255.118 246.478,-252.163 252.59,-260.818 256.653,-255.118"/>
506 | </g>
507 | <!-- t21&#45;&gt;t26 -->
508 | <g id="edge76" class="edge"><title>t21&#45;&gt;t26</title>
509 | <path fill="none" stroke="black" d="M352.41,-292.892C356.617,-291.19 360.9,-289.514 365,-288 411.271,-270.915 426.83,-271.602 476.376,-251.964"/>
510 | <polygon fill="black" stroke="black" points="477.725,-255.194 485.682,-248.198 475.099,-248.705 477.725,-255.194"/>
511 | </g>
512 | <!-- t21&#45;&gt;t25 -->
513 | <g id="edge74" class="edge"><title>t21&#45;&gt;t25</title>
514 | <path fill="none" stroke="black" d="M352.257,-292.437C356.488,-290.805 360.818,-289.27 365,-288 441.774,-264.686 468.166,-277.812 548.302,-251.741"/>
515 | <polygon fill="black" stroke="black" points="549.447,-255.048 557.812,-248.547 547.218,-248.412 549.447,-255.048"/>
516 | </g>
517 | <!-- t21&#45;&gt;t22 -->
518 | <g id="edge58" class="edge"><title>t21&#45;&gt;t22</title>
519 | <path fill="none" stroke="black" d="M333.86,-287.831C339.163,-279.708 345.524,-269.964 351.367,-261.012"/>
520 | <polygon fill="black" stroke="black" points="354.445,-262.7 356.98,-252.413 348.583,-258.874 354.445,-262.7"/>
521 | </g>
522 | <!-- t23&#45;&gt;t16 -->
523 | <g id="edge66" class="edge"><title>t23&#45;&gt;t16</title>
524 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M387.85,-143.981C381.531,-124.415 369.225,-93.1377 350,-72 335.175,-55.6995 314.274,-42.7499 296.346,-33.6225"/>
525 | <polygon fill="black" stroke="black" points="297.811,-30.443 287.289,-29.2003 294.74,-36.7332 297.811,-30.443"/>
526 | </g>
527 | <!-- t23&#45;&gt;t5 -->
528 | <g id="edge64" class="edge"><title>t23&#45;&gt;t5</title>
529 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M422.207,-147.435C425.144,-146.191 428.109,-145.021 431,-144 495.214,-121.324 573.082,-104.927 618.046,-96.4856"/>
530 | <polygon fill="black" stroke="black" points="618.736,-99.9176 627.933,-94.6587 617.464,-93.0342 618.736,-99.9176"/>
531 | </g>
532 | <!-- t23&#45;&gt;t15 -->
533 | <g id="edge62" class="edge"><title>t23&#45;&gt;t15</title>
534 | <path fill="none" stroke="black" stroke-dasharray="5,2" d="M408.393,-143.831C415.49,-135.454 424.048,-125.353 431.824,-116.175"/>
535 | <polygon fill="black" stroke="black" points="434.606,-118.306 438.4,-108.413 429.265,-113.781 434.606,-118.306"/>
536 | </g>
537 | </g>
538 | </svg>
539 | 


--------------------------------------------------------------------------------