From c8dc1d84f729a9b59680596eed0ec51dfa5d7b74 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?St=C3=A9phane=20Tayeb?= <Stephane.Tayeb@sophia.inria.fr>
Date: Fri, 26 Jun 2009 11:58:17 +0000
Subject: [PATCH] Add a CGAL_assertion (prevents std::bad_alloc).

---
 AABB_tree/include/CGAL/AABB_tree.h | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree.h b/AABB_tree/include/CGAL/AABB_tree.h
index 907a111f786..2acd8378d25 100644
--- a/AABB_tree/include/CGAL/AABB_tree.h
+++ b/AABB_tree/include/CGAL/AABB_tree.h
@@ -142,9 +142,9 @@ namespace CGAL {
             m_search_tree_constructed = false;
         }
 
-    public: 
+    public:
     // made public for advanced use by the polyhedron demo
-    
+
         /// generic traversal of the tree
         template <class Query, class Traversal_traits>
         void traversal(const Query& query, Traversal_traits& traits) const
@@ -421,6 +421,7 @@ namespace CGAL {
             ++first;
         }
 
+        CGAL_assertion(m_primitives.size() > 1);
         m_p_root_node = new Node[m_primitives.size()-1]();
         if(m_p_root_node == NULL)
         {