Lines Matching defs:ndx
413 for (int ndx = 0; ndx < T::SIZE; ++ndx)
414 ret[ndx] = makeIVal(value[ndx]);
423 for (int ndx = 0; ndx < T::SIZE; ++ndx)
424 ret[ndx] = unionIVal<Element>(a[ndx], b[ndx]);
431 for (int ndx = 0; ndx < T::SIZE; ++ndx)
432 if (!contains(ival[ndx], value[ndx]))
440 for (int ndx = 0; ndx < T::SIZE; ++ndx)
441 if (!containsWarning(ival[ndx], value[ndx]))
451 for (int ndx = 0; ndx < T::SIZE; ++ndx)
453 if (ndx > 0)
456 printIVal<Element>(fmt, ival[ndx], os);
466 for (int ndx = 0; ndx < T::SIZE; ++ndx)
468 if (ndx > 0)
471 printValue<Element>(fmt, value[ndx], os);
481 for (int ndx = 0; ndx < T::SIZE; ++ndx)
482 ret[ndx] = convert<Element>(fmt, value[ndx]);
491 for (int ndx = 0; ndx < T::SIZE; ++ndx)
492 ret[ndx] = round(fmt, value[ndx]);
814 for (size_t ndx = 0; ndx < m_statements.size(); ++ndx)
815 os << *m_statements[ndx];
822 for (size_t ndx = 0; ndx < m_statements.size(); ++ndx)
823 m_statements[ndx]->execute(ctx);
828 for (size_t ndx = 0; ndx < m_statements.size(); ++ndx)
829 m_statements[ndx]->getUsedFuncs(dst);
1494 for (size_t ndx = 0; ndx < m_body.size(); ++ndx)
1495 os << *m_body[ndx];
1517 for (size_t ndx = 0; ndx < m_body.size(); ++ndx)
1518 m_body[ndx]->execute(funCtx);
1537 for (size_t ndx = 0; ndx < m_body.size(); ++ndx)
1538 m_body[ndx]->getUsedFuncs(dst);
2568 ExprP<typename T::Element> getComponent (const ExprP<T>& container, int ndx)
2570 DE_ASSERT(0 <= ndx && ndx < T::SIZE);
2571 return app<GetComponent<T> >(container, constant(ndx));
2975 for (int ndx = 0; ndx < Size; ++ndx)
2976 op[ndx] = args.a[ndx] * args.b[ndx];
2980 for (int ndx = 0; ndx < Size; ++ndx)
2981 idx[ndx] = ndx;
2985 for (int ndx = 1; ndx < Size; ++ndx)
2986 res = res + op[ndx];
2993 for (int ndx = 0; ndx < Size; ++ndx)
2994 alt = alt + op[idx[ndx]];
3634 for (int ndx = 0; ndx < Middle; ++ndx)
3636 call<Mul>(ctx, left[ndx][row], right[col][ndx]));
3787 for (int ndx = 0; ndx < 4; ++ndx)
3793 minorColumns[col] = mat[col < ndx ? col : col + 1];
3800 minors[ndx] = bindExpression("minor", ctx,
4014 for (int ndx = 0; ndx < Size; ++ndx)
4016 ret[ndx] =
4017 m_func.apply(ctx, iargs.a[ndx], iargs.b[ndx], iargs.c[ndx], iargs.d[ndx]);
4069 for (int ndx = 0; ndx < Size; ++ndx)
4070 ret[ndx] = func.apply(ctx, iargs.a[ndx], iargs.b, iargs.c[ndx], iargs.d[ndx]);
4378 for (int ndx = 0; ndx < Size; ++ndx)
4379 ret[ndx] = instance<DefaultSampling<T> >().genRandom(fmt, prec, rnd);
4431 for (int ndx = 0; ndx < Columns; ++ndx)
4433 mat[Columns-1-ndx][ndx] = x;
4926 for (int ndx = 0; ndx < Size; ++ndx)
4928 if (inputLess(vec1[ndx], vec2[ndx]))
4930 if (inputLess(vec2[ndx], vec1[ndx]))
5030 for (size_t ndx = 0; ndx < numSamples; ++ndx)
5386 for (size_t ndx = 0; ndx < m_factories.size(); ++ndx)
5387 ret.push_back(m_factories[ndx].get());
5568 for (size_t ndx = 0; ndx < cases.getFactories().size(); ++ndx)
5569 dstGroup.addChild(createFuncGroup(ctx, *cases.getFactories()[ndx]));