Gecko [ www.jdcpatala.org ]

Name	Size	Permission
array	10.17 KB	-rw-r--r--
assertions.h	2.35 KB	-rw-r--r--
bitset	11.62 KB	-rw-r--r--
debug.h	5.66 KB	-rw-r--r--
deque	17.28 KB	-rw-r--r--
formatter.h	16.63 KB	-rw-r--r--
forward_list	26.49 KB	-rw-r--r--
functions.h	15.62 KB	-rw-r--r--
helper_functions.h	7.51 KB	-rw-r--r--
list	24.46 KB	-rw-r--r--
macros.h	19.94 KB	-rw-r--r--
map	1.62 KB	-rw-r--r--
map.h	22.11 KB	-rw-r--r--
multimap.h	19.45 KB	-rw-r--r--
multiset.h	18.4 KB	-rw-r--r--
safe_base.h	9.06 KB	-rw-r--r--
safe_container.h	3.33 KB	-rw-r--r--
safe_iterator.h	28.69 KB	-rw-r--r--
safe_iterator.tcc	6.42 KB	-rw-r--r--
safe_local_iterator.h	13.42 KB	-rw-r--r--
safe_local_iterator.tcc	2.84 KB	-rw-r--r--
safe_sequence.h	4.98 KB	-rw-r--r--
safe_sequence.tcc	4.92 KB	-rw-r--r--
safe_unordered_base.h	6.73 KB	-rw-r--r--
safe_unordered_container.h	3.78 KB	-rw-r--r--
safe_unordered_container.tcc	3.19 KB	-rw-r--r--
set	1.58 KB	-rw-r--r--
set.h	18.41 KB	-rw-r--r--
stl_iterator.h	4.76 KB	-rw-r--r--
string	35.59 KB	-rw-r--r--
unordered_map	40.47 KB	-rw-r--r--
unordered_set	34.66 KB	-rw-r--r--
vector	22.98 KB	-rw-r--r--

Code Editor : safe_iterator.tcc

// Debugging iterator implementation (out of line) -*- C++ -*-

// Copyright (C) 2003-2019 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
// <http://www.gnu.org/licenses/>.

/** @file debug/safe_iterator.tcc
 *  This file is a GNU debug extension to the Standard C++ Library.
 */

#ifndef _GLIBCXX_DEBUG_SAFE_ITERATOR_TCC
#define _GLIBCXX_DEBUG_SAFE_ITERATOR_TCC 1

