> I'd proceed recursively (untested/pseudo code): > > def value (iter): > if tree.iter_has_child(): > val = 0 > for index in range( tree.iter_n_children( iter ) ): > val += value( tree.iter_nth_child( iter, i ) ) > return val > else: > return tree.get( iter, 3 ) >
Yes, this was what was needed to get my brain in gear. Thanks for the help. Andrew
_______________________________________________ pygtk mailing list pygtk@daa.com.au http://www.daa.com.au/mailman/listinfo/pygtk Read the PyGTK FAQ: http://faq.pygtk.org/
