File Manager

Hackfut Security File Manager

Current Path: /usr/include/c++/4.4.4/bits

📁 ..
📄 algorithmfwd.h(20.26 KB)
📄 allocator.h(5.07 KB)
📄 atomic_0.h(13.64 KB)
📄 atomic_2.h(12.48 KB)
📄 atomicfwd_c.h(4.64 KB)
📄 atomicfwd_cxx.h(2.85 KB)
📄 basic_ios.h(14.6 KB)
📄 basic_ios.tcc(5.9 KB)
📄 basic_string.h(97.38 KB)
📄 basic_string.tcc(38.41 KB)
📄 boost_concept_check.h(26.38 KB)
📄 char_traits.h(16.03 KB)
📄 cmath.tcc(1.61 KB)
📄 codecvt.h(16.12 KB)
📄 concept_check.h(3.24 KB)
📄 cpp_type_traits.h(9.44 KB)
📄 deque.tcc(26.29 KB)
📄 forward_list.h(43.7 KB)
📄 forward_list.tcc(15.44 KB)
📄 fstream.tcc(26.6 KB)
📄 functexcept.h(2.67 KB)
📄 functional_hash.h(2 KB)
📄 gslice.h(5.32 KB)
📄 gslice_array.h(7.54 KB)
📄 hashtable.h(1.83 KB)
📄 indirect_array.h(7.63 KB)
📄 ios_base.h(27.54 KB)
📄 istream.tcc(28.77 KB)
📄 list.tcc(11.01 KB)
📄 locale_classes.h(23 KB)
📄 locale_classes.tcc(7.12 KB)
📄 locale_facets.h(88.42 KB)
📄 locale_facets.tcc(37.85 KB)
📄 locale_facets_nonio.h(63.95 KB)
📄 locale_facets_nonio.tcc(40.15 KB)
📄 localefwd.h(4.94 KB)
📄 mask_array.h(7.37 KB)
📄 move.h(2.64 KB)
📄 ostream.tcc(12.15 KB)
📄 ostream_insert.h(3.86 KB)
📄 postypes.h(8.01 KB)
📄 shared_ptr.h(47.51 KB)
📄 slice_array.h(9.07 KB)
📄 sstream.tcc(8.84 KB)
📄 stl_algo.h(203 KB)
📄 stl_algobase.h(39.03 KB)
📄 stl_bvector.h(25.58 KB)
📄 stl_construct.h(4.84 KB)
📄 stl_deque.h(59.5 KB)
📄 stl_function.h(21.74 KB)
📄 stl_heap.h(19.59 KB)
📄 stl_iterator.h(32.24 KB)
📄 stl_iterator_base_funcs.h(6.65 KB)
📄 stl_iterator_base_types.h(6.33 KB)
📄 stl_list.h(48.04 KB)
📄 stl_map.h(30.72 KB)
📄 stl_multimap.h(28.77 KB)
📄 stl_multiset.h(24.12 KB)
📄 stl_numeric.h(12.96 KB)
📄 stl_pair.h(8.23 KB)
📄 stl_queue.h(18.34 KB)
📄 stl_raw_storage_iter.h(3.31 KB)
📄 stl_relops.h(4.38 KB)
📄 stl_set.h(24.3 KB)
📄 stl_stack.h(9.51 KB)
📄 stl_tempbuf.h(6.34 KB)
📄 stl_tree.h(42.62 KB)
📄 stl_uninitialized.h(14.76 KB)
📄 stl_vector.h(41.33 KB)
📄 stream_iterator.h(6.27 KB)
📄 streambuf.tcc(4.81 KB)
📄 streambuf_iterator.h(11.89 KB)
📄 stringfwd.h(2.15 KB)
📄 unique_ptr.h(12.41 KB)
📄 valarray_after.h(22.02 KB)
📄 valarray_array.h(21.23 KB)
📄 valarray_array.tcc(7.02 KB)
📄 valarray_before.h(17.78 KB)
📄 vector.tcc(20.63 KB)

Editing: stl_stack.h

// Stack implementation -*- C++ -*-

// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
// 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/>.

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 */

/** @file stl_stack.h
 *  This is an internal header file, included by other library headers.
 *  You should not attempt to use it directly.
 */

#ifndef _STL_STACK_H
#define _STL_STACK_H 1

#include <bits/concept_check.h>
#include <debug/debug.h>

_GLIBCXX_BEGIN_NAMESPACE(std)

/**
   *  @brief  A standard container giving FILO behavior.
   *
   *  @ingroup sequences
   *
   *  Meets many of the requirements of a
   *  <a href="tables.html#65">container</a>,
   *  but does not define anything to do with iterators.  Very few of the
   *  other standard container interfaces are defined.
   *
   *  This is not a true container, but an @e adaptor.  It holds
   *  another container, and provides a wrapper interface to that
   *  container.  The wrapper is what enforces strict
   *  first-in-last-out %stack behavior.
   *
   *  The second template parameter defines the type of the underlying
   *  sequence/container.  It defaults to std::deque, but it can be
   *  any type that supports @c back, @c push_back, and @c pop_front,
   *  such as std::list, std::vector, or an appropriate user-defined
   *  type.
   *
   *  Members not found in "normal" containers are @c container_type,
   *  which is a typedef for the second Sequence parameter, and @c
   *  push, @c pop, and @c top, which are standard %stack/FILO
   *  operations.
  */
  template<typename _Tp, typename _Sequence = deque<_Tp> >
    class stack
    {
      // concept requirements
      typedef typename _Sequence::value_type _Sequence_value_type;
      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
      __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
      __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)

