1 // -*- C++ -*- 2 3 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. 4 // 5 // This file is part of the GNU ISO C++ Library. This library is free 6 // software; you can redistribute it and/or modify it under the terms 7 // of the GNU General Public License as published by the Free Software 8 // Foundation; either version 3, or (at your option) any later 9 // version. 10 11 // This library is distributed in the hope that it will be useful, but 12 // WITHOUT ANY WARRANTY; without even the implied warranty of 13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14 // General Public License for more details. 15 16 // Under Section 7 of GPL version 3, you are granted additional 17 // permissions described in the GCC Runtime Library Exception, version 18 // 3.1, as published by the Free Software Foundation. 19 20 // You should have received a copy of the GNU General Public License and 21 // a copy of the GCC Runtime Library Exception along with this program; 22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 23 // <http://www.gnu.org/licenses/>. 24 25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 26 27 // Permission to use, copy, modify, sell, and distribute this software 28 // is hereby granted without fee, provided that the above copyright 29 // notice appears in all copies, and that both that copyright notice 30 // and this permission notice appear in supporting documentation. None 31 // of the above authors, nor IBM Haifa Research Laboratories, make any 32 // representation about the suitability of this software for any 33 // purpose. It is provided "as is" without express or implied 34 // warranty. 35 36 /** 37 * @file split_join_branch_bag.hpp 38 * Contains an implementation class for pat_trie_. 39 */ 40 41 class split_join_branch_bag 42 { 43 private: 44 typedef 45 std::list< 46 internal_node_pointer, 47 typename Allocator::template rebind< 48 internal_node_pointer>::other> 49 bag_t; 50 51 public: 52 53 void 54 add_branch() 55 { 56 internal_node_pointer p_nd = s_internal_node_allocator.allocate(1); 57 __try 58 { 59 m_bag.push_back(p_nd); 60 } 61 __catch(...) 62 { 63 s_internal_node_allocator.deallocate(p_nd, 1); 64 __throw_exception_again; 65 } 66 } 67 68 internal_node_pointer 69 get_branch() 70 { 71 _GLIBCXX_DEBUG_ASSERT(!m_bag.empty()); 72 internal_node_pointer p_nd =* m_bag.begin(); 73 m_bag.pop_front(); 74 return p_nd; 75 } 76 77 ~split_join_branch_bag() 78 { 79 while (!m_bag.empty()) 80 { 81 internal_node_pointer p_nd =* m_bag.begin(); 82 s_internal_node_allocator.deallocate(p_nd, 1); 83 m_bag.pop_front(); 84 } 85 } 86 87 inline bool 88 empty() const 89 { return m_bag.empty(); } 90 91 private: 92 bag_t m_bag; 93 }; 94
