feature for multidimensional binary tree
I have heard about your library from a friend and badly i haven't found some kind of template binary tree implementation... 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 think this idea sounds like a cool stuff ...Is there laready any structure in Boost that can be use like it ? Or What do you think of this feature? ************************************************************************************ This footnote confirms that this email message has been scanned by PineApp Mail-SeCure for the presence of malicious code, vandals & computer viruses. ************************************************************************************
On 06/07/07, valentin julien <julien.valentin@cstb.fr> 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
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 <int Dimension,typename T> 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 <julien.valentin@cstb.fr> 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. ************************************************************************************
valentin julien <julien.valentin <at> cstb.fr> 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 <int Dimension,typename T> 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<N, boost::any> or MultiDimensionalBinaryTree<N, boost::variant<...> >. Roman Perepelitsa.
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 <julien.valentin <at> cstb.fr> 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 <int Dimension,typename T> 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<N, boost::any> or MultiDimensionalBinaryTree<N, boost::variant<...> >.
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. ************************************************************************************
On 10/07/07, valentin julien <julien.valentin@cstb.fr> wrote:
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..?
"Boost" does not write its own libraries. People write them, then submit them for inclusion following the Formal Review Process ( http://boost.org/more/formal_review_process.htm ). I'm not aware of anyone working on such a library. ~ Scott
participants (2)
-
Roman Perepelitsa -
Scott McMurray -
valentin julien