Repository navigation
Expand file tree
/
Copy pathoperationType.h
More file actions
127 lines (108 loc) · 4.07 KB
/
Copy pathoperationType.h
File metadata and controls
127 lines (108 loc) · 4.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
@copyright Steve Keen 2013
@author Russell Standish
This file is part of Minsky.
Minsky is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Minsky is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Minsky. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef OPERATIONTYPE_H
#define OPERATIONTYPE_H
#include <factory.h>
#include <string>
#include <ostream>
namespace minsky
{
struct OperationType
{
enum Type {constant, // deprecated - left to support legacy schemas
time, // zero input port ops
integrate,
differentiate, // with respect to time
data, // an interpolated data item
ravel, // Ravel™
euler, pi, zero, one, inf, percent,// fundamental constants
// multiwire binary ops
add, subtract, multiply, divide, min, max,
// underscores to avoid C++ keywords. Can be filtered at UI
and_, or_,
// single wire binops
log, pow, polygamma,
lt, le, eq,
userFunction,
// functions
copy, sqrt, exp, ln, sin, cos, tan, asin, acos, atan,
sinh, cosh, tanh, abs,
floor, frac, not_, Gamma, fact,
// reductions
sum, product, infimum, supremum, any, all, infIndex, supIndex,
// scans
runningSum, runningAv, runningProduct, difference, differencePlus,
// other tensor ops
innerProduct, outerProduct, index, gather, meld, merge, slice, size, shape,
// statistics
mean, median, stdDev, moment, histogram, covariance, correlation, linearRegression, bulkLinearRegression,
numOps // last operation, for iteration purposes
};
/// return the symbolic name of \a type
static std::string typeName(int type);
enum Group {general, constop, binop, function, reduction, scan, tensor, statistics};
static Group classify(Type t);
};
namespace OperationTypeInfo
{
/// number of inputs this operator type has
template <OperationType::Type type> int numArguments();
}
inline std::ostream& operator<<(std::ostream& o, OperationType::Type t)
{return o<<OperationType::typeName(t);}
/// factory class template, for creating objects of type T<O>. N is the maximum value of O
template<class Base, template <minsky::OperationType::Type> class T,
int N=OperationType::numOps>
class OperationFactory
{
struct CreatorBase
{
virtual ~CreatorBase() {}
virtual Base* create() const=0;
};
std::vector<std::unique_ptr<CreatorBase>> creators;
template <class U>
struct Creator: public CreatorBase
{
Base* create() const {return new U();}
};
public:
template <int I, int J>
struct is_equal {const static bool value=I==J;};
// recursively enumerate the enum at compile time.
template <int I>
typename classdesc::enable_if<classdesc::Not<is_equal<I,N>>,void>::T
registerNext()
{
creators.emplace_back(new Creator<T<OperationType::Type(I)>>);
registerNext<I+1>();
}
template <int I>
typename classdesc::enable_if<is_equal<I,N>,void>::T
registerNext()
{creators.emplace_back(new Creator<T<OperationType::Type(I)>>);}
/// create an object of type T<o> on the heap
Base* create(OperationType::Type o) const {
assert(o<creators.size());
return creators[o]->create();
}
OperationFactory() {registerNext<OperationType::Type(0)>();}
};
}
using minsky::operator<<;
#include "operationType.cd"
#include "operationType.xcd"
#endif