|
|
Boost : |
From: Herve Bronnimann (hervebronnimann_at_[hidden])
Date: 2007-04-16 11:13:19
Fernando: here you are misunderstanding: we're not referring to intrusive smart pointers, but intrusive data structure (recently submitted by Ion Gaztanaga). Essentially, intrusive DS is a way to provide algorithms on a legacy data structure (by decoupling access to the fundamental pointers inside the nodes), which is what we want here.
-- Herve Bronnimann hervebronnimann_at_[hidden] On Monday, April 16, 2007, at 08:15AM, "Fernando Cacciola" <fernando_cacciola_at_[hidden]> wrote: >Dear Huseyin, > >> Dear Fernando, >> >> The implementation will be based on half-edge scheme. >> >I figured. > >> However by using Boost.Intrusive adapters, > >Oh. Do you meant that the use of intrusive smart pointers will be hardcoded? >Could you handle that generically? allowing users to use whatever >smart-pointer or handle/body techinque they choose? > >> it would be possible for our algorithms to use the BGL >> representations as well. >> >I'm curious about why you relate intrusive pointers with the BGL. >Can you elaborate? > >> When talking about the 2D we mainly talk about the combinatorial >> information, so I'll say its the topology (if this is what you mean by >> topology). >> >Right. > >Best > >------ >Fernando Cacciola >SciSoft > >http://certuscode.wordpress.com >http://fcacciola.50webs.com >http://fcacciola.wordpress.com > > > > >_______________________________________________ >Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > >
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk