2 # -*- coding: utf-8 -*-
3 ##############################################################################
5 # OpenERP, Open Source Management Solution
6 # Copyright (C) 2004-2009 Tiny SPRL (<http://tiny.be>).
8 # This program is free software: you can redistribute it and/or modify
9 # it under the terms of the GNU Affero General Public License as
10 # published by the Free Software Foundation, either version 3 of the
11 # License, or (at your option) any later version.
13 # This program is distributed in the hope that it will be useful,
14 # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 # GNU Affero General Public License for more details.
18 # You should have received a copy of the GNU Affero General Public License
19 # along with this program. If not, see <http://www.gnu.org/licenses/>.
21 ##############################################################################
23 from tools import flatten, reverse_enumerate
27 class expression(object):
29 parse a domain expression
30 use a real polish notation
31 leafs are still in a ('foo', '=', 'bar') format
32 For more info: http://christophe-simonis-at-tiny.blogspot.com/2008/08/new-new-domain-notation.html
35 def _is_operator(self, element):
36 return isinstance(element, (str, unicode)) and element in ['&', '|', '!']
38 def _is_leaf(self, element, internal=False):
39 OPS = ('=', '!=', '<>', '<=', '<', '>', '>=', '=like', '=ilike', 'like', 'not like', 'ilike', 'not ilike', 'in', 'not in', 'child_of')
40 INTERNAL_OPS = OPS + ('inselect',)
41 return (isinstance(element, tuple) or isinstance(element, list)) \
42 and len(element) == 3 \
43 and (((not internal) and element[1] in OPS) \
44 or (internal and element[1] in INTERNAL_OPS))
46 def __execute_recursive_in(self, cr, s, f, w, ids, op, type):
49 if op in ['<','>','>=','<=']:
50 cr.execute('SELECT "%s"' \
52 ' WHERE "%s" %s %s' % (s, f, w, op, ids[0]))
53 res.extend([r[0] for r in cr.fetchall()])
55 for i in range(0, len(ids), cr.IN_MAX):
56 subids = ids[i:i+cr.IN_MAX]
57 cr.execute('SELECT "%s"' \
59 ' WHERE "%s" in (%s)' % (s, f, w, ','.join(['%s']*len(subids))),
61 res.extend([r[0] for r in cr.fetchall()])
63 cr.execute('SELECT distinct("%s")' \
64 ' FROM "%s" where "%s" is not null' % (s, f, s)),
65 res.extend([r[0] for r in cr.fetchall()])
69 def __init__(self, exp):
70 # check if the expression is valid
71 if not reduce(lambda acc, val: acc and (self._is_operator(val) or self._is_leaf(val)), exp, True):
72 raise ValueError('Bad domain expression: %r' % (exp,))
74 self.__tables = {} # used to store the table to use for the sql generation. key = index of the leaf
76 self.__main_table = None # 'root' table. set by parse()
77 self.__DUMMY_LEAF = (1, '=', 1) # a dummy leaf that must not be parsed or sql generated
80 def parse(self, cr, uid, table, context):
81 """ transform the leafs of the expression """
85 def _rec_get(ids, table, parent=None, left='id', prefix=''):
86 if table._parent_store and (not table.pool._init):
87 # TODO: Improve where joins are implemented for many with '.', replace by:
88 # doms += ['&',(prefix+'.parent_left','<',o.parent_right),(prefix+'.parent_left','>=',o.parent_left)]
90 for o in table.browse(cr, uid, ids, context=context):
93 doms += ['&', ('parent_left', '<', o.parent_right), ('parent_left', '>=', o.parent_left)]
95 return [(left, 'in', table.search(cr, uid, doms, context=context))]
98 def rg(ids, table, parent):
101 ids2 = table.search(cr, uid, [(parent, 'in', ids)], context=context)
102 return ids + rg(ids2, table, parent)
103 return [(left, 'in', rg(ids, table, parent or table._parent_name))]
105 self.__main_table = table
108 while i + 1<len(self.__exp):
111 if self._is_operator(e) or e == self.__DUMMY_LEAF:
113 left, operator, right = e
114 working_table = table
116 fargs = left.split('.', 1)
118 if left in table._inherit_fields:
120 field = main_table._columns.get(fargs[0], False)
122 working_table = main_table
123 self.__tables[i] = working_table
125 working_table = main_table.pool.get(main_table._inherit_fields[left][0])
126 if working_table not in self.__tables.values():
127 self.__joins.append(('%s.%s=%s.%s' % (working_table._table, 'id', main_table._table, main_table._inherits[working_table._name]), working_table._table))
128 self.__tables[index] = working_table
130 main_table = working_table
132 field = working_table._columns.get(fargs[0], False)
134 if left == 'id' and operator == 'child_of':
135 dom = _rec_get(right, working_table)
136 self.__exp = self.__exp[:i] + dom + self.__exp[i+1:]
139 field_obj = table.pool.get(field._obj)
141 if field._type == 'many2one':
142 right = field_obj.search(cr, uid, [(fargs[1], operator, right)], context=context)
143 self.__exp[i] = (fargs[0], 'in', right)
146 if field._properties:
147 # this is a function field
149 if not field._fnct_search:
150 # the function field doesn't provide a search function and doesn't store
151 # values in the database, so we must ignore it : we generate a dummy leaf
152 self.__exp[i] = self.__DUMMY_LEAF
154 subexp = field.search(cr, uid, table, left, [self.__exp[i]])
155 # we assume that the expression is valid
156 # we create a dummy leaf for forcing the parsing of the resulting expression
158 self.__exp.insert(i + 1, self.__DUMMY_LEAF)
159 for j, se in enumerate(subexp):
160 self.__exp.insert(i + 2 + j, se)
162 # else, the value of the field is store in the database, so we search on it
165 elif field._type == 'one2many':
169 if isinstance(right, basestring):
170 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], operator, limit=None)]
173 if not isinstance(right,list):
179 operator = 'in' # operator changed because ids are directly related to main object
183 if operator in ['not like','not ilike','not in','<>','!=']:
185 self.__exp[i] = ('id', o2m_op, self.__execute_recursive_in(cr, field._fields_id, field_obj._table, 'id', ids2, operator, field._type))
189 if operator in ['not like','not ilike','not in','<>','!=']:
191 self.__exp[i] = ('id', o2m_op, self.__execute_recursive_in(cr, field._fields_id, field_obj._table, 'id', [], operator, field._type) or [0])
193 elif field._type == 'many2many':
195 if operator == 'child_of':
196 if isinstance(right, basestring):
197 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], 'like', limit=None)]
201 def _rec_convert(ids):
202 if field_obj == table:
204 return self.__execute_recursive_in(cr, field._id1, field._rel, field._id2, ids, operator, field._type)
206 dom = _rec_get(ids2, field_obj)
207 ids2 = field_obj.search(cr, uid, dom, context=context)
208 self.__exp[i] = ('id', 'in', _rec_convert(ids2))
212 if isinstance(right, basestring):
213 res_ids = [x[0] for x in field_obj.name_search(cr, uid, right, [], operator)]
216 if not isinstance(right, list):
222 operator = 'in' # operator changed because ids are directly related to main object
224 call_null_m2m = False
226 if operator in ['not like','not ilike','not in','<>','!=']:
229 self.__exp[i] = ('id', m2m_op, self.__execute_recursive_in(cr, field._id1, field._rel, field._id2, res_ids, operator, field._type) or [0])
232 if operator in ['not like','not ilike','not in','<>','!=']:
234 self.__exp[i] = ('id', m2m_op, self.__execute_recursive_in(cr, field._id1, field._rel, field._id2, [], operator, field._type) or [0])
236 elif field._type == 'many2one':
237 if operator == 'child_of':
238 if isinstance(right, basestring):
239 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], 'like', limit=None)]
243 self.__operator = 'in'
244 if field._obj != working_table._name:
245 dom = _rec_get(ids2, field_obj, left=left, prefix=field._obj)
247 dom = _rec_get(ids2, working_table, parent=left)
248 self.__exp = self.__exp[:i] + dom + self.__exp[i+1:]
250 if isinstance(right, basestring): # and not isinstance(field, fields.related):
252 c['active_test'] = False
253 res_ids = field_obj.name_search(cr, uid, right, [], operator, limit=None, context=c)
254 right = map(lambda x: x[0], res_ids)
255 self.__exp[i] = (left, 'in', right)
258 # add the time part to datetime field when it's not there:
259 if field._type == 'datetime' and self.__exp[i][2] and len(self.__exp[i][2]) == 10:
261 self.__exp[i] = list(self.__exp[i])
263 if operator in ('>', '>='):
264 self.__exp[i][2] += ' 00:00:00'
265 elif operator in ('<', '<='):
266 self.__exp[i][2] += ' 23:59:59'
268 self.__exp[i] = tuple(self.__exp[i])
271 if operator in ('like', 'ilike', 'not like', 'not ilike'):
272 right = '%%%s%%' % right
274 operator = operator == '=like' and 'like' or operator
276 query1 = '( SELECT res_id' \
277 ' FROM ir_translation' \
282 #Covering in,not in operators with operands (%s,%s) ,etc.
283 if operator in ['in','not in']:
284 instr = ','.join(['%s'] * len(right))
285 query1 += ' AND value ' + operator + ' ' +" (" + instr + ")" \
288 ' FROM "' + working_table._table + '"' \
289 ' WHERE "' + left + '" ' + operator + ' ' +" (" + instr + "))"
291 query1 += ' AND value ' + operator + instr + \
294 ' FROM "' + working_table._table + '"' \
295 ' WHERE "' + left + '" ' + operator + instr + ")"
297 query2 = [working_table._name + ',' + left,
298 context.get('lang', False) or 'en_US',
304 self.__exp[i] = ('id', 'inselect', (query1, query2))
308 def __leaf_to_sql(self, leaf, table):
309 if leaf == self.__DUMMY_LEAF:
311 left, operator, right = leaf
313 if operator == 'inselect':
314 query = '(%s.%s in (%s))' % (table._table, left, right[0])
316 elif operator in ['in', 'not in']:
318 len_before = len(params)
319 for i in range(len_before)[::-1]:
320 if params[i] == False:
323 len_after = len(params)
324 check_nulls = len_after != len_before
329 instr = ','.join(['%s'] * len_after)
331 instr = ','.join([table._columns[left]._symbol_set[0]] * len_after)
332 query = '(%s.%s %s (%s))' % (table._table, left, operator, instr)
335 query = '(%s OR %s.%s IS NULL)' % (query, table._table, left)
339 if right == False and (leaf[0] in table._columns) and table._columns[leaf[0]]._type=="boolean" and (operator == '='):
340 query = '(%s.%s IS NULL or %s.%s = false )' % (table._table, left,table._table, left)
341 elif (((right == False) and (type(right)==bool)) or (right is None)) and (operator == '='):
342 query = '%s.%s IS NULL ' % (table._table, left)
343 elif right == False and (leaf[0] in table._columns) and table._columns[leaf[0]]._type=="boolean" and (operator in ['<>', '!=']):
344 query = '(%s.%s IS NOT NULL and %s.%s != false)' % (table._table, left,table._table, left)
345 elif (((right == False) and (type(right)==bool)) or right is None) and (operator in ['<>', '!=']):
346 query = '%s.%s IS NOT NULL' % (table._table, left)
349 query = '%s.id %s %%s' % (table._table, operator)
352 like = operator in ('like', 'ilike', 'not like', 'not ilike')
354 op = {'=like':'like','=ilike':'ilike'}.get(operator,operator)
355 if left in table._columns:
356 format = like and '%s' or table._columns[left]._symbol_set[0]
357 query = '(%s.%s %s %s)' % (table._table, left, op, format)
359 query = "(%s.%s %s '%s')" % (table._table, left, op, right)
363 if isinstance(right, str):
365 elif isinstance(right, unicode):
366 str_utf8 = right.encode('utf-8')
368 str_utf8 = str(right)
369 params = '%%%s%%' % str_utf8
370 add_null = not str_utf8
371 elif left in table._columns:
372 params = table._columns[left]._symbol_set[1](right)
375 query = '(%s OR %s IS NULL)' % (query, left)
377 if isinstance(params, basestring):
379 return (query, params)
385 for i, e in reverse_enumerate(self.__exp):
386 if self._is_leaf(e, internal=True):
387 table = self.__tables.get(i, self.__main_table)
388 q, p = self.__leaf_to_sql(e, table)
393 stack.append('(NOT (%s))' % (stack.pop(),))
395 ops = {'&': ' AND ', '|': ' OR '}
398 stack.append('(%s %s %s)' % (q1, ops[e], q2,))
400 query = ' AND '.join(reversed(stack))
401 joins = ' AND '.join(map(lambda j: j[0], self.__joins))
403 query = '(%s) AND (%s)' % (joins, query)
404 return (query, flatten(params))
406 def get_tables(self):
407 return ['"%s"' % t._table for t in set(self.__tables.values()+[self.__main_table])]
409 # vim:expandtab:smartindent:tabstop=4:softtabstop=4:shiftwidth=4: