OXIESEC PANEL
- Current Dir:
/
/
usr
/
include
/
c++
/
7
/
bits
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
01/31/2023 12:38:15 PM
rwxr-xr-x
📄
algorithmfwd.h
21.23 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
alloc_traits.h
19.13 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
allocated_ptr.h
3.43 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
allocator.h
6.73 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
atomic_base.h
23.28 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
atomic_futex.h
9.35 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
atomic_lockfree_defines.h
2.2 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_ios.h
15.7 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_ios.tcc
5.94 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_string.h
235.15 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_string.tcc
52.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
boost_concept_check.h
26.41 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
c++0x_warning.h
1.44 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
char_traits.h
20.26 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
codecvt.h
20.8 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
concept_check.h
3.34 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
cpp_type_traits.h
9.37 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
cxxabi_forced.h
1.77 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
cxxabi_init_exception.h
2.17 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
deque.tcc
33.26 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
enable_special_members.h
12.1 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
exception.h
2.23 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
exception_defines.h
1.61 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
exception_ptr.h
6.31 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
forward_list.h
47.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
forward_list.tcc
14.68 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
fstream.tcc
32.14 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
functexcept.h
3.18 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
functional_hash.h
8 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
gslice.h
5.39 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
gslice_array.h
7.59 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
hash_bytes.h
2.1 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
hashtable.h
71.56 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
hashtable_policy.h
65.47 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
indirect_array.h
7.68 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
invoke.h
3.57 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ios_base.h
30.22 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
istream.tcc
30.36 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
list.tcc
15.54 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_classes.h
24.31 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_classes.tcc
8.18 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_conv.h
15.7 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets.h
89.98 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets.tcc
38.64 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets_nonio.h
67.33 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets_nonio.tcc
44.46 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
localefwd.h
5.51 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
mask_array.h
7.42 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
memoryfwd.h
2.36 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
move.h
6.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
nested_exception.h
4.66 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
node_handle.h
7.97 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ostream.tcc
12.03 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ostream_insert.h
3.91 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
parse_numbers.h
7.84 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
postypes.h
8.02 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
predefined_ops.h
8.87 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ptr_traits.h
4.75 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
quoted_string.h
4.47 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
random.h
171.19 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
random.tcc
103.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
range_access.h
9.75 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
refwrap.h
13.48 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex.h
95.9 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex.tcc
16.1 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_automaton.h
10.47 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_automaton.tcc
7.65 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_compiler.h
16.79 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_compiler.tcc
18.46 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_constants.h
14.36 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_error.h
4.85 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_executor.h
7.31 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_executor.tcc
16.91 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_scanner.h
6.92 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_scanner.tcc
14.66 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
shared_ptr.h
22.37 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
shared_ptr_atomic.h
9.54 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
shared_ptr_base.h
52.54 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
slice_array.h
9.13 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
specfun.h
44.03 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
sstream.tcc
9.88 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
std_abs.h
3.21 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
std_function.h
23.41 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
std_mutex.h
9.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_algo.h
208.85 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_algobase.h
49.22 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_bvector.h
33.03 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_construct.h
7.22 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_deque.h
75.95 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_function.h
32.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_heap.h
19.73 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_iterator.h
40.77 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_iterator_base_funcs.h
7.88 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_iterator_base_types.h
8.48 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_list.h
63.65 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_map.h
50.02 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_multimap.h
39 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_multiset.h
33.26 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_numeric.h
13.51 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_pair.h
18.21 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_queue.h
21.61 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_raw_storage_iter.h
3.74 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_relops.h
4.49 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_set.h
33.63 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_stack.h
11.18 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_tempbuf.h
8.15 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_tree.h
73.07 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_uninitialized.h
27 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_vector.h
54.33 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stream_iterator.h
6.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
streambuf.tcc
4.81 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
streambuf_iterator.h
12.33 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
string_view.tcc
6.48 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stringfwd.h
2.55 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
uniform_int_dist.h
9.91 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
unique_ptr.h
24.88 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
unordered_map.h
67.04 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
unordered_set.h
52.56 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
uses_allocator.h
6.23 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_after.h
22.12 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_array.h
21.3 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_array.tcc
7.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_before.h
18.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
vector.tcc
26.95 KB
12/04/2019 02:25:41 PM
rw-r--r--
Editing: valarray_array.tcc
Close
// The template and inlines for the -*- C++ -*- internal _Array helper class. // Copyright (C) 1997-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 bits/valarray_array.tcc * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{valarray} */ // Written by Gabriel Dos Reis <Gabriel.Dos-Reis@DPTMaths.ENS-Cachan.Fr> #ifndef _VALARRAY_ARRAY_TCC #define _VALARRAY_ARRAY_TCC 1 namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION template<typename _Tp> void __valarray_fill(_Array<_Tp> __a, size_t __n, _Array<bool> __m, const _Tp& __t) { _Tp* __p = __a._M_data; bool* __ok (__m._M_data); for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) { while (!*__ok) { ++__ok; ++__p; } *__p = __t; } } // Copy n elements of a into consecutive elements of b. When m is // false, the corresponding element of a is skipped. m must contain // at least n true elements. a must contain at least n elements and // enough elements to match up with m through the nth true element // of m. I.e. if n is 10, m has 15 elements with 5 false followed // by 10 true, a must have 15 elements. template<typename _Tp> void __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b, size_t __n) { _Tp* __p (__a._M_data); bool* __ok (__m._M_data); for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__q, ++__ok, ++__p) { while (! *__ok) { ++__ok; ++__p; } *__q = *__p; } } // Copy n consecutive elements from a into elements of b. Elements // of b are skipped if the corresponding element of m is false. m // must contain at least n true elements. b must have at least as // many elements as the index of the nth true element of m. I.e. if // m has 15 elements with 5 false followed by 10 true, b must have // at least 15 elements. template<typename _Tp> void __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<bool> __m) { _Tp* __q (__b._M_data); bool* __ok (__m._M_data); for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; ++__p, ++__ok, ++__q) { while (! *__ok) { ++__ok; ++__q; } *__q = *__p; } } // Copy n elements from a into elements of b. Elements of a are // skipped if the corresponding element of m is false. Elements of // b are skipped if the corresponding element of k is false. m and // k must contain at least n true elements. a and b must have at // least as many elements as the index of the nth true element of m. template<typename _Tp> void __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, size_t __n, _Array<_Tp> __b, _Array<bool> __k) { _Tp* __p (__a._M_data); _Tp* __q (__b._M_data); bool* __srcok (__m._M_data); bool* __dstok (__k._M_data); for (size_t __i = 0; __i < __n; ++__srcok, ++__p, ++__dstok, ++__q, ++__i) { while (! *__srcok) { ++__srcok; ++__p; } while (! *__dstok) { ++__dstok; ++__q; } *__q = *__p; } } // Copy n consecutive elements of e into consecutive elements of a. // I.e. a[i] = e[i]. template<typename _Tp, class _Dom> void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) { _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, ++__p) *__p = __e[__i]; } // Copy n consecutive elements of e into elements of a using stride // s. I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2]. template<typename _Tp, class _Dom> void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, size_t __s) { _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, __p += __s) *__p = __e[__i]; } // Copy n consecutive elements of e into elements of a indexed by // contents of i. I.e., a[i[0]] = e[0]. template<typename _Tp, class _Dom> void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array<size_t> __i) { size_t* __j (__i._M_data); for (size_t __k = 0; __k < __n; ++__k, ++__j) __a._M_data[*__j] = __e[__k]; } // Copy n elements of e indexed by contents of f into elements of a // indexed by contents of i. I.e., a[i[0]] = e[f[0]]. template<typename _Tp> void __valarray_copy(_Array<_Tp> __e, _Array<size_t> __f, size_t __n, _Array<_Tp> __a, _Array<size_t> __i) { size_t* __g (__f._M_data); size_t* __j (__i._M_data); for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) __a._M_data[*__j] = __e._M_data[*__g]; } // Copy n consecutive elements of e into elements of a. Elements of // a are skipped if the corresponding element of m is false. m must // have at least n true elements and a must have at least as many // elements as the index of the nth true element of m. I.e. if m // has 5 false followed by 10 true elements and n == 10, a must have // at least 15 elements. template<typename _Tp, class _Dom> void __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array<bool> __m) { bool* __ok (__m._M_data); _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p) { while (! *__ok) { ++__ok; ++__p; } *__p = __e[__i]; } } template<typename _Tp, class _Dom> void __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) { _Tp* __p (__a._M_data); for (size_t __i = 0; __i < __n; ++__i, ++__p) new (__p) _Tp(__e[__i]); } template<typename _Tp> void __valarray_copy_construct(_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b, size_t __n) { _Tp* __p (__a._M_data); bool* __ok (__m._M_data); for (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p) { while (! *__ok) { ++__ok; ++__p; } new (__q) _Tp(*__p); } } _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _VALARRAY_ARRAY_TCC */