template<typename _Tp1, typename _Seq1>
        friend bool
        operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);

template<typename _Tp1, typename _Seq1>
        friend bool
        operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);

public:
      typedef typename _Sequence::value_type                value_type;
      typedef typename _Sequence::reference                 reference;
      typedef typename _Sequence::const_reference           const_reference;
      typedef typename _Sequence::size_type                 size_type;
      typedef          _Sequence                            container_type;

protected:
      //  See queue::c for notes on this name.
      _Sequence c;

public:
      // XXX removed old def ctor, added def arg to this one to match 14882
      /**
       *  @brief  Default constructor creates no elements.
       */
#ifndef __GXX_EXPERIMENTAL_CXX0X__
      explicit
      stack(const _Sequence& __c = _Sequence())
      : c(__c) { }
#else
      explicit
      stack(const _Sequence& __c)
      : c(__c) { }

explicit
      stack(_Sequence&& __c = _Sequence())
      : c(std::move(__c)) { }
#endif

/**
       *  Returns true if the %stack is empty.
       */
      bool
      empty() const
      { return c.empty(); }

/**  Returns the number of elements in the %stack.  */
      size_type
      size() const
      { return c.size(); }

/**
       *  Returns a read/write reference to the data at the first
       *  element of the %stack.
       */
      reference
      top()
      {
	__glibcxx_requires_nonempty();
	return c.back();
      }

/**
       *  Returns a read-only (constant) reference to the data at the first
       *  element of the %stack.
       */
      const_reference
      top() const
      {
	__glibcxx_requires_nonempty();
	return c.back();
      }

/**
       *  @brief  Add data to the top of the %stack.
       *  @param  x  Data to be added.
       *
       *  This is a typical %stack operation.  The function creates an
       *  element at the top of the %stack and assigns the given data
       *  to it.  The time complexity of the operation depends on the
       *  underlying sequence.
       */
      void
      push(const value_type& __x)
      { c.push_back(__x); }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      void
      push(value_type&& __x)
      { c.push_back(std::move(__x)); }

template<typename... _Args>
        void
        emplace(_Args&&... __args)
	{ c.emplace_back(std::forward<_Args>(__args)...); }
#endif

/**
       *  @brief  Removes first element.
       *
       *  This is a typical %stack operation.  It shrinks the %stack
       *  by one.  The time complexity of the operation depends on the
       *  underlying sequence.
       *
       *  Note that no data is returned, and if the first element's
       *  data is needed, it should be retrieved before pop() is
       *  called.
       */
      void
      pop()
      {
	__glibcxx_requires_nonempty();
	c.pop_back();
      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      void
      swap(stack&& __s)
      { c.swap(__s.c); }
#endif
    };

/**
   *  @brief  Stack equality comparison.
   *  @param  x  A %stack.
   *  @param  y  A %stack of the same type as @a x.
   *  @return  True iff the size and elements of the stacks are equal.
   *
   *  This is an equivalence relation.  Complexity and semantics
   *  depend on the underlying sequence type, but the expected rules
   *  are: this relation is linear in the size of the sequences, and
   *  stacks are considered equivalent if their sequences compare
   *  equal.
  */
  template<typename _Tp, typename _Seq>
    inline bool
    operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
    { return __x.c == __y.c; }

/**
   *  @brief  Stack ordering relation.
   *  @param  x  A %stack.
   *  @param  y  A %stack of the same type as @a x.
   *  @return  True iff @a x is lexicographically less than @a y.
   *
   *  This is an total ordering relation.  Complexity and semantics
   *  depend on the underlying sequence type, but the expected rules
   *  are: this relation is linear in the size of the sequences, the
   *  elements must be comparable with @c <, and
   *  std::lexicographical_compare() is usually used to make the
   *  determination.
  */
  template<typename _Tp, typename _Seq>
    inline bool
    operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
    { return __x.c < __y.c; }

/// Based on operator==
  template<typename _Tp, typename _Seq>
    inline bool
    operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
    { return !(__x == __y); }

/// Based on operator<
  template<typename _Tp, typename _Seq>
    inline bool
    operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
    { return __y < __x; }

/// Based on operator<
  template<typename _Tp, typename _Seq>
    inline bool
    operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
    { return !(__y < __x); }

/// Based on operator<
  template<typename _Tp, typename _Seq>
    inline bool
    operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
    { return !(__x < __y); }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
  template<typename _Tp, typename _Seq>
    inline void
    swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y)
    { __x.swap(__y); }

template<typename _Tp, typename _Seq>
    inline void
    swap(stack<_Tp, _Seq>&& __x, stack<_Tp, _Seq>& __y)
    { __x.swap(__y); }

template<typename _Tp, typename _Seq>
    inline void
    swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>&& __y)
    { __x.swap(__y); }
#endif

_GLIBCXX_END_NAMESPACE

#endif /* _STL_STACK_H */

Hackfut Security File Manager

Editing: stl_stack.h

Upload File

Create Folder