1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
|
# This file is part of Tryton. The COPYRIGHT file at the top level of
# this repository contains the full copyright notices and license terms.
import datetime
import operator
import re
from collections import defaultdict
from functools import partial, reduce
def sql_like(value, pattern, ignore_case=True):
flag = re.IGNORECASE if ignore_case else 0
escape = False
chars = []
for char in re.split(r'(\\|.)', pattern)[1::2]:
if escape:
if char in ('%', '_'):
chars.append(char)
else:
chars.extend(['\\', char])
escape = False
elif char == '\\':
escape = True
elif char == '_':
chars.append('.')
elif char == '%':
chars.append('.*')
else:
chars.append(re.escape(char))
regexp = re.compile(''.join(chars), flag)
return bool(regexp.fullmatch(value))
like = partial(sql_like, ignore_case=False)
ilike = partial(sql_like, ignore_case=True)
def in_(a, b):
if isinstance(a, (list, tuple)):
if isinstance(b, (list, tuple)):
return any(operator.contains(b, x) for x in a)
else:
return operator.contains(a, b)
else:
return operator.contains(b, a)
OPERATORS = defaultdict(lambda: lambda a, b: True)
OPERATORS.update({
'=': operator.eq,
'>': operator.gt,
'<': operator.lt,
'<=': operator.le,
'>=': operator.ge,
'!=': operator.ne,
'in': in_,
'not in': lambda a, b: not in_(a, b),
'ilike': ilike,
'not ilike': lambda a, b: not ilike(a, b),
'like': like,
'not like': lambda a, b: not like(a, b),
})
def locale_part(expression, field_name, locale_name='id'):
if expression == field_name:
return locale_name
if '.' in expression:
fieldname, local = expression.split('.', 1)
return local
return expression
def is_leaf(expression):
return (isinstance(expression, (list, tuple))
and len(expression) > 2
and isinstance(expression[1], str))
def constrained_leaf(part, boolop=operator.and_):
field, operand, value = part[:3]
if operand == '=' and boolop == operator.and_:
# We should consider that other domain inversion will set a correct
# value to this field
return True
return False
def eval_leaf(part, context, boolop=operator.and_):
field, operand, value = part[:3]
if '.' in field:
# In the case where the leaf concerns a m2o then having a value in the
# evaluation context is deemed suffisant
return bool(context.get(field.split('.')[0]))
context_field = context.get(field)
if (operand not in {'=', '!='}
and (context_field is None or value is None)
and not (operand in {'in', 'not in'}
and context_field is None
and (isinstance(value, (list, tuple)) and None in value))):
return
if isinstance(context_field, datetime.date) and not value:
if isinstance(context_field, datetime.datetime):
value = datetime.datetime.min
else:
value = datetime.date.min
if isinstance(value, datetime.date) and not context_field:
if isinstance(value, datetime.datetime):
context_field = datetime.datetime.min
else:
context_field = datetime.date.min
if isinstance(context_field, (list, tuple)) and value is None:
value = type(context_field)()
if (isinstance(context_field, str)
and isinstance(value, (list, tuple))):
try:
value = '%s,%s' % tuple(value)
except TypeError:
pass
elif (isinstance(context_field, (list, tuple))
and isinstance(value, str)):
try:
context_field = '%s,%s' % tuple(context_field)
except TypeError:
pass
elif ((isinstance(context_field, list) and isinstance(value, tuple))
or (isinstance(context_field, tuple) and isinstance(value, list))):
context_field = list(context_field)
value = list(value)
if (operand in ('=', '!=')
and isinstance(context_field, (list, tuple))
and isinstance(value, int)):
operand = {
'=': 'in',
'!=': 'not in',
}[operand]
try:
return OPERATORS[operand](context_field, value)
except TypeError:
return False
def inverse_leaf(domain):
if domain in ('AND', 'OR'):
return domain
elif is_leaf(domain):
if 'child_of' in domain[1] and '.' not in domain[0]:
if len(domain) == 3:
return domain
else:
return [domain[3]] + list(domain[1:])
return domain
else:
return list(map(inverse_leaf, domain))
def filter_leaf(domain, field, model):
if domain in ('AND', 'OR'):
return domain
elif is_leaf(domain):
if domain[0].startswith(field) and len(domain) > 3:
if domain[3] != model:
return ('id', '=', None)
return domain
else:
return [filter_leaf(d, field, model) for d in domain]
def prepare_reference_domain(domain, reference):
"convert domain to replace reference fields by their local part"
def value2reference(value):
model, ref_id = None, None
if isinstance(value, str) and ',' in value:
model, ref_id = value.split(',', 1)
if ref_id != '%':
try:
ref_id = int(ref_id)
except ValueError:
model, ref_id = None, value
elif (isinstance(value, (list, tuple))
and len(value) == 2
and isinstance(value[0], str)
and (isinstance(value[1], int) or value[1] == '%')):
model, ref_id = value
else:
ref_id = value
return model, ref_id
if domain in ('AND', 'OR'):
return domain
elif is_leaf(domain):
if domain[0] == reference:
if domain[1] in {'=', '!='}:
model, ref_id = value2reference(domain[2])
if model is not None:
if ref_id == '%':
if domain[1] == '=':
return [reference + '.id', '!=', None, model]
else:
return [reference, 'not like', domain[2]]
return [reference + '.id', domain[1], ref_id, model]
elif domain[1] in {'in', 'not in'}:
model_values = {}
for value in domain[2]:
model, ref_id = value2reference(value)
if model is None:
break
model_values.setdefault(model, []).append(ref_id)
else:
new_domain = ['OR'] if domain[1] == 'in' else ['AND']
for model, ref_ids in model_values.items():
if '%' in ref_ids:
if domain[1] == 'in':
new_domain.append(
[reference + '.id', '!=', None, model])
else:
new_domain.append(
[reference, 'not like', model + ',%'])
else:
new_domain.append(
[reference + '.id', domain[1], ref_ids, model])
return new_domain
return []
return domain
else:
return [prepare_reference_domain(d, reference) for d in domain]
def extract_reference_models(domain, field_name):
"returns the set of the models available for field_name"
if domain in ('AND', 'OR'):
return set()
elif is_leaf(domain):
local_part = domain[0].split('.', 1)[0]
if local_part == field_name and len(domain) > 3:
return {domain[3]}
return set()
else:
return reduce(operator.or_,
(extract_reference_models(d, field_name) for d in domain))
def eval_domain(domain, context, boolop=operator.and_):
"compute domain boolean value according to the context"
if is_leaf(domain):
return eval_leaf(domain, context, boolop=boolop)
elif not domain and boolop is operator.and_:
return True
elif not domain and boolop is operator.or_:
return False
elif domain[0] == 'AND':
return eval_domain(domain[1:], context)
elif domain[0] == 'OR':
return eval_domain(domain[1:], context, operator.or_)
else:
return boolop(bool(eval_domain(domain[0], context)),
bool(eval_domain(domain[1:], context, boolop)))
def localize_domain(domain, field_name=None, strip_target=False):
"returns only locale part of domain. eg: langage.code -> code"
if domain in ('AND', 'OR', True, False):
return domain
elif is_leaf(domain):
if 'child_of' in domain[1]:
if domain[0].count('.'):
_, target_part = domain[0].split('.', 1)
return [target_part] + list(domain[1:])
if len(domain) == 3:
return domain
else:
return [domain[3]] + list(domain[1:-1])
locale_name = 'id'
if isinstance(domain[2], str):
locale_name = 'rec_name'
n = 3 if strip_target else 4
return [locale_part(domain[0], field_name, locale_name)] \
+ list(domain[1:n]) + list(domain[4:])
else:
return [localize_domain(part, field_name, strip_target)
for part in domain]
def _sort_key(domain):
if not domain:
return (0, tuple())
elif is_leaf(domain):
return (1, tuple((type(x).__name__, x) for x in domain))
elif domain in ['AND', 'OR']:
return (0, domain)
else:
content = tuple(_sort_key(e) for e in domain)
nestedness = max(k[0] for k in content)
return (nestedness + 1, content)
def sort(domain):
"Sort a domain"
if not domain:
return domain
elif is_leaf(domain):
return domain
elif domain in ['AND', 'OR']:
return domain
else:
return sorted((sort(e) for e in domain), key=_sort_key)
def bool_operator(domain):
"Returns the boolean operator used by a domain"
bool_op = 'AND'
if domain and domain[0] in ['AND', 'OR']:
bool_op = domain[0]
return bool_op
def simplify_nested(domain):
"""Simplify extra domain markers"""
if not domain:
return []
elif is_leaf(domain):
return [domain]
elif domain in ['OR', 'AND']:
return [domain]
elif isinstance(domain, list) and len(domain) == 1:
return simplify_nested(domain[0])
else:
simplified = []
domain_op = bool_operator(domain)
for branch in domain:
simplified_branch = simplify_nested(branch)
if (bool_operator(simplified_branch) == domain_op
or len(simplified_branch) == 1):
if (simplified
and simplified_branch
and simplified_branch[0] in ['AND', 'OR']):
simplified.extend(simplified_branch[1:])
else:
simplified.extend(simplified_branch)
else:
simplified.append(simplified_branch)
return simplified
def simplify_duplicate(domain):
"""Remove duplicates subdomain from domain"""
dedup_branches = []
bool_op = None
if domain[0] in ['AND', 'OR']:
bool_op, *domain = domain
for branch in domain:
simplified_branch = simplify(branch)
if not simplified_branch:
if bool_op == 'OR':
return []
else:
continue
elif simplified_branch not in dedup_branches:
dedup_branches.append(simplified_branch)
if bool_op and len(dedup_branches) > 1:
dedup_branches.insert(0, bool_op)
return dedup_branches
def simplify_AND(domain):
"""Remove useless ANDs"""
if is_leaf(domain):
return domain
elif domain == 'OR':
return domain
else:
return [simplify_AND(e) for e in domain if e != 'AND']
def simplify(domain):
"""Remove duplicate expressions and useless OR/AND"""
if is_leaf(domain):
return [domain]
elif not domain:
return domain
else:
return simplify_nested(simplify_duplicate(domain))
def canonicalize(domain):
"""Returns the canonical version of a domain.
The canonical version of a domain is one where the domain is both
simplified and sorted
"""
return simplify_AND(sort(simplify(domain)))
def merge(domain, domoperator=None):
if not domain or domain in ('AND', 'OR'):
return []
domain_type = 'OR' if domain[0] == 'OR' else 'AND'
if is_leaf(domain):
return [domain]
elif domoperator is None:
return [domain_type] + reduce(operator.add,
[merge(e, domain_type) for e in domain])
elif domain_type == domoperator:
return reduce(operator.add, [merge(e, domain_type) for e in domain])
else:
# without setting the domoperator
return [merge(domain)]
def concat(*domains, **kwargs):
domoperator = kwargs.get('domoperator')
result = []
if domoperator:
result.append(domoperator)
for domain in domains:
if domain:
result.append(domain)
return simplify(merge(result))
def unique_value(domain, single_value=True):
"Return if unique, the field and the value"
if (isinstance(domain, list)
and len(domain) == 1):
name, operator, value, *model = domain[0]
count = name.count('.')
if (
(operator == '='
or (single_value
and operator == 'in' and len(value) == 1))
and (not count
or (count == 1 and model and name.endswith('.id')))):
if operator == 'in' and single_value:
value = value[0]
if model and name.endswith('.id'):
model = model[0]
value = [model, value]
return True, name, value
return False, None, None
def parse(domain):
if is_leaf(domain):
return domain
elif not domain:
return And([])
elif domain[0] == 'OR':
return Or(domain[1:])
else:
return And(domain[1:] if domain[0] == 'AND' else domain)
def domain_inversion(domain, symbol, context=None):
"""compute an inversion of the domain eventually the context is used to
simplify the expression"""
if context is None:
context = {}
expression = parse(domain)
if symbol not in expression.variables:
return True
return expression.inverse(symbol, context)
class And(object):
def __init__(self, expressions):
self.branches = list(map(parse, expressions))
self.variables = set()
for expression in self.branches:
if is_leaf(expression):
self.variables.add(self.base(expression[0]))
elif isinstance(expression, And):
self.variables |= expression.variables
def base(self, expression):
if '.' not in expression:
return expression
else:
return expression.split('.')[0]
def inverse(self, symbol, context):
result = []
for part in self.branches:
if isinstance(part, And):
part_inversion = part.inverse(symbol, context)
evaluated = isinstance(part_inversion, bool)
if symbol not in part.variables:
continue
if not evaluated:
result.append(part_inversion)
elif part_inversion:
continue
else:
return False
elif is_leaf(part) and self.base(part[0]) == symbol:
result.append(part)
else:
field = part[0]
if (field not in context
or field in context
and (eval_leaf(part, context, operator.and_)
or constrained_leaf(part, operator.and_))):
result.append(True)
else:
return False
result = [e for e in result if e is not True]
if result == []:
return True
else:
return simplify(result)
class Or(And):
def inverse(self, symbol, context):
result = []
known_variables = set(context.keys())
if not known_variables >= (self.variables - {symbol}):
# In this case we don't know enough about this OR part, we
# consider it to be True (because people will have the constraint
# on this part later).
return True
for part in self.branches:
if isinstance(part, And):
part_inversion = part.inverse(symbol, context)
evaluated = isinstance(part_inversion, bool)
if symbol not in part.variables:
if evaluated and part_inversion:
return True
continue
if not evaluated:
result.append(part_inversion)
elif part_inversion:
return True
else:
continue
elif is_leaf(part) and self.base(part[0]) == symbol:
result.append(part)
else:
field = part[0]
field = self.base(field)
if (field in context
and (eval_leaf(part, context, operator.or_)
or constrained_leaf(part, operator.or_))):
return True
elif (field in context
and not eval_leaf(part, context, operator.or_)):
result.append(False)
result = [e for e in result if e is not False]
if result == []:
return False
else:
return simplify(['OR'] + result)
|