It sounds like a typical case of YAGNI. But, if the code works with the tree structure, could it be fix by just supplying the sorted list instead of the tree? As a list could be seen as a flat tree, the algorithm should work if the organize_as_tree does nothing. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sqlalchemy" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sqlalchemy?hl=en -~----------~----~----~----~------~----~------~--~---
- [sqlalchemy] Re: Problem:maximum recursion depth exceeded Marin
- [sqlalchemy] Re: Problem:maximum recursion depth exceed... az
- [sqlalchemy] Re: Problem:maximum recursion depth exceed... Michael Bayer
- [sqlalchemy] Re: Problem:maximum recursion depth ex... Marin
- [sqlalchemy] Re: Problem:maximum recursion dept... Michael Bayer
- [sqlalchemy] Re: Problem:maximum recursion dept... Marin
- [sqlalchemy] Re: Problem:maximum recursion dept... Michael Bayer
- [sqlalchemy] Re: Problem:maximum recursion dept... Marin
- [sqlalchemy] Re: Problem:maximum recursion dept... Michael Bayer
- [sqlalchemy] Re: Problem:maximum recursion dept... Marin
- [sqlalchemy] Re: Problem:maximum recursion dept... Michael Bayer
- [sqlalchemy] Re: Problem:maximum recursion dept... Marin
- [sqlalchemy] Re: Problem:maximum recursion dept... Marin
- [sqlalchemy] Re: Problem:maximum recursion dept... Michael Bayer
