Lines Matching defs:step
117 Step* step = m_steps[i];
121 bool needToCheckForDuplicateNodes = !nodes.subtreesAreDisjoint() || (step->axis() != Step::ChildAxis && step->axis() != Step::SelfAxis
122 && step->axis() != Step::DescendantAxis && step->axis() != Step::DescendantOrSelfAxis && step->axis() != Step::AttributeAxis);
128 if (nodes.subtreesAreDisjoint() && (step->axis() == Step::ChildAxis || step->axis() == Step::SelfAxis))
133 step->evaluate(nodes[j], matches);
151 void LocationPath::appendStep(Step* step)
156 optimizeStepPair(m_steps[stepCount - 1], step, dropSecondStep);
158 delete step;
162 step->optimize();
163 m_steps.append(step);
166 void LocationPath::insertFirstStep(Step* step)
170 optimizeStepPair(step, m_steps[0], dropSecondStep);
173 m_steps[0] = step;
177 step->optimize();
178 m_steps.insert(0, step);