Linux vps-61133.fhnet.fr 4.9.0-19-amd64 #1 SMP Debian 4.9.320-2 (2022-06-30) x86_64
Apache/2.4.25 (Debian)
Server IP : 93.113.207.21 & Your IP : 216.73.216.119
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
c++ /
6 /
bits /
Delete
Unzip
Name
Size
Permission
Date
Action
algorithmfwd.h
21.03
KB
-rwxrwxrwx
2018-02-14 17:53
alloc_traits.h
19.13
KB
-rwxrwxrwx
2018-02-14 17:53
allocated_ptr.h
3.42
KB
-rwxrwxrwx
2018-02-14 17:53
allocator.h
6.76
KB
-rwxrwxrwx
2018-02-14 17:53
atomic_base.h
23.41
KB
-rwxrwxrwx
2018-02-14 17:53
atomic_futex.h
9.35
KB
-rwxrwxrwx
2018-02-14 17:53
atomic_lockfree_defines.h
2.2
KB
-rwxrwxrwx
2018-02-14 17:53
basic_ios.h
15.7
KB
-rwxrwxrwx
2018-02-14 17:53
basic_ios.tcc
5.89
KB
-rwxrwxrwx
2018-02-14 17:53
basic_string.h
203.81
KB
-rwxrwxrwx
2018-02-14 17:53
basic_string.tcc
50.58
KB
-rwxrwxrwx
2018-02-14 17:53
boost_concept_check.h
26.41
KB
-rwxrwxrwx
2018-02-14 17:53
c++0x_warning.h
1.44
KB
-rwxrwxrwx
2018-02-14 17:53
c++14_warning.h
1.48
KB
-rwxrwxrwx
2018-02-14 17:53
char_traits.h
17.56
KB
-rwxrwxrwx
2018-02-14 17:53
codecvt.h
20.8
KB
-rwxrwxrwx
2018-02-14 17:53
concept_check.h
3.34
KB
-rwxrwxrwx
2018-02-14 17:53
cpp_type_traits.h
9.37
KB
-rwxrwxrwx
2018-02-14 17:53
cxxabi_forced.h
1.77
KB
-rwxrwxrwx
2018-02-14 17:53
deque.tcc
32.89
KB
-rwxrwxrwx
2018-02-14 17:53
enable_special_members.h
10.87
KB
-rwxrwxrwx
2018-02-14 17:53
exception_defines.h
1.61
KB
-rwxrwxrwx
2018-02-14 17:53
exception_ptr.h
5.6
KB
-rwxrwxrwx
2018-02-14 17:53
forward_list.h
47.46
KB
-rwxrwxrwx
2018-02-14 17:53
forward_list.tcc
14.74
KB
-rwxrwxrwx
2018-02-14 17:53
fstream.tcc
32.1
KB
-rwxrwxrwx
2018-02-14 17:53
functexcept.h
3.18
KB
-rwxrwxrwx
2018-02-14 17:53
functional_hash.h
7.49
KB
-rwxrwxrwx
2018-02-14 17:53
gslice.h
5.39
KB
-rwxrwxrwx
2018-02-14 17:53
gslice_array.h
7.59
KB
-rwxrwxrwx
2018-02-14 17:53
hash_bytes.h
2.1
KB
-rwxrwxrwx
2018-02-14 17:53
hashtable.h
67.52
KB
-rwxrwxrwx
2018-02-14 17:53
hashtable_policy.h
62.54
KB
-rwxrwxrwx
2018-02-14 17:53
indirect_array.h
7.68
KB
-rwxrwxrwx
2018-02-14 17:53
ios_base.h
30.22
KB
-rwxrwxrwx
2018-02-14 17:53
istream.tcc
30.21
KB
-rwxrwxrwx
2018-02-14 17:53
list.tcc
15.1
KB
-rwxrwxrwx
2018-02-14 17:53
locale_classes.h
24.31
KB
-rwxrwxrwx
2018-02-14 17:53
locale_classes.tcc
8.18
KB
-rwxrwxrwx
2018-02-14 17:53
locale_conv.h
15.69
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets.h
89.93
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets.tcc
38.64
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets_nonio.h
67.33
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets_nonio.tcc
44.08
KB
-rwxrwxrwx
2018-02-14 17:53
localefwd.h
5.51
KB
-rwxrwxrwx
2018-02-14 17:53
mask_array.h
7.42
KB
-rwxrwxrwx
2018-02-14 17:53
memoryfwd.h
2.36
KB
-rwxrwxrwx
2018-02-14 17:53
move.h
6.19
KB
-rwxrwxrwx
2018-02-14 17:53
nested_exception.h
4.82
KB
-rwxrwxrwx
2018-02-14 17:53
ostream.tcc
12.03
KB
-rwxrwxrwx
2018-02-14 17:53
ostream_insert.h
3.91
KB
-rwxrwxrwx
2018-02-14 17:53
parse_numbers.h
7.58
KB
-rwxrwxrwx
2018-02-14 17:53
postypes.h
8.02
KB
-rwxrwxrwx
2018-02-14 17:53
predefined_ops.h
7.78
KB
-rwxrwxrwx
2018-02-14 17:53
ptr_traits.h
4.75
KB
-rwxrwxrwx
2018-02-14 17:53
quoted_string.h
4.47
KB
-rwxrwxrwx
2018-02-14 17:53
random.h
169.29
KB
-rwxrwxrwx
2018-02-14 17:53
random.tcc
103.07
KB
-rwxrwxrwx
2018-02-14 17:53
range_access.h
9.32
KB
-rwxrwxrwx
2018-02-14 17:53
regex.h
94.62
KB
-rwxrwxrwx
2018-02-14 17:53
regex.tcc
16.09
KB
-rwxrwxrwx
2018-02-14 17:53
regex_automaton.h
10.43
KB
-rwxrwxrwx
2018-02-14 17:53
regex_automaton.tcc
7.65
KB
-rwxrwxrwx
2018-02-14 17:53
regex_compiler.h
14.42
KB
-rwxrwxrwx
2018-02-14 17:53
regex_compiler.tcc
17.97
KB
-rwxrwxrwx
2018-02-14 17:53
regex_constants.h
13.93
KB
-rwxrwxrwx
2018-02-14 17:53
regex_error.h
4.85
KB
-rwxrwxrwx
2018-02-14 17:53
regex_executor.h
6.61
KB
-rwxrwxrwx
2018-02-14 17:53
regex_executor.tcc
13.9
KB
-rwxrwxrwx
2018-02-14 17:53
regex_scanner.h
6.88
KB
-rwxrwxrwx
2018-02-14 17:53
regex_scanner.tcc
14.6
KB
-rwxrwxrwx
2018-02-14 17:53
shared_ptr.h
19.78
KB
-rwxrwxrwx
2018-02-14 17:53
shared_ptr_atomic.h
9.54
KB
-rwxrwxrwx
2018-02-14 17:53
shared_ptr_base.h
44.6
KB
-rwxrwxrwx
2018-02-14 17:53
slice_array.h
9.13
KB
-rwxrwxrwx
2018-02-14 17:53
specfun.h
44
KB
-rwxrwxrwx
2018-02-14 17:53
sstream.tcc
9.27
KB
-rwxrwxrwx
2018-02-14 17:53
std_mutex.h
9
KB
-rwxrwxrwx
2018-02-14 17:53
stl_algo.h
200.43
KB
-rwxrwxrwx
2018-02-14 17:53
stl_algobase.h
49.22
KB
-rwxrwxrwx
2018-02-14 17:53
stl_bvector.h
32.69
KB
-rwxrwxrwx
2018-02-14 17:53
stl_construct.h
5.05
KB
-rwxrwxrwx
2018-02-14 17:53
stl_deque.h
76.16
KB
-rwxrwxrwx
2018-02-14 17:53
stl_function.h
32.5
KB
-rwxrwxrwx
2018-02-14 17:53
stl_heap.h
18.75
KB
-rwxrwxrwx
2018-02-14 17:53
stl_iterator.h
39.39
KB
-rwxrwxrwx
2018-02-14 17:53
stl_iterator_base_funcs.h
7.69
KB
-rwxrwxrwx
2018-02-14 17:53
stl_iterator_base_types.h
8.45
KB
-rwxrwxrwx
2018-02-14 17:53
stl_list.h
64.03
KB
-rwxrwxrwx
2018-02-14 17:53
stl_map.h
49.45
KB
-rwxrwxrwx
2018-02-14 17:53
stl_multimap.h
37.09
KB
-rwxrwxrwx
2018-02-14 17:53
stl_multiset.h
31.18
KB
-rwxrwxrwx
2018-02-14 17:53
stl_numeric.h
13.51
KB
-rwxrwxrwx
2018-02-14 17:53
stl_pair.h
17.18
KB
-rwxrwxrwx
2018-02-14 17:53
stl_queue.h
20.26
KB
-rwxrwxrwx
2018-02-14 17:53
stl_raw_storage_iter.h
3.74
KB
-rwxrwxrwx
2018-02-14 17:53
stl_relops.h
4.49
KB
-rwxrwxrwx
2018-02-14 17:53
stl_set.h
31.43
KB
-rwxrwxrwx
2018-02-14 17:53
stl_stack.h
10.56
KB
-rwxrwxrwx
2018-02-14 17:53
stl_tempbuf.h
8.15
KB
-rwxrwxrwx
2018-02-14 17:53
stl_tree.h
67.86
KB
-rwxrwxrwx
2018-02-14 17:53
stl_uninitialized.h
21.38
KB
-rwxrwxrwx
2018-02-14 17:53
stl_vector.h
52.4
KB
-rwxrwxrwx
2018-02-14 17:53
stream_iterator.h
6.44
KB
-rwxrwxrwx
2018-02-14 17:53
streambuf.tcc
4.81
KB
-rwxrwxrwx
2018-02-14 17:53
streambuf_iterator.h
12.33
KB
-rwxrwxrwx
2018-02-14 17:53
stringfwd.h
2.55
KB
-rwxrwxrwx
2018-02-14 17:53
uniform_int_dist.h
9.73
KB
-rwxrwxrwx
2018-02-14 17:53
unique_ptr.h
24.36
KB
-rwxrwxrwx
2018-02-14 17:53
unordered_map.h
61.39
KB
-rwxrwxrwx
2018-02-14 17:53
unordered_set.h
47.59
KB
-rwxrwxrwx
2018-02-14 17:53
uses_allocator.h
3.68
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_after.h
22.12
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_array.h
21.23
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_array.tcc
7.08
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_before.h
18.08
KB
-rwxrwxrwx
2018-02-14 17:53
vector.tcc
26.42
KB
-rwxrwxrwx
2018-02-14 17:53
Save
Rename
// Functions used by iterators -*- C++ -*- // Copyright (C) 2001-2016 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-1998 * 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 bits/stl_iterator_base_funcs.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{iterator} * * This file contains all of the general iterator-related utility * functions, such as distance() and advance(). */ #ifndef _STL_ITERATOR_BASE_FUNCS_H #define _STL_ITERATOR_BASE_FUNCS_H 1 #pragma GCC system_header #include <bits/concept_check.h> #include <debug/assertions.h> namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_CONTAINER // Forward declaration for the overloads of __distance. template <typename> struct _List_iterator; template <typename> struct _List_const_iterator; _GLIBCXX_END_NAMESPACE_CONTAINER _GLIBCXX_BEGIN_NAMESPACE_VERSION template<typename _InputIterator> inline typename iterator_traits<_InputIterator>::difference_type __distance(_InputIterator __first, _InputIterator __last, input_iterator_tag) { // concept requirements __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) typename iterator_traits<_InputIterator>::difference_type __n = 0; while (__first != __last) { ++__first; ++__n; } return __n; } template<typename _RandomAccessIterator> inline typename iterator_traits<_RandomAccessIterator>::difference_type __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) { // concept requirements __glibcxx_function_requires(_RandomAccessIteratorConcept< _RandomAccessIterator>) return __last - __first; } #if _GLIBCXX_USE_CXX11_ABI // Forward declaration because of the qualified call in distance. template<typename _Tp> ptrdiff_t __distance(_GLIBCXX_STD_C::_List_iterator<_Tp>, _GLIBCXX_STD_C::_List_iterator<_Tp>, input_iterator_tag); template<typename _Tp> ptrdiff_t __distance(_GLIBCXX_STD_C::_List_const_iterator<_Tp>, _GLIBCXX_STD_C::_List_const_iterator<_Tp>, input_iterator_tag); #endif /** * @brief A generalization of pointer arithmetic. * @param __first An input iterator. * @param __last An input iterator. * @return The distance between them. * * Returns @c n such that __first + n == __last. This requires * that @p __last must be reachable from @p __first. Note that @c * n may be negative. * * For random access iterators, this uses their @c + and @c - operations * and are constant time. For other %iterator classes they are linear time. */ template<typename _InputIterator> inline typename iterator_traits<_InputIterator>::difference_type distance(_InputIterator __first, _InputIterator __last) { // concept requirements -- taken care of in __distance return std::__distance(__first, __last, std::__iterator_category(__first)); } template<typename _InputIterator, typename _Distance> inline void __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) { // concept requirements __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) __glibcxx_assert(__n >= 0); while (__n--) ++__i; } template<typename _BidirectionalIterator, typename _Distance> inline void __advance(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) { // concept requirements __glibcxx_function_requires(_BidirectionalIteratorConcept< _BidirectionalIterator>) if (__n > 0) while (__n--) ++__i; else while (__n++) --__i; } template<typename _RandomAccessIterator, typename _Distance> inline void __advance(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) { // concept requirements __glibcxx_function_requires(_RandomAccessIteratorConcept< _RandomAccessIterator>) __i += __n; } /** * @brief A generalization of pointer arithmetic. * @param __i An input iterator. * @param __n The @a delta by which to change @p __i. * @return Nothing. * * This increments @p i by @p n. For bidirectional and random access * iterators, @p __n may be negative, in which case @p __i is decremented. * * For random access iterators, this uses their @c + and @c - operations * and are constant time. For other %iterator classes they are linear time. */ template<typename _InputIterator, typename _Distance> inline void advance(_InputIterator& __i, _Distance __n) { // concept requirements -- taken care of in __advance typename iterator_traits<_InputIterator>::difference_type __d = __n; std::__advance(__i, __d, std::__iterator_category(__i)); } #if __cplusplus >= 201103L template<typename _ForwardIterator> inline _ForwardIterator next(_ForwardIterator __x, typename iterator_traits<_ForwardIterator>::difference_type __n = 1) { // concept requirements __glibcxx_function_requires(_ForwardIteratorConcept< _ForwardIterator>) std::advance(__x, __n); return __x; } template<typename _BidirectionalIterator> inline _BidirectionalIterator prev(_BidirectionalIterator __x, typename iterator_traits<_BidirectionalIterator>::difference_type __n = 1) { // concept requirements __glibcxx_function_requires(_BidirectionalIteratorConcept< _BidirectionalIterator>) std::advance(__x, -__n); return __x; } #endif // C++11 _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _STL_ITERATOR_BASE_FUNCS_H */