@@ 138-151 (lines=14) @@ | ||
135 | case 'int': |
|
136 | $result=$node["value"]; |
|
137 | break; |
|
138 | case 'and': |
|
139 | $cr = $this->custom_ref; |
|
140 | $left=$this->compile_tree($node["left"]); |
|
141 | if ($this->custom_ref > $cr) { |
|
142 | $this->custom_id++; |
|
143 | } |
|
144 | ||
145 | $right=$this->compile_tree($node["right"]); |
|
146 | $cr = $this->custom_ref; |
|
147 | if ($this->custom_ref > $cr) { |
|
148 | $this->custom_id++; |
|
149 | } |
|
150 | $result=" $left and $right "; |
|
151 | break; |
|
152 | case 'or': |
|
153 | $left=$this->compile_tree($node["left"]); |
|
154 | $right=$this->compile_tree($node["right"]); |
@@ 143-156 (lines=14) @@ | ||
140 | case 'int': |
|
141 | $result=" ".$node["value"]." "; |
|
142 | break; |
|
143 | case 'and': |
|
144 | $cr = $this->custom_ref; |
|
145 | $left=$this->compile_tree($node["left"]); |
|
146 | if ($this->custom_ref > $cr) { |
|
147 | $this->custom_id++; |
|
148 | } |
|
149 | ||
150 | $right=$this->compile_tree($node["right"]); |
|
151 | $cr = $this->custom_ref; |
|
152 | if ($this->custom_ref > $cr) { |
|
153 | $this->custom_id++; |
|
154 | } |
|
155 | $result=" $left and $right "; |
|
156 | break; |
|
157 | case 'or': |
|
158 | $left=$this->compile_tree($node["left"]); |
|
159 | $right=$this->compile_tree($node["right"]); |