0
|
1 |
#
|
|
2 |
# Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
3 |
# All rights reserved.
|
|
4 |
# This component and the accompanying materials are made available
|
|
5 |
# under the terms of "Eclipse Public License v1.0"
|
|
6 |
# which accompanies this distribution, and is available
|
|
7 |
# at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
8 |
#
|
|
9 |
# Initial Contributors:
|
|
10 |
# Nokia Corporation - initial contribution.
|
|
11 |
#
|
|
12 |
# Contributors:
|
|
13 |
#
|
|
14 |
# Description:
|
|
15 |
#
|
|
16 |
|
|
17 |
import operator as ops
|
|
18 |
import logging
|
|
19 |
import tokenize
|
3
|
20 |
import re
|
|
21 |
from token import ENDMARKER, NAME, ERRORTOKEN, OP
|
0
|
22 |
import StringIO
|
|
23 |
|
3
|
24 |
from cone.public import container, exceptions, utils
|
|
25 |
import types
|
0
|
26 |
|
|
27 |
RELATIONS = {}
|
|
28 |
|
|
29 |
def abstract():
|
|
30 |
import inspect
|
|
31 |
caller = inspect.getouterframes(inspect.currentframe())[1][3]
|
|
32 |
raise NotImplementedError(caller + ' needs to be implemented')
|
|
33 |
|
3
|
34 |
REF_DOLLAR = '$'
|
|
35 |
REF_START_BRACE = '{'
|
|
36 |
REF_END_BRACE = '}'
|
|
37 |
REF_REGEX = re.compile('(?P<ref>\${[\w\.\*]*})', re.UNICODE)
|
|
38 |
|
0
|
39 |
def get_tokens(tokenstr):
|
|
40 |
result = []
|
|
41 |
tokens = []
|
|
42 |
tokenstr = tokenstr.replace('\r', '')
|
|
43 |
name_buffer = [] # Temp buffer for reading name tokens
|
|
44 |
last_epos = None
|
3
|
45 |
|
|
46 |
ref_start = False
|
0
|
47 |
for toknum, tokval, spos, epos, _ in tokenize.generate_tokens(StringIO.StringIO(unicode(tokenstr)).readline):
|
|
48 |
val = tokval.strip('\r\n\t ')
|
|
49 |
|
|
50 |
if toknum == ENDMARKER and name_buffer:
|
|
51 |
tokens.append(''.join(name_buffer))
|
|
52 |
|
|
53 |
# Ignore whitespace (this ignores also the end marker,
|
|
54 |
# since its value is empty)
|
|
55 |
if val == '': continue
|
|
56 |
|
3
|
57 |
# Handle the references here, ${ref} is the format
|
|
58 |
if toknum in (OP, ERRORTOKEN) and\
|
|
59 |
tokval in (REF_DOLLAR, REF_START_BRACE, REF_END_BRACE) or\
|
|
60 |
ref_start:
|
|
61 |
if tokval == REF_DOLLAR:
|
|
62 |
ref_start = True
|
|
63 |
elif tokval == REF_END_BRACE:
|
|
64 |
ref_start = False
|
|
65 |
if name_buffer and spos[1] != last_epos[1]:
|
|
66 |
tokens.append(''.join(name_buffer))
|
|
67 |
name_buffer = []
|
|
68 |
name_buffer.append(tokval)
|
|
69 |
last_epos = epos
|
0
|
70 |
# Put NAME, and ERRORTOKEN tokens through the temp
|
|
71 |
# buffer
|
3
|
72 |
elif toknum in (NAME, ERRORTOKEN):
|
0
|
73 |
# If this and the previous token in the temp buffer are not adjacent,
|
|
74 |
# they belong to separate tokens
|
|
75 |
if name_buffer and spos[1] != last_epos[1]:
|
|
76 |
tokens.append(''.join(name_buffer))
|
|
77 |
name_buffer = []
|
3
|
78 |
|
0
|
79 |
name_buffer.append(val)
|
|
80 |
last_epos = epos
|
|
81 |
# Other tokens can just go directly to the token list
|
|
82 |
else:
|
|
83 |
if name_buffer:
|
|
84 |
tokens.append(''.join(name_buffer))
|
|
85 |
name_buffer = []
|
|
86 |
tokens.append(val)
|
|
87 |
|
|
88 |
while len(tokens) > 0:
|
|
89 |
val = tokens.pop(0)
|
|
90 |
# Join the refs with dot in between them to make them dotted refs
|
|
91 |
if val == '.':
|
|
92 |
newval = ".".join([result.pop(),tokens.pop(0)])
|
|
93 |
result.append( newval )
|
|
94 |
else:
|
|
95 |
result.append( val )
|
|
96 |
|
|
97 |
return result
|
|
98 |
|
|
99 |
class RelationException(Exception):
|
|
100 |
pass
|
|
101 |
|
|
102 |
#### The containers are here ####
|
|
103 |
|
|
104 |
|
|
105 |
class RelationBase(object):
|
|
106 |
"""
|
|
107 |
RelationBase defines a base class for all named relations that can be applied between objects.
|
|
108 |
e.g. Relation depends, that can be applied in Rule
|
|
109 |
"""
|
|
110 |
relation_name = "RelationBase"
|
|
111 |
def __init__(self, data, left, right):
|
|
112 |
self.description = ""
|
3
|
113 |
self.ref = None
|
|
114 |
self.lineno = None
|
0
|
115 |
self.data = data or container.DataContainer()
|
|
116 |
self.left = left
|
|
117 |
self.right = right
|
|
118 |
|
|
119 |
def __str__(self):
|
|
120 |
"""
|
|
121 |
@return: A string presentation of the relation object
|
|
122 |
"""
|
|
123 |
return "%s %s %s" % (self.left,self.relation_name,self.right)
|
3
|
124 |
|
|
125 |
def __repr__(self):
|
|
126 |
return "%s(ref=%r, lineno=%r)" % (self.__class__.__name__, self.ref, self.lineno)
|
0
|
127 |
|
|
128 |
def get_name(self):
|
|
129 |
"""
|
|
130 |
@return: The relation name.
|
|
131 |
"""
|
|
132 |
return self.relation_name
|
|
133 |
|
|
134 |
def get_description(self):
|
|
135 |
"""
|
|
136 |
@return: a possible description of the relation.
|
|
137 |
"""
|
|
138 |
return self.description
|
|
139 |
|
3
|
140 |
def execute(self, context=None):
|
0
|
141 |
"""
|
|
142 |
Execute the relation object.
|
|
143 |
"""
|
|
144 |
pass
|
|
145 |
|
|
146 |
|
|
147 |
class RelationContainer(RelationBase, list):
|
|
148 |
"""
|
|
149 |
This class provides the RelationContainer interface for collecting
|
|
150 |
relation sets into one place which can be executed through the container.
|
|
151 |
"""
|
|
152 |
def __init__(self, data=None):
|
|
153 |
super(RelationContainer, self).__init__(data, 'LContainer', 'RContainer')
|
|
154 |
self.value_list = list()
|
|
155 |
|
|
156 |
def append(self, value):
|
|
157 |
self.value_list.append(value)
|
|
158 |
|
|
159 |
def __iter__(self):
|
|
160 |
return self.value_list.__iter__()
|
|
161 |
|
|
162 |
def __len__(self):
|
|
163 |
return len(self.value_list)
|
|
164 |
|
|
165 |
def __or__(self, other):
|
|
166 |
"""
|
|
167 |
This function adds two RelationContainers to each other and removes
|
|
168 |
duplicates from the result.
|
|
169 |
The modification is inplace and the returned value is called object.
|
|
170 |
"""
|
|
171 |
self.value_list = set(self.value_list) | set(other.value_list)
|
|
172 |
return self
|
|
173 |
|
|
174 |
def __unicode__(self):
|
|
175 |
if self:
|
|
176 |
ret = ''
|
|
177 |
for value in self:
|
|
178 |
ret += unicode(value)
|
|
179 |
else:
|
|
180 |
ret = 'No relations'
|
|
181 |
return ret
|
|
182 |
|
|
183 |
def find_relations(self, refs): abstract()
|
|
184 |
def add_relation(self, relation): abstract()
|
|
185 |
def has_errors(self): abstract()
|
|
186 |
|
|
187 |
class RelationContainerImpl(RelationContainer):
|
|
188 |
""" Base implementation for RelationContainer to use in ConE rules
|
|
189 |
"""
|
3
|
190 |
def execute(self, context=None):
|
0
|
191 |
ret = True
|
|
192 |
i = 0
|
|
193 |
for relation in self:
|
|
194 |
i += 1
|
3
|
195 |
r = relation.execute(context)
|
0
|
196 |
ret = ret and r
|
|
197 |
return ret
|
|
198 |
|
|
199 |
def find_relations(self, refs):
|
|
200 |
relations = []
|
|
201 |
for ref in refs:
|
|
202 |
for relation in self:
|
|
203 |
if relation.has_ref(ref):
|
|
204 |
relations.append(relation)
|
|
205 |
return relations
|
|
206 |
|
|
207 |
def add_relation(self, relation):
|
|
208 |
self.append(relation)
|
|
209 |
|
|
210 |
def has_ref(self, refs):
|
|
211 |
for ref in refs:
|
|
212 |
for relation in self:
|
|
213 |
if relation.has_ref(ref):
|
|
214 |
return True
|
|
215 |
return False
|
|
216 |
|
|
217 |
def has_errors(self):
|
|
218 |
for relation in self:
|
|
219 |
if relation.has_errors():
|
|
220 |
return True
|
|
221 |
return False
|
|
222 |
|
|
223 |
def get_errors(self):
|
|
224 |
errors = []
|
|
225 |
for relation in self:
|
|
226 |
errors += relation.get_errors()
|
|
227 |
return errors
|
|
228 |
|
|
229 |
#### The relations are here ####
|
|
230 |
|
|
231 |
class BaseRelation(RelationBase):
|
|
232 |
""" BaseRelation implements the basic evaluation logic for relations
|
|
233 |
This class abstract and should be extended for concrete implementation of
|
|
234 |
relation type.
|
|
235 |
|
|
236 |
Subclasses need to set their own context in their constructor before this
|
|
237 |
class's constructor is called if custom context is needed. If context not
|
|
238 |
set then DefaultContext is used.
|
|
239 |
"""
|
|
240 |
KEY = 'base_relation'
|
|
241 |
|
|
242 |
def __init__(self, data, left, right):
|
|
243 |
# Context needs to be overridden for special purposes
|
|
244 |
try:
|
|
245 |
self.__getattribute__('context')
|
|
246 |
except AttributeError:
|
|
247 |
self.context = DefaultContext(data)
|
|
248 |
|
|
249 |
left = self.expand_rule_elements(left)
|
|
250 |
right = self.expand_rule_elements(right)
|
|
251 |
super(BaseRelation, self).__init__(data, left, right)
|
|
252 |
self.interpreter = ASTInterpreter(context=self.context)
|
|
253 |
|
3
|
254 |
def execute(self, context=None):
|
0
|
255 |
"""
|
3
|
256 |
@param context: The context for execution can be given as a parameter.
|
0
|
257 |
@return Returns error dictionary
|
|
258 |
|
|
259 |
In the client code proper way to check if the rule applies:
|
|
260 |
info = relation.execute()
|
|
261 |
if not info.has_errors():
|
|
262 |
else: HANDLE ERRORS
|
|
263 |
"""
|
|
264 |
# logger.debug("Interpreter context %s" % self.interpreter.context)
|
|
265 |
self.interpreter.create_ast('%s %s %s' % (self.left, self.KEY, self.right))
|
3
|
266 |
ret = self.interpreter.eval(context, relation=self)
|
0
|
267 |
return ret
|
|
268 |
|
|
269 |
def get_keys(self):
|
|
270 |
""" Returns the references from this relation.
|
|
271 |
"""
|
|
272 |
refs = ASTInterpreter.extract_refs(self.left)
|
|
273 |
refs += ASTInterpreter.extract_refs(self.right)
|
|
274 |
return refs
|
|
275 |
|
|
276 |
def has_ref(self, ref):
|
|
277 |
""" Returns if the 'ref' is included in this relation
|
|
278 |
"""
|
|
279 |
return ref in self.get_keys()
|
|
280 |
|
|
281 |
def has_errors(self):
|
|
282 |
return bool(self.interpreter.errors)
|
|
283 |
|
|
284 |
def get_refs(self):
|
3
|
285 |
"""
|
|
286 |
Get a list of left side references and right side references.
|
|
287 |
@return: left refs
|
|
288 |
"""
|
|
289 |
try:
|
|
290 |
refs = []
|
|
291 |
tempast = ASTInterpreter()
|
|
292 |
tempast.create_ast("%s" % self.left)
|
|
293 |
for exp in tempast.expression_list:
|
|
294 |
refs += exp.get_refs()
|
|
295 |
except Exception, e:
|
|
296 |
utils.log_exception(logging.getLogger('cone.rules'), "Exception in get_refs() of relation %r: %s" % (self, e))
|
|
297 |
return []
|
|
298 |
return refs
|
0
|
299 |
|
3
|
300 |
def get_set_refs(self):
|
|
301 |
"""
|
|
302 |
Get a list of references that could get altered by set expression in this rule.
|
|
303 |
This list is empty if the relation does not have any set expressions.
|
|
304 |
@return: a list of references.
|
|
305 |
"""
|
|
306 |
|
|
307 |
return [exp.left.get_ref() for exp in self.get_set_expressions()]
|
|
308 |
|
|
309 |
def get_expressions(self):
|
|
310 |
if not self.interpreter.expression_list:
|
|
311 |
self.interpreter.create_ast('%s %s %s' % (self.left, self.KEY, self.right))
|
|
312 |
return self.interpreter.expression_list
|
|
313 |
|
|
314 |
def get_set_expressions(self):
|
|
315 |
setelems = []
|
|
316 |
if not self.interpreter.expression_list:
|
|
317 |
self.interpreter.create_ast('%s %s %s' % (self.left, self.KEY, self.right))
|
|
318 |
for elem in self.interpreter.expression_list:
|
|
319 |
if isinstance(elem, SetExpression):
|
|
320 |
setelems.append(elem)
|
|
321 |
return setelems
|
|
322 |
|
0
|
323 |
def _eval_rside_value(self, value): abstract()
|
|
324 |
def _compare_value(self, value): abstract()
|
|
325 |
|
|
326 |
def extract_erroneus_features_with_values(self):
|
|
327 |
"""
|
|
328 |
Extract references who have errors.
|
|
329 |
|
|
330 |
Returns dictionary { 'reference' : 'value' }
|
|
331 |
"""
|
|
332 |
data_dict = {}
|
|
333 |
for ref in ASTInterpreter.extract_refs(self.right):
|
|
334 |
value = self.data.get_feature(ref)
|
|
335 |
if self._compare_value(value):
|
|
336 |
data_dict[ref] = value
|
|
337 |
elif value == None:
|
|
338 |
data_dict[ref] = None
|
|
339 |
return data_dict
|
|
340 |
|
|
341 |
def get_errors(self):
|
|
342 |
return self.interpreter.errors
|
|
343 |
|
|
344 |
def expand_rule_elements(self, rule):
|
3
|
345 |
""" Expands rule elements base on the reference.
|
0
|
346 |
Context is used for fetching the child elements for parent references
|
|
347 |
which uses asterisk identifier for selecting all child features:
|
|
348 |
'parent_feature.*' -> 'child_fea_1 and child_fea_2'.
|
|
349 |
"""
|
|
350 |
tokens = get_tokens(rule) # [token for token in rule.split()]
|
|
351 |
|
|
352 |
expanded_rule = ""
|
|
353 |
for token in tokens:
|
|
354 |
if token.endswith('.*'):
|
|
355 |
index = token.index('.*')
|
|
356 |
parent_ref = token[:index]
|
|
357 |
children = self.context.get_children_for_reference(parent_ref)
|
|
358 |
expanded_element = ' and '.join([child.reference for child in children])
|
|
359 |
if expanded_rule:
|
|
360 |
expanded_rule = '%s and %s' % (expanded_rule, expanded_element.rstrip())
|
|
361 |
else:
|
|
362 |
expanded_rule = expanded_element.rstrip()
|
|
363 |
elif token.lower() in OPERATORS:
|
3
|
364 |
operator_class = OPERATORS[token]
|
|
365 |
if operator_class.PARAM_COUNT == 2:
|
|
366 |
expanded_rule += ' %s ' % token
|
|
367 |
else:
|
|
368 |
expanded_rule += '%s ' % token
|
0
|
369 |
else:
|
|
370 |
if expanded_rule:
|
|
371 |
expanded_rule += '%s'% token
|
|
372 |
else:
|
|
373 |
expanded_rule = token
|
|
374 |
return expanded_rule.strip()
|
|
375 |
|
|
376 |
class RequireRelation(BaseRelation):
|
|
377 |
KEY = 'requires'
|
|
378 |
RELATIONS[RequireRelation.KEY] = RequireRelation
|
|
379 |
|
|
380 |
class ExcludesRelation(BaseRelation):
|
|
381 |
KEY = 'excludes'
|
|
382 |
|
|
383 |
RELATIONS['excludes'] = ExcludesRelation
|
|
384 |
|
|
385 |
################################
|
|
386 |
# Abstract syntax tree builder #
|
|
387 |
################################
|
|
388 |
|
|
389 |
def nor(expression, a, b):
|
|
390 |
return not ops.or_(a, b)
|
|
391 |
|
|
392 |
def nand(expression, a, b):
|
|
393 |
return not ops.and_(a, b)
|
|
394 |
|
|
395 |
def truth_and(expression, a, b):
|
|
396 |
return ops.truth(a) and ops.truth(b)
|
|
397 |
|
|
398 |
class DefaultContext(object):
|
|
399 |
""" DefaultContext implements ConE specific context for handling rules
|
|
400 |
"""
|
|
401 |
def __init__(self, data):
|
|
402 |
self.data = data
|
|
403 |
|
|
404 |
def eval(self, ast, expression, value):
|
|
405 |
pass
|
|
406 |
|
3
|
407 |
def set(self, expression, value):
|
|
408 |
"""
|
|
409 |
set a element described with expression to value
|
|
410 |
@param expression: the expression refering to a element
|
|
411 |
@param value: the value to set
|
|
412 |
@raise exception: when the setting value to expression fails.
|
|
413 |
"""
|
|
414 |
pass
|
0
|
415 |
|
|
416 |
def get_children_for_reference(self, reference):
|
|
417 |
# implement ConE specific children expansion
|
|
418 |
pass
|
|
419 |
|
3
|
420 |
def convert_value(self, value):
|
|
421 |
if value in ('True', 'true', '1'):
|
|
422 |
return True
|
|
423 |
elif value in ('False', 'false', '0'):
|
|
424 |
return False
|
|
425 |
elif value in ('None',):
|
|
426 |
return None
|
|
427 |
else:
|
|
428 |
try:
|
|
429 |
return int(value)
|
|
430 |
except:
|
|
431 |
return value
|
|
432 |
|
0
|
433 |
def handle_terminal(self, expression):
|
|
434 |
try:
|
|
435 |
return int(expression)
|
|
436 |
except:
|
|
437 |
return expression
|
|
438 |
|
|
439 |
PRECEDENCES = {
|
|
440 |
'PREFIX_OPERATORS' : 10,
|
|
441 |
'MULDIV_OPERATORS' : 8,
|
|
442 |
'ADDSUB_OPERATORS' : 7,
|
|
443 |
'SHIFT_OPERATORS' : 6,
|
|
444 |
'BITWISE_OPERATORS' : 5,
|
|
445 |
'COMPARISON_OPERATORS' : 4,
|
|
446 |
'SET_OPERATORS' : 3,
|
|
447 |
'BOOLEAN_OPERATORS' : 2,
|
|
448 |
'RELATION_OPERATORS' : 1,
|
|
449 |
'NOT_DEFINED' : 0
|
|
450 |
}
|
|
451 |
|
|
452 |
class Expression(object):
|
|
453 |
PRECEDENCE = PRECEDENCES['NOT_DEFINED']
|
|
454 |
KEY = 'base_expression'
|
|
455 |
|
|
456 |
def __init__(self, ast):
|
|
457 |
self.ast = ast
|
|
458 |
self.value = None
|
|
459 |
|
|
460 |
def get_title(self):
|
|
461 |
return self.KEY
|
|
462 |
|
3
|
463 |
def is_terminal(self):
|
|
464 |
return False
|
|
465 |
|
|
466 |
def eval(self, context, **kwargs): pass
|
|
467 |
|
|
468 |
def get_refs(self): return []
|
0
|
469 |
|
|
470 |
class OneParamExpression(Expression):
|
|
471 |
PARAM_COUNT = 1
|
3
|
472 |
# OP that return itself
|
|
473 |
OP = lambda _, x : x
|
|
474 |
|
0
|
475 |
def __init__(self, ast, expression):
|
|
476 |
super(OneParamExpression, self).__init__(ast)
|
|
477 |
self.expression = expression
|
|
478 |
|
|
479 |
def __unicode__(self):
|
|
480 |
return u'%s %s' % (self.KEY, self.expression)
|
|
481 |
|
3
|
482 |
def __str__(self):
|
|
483 |
return '%s %s' % (self.KEY, self.expression)
|
|
484 |
|
|
485 |
def eval(self, context, **kwargs):
|
|
486 |
self.value = self.OP(self.expression.eval(context))
|
0
|
487 |
context.eval(self.ast, self, self.value)
|
|
488 |
return self.value
|
|
489 |
|
|
490 |
class TwoOperatorExpression(Expression):
|
|
491 |
PARAM_COUNT = 2
|
|
492 |
OP = None
|
|
493 |
EVAL_AS_BOOLS = True
|
|
494 |
|
|
495 |
def __init__(self, ast, left, right):
|
|
496 |
super(TwoOperatorExpression, self).__init__(ast)
|
|
497 |
self.left = left
|
|
498 |
self.right = right
|
|
499 |
|
|
500 |
def __unicode__(self):
|
|
501 |
return u'%s %s %s' % (self.left, self.KEY, self.right)
|
|
502 |
|
3
|
503 |
def __str__(self):
|
|
504 |
return '%s %s %s' % (self.left, self.KEY, self.right)
|
|
505 |
|
|
506 |
def eval(self, context, **kwargs):
|
0
|
507 |
self.value = self.OP(self.left.eval(context), self.right.eval(context))
|
|
508 |
context.eval(self.ast, self, self.value)
|
|
509 |
return self.value
|
|
510 |
|
|
511 |
class TwoOperatorBooleanExpression(TwoOperatorExpression):
|
3
|
512 |
def eval(self, context, **kwargs):
|
|
513 |
self.value = self.OP(bool(self.left.eval(context, **kwargs)), bool(self.right.eval(context, **kwargs)))
|
0
|
514 |
context.eval(self.ast, self, self.value)
|
|
515 |
return self.value
|
|
516 |
|
3
|
517 |
class ReferenceTerminal(Expression):
|
|
518 |
PARAM_COUNT = 0
|
|
519 |
KEY = 'reference'
|
0
|
520 |
|
|
521 |
def __init__(self, ast, expression):
|
3
|
522 |
super(ReferenceTerminal, self).__init__(ast)
|
|
523 |
if not ASTInterpreter.is_ref(unicode(expression)):
|
|
524 |
expression = ASTInterpreter.create_ref(expression)
|
0
|
525 |
self.expression = expression
|
|
526 |
|
3
|
527 |
def is_terminal(self):
|
|
528 |
return True
|
|
529 |
|
|
530 |
def eval(self, context, **kwargs):
|
0
|
531 |
""" Use context to eval the value
|
3
|
532 |
Expression on ReferenceTerminal is feature reference or value
|
0
|
533 |
context should handle the reference conversion to correct value
|
|
534 |
"""
|
3
|
535 |
self.value = context.handle_terminal(ASTInterpreter.clean_ref(self.expression))
|
|
536 |
return self.value
|
|
537 |
|
|
538 |
def get_ref(self):
|
|
539 |
"""
|
|
540 |
@return: The setting reference, e.g. 'MyFeature.MySetting'
|
|
541 |
"""
|
|
542 |
return ASTInterpreter.clean_ref(self.expression)
|
|
543 |
|
|
544 |
def get_refs(self):
|
|
545 |
"""
|
|
546 |
"""
|
|
547 |
return [u'%s' % self.get_ref()]
|
|
548 |
|
|
549 |
def __unicode__(self):
|
|
550 |
return self.expression
|
|
551 |
|
|
552 |
def __str__(self):
|
|
553 |
return "(%s => %s)" % (self.expression, self.value)
|
|
554 |
|
|
555 |
def __repr__(self):
|
|
556 |
return self.expression
|
|
557 |
|
|
558 |
class ValueTerminal(Expression):
|
|
559 |
PARAM_COUNT = 0
|
|
560 |
KEY = 'value_terminal'
|
|
561 |
|
|
562 |
def __init__(self, ast, expression):
|
|
563 |
super(ValueTerminal, self).__init__(ast)
|
|
564 |
self.expression = expression
|
|
565 |
|
|
566 |
def is_terminal(self):
|
|
567 |
return True
|
|
568 |
|
|
569 |
def eval(self, context, **kwargs):
|
|
570 |
self.value = context.convert_value(self.expression)
|
0
|
571 |
return self.value
|
|
572 |
|
|
573 |
def __unicode__(self):
|
|
574 |
return self.expression
|
|
575 |
|
3
|
576 |
def __str__(self):
|
0
|
577 |
return self.expression
|
|
578 |
|
3
|
579 |
class TypeCoercionError(exceptions.ConeException):
|
|
580 |
pass
|
|
581 |
|
|
582 |
class AutoValueTerminal(Expression):
|
|
583 |
PARAM_COUNT = 0
|
|
584 |
KEY = 'autovalue_terminal'
|
|
585 |
|
|
586 |
def __init__(self, ast, expression):
|
|
587 |
super(AutoValueTerminal, self).__init__(ast)
|
|
588 |
self.expression = expression
|
|
589 |
|
|
590 |
def is_terminal(self):
|
|
591 |
return True
|
|
592 |
|
|
593 |
def eval(self, context, **kwargs):
|
|
594 |
type = kwargs.get('type', None)
|
|
595 |
|
|
596 |
if self.expression in ("None", None):
|
|
597 |
self.value = None
|
|
598 |
elif type in (types.IntType, types.FloatType):
|
|
599 |
try:
|
|
600 |
self.value = type(self.expression)
|
|
601 |
except ValueError:
|
|
602 |
raise TypeCoercionError("Cannot coerce %r to %s" % (self.expression, type))
|
|
603 |
elif type == types.BooleanType:
|
|
604 |
if self.expression in ('True', 'true', True):
|
|
605 |
self.value = True
|
|
606 |
elif self.expression in ('False', 'false', False):
|
|
607 |
self.value = False
|
|
608 |
else:
|
|
609 |
raise TypeCoercionError("Cannot coerce %r to %s" % (self.expression, type))
|
|
610 |
elif type in types.StringTypes:
|
|
611 |
self.value = unicode(self.expression)
|
|
612 |
elif type == types.ListType:
|
|
613 |
self.value = list(self.expression)
|
|
614 |
else:
|
|
615 |
raise TypeCoercionError("Cannot coerce %r to %s" % (self.expression, type))
|
|
616 |
return self.value
|
|
617 |
|
|
618 |
def __unicode__(self):
|
|
619 |
return self.expression
|
|
620 |
|
|
621 |
def __str__(self):
|
|
622 |
return self.expression
|
|
623 |
|
|
624 |
|
0
|
625 |
class NegExpression(OneParamExpression):
|
|
626 |
PRECEDENCE = PRECEDENCES['PREFIX_OPERATORS']
|
|
627 |
KEY= '-'
|
|
628 |
OP = ops.neg
|
|
629 |
|
|
630 |
class AndExpression(TwoOperatorBooleanExpression):
|
|
631 |
PRECEDENCE = PRECEDENCES['BOOLEAN_OPERATORS']
|
|
632 |
KEY= 'and'
|
|
633 |
OP = truth_and
|
|
634 |
|
|
635 |
class NandExpression(TwoOperatorBooleanExpression):
|
|
636 |
PRECEDENCE = PRECEDENCES['BOOLEAN_OPERATORS']
|
|
637 |
KEY = 'nand'
|
|
638 |
OP = nand
|
|
639 |
|
|
640 |
class OrExpression(TwoOperatorBooleanExpression):
|
|
641 |
PRECEDENCE = PRECEDENCES['BOOLEAN_OPERATORS']
|
|
642 |
KEY = 'or'
|
|
643 |
OP = ops.or_
|
|
644 |
|
|
645 |
class XorExpression(TwoOperatorBooleanExpression):
|
|
646 |
PRECEDENCE = PRECEDENCES['BOOLEAN_OPERATORS']
|
|
647 |
KEY = 'xor'
|
|
648 |
OP = ops.xor
|
|
649 |
|
|
650 |
class NorExpression(TwoOperatorBooleanExpression):
|
|
651 |
PRECEDENCE = PRECEDENCES['BOOLEAN_OPERATORS']
|
|
652 |
KEY = 'nor'
|
|
653 |
OP = nor
|
|
654 |
|
|
655 |
class EqualExpression(TwoOperatorExpression):
|
|
656 |
PRECEDENCE = PRECEDENCES['COMPARISON_OPERATORS']
|
|
657 |
KEY = '=='
|
|
658 |
OP = ops.eq
|
|
659 |
|
3
|
660 |
def eval(self, context, **kwargs):
|
|
661 |
self.value = self.OP(self.left.eval(context), self.right.eval(context))
|
|
662 |
context.eval(self.ast, self, self.value)
|
|
663 |
return self.value
|
|
664 |
|
0
|
665 |
class NotEqualExpression(TwoOperatorExpression):
|
|
666 |
PRECEDENCE = PRECEDENCES['COMPARISON_OPERATORS']
|
|
667 |
KEY = '!='
|
|
668 |
OP = ops.ne
|
|
669 |
|
|
670 |
class LessThanExpression(TwoOperatorExpression):
|
|
671 |
PRECEDENCE = PRECEDENCES['COMPARISON_OPERATORS']
|
|
672 |
KEY = '<'
|
|
673 |
OP = ops.lt
|
|
674 |
|
|
675 |
class GreaterThanExpression(TwoOperatorExpression):
|
|
676 |
PRECEDENCE = PRECEDENCES['COMPARISON_OPERATORS']
|
|
677 |
KEY = '>'
|
|
678 |
OP = ops.gt
|
|
679 |
|
|
680 |
class LessThanEqualExpression(TwoOperatorExpression):
|
|
681 |
PRECEDENCE = PRECEDENCES['COMPARISON_OPERATORS']
|
|
682 |
KEY = '<='
|
|
683 |
OP = ops.le
|
|
684 |
|
|
685 |
class GreaterThanEqualExpression(TwoOperatorExpression):
|
|
686 |
PRECEDENCE = PRECEDENCES['COMPARISON_OPERATORS']
|
|
687 |
KEY = '>='
|
|
688 |
OP = ops.ge
|
|
689 |
|
|
690 |
|
3
|
691 |
def handle_multiply(self, left, right):
|
|
692 |
return left * right
|
|
693 |
|
|
694 |
class MultiplyExpression(TwoOperatorExpression):
|
|
695 |
expression = "multiply_operation"
|
|
696 |
PRECEDENCE = PRECEDENCES['MULDIV_OPERATORS']
|
|
697 |
KEY= '*'
|
|
698 |
OP = handle_multiply
|
|
699 |
|
|
700 |
def handle_divide(self, left, right):
|
|
701 |
return left / right
|
|
702 |
|
|
703 |
class DivideExpression(TwoOperatorExpression):
|
|
704 |
expression = "divide_operation"
|
|
705 |
PRECEDENCE = PRECEDENCES['MULDIV_OPERATORS']
|
|
706 |
KEY= '/'
|
|
707 |
OP = handle_divide
|
|
708 |
|
|
709 |
def handle_plus(self, left, right):
|
|
710 |
return left + right
|
|
711 |
|
|
712 |
class PlusExpression(TwoOperatorExpression):
|
|
713 |
expression = "plus_operation"
|
|
714 |
PRECEDENCE = PRECEDENCES['ADDSUB_OPERATORS']
|
|
715 |
KEY= '+'
|
|
716 |
OP = handle_plus
|
|
717 |
|
|
718 |
def handle_minus(self, left, right):
|
|
719 |
return left - right
|
|
720 |
|
|
721 |
class MinusExpression(TwoOperatorExpression):
|
|
722 |
expression = "minus_operation"
|
|
723 |
PRECEDENCE = PRECEDENCES['ADDSUB_OPERATORS']
|
|
724 |
KEY= '-'
|
|
725 |
OP = handle_minus
|
|
726 |
|
|
727 |
def handle_set(self, left, right):
|
|
728 |
left.set_value(right)
|
|
729 |
|
|
730 |
class SetExpression(TwoOperatorExpression):
|
|
731 |
PRECEDENCE = PRECEDENCES['SET_OPERATORS']
|
|
732 |
KEY= '='
|
|
733 |
OP = handle_set
|
|
734 |
|
|
735 |
def eval(self, context, **kwargs):
|
|
736 |
if not isinstance(self.left, ReferenceTerminal):
|
|
737 |
raise RuntimeError("Can only set the value of a setting, '%s' is not a setting reference. Did you forget to use ${}?" % self.left.expression)
|
|
738 |
|
|
739 |
value = self.right.eval(context, **kwargs)
|
|
740 |
context.set(self.left.get_ref(), value, **kwargs)
|
|
741 |
return True
|
|
742 |
|
|
743 |
|
0
|
744 |
def handle_require(expression, left, right):
|
|
745 |
if left and right:
|
|
746 |
return True
|
|
747 |
elif not left:
|
|
748 |
return True
|
|
749 |
return False
|
|
750 |
|
|
751 |
class RequireExpression(TwoOperatorExpression):
|
|
752 |
PRECEDENCE = PRECEDENCES['RELATION_OPERATORS']
|
|
753 |
KEY = 'requires'
|
|
754 |
OP = handle_require
|
|
755 |
|
3
|
756 |
def eval(self, context, **kwargs):
|
0
|
757 |
super(RequireExpression, self).eval(context)
|
|
758 |
if not self.value:
|
|
759 |
left_keys = []
|
|
760 |
for ref in self.ast.extract_refs(unicode(self.left)):
|
3
|
761 |
left_keys.append(ref)
|
0
|
762 |
|
|
763 |
for key in left_keys:
|
|
764 |
self.ast.add_error(key, { 'error_string' : 'REQUIRES right side value is "False"',
|
|
765 |
'left_key' : key,
|
|
766 |
'rule' : self.ast.expression
|
|
767 |
})
|
|
768 |
return self.value
|
|
769 |
|
|
770 |
def handle_exclude(expression, left, right):
|
|
771 |
if left and not right:
|
|
772 |
return True
|
|
773 |
elif not left:
|
|
774 |
return True
|
|
775 |
return False
|
|
776 |
|
|
777 |
class ExcludeExpression(TwoOperatorExpression):
|
|
778 |
PRECEDENCE = PRECEDENCES['RELATION_OPERATORS']
|
|
779 |
KEY = 'excludes'
|
|
780 |
OP = handle_exclude
|
|
781 |
|
3
|
782 |
def eval(self, context, **kwargs):
|
0
|
783 |
super(ExcludeExpression, self).eval(context)
|
|
784 |
if not self.value:
|
|
785 |
left_keys = []
|
|
786 |
for ref in self.ast.extract_refs(unicode(self.left)):
|
3
|
787 |
left_keys.append(ref)
|
0
|
788 |
|
|
789 |
for key in left_keys:
|
|
790 |
self.ast.add_error(key, { 'error_string' : 'EXCLUDE right side value is "True"',
|
|
791 |
'left_key' : key,
|
|
792 |
'rule' : self.ast.expression
|
|
793 |
})
|
|
794 |
return self.value
|
|
795 |
|
|
796 |
|
|
797 |
class NotExpression(OneParamExpression):
|
|
798 |
PRECEDENCE = PRECEDENCES['PREFIX_OPERATORS']
|
|
799 |
KEY = 'not'
|
|
800 |
OP = ops.not_
|
|
801 |
|
|
802 |
class TruthExpression(OneParamExpression):
|
|
803 |
PRECEDENCE = PRECEDENCES['PREFIX_OPERATORS']
|
|
804 |
KEY = 'truth'
|
|
805 |
OP = ops.truth
|
|
806 |
|
|
807 |
LEFT_PARENTHESIS = '('
|
|
808 |
RIGHT_PARENTHESIS = ')'
|
|
809 |
class SimpleCondition(EqualExpression):
|
|
810 |
"""
|
|
811 |
A simple condition object that can refer to a model object and evaluate if the value matches
|
|
812 |
"""
|
|
813 |
def __init__(self, left, right):
|
3
|
814 |
if isinstance(left, basestring) and ASTInterpreter.is_ref(left):
|
|
815 |
lterm = ReferenceTerminal(None, left)
|
|
816 |
else:
|
|
817 |
lterm = ValueTerminal(None, left)
|
|
818 |
if isinstance(right, basestring) and ASTInterpreter.is_ref(right):
|
|
819 |
rterm = ReferenceTerminal(None, right)
|
|
820 |
else:
|
|
821 |
rterm = AutoValueTerminal(None, right)
|
0
|
822 |
EqualExpression.__init__(self, None, lterm, rterm)
|
|
823 |
|
3
|
824 |
def eval(self, context, **kwargs):
|
|
825 |
left_value = self.left.eval(context)
|
|
826 |
try:
|
|
827 |
right_value = self.right.eval(context, type=type(left_value))
|
|
828 |
except TypeCoercionError:
|
|
829 |
# If type coercion fails, the result is always False
|
|
830 |
self.value = False
|
|
831 |
return self.value
|
|
832 |
|
|
833 |
# Type coercion successful, perform value comparison
|
|
834 |
self.value = self.OP(left_value, right_value)
|
|
835 |
context.eval(self.ast, self, self.value)
|
|
836 |
return self.value
|
|
837 |
|
|
838 |
def get_refs(self):
|
|
839 |
result = []
|
|
840 |
if isinstance(self.left, ReferenceTerminal):
|
|
841 |
result.append(self.left.get_ref())
|
|
842 |
if isinstance(self.right, ReferenceTerminal):
|
|
843 |
result.append(self.right.get_ref())
|
|
844 |
return result
|
|
845 |
|
0
|
846 |
# in format KEY : OPERATOR CLASS
|
|
847 |
OPERATORS = {
|
|
848 |
'and' : AndExpression,
|
|
849 |
'nand' : NandExpression,
|
|
850 |
'or' : OrExpression,
|
|
851 |
'xor' : XorExpression,
|
|
852 |
'nor' : NorExpression,
|
|
853 |
'not' : NotExpression,
|
|
854 |
'truth' : TruthExpression,
|
|
855 |
'==' : EqualExpression,
|
|
856 |
'!=' : NotEqualExpression,
|
|
857 |
'<' : LessThanExpression,
|
|
858 |
'>' : GreaterThanExpression,
|
|
859 |
'<=' : LessThanEqualExpression,
|
|
860 |
'>=' : GreaterThanEqualExpression,
|
|
861 |
'requires' : RequireExpression,
|
|
862 |
'excludes' : ExcludeExpression,
|
3
|
863 |
'-' : MinusExpression,
|
|
864 |
'+' : PlusExpression,
|
|
865 |
'*' : MultiplyExpression,
|
|
866 |
'/' : DivideExpression,
|
|
867 |
'=' : SetExpression
|
0
|
868 |
}
|
|
869 |
|
|
870 |
def add_operator(key, operator_class=None, baseclass=RequireExpression):
|
|
871 |
"""
|
|
872 |
Add new operator key and operator class.
|
|
873 |
If operator class isn't provided the baseclass parameter is used as
|
|
874 |
operator base. The baseclass parameter is RequireExpression by default
|
|
875 |
which has success condition left_rule=True and right_rule=True
|
|
876 |
|
|
877 |
"""
|
|
878 |
OPERATORS[key] = operator_class or create_new_class(key, baseclass)
|
|
879 |
|
|
880 |
def create_new_class(key, baseclass):
|
|
881 |
ns = baseclass.__dict__.copy()
|
|
882 |
ns['KEY'] = key
|
|
883 |
key_pieces = key.split('_')
|
|
884 |
class_prefix = ''.join([key_piece.capitalize() for key_piece in key_pieces])
|
|
885 |
new_class = type(class_prefix + 'Expression', (baseclass,), ns)
|
|
886 |
return new_class
|
|
887 |
|
|
888 |
class ParseException(Exception): pass
|
|
889 |
|
3
|
890 |
def is_str_literal(value):
|
|
891 |
"""
|
|
892 |
return true if the value is a string literal. A string that begins and ends with single or douple quotes.
|
|
893 |
@param value: the value to investigate
|
|
894 |
@return: Boolean
|
|
895 |
"""
|
|
896 |
if isinstance(value, (str, unicode)):
|
|
897 |
if re.match("[\"\'].*[\"\']", value):
|
|
898 |
return True
|
|
899 |
return False
|
|
900 |
|
|
901 |
def get_str_literal(value):
|
|
902 |
"""
|
|
903 |
return the string literal value
|
|
904 |
@param value: the value to convert
|
|
905 |
@return: string or unicode based on the input value
|
|
906 |
"""
|
|
907 |
if isinstance(value, (str, unicode)):
|
|
908 |
m = re.match("[\"\'](.*)[\"\']", value)
|
|
909 |
if m:
|
|
910 |
return m.group(1)
|
|
911 |
return None
|
|
912 |
|
0
|
913 |
class ASTInterpreter(object):
|
|
914 |
def __init__(self, infix_expression=None, context=None):
|
|
915 |
""" Takes infix expression as string """
|
|
916 |
self.context = context or DefaultContext(None)
|
|
917 |
# logger.debug("AST init context: %s" % self.context)
|
|
918 |
self._init_locals(infix_expression)
|
|
919 |
if infix_expression:
|
|
920 |
self.create_ast()
|
|
921 |
|
|
922 |
def _init_locals(self, infix_expression):
|
|
923 |
# The result value of full eval of the parse_tree
|
|
924 |
self.value = None
|
|
925 |
self.warnings = {}
|
|
926 |
self.errors = {}
|
|
927 |
self.postfix_array = []
|
|
928 |
self.parse_tree = []
|
3
|
929 |
self.expression_list = []
|
0
|
930 |
self.expression = infix_expression
|
|
931 |
|
|
932 |
def __unicode__(self):
|
|
933 |
s = ''
|
|
934 |
for expr in self.parse_tree:
|
|
935 |
s += unicode(expr)
|
|
936 |
return s
|
|
937 |
|
|
938 |
def add_error(self, key, error_dict):
|
|
939 |
if self.errors.has_key(key):
|
|
940 |
self.errors[key].append(error_dict)
|
|
941 |
else:
|
|
942 |
self.errors[key] = [error_dict]
|
|
943 |
|
|
944 |
def create_ast(self, infix_expression=None):
|
|
945 |
if infix_expression:
|
|
946 |
self._init_locals(infix_expression)
|
|
947 |
self._infix_to_postfix()
|
|
948 |
self._create_parse_tree()
|
|
949 |
return self.parse_tree
|
|
950 |
|
|
951 |
def _infix_to_postfix(self):
|
|
952 |
"""
|
3
|
953 |
Shunting yard algorithm used to convert infix presentation to postxfix.
|
0
|
954 |
"""
|
|
955 |
if not self.expression:
|
|
956 |
raise ParseException('Expression is None')
|
3
|
957 |
tokens = get_tokens(self.expression)
|
0
|
958 |
stack = []
|
|
959 |
# logger.debug('TOKENS: %s' % tokens)
|
|
960 |
for token in tokens:
|
|
961 |
# logger.debug('TOKEN: %s' % token)
|
|
962 |
if token.lower() in OPERATORS:
|
|
963 |
op_class = OPERATORS.get(token)
|
|
964 |
if stack:
|
|
965 |
while len(stack) != 0:
|
|
966 |
top = stack[-1]
|
|
967 |
if top in OPERATORS:
|
|
968 |
top_operator = OPERATORS.get(top)
|
|
969 |
if op_class.PRECEDENCE <= top_operator.PRECEDENCE:
|
|
970 |
self.postfix_array.append(stack.pop())
|
|
971 |
else:
|
|
972 |
# Break from loop if top operator precedence is less.
|
|
973 |
break
|
|
974 |
else:
|
|
975 |
# If top not operator break from loop
|
|
976 |
break
|
|
977 |
stack.append(token)
|
|
978 |
elif token == LEFT_PARENTHESIS:
|
|
979 |
# logger.debug('Left parenthesis')
|
|
980 |
stack.append(token)
|
|
981 |
elif token == RIGHT_PARENTHESIS:
|
|
982 |
# logger.debug('Right parenthesis')
|
|
983 |
left_par_found = False
|
|
984 |
stack_token = stack.pop()
|
|
985 |
while stack_token:
|
|
986 |
if stack_token != LEFT_PARENTHESIS:
|
|
987 |
self.postfix_array.append(stack_token)
|
|
988 |
else:
|
|
989 |
left_par_found = True
|
|
990 |
break
|
|
991 |
if stack:
|
|
992 |
stack_token = stack.pop()
|
|
993 |
else:
|
|
994 |
stack_token = None
|
|
995 |
|
|
996 |
if not left_par_found:
|
|
997 |
raise ParseException('Mismatched parenthesis "%s".' % LEFT_PARENTHESIS)
|
|
998 |
else:
|
|
999 |
# logger.debug('Adding value to output. %s' % repr((token)))
|
|
1000 |
self.postfix_array.append((token))
|
|
1001 |
|
|
1002 |
# There should be only operators left in the stack
|
|
1003 |
if stack:
|
|
1004 |
# logger.debug('Operators in stack.')
|
|
1005 |
operator = stack.pop()
|
|
1006 |
while operator:
|
|
1007 |
if operator != LEFT_PARENTHESIS:
|
|
1008 |
self.postfix_array.append(operator)
|
|
1009 |
else:
|
|
1010 |
raise ParseException('Mismatched parenthesis "%s".' % LEFT_PARENTHESIS)
|
|
1011 |
if stack:
|
|
1012 |
operator = stack.pop()
|
|
1013 |
else:
|
|
1014 |
operator = None
|
|
1015 |
|
|
1016 |
# logger.debug('Infix to postfix conversion: %s' % self.postfix_array)
|
|
1017 |
return self.postfix_array
|
|
1018 |
|
|
1019 |
def _create_parse_tree(self):
|
|
1020 |
self.parse_tree = []
|
|
1021 |
for token in self.postfix_array:
|
3
|
1022 |
is_ref = ASTInterpreter.is_ref(token)
|
0
|
1023 |
if token in OPERATORS:
|
|
1024 |
# logger.debug('OP: %s' % (token))
|
|
1025 |
expression_class = OPERATORS[token]
|
|
1026 |
params = []
|
|
1027 |
for i in range(expression_class.PARAM_COUNT):
|
|
1028 |
try:
|
|
1029 |
params.append(self.parse_tree.pop())
|
|
1030 |
except IndexError, e:
|
|
1031 |
raise ParseException('Syntax error: "%s"' % self.expression)
|
|
1032 |
params.reverse()
|
|
1033 |
expression = expression_class(self, *params)
|
|
1034 |
|
|
1035 |
# logger.debug('The operation: %s' % expression)
|
|
1036 |
self.parse_tree.append(expression)
|
3
|
1037 |
self.expression_list.append(expression)
|
|
1038 |
elif not is_ref:
|
|
1039 |
expression = ValueTerminal(self, token)
|
|
1040 |
self.parse_tree.append(expression)
|
|
1041 |
self.expression_list.append(expression)
|
0
|
1042 |
else:
|
3
|
1043 |
expression = ReferenceTerminal(self, token)
|
0
|
1044 |
self.parse_tree.append(expression)
|
3
|
1045 |
self.expression_list.append(expression)
|
0
|
1046 |
|
|
1047 |
#logger.debug('THE STACK: %s' % self.parse_tree)
|
|
1048 |
#for s in self.parse_tree:
|
|
1049 |
# logger.debug('Stack e: %s' % str(s))
|
|
1050 |
|
|
1051 |
return self.parse_tree
|
|
1052 |
|
3
|
1053 |
def eval(self, context=None, **kwargs):
|
0
|
1054 |
""" Evals the AST
|
|
1055 |
If empty expression is given, None is returned
|
|
1056 |
"""
|
|
1057 |
for expression in self.parse_tree:
|
3
|
1058 |
self.value = expression.eval(context or self.context, **kwargs)
|
0
|
1059 |
return self.value
|
|
1060 |
|
|
1061 |
@staticmethod
|
|
1062 |
def extract_refs(expression):
|
|
1063 |
tokens = get_tokens(expression)
|
3
|
1064 |
return [ASTInterpreter.clean_ref(t) for t in tokens if t.lower() not in OPERATORS and\
|
|
1065 |
t not in (LEFT_PARENTHESIS, RIGHT_PARENTHESIS) and\
|
|
1066 |
ASTInterpreter.is_ref(t)]
|
|
1067 |
|
|
1068 |
@staticmethod
|
|
1069 |
def extract_non_operators(expression):
|
|
1070 |
tokens = get_tokens(expression)
|
|
1071 |
return [ASTInterpreter.clean_ref(t) for t in tokens if t.lower() not in OPERATORS and\
|
|
1072 |
t not in (LEFT_PARENTHESIS, RIGHT_PARENTHESIS)]
|
|
1073 |
|
|
1074 |
@staticmethod
|
|
1075 |
def clean_ref(ref):
|
|
1076 |
return ref.replace('$', '').replace('{', '').replace('}', '')
|
|
1077 |
|
|
1078 |
@staticmethod
|
|
1079 |
def create_ref(ref):
|
|
1080 |
return '${%s}' % ref
|
|
1081 |
|
|
1082 |
@staticmethod
|
|
1083 |
def is_ref(val):
|
|
1084 |
mo = REF_REGEX.match(val)
|
|
1085 |
if mo and len(mo.groups()) > 0 and mo.group() == val:
|
|
1086 |
return True
|
|
1087 |
return False
|
0
|
1088 |
|
|
1089 |
##################################################################
|
|
1090 |
# Create and configure the main level logger
|
|
1091 |
logger = logging.getLogger('cone')
|