1468 return vref, node |
1468 return vref, node |
1469 |
1469 |
1470 def visit_constant(self, node, newroot, terms): |
1470 def visit_constant(self, node, newroot, terms): |
1471 return copy_node(newroot, node), node |
1471 return copy_node(newroot, node), node |
1472 |
1472 |
|
1473 def visit_comparison(self, node, newroot, terms): |
|
1474 subparts, node = self._visit_children(node, newroot, terms) |
|
1475 copy = copy_node(newroot, node, subparts) |
|
1476 # ignore comparison operator when fetching non final query |
|
1477 if not self.final and isinstance(node.children[0], VariableRef): |
|
1478 copy.operator = '=' |
|
1479 return copy, node |
|
1480 |
1473 def visit_default(self, node, newroot, terms): |
1481 def visit_default(self, node, newroot, terms): |
1474 subparts, node = self._visit_children(node, newroot, terms) |
1482 subparts, node = self._visit_children(node, newroot, terms) |
1475 return copy_node(newroot, node, subparts), node |
1483 return copy_node(newroot, node, subparts), node |
1476 |
1484 |
1477 visit_comparison = visit_mathexpression = visit_constant = visit_function = visit_default |
1485 visit_mathexpression = visit_constant = visit_function = visit_default |
1478 visit_sort = visit_sortterm = visit_default |
1486 visit_sort = visit_sortterm = visit_default |
1479 |
1487 |
1480 def _visit_children(self, node, newroot, terms): |
1488 def _visit_children(self, node, newroot, terms): |
1481 subparts = [] |
1489 subparts = [] |
1482 for i in xrange(len(node.children)): |
1490 for i in xrange(len(node.children)): |