reginaldojunior / winners

			} elseif ((isset(self::$_operators[$opCharacter]) or $isOperandOrFunction) && $expectingOperator) {	//	Are we putting an operator on the stack?

//				echo 'Element with value '.$opCharacter.' is an Operator<br />';

				while($stack->count() > 0 &&

					($o2 = $stack->last()) &&

					isset(self::$_operators[$o2['value']]) &&

					@($operatorAssociativity[$opCharacter] ? $operatorPrecedence[$opCharacter] < $operatorPrecedence[$o2['value']] : $operatorPrecedence[$opCharacter] <= $operatorPrecedence[$o2['value']])) {

					$output[] = $stack->pop();								//	Swap operands and higher precedence operators from the stack to the output

				}

				$stack->push('Binary Operator',$opCharacter);	//	Finally put our current operator onto the stack

				++$index;

				$expectingOperator = false;

				if (($expectingOperator) && (preg_match('/^'.self::CALCULATION_REGEXP_CELLREF.'.*/Ui', substr($formula, $index), $match)) &&

					($output[count($output)-1]['type'] == 'Cell Reference')) {

//					echo 'Element is an Intersect Operator<br />';

					while($stack->count() > 0 &&

						($o2 = $stack->last()) &&

						isset(self::$_operators[$o2['value']]) &&

						@($operatorAssociativity[$opCharacter] ? $operatorPrecedence[$opCharacter] < $operatorPrecedence[$o2['value']] : $operatorPrecedence[$opCharacter] <= $operatorPrecedence[$o2['value']])) {

						$output[] = $stack->pop();								//	Swap operands and higher precedence operators from the stack to the output

					}

					$stack->push('Binary Operator','|');	//	Put an Intersect Operator on the stack

					$expectingOperator = false;

				}