3 // Copyright (C) 2005 Free Software Foundation, Inc.
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
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32 // Permission to use, copy, modify, sell, and distribute this software
33 // is hereby granted without fee, provided that the above copyright
34 // notice appears in all copies, and that both that copyright notice and
35 // this permission notice appear in supporting documentation. None of
36 // the above authors, nor IBM Haifa Research Laboratories, make any
37 // representation about the suitability of this software for any
38 // purpose. It is provided "as is" without express or implied warranty.
41 * @file insert_fn_imps.hpp
42 * Contains implementations of lu_map_.
47 typename
PB_ASSOC_CLASS_C_DEC::find_iterator
,
49 PB_ASSOC_CLASS_C_DEC::
50 insert(const_reference r_val
)
52 PB_ASSOC_DBG_ONLY(assert_valid();)
54 entry_pointer p_l
= find_imp(PB_ASSOC_V2F(r_val
));
58 if (p_l
->m_p_next
== NULL
)
62 insert_new_after(p_l
, r_val
);
65 PB_ASSOC_DBG_ASSERT(Eq_Fn::operator()(
66 PB_ASSOC_V2F(p_l
->m_p_next
->m_value
),
67 PB_ASSOC_V2F(r_val
)));
69 PB_ASSOC_DBG_ONLY(assert_valid();)
71 if (Update_Policy::operator()(p_l
->m_update_metadata
))
73 move_next_to_front(p_l
);
75 return (std::make_pair(
76 find_iterator(&m_p_l
->m_p_next
->m_value
),
80 return (std::make_pair(
81 find_iterator(&p_l
->m_p_next
->m_value
),
87 PB_ASSOC_CLASS_C_DEC::
88 insert_new_after(entry_pointer p_l
, const_reference r_val
)
90 PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
91 PB_ASSOC_V2F(r_val
));)
93 entry_pointer p_new_l
= s_entry_allocator
.allocate(1);
95 cond_dealtor_t
cond(p_new_l
);
97 new (const_cast<void* >(
98 static_cast<const void* >(&p_new_l
->m_value
)))
101 cond
.set_no_action();
103 PB_ASSOC_DBG_ASSERT(p_l
->m_p_next
== NULL
);
104 p_l
->m_p_next
= p_new_l
;
106 p_new_l
->m_p_next
= NULL
;
110 PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(PB_ASSOC_V2F(r_val
));)
113 #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
115 inline typename
PB_ASSOC_CLASS_C_DEC::data_reference
116 PB_ASSOC_CLASS_C_DEC::
117 subscript_imp(const_key_reference r_key
)
119 PB_ASSOC_DBG_ONLY(assert_valid();)
121 entry_pointer p_l
= find_imp(r_key
);
125 if (p_l
->m_p_next
== NULL
)
129 insert_new_after(p_l
, value_type(r_key
, data_type()));
132 PB_ASSOC_DBG_ASSERT(Eq_Fn::operator()(
133 PB_ASSOC_V2F(p_l
->m_p_next
->m_value
),
134 PB_ASSOC_V2F(r_val
)));
136 PB_ASSOC_DBG_ONLY(assert_valid();)
138 if (Update_Policy::operator()(p_l
->m_update_metadata
))
140 move_next_to_front(p_l
);
142 return (m_p_l
->m_p_next
->m_value
.second
);
145 return (p_l
->m_p_next
->m_value
.second
);
147 #endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR