OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 array	9.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 assertions.h	2.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 bitset	11.62 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 debug.h	5.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 deque	16.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 formatter.h	13.84 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 forward_list	24.66 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 functions.h	16.21 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 helper_functions.h	6.65 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 list	21.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 macros.h	17.45 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 map	1.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 map.h	20.65 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multimap.h	17.82 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiset.h	16.77 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_base.h	9.06 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_container.h	3.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_iterator.h	29.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_iterator.tcc	2.89 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_local_iterator.h	15.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_local_iterator.tcc	2.07 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_sequence.h	4.98 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_sequence.tcc	4.87 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_unordered_base.h	6.73 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_unordered_container.h	3.81 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 safe_unordered_container.tcc	3.19 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 set	1.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 set.h	16.92 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator.h	4.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 string	32.86 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_map	34.58 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_set	29.81 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 vector	21.35 KB	12/04/2019 02:25:41 PM	rw-r--r--

Editing: safe_iterator.tcc

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

// Copyright (C) 2003-2017 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>
    bool
    _Safe_iterator<_Iterator, _Sequence>::
    _M_can_advance(const 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 =
	    __get_distance_from_begin(*this);
	  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 =
	    __get_distance_to_end(*this);
	  bool __ok = ((__dist.second == __dp_exact && __dist.first >= __n)
		       || (__dist.second != __dp_exact && __dist.first > 0));
	  return __ok;
	}
    }

template<typename _Iterator, typename _Sequence>
    bool
    _Safe_iterator<_Iterator, _Sequence>::
    _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 = __get_distance(*this, __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;
    }
} // namespace __gnu_debug

#endif