Subversion Repositories Kolibri OS

// -*- C++ -*-

// Copyright (C) 2005-2013 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 3, 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.

// Under Section 7 of GPL version 3, you are granted additional

// permissions described in the GCC Runtime Library Exception, version

// 3.1, as published by the Free Software Foundation.

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

// a copy of the GCC Runtime Library Exception along with this program;

// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see

// .

// 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 bin_search_tree_/split_join_fn_imps.hpp

 * Contains an implementation class for bin_search_tree_.

 */

PB_DS_CLASS_T_DEC

bool

PB_DS_CLASS_C_DEC::

join_prep(PB_DS_CLASS_C_DEC& other)

{

  PB_DS_ASSERT_VALID((*this))

  PB_DS_ASSERT_VALID(other)

  if (other.m_size == 0)

    return false;

  if (m_size == 0)

    {

      value_swap(other);

      return false;

    }

  const bool greater =

    Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value),

		       PB_DS_V2F(other.m_p_head->m_p_left->m_value));

  const bool lesser =

    Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value),

		       PB_DS_V2F(m_p_head->m_p_left->m_value));

  if (!greater && !lesser)

    __throw_join_error();

  if (lesser)

    value_swap(other);

  m_size += other.m_size;

  _GLIBCXX_DEBUG_ONLY(debug_base::join(other);)

  return true;

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

join_finish(PB_DS_CLASS_C_DEC& other)

{

  initialize_min_max();

  other.initialize();

}

PB_DS_CLASS_T_DEC

bool

PB_DS_CLASS_C_DEC::

split_prep(key_const_reference r_key, PB_DS_CLASS_C_DEC& other)

{

  PB_DS_ASSERT_VALID((*this))

  PB_DS_ASSERT_VALID(other)

  other.clear();

  if (m_size == 0)

    {

      PB_DS_ASSERT_VALID((*this))

      PB_DS_ASSERT_VALID(other)

      return false;

    }

  if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))

    {

      value_swap(other);

      PB_DS_ASSERT_VALID((*this))

      PB_DS_ASSERT_VALID(other)

      return false;

    }

  if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value)))

    {

      PB_DS_ASSERT_VALID((*this))

      PB_DS_ASSERT_VALID(other)

      return false;

    }

  if (m_size == 1)

    {

      value_swap(other);

      PB_DS_ASSERT_VALID((*this))

      PB_DS_ASSERT_VALID(other)

      return false;

    }

  _GLIBCXX_DEBUG_ONLY(debug_base::split(r_key,(Cmp_Fn& )(*this), other);)

  return true;

}

PB_DS_CLASS_T_DEC

void

PB_DS_CLASS_C_DEC::

split_finish(PB_DS_CLASS_C_DEC& other)

{

  other.initialize_min_max();

  other.m_size = std::distance(other.begin(), other.end());

  m_size -= other.m_size;

  initialize_min_max();

  PB_DS_ASSERT_VALID((*this))

  PB_DS_ASSERT_VALID(other)

}

PB_DS_CLASS_T_DEC

typename PB_DS_CLASS_C_DEC::size_type

PB_DS_CLASS_C_DEC::

recursive_count(node_pointer p) const

{

  if (p == 0)

    return 0;

  return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right);

}