Hello, I don't know what has become to the rest of my post: My question was about the integration of a dimension template binary tree in boost.I'm working on such a thing and I think that kind of dichotomic data structure would be very usefull for various use... The other question I have is how could I do to make genericity on contained types without use a dynamic_cast at runtime: my prototype for the moment look like this template MultiDimensionalBinaryTree; template <typename T> typedef MultiDimensionalBinaryTree<2,T> QuadTree; template <typename T> typedef MultiDimensionalBinaryTree<3,T> OctreeTree; ... *template<typename T>* typedef MultiDimensionalBinaryTree<2, *T*> Registry; Scott McMurray a écrit :

On 06/07/07, valentin julien wrote:

...

What i'm working on is a multi dimensional binary tree to make Quadtrees Octrees or more.... And I want to make genericity to put several types of object in the same Leaf of my tree...

I'm not really sure what you want, but it might be Boost.Variant: http://boost.org/libs/variant _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

************************************************************************************ This footnote confirms that this email message has been scanned by PineApp Mail-SeCure for the presence of malicious code, vandals & computer viruses. ************************************************************************************

************************************************************************************ This footnote confirms that this email message has been scanned by PineApp Mail-SeCure for the presence of malicious code, vandals & computer viruses. ************************************************************************************

Thank you for your answer but I think i moke a mistake in my first question: Do you plan to integrate such a feature (Multidimensional binary tree) in boost..? (I think it's clearer) thank you Roman Perepelitsa a écrit :

valentin julien writes:

...

Hello, I don't know what has become to the rest of my post: My question was about the integration of a dimension template binary tree in boost.I'm working on such a thing and I think that kind of dichotomic data structure would be very usefull for various use... The other question I have is how could I do to make genericity on contained types without use a dynamic_cast at runtime: my prototype for the moment look like this

template MultiDimensionalBinaryTree; template <typename T> typedef MultiDimensionalBinaryTree<2,T> QuadTree; template <typename T> typedef MultiDimensionalBinaryTree<3,T> OctreeTree; ...

*template<typename T>* typedef MultiDimensionalBinaryTree<2, *T*≥ Registry;

Do as STL does -- stick to homogenous container and let user decide what she wants to put in it. If one wants heterogeneous tree, then she can use MultiDimensionalBinaryTree or MultiDimensionalBinaryTree >.

Roman Perepelitsa.

_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

************************************************************************************ This footnote confirms that this email message has been scanned by PineApp Mail-SeCure for the presence of malicious code, vandals & computer viruses. ************************************************************************************

************************************************************************************ This footnote confirms that this email message has been scanned by PineApp Mail-SeCure for the presence of malicious code, vandals & computer viruses. ************************************************************************************