23 ArrayXf tmp(state.
z.
top().first.size());
26 for(x = 0; x < state.
z.
top().first.size(); x++)
29 ArrayXf::Index maxIdx;
30 float maxtime = state.
z.
top().second[x].maxCoeff(&maxIdx);
32 tmp(x) = state.
z.
top().first[x](maxIdx);
37 state.
push<
float>(tmp);
43 ArrayXf tmp(state.
z.
top().first.size());
46 for(x = 0; x < state.
z.
top().first.size(); x++)
49 ArrayXf::Index maxIdx;
50 float maxtime = state.
z.
top().second[x].maxCoeff(&maxIdx);
52 tmp(x) = state.
z.
top().first[x](maxIdx);
64 state.
push<
float>(
"recent(" + 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
NodeRecent * clone_impl() const override
NodeRecent * rnd_clone_impl() const override
void eval_eqn(State &state)
Evaluates the node symbolically.
void evaluate(const Data &data, State &state)
Evaluates the node and updates the state states.
std::map< char, unsigned int > arity
arity of the operator
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)