namespace __gnu_debug
{
  template<typename _Iterator, typename _Sequence, typename _Category>
    typename _Distance_traits<_Iterator>::__type
    _Safe_iterator<_Iterator, _Sequence, _Category>::
    _M_get_distance_from_begin() const
    {
      typedef _Sequence_traits<_Sequence> _SeqTraits;

// No need to consider before_begin as this function is only used in
      // _M_can_advance which won't be used for forward_list iterators.
      if (_M_is_begin())
	return std::make_pair(0, __dp_exact);

if (_M_is_end())
	return _SeqTraits::_S_size(*_M_get_sequence());

typename _Distance_traits<_Iterator>::__type __res
	= __get_distance(_M_get_sequence()->_M_base().begin(), base());

if (__res.second == __dp_equality)
	return std::make_pair(1, __dp_sign);

return __res;
    }

template<typename _Iterator, typename _Sequence, typename _Category>
    typename _Distance_traits<_Iterator>::__type
    _Safe_iterator<_Iterator, _Sequence, _Category>::
    _M_get_distance_to_end() const
    {
      typedef _Sequence_traits<_Sequence> _SeqTraits;

// No need to consider before_begin as this function is only used in
      // _M_can_advance which won't be used for forward_list iterators.
      if (_M_is_begin())
	return _SeqTraits::_S_size(*_M_get_sequence());

if (_M_is_end())
	return std::make_pair(0, __dp_exact);

typename _Distance_traits<_Iterator>::__type __res
	= __get_distance(base(), _M_get_sequence()->_M_base().end());

if (__res.second == __dp_equality)
	return std::make_pair(1, __dp_sign);

return __res;
    }

template<typename _Iterator, typename _Sequence, typename _Category>
    bool
    _Safe_iterator<_Iterator, _Sequence, _Category>::
    _M_can_advance(difference_type __n) const
    {
      if (this->_M_singular())
	return false;

if (__n == 0)
	return true;

if (__n < 0)
	{
	  std::pair<difference_type, _Distance_precision> __dist =
	    _M_get_distance_from_begin();
	  bool __ok =  ((__dist.second == __dp_exact && __dist.first >= -__n)
			|| (__dist.second != __dp_exact && __dist.first > 0));
	  return __ok;
	}
      else
	{
	  std::pair<difference_type, _Distance_precision> __dist =
	    _M_get_distance_to_end();
	  bool __ok = ((__dist.second == __dp_exact && __dist.first >= __n)
		       || (__dist.second != __dp_exact && __dist.first > 0));
	  return __ok;
	}
    }

template<typename _Iterator, typename _Sequence, typename _Category>
    typename _Distance_traits<_Iterator>::__type
    _Safe_iterator<_Iterator, _Sequence, _Category>::
    _M_get_distance_to(const _Safe_iterator& __rhs) const
    {
      typedef typename _Distance_traits<_Iterator>::__type _Diff;
      typedef _Sequence_traits<_Sequence> _SeqTraits;

if (this->base() == __rhs.base())
	return std::make_pair(0, __dp_exact);

if (this->_M_is_before_begin())
	{
	  if (__rhs._M_is_begin())
	    return std::make_pair(1, __dp_exact);

return std::make_pair(1, __dp_sign);
	}

if (this->_M_is_begin())
	{
	  if (__rhs._M_is_before_begin())
	    return std::make_pair(-1, __dp_exact);

if (__rhs._M_is_end())
	    return _SeqTraits::_S_size(*this->_M_get_sequence());

return std::make_pair(1, __dp_sign);
	}

if (this->_M_is_end())
	{
	  if (__rhs._M_is_before_begin())
	    return std::make_pair(-1, __dp_exact);

if (__rhs._M_is_begin())
	    {
	      _Diff __diff = _SeqTraits::_S_size(*this->_M_get_sequence());
	      return std::make_pair(-__diff.first, __diff.second);
	    }

return std::make_pair(-1, __dp_sign);
	}

if (__rhs._M_is_before_begin() || __rhs._M_is_begin())
	return std::make_pair(-1, __dp_sign);

if (__rhs._M_is_end())
	return std::make_pair(1, __dp_sign);

return std::make_pair(1, __dp_equality);
    }

template<typename _Iterator, typename _Sequence, typename _Category>
    bool
    _Safe_iterator<_Iterator, _Sequence, _Category>::
    _M_valid_range(const _Safe_iterator& __rhs,
		   std::pair<difference_type, _Distance_precision>& __dist,
		   bool __check_dereferenceable) const
    {
      if (!_M_can_compare(__rhs))
	return false;

/* Determine iterators order */
      __dist = _M_get_distance_to(__rhs);
      switch (__dist.second)
	{
	case __dp_equality:
	  if (__dist.first == 0)
	    return true;
	  break;

case __dp_sign:
	case __dp_exact:
	  // If range is not empty first iterator must be dereferenceable.
	  if (__dist.first > 0)
	    return !__check_dereferenceable || _M_dereferenceable();
	  return __dist.first == 0;
	}

// Assume that this is a valid range; we can't check anything else.
      return true;
    }

template<typename _Iterator, typename _Sequence>
    bool
    _Safe_iterator<_Iterator, _Sequence, std::random_access_iterator_tag>::
    _M_valid_range(const _Safe_iterator& __rhs,
		   std::pair<difference_type,
			     _Distance_precision>& __dist) const
    {
      if (!this->_M_can_compare(__rhs))
	return false;

/* Determine iterators order */
      __dist = std::make_pair(__rhs.base() - this->base(), __dp_exact);

// If range is not empty first iterator must be dereferenceable.
      if (__dist.first > 0)
	return this->_M_dereferenceable();
      return __dist.first == 0;
    }
} // namespace __gnu_debug

#endif

${this.title}

Code Editor : safe_iterator.tcc