System
:
Linux server1.ontime-gulf.com 4.18.0-553.5.1.el8_10.x86_64 #1 SMP Wed Jun 5 09:12:13 EDT 2024 x86_64
Software
:
Apache
Server
:
162.0.230.206
Domains
:
40 Domain
Permission
:
[
drwxr-xr-x
]
:
/
usr
/
include
/
c++
/
8
/
bits
/
216.73.216.38
Select
Submit
Home
Add User
Mailer
About
DBName
DBUser
DBPass
DBHost
WpUser
WpPass
Input e-mail
ACUPOFTEA for mail.ontime-ae.com made by tabagkayu.
Folder Name
File Name
File Content
File
valarray_array.h
// The template and inlines for the -*- C++ -*- internal _Array helper class. // Copyright (C) 1997-2018 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.h * 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_H #define _VALARRAY_ARRAY_H 1 #pragma GCC system_header #include <bits/c++config.h> #include <bits/cpp_type_traits.h> #include <cstdlib> #include <new> namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION // // Helper functions on raw pointers // // We get memory by the old fashion way inline void* __valarray_get_memory(size_t __n) { return operator new(__n); } template<typename _Tp> inline _Tp*__restrict__ __valarray_get_storage(size_t __n) { return static_cast<_Tp*__restrict__> (std::__valarray_get_memory(__n * sizeof(_Tp))); } // Return memory to the system inline void __valarray_release_memory(void* __p) { operator delete(__p); } // Turn a raw-memory into an array of _Tp filled with _Tp() // This is required in 'valarray<T> v(n);' template<typename _Tp, bool> struct _Array_default_ctor { // Please note that this isn't exception safe. But // valarrays aren't required to be exception safe. inline static void _S_do_it(_Tp* __b, _Tp* __e) { while (__b != __e) new(__b++) _Tp(); } }; template<typename _Tp> struct _Array_default_ctor<_Tp, true> { // For fundamental types, it suffices to say 'memset()' inline static void _S_do_it(_Tp* __b, _Tp* __e) { __builtin_memset(__b, 0, (__e - __b) * sizeof(_Tp)); } }; template<typename _Tp> inline void __valarray_default_construct(_Tp* __b, _Tp* __e) { _Array_default_ctor<_Tp, __is_scalar<_Tp>::__value>::_S_do_it(__b, __e); } // Turn a raw-memory into an array of _Tp filled with __t // This is the required in valarray<T> v(n, t). Also // used in valarray<>::resize(). template<typename _Tp, bool> struct _Array_init_ctor { // Please note that this isn't exception safe. But // valarrays aren't required to be exception safe. inline static void _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t) { while (__b != __e) new(__b++) _Tp(__t); } }; template<typename _Tp> struct _Array_init_ctor<_Tp, true> { inline static void _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t) { while (__b != __e) *__b++ = __t; } }; template<typename _Tp> inline void __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t) { _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t); } // // copy-construct raw array [__o, *) from plain array [__b, __e) // We can't just say 'memcpy()' // template<typename _Tp, bool> struct _Array_copy_ctor { // Please note that this isn't exception safe. But // valarrays aren't required to be exception safe. inline static void _S_do_it(const _Tp* __b, const _Tp* __e, _Tp* __restrict__ __o) { while (__b != __e) new(__o++) _Tp(*__b++); } }; template<typename _Tp> struct _Array_copy_ctor<_Tp, true> { inline static void _S_do_it(const _Tp* __b, const _Tp* __e, _Tp* __restrict__ __o) { if (__b) __builtin_memcpy(__o, __b, (__e - __b) * sizeof(_Tp)); } }; template<typename _Tp> inline void __valarray_copy_construct(const _Tp* __b, const _Tp* __e, _Tp* __restrict__ __o) { _Array_copy_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __o); } // copy-construct raw array [__o, *) from strided array __a[<__n : __s>] template<typename _Tp> inline void __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __o) { if (__is_trivial(_Tp)) while (__n--) { *__o++ = *__a; __a += __s; } else while (__n--) { new(__o++) _Tp(*__a); __a += __s; } } // copy-construct raw array [__o, *) from indexed array __a[__i[<__n>]] template<typename _Tp> inline void __valarray_copy_construct (const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __o, size_t __n) { if (__is_trivial(_Tp)) while (__n--) *__o++ = __a[*__i++]; else while (__n--) new (__o++) _Tp(__a[*__i++]); } // Do the necessary cleanup when we're done with arrays. template<typename _Tp> inline void __valarray_destroy_elements(_Tp* __b, _Tp* __e) { if (!__is_trivial(_Tp)) while (__b != __e) { __b->~_Tp(); ++__b; } } // Fill a plain array __a[<__n>] with __t template<typename _Tp> inline void __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) { while (__n--) *__a++ = __t; } // fill strided array __a[<__n-1 : __s>] with __t template<typename _Tp> inline void __valarray_fill(_Tp* __restrict__ __a, size_t __n, size_t __s, const _Tp& __t) { for (size_t __i = 0; __i < __n; ++__i, __a += __s) *__a = __t; } // fill indirect array __a[__i[<__n>]] with __i template<typename _Tp> inline void __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) { for (size_t __j = 0; __j < __n; ++__j, ++__i) __a[*__i] = __t; } // copy plain array __a[<__n>] in __b[<__n>] // For non-fundamental types, it is wrong to say 'memcpy()' template<typename _Tp, bool> struct _Array_copier { inline static void _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) { while(__n--) *__b++ = *__a++; } }; template<typename _Tp> struct _Array_copier<_Tp, true> { inline static void _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) { if (__n != 0) __builtin_memcpy(__b, __a, __n * sizeof (_Tp)); } }; // Copy a plain array __a[<__n>] into a play array __b[<>] template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) { _Array_copier<_Tp, __is_trivial(_Tp)>::_S_do_it(__a, __n, __b); } // Copy strided array __a[<__n : __s>] in plain __b[<__n>] template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) { for (size_t __i = 0; __i < __n; ++__i, ++__b, __a += __s) *__b = *__a; } // Copy a plain array __a[<__n>] into a strided array __b[<__n : __s>] template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) { for (size_t __i = 0; __i < __n; ++__i, ++__a, __b += __s) *__b = *__a; } // Copy strided array __src[<__n : __s1>] into another // strided array __dst[< : __s2>]. Their sizes must match. template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1, _Tp* __restrict__ __dst, size_t __s2) { for (size_t __i = 0; __i < __n; ++__i) __dst[__i * __s2] = __src[__i * __s1]; } // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>] template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) { for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i) *__b = __a[*__i]; } // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]] template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) { for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i) __b[*__i] = *__a; } // Copy the __n first elements of an indexed array __src[<__i>] into // another indexed array __dst[<__j>]. template<typename _Tp> inline void __valarray_copy(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) { for (size_t __k = 0; __k < __n; ++__k) __dst[*__j++] = __src[*__i++]; } // // Compute the sum of elements in range [__f, __l) which must not be empty. // This is a naive algorithm. It suffers from cancelling. // In the future try to specialize for _Tp = float, double, long double // using a more accurate algorithm. // template<typename _Tp> inline _Tp __valarray_sum(const _Tp* __f, const _Tp* __l) { _Tp __r = *__f++; while (__f != __l) __r += *__f++; return __r; } // Compute the product of all elements in range [__f, __l) template<typename _Tp> inline _Tp __valarray_product(const _Tp* __f, const _Tp* __l) { _Tp __r = _Tp(1); while (__f != __l) __r = __r * *__f++; return __r; } // Compute the min/max of an array-expression template<typename _Ta> inline typename _Ta::value_type __valarray_min(const _Ta& __a) { size_t __s = __a.size(); typedef typename _Ta::value_type _Value_type; _Value_type __r = __s == 0 ? _Value_type() : __a[0]; for (size_t __i = 1; __i < __s; ++__i) { _Value_type __t = __a[__i]; if (__t < __r) __r = __t; } return __r; } template<typename _Ta> inline typename _Ta::value_type __valarray_max(const _Ta& __a) { size_t __s = __a.size(); typedef typename _Ta::value_type _Value_type; _Value_type __r = __s == 0 ? _Value_type() : __a[0]; for (size_t __i = 1; __i < __s; ++__i) { _Value_type __t = __a[__i]; if (__t > __r) __r = __t; } return __r; } // // Helper class _Array, first layer of valarray abstraction. // All operations on valarray should be forwarded to this class // whenever possible. -- gdr // template<typename _Tp> struct _Array { explicit _Array(size_t); explicit _Array(_Tp* const __restrict__); explicit _Array(const valarray<_Tp>&); _Array(const _Tp* __restrict__, size_t); _Tp* begin() const; _Tp* const __restrict__ _M_data; }; // Copy-construct plain array __b[<__n>] from indexed array __a[__i[<__n>]] template<typename _Tp> inline void __valarray_copy_construct(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) { std::__valarray_copy_construct(__a._M_data, __i._M_data, __b._M_data, __n); } // Copy-construct plain array __b[<__n>] from strided array __a[<__n : __s>] template<typename _Tp> inline void __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) { std::__valarray_copy_construct(__a._M_data, __n, __s, __b._M_data); } template<typename _Tp> inline void __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t) { std::__valarray_fill(__a._M_data, __n, __t); } template<typename _Tp> inline void __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) { std::__valarray_fill(__a._M_data, __n, __s, __t); } template<typename _Tp> inline void __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) { std::__valarray_fill(__a._M_data, __i._M_data, __n, __t); } // Copy a plain array __a[<__n>] into a play array __b[<>] template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) { std::__valarray_copy(__a._M_data, __n, __b._M_data); } // Copy strided array __a[<__n : __s>] in plain __b[<__n>] template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) { std::__valarray_copy(__a._M_data, __n, __s, __b._M_data); } // Copy a plain array __a[<__n>] into a strided array __b[<__n : __s>] template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) { __valarray_copy(__a._M_data, __b._M_data, __n, __s); } // Copy strided array __src[<__n : __s1>] into another // strided array __dst[< : __s2>]. Their sizes must match. template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1, _Array<_Tp> __b, size_t __s2) { std::__valarray_copy(__a._M_data, __n, __s1, __b._M_data, __s2); } // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>] template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) { std::__valarray_copy(__a._M_data, __i._M_data, __b._M_data, __n); } // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]] template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) { std::__valarray_copy(__a._M_data, __n, __b._M_data, __i._M_data); } // Copy the __n first elements of an indexed array __src[<__i>] into // another indexed array __dst[<__j>]. template<typename _Tp> inline void __valarray_copy(_Array<_Tp> __src, size_t __n, _Array<size_t> __i, _Array<_Tp> __dst, _Array<size_t> __j) { std::__valarray_copy(__src._M_data, __n, __i._M_data, __dst._M_data, __j._M_data); } template<typename _Tp> inline _Array<_Tp>::_Array(size_t __n) : _M_data(__valarray_get_storage<_Tp>(__n)) { std::__valarray_default_construct(_M_data, _M_data + __n); } template<typename _Tp> inline _Array<_Tp>::_Array(_Tp* const __restrict__ __p) : _M_data (__p) {} template<typename _Tp> inline _Array<_Tp>::_Array(const valarray<_Tp>& __v) : _M_data (__v._M_data) {} template<typename _Tp> inline _Array<_Tp>::_Array(const _Tp* __restrict__ __b, size_t __s) : _M_data(__valarray_get_storage<_Tp>(__s)) { std::__valarray_copy_construct(__b, __s, _M_data); } template<typename _Tp> inline _Tp* _Array<_Tp>::begin () const { return _M_data; } #define _DEFINE_ARRAY_FUNCTION(_Op, _Name) \ template<typename _Tp> \ inline void \ _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, const _Tp& __t) \ { \ for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; ++__p) \ *__p _Op##= __t; \ } \ \ template<typename _Tp> \ inline void \ _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) \ { \ _Tp* __p = __a._M_data; \ for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \ *__p _Op##= *__q; \ } \ \ template<typename _Tp, class _Dom> \ void \ _Array_augmented_##_Name(_Array<_Tp> __a, \ const _Expr<_Dom, _Tp>& __e, size_t __n) \ { \ _Tp* __p(__a._M_data); \ for (size_t __i = 0; __i < __n; ++__i, ++__p) \ *__p _Op##= __e[__i]; \ } \ \ template<typename _Tp> \ inline void \ _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, size_t __s, \ _Array<_Tp> __b) \ { \ _Tp* __q(__b._M_data); \ for (_Tp* __p = __a._M_data; __p < __a._M_data + __s * __n; \ __p += __s, ++__q) \ *__p _Op##= *__q; \ } \ \ template<typename _Tp> \ inline void \ _Array_augmented_##_Name(_Array<_Tp> __a, _Array<_Tp> __b, \ size_t __n, size_t __s) \ { \ _Tp* __q(__b._M_data); \ for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; \ ++__p, __q += __s) \ *__p _Op##= *__q; \ } \ \ template<typename _Tp, class _Dom> \ void \ _Array_augmented_##_Name(_Array<_Tp> __a, size_t __s, \ const _Expr<_Dom, _Tp>& __e, size_t __n) \ { \ _Tp* __p(__a._M_data); \ for (size_t __i = 0; __i < __n; ++__i, __p += __s) \ *__p _Op##= __e[__i]; \ } \ \ template<typename _Tp> \ inline void \ _Array_augmented_##_Name(_Array<_Tp> __a, _Array<size_t> __i, \ _Array<_Tp> __b, size_t __n) \ { \ _Tp* __q(__b._M_data); \ for (size_t* __j = __i._M_data; __j < __i._M_data + __n; \ ++__j, ++__q) \ __a._M_data[*__j] _Op##= *__q; \ } \ \ template<typename _Tp> \ inline void \ _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, \ _Array<_Tp> __b, _Array<size_t> __i) \ { \ _Tp* __p(__a._M_data); \ for (size_t* __j = __i._M_data; __j<__i._M_data + __n; \ ++__j, ++__p) \ *__p _Op##= __b._M_data[*__j]; \ } \ \ template<typename _Tp, class _Dom> \ void \ _Array_augmented_##_Name(_Array<_Tp> __a, _Array<size_t> __i, \ const _Expr<_Dom, _Tp>& __e, size_t __n) \ { \ size_t* __j(__i._M_data); \ for (size_t __k = 0; __k<__n; ++__k, ++__j) \ __a._M_data[*__j] _Op##= __e[__k]; \ } \ \ template<typename _Tp> \ void \ _Array_augmented_##_Name(_Array<_Tp> __a, _Array<bool> __m, \ _Array<_Tp> __b, size_t __n) \ { \ bool* __ok(__m._M_data); \ _Tp* __p(__a._M_data); \ for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; \ ++__q, ++__ok, ++__p) \ { \ while (! *__ok) \ { \ ++__ok; \ ++__p; \ } \ *__p _Op##= *__q; \ } \ } \ \ template<typename _Tp> \ void \ _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, \ _Array<_Tp> __b, _Array<bool> __m) \ { \ bool* __ok(__m._M_data); \ _Tp* __q(__b._M_data); \ for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; \ ++__p, ++__ok, ++__q) \ { \ while (! *__ok) \ { \ ++__ok; \ ++__q; \ } \ *__p _Op##= *__q; \ } \ } \ \ template<typename _Tp, class _Dom> \ void \ _Array_augmented_##_Name(_Array<_Tp> __a, _Array<bool> __m, \ const _Expr<_Dom, _Tp>& __e, size_t __n) \ { \ 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 _Op##= __e[__i]; \ } \ } _DEFINE_ARRAY_FUNCTION(+, __plus) _DEFINE_ARRAY_FUNCTION(-, __minus) _DEFINE_ARRAY_FUNCTION(*, __multiplies) _DEFINE_ARRAY_FUNCTION(/, __divides) _DEFINE_ARRAY_FUNCTION(%, __modulus) _DEFINE_ARRAY_FUNCTION(^, __bitwise_xor) _DEFINE_ARRAY_FUNCTION(|, __bitwise_or) _DEFINE_ARRAY_FUNCTION(&, __bitwise_and) _DEFINE_ARRAY_FUNCTION(<<, __shift_left) _DEFINE_ARRAY_FUNCTION(>>, __shift_right) #undef _DEFINE_ARRAY_FUNCTION _GLIBCXX_END_NAMESPACE_VERSION } // namespace # include <bits/valarray_array.tcc> #endif /* _ARRAY_H */
New name for
Are you sure will delete
?
New date for
New perm for
Name
Type
Size
Permission
Last Modified
Actions
.
DIR
-
drwxr-xr-x
2025-08-28 10:58:25
..
DIR
-
drwxr-xr-x
2025-08-28 10:58:25
algorithmfwd.h
text/x-c
21.23 KB
-rw-r--r--
2025-08-26 09:45:00
alloc_traits.h
text/x-c
19.6 KB
-rw-r--r--
2025-08-26 09:45:00
allocated_ptr.h
text/plain
3.22 KB
-rw-r--r--
2025-08-26 09:45:00
allocator.h
text/x-c
7.39 KB
-rw-r--r--
2025-08-26 09:45:00
atomic_base.h
text/x-c
23.28 KB
-rw-r--r--
2025-08-26 09:45:00
atomic_futex.h
text/x-c
9.35 KB
-rw-r--r--
2025-08-26 09:45:00
atomic_lockfree_defines.h
text/plain
2.2 KB
-rw-r--r--
2025-08-26 09:45:07
basic_ios.h
text/x-c
15.7 KB
-rw-r--r--
2025-08-26 09:45:00
basic_ios.tcc
text/plain
5.94 KB
-rw-r--r--
2025-08-26 09:45:00
basic_string.h
text/x-c
237.01 KB
-rw-r--r--
2025-08-26 09:45:00
basic_string.tcc
text/x-c
52.5 KB
-rw-r--r--
2025-08-26 09:45:00
boost_concept_check.h
text/x-c++
26.52 KB
-rw-r--r--
2025-08-26 09:45:00
c++0x_warning.h
text/plain
1.44 KB
-rw-r--r--
2025-08-26 09:45:00
char_traits.h
text/x-c
20.42 KB
-rw-r--r--
2025-08-26 09:45:00
codecvt.h
text/plain
20.79 KB
-rw-r--r--
2025-08-26 09:45:00
concept_check.h
text/x-c
3.34 KB
-rw-r--r--
2025-08-26 09:45:00
cpp_type_traits.h
text/x-c
9.56 KB
-rw-r--r--
2025-08-26 09:45:00
cxxabi_forced.h
text/plain
1.77 KB
-rw-r--r--
2025-08-26 09:45:07
cxxabi_init_exception.h
text/x-c
2.17 KB
-rw-r--r--
2025-08-26 09:45:07
deque.tcc
text/plain
33.32 KB
-rw-r--r--
2025-08-26 09:45:00
enable_special_members.h
text/plain
12.1 KB
-rw-r--r--
2025-08-26 09:45:00
exception.h
text/x-c
2.23 KB
-rw-r--r--
2025-08-26 09:45:07
exception_defines.h
text/plain
1.61 KB
-rw-r--r--
2025-08-26 09:45:07
exception_ptr.h
text/x-c
5.84 KB
-rw-r--r--
2025-08-26 09:45:07
forward_list.h
text/x-c
47.77 KB
-rw-r--r--
2025-08-26 09:45:00
forward_list.tcc
text/plain
12.86 KB
-rw-r--r--
2025-08-26 09:45:00
fs_dir.h
text/plain
14.38 KB
-rw-r--r--
2025-08-26 09:45:00
fs_fwd.h
text/x-c
10.04 KB
-rw-r--r--
2025-08-26 09:45:00
fs_ops.h
text/x-c
9.5 KB
-rw-r--r--
2025-08-26 09:45:00
fs_path.h
text/x-c
32.12 KB
-rw-r--r--
2025-08-26 09:45:00
fstream.tcc
text/x-c
32.03 KB
-rw-r--r--
2025-08-26 09:45:00
functexcept.h
text/x-c
3.18 KB
-rw-r--r--
2025-08-26 09:45:00
functional_hash.h
text/x-c
8.04 KB
-rw-r--r--
2025-08-26 09:45:00
gslice.h
text/plain
5.39 KB
-rw-r--r--
2025-08-26 09:45:00
gslice_array.h
text/plain
7.59 KB
-rw-r--r--
2025-08-26 09:45:00
hash_bytes.h
text/x-c
2.1 KB
-rw-r--r--
2025-08-26 09:45:07
hashtable.h
text/x-c
72.06 KB
-rw-r--r--
2025-08-26 09:45:00
hashtable_policy.h
text/x-c
66.38 KB
-rw-r--r--
2025-08-26 09:45:00
indirect_array.h
text/plain
7.68 KB
-rw-r--r--
2025-08-26 09:45:00
invoke.h
text/x-c
3.57 KB
-rw-r--r--
2025-08-26 09:45:00
ios_base.h
text/x-c
30.3 KB
-rw-r--r--
2025-08-26 09:45:00
istream.tcc
text/x-c
30.36 KB
-rw-r--r--
2025-08-26 09:45:00
list.tcc
text/plain
15.6 KB
-rw-r--r--
2025-08-26 09:45:00
locale_classes.h
text/x-c
24.31 KB
-rw-r--r--
2025-08-26 09:45:00
locale_classes.tcc
text/plain
8.18 KB
-rw-r--r--
2025-08-26 09:45:00
locale_conv.h
text/x-c
15.72 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets.h
text/x-c
90.16 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets.tcc
text/plain
38.62 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets_nonio.h
text/x-c
67.36 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets_nonio.tcc
text/plain
44.22 KB
-rw-r--r--
2025-08-26 09:45:00
localefwd.h
text/x-c
5.51 KB
-rw-r--r--
2025-08-26 09:45:00
mask_array.h
text/plain
7.42 KB
-rw-r--r--
2025-08-26 09:45:00
memoryfwd.h
text/x-c
2.4 KB
-rw-r--r--
2025-08-26 09:45:00
move.h
text/x-c
6.38 KB
-rw-r--r--
2025-08-26 09:45:00
nested_exception.h
text/x-c
4.69 KB
-rw-r--r--
2025-08-26 09:45:07
node_handle.h
text/x-c
8.02 KB
-rw-r--r--
2025-08-26 09:45:00
ostream.tcc
text/x-c
12.03 KB
-rw-r--r--
2025-08-26 09:45:00
ostream_insert.h
text/x-c
3.91 KB
-rw-r--r--
2025-08-26 09:45:00
parse_numbers.h
text/x-c
7.76 KB
-rw-r--r--
2025-08-26 09:45:00
postypes.h
text/x-c
8.02 KB
-rw-r--r--
2025-08-26 09:45:00
predefined_ops.h
text/plain
8.87 KB
-rw-r--r--
2025-08-26 09:45:00
ptr_traits.h
text/x-c
6.47 KB
-rw-r--r--
2025-08-26 09:45:00
quoted_string.h
text/x-c
4.93 KB
-rw-r--r--
2025-08-26 09:45:00
random.h
text/x-c
171.14 KB
-rw-r--r--
2025-08-26 09:45:00
random.tcc
text/x-c
103.12 KB
-rw-r--r--
2025-08-26 09:45:00
range_access.h
text/x-c
9.79 KB
-rw-r--r--
2025-08-26 09:45:00
refwrap.h
text/x-c
11.61 KB
-rw-r--r--
2025-08-26 09:45:00
regex.h
text/plain
95.12 KB
-rw-r--r--
2025-08-26 09:45:00
regex.tcc
text/plain
16.18 KB
-rw-r--r--
2025-08-26 09:45:00
regex_automaton.h
text/plain
10.47 KB
-rw-r--r--
2025-08-26 09:45:00
regex_automaton.tcc
text/x-Algol68
7.65 KB
-rw-r--r--
2025-08-26 09:45:00
regex_compiler.h
text/plain
17.63 KB
-rw-r--r--
2025-08-26 09:45:00
regex_compiler.tcc
text/plain
18.84 KB
-rw-r--r--
2025-08-26 09:45:00
regex_constants.h
text/plain
14.36 KB
-rw-r--r--
2025-08-26 09:45:00
regex_error.h
text/plain
4.79 KB
-rw-r--r--
2025-08-26 09:45:00
regex_executor.h
text/x-c
7.31 KB
-rw-r--r--
2025-08-26 09:45:00
regex_executor.tcc
text/plain
18.4 KB
-rw-r--r--
2025-08-26 09:45:00
regex_scanner.h
text/x-c
6.92 KB
-rw-r--r--
2025-08-26 09:45:00
regex_scanner.tcc
text/plain
14.66 KB
-rw-r--r--
2025-08-26 09:45:00
shared_ptr.h
text/x-c
22.88 KB
-rw-r--r--
2025-08-26 09:45:00
shared_ptr_atomic.h
text/x-c
9.54 KB
-rw-r--r--
2025-08-26 09:45:00
shared_ptr_base.h
text/x-c
53.01 KB
-rw-r--r--
2025-08-26 09:45:00
slice_array.h
text/plain
9.13 KB
-rw-r--r--
2025-08-26 09:45:00
specfun.h
text/x-c
45.95 KB
-rw-r--r--
2025-08-26 09:45:00
sstream.tcc
text/plain
9.9 KB
-rw-r--r--
2025-08-26 09:45:00
std_abs.h
text/x-c
3.19 KB
-rw-r--r--
2025-08-26 09:45:00
std_function.h
text/x-c
22.71 KB
-rw-r--r--
2025-08-26 09:45:00
std_mutex.h
text/x-c
9.08 KB
-rw-r--r--
2025-08-26 09:45:00
stl_algo.h
text/x-c
209.27 KB
-rw-r--r--
2025-08-26 09:45:00
stl_algobase.h
text/x-c
49.31 KB
-rw-r--r--
2025-08-26 09:45:00
stl_bvector.h
text/x-c
32.94 KB
-rw-r--r--
2025-08-26 09:45:00
stl_construct.h
text/x-c
7.22 KB
-rw-r--r--
2025-08-26 09:45:00
stl_deque.h
text/x-c
76.73 KB
-rw-r--r--
2025-08-26 09:45:00
stl_function.h
text/x-c
40.77 KB
-rw-r--r--
2025-08-26 09:45:00
stl_heap.h
text/x-c
19.73 KB
-rw-r--r--
2025-08-26 09:45:00
stl_iterator.h
text/x-c
41.3 KB
-rw-r--r--
2025-08-26 09:45:00
stl_iterator_base_funcs.h
text/x-c
7.99 KB
-rw-r--r--
2025-08-26 09:45:00
stl_iterator_base_types.h
text/x-c
8.48 KB
-rw-r--r--
2025-08-26 09:45:00
stl_list.h
text/x-c
65.97 KB
-rw-r--r--
2025-08-26 09:45:00
stl_map.h
text/x-c
51.55 KB
-rw-r--r--
2025-08-26 09:45:00
stl_multimap.h
text/x-c
40.58 KB
-rw-r--r--
2025-08-26 09:45:00
stl_multiset.h
text/x-c
34.97 KB
-rw-r--r--
2025-08-26 09:45:00
stl_numeric.h
text/x-c
13.51 KB
-rw-r--r--
2025-08-26 09:45:00
stl_pair.h
text/x-c
18.21 KB
-rw-r--r--
2025-08-26 09:45:00
stl_queue.h
text/x-c
23.51 KB
-rw-r--r--
2025-08-26 09:45:00
stl_raw_storage_iter.h
text/plain
3.74 KB
-rw-r--r--
2025-08-26 09:45:00
stl_relops.h
text/plain
4.49 KB
-rw-r--r--
2025-08-26 09:45:00
stl_set.h
text/x-c
35.28 KB
-rw-r--r--
2025-08-26 09:45:00
stl_stack.h
text/x-c
11.66 KB
-rw-r--r--
2025-08-26 09:45:00
stl_tempbuf.h
text/x-c
8.15 KB
-rw-r--r--
2025-08-26 09:45:00
stl_tree.h
text/x-c
73.15 KB
-rw-r--r--
2025-08-26 09:45:00
stl_uninitialized.h
text/x-c
27.06 KB
-rw-r--r--
2025-08-26 09:45:00
stl_vector.h
text/x-c
59.12 KB
-rw-r--r--
2025-08-26 09:45:00
stream_iterator.h
text/x-c
6.5 KB
-rw-r--r--
2025-08-26 09:45:00
streambuf.tcc
text/plain
4.81 KB
-rw-r--r--
2025-08-26 09:45:00
streambuf_iterator.h
text/x-c
13.44 KB
-rw-r--r--
2025-08-26 09:45:00
string_view.tcc
text/plain
6.54 KB
-rw-r--r--
2025-08-26 09:45:00
stringfwd.h
text/x-c
2.55 KB
-rw-r--r--
2025-08-26 09:45:00
uniform_int_dist.h
text/x-c
9.84 KB
-rw-r--r--
2025-08-26 09:45:00
unique_ptr.h
text/x-c
25.38 KB
-rw-r--r--
2025-08-26 09:45:00
unordered_map.h
text/html
73.58 KB
-rw-r--r--
2025-08-26 09:45:00
unordered_set.h
text/html
57.76 KB
-rw-r--r--
2025-08-26 09:45:00
uses_allocator.h
text/x-c
6.37 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_after.h
text/plain
22.12 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_array.h
text/x-c
21.3 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_array.tcc
text/plain
7.08 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_before.h
text/x-c
18.08 KB
-rw-r--r--
2025-08-26 09:45:00
vector.tcc
text/plain
28.95 KB
-rw-r--r--
2025-08-26 09:45:00
~ ACUPOFTEA - mail.ontime-ae.com