Subversion Repositories scarts

// -*- C++ -*-

// Copyright (C) 2005 Free Software Foundation, Inc.

//

// This file is part of the GNU ISO C++ Library.  This library is free

// software; you can redistribute it and/or modify it under the

// terms of the GNU General Public License as published by the

// Free Software Foundation; either version 2, or (at your option)

// any later version.

// This library is distributed in the hope that it will be useful,

// but WITHOUT ANY WARRANTY; without even the implied warranty of

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along

// with this library; see the file COPYING.  If not, write to the Free

// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,

// USA.

// As a special exception, you may use this file as part of a free software

// library without restriction.  Specifically, if other files instantiate

// templates or use macros or inline functions from this file, or you compile

// this file and link it with other files to produce an executable, this

// file does not by itself cause the resulting executable to be covered by

// the GNU General Public License.  This exception does not however

// invalidate any other reasons why the executable file might be covered by

// the GNU General Public License.

// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.

// Permission to use, copy, modify, sell, and distribute this software

// is hereby granted without fee, provided that the above copyright

// notice appears in all copies, and that both that copyright notice and

// this permission notice appear in supporting documentation. None of

// the above authors, nor IBM Haifa Research Laboratories, make any

// representation about the suitability of this software for any

// purpose. It is provided "as is" without express or implied warranty.

/**

 * @file find_fn_imps.hpp

 * Contains an implementation class for bin_search_tree_.

 */

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator

PB_ASSOC_CLASS_C_DEC::

lower_bound(const_key_reference r_key) const

{

  node_pointer p_pot = m_p_head;

  node_pointer p_nd = m_p_head->m_p_parent;

  while (p_nd != NULL)

    if (!Cmp_Fn::operator()(PB_ASSOC_V2F(p_nd->m_value), r_key))

      {

        p_pot = p_nd;

        p_nd = p_nd->m_p_left;

      }

    else

      p_nd = p_nd->m_p_right;

  return (iterator(p_pot));

}

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::find_iterator

PB_ASSOC_CLASS_C_DEC::

lower_bound(const_key_reference r_key)

{

  node_pointer p_pot = m_p_head;

  node_pointer p_nd = m_p_head->m_p_parent;

  while (p_nd != NULL)

    if (!Cmp_Fn::operator()(

                            PB_ASSOC_V2F(p_nd->m_value),

                            r_key))

      {

        p_pot = p_nd;

        p_nd = p_nd->m_p_left;

      }

    else

      p_nd = p_nd->m_p_right;

  return (iterator(p_pot));

}

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator

PB_ASSOC_CLASS_C_DEC::

upper_bound(const_key_reference r_key) const

{

  node_pointer p_pot = m_p_head;

  node_pointer p_nd = m_p_head->m_p_parent;

  while (p_nd != NULL)

    if (Cmp_Fn::operator()(r_key,

                           PB_ASSOC_V2F(p_nd->m_value)))

      {

        p_pot = p_nd,

          p_nd = p_nd->m_p_left;

      }

    else

      p_nd = p_nd->m_p_right;

  return (const_iterator(p_pot));

}

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::find_iterator

PB_ASSOC_CLASS_C_DEC::

upper_bound(const_key_reference r_key)

{

  node_pointer p_pot = m_p_head;

  node_pointer p_nd = m_p_head->m_p_parent;

  while (p_nd != NULL)

    if (Cmp_Fn::operator()(r_key,

                           PB_ASSOC_V2F(p_nd->m_value)))

      {

        p_pot = p_nd,

          p_nd = p_nd->m_p_left;

      }

    else

      p_nd = p_nd->m_p_right;

  return (find_iterator(p_pot));

}

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::find_iterator

PB_ASSOC_CLASS_C_DEC::

find(const_key_reference r_key)

{

  PB_ASSOC_DBG_ONLY(assert_valid(true, false);)

    node_pointer p_pot = m_p_head;

  node_pointer p_nd = m_p_head->m_p_parent;

  while (p_nd != NULL)

    if (!Cmp_Fn::operator()(PB_ASSOC_V2F(p_nd->m_value), r_key))

      {

        p_pot = p_nd;

        p_nd = p_nd->m_p_left;

      }

    else

      p_nd = p_nd->m_p_right;

  return find_iterator((p_pot != m_p_head&&  Cmp_Fn::operator()(

                                                                r_key,

                                                                PB_ASSOC_V2F(p_pot->m_value)))?

                       m_p_head : p_pot);

}

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator

PB_ASSOC_CLASS_C_DEC::

find(const_key_reference r_key) const

{

  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)

    node_pointer p_pot = m_p_head;

  node_pointer p_nd = m_p_head->m_p_parent;

  while (p_nd != NULL)

    if (!Cmp_Fn::operator()(PB_ASSOC_V2F(p_nd->m_value), r_key))

      {

        p_pot = p_nd;

        p_nd = p_nd->m_p_left;

      }

    else

      p_nd = p_nd->m_p_right;

  return const_find_iterator((p_pot != m_p_head&&  Cmp_Fn::operator()(

                                                                      r_key,

                                                                      PB_ASSOC_V2F(p_pot->m_value)))?

                             m_p_head : p_pot);

}