[Catalyst] Adjacency list "trees" and DBIC (recursion fun)

[Matt S Trout]

On 14 Dec 2006, at 19:26, vb wrote:

> I think you can see also,
> DBIx::OO::Tree
>
Except that as we discussed in private mail, your reasons for writing  
DBIx::OO were primarily to learn more perl and you were unaware of  
the existence of DBIx::Class.

Please rather than re-inventing any more wheels we've already gone to  
a lot of trouble to implement, could you talk to me about how we  
could collaborate and how the DBIC architecture could support your  
further work - the perl world really doesn't need yet another ORM and  
DBIx::Class was implemented in a highly componentised fashion and  
maintains very open development policies specifically to make it  
easier for people to collaborate as a community rather than  
duplicating each other's work.

Your code seems to be pretty good; we'd much rather have you working  
with us than re-inventing things we've already done - everybody would  
get more good code to use that way, which is after all rather the  
point of open source :)

-- 
Matt S Trout, Technical Director, Shadowcat Systems Ltd.
Offering custom development, consultancy and support contracts for  
Catalyst,
DBIx::Class and BAST. Contact mst (at) shadowcatsystems.co.uk for  
details.
+ Help us build a better perl ORM: http://dbix- 
class.shadowcatsystems.co.uk/ +