| 1 |
require "expression_tree" |
| 2 |
|
| 3 |
module Groonga |
| 4 |
class ExpressionTreeBuilder |
| 5 |
RELATION_OPERATORS = [ |
| 6 |
Operator::MATCH, |
| 7 |
Operator::NEAR, |
| 8 |
Operator::NEAR2, |
| 9 |
Operator::SIMILAR, |
| 10 |
Operator::PREFIX, |
| 11 |
Operator::SUFFIX, |
| 12 |
Operator::EQUAL, |
| 13 |
Operator::NOT_EQUAL, |
| 14 |
Operator::LESS, |
| 15 |
Operator::GREATER, |
| 16 |
Operator::LESS_EQUAL, |
| 17 |
Operator::GREATER_EQUAL, |
| 18 |
Operator::GEO_WITHINP5, |
| 19 |
Operator::GEO_WITHINP6, |
| 20 |
Operator::GEO_WITHINP8, |
| 21 |
Operator::TERM_EXTRACT, |
| 22 |
Operator::REGEXP, |
| 23 |
Operator::FUZZY, |
| 24 |
] |
| 25 |
|
| 26 |
ARITHMETIC_OPERATORS = [ |
| 27 |
Operator::BITWISE_OR, |
| 28 |
Operator::BITWISE_XOR, |
| 29 |
Operator::BITWISE_AND, |
| 30 |
Operator::BITWISE_NOT, |
| 31 |
Operator::SHIFTL, |
| 32 |
Operator::SHIFTR, |
| 33 |
Operator::SHIFTRR, |
| 34 |
Operator::PLUS, |
| 35 |
Operator::MINUS, |
| 36 |
Operator::STAR, |
| 37 |
Operator::MOD, |
| 38 |
] |
| 39 |
|
| 40 |
LOGICAL_OPERATORS = [ |
| 41 |
Operator::AND, |
| 42 |
Operator::OR, |
| 43 |
Operator::AND_NOT, |
| 44 |
Operator::ADJUST, |
| 45 |
] |
| 46 |
|
| 47 |
def initialize(expression) |
| 48 |
@expression = expression |
| 49 |
end |
| 50 |
|
| 51 |
def build |
| 52 |
stack = [] |
| 53 |
codes = @expression.codes |
| 54 |
codes.each do |code| |
| 55 |
case code.op |
| 56 |
when *LOGICAL_OPERATORS |
| 57 |
right = stack.pop |
| 58 |
left = stack.pop |
| 59 |
nodes = [] |
| 60 |
add_logical_operation_node(code.op, nodes, left) |
| 61 |
add_logical_operation_node(code.op, nodes, right) |
| 62 |
node = ExpressionTree::LogicalOperation.new(code.op, nodes) |
| 63 |
stack.push(node) |
| 64 |
when *RELATION_OPERATORS, *ARITHMETIC_OPERATORS |
| 65 |
right = stack.pop |
| 66 |
left = stack.pop |
| 67 |
node = ExpressionTree::BinaryOperation.new(code.op, left, right) |
| 68 |
stack.push(node) |
| 69 |
when Operator::GET_VALUE |
| 70 |
node = ExpressionTree::Variable.new(code.value) |
| 71 |
stack.push(node) |
| 72 |
when Operator::PUSH |
| 73 |
case code.value |
| 74 |
when Procedure |
| 75 |
node = ExpressionTree::Procedure.new(code.value) |
| 76 |
when IndexColumn |
| 77 |
node = ExpressionTree::IndexColumn.new(code.value) |
| 78 |
when Accessor |
| 79 |
node = ExpressionTree::Accessor.new(code.value) |
| 80 |
when HashTable |
| 81 |
node = ExpressionTree::Options.new(code.value) |
| 82 |
else |
| 83 |
node = ExpressionTree::Constant.new(code.value.value) |
| 84 |
end |
| 85 |
stack.push(node) |
| 86 |
when Operator::CALL |
| 87 |
arguments = [] |
| 88 |
(code.n_args - 1).times do |
| 89 |
arguments.unshift(stack.pop) |
| 90 |
end |
| 91 |
procedure = stack.pop |
| 92 |
node = ExpressionTree::FunctionCall.new(procedure, arguments) |
| 93 |
stack.push(node) |
| 94 |
else |
| 95 |
raise "unknown operator: #{code.inspect}" |
| 96 |
end |
| 97 |
end |
| 98 |
stack.pop |
| 99 |
end |
| 100 |
|
| 101 |
private |
| 102 |
def add_logical_operation_node(operator, nodes, node) |
| 103 |
if node.is_a?(ExpressionTree::LogicalOperation) and |
| 104 |
node.operator == operator |
| 105 |
nodes.concat(node.nodes) |
| 106 |
else |
| 107 |
nodes << node |
| 108 |
end |
| 109 |
end |
| 110 |
end |
| 111 |
end |