Method eval_node_set

Tools/EditorFramework/pugixml.cpp:9341–9452

	}

	xpath_node_set_raw eval_node_set(const xpath_context& c, const xpath_stack& stack)
	{
		switch (_type)
		{
		case ast_op_union:
		{
			xpath_allocator_capture cr(stack.temp);

			xpath_stack swapped_stack = {stack.temp, stack.result};

			xpath_node_set_raw ls = _left->eval_node_set(c, swapped_stack);
			xpath_node_set_raw rs = _right->eval_node_set(c, stack);

			// we can optimize merging two sorted sets, but this is a very rare operation, so don't bother
			rs.set_type(xpath_node_set::type_unsorted);

			rs.append(ls.begin(), ls.end(), stack.result);
			rs.remove_duplicates();

			return rs;
		}

		case ast_filter:
		case ast_filter_posinv:
		{
			xpath_node_set_raw set = _left->eval_node_set(c, stack);

			// either expression is a number or it contains position() call; sort by document order
			if (_type == ast_filter)
				set.sort_do();

			apply_predicate(set, 0, _right, stack);

			return set;
		}

		case ast_func_id: return xpath_node_set_raw();

		case ast_step:
		{
			switch (_axis)
			{
			case axis_ancestor: return step_do(c, stack, axis_to_type<axis_ancestor>());

			case axis_ancestor_or_self: return step_do(c, stack, axis_to_type<axis_ancestor_or_self>());

			case axis_attribute: return step_do(c, stack, axis_to_type<axis_attribute>());

			case axis_child: return step_do(c, stack, axis_to_type<axis_child>());

			case axis_descendant: return step_do(c, stack, axis_to_type<axis_descendant>());

			case axis_descendant_or_self: return step_do(c, stack, axis_to_type<axis_descendant_or_self>());

			case axis_following: return step_do(c, stack, axis_to_type<axis_following>());

			case axis_following_sibling: return step_do(c, stack, axis_to_type<axis_following_sibling>());