detail/pat_trie_/internal_node.hpp

236 		 const_e_access_traits_pointer p_traits) const
241       return 1 + p_traits->e_pos(*b_it);
258     update_prefixes(const_e_access_traits_pointer p_traits)
264 	  m_pref_b_it = p_traits->begin(e_access_traits::extract_key(p->value()));
314 		   const_e_access_traits_pointer p_traits)
316       const size_type i = get_pref_pos(b_it, e_it, p_traits);
325 		 const_e_access_traits_pointer p_traits)
327       const size_type i = get_pref_pos(b_it, e_it, p_traits);
337 		   const_e_access_traits_pointer p_traits) const
338     { return const_cast<node_pointer>(get_child_node(b_it, e_it, p_traits)); }
345 			       const_e_access_traits_pointer p_traits)
347       if (!should_be_mine(b_it, e_it, checked_ind, p_traits))
349 	  if (p_traits->cmp_prefixes(b_it, e_it, m_pref_b_it, m_pref_e_it, true))
354       size_type i = get_pref_pos(b_it, e_it, p_traits);
378 	      const_e_access_traits_pointer p_traits)
380       const size_type i = get_pref_pos(b_it, e_it, p_traits);
394     get_join_child(const_node_pointer p_nd, const_e_access_traits_pointer p_traits) const
397       return const_cast<internal_node_pointer>(this)->get_join_child(p, p_traits);
403     get_join_child(node_pointer p_nd, const_e_access_traits_pointer p_traits)
413 	  b_it = p_traits->begin(r_key);
414 	  e_it = p_traits->end(r_key);
421       i = get_pref_pos(b_it, e_it, p_traits);
457 		  const_e_access_traits_pointer p_traits)
459       const size_type i = get_pref_pos(b_it, e_it, p_traits);
488 		   const_e_access_traits_pointer p_traits) const
507       return p_traits->equal_prefixes(key_b_it, key_e_it, value_b_it,
579     assert_valid_imp(const_e_access_traits_pointer p_traits) const
590 	  subtree_debug_info child_ret = p_nd->assert_valid_imp(p_traits);
593 	  _GLIBCXX_DEBUG_ASSERT(should_be_mine(child_ret.first, child_ret.second, 0, p_traits));
594 	  _GLIBCXX_DEBUG_ASSERT(get_pref_pos(child_ret.first, child_ret.second, p_traits) == static_cast<size_type>(it.m_p_p_cur - m_a_p_children));