@@ -47,14 +47,14 @@ def recursive_computation(account):
47
47
recres [account .id ] = recursive_computation (account )
48
48
return recres
49
49
50
- def _debit_credit_bal_qtty (self , cr , uid , ids , name , arg , context = None ):
50
+ def _debit_credit_bal_qtty (self , cr , uid , ids , fields , arg , context = None ):
51
51
res = {}
52
52
if context is None :
53
53
context = {}
54
54
child_ids = tuple (self .search (cr , uid , [('parent_id' , 'child_of' , ids )]))
55
55
for i in child_ids :
56
56
res [i ] = {}
57
- for n in name :
57
+ for n in fields :
58
58
res [i ][n ] = 0.0
59
59
60
60
if not child_ids :
@@ -89,9 +89,11 @@ def _debit_credit_bal_qtty(self, cr, uid, ids, name, arg, context=None):
89
89
WHERE a.id IN %s
90
90
""" + where_date + """
91
91
GROUP BY a.id""" , where_clause_args )
92
- for ac_id , debit , credit , balance , quantity in cr .fetchall ():
93
- res [ac_id ] = {'debit' : debit , 'credit' : credit , 'balance' : balance , 'quantity' : quantity }
94
- return self ._compute_level_tree (cr , uid , ids , child_ids , res , ['debit' , 'credit' , 'balance' , 'quantity' ], context )
92
+ for row in cr .dictfetchall ():
93
+ res [row ['id' ]] = {}
94
+ for field in fields :
95
+ res [row ['id' ]][field ] = row [field ]
96
+ return self ._compute_level_tree (cr , uid , ids , child_ids , res , fields , context )
95
97
96
98
def name_get (self , cr , uid , ids , context = None ):
97
99
if not ids :
0 commit comments