24 ArrayXf tmp(state.
z.
top().first.size());
28 for(x = 0; x < state.
z.
top().first.size(); x++)
29 tmp(x) =
limited(state.
z.
top().first[x]).minCoeff();
33 state.
push<
float>(tmp);
40 ArrayXf tmp(state.
z.
top().first.size());
44 for(x = 0; x < state.
z.
top().first.size(); x++)
45 tmp(x) =
limited(state.
z.
top().first[x]).minCoeff();
58 state.
push<
float>(
"min(" + state.
zs.
pop() +
")");
data holding X, y, and Z data
type pop()
returns true or false depending on stack is empty or not
type & top()
returns element at particular location in stack
void eval_eqn(State &state)
Evaluates the node symbolically.
NodeMin * clone_impl() const override
void evaluate(const Data &data, State &state)
Evaluates the node and updates the state states.
NodeMin * rnd_clone_impl() const override
std::map< char, unsigned int > arity
arity of the operator
ArrayXf limited(ArrayXf x)
limits node output to be between MIN_FLT and MAX_FLT
int complexity
complexity of node
void GPU_Variable(float *dev_x, float *host_x, size_t idx, size_t N)
contains various types of State actually used by feat
Stack< string > zs
longitudinal node string stack
Stack< std::pair< vector< ArrayXf >, vector< ArrayXf > > > z
longitudinal node stack
void push(Eigen::Array< T, Eigen::Dynamic, 1 > value)