summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
aefddfb)
Signed-off-by: Jean Privat <jean@pryen.org>
redef class ABraExpr
redef fun name do return once "[]".to_symbol
redef fun compute_raw_arguments do return n_args.to_a
redef class ABraExpr
redef fun name do return once "[]".to_symbol
redef fun compute_raw_arguments do return n_args.to_a
+ redef fun closure_defs
+ do
+ if n_closure_defs.is_empty then
+ return null
+ else
+ return n_closure_defs.to_a
+ end
+ end
end
redef class ABraAssignExpr
end
redef class ABraAssignExpr
!def: V do abort
do
if _k == k then return _v
var n = _next
!def: V do abort
do
if _k == k then return _v
var n = _next
- if n != null then return n.get(k) !def do continue def
+ if n != null then return n[k] !def do continue def
var v = def
_next = new Map[K, V](k, v)
return v
var v = def
_next = new Map[K, V](k, v)
return v
if not m.has_key('I') then (-1).output
'I'.output
'='.output
if not m.has_key('I') then (-1).output
'I'.output
'='.output
if m.has_key('V') then (-2).output
'V'.output
'='.output
if m.has_key('V') then (-2).output
'V'.output
'='.output
- i = m.get('V') !def = '5'
if not m.has_key('V') then (-3).output
'V'.output
'='.output
if not m.has_key('V') then (-3).output
'V'.output
'='.output
- i = m.get('V') !def = '6'
if m.has_key('X') then (-4).output
'X'.output
'='.output
if m.has_key('X') then (-4).output
'X'.output
'='.output
- i = m.get('X') !def do break '0'
+ i = m['X'] !def do break '0'