Login
[x]
Log in using an account from:
Fedora Account System
Red Hat Associate
Red Hat Customer
Or login using a Red Hat Bugzilla account
Forgot Password
Login:
Hide Forgot
Create an Account
Red Hat Bugzilla – Attachment 589813 Details for
Bug 829247
Internal compiler error compiling C++ code
[?]
New
Simple Search
Advanced Search
My Links
Browse
Requests
Reports
Current State
Search
Tabular reports
Graphical reports
Duplicates
Other Reports
User Changes
Plotly Reports
Bug Status
Bug Severity
Non-Defaults
|
Product Dashboard
Help
Page Help!
Bug Writing Guidelines
What's new
Browser Support Policy
5.0.4.rh83 Release notes
FAQ
Guides index
User guide
Web Services
Contact
Legal
This site requires JavaScript to be enabled to function correctly, please enable it.
C++ source code compilede with regular C++98
ccu2bGoR.out (text/plain), 1.09 MB, created by
Thiago Macieira
on 2012-06-06 10:17:16 UTC
(
hide
)
Description:
C++ source code compilede with regular C++98
Filename:
MIME Type:
Creator:
Thiago Macieira
Created:
2012-06-06 10:17:16 UTC
Size:
1.09 MB
patch
obsolete
>// /usr/libexec/gcc/x86_64-redhat-linux/4.7.0/cc1plus -quiet -I ../../../../../../src/qt/qt5/qtbase/mkspecs/linux-g++-optimised -I ../../../../../../src/qt/creator/src/libs/languageutils -I ../../../../qt5/qtbase/include/QtCore -I ../../../../qt5/qtbase/include/QtGui -I ../../../../qt5/qtbase/include/QtTest -I ../../../../qt5/qtbase/include/QtConcurrent -I ../../../../qt5/qtbase/include/QtWidgets -I ../../../../qt5/qtbase/include -I ../../../src -I ../../../../../../src/qt/creator/src/libs -I /home/thiago/src/qt/creator/tools -I ../../../../../../src/qt/creator/src/plugins -I ../../../../../../src/qt/creator/src/libs -I .moc/debug-shared -I . -D_GNU_SOURCE -D _REENTRANT -D QT_CREATOR -D WITH_TESTS -D IDE_LIBRARY_BASENAME="lib" -D QT_NO_CAST_TO_ASCII -D QT_USE_FAST_OPERATOR_PLUS -D QT_USE_FAST_CONCATENATION -D QT_DISABLE_DEPRECATED_BEFORE=0x040900 -D LANGUAGEUTILS_BUILD_DIR -D QT_WIDGETS_LIB -D QT_CONCURRENT_LIB -D QT_TESTLIB_LIB -D QT_TESTCASE_BUILDDIR="/home/thiago/obj/qt/creator-qt5/src/libs/languageutils" -D QT_GUI_LIB -D QT_CORE_LIB ../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.cpp -quiet -dumpbase fakemetaobject.cpp -mtune=generic -march=x86-64 -auxbase-strip .obj/debug-shared/fakemetaobject.o -O2 -fPIC -o - -frandom-seed=0 ># 1 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.cpp" ># 1 "<command-line>" ># 1 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.cpp" ># 33 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.cpp" ># 1 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 1 ># 36 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" ># 1 "../../../../../../src/qt/creator/src/libs/languageutils/languageutils_global.h" 1 ># 36 "../../../../../../src/qt/creator/src/libs/languageutils/languageutils_global.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 150 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 3 4 >typedef long int ptrdiff_t; ># 213 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 3 4 >typedef long unsigned int size_t; ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 62 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qconfig.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../src/corelib/global/qconfig.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qconfig.h" 2 ># 63 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 > > > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qsystemdetection.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qsystemdetection.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qsystemdetection.h" 2 ># 71 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qcompilerdetection.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qcompilerdetection.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qcompilerdetection.h" 2 ># 72 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qprocessordetection.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qprocessordetection.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qprocessordetection.h" 2 ># 73 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 1 3 ># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 3 > ># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 1 3 ># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 3 > ># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 3 ># 70 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++config.h" 1 3 > > ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 4 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++config.h" 2 3 ># 1815 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++config.h" 3 >namespace std >{ > typedef long unsigned int size_t; > typedef long int ptrdiff_t; > > > > >} ># 2058 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++config.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/os_defines.h" 1 3 ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/os_defines.h" 3 ># 1 "/usr/include/features.h" 1 3 4 ># 362 "/usr/include/features.h" 3 4 ># 1 "/usr/include/sys/cdefs.h" 1 3 4 ># 390 "/usr/include/sys/cdefs.h" 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 391 "/usr/include/sys/cdefs.h" 2 3 4 ># 363 "/usr/include/features.h" 2 3 4 ># 386 "/usr/include/features.h" 3 4 ># 1 "/usr/include/gnu/stubs.h" 1 3 4 > > > ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 5 "/usr/include/gnu/stubs.h" 2 3 4 > > > > ># 1 "/usr/include/gnu/stubs-64.h" 1 3 4 ># 10 "/usr/include/gnu/stubs.h" 2 3 4 ># 387 "/usr/include/features.h" 2 3 4 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/os_defines.h" 2 3 ># 2059 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++config.h" 2 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/cpu_defines.h" 1 3 ># 2062 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++config.h" 2 3 ># 71 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_relops.h" 1 3 ># 68 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_relops.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > namespace rel_ops > { > ># 86 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_relops.h" 3 > template <class _Tp> > inline bool > operator!=(const _Tp& __x, const _Tp& __y) > { return !(__x == __y); } ># 99 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_relops.h" 3 > template <class _Tp> > inline bool > operator>(const _Tp& __x, const _Tp& __y) > { return __y < __x; } ># 112 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_relops.h" 3 > template <class _Tp> > inline bool > operator<=(const _Tp& __x, const _Tp& __y) > { return !(__y < __x); } ># 125 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_relops.h" 3 > template <class _Tp> > inline bool > operator>=(const _Tp& __x, const _Tp& __y) > { return !(__x < __y); } > > > } > >} ># 72 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h" 1 3 ># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/move.h" 1 3 ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/move.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/concept_check.h" 1 3 ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/concept_check.h" 3 > ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/concept_check.h" 3 ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/move.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > > > > > template<typename _Tp> > inline _Tp* > __addressof(_Tp& __r) > { > return reinterpret_cast<_Tp*> > (&const_cast<char&>(reinterpret_cast<const volatile char&>(__r))); > } > > >} ># 150 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/move.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 165 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/move.h" 3 > template<typename _Tp> > inline void > swap(_Tp& __a, _Tp& __b) > > > > > { > > > > _Tp __tmp = (__a); > __a = (__b); > __b = (__tmp); > } > > > > > template<typename _Tp, size_t _Nm> > inline void > swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) > > > > { > for (size_t __n = 0; __n < _Nm; ++__n) > swap(__a[__n], __b[__n]); > } > > > >} ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h" 2 3 > > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 87 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h" 3 > template<class _T1, class _T2> > struct pair > { > typedef _T1 first_type; > typedef _T2 second_type; > > _T1 first; > _T2 second; > > > > > > pair() > : first(), second() { } > > > pair(const _T1& __a, const _T2& __b) > : first(__a), second(__b) { } > > > > template<class _U1, class _U2> > pair(const pair<_U1, _U2>& __p) > : first(__p.first), second(__p.second) { } ># 207 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h" 3 > }; > > > template<class _T1, class _T2> > inline bool > operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) > { return __x.first == __y.first && __x.second == __y.second; } > > > template<class _T1, class _T2> > inline bool > operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) > { return __x.first < __y.first > || (!(__y.first < __x.first) && __x.second < __y.second); } > > > template<class _T1, class _T2> > inline bool > operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) > { return !(__x == __y); } > > > template<class _T1, class _T2> > inline bool > operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) > { return __y < __x; } > > > template<class _T1, class _T2> > inline bool > operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) > { return !(__y < __x); } > > > template<class _T1, class _T2> > inline bool > operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) > { return !(__x < __y); } ># 282 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h" 3 > template<class _T1, class _T2> > inline pair<_T1, _T2> > make_pair(_T1 __x, _T2 __y) > { return pair<_T1, _T2>(__x, __y); } > > > >} ># 73 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/utility" 2 3 ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 1 3 ># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/functexcept.h" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/functexcept.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/exception_defines.h" 1 3 ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/functexcept.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > void > __throw_bad_exception(void) __attribute__((__noreturn__)); > > > void > __throw_bad_alloc(void) __attribute__((__noreturn__)); > > > void > __throw_bad_cast(void) __attribute__((__noreturn__)); > > void > __throw_bad_typeid(void) __attribute__((__noreturn__)); > > > void > __throw_logic_error(const char*) __attribute__((__noreturn__)); > > void > __throw_domain_error(const char*) __attribute__((__noreturn__)); > > void > __throw_invalid_argument(const char*) __attribute__((__noreturn__)); > > void > __throw_length_error(const char*) __attribute__((__noreturn__)); > > void > __throw_out_of_range(const char*) __attribute__((__noreturn__)); > > void > __throw_runtime_error(const char*) __attribute__((__noreturn__)); > > void > __throw_range_error(const char*) __attribute__((__noreturn__)); > > void > __throw_overflow_error(const char*) __attribute__((__noreturn__)); > > void > __throw_underflow_error(const char*) __attribute__((__noreturn__)); > > > void > __throw_ios_failure(const char*) __attribute__((__noreturn__)); > > void > __throw_system_error(int) __attribute__((__noreturn__)); > > void > __throw_future_error(int) __attribute__((__noreturn__)); > > > void > __throw_bad_function_call() __attribute__((__noreturn__)); > > >} ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cpp_type_traits.h" 1 3 ># 36 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cpp_type_traits.h" 3 > ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cpp_type_traits.h" 3 ># 69 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cpp_type_traits.h" 3 >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _Iterator, typename _Container> > class __normal_iterator; > > >} > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > struct __true_type { }; > struct __false_type { }; > > template<bool> > struct __truth_type > { typedef __false_type __type; }; > > template<> > struct __truth_type<true> > { typedef __true_type __type; }; > > > > template<class _Sp, class _Tp> > struct __traitor > { > enum { __value = bool(_Sp::__value) || bool(_Tp::__value) }; > typedef typename __truth_type<__value>::__type __type; > }; > > > template<typename, typename> > struct __are_same > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > template<typename _Tp> > struct __are_same<_Tp, _Tp> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > template<typename _Tp> > struct __is_void > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > template<> > struct __is_void<void> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > > > template<typename _Tp> > struct __is_integer > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > > > > template<> > struct __is_integer<bool> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<signed char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<unsigned char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > template<> > struct __is_integer<wchar_t> > { > enum { __value = 1 }; > typedef __true_type __type; > }; ># 199 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cpp_type_traits.h" 3 > template<> > struct __is_integer<short> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<unsigned short> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<int> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<unsigned int> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<long> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<unsigned long> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<long long> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_integer<unsigned long long> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > > > template<typename _Tp> > struct __is_floating > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > > template<> > struct __is_floating<float> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_floating<double> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_floating<long double> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > > > template<typename _Tp> > struct __is_pointer > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > template<typename _Tp> > struct __is_pointer<_Tp*> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > > > template<typename _Tp> > struct __is_normal_iterator > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > template<typename _Iterator, typename _Container> > struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator, > _Container> > > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > > > template<typename _Tp> > struct __is_arithmetic > : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> > > { }; > > > > > template<typename _Tp> > struct __is_fundamental > : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> > > { }; > > > > > template<typename _Tp> > struct __is_scalar > : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> > > { }; > > > > > template<typename _Tp> > struct __is_char > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > template<> > struct __is_char<char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > template<> > struct __is_char<wchar_t> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > template<typename _Tp> > struct __is_byte > { > enum { __value = 0 }; > typedef __false_type __type; > }; > > template<> > struct __is_byte<char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_byte<signed char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > template<> > struct __is_byte<unsigned char> > { > enum { __value = 1 }; > typedef __true_type __type; > }; > > > > > template<typename _Tp> > struct __is_move_iterator > { > enum { __value = 0 }; > typedef __false_type __type; > }; ># 422 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cpp_type_traits.h" 3 > >} ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/type_traits.h" 1 3 ># 32 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/type_traits.h" 3 > ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/type_traits.h" 3 > > > > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > > > > template<bool, typename> > struct __enable_if > { }; > > template<typename _Tp> > struct __enable_if<true, _Tp> > { typedef _Tp __type; }; > > > > template<bool _Cond, typename _Iftrue, typename _Iffalse> > struct __conditional_type > { typedef _Iftrue __type; }; > > template<typename _Iftrue, typename _Iffalse> > struct __conditional_type<false, _Iftrue, _Iffalse> > { typedef _Iffalse __type; }; > > > > template<typename _Tp> > struct __add_unsigned > { > private: > typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; > > public: > typedef typename __if_type::__type __type; > }; > > template<> > struct __add_unsigned<char> > { typedef unsigned char __type; }; > > template<> > struct __add_unsigned<signed char> > { typedef unsigned char __type; }; > > template<> > struct __add_unsigned<short> > { typedef unsigned short __type; }; > > template<> > struct __add_unsigned<int> > { typedef unsigned int __type; }; > > template<> > struct __add_unsigned<long> > { typedef unsigned long __type; }; > > template<> > struct __add_unsigned<long long> > { typedef unsigned long long __type; }; > > > template<> > struct __add_unsigned<bool>; > > template<> > struct __add_unsigned<wchar_t>; > > > > template<typename _Tp> > struct __remove_unsigned > { > private: > typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; > > public: > typedef typename __if_type::__type __type; > }; > > template<> > struct __remove_unsigned<char> > { typedef signed char __type; }; > > template<> > struct __remove_unsigned<unsigned char> > { typedef signed char __type; }; > > template<> > struct __remove_unsigned<unsigned short> > { typedef short __type; }; > > template<> > struct __remove_unsigned<unsigned int> > { typedef int __type; }; > > template<> > struct __remove_unsigned<unsigned long> > { typedef long __type; }; > > template<> > struct __remove_unsigned<unsigned long long> > { typedef long long __type; }; > > > template<> > struct __remove_unsigned<bool>; > > template<> > struct __remove_unsigned<wchar_t>; > > > > template<typename _Type> > inline bool > __is_null_pointer(_Type* __ptr) > { return __ptr == 0; } > > template<typename _Type> > inline bool > __is_null_pointer(_Type) > { return false; } > > > > template<typename _Tp, bool = std::__is_integer<_Tp>::__value> > struct __promote > { typedef double __type; }; > > > > > template<typename _Tp> > struct __promote<_Tp, false> > { }; > > template<> > struct __promote<long double> > { typedef long double __type; }; > > template<> > struct __promote<double> > { typedef double __type; }; > > template<> > struct __promote<float> > { typedef float __type; }; > > template<typename _Tp, typename _Up, > typename _Tp2 = typename __promote<_Tp>::__type, > typename _Up2 = typename __promote<_Up>::__type> > struct __promote_2 > { > typedef __typeof__(_Tp2() + _Up2()) __type; > }; > > template<typename _Tp, typename _Up, typename _Vp, > typename _Tp2 = typename __promote<_Tp>::__type, > typename _Up2 = typename __promote<_Up>::__type, > typename _Vp2 = typename __promote<_Vp>::__type> > struct __promote_3 > { > typedef __typeof__(_Tp2() + _Up2() + _Vp2()) __type; > }; > > template<typename _Tp, typename _Up, typename _Vp, typename _Wp, > typename _Tp2 = typename __promote<_Tp>::__type, > typename _Up2 = typename __promote<_Up>::__type, > typename _Vp2 = typename __promote<_Vp>::__type, > typename _Wp2 = typename __promote<_Wp>::__type> > struct __promote_4 > { > typedef __typeof__(_Tp2() + _Up2() + _Vp2() + _Wp2()) __type; > }; > > >} ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/numeric_traits.h" 1 3 ># 32 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/numeric_traits.h" 3 > ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/numeric_traits.h" 3 > > > > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > ># 54 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/numeric_traits.h" 3 > template<typename _Value> > struct __numeric_traits_integer > { > > static const _Value __min = (((_Value)(-1) < 0) ? (_Value)1 << (sizeof(_Value) * 8 - ((_Value)(-1) < 0)) : (_Value)0); > static const _Value __max = (((_Value)(-1) < 0) ? (((((_Value)1 << ((sizeof(_Value) * 8 - ((_Value)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(_Value)0); > > > > static const bool __is_signed = ((_Value)(-1) < 0); > static const int __digits = (sizeof(_Value) * 8 - ((_Value)(-1) < 0)); > }; > > template<typename _Value> > const _Value __numeric_traits_integer<_Value>::__min; > > template<typename _Value> > const _Value __numeric_traits_integer<_Value>::__max; > > template<typename _Value> > const bool __numeric_traits_integer<_Value>::__is_signed; > > template<typename _Value> > const int __numeric_traits_integer<_Value>::__digits; ># 99 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/numeric_traits.h" 3 > template<typename _Value> > struct __numeric_traits_floating > { > > static const int __max_digits10 = (2 + (std::__are_same<_Value, float>::__value ? 24 : std::__are_same<_Value, double>::__value ? 53 : 64) * 643L / 2136); > > > static const bool __is_signed = true; > static const int __digits10 = (std::__are_same<_Value, float>::__value ? 6 : std::__are_same<_Value, double>::__value ? 15 : 18); > static const int __max_exponent10 = (std::__are_same<_Value, float>::__value ? 38 : std::__are_same<_Value, double>::__value ? 308 : 4932); > }; > > template<typename _Value> > const int __numeric_traits_floating<_Value>::__max_digits10; > > template<typename _Value> > const bool __numeric_traits_floating<_Value>::__is_signed; > > template<typename _Value> > const int __numeric_traits_floating<_Value>::__digits10; > > template<typename _Value> > const int __numeric_traits_floating<_Value>::__max_exponent10; > > template<typename _Value> > struct __numeric_traits > : public __conditional_type<std::__is_integer<_Value>::__value, > __numeric_traits_integer<_Value>, > __numeric_traits_floating<_Value> >::__type > { }; > > >} ># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_types.h" 1 3 ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_types.h" 3 > ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_types.h" 3 > > > > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 90 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_types.h" 3 > struct input_iterator_tag { }; > > > struct output_iterator_tag { }; > > > struct forward_iterator_tag : public input_iterator_tag { }; > > > > struct bidirectional_iterator_tag : public forward_iterator_tag { }; > > > > struct random_access_iterator_tag : public bidirectional_iterator_tag { }; ># 117 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_types.h" 3 > template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t, > typename _Pointer = _Tp*, typename _Reference = _Tp&> > struct iterator > { > > typedef _Category iterator_category; > > typedef _Tp value_type; > > typedef _Distance difference_type; > > typedef _Pointer pointer; > > typedef _Reference reference; > }; ># 163 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_types.h" 3 > template<typename _Iterator> > struct iterator_traits > { > typedef typename _Iterator::iterator_category iterator_category; > typedef typename _Iterator::value_type value_type; > typedef typename _Iterator::difference_type difference_type; > typedef typename _Iterator::pointer pointer; > typedef typename _Iterator::reference reference; > }; > > > > template<typename _Tp> > struct iterator_traits<_Tp*> > { > typedef random_access_iterator_tag iterator_category; > typedef _Tp value_type; > typedef ptrdiff_t difference_type; > typedef _Tp* pointer; > typedef _Tp& reference; > }; > > > template<typename _Tp> > struct iterator_traits<const _Tp*> > { > typedef random_access_iterator_tag iterator_category; > typedef _Tp value_type; > typedef ptrdiff_t difference_type; > typedef const _Tp* pointer; > typedef const _Tp& reference; > }; > > > > > > template<typename _Iter> > inline typename iterator_traits<_Iter>::iterator_category > __iterator_category(const _Iter&) > { return typename iterator_traits<_Iter>::iterator_category(); } > > > > > > template<typename _Iterator, bool _HasBase> > struct _Iter_base > { > typedef _Iterator iterator_type; > static iterator_type _S_base(_Iterator __it) > { return __it; } > }; > > template<typename _Iterator> > struct _Iter_base<_Iterator, true> > { > typedef typename _Iterator::iterator_type iterator_type; > static iterator_type _S_base(_Iterator __it) > { return __it.base(); } > }; > > >} ># 67 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_funcs.h" 1 3 ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_funcs.h" 3 > ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_funcs.h" 3 > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _InputIterator> > inline typename iterator_traits<_InputIterator>::difference_type > __distance(_InputIterator __first, _InputIterator __last, > input_iterator_tag) > { > > > > 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) > { > > > > return __last - __first; > } ># 112 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_funcs.h" 3 > template<typename _InputIterator> > inline typename iterator_traits<_InputIterator>::difference_type > distance(_InputIterator __first, _InputIterator __last) > { > > return std::__distance(__first, __last, > std::__iterator_category(__first)); > } > > template<typename _InputIterator, typename _Distance> > inline void > __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) > { > > > while (__n--) > ++__i; > } > > template<typename _BidirectionalIterator, typename _Distance> > inline void > __advance(_BidirectionalIterator& __i, _Distance __n, > bidirectional_iterator_tag) > { > > > > 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) > { > > > > __i += __n; > } ># 170 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_funcs.h" 3 > template<typename _InputIterator, typename _Distance> > inline void > advance(_InputIterator& __i, _Distance __n) > { > > typename iterator_traits<_InputIterator>::difference_type __d = __n; > std::__advance(__i, __d, std::__iterator_category(__i)); > } ># 201 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator_base_funcs.h" 3 > >} ># 68 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 1 3 ># 69 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 97 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Iterator> > class reverse_iterator > : public iterator<typename iterator_traits<_Iterator>::iterator_category, > typename iterator_traits<_Iterator>::value_type, > typename iterator_traits<_Iterator>::difference_type, > typename iterator_traits<_Iterator>::pointer, > typename iterator_traits<_Iterator>::reference> > { > protected: > _Iterator current; > > typedef iterator_traits<_Iterator> __traits_type; > > public: > typedef _Iterator iterator_type; > typedef typename __traits_type::difference_type difference_type; > typedef typename __traits_type::pointer pointer; > typedef typename __traits_type::reference reference; > > > > > > > > reverse_iterator() : current() { } > > > > > explicit > reverse_iterator(iterator_type __x) : current(__x) { } > > > > > reverse_iterator(const reverse_iterator& __x) > : current(__x.current) { } > > > > > > template<typename _Iter> > reverse_iterator(const reverse_iterator<_Iter>& __x) > : current(__x.base()) { } > > > > > iterator_type > base() const > { return current; } ># 161 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > reference > operator*() const > { > _Iterator __tmp = current; > return *--__tmp; > } > > > > > > > pointer > operator->() const > { return &(operator*()); } > > > > > > > reverse_iterator& > operator++() > { > --current; > return *this; > } > > > > > > > reverse_iterator > operator++(int) > { > reverse_iterator __tmp = *this; > --current; > return __tmp; > } > > > > > > > reverse_iterator& > operator--() > { > ++current; > return *this; > } > > > > > > > reverse_iterator > operator--(int) > { > reverse_iterator __tmp = *this; > ++current; > return __tmp; > } > > > > > > > reverse_iterator > operator+(difference_type __n) const > { return reverse_iterator(current - __n); } > > > > > > > > reverse_iterator& > operator+=(difference_type __n) > { > current -= __n; > return *this; > } > > > > > > > reverse_iterator > operator-(difference_type __n) const > { return reverse_iterator(current + __n); } > > > > > > > > reverse_iterator& > operator-=(difference_type __n) > { > current += __n; > return *this; > } > > > > > > > reference > operator[](difference_type __n) const > { return *(*this + __n); } > }; ># 291 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Iterator> > inline bool > operator==(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return __x.base() == __y.base(); } > > template<typename _Iterator> > inline bool > operator<(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return __y.base() < __x.base(); } > > template<typename _Iterator> > inline bool > operator!=(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return !(__x == __y); } > > template<typename _Iterator> > inline bool > operator>(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return __y < __x; } > > template<typename _Iterator> > inline bool > operator<=(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return !(__y < __x); } > > template<typename _Iterator> > inline bool > operator>=(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return !(__x < __y); } > > template<typename _Iterator> > inline typename reverse_iterator<_Iterator>::difference_type > operator-(const reverse_iterator<_Iterator>& __x, > const reverse_iterator<_Iterator>& __y) > { return __y.base() - __x.base(); } > > template<typename _Iterator> > inline reverse_iterator<_Iterator> > operator+(typename reverse_iterator<_Iterator>::difference_type __n, > const reverse_iterator<_Iterator>& __x) > { return reverse_iterator<_Iterator>(__x.base() - __n); } > > > > template<typename _IteratorL, typename _IteratorR> > inline bool > operator==(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > { return __x.base() == __y.base(); } > > template<typename _IteratorL, typename _IteratorR> > inline bool > operator<(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > { return __y.base() < __x.base(); } > > template<typename _IteratorL, typename _IteratorR> > inline bool > operator!=(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > { return !(__x == __y); } > > template<typename _IteratorL, typename _IteratorR> > inline bool > operator>(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > { return __y < __x; } > > template<typename _IteratorL, typename _IteratorR> > inline bool > operator<=(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > { return !(__y < __x); } > > template<typename _IteratorL, typename _IteratorR> > inline bool > operator>=(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > { return !(__x < __y); } > > template<typename _IteratorL, typename _IteratorR> > > > > > > > > inline typename reverse_iterator<_IteratorL>::difference_type > operator-(const reverse_iterator<_IteratorL>& __x, > const reverse_iterator<_IteratorR>& __y) > > { return __y.base() - __x.base(); } ># 403 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Container> > class back_insert_iterator > : public iterator<output_iterator_tag, void, void, void, void> > { > protected: > _Container* container; > > public: > > typedef _Container container_type; > > > explicit > back_insert_iterator(_Container& __x) : container(&__x) { } ># 430 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > back_insert_iterator& > operator=(typename _Container::const_reference __value) > { > container->push_back(__value); > return *this; > } ># 453 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > back_insert_iterator& > operator*() > { return *this; } > > > back_insert_iterator& > operator++() > { return *this; } > > > back_insert_iterator > operator++(int) > { return *this; } > }; ># 479 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Container> > inline back_insert_iterator<_Container> > back_inserter(_Container& __x) > { return back_insert_iterator<_Container>(__x); } ># 494 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Container> > class front_insert_iterator > : public iterator<output_iterator_tag, void, void, void, void> > { > protected: > _Container* container; > > public: > > typedef _Container container_type; > > > explicit front_insert_iterator(_Container& __x) : container(&__x) { } ># 520 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > front_insert_iterator& > operator=(typename _Container::const_reference __value) > { > container->push_front(__value); > return *this; > } ># 543 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > front_insert_iterator& > operator*() > { return *this; } > > > front_insert_iterator& > operator++() > { return *this; } > > > front_insert_iterator > operator++(int) > { return *this; } > }; ># 569 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Container> > inline front_insert_iterator<_Container> > front_inserter(_Container& __x) > { return front_insert_iterator<_Container>(__x); } ># 588 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Container> > class insert_iterator > : public iterator<output_iterator_tag, void, void, void, void> > { > protected: > _Container* container; > typename _Container::iterator iter; > > public: > > typedef _Container container_type; > > > > > > insert_iterator(_Container& __x, typename _Container::iterator __i) > : container(&__x), iter(__i) {} ># 631 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > insert_iterator& > operator=(typename _Container::const_reference __value) > { > iter = container->insert(iter, __value); > ++iter; > return *this; > } ># 657 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > insert_iterator& > operator*() > { return *this; } > > > insert_iterator& > operator++() > { return *this; } > > > insert_iterator& > operator++(int) > { return *this; } > }; ># 683 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _Container, typename _Iterator> > inline insert_iterator<_Container> > inserter(_Container& __x, _Iterator __i) > { > return insert_iterator<_Container>(__x, > typename _Container::iterator(__i)); > } > > > > >} > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > ># 707 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > using std::iterator_traits; > using std::iterator; > template<typename _Iterator, typename _Container> > class __normal_iterator > { > protected: > _Iterator _M_current; > > typedef iterator_traits<_Iterator> __traits_type; > > public: > typedef _Iterator iterator_type; > typedef typename __traits_type::iterator_category iterator_category; > typedef typename __traits_type::value_type value_type; > typedef typename __traits_type::difference_type difference_type; > typedef typename __traits_type::reference reference; > typedef typename __traits_type::pointer pointer; > > __normal_iterator() : _M_current(_Iterator()) { } > > explicit > __normal_iterator(const _Iterator& __i) : _M_current(__i) { } > > > template<typename _Iter> > __normal_iterator(const __normal_iterator<_Iter, > typename __enable_if< > (std::__are_same<_Iter, typename _Container::pointer>::__value), > _Container>::__type>& __i) > : _M_current(__i.base()) { } > > > reference > operator*() const > { return *_M_current; } > > pointer > operator->() const > { return _M_current; } > > __normal_iterator& > operator++() > { > ++_M_current; > return *this; > } > > __normal_iterator > operator++(int) > { return __normal_iterator(_M_current++); } > > > __normal_iterator& > operator--() > { > --_M_current; > return *this; > } > > __normal_iterator > operator--(int) > { return __normal_iterator(_M_current--); } > > > reference > operator[](const difference_type& __n) const > { return _M_current[__n]; } > > __normal_iterator& > operator+=(const difference_type& __n) > { _M_current += __n; return *this; } > > __normal_iterator > operator+(const difference_type& __n) const > { return __normal_iterator(_M_current + __n); } > > __normal_iterator& > operator-=(const difference_type& __n) > { _M_current -= __n; return *this; } > > __normal_iterator > operator-(const difference_type& __n) const > { return __normal_iterator(_M_current - __n); } > > const _Iterator& > base() const > { return _M_current; } > }; ># 805 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_iterator.h" 3 > template<typename _IteratorL, typename _IteratorR, typename _Container> > inline bool > operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > { return __lhs.base() == __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline bool > operator==(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() == __rhs.base(); } > > template<typename _IteratorL, typename _IteratorR, typename _Container> > inline bool > operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > { return __lhs.base() != __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline bool > operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() != __rhs.base(); } > > > template<typename _IteratorL, typename _IteratorR, typename _Container> > inline bool > operator<(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > { return __lhs.base() < __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline bool > operator<(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() < __rhs.base(); } > > template<typename _IteratorL, typename _IteratorR, typename _Container> > inline bool > operator>(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > { return __lhs.base() > __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline bool > operator>(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() > __rhs.base(); } > > template<typename _IteratorL, typename _IteratorR, typename _Container> > inline bool > operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > { return __lhs.base() <= __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline bool > operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() <= __rhs.base(); } > > template<typename _IteratorL, typename _IteratorR, typename _Container> > inline bool > operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > { return __lhs.base() >= __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline bool > operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() >= __rhs.base(); } > > > > > > template<typename _IteratorL, typename _IteratorR, typename _Container> > > > > > > > > inline typename __normal_iterator<_IteratorL, _Container>::difference_type > operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, > const __normal_iterator<_IteratorR, _Container>& __rhs) > > { return __lhs.base() - __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline typename __normal_iterator<_Iterator, _Container>::difference_type > operator-(const __normal_iterator<_Iterator, _Container>& __lhs, > const __normal_iterator<_Iterator, _Container>& __rhs) > { return __lhs.base() - __rhs.base(); } > > template<typename _Iterator, typename _Container> > inline __normal_iterator<_Iterator, _Container> > operator+(typename __normal_iterator<_Iterator, _Container>::difference_type > __n, const __normal_iterator<_Iterator, _Container>& __i) > { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } > > >} ># 69 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/debug/debug.h" 1 3 ># 47 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/debug/debug.h" 3 >namespace std >{ > namespace __debug { } >} > > > > >namespace __gnu_debug >{ > using namespace std::__debug; >} ># 71 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 2 3 > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > > > template<bool _BoolType> > struct __iter_swap > { > template<typename _ForwardIterator1, typename _ForwardIterator2> > static void > iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) > { > typedef typename iterator_traits<_ForwardIterator1>::value_type > _ValueType1; > _ValueType1 __tmp = (*__a); > *__a = (*__b); > *__b = (__tmp); > } > }; > > template<> > struct __iter_swap<true> > { > template<typename _ForwardIterator1, typename _ForwardIterator2> > static void > iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) > { > swap(*__a, *__b); > } > }; ># 116 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _ForwardIterator1, typename _ForwardIterator2> > inline void > iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) > { > typedef typename iterator_traits<_ForwardIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_ForwardIterator2>::value_type > _ValueType2; > > > > > > > > > > > > typedef typename iterator_traits<_ForwardIterator1>::reference > _ReferenceType1; > typedef typename iterator_traits<_ForwardIterator2>::reference > _ReferenceType2; > std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value > && __are_same<_ValueType1&, _ReferenceType1>::__value > && __are_same<_ValueType2&, _ReferenceType2>::__value>:: > iter_swap(__a, __b); > } ># 157 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _ForwardIterator1, typename _ForwardIterator2> > _ForwardIterator2 > swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2) > { > > > > > > ; > > for (; __first1 != __last1; ++__first1, ++__first2) > std::iter_swap(__first1, __first2); > return __first2; > } ># 185 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _Tp> > inline const _Tp& > min(const _Tp& __a, const _Tp& __b) > { > > > > if (__b < __a) > return __b; > return __a; > } ># 208 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _Tp> > inline const _Tp& > max(const _Tp& __a, const _Tp& __b) > { > > > > if (__a < __b) > return __b; > return __a; > } ># 231 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _Tp, typename _Compare> > inline const _Tp& > min(const _Tp& __a, const _Tp& __b, _Compare __comp) > { > > if (__comp(__b, __a)) > return __b; > return __a; > } ># 252 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _Tp, typename _Compare> > inline const _Tp& > max(const _Tp& __a, const _Tp& __b, _Compare __comp) > { > > if (__comp(__a, __b)) > return __b; > return __a; > } > > > > template<typename _Iterator> > struct _Niter_base > : _Iter_base<_Iterator, __is_normal_iterator<_Iterator>::__value> > { }; > > template<typename _Iterator> > inline typename _Niter_base<_Iterator>::iterator_type > __niter_base(_Iterator __it) > { return std::_Niter_base<_Iterator>::_S_base(__it); } > > > template<typename _Iterator> > struct _Miter_base > : _Iter_base<_Iterator, __is_move_iterator<_Iterator>::__value> > { }; > > template<typename _Iterator> > inline typename _Miter_base<_Iterator>::iterator_type > __miter_base(_Iterator __it) > { return std::_Miter_base<_Iterator>::_S_base(__it); } > > > > > > > > template<bool, bool, typename> > struct __copy_move > { > template<typename _II, typename _OI> > static _OI > __copy_m(_II __first, _II __last, _OI __result) > { > for (; __first != __last; ++__result, ++__first) > *__result = *__first; > return __result; > } > }; ># 319 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<> > struct __copy_move<false, false, random_access_iterator_tag> > { > template<typename _II, typename _OI> > static _OI > __copy_m(_II __first, _II __last, _OI __result) > { > typedef typename iterator_traits<_II>::difference_type _Distance; > for(_Distance __n = __last - __first; __n > 0; --__n) > { > *__result = *__first; > ++__first; > ++__result; > } > return __result; > } > }; ># 357 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<bool _IsMove> > struct __copy_move<_IsMove, true, random_access_iterator_tag> > { > template<typename _Tp> > static _Tp* > __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result) > { > const ptrdiff_t _Num = __last - __first; > if (_Num) > __builtin_memmove(__result, __first, sizeof(_Tp) * _Num); > return __result + _Num; > } > }; > > template<bool _IsMove, typename _II, typename _OI> > inline _OI > __copy_move_a(_II __first, _II __last, _OI __result) > { > typedef typename iterator_traits<_II>::value_type _ValueTypeI; > typedef typename iterator_traits<_OI>::value_type _ValueTypeO; > typedef typename iterator_traits<_II>::iterator_category _Category; > const bool __simple = (__is_trivial(_ValueTypeI) > && __is_pointer<_II>::__value > && __is_pointer<_OI>::__value > && __are_same<_ValueTypeI, _ValueTypeO>::__value); > > return std::__copy_move<_IsMove, __simple, > _Category>::__copy_m(__first, __last, __result); > } > > > > template<typename _CharT> > struct char_traits; > > template<typename _CharT, typename _Traits> > class istreambuf_iterator; > > template<typename _CharT, typename _Traits> > class ostreambuf_iterator; > > template<bool _IsMove, typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type > __copy_move_a2(_CharT*, _CharT*, > ostreambuf_iterator<_CharT, char_traits<_CharT> >); > > template<bool _IsMove, typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type > __copy_move_a2(const _CharT*, const _CharT*, > ostreambuf_iterator<_CharT, char_traits<_CharT> >); > > template<bool _IsMove, typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > _CharT*>::__type > __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >, > istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*); > > template<bool _IsMove, typename _II, typename _OI> > inline _OI > __copy_move_a2(_II __first, _II __last, _OI __result) > { > return _OI(std::__copy_move_a<_IsMove>(std::__niter_base(__first), > std::__niter_base(__last), > std::__niter_base(__result))); > } ># 442 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _II, typename _OI> > inline _OI > copy(_II __first, _II __last, _OI __result) > { > > > > > ; > > return (std::__copy_move_a2<__is_move_iterator<_II>::__value> > (std::__miter_base(__first), std::__miter_base(__last), > __result)); > } ># 494 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<bool, bool, typename> > struct __copy_move_backward > { > template<typename _BI1, typename _BI2> > static _BI2 > __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) > { > while (__first != __last) > *--__result = *--__last; > return __result; > } > }; ># 522 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<> > struct __copy_move_backward<false, false, random_access_iterator_tag> > { > template<typename _BI1, typename _BI2> > static _BI2 > __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) > { > typename iterator_traits<_BI1>::difference_type __n; > for (__n = __last - __first; __n > 0; --__n) > *--__result = *--__last; > return __result; > } > }; ># 552 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<bool _IsMove> > struct __copy_move_backward<_IsMove, true, random_access_iterator_tag> > { > template<typename _Tp> > static _Tp* > __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result) > { > const ptrdiff_t _Num = __last - __first; > if (_Num) > __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num); > return __result - _Num; > } > }; > > template<bool _IsMove, typename _BI1, typename _BI2> > inline _BI2 > __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result) > { > typedef typename iterator_traits<_BI1>::value_type _ValueType1; > typedef typename iterator_traits<_BI2>::value_type _ValueType2; > typedef typename iterator_traits<_BI1>::iterator_category _Category; > const bool __simple = (__is_trivial(_ValueType1) > && __is_pointer<_BI1>::__value > && __is_pointer<_BI2>::__value > && __are_same<_ValueType1, _ValueType2>::__value); > > return std::__copy_move_backward<_IsMove, __simple, > _Category>::__copy_move_b(__first, > __last, > __result); > } > > template<bool _IsMove, typename _BI1, typename _BI2> > inline _BI2 > __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result) > { > return _BI2(std::__copy_move_backward_a<_IsMove> > (std::__niter_base(__first), std::__niter_base(__last), > std::__niter_base(__result))); > } ># 611 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _BI1, typename _BI2> > inline _BI2 > copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) > { > > > > > > > ; > > return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value> > (std::__miter_base(__first), std::__miter_base(__last), > __result)); > } ># 669 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _ForwardIterator, typename _Tp> > inline typename > __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type > __fill_a(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __value) > { > for (; __first != __last; ++__first) > *__first = __value; > } > > template<typename _ForwardIterator, typename _Tp> > inline typename > __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type > __fill_a(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __value) > { > const _Tp __tmp = __value; > for (; __first != __last; ++__first) > *__first = __tmp; > } > > > template<typename _Tp> > inline typename > __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type > __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c) > { > const _Tp __tmp = __c; > __builtin_memset(__first, static_cast<unsigned char>(__tmp), > __last - __first); > } ># 713 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _ForwardIterator, typename _Tp> > inline void > fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) > { > > > > ; > > std::__fill_a(std::__niter_base(__first), std::__niter_base(__last), > __value); > } > > template<typename _OutputIterator, typename _Size, typename _Tp> > inline typename > __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type > __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) > { > for (__decltype(__n + 0) __niter = __n; > __niter > 0; --__niter, ++__first) > *__first = __value; > return __first; > } > > template<typename _OutputIterator, typename _Size, typename _Tp> > inline typename > __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type > __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) > { > const _Tp __tmp = __value; > for (__decltype(__n + 0) __niter = __n; > __niter > 0; --__niter, ++__first) > *__first = __tmp; > return __first; > } > > template<typename _Size, typename _Tp> > inline typename > __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type > __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c) > { > std::__fill_a(__first, __first + __n, __c); > return __first + __n; > } ># 773 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _OI, typename _Size, typename _Tp> > inline _OI > fill_n(_OI __first, _Size __n, const _Tp& __value) > { > > > > return _OI(std::__fill_n_a(std::__niter_base(__first), __n, __value)); > } > > template<bool _BoolType> > struct __equal > { > template<typename _II1, typename _II2> > static bool > equal(_II1 __first1, _II1 __last1, _II2 __first2) > { > for (; __first1 != __last1; ++__first1, ++__first2) > if (!(*__first1 == *__first2)) > return false; > return true; > } > }; > > template<> > struct __equal<true> > { > template<typename _Tp> > static bool > equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2) > { > return !__builtin_memcmp(__first1, __first2, sizeof(_Tp) > * (__last1 - __first1)); > } > }; > > template<typename _II1, typename _II2> > inline bool > __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2) > { > typedef typename iterator_traits<_II1>::value_type _ValueType1; > typedef typename iterator_traits<_II2>::value_type _ValueType2; > const bool __simple = ((__is_integer<_ValueType1>::__value > || __is_pointer<_ValueType1>::__value) > && __is_pointer<_II1>::__value > && __is_pointer<_II2>::__value > && __are_same<_ValueType1, _ValueType2>::__value); > > return std::__equal<__simple>::equal(__first1, __last1, __first2); > } > > > template<typename, typename> > struct __lc_rai > { > template<typename _II1, typename _II2> > static _II1 > __newlast1(_II1, _II1 __last1, _II2, _II2) > { return __last1; } > > template<typename _II> > static bool > __cnd2(_II __first, _II __last) > { return __first != __last; } > }; > > template<> > struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag> > { > template<typename _RAI1, typename _RAI2> > static _RAI1 > __newlast1(_RAI1 __first1, _RAI1 __last1, > _RAI2 __first2, _RAI2 __last2) > { > const typename iterator_traits<_RAI1>::difference_type > __diff1 = __last1 - __first1; > const typename iterator_traits<_RAI2>::difference_type > __diff2 = __last2 - __first2; > return __diff2 < __diff1 ? __first1 + __diff2 : __last1; > } > > template<typename _RAI> > static bool > __cnd2(_RAI, _RAI) > { return true; } > }; > > template<bool _BoolType> > struct __lexicographical_compare > { > template<typename _II1, typename _II2> > static bool __lc(_II1, _II1, _II2, _II2); > }; > > template<bool _BoolType> > template<typename _II1, typename _II2> > bool > __lexicographical_compare<_BoolType>:: > __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) > { > typedef typename iterator_traits<_II1>::iterator_category _Category1; > typedef typename iterator_traits<_II2>::iterator_category _Category2; > typedef std::__lc_rai<_Category1, _Category2> __rai_type; > > __last1 = __rai_type::__newlast1(__first1, __last1, > __first2, __last2); > for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); > ++__first1, ++__first2) > { > if (*__first1 < *__first2) > return true; > if (*__first2 < *__first1) > return false; > } > return __first1 == __last1 && __first2 != __last2; > } > > template<> > struct __lexicographical_compare<true> > { > template<typename _Tp, typename _Up> > static bool > __lc(const _Tp* __first1, const _Tp* __last1, > const _Up* __first2, const _Up* __last2) > { > const size_t __len1 = __last1 - __first1; > const size_t __len2 = __last2 - __first2; > const int __result = __builtin_memcmp(__first1, __first2, > std::min(__len1, __len2)); > return __result != 0 ? __result < 0 : __len1 < __len2; > } > }; > > template<typename _II1, typename _II2> > inline bool > __lexicographical_compare_aux(_II1 __first1, _II1 __last1, > _II2 __first2, _II2 __last2) > { > typedef typename iterator_traits<_II1>::value_type _ValueType1; > typedef typename iterator_traits<_II2>::value_type _ValueType2; > const bool __simple = > (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value > && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed > && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed > && __is_pointer<_II1>::__value > && __is_pointer<_II2>::__value); > > return std::__lexicographical_compare<__simple>::__lc(__first1, __last1, > __first2, __last2); > } ># 935 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _ForwardIterator, typename _Tp> > _ForwardIterator > lower_bound(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > > > > ; > > _DistanceType __len = std::distance(__first, __last); > > while (__len > 0) > { > _DistanceType __half = __len >> 1; > _ForwardIterator __middle = __first; > std::advance(__middle, __half); > if (*__middle < __val) > { > __first = __middle; > ++__first; > __len = __len - __half - 1; > } > else > __len = __half; > } > return __first; > } > > > > template<typename _Size> > inline _Size > __lg(_Size __n) > { > _Size __k; > for (__k = 0; __n != 0; __n >>= 1) > ++__k; > return __k - 1; > } > > inline int > __lg(int __n) > { return sizeof(int) * 8 - 1 - __builtin_clz(__n); } > > inline unsigned > __lg(unsigned __n) > { return sizeof(int) * 8 - 1 - __builtin_clz(__n); } > > inline long > __lg(long __n) > { return sizeof(long) * 8 - 1 - __builtin_clzl(__n); } > > inline unsigned long > __lg(unsigned long __n) > { return sizeof(long) * 8 - 1 - __builtin_clzl(__n); } > > inline long long > __lg(long long __n) > { return sizeof(long long) * 8 - 1 - __builtin_clzll(__n); } > > inline unsigned long long > __lg(unsigned long long __n) > { return sizeof(long long) * 8 - 1 - __builtin_clzll(__n); } > > > > ># 1021 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _II1, typename _II2> > inline bool > equal(_II1 __first1, _II1 __last1, _II2 __first2) > { > > > > > > > ; > > return std::__equal_aux(std::__niter_base(__first1), > std::__niter_base(__last1), > std::__niter_base(__first2)); > } ># 1053 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> > inline bool > equal(_IIter1 __first1, _IIter1 __last1, > _IIter2 __first2, _BinaryPredicate __binary_pred) > { > > > > ; > > for (; __first1 != __last1; ++__first1, ++__first2) > if (!bool(__binary_pred(*__first1, *__first2))) > return false; > return true; > } ># 1084 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _II1, typename _II2> > inline bool > lexicographical_compare(_II1 __first1, _II1 __last1, > _II2 __first2, _II2 __last2) > { > > typedef typename iterator_traits<_II1>::value_type _ValueType1; > typedef typename iterator_traits<_II2>::value_type _ValueType2; > > > > > ; > ; > > return std::__lexicographical_compare_aux(std::__niter_base(__first1), > std::__niter_base(__last1), > std::__niter_base(__first2), > std::__niter_base(__last2)); > } ># 1118 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _II1, typename _II2, typename _Compare> > bool > lexicographical_compare(_II1 __first1, _II1 __last1, > _II2 __first2, _II2 __last2, _Compare __comp) > { > typedef typename iterator_traits<_II1>::iterator_category _Category1; > typedef typename iterator_traits<_II2>::iterator_category _Category2; > typedef std::__lc_rai<_Category1, _Category2> __rai_type; > > > > > ; > ; > > __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); > for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); > ++__first1, ++__first2) > { > if (__comp(*__first1, *__first2)) > return true; > if (__comp(*__first2, *__first1)) > return false; > } > return __first1 == __last1 && __first2 != __last2; > } ># 1158 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _InputIterator1, typename _InputIterator2> > pair<_InputIterator1, _InputIterator2> > mismatch(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2) > { > > > > > > > ; > > while (__first1 != __last1 && *__first1 == *__first2) > { > ++__first1; > ++__first2; > } > return pair<_InputIterator1, _InputIterator2>(__first1, __first2); > } ># 1195 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _BinaryPredicate> > pair<_InputIterator1, _InputIterator2> > mismatch(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _BinaryPredicate __binary_pred) > { > > > > ; > > while (__first1 != __last1 && bool(__binary_pred(*__first1, *__first2))) > { > ++__first1; > ++__first2; > } > return pair<_InputIterator1, _InputIterator2>(__first1, __first2); > } > > >} ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 1 3 ># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 3 ># 66 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 3 ># 1 "/usr/include/stdlib.h" 1 3 4 ># 33 "/usr/include/stdlib.h" 3 4 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 34 "/usr/include/stdlib.h" 2 3 4 > >extern "C" { > > > > > > ># 1 "/usr/include/bits/waitflags.h" 1 3 4 ># 43 "/usr/include/stdlib.h" 2 3 4 ># 1 "/usr/include/bits/waitstatus.h" 1 3 4 ># 65 "/usr/include/bits/waitstatus.h" 3 4 ># 1 "/usr/include/endian.h" 1 3 4 ># 37 "/usr/include/endian.h" 3 4 ># 1 "/usr/include/bits/endian.h" 1 3 4 ># 38 "/usr/include/endian.h" 2 3 4 ># 61 "/usr/include/endian.h" 3 4 ># 1 "/usr/include/bits/byteswap.h" 1 3 4 ># 28 "/usr/include/bits/byteswap.h" 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 29 "/usr/include/bits/byteswap.h" 2 3 4 ># 62 "/usr/include/endian.h" 2 3 4 ># 66 "/usr/include/bits/waitstatus.h" 2 3 4 > >union wait > { > int w_status; > struct > { > > unsigned int __w_termsig:7; > unsigned int __w_coredump:1; > unsigned int __w_retcode:8; > unsigned int:16; > > > > > > > > } __wait_terminated; > struct > { > > unsigned int __w_stopval:8; > unsigned int __w_stopsig:8; > unsigned int:16; > > > > > > > } __wait_stopped; > }; ># 44 "/usr/include/stdlib.h" 2 3 4 ># 96 "/usr/include/stdlib.h" 3 4 > > >typedef struct > { > int quot; > int rem; > } div_t; > > > >typedef struct > { > long int quot; > long int rem; > } ldiv_t; > > > > > > > >__extension__ typedef struct > { > long long int quot; > long long int rem; > } lldiv_t; > > ># 140 "/usr/include/stdlib.h" 3 4 >extern size_t __ctype_get_mb_cur_max (void) throw () ; > > > > >extern double atof (__const char *__nptr) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; > >extern int atoi (__const char *__nptr) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; > >extern long int atol (__const char *__nptr) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; > > > > > >__extension__ extern long long int atoll (__const char *__nptr) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; > > > > > >extern double strtod (__const char *__restrict __nptr, > char **__restrict __endptr) > throw () __attribute__ ((__nonnull__ (1))) ; > > > > > >extern float strtof (__const char *__restrict __nptr, > char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ; > >extern long double strtold (__const char *__restrict __nptr, > char **__restrict __endptr) > throw () __attribute__ ((__nonnull__ (1))) ; > > > > > >extern long int strtol (__const char *__restrict __nptr, > char **__restrict __endptr, int __base) > throw () __attribute__ ((__nonnull__ (1))) ; > >extern unsigned long int strtoul (__const char *__restrict __nptr, > char **__restrict __endptr, int __base) > throw () __attribute__ ((__nonnull__ (1))) ; > > > > >__extension__ >extern long long int strtoq (__const char *__restrict __nptr, > char **__restrict __endptr, int __base) > throw () __attribute__ ((__nonnull__ (1))) ; > >__extension__ >extern unsigned long long int strtouq (__const char *__restrict __nptr, > char **__restrict __endptr, int __base) > throw () __attribute__ ((__nonnull__ (1))) ; > > > > > >__extension__ >extern long long int strtoll (__const char *__restrict __nptr, > char **__restrict __endptr, int __base) > throw () __attribute__ ((__nonnull__ (1))) ; > >__extension__ >extern unsigned long long int strtoull (__const char *__restrict __nptr, > char **__restrict __endptr, int __base) > throw () __attribute__ ((__nonnull__ (1))) ; > ># 236 "/usr/include/stdlib.h" 3 4 ># 1 "/usr/include/xlocale.h" 1 3 4 ># 28 "/usr/include/xlocale.h" 3 4 >typedef struct __locale_struct >{ > > struct __locale_data *__locales[13]; > > > const unsigned short int *__ctype_b; > const int *__ctype_tolower; > const int *__ctype_toupper; > > > const char *__names[13]; >} *__locale_t; > > >typedef __locale_t locale_t; ># 237 "/usr/include/stdlib.h" 2 3 4 > > > >extern long int strtol_l (__const char *__restrict __nptr, > char **__restrict __endptr, int __base, > __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ; > >extern unsigned long int strtoul_l (__const char *__restrict __nptr, > char **__restrict __endptr, > int __base, __locale_t __loc) > throw () __attribute__ ((__nonnull__ (1, 4))) ; > >__extension__ >extern long long int strtoll_l (__const char *__restrict __nptr, > char **__restrict __endptr, int __base, > __locale_t __loc) > throw () __attribute__ ((__nonnull__ (1, 4))) ; > >__extension__ >extern unsigned long long int strtoull_l (__const char *__restrict __nptr, > char **__restrict __endptr, > int __base, __locale_t __loc) > throw () __attribute__ ((__nonnull__ (1, 4))) ; > >extern double strtod_l (__const char *__restrict __nptr, > char **__restrict __endptr, __locale_t __loc) > throw () __attribute__ ((__nonnull__ (1, 3))) ; > >extern float strtof_l (__const char *__restrict __nptr, > char **__restrict __endptr, __locale_t __loc) > throw () __attribute__ ((__nonnull__ (1, 3))) ; > >extern long double strtold_l (__const char *__restrict __nptr, > char **__restrict __endptr, > __locale_t __loc) > throw () __attribute__ ((__nonnull__ (1, 3))) ; > > > > > >extern __inline __attribute__ ((__gnu_inline__)) double >__attribute__ ((__leaf__)) atof (__const char *__nptr) throw () >{ > return strtod (__nptr, (char **) __null); >} >extern __inline __attribute__ ((__gnu_inline__)) int >__attribute__ ((__leaf__)) atoi (__const char *__nptr) throw () >{ > return (int) strtol (__nptr, (char **) __null, 10); >} >extern __inline __attribute__ ((__gnu_inline__)) long int >__attribute__ ((__leaf__)) atol (__const char *__nptr) throw () >{ > return strtol (__nptr, (char **) __null, 10); >} > > > > >__extension__ extern __inline __attribute__ ((__gnu_inline__)) long long int >__attribute__ ((__leaf__)) atoll (__const char *__nptr) throw () >{ > return strtoll (__nptr, (char **) __null, 10); >} > ># 311 "/usr/include/stdlib.h" 3 4 >extern char *l64a (long int __n) throw () ; > > >extern long int a64l (__const char *__s) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; > > > > ># 1 "/usr/include/sys/types.h" 1 3 4 ># 28 "/usr/include/sys/types.h" 3 4 >extern "C" { > ># 1 "/usr/include/bits/types.h" 1 3 4 ># 28 "/usr/include/bits/types.h" 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 29 "/usr/include/bits/types.h" 2 3 4 > > >typedef unsigned char __u_char; >typedef unsigned short int __u_short; >typedef unsigned int __u_int; >typedef unsigned long int __u_long; > > >typedef signed char __int8_t; >typedef unsigned char __uint8_t; >typedef signed short int __int16_t; >typedef unsigned short int __uint16_t; >typedef signed int __int32_t; >typedef unsigned int __uint32_t; > >typedef signed long int __int64_t; >typedef unsigned long int __uint64_t; > > > > > > > >typedef long int __quad_t; >typedef unsigned long int __u_quad_t; ># 131 "/usr/include/bits/types.h" 3 4 ># 1 "/usr/include/bits/typesizes.h" 1 3 4 ># 132 "/usr/include/bits/types.h" 2 3 4 > > >typedef unsigned long int __dev_t; >typedef unsigned int __uid_t; >typedef unsigned int __gid_t; >typedef unsigned long int __ino_t; >typedef unsigned long int __ino64_t; >typedef unsigned int __mode_t; >typedef unsigned long int __nlink_t; >typedef long int __off_t; >typedef long int __off64_t; >typedef int __pid_t; >typedef struct { int __val[2]; } __fsid_t; >typedef long int __clock_t; >typedef unsigned long int __rlim_t; >typedef unsigned long int __rlim64_t; >typedef unsigned int __id_t; >typedef long int __time_t; >typedef unsigned int __useconds_t; >typedef long int __suseconds_t; > >typedef int __daddr_t; >typedef long int __swblk_t; >typedef int __key_t; > > >typedef int __clockid_t; > > >typedef void * __timer_t; > > >typedef long int __blksize_t; > > > > >typedef long int __blkcnt_t; >typedef long int __blkcnt64_t; > > >typedef unsigned long int __fsblkcnt_t; >typedef unsigned long int __fsblkcnt64_t; > > >typedef unsigned long int __fsfilcnt_t; >typedef unsigned long int __fsfilcnt64_t; > >typedef long int __ssize_t; > > > >typedef __off64_t __loff_t; >typedef __quad_t *__qaddr_t; >typedef char *__caddr_t; > > >typedef long int __intptr_t; > > >typedef unsigned int __socklen_t; ># 31 "/usr/include/sys/types.h" 2 3 4 > > > >typedef __u_char u_char; >typedef __u_short u_short; >typedef __u_int u_int; >typedef __u_long u_long; >typedef __quad_t quad_t; >typedef __u_quad_t u_quad_t; >typedef __fsid_t fsid_t; > > > > >typedef __loff_t loff_t; > > > >typedef __ino_t ino_t; > > > > > > >typedef __ino64_t ino64_t; > > > > >typedef __dev_t dev_t; > > > > >typedef __gid_t gid_t; > > > > >typedef __mode_t mode_t; > > > > >typedef __nlink_t nlink_t; > > > > >typedef __uid_t uid_t; > > > > > >typedef __off_t off_t; > > > > > > >typedef __off64_t off64_t; > > > > >typedef __pid_t pid_t; > > > > > >typedef __id_t id_t; > > > > >typedef __ssize_t ssize_t; > > > > > >typedef __daddr_t daddr_t; >typedef __caddr_t caddr_t; > > > > > >typedef __key_t key_t; ># 133 "/usr/include/sys/types.h" 3 4 ># 1 "/usr/include/time.h" 1 3 4 ># 58 "/usr/include/time.h" 3 4 > > >typedef __clock_t clock_t; > > > ># 74 "/usr/include/time.h" 3 4 > > >typedef __time_t time_t; > > > ># 92 "/usr/include/time.h" 3 4 >typedef __clockid_t clockid_t; ># 104 "/usr/include/time.h" 3 4 >typedef __timer_t timer_t; ># 134 "/usr/include/sys/types.h" 2 3 4 > > > >typedef __useconds_t useconds_t; > > > >typedef __suseconds_t suseconds_t; > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 148 "/usr/include/sys/types.h" 2 3 4 > > > >typedef unsigned long int ulong; >typedef unsigned short int ushort; >typedef unsigned int uint; ># 195 "/usr/include/sys/types.h" 3 4 >typedef int int8_t __attribute__ ((__mode__ (__QI__))); >typedef int int16_t __attribute__ ((__mode__ (__HI__))); >typedef int int32_t __attribute__ ((__mode__ (__SI__))); >typedef int int64_t __attribute__ ((__mode__ (__DI__))); > > >typedef unsigned int u_int8_t __attribute__ ((__mode__ (__QI__))); >typedef unsigned int u_int16_t __attribute__ ((__mode__ (__HI__))); >typedef unsigned int u_int32_t __attribute__ ((__mode__ (__SI__))); >typedef unsigned int u_int64_t __attribute__ ((__mode__ (__DI__))); > >typedef int register_t __attribute__ ((__mode__ (__word__))); ># 220 "/usr/include/sys/types.h" 3 4 ># 1 "/usr/include/sys/select.h" 1 3 4 ># 31 "/usr/include/sys/select.h" 3 4 ># 1 "/usr/include/bits/select.h" 1 3 4 ># 23 "/usr/include/bits/select.h" 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 24 "/usr/include/bits/select.h" 2 3 4 ># 32 "/usr/include/sys/select.h" 2 3 4 > > ># 1 "/usr/include/bits/sigset.h" 1 3 4 ># 24 "/usr/include/bits/sigset.h" 3 4 >typedef int __sig_atomic_t; > > > > >typedef struct > { > unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))]; > } __sigset_t; ># 35 "/usr/include/sys/select.h" 2 3 4 > > > >typedef __sigset_t sigset_t; > > > > > ># 1 "/usr/include/time.h" 1 3 4 ># 120 "/usr/include/time.h" 3 4 >struct timespec > { > __time_t tv_sec; > long int tv_nsec; > }; ># 45 "/usr/include/sys/select.h" 2 3 4 > ># 1 "/usr/include/bits/time.h" 1 3 4 ># 31 "/usr/include/bits/time.h" 3 4 >struct timeval > { > __time_t tv_sec; > __suseconds_t tv_usec; > }; ># 47 "/usr/include/sys/select.h" 2 3 4 ># 55 "/usr/include/sys/select.h" 3 4 >typedef long int __fd_mask; ># 65 "/usr/include/sys/select.h" 3 4 >typedef struct > { > > > > __fd_mask fds_bits[1024 / (8 * (int) sizeof (__fd_mask))]; > > > > > > } fd_set; > > > > > > >typedef __fd_mask fd_mask; ># 97 "/usr/include/sys/select.h" 3 4 >extern "C" { ># 107 "/usr/include/sys/select.h" 3 4 >extern int select (int __nfds, fd_set *__restrict __readfds, > fd_set *__restrict __writefds, > fd_set *__restrict __exceptfds, > struct timeval *__restrict __timeout); ># 119 "/usr/include/sys/select.h" 3 4 >extern int pselect (int __nfds, fd_set *__restrict __readfds, > fd_set *__restrict __writefds, > fd_set *__restrict __exceptfds, > const struct timespec *__restrict __timeout, > const __sigset_t *__restrict __sigmask); ># 132 "/usr/include/sys/select.h" 3 4 >} ># 221 "/usr/include/sys/types.h" 2 3 4 > > ># 1 "/usr/include/sys/sysmacros.h" 1 3 4 ># 30 "/usr/include/sys/sysmacros.h" 3 4 >extern "C" { > >__extension__ >extern unsigned int gnu_dev_major (unsigned long long int __dev) > throw () __attribute__ ((__const__)); >__extension__ >extern unsigned int gnu_dev_minor (unsigned long long int __dev) > throw () __attribute__ ((__const__)); >__extension__ >extern unsigned long long int gnu_dev_makedev (unsigned int __major, > unsigned int __minor) > throw () __attribute__ ((__const__)); > > >__extension__ extern __inline __attribute__ ((__gnu_inline__)) __attribute__ ((__const__)) unsigned int >__attribute__ ((__leaf__)) gnu_dev_major (unsigned long long int __dev) throw () >{ > return ((__dev >> 8) & 0xfff) | ((unsigned int) (__dev >> 32) & ~0xfff); >} > >__extension__ extern __inline __attribute__ ((__gnu_inline__)) __attribute__ ((__const__)) unsigned int >__attribute__ ((__leaf__)) gnu_dev_minor (unsigned long long int __dev) throw () >{ > return (__dev & 0xff) | ((unsigned int) (__dev >> 12) & ~0xff); >} > >__extension__ extern __inline __attribute__ ((__gnu_inline__)) __attribute__ ((__const__)) unsigned long long int >__attribute__ ((__leaf__)) gnu_dev_makedev (unsigned int __major, unsigned int __minor) throw () >{ > return ((__minor & 0xff) | ((__major & 0xfff) << 8) > | (((unsigned long long int) (__minor & ~0xff)) << 12) > | (((unsigned long long int) (__major & ~0xfff)) << 32)); >} > >} ># 224 "/usr/include/sys/types.h" 2 3 4 > > > > > >typedef __blksize_t blksize_t; > > > > > > >typedef __blkcnt_t blkcnt_t; > > > >typedef __fsblkcnt_t fsblkcnt_t; > > > >typedef __fsfilcnt_t fsfilcnt_t; ># 263 "/usr/include/sys/types.h" 3 4 >typedef __blkcnt64_t blkcnt64_t; >typedef __fsblkcnt64_t fsblkcnt64_t; >typedef __fsfilcnt64_t fsfilcnt64_t; > > > > > ># 1 "/usr/include/bits/pthreadtypes.h" 1 3 4 ># 23 "/usr/include/bits/pthreadtypes.h" 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 24 "/usr/include/bits/pthreadtypes.h" 2 3 4 ># 50 "/usr/include/bits/pthreadtypes.h" 3 4 >typedef unsigned long int pthread_t; > > >typedef union >{ > char __size[56]; > long int __align; >} pthread_attr_t; > > > >typedef struct __pthread_internal_list >{ > struct __pthread_internal_list *__prev; > struct __pthread_internal_list *__next; >} __pthread_list_t; ># 76 "/usr/include/bits/pthreadtypes.h" 3 4 >typedef union >{ > struct __pthread_mutex_s > { > int __lock; > unsigned int __count; > int __owner; > > unsigned int __nusers; > > > > int __kind; > > int __spins; > __pthread_list_t __list; ># 101 "/usr/include/bits/pthreadtypes.h" 3 4 > } __data; > char __size[40]; > long int __align; >} pthread_mutex_t; > >typedef union >{ > char __size[4]; > int __align; >} pthread_mutexattr_t; > > > > >typedef union >{ > struct > { > int __lock; > unsigned int __futex; > __extension__ unsigned long long int __total_seq; > __extension__ unsigned long long int __wakeup_seq; > __extension__ unsigned long long int __woken_seq; > void *__mutex; > unsigned int __nwaiters; > unsigned int __broadcast_seq; > } __data; > char __size[48]; > __extension__ long long int __align; >} pthread_cond_t; > >typedef union >{ > char __size[4]; > int __align; >} pthread_condattr_t; > > > >typedef unsigned int pthread_key_t; > > > >typedef int pthread_once_t; > > > > > >typedef union >{ > > struct > { > int __lock; > unsigned int __nr_readers; > unsigned int __readers_wakeup; > unsigned int __writer_wakeup; > unsigned int __nr_readers_queued; > unsigned int __nr_writers_queued; > int __writer; > int __shared; > unsigned long int __pad1; > unsigned long int __pad2; > > > unsigned int __flags; > } __data; ># 187 "/usr/include/bits/pthreadtypes.h" 3 4 > char __size[56]; > long int __align; >} pthread_rwlock_t; > >typedef union >{ > char __size[8]; > long int __align; >} pthread_rwlockattr_t; > > > > > >typedef volatile int pthread_spinlock_t; > > > > >typedef union >{ > char __size[32]; > long int __align; >} pthread_barrier_t; > >typedef union >{ > char __size[4]; > int __align; >} pthread_barrierattr_t; ># 272 "/usr/include/sys/types.h" 2 3 4 > > >} ># 321 "/usr/include/stdlib.h" 2 3 4 > > > > > > >extern long int random (void) throw (); > > >extern void srandom (unsigned int __seed) throw (); > > > > > >extern char *initstate (unsigned int __seed, char *__statebuf, > size_t __statelen) throw () __attribute__ ((__nonnull__ (2))); > > > >extern char *setstate (char *__statebuf) throw () __attribute__ ((__nonnull__ (1))); > > > > > > > >struct random_data > { > int32_t *fptr; > int32_t *rptr; > int32_t *state; > int rand_type; > int rand_deg; > int rand_sep; > int32_t *end_ptr; > }; > >extern int random_r (struct random_data *__restrict __buf, > int32_t *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); > >extern int srandom_r (unsigned int __seed, struct random_data *__buf) > throw () __attribute__ ((__nonnull__ (2))); > >extern int initstate_r (unsigned int __seed, char *__restrict __statebuf, > size_t __statelen, > struct random_data *__restrict __buf) > throw () __attribute__ ((__nonnull__ (2, 4))); > >extern int setstate_r (char *__restrict __statebuf, > struct random_data *__restrict __buf) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > > > >extern int rand (void) throw (); > >extern void srand (unsigned int __seed) throw (); > > > > >extern int rand_r (unsigned int *__seed) throw (); > > > > > > > >extern double drand48 (void) throw (); >extern double erand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1))); > > >extern long int lrand48 (void) throw (); >extern long int nrand48 (unsigned short int __xsubi[3]) > throw () __attribute__ ((__nonnull__ (1))); > > >extern long int mrand48 (void) throw (); >extern long int jrand48 (unsigned short int __xsubi[3]) > throw () __attribute__ ((__nonnull__ (1))); > > >extern void srand48 (long int __seedval) throw (); >extern unsigned short int *seed48 (unsigned short int __seed16v[3]) > throw () __attribute__ ((__nonnull__ (1))); >extern void lcong48 (unsigned short int __param[7]) throw () __attribute__ ((__nonnull__ (1))); > > > > > >struct drand48_data > { > unsigned short int __x[3]; > unsigned short int __old_x[3]; > unsigned short int __c; > unsigned short int __init; > unsigned long long int __a; > }; > > >extern int drand48_r (struct drand48_data *__restrict __buffer, > double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); >extern int erand48_r (unsigned short int __xsubi[3], > struct drand48_data *__restrict __buffer, > double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int lrand48_r (struct drand48_data *__restrict __buffer, > long int *__restrict __result) > throw () __attribute__ ((__nonnull__ (1, 2))); >extern int nrand48_r (unsigned short int __xsubi[3], > struct drand48_data *__restrict __buffer, > long int *__restrict __result) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int mrand48_r (struct drand48_data *__restrict __buffer, > long int *__restrict __result) > throw () __attribute__ ((__nonnull__ (1, 2))); >extern int jrand48_r (unsigned short int __xsubi[3], > struct drand48_data *__restrict __buffer, > long int *__restrict __result) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int srand48_r (long int __seedval, struct drand48_data *__buffer) > throw () __attribute__ ((__nonnull__ (2))); > >extern int seed48_r (unsigned short int __seed16v[3], > struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2))); > >extern int lcong48_r (unsigned short int __param[7], > struct drand48_data *__buffer) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > > > > > > >extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ; > >extern void *calloc (size_t __nmemb, size_t __size) > throw () __attribute__ ((__malloc__)) ; > > > > > > > > > > >extern void *realloc (void *__ptr, size_t __size) > throw () __attribute__ ((__warn_unused_result__)); > >extern void free (void *__ptr) throw (); > > > > >extern void cfree (void *__ptr) throw (); > > > ># 1 "/usr/include/alloca.h" 1 3 4 ># 25 "/usr/include/alloca.h" 3 4 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 26 "/usr/include/alloca.h" 2 3 4 > >extern "C" { > > > > > >extern void *alloca (size_t __size) throw (); > > > > > >} ># 498 "/usr/include/stdlib.h" 2 3 4 > > > > > >extern void *valloc (size_t __size) throw () __attribute__ ((__malloc__)) ; > > > > >extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size) > throw () __attribute__ ((__nonnull__ (1))) ; > > > > >extern void abort (void) throw () __attribute__ ((__noreturn__)); > > > >extern int atexit (void (*__func) (void)) throw () __attribute__ ((__nonnull__ (1))); > > > > > > >extern "C++" int at_quick_exit (void (*__func) (void)) > throw () __asm ("at_quick_exit") __attribute__ ((__nonnull__ (1))); > > > > > > > > > >extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg) > throw () __attribute__ ((__nonnull__ (1))); > > > > > > >extern void exit (int __status) throw () __attribute__ ((__noreturn__)); > > > > > > > >extern void quick_exit (int __status) throw () __attribute__ ((__noreturn__)); > > > > > > > >extern void _Exit (int __status) throw () __attribute__ ((__noreturn__)); > > > > > > >extern char *getenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ; > > > > >extern char *__secure_getenv (__const char *__name) > throw () __attribute__ ((__nonnull__ (1))) ; > > > > > >extern int putenv (char *__string) throw () __attribute__ ((__nonnull__ (1))); > > > > > >extern int setenv (__const char *__name, __const char *__value, int __replace) > throw () __attribute__ ((__nonnull__ (2))); > > >extern int unsetenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))); > > > > > > >extern int clearenv (void) throw (); ># 606 "/usr/include/stdlib.h" 3 4 >extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ; ># 620 "/usr/include/stdlib.h" 3 4 >extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ; ># 630 "/usr/include/stdlib.h" 3 4 >extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) ; ># 642 "/usr/include/stdlib.h" 3 4 >extern int mkstemps (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) ; ># 652 "/usr/include/stdlib.h" 3 4 >extern int mkstemps64 (char *__template, int __suffixlen) > __attribute__ ((__nonnull__ (1))) ; ># 663 "/usr/include/stdlib.h" 3 4 >extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ; ># 674 "/usr/include/stdlib.h" 3 4 >extern int mkostemp (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ; ># 684 "/usr/include/stdlib.h" 3 4 >extern int mkostemp64 (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ; ># 694 "/usr/include/stdlib.h" 3 4 >extern int mkostemps (char *__template, int __suffixlen, int __flags) > __attribute__ ((__nonnull__ (1))) ; ># 706 "/usr/include/stdlib.h" 3 4 >extern int mkostemps64 (char *__template, int __suffixlen, int __flags) > __attribute__ ((__nonnull__ (1))) ; > > > > > > > > > >extern int system (__const char *__command) ; > > > > > > >extern char *canonicalize_file_name (__const char *__name) > throw () __attribute__ ((__nonnull__ (1))) ; ># 734 "/usr/include/stdlib.h" 3 4 >extern char *realpath (__const char *__restrict __name, > char *__restrict __resolved) throw () ; > > > > > > >typedef int (*__compar_fn_t) (__const void *, __const void *); > > >typedef __compar_fn_t comparison_fn_t; > > > >typedef int (*__compar_d_fn_t) (__const void *, __const void *, void *); > > > > > >extern void *bsearch (__const void *__key, __const void *__base, > size_t __nmemb, size_t __size, __compar_fn_t __compar) > __attribute__ ((__nonnull__ (1, 2, 5))) ; > > > >extern void qsort (void *__base, size_t __nmemb, size_t __size, > __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4))); > >extern void qsort_r (void *__base, size_t __nmemb, size_t __size, > __compar_d_fn_t __compar, void *__arg) > __attribute__ ((__nonnull__ (1, 4))); > > > > >extern int abs (int __x) throw () __attribute__ ((__const__)) ; >extern long int labs (long int __x) throw () __attribute__ ((__const__)) ; > > > >__extension__ extern long long int llabs (long long int __x) > throw () __attribute__ ((__const__)) ; > > > > > > > >extern div_t div (int __numer, int __denom) > throw () __attribute__ ((__const__)) ; >extern ldiv_t ldiv (long int __numer, long int __denom) > throw () __attribute__ ((__const__)) ; > > > > >__extension__ extern lldiv_t lldiv (long long int __numer, > long long int __denom) > throw () __attribute__ ((__const__)) ; > ># 808 "/usr/include/stdlib.h" 3 4 >extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt, > int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ; > > > > >extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt, > int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ; > > > > >extern char *gcvt (double __value, int __ndigit, char *__buf) > throw () __attribute__ ((__nonnull__ (3))) ; > > > > >extern char *qecvt (long double __value, int __ndigit, > int *__restrict __decpt, int *__restrict __sign) > throw () __attribute__ ((__nonnull__ (3, 4))) ; >extern char *qfcvt (long double __value, int __ndigit, > int *__restrict __decpt, int *__restrict __sign) > throw () __attribute__ ((__nonnull__ (3, 4))) ; >extern char *qgcvt (long double __value, int __ndigit, char *__buf) > throw () __attribute__ ((__nonnull__ (3))) ; > > > > >extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt, > int *__restrict __sign, char *__restrict __buf, > size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5))); >extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt, > int *__restrict __sign, char *__restrict __buf, > size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5))); > >extern int qecvt_r (long double __value, int __ndigit, > int *__restrict __decpt, int *__restrict __sign, > char *__restrict __buf, size_t __len) > throw () __attribute__ ((__nonnull__ (3, 4, 5))); >extern int qfcvt_r (long double __value, int __ndigit, > int *__restrict __decpt, int *__restrict __sign, > char *__restrict __buf, size_t __len) > throw () __attribute__ ((__nonnull__ (3, 4, 5))); > > > > > > > >extern int mblen (__const char *__s, size_t __n) throw () ; > > >extern int mbtowc (wchar_t *__restrict __pwc, > __const char *__restrict __s, size_t __n) throw () ; > > >extern int wctomb (char *__s, wchar_t __wchar) throw () ; > > > >extern size_t mbstowcs (wchar_t *__restrict __pwcs, > __const char *__restrict __s, size_t __n) throw (); > >extern size_t wcstombs (char *__restrict __s, > __const wchar_t *__restrict __pwcs, size_t __n) > throw (); > > > > > > > > >extern int rpmatch (__const char *__response) throw () __attribute__ ((__nonnull__ (1))) ; ># 896 "/usr/include/stdlib.h" 3 4 >extern int getsubopt (char **__restrict __optionp, > char *__const *__restrict __tokens, > char **__restrict __valuep) > throw () __attribute__ ((__nonnull__ (1, 2, 3))) ; > > > > > >extern void setkey (__const char *__key) throw () __attribute__ ((__nonnull__ (1))); > > > > > > > >extern int posix_openpt (int __oflag) ; > > > > > > > >extern int grantpt (int __fd) throw (); > > > >extern int unlockpt (int __fd) throw (); > > > > >extern char *ptsname (int __fd) throw () ; > > > > > > >extern int ptsname_r (int __fd, char *__buf, size_t __buflen) > throw () __attribute__ ((__nonnull__ (2))); > > >extern int getpt (void); > > > > > > >extern int getloadavg (double __loadavg[], int __nelem) > throw () __attribute__ ((__nonnull__ (1))); ># 964 "/usr/include/stdlib.h" 3 4 >} ># 67 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 2 3 ># 98 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > using ::div_t; > using ::ldiv_t; > > using ::abort; > using ::abs; > using ::atexit; > using ::atof; > using ::atoi; > using ::atol; > using ::bsearch; > using ::calloc; > using ::div; > using ::exit; > using ::free; > using ::getenv; > using ::labs; > using ::ldiv; > using ::malloc; > > using ::mblen; > using ::mbstowcs; > using ::mbtowc; > > using ::qsort; > using ::rand; > using ::realloc; > using ::srand; > using ::strtod; > using ::strtol; > using ::strtoul; > using ::system; > > using ::wcstombs; > using ::wctomb; > > > > inline long > abs(long __i) { return labs(__i); } > > inline ldiv_t > div(long __i, long __j) { return ldiv(__i, __j); } > > > >} ># 160 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 3 >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > > > > using ::lldiv_t; > > > > > > using ::_Exit; > > > inline long long > abs(long long __x) { return __x >= 0 ? __x : -__x; } > > > using ::llabs; > > inline lldiv_t > div(long long __n, long long __d) > { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; } > > using ::lldiv; ># 195 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cstdlib" 3 > using ::atoll; > using ::strtoll; > using ::strtoull; > > using ::strtof; > using ::strtold; > > >} > >namespace std >{ > > using ::__gnu_cxx::lldiv_t; > > using ::__gnu_cxx::_Exit; > using ::__gnu_cxx::abs; > > using ::__gnu_cxx::llabs; > using ::__gnu_cxx::div; > using ::__gnu_cxx::lldiv; > > using ::__gnu_cxx::atoll; > using ::__gnu_cxx::strtof; > using ::__gnu_cxx::strtoll; > using ::__gnu_cxx::strtoull; > using ::__gnu_cxx::strtold; >} ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 1 3 ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 203 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _FIter, typename _Tp> > bool > binary_search(_FIter, _FIter, const _Tp&); > > template<typename _FIter, typename _Tp, typename _Compare> > bool > binary_search(_FIter, _FIter, const _Tp&, _Compare); > > template<typename _IIter, typename _OIter> > _OIter > copy(_IIter, _IIter, _OIter); > > template<typename _BIter1, typename _BIter2> > _BIter2 > copy_backward(_BIter1, _BIter1, _BIter2); ># 232 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _FIter, typename _Tp> > pair<_FIter, _FIter> > equal_range(_FIter, _FIter, const _Tp&); > > template<typename _FIter, typename _Tp, typename _Compare> > pair<_FIter, _FIter> > equal_range(_FIter, _FIter, const _Tp&, _Compare); > > template<typename _FIter, typename _Tp> > void > fill(_FIter, _FIter, const _Tp&); > > template<typename _OIter, typename _Size, typename _Tp> > _OIter > fill_n(_OIter, _Size, const _Tp&); > > > > template<typename _FIter1, typename _FIter2> > _FIter1 > find_end(_FIter1, _FIter1, _FIter2, _FIter2); > > template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> > _FIter1 > find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); ># 271 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _IIter1, typename _IIter2> > bool > includes(_IIter1, _IIter1, _IIter2, _IIter2); > > template<typename _IIter1, typename _IIter2, typename _Compare> > bool > includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); > > template<typename _BIter> > void > inplace_merge(_BIter, _BIter, _BIter); > > template<typename _BIter, typename _Compare> > void > inplace_merge(_BIter, _BIter, _BIter, _Compare); ># 334 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _FIter1, typename _FIter2> > void > iter_swap(_FIter1, _FIter2); > > template<typename _FIter, typename _Tp> > _FIter > lower_bound(_FIter, _FIter, const _Tp&); > > template<typename _FIter, typename _Tp, typename _Compare> > _FIter > lower_bound(_FIter, _FIter, const _Tp&, _Compare); > > template<typename _RAIter> > void > make_heap(_RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > make_heap(_RAIter, _RAIter, _Compare); > > template<typename _Tp> > const _Tp& > max(const _Tp&, const _Tp&); > > template<typename _Tp, typename _Compare> > const _Tp& > max(const _Tp&, const _Tp&, _Compare); > > > > > template<typename _Tp> > const _Tp& > min(const _Tp&, const _Tp&); > > template<typename _Tp, typename _Compare> > const _Tp& > min(const _Tp&, const _Tp&, _Compare); ># 419 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _BIter> > bool > next_permutation(_BIter, _BIter); > > template<typename _BIter, typename _Compare> > bool > next_permutation(_BIter, _BIter, _Compare); ># 436 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _IIter, typename _RAIter> > _RAIter > partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter); > > template<typename _IIter, typename _RAIter, typename _Compare> > _RAIter > partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare); ># 457 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _RAIter> > void > pop_heap(_RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > pop_heap(_RAIter, _RAIter, _Compare); > > template<typename _BIter> > bool > prev_permutation(_BIter, _BIter); > > template<typename _BIter, typename _Compare> > bool > prev_permutation(_BIter, _BIter, _Compare); > > template<typename _RAIter> > void > push_heap(_RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > push_heap(_RAIter, _RAIter, _Compare); > > > > template<typename _FIter, typename _Tp> > _FIter > remove(_FIter, _FIter, const _Tp&); > > template<typename _FIter, typename _Predicate> > _FIter > remove_if(_FIter, _FIter, _Predicate); > > template<typename _IIter, typename _OIter, typename _Tp> > _OIter > remove_copy(_IIter, _IIter, _OIter, const _Tp&); > > template<typename _IIter, typename _OIter, typename _Predicate> > _OIter > remove_copy_if(_IIter, _IIter, _OIter, _Predicate); > > > > template<typename _IIter, typename _OIter, typename _Tp> > _OIter > replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&); > > template<typename _Iter, typename _OIter, typename _Predicate, typename _Tp> > _OIter > replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&); > > > > template<typename _BIter> > void > reverse(_BIter, _BIter); > > template<typename _BIter, typename _OIter> > _OIter > reverse_copy(_BIter, _BIter, _OIter); > > template<typename _FIter> > void > rotate(_FIter, _FIter, _FIter); > > template<typename _FIter, typename _OIter> > _OIter > rotate_copy(_FIter, _FIter, _FIter, _OIter); ># 540 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/algorithmfwd.h" 3 > template<typename _RAIter> > void > sort_heap(_RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > sort_heap(_RAIter, _RAIter, _Compare); > > template<typename _BIter, typename _Predicate> > _BIter > stable_partition(_BIter, _BIter, _Predicate); > > template<typename _Tp> > void > swap(_Tp&, _Tp&) > > > > > ; > > template<typename _Tp, size_t _Nm> > void > swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) > > > > ; > > template<typename _FIter1, typename _FIter2> > _FIter2 > swap_ranges(_FIter1, _FIter1, _FIter2); > > > > template<typename _FIter> > _FIter > unique(_FIter, _FIter); > > template<typename _FIter, typename _BinaryPredicate> > _FIter > unique(_FIter, _FIter, _BinaryPredicate); > > > > template<typename _FIter, typename _Tp> > _FIter > upper_bound(_FIter, _FIter, const _Tp&); > > template<typename _FIter, typename _Tp, typename _Compare> > _FIter > upper_bound(_FIter, _FIter, const _Tp&, _Compare); > > > > > > template<typename _FIter> > _FIter > adjacent_find(_FIter, _FIter); > > template<typename _FIter, typename _BinaryPredicate> > _FIter > adjacent_find(_FIter, _FIter, _BinaryPredicate); > > template<typename _IIter, typename _Tp> > typename iterator_traits<_IIter>::difference_type > count(_IIter, _IIter, const _Tp&); > > template<typename _IIter, typename _Predicate> > typename iterator_traits<_IIter>::difference_type > count_if(_IIter, _IIter, _Predicate); > > template<typename _IIter1, typename _IIter2> > bool > equal(_IIter1, _IIter1, _IIter2); > > template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> > bool > equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate); > > template<typename _IIter, typename _Tp> > _IIter > find(_IIter, _IIter, const _Tp&); > > template<typename _FIter1, typename _FIter2> > _FIter1 > find_first_of(_FIter1, _FIter1, _FIter2, _FIter2); > > template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> > _FIter1 > find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); > > template<typename _IIter, typename _Predicate> > _IIter > find_if(_IIter, _IIter, _Predicate); > > template<typename _IIter, typename _Funct> > _Funct > for_each(_IIter, _IIter, _Funct); > > template<typename _FIter, typename _Generator> > void > generate(_FIter, _FIter, _Generator); > > template<typename _OIter, typename _Size, typename _Generator> > _OIter > generate_n(_OIter, _Size, _Generator); > > template<typename _IIter1, typename _IIter2> > bool > lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2); > > template<typename _IIter1, typename _IIter2, typename _Compare> > bool > lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); > > template<typename _FIter> > _FIter > max_element(_FIter, _FIter); > > template<typename _FIter, typename _Compare> > _FIter > max_element(_FIter, _FIter, _Compare); > > template<typename _IIter1, typename _IIter2, typename _OIter> > _OIter > merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); > > template<typename _IIter1, typename _IIter2, typename _OIter, > typename _Compare> > _OIter > merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); > > template<typename _FIter> > _FIter > min_element(_FIter, _FIter); > > template<typename _FIter, typename _Compare> > _FIter > min_element(_FIter, _FIter, _Compare); > > template<typename _IIter1, typename _IIter2> > pair<_IIter1, _IIter2> > mismatch(_IIter1, _IIter1, _IIter2); > > template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> > pair<_IIter1, _IIter2> > mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate); > > template<typename _RAIter> > void > nth_element(_RAIter, _RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > nth_element(_RAIter, _RAIter, _RAIter, _Compare); > > template<typename _RAIter> > void > partial_sort(_RAIter, _RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > partial_sort(_RAIter, _RAIter, _RAIter, _Compare); > > template<typename _BIter, typename _Predicate> > _BIter > partition(_BIter, _BIter, _Predicate); > > template<typename _RAIter> > void > random_shuffle(_RAIter, _RAIter); > > template<typename _RAIter, typename _Generator> > void > random_shuffle(_RAIter, _RAIter, > > > > _Generator&); > > > template<typename _FIter, typename _Tp> > void > replace(_FIter, _FIter, const _Tp&, const _Tp&); > > template<typename _FIter, typename _Predicate, typename _Tp> > void > replace_if(_FIter, _FIter, _Predicate, const _Tp&); > > template<typename _FIter1, typename _FIter2> > _FIter1 > search(_FIter1, _FIter1, _FIter2, _FIter2); > > template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> > _FIter1 > search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); > > template<typename _FIter, typename _Size, typename _Tp> > _FIter > search_n(_FIter, _FIter, _Size, const _Tp&); > > template<typename _FIter, typename _Size, typename _Tp, > typename _BinaryPredicate> > _FIter > search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate); > > template<typename _IIter1, typename _IIter2, typename _OIter> > _OIter > set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); > > template<typename _IIter1, typename _IIter2, typename _OIter, > typename _Compare> > _OIter > set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); > > template<typename _IIter1, typename _IIter2, typename _OIter> > _OIter > set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); > > template<typename _IIter1, typename _IIter2, typename _OIter, > typename _Compare> > _OIter > set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); > > template<typename _IIter1, typename _IIter2, typename _OIter> > _OIter > set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); > > template<typename _IIter1, typename _IIter2, typename _OIter, > typename _Compare> > _OIter > set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, > _OIter, _Compare); > > template<typename _IIter1, typename _IIter2, typename _OIter> > _OIter > set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); > > template<typename _IIter1, typename _IIter2, typename _OIter, > typename _Compare> > _OIter > set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); > > template<typename _RAIter> > void > sort(_RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > sort(_RAIter, _RAIter, _Compare); > > template<typename _RAIter> > void > stable_sort(_RAIter, _RAIter); > > template<typename _RAIter, typename _Compare> > void > stable_sort(_RAIter, _RAIter, _Compare); > > template<typename _IIter, typename _OIter, typename _UnaryOperation> > _OIter > transform(_IIter, _IIter, _OIter, _UnaryOperation); > > template<typename _IIter1, typename _IIter2, typename _OIter, > typename _BinaryOperation> > _OIter > transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation); > > template<typename _IIter, typename _OIter> > _OIter > unique_copy(_IIter, _IIter, _OIter); > > template<typename _IIter, typename _OIter, typename _BinaryPredicate> > _OIter > unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate); > > >} ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 1 3 ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > > > > > template<typename _RandomAccessIterator, typename _Distance> > _Distance > __is_heap_until(_RandomAccessIterator __first, _Distance __n) > { > _Distance __parent = 0; > for (_Distance __child = 1; __child < __n; ++__child) > { > if (__first[__parent] < __first[__child]) > return __child; > if ((__child & 1) == 0) > ++__parent; > } > return __n; > } > > template<typename _RandomAccessIterator, typename _Distance, > typename _Compare> > _Distance > __is_heap_until(_RandomAccessIterator __first, _Distance __n, > _Compare __comp) > { > _Distance __parent = 0; > for (_Distance __child = 1; __child < __n; ++__child) > { > if (__comp(__first[__parent], __first[__child])) > return __child; > if ((__child & 1) == 0) > ++__parent; > } > return __n; > } > > > > template<typename _RandomAccessIterator, typename _Distance> > inline bool > __is_heap(_RandomAccessIterator __first, _Distance __n) > { return std::__is_heap_until(__first, __n) == __n; } > > template<typename _RandomAccessIterator, typename _Compare, > typename _Distance> > inline bool > __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) > { return std::__is_heap_until(__first, __n, __comp) == __n; } > > template<typename _RandomAccessIterator> > inline bool > __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) > { return std::__is_heap(__first, std::distance(__first, __last)); } > > template<typename _RandomAccessIterator, typename _Compare> > inline bool > __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Compare __comp) > { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } > > > > > template<typename _RandomAccessIterator, typename _Distance, typename _Tp> > void > __push_heap(_RandomAccessIterator __first, > _Distance __holeIndex, _Distance __topIndex, _Tp __value) > { > _Distance __parent = (__holeIndex - 1) / 2; > while (__holeIndex > __topIndex && *(__first + __parent) < __value) > { > *(__first + __holeIndex) = (*(__first + __parent)); > __holeIndex = __parent; > __parent = (__holeIndex - 1) / 2; > } > *(__first + __holeIndex) = (__value); > } ># 155 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator> > inline void > push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > > ; > ; > > _ValueType __value = (*(__last - 1)); > std::__push_heap(__first, _DistanceType((__last - __first) - 1), > _DistanceType(0), (__value)); > } > > template<typename _RandomAccessIterator, typename _Distance, typename _Tp, > typename _Compare> > void > __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, > _Distance __topIndex, _Tp __value, _Compare __comp) > { > _Distance __parent = (__holeIndex - 1) / 2; > while (__holeIndex > __topIndex > && __comp(*(__first + __parent), __value)) > { > *(__first + __holeIndex) = (*(__first + __parent)); > __holeIndex = __parent; > __parent = (__holeIndex - 1) / 2; > } > *(__first + __holeIndex) = (__value); > } ># 205 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > inline void > push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > ; > ; > > _ValueType __value = (*(__last - 1)); > std::__push_heap(__first, _DistanceType((__last - __first) - 1), > _DistanceType(0), (__value), __comp); > } > > template<typename _RandomAccessIterator, typename _Distance, typename _Tp> > void > __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, > _Distance __len, _Tp __value) > { > const _Distance __topIndex = __holeIndex; > _Distance __secondChild = __holeIndex; > while (__secondChild < (__len - 1) / 2) > { > __secondChild = 2 * (__secondChild + 1); > if (*(__first + __secondChild) < *(__first + (__secondChild - 1))) > __secondChild--; > *(__first + __holeIndex) = (*(__first + __secondChild)); > __holeIndex = __secondChild; > } > if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) > { > __secondChild = 2 * (__secondChild + 1); > *(__first + __holeIndex) = (*(__first + (__secondChild - 1))) > ; > __holeIndex = __secondChild - 1; > } > std::__push_heap(__first, __holeIndex, __topIndex, > (__value)); > } > > template<typename _RandomAccessIterator> > inline void > __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, > _RandomAccessIterator __result) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > _ValueType __value = (*__result); > *__result = (*__first); > std::__adjust_heap(__first, _DistanceType(0), > _DistanceType(__last - __first), > (__value)); > } ># 280 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator> > inline void > pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > ; > ; > ; > > --__last; > std::__pop_heap(__first, __last, __last); > } > > template<typename _RandomAccessIterator, typename _Distance, > typename _Tp, typename _Compare> > void > __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, > _Distance __len, _Tp __value, _Compare __comp) > { > const _Distance __topIndex = __holeIndex; > _Distance __secondChild = __holeIndex; > while (__secondChild < (__len - 1) / 2) > { > __secondChild = 2 * (__secondChild + 1); > if (__comp(*(__first + __secondChild), > *(__first + (__secondChild - 1)))) > __secondChild--; > *(__first + __holeIndex) = (*(__first + __secondChild)); > __holeIndex = __secondChild; > } > if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) > { > __secondChild = 2 * (__secondChild + 1); > *(__first + __holeIndex) = (*(__first + (__secondChild - 1))) > ; > __holeIndex = __secondChild - 1; > } > std::__push_heap(__first, __holeIndex, __topIndex, > (__value), __comp); > } > > template<typename _RandomAccessIterator, typename _Compare> > inline void > __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, > _RandomAccessIterator __result, _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > _ValueType __value = (*__result); > *__result = (*__first); > std::__adjust_heap(__first, _DistanceType(0), > _DistanceType(__last - __first), > (__value), __comp); > } ># 355 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > inline void > pop_heap(_RandomAccessIterator __first, > _RandomAccessIterator __last, _Compare __comp) > { > > > > ; > ; > ; > > --__last; > std::__pop_heap(__first, __last, __last, __comp); > } ># 379 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator> > void > make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > > ; > > if (__last - __first < 2) > return; > > const _DistanceType __len = __last - __first; > _DistanceType __parent = (__len - 2) / 2; > while (true) > { > _ValueType __value = (*(__first + __parent)); > std::__adjust_heap(__first, __parent, __len, (__value)); > if (__parent == 0) > return; > __parent--; > } > } ># 419 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > void > make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > ; > > if (__last - __first < 2) > return; > > const _DistanceType __len = __last - __first; > _DistanceType __parent = (__len - 2) / 2; > while (true) > { > _ValueType __value = (*(__first + __parent)); > std::__adjust_heap(__first, __parent, __len, (__value), > __comp); > if (__parent == 0) > return; > __parent--; > } > } ># 458 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator> > void > sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > > > > > > ; > ; > > while (__last - __first > 1) > { > --__last; > std::__pop_heap(__first, __last, __last); > } > } ># 487 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > void > sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Compare __comp) > { > > > > ; > ; > > while (__last - __first > 1) > { > --__last; > std::__pop_heap(__first, __last, __last, __comp); > } > } ># 584 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_heap.h" 3 > >} ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tempbuf.h" 1 3 ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tempbuf.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_construct.h" 1 3 ># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_construct.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/new" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/new" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/new" 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 1 3 ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 3 > ># 36 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 3 > >#pragma GCC visibility push(default) > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/atomic_lockfree_defines.h" 1 3 ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/atomic_lockfree_defines.h" 3 > ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/atomic_lockfree_defines.h" 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 2 3 > >extern "C++" { > >namespace std >{ ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 3 > class exception > { > public: > exception() throw() { } > virtual ~exception() throw(); > > > > virtual const char* what() const throw(); > }; > > > > class bad_exception : public exception > { > public: > bad_exception() throw() { } > > > > virtual ~bad_exception() throw(); > > > virtual const char* what() const throw(); > }; > > > typedef void (*terminate_handler) (); > > > typedef void (*unexpected_handler) (); > > > terminate_handler set_terminate(terminate_handler) throw(); > > > > void terminate() throw() __attribute__ ((__noreturn__)); > > > unexpected_handler set_unexpected(unexpected_handler) throw(); > > > > void unexpected() __attribute__ ((__noreturn__)); ># 119 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 3 > bool uncaught_exception() throw() __attribute__ ((__pure__)); > > >} > >namespace __gnu_cxx >{ > ># 144 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/exception" 3 > void __verbose_terminate_handler(); > > >} > >} > >#pragma GCC visibility pop ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/new" 2 3 > >#pragma GCC visibility push(default) > >extern "C++" { > >namespace std >{ > > > > > > > class bad_alloc : public exception > { > public: > bad_alloc() throw() { } > > > > virtual ~bad_alloc() throw(); > > > virtual const char* what() const throw(); > }; > > struct nothrow_t { }; > > extern const nothrow_t nothrow; > > > > typedef void (*new_handler)(); > > > > new_handler set_new_handler(new_handler) throw(); >} ># 93 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/new" 3 >void* operator new(std::size_t) throw(std::bad_alloc) > __attribute__((__externally_visible__)); >void* operator new[](std::size_t) throw(std::bad_alloc) > __attribute__((__externally_visible__)); >void operator delete(void*) throw() > __attribute__((__externally_visible__)); >void operator delete[](void*) throw() > __attribute__((__externally_visible__)); >void* operator new(std::size_t, const std::nothrow_t&) throw() > __attribute__((__externally_visible__)); >void* operator new[](std::size_t, const std::nothrow_t&) throw() > __attribute__((__externally_visible__)); >void operator delete(void*, const std::nothrow_t&) throw() > __attribute__((__externally_visible__)); >void operator delete[](void*, const std::nothrow_t&) throw() > __attribute__((__externally_visible__)); > > >inline void* operator new(std::size_t, void* __p) throw() >{ return __p; } >inline void* operator new[](std::size_t, void* __p) throw() >{ return __p; } > > >inline void operator delete (void*, void*) throw() { } >inline void operator delete[](void*, void*) throw() { } > >} > >#pragma GCC visibility pop ># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_construct.h" 2 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/alloc_traits.h" 1 3 ># 32 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/alloc_traits.h" 3 > ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/alloc_traits.h" 3 > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/allocator.h" 1 3 ># 48 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/allocator.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++allocator.h" 1 3 ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++allocator.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/new_allocator.h" 1 3 ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/new_allocator.h" 3 >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > > > using std::size_t; > using std::ptrdiff_t; ># 53 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/new_allocator.h" 3 > template<typename _Tp> > class new_allocator > { > public: > typedef size_t size_type; > typedef ptrdiff_t difference_type; > typedef _Tp* pointer; > typedef const _Tp* const_pointer; > typedef _Tp& reference; > typedef const _Tp& const_reference; > typedef _Tp value_type; > > template<typename _Tp1> > struct rebind > { typedef new_allocator<_Tp1> other; }; > > new_allocator() throw() { } > > new_allocator(const new_allocator&) throw() { } > > template<typename _Tp1> > new_allocator(const new_allocator<_Tp1>&) throw() { } > > ~new_allocator() throw() { } > > pointer > address(reference __x) const > { return std::__addressof(__x); } > > const_pointer > address(const_reference __x) const > { return std::__addressof(__x); } > > > > pointer > allocate(size_type __n, const void* = 0) > { > if (__n > this->max_size()) > std::__throw_bad_alloc(); > > return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp))); > } > > > void > deallocate(pointer __p, size_type) > { ::operator delete(__p); } > > size_type > max_size() const throw() > { return size_t(-1) / sizeof(_Tp); } ># 118 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/new_allocator.h" 3 > void > construct(pointer __p, const _Tp& __val) > { ::new((void *)__p) _Tp(__val); } > > void > destroy(pointer __p) { __p->~_Tp(); } > > }; > > template<typename _Tp> > inline bool > operator==(const new_allocator<_Tp>&, const new_allocator<_Tp>&) > { return true; } > > template<typename _Tp> > inline bool > operator!=(const new_allocator<_Tp>&, const new_allocator<_Tp>&) > { return false; } > > >} ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++allocator.h" 2 3 ># 49 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/allocator.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/allocator.h" 3 > template<typename _Tp> > class allocator; > > > template<> > class allocator<void> > { > public: > typedef size_t size_type; > typedef ptrdiff_t difference_type; > typedef void* pointer; > typedef const void* const_pointer; > typedef void value_type; > > template<typename _Tp1> > struct rebind > { typedef allocator<_Tp1> other; }; > }; > > > > > > > > template<typename _Tp> > class allocator: public __gnu_cxx::new_allocator<_Tp> > { > public: > typedef size_t size_type; > typedef ptrdiff_t difference_type; > typedef _Tp* pointer; > typedef const _Tp* const_pointer; > typedef _Tp& reference; > typedef const _Tp& const_reference; > typedef _Tp value_type; > > template<typename _Tp1> > struct rebind > { typedef allocator<_Tp1> other; }; > > allocator() throw() { } > > allocator(const allocator& __a) throw() > : __gnu_cxx::new_allocator<_Tp>(__a) { } > > template<typename _Tp1> > allocator(const allocator<_Tp1>&) throw() { } > > ~allocator() throw() { } > > > }; > > template<typename _T1, typename _T2> > inline bool > operator==(const allocator<_T1>&, const allocator<_T2>&) > { return true; } > > template<typename _Tp> > inline bool > operator==(const allocator<_Tp>&, const allocator<_Tp>&) > { return true; } > > template<typename _T1, typename _T2> > inline bool > operator!=(const allocator<_T1>&, const allocator<_T2>&) > { return false; } > > template<typename _Tp> > inline bool > operator!=(const allocator<_Tp>&, const allocator<_Tp>&) > { return false; } ># 144 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/allocator.h" 3 > extern template class allocator<char>; > extern template class allocator<wchar_t>; > > > > > > > template<typename _Alloc, bool = __is_empty(_Alloc)> > struct __alloc_swap > { static void _S_do_it(_Alloc&, _Alloc&) { } }; > > template<typename _Alloc> > struct __alloc_swap<_Alloc, false> > { > static void > _S_do_it(_Alloc& __one, _Alloc& __two) > { > > if (__one != __two) > swap(__one, __two); > } > }; > > > template<typename _Alloc, bool = __is_empty(_Alloc)> > struct __alloc_neq > { > static bool > _S_do_it(const _Alloc&, const _Alloc&) > { return false; } > }; > > template<typename _Alloc> > struct __alloc_neq<_Alloc, false> > { > static bool > _S_do_it(const _Alloc& __one, const _Alloc& __two) > { return __one != __two; } > }; ># 215 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/allocator.h" 3 > >} ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/alloc_traits.h" 2 3 > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > template<typename> struct allocator; > >} > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > ># 89 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/alloc_traits.h" 3 >template<typename _Alloc> > struct __alloc_traits > > > > { > typedef _Alloc allocator_type; ># 167 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/alloc_traits.h" 3 > typedef typename _Alloc::pointer pointer; > typedef typename _Alloc::const_pointer const_pointer; > typedef typename _Alloc::value_type value_type; > typedef typename _Alloc::reference reference; > typedef typename _Alloc::const_reference const_reference; > typedef typename _Alloc::size_type size_type; > > static pointer > allocate(_Alloc& __a, size_type __n) > { return __a.allocate(__n); } > > static void deallocate(_Alloc& __a, pointer __p, size_type __n) > { __a.deallocate(__p, __n); } > > template<typename _Tp> > static void construct(_Alloc& __a, pointer __p, const _Tp& __arg) > { __a.construct(__p, __arg); } > > static void destroy(_Alloc& __a, pointer __p) > { __a.destroy(__p); } > > static size_type max_size(const _Alloc& __a) > { return __a.max_size(); } > > static const _Alloc& _S_select_on_copy(const _Alloc& __a) { return __a; } > > static void _S_on_swap(_Alloc& __a, _Alloc& __b) > { > > > std::__alloc_swap<_Alloc>::_S_do_it(__a, __b); > } > > template<typename _Tp> > struct rebind > { typedef typename _Alloc::template rebind<_Tp>::other other; }; > > }; > > >} ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_construct.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 79 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_construct.h" 3 > template<typename _T1, typename _T2> > inline void > _Construct(_T1* __p, const _T2& __value) > { > > > ::new(static_cast<void*>(__p)) _T1(__value); > } > > > > > > template<typename _Tp> > inline void > _Destroy(_Tp* __pointer) > { __pointer->~_Tp(); } > > template<bool> > struct _Destroy_aux > { > template<typename _ForwardIterator> > static void > __destroy(_ForwardIterator __first, _ForwardIterator __last) > { > for (; __first != __last; ++__first) > std::_Destroy(std::__addressof(*__first)); > } > }; > > template<> > struct _Destroy_aux<true> > { > template<typename _ForwardIterator> > static void > __destroy(_ForwardIterator, _ForwardIterator) { } > }; > > > > > > > template<typename _ForwardIterator> > inline void > _Destroy(_ForwardIterator __first, _ForwardIterator __last) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _Value_type; > std::_Destroy_aux<__has_trivial_destructor(_Value_type)>:: > __destroy(__first, __last); > } > > > > > > > > template <typename _Tp> class allocator; > > template<typename _ForwardIterator, typename _Allocator> > void > _Destroy(_ForwardIterator __first, _ForwardIterator __last, > _Allocator& __alloc) > { > typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; > for (; __first != __last; ++__first) > __traits::destroy(__alloc, std::__addressof(*__first)); > } > > template<typename _ForwardIterator, typename _Tp> > inline void > _Destroy(_ForwardIterator __first, _ForwardIterator __last, > allocator<_Tp>&) > { > _Destroy(__first, __last); > } > > >} ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tempbuf.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 85 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tempbuf.h" 3 > template<typename _Tp> > pair<_Tp*, ptrdiff_t> > get_temporary_buffer(ptrdiff_t __len) > { > const ptrdiff_t __max = > __gnu_cxx::__numeric_traits<ptrdiff_t>::__max / sizeof(_Tp); > if (__len > __max) > __len = __max; > > while (__len > 0) > { > _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp), > std::nothrow)); > if (__tmp != 0) > return std::pair<_Tp*, ptrdiff_t>(__tmp, __len); > __len /= 2; > } > return std::pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0); > } ># 112 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tempbuf.h" 3 > template<typename _Tp> > inline void > return_temporary_buffer(_Tp* __p) > { ::operator delete(__p, std::nothrow); } > > > > > > > > template<typename _ForwardIterator, typename _Tp> > class _Temporary_buffer > { > > > > public: > typedef _Tp value_type; > typedef value_type* pointer; > typedef pointer iterator; > typedef ptrdiff_t size_type; > > protected: > size_type _M_original_len; > size_type _M_len; > pointer _M_buffer; > > public: > > size_type > size() const > { return _M_len; } > > > size_type > requested_size() const > { return _M_original_len; } > > > iterator > begin() > { return _M_buffer; } > > > iterator > end() > { return _M_buffer + _M_len; } > > > > > > _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last); > > ~_Temporary_buffer() > { > std::_Destroy(_M_buffer, _M_buffer + _M_len); > std::return_temporary_buffer(_M_buffer); > } > > private: > > _Temporary_buffer(const _Temporary_buffer&); > > void > operator=(const _Temporary_buffer&); > }; > > > template<bool> > struct __uninitialized_construct_buf_dispatch > { > template<typename _ForwardIterator, typename _Tp> > static void > __ucr(_ForwardIterator __first, _ForwardIterator __last, > _Tp& __value) > { > if(__first == __last) > return; > > _ForwardIterator __cur = __first; > try > { > std::_Construct(std::__addressof(*__first), > (__value)); > _ForwardIterator __prev = __cur; > ++__cur; > for(; __cur != __last; ++__cur, ++__prev) > std::_Construct(std::__addressof(*__cur), > (*__prev)); > __value = (*__prev); > } > catch(...) > { > std::_Destroy(__first, __cur); > throw; > } > } > }; > > template<> > struct __uninitialized_construct_buf_dispatch<true> > { > template<typename _ForwardIterator, typename _Tp> > static void > __ucr(_ForwardIterator, _ForwardIterator, _Tp&) { } > }; ># 231 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tempbuf.h" 3 > template<typename _ForwardIterator, typename _Tp> > inline void > __uninitialized_construct_buf(_ForwardIterator __first, > _ForwardIterator __last, > _Tp& __value) > { > typedef typename std::iterator_traits<_ForwardIterator>::value_type > _ValueType; > > std::__uninitialized_construct_buf_dispatch< > __has_trivial_constructor(_ValueType)>:: > __ucr(__first, __last, __value); > } > > template<typename _ForwardIterator, typename _Tp> > _Temporary_buffer<_ForwardIterator, _Tp>:: > _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) > : _M_original_len(std::distance(__first, __last)), > _M_len(0), _M_buffer(0) > { > try > { > std::pair<pointer, size_type> __p(std::get_temporary_buffer< > value_type>(_M_original_len)); > _M_buffer = __p.first; > _M_len = __p.second; > if(_M_buffer) > std::__uninitialized_construct_buf(_M_buffer, _M_buffer + _M_len, > *__first); > } > catch(...) > { > std::return_temporary_buffer(_M_buffer); > _M_buffer = 0; > _M_len = 0; > throw; > } > } > > >} ># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 2 3 ># 73 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > template<typename _Iterator> > void > __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c) > { > > > > > if (*__a < *__b) > { > if (*__b < *__c) > std::iter_swap(__a, __b); > else if (*__a < *__c) > std::iter_swap(__a, __c); > } > else if (*__a < *__c) > return; > else if (*__b < *__c) > std::iter_swap(__a, __c); > else > std::iter_swap(__a, __b); > } > > > template<typename _Iterator, typename _Compare> > void > __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c, > _Compare __comp) > { > > > > > > if (__comp(*__a, *__b)) > { > if (__comp(*__b, *__c)) > std::iter_swap(__a, __b); > else if (__comp(*__a, *__c)) > std::iter_swap(__a, __c); > } > else if (__comp(*__a, *__c)) > return; > else if (__comp(*__b, *__c)) > std::iter_swap(__a, __c); > else > std::iter_swap(__a, __b); > } > > > > > template<typename _InputIterator, typename _Tp> > inline _InputIterator > __find(_InputIterator __first, _InputIterator __last, > const _Tp& __val, input_iterator_tag) > { > while (__first != __last && !(*__first == __val)) > ++__first; > return __first; > } > > > template<typename _InputIterator, typename _Predicate> > inline _InputIterator > __find_if(_InputIterator __first, _InputIterator __last, > _Predicate __pred, input_iterator_tag) > { > while (__first != __last && !bool(__pred(*__first))) > ++__first; > return __first; > } > > > template<typename _RandomAccessIterator, typename _Tp> > _RandomAccessIterator > __find(_RandomAccessIterator __first, _RandomAccessIterator __last, > const _Tp& __val, random_access_iterator_tag) > { > typename iterator_traits<_RandomAccessIterator>::difference_type > __trip_count = (__last - __first) >> 2; > > for (; __trip_count > 0; --__trip_count) > { > if (*__first == __val) > return __first; > ++__first; > > if (*__first == __val) > return __first; > ++__first; > > if (*__first == __val) > return __first; > ++__first; > > if (*__first == __val) > return __first; > ++__first; > } > > switch (__last - __first) > { > case 3: > if (*__first == __val) > return __first; > ++__first; > case 2: > if (*__first == __val) > return __first; > ++__first; > case 1: > if (*__first == __val) > return __first; > ++__first; > case 0: > default: > return __last; > } > } > > > template<typename _RandomAccessIterator, typename _Predicate> > _RandomAccessIterator > __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Predicate __pred, random_access_iterator_tag) > { > typename iterator_traits<_RandomAccessIterator>::difference_type > __trip_count = (__last - __first) >> 2; > > for (; __trip_count > 0; --__trip_count) > { > if (__pred(*__first)) > return __first; > ++__first; > > if (__pred(*__first)) > return __first; > ++__first; > > if (__pred(*__first)) > return __first; > ++__first; > > if (__pred(*__first)) > return __first; > ++__first; > } > > switch (__last - __first) > { > case 3: > if (__pred(*__first)) > return __first; > ++__first; > case 2: > if (__pred(*__first)) > return __first; > ++__first; > case 1: > if (__pred(*__first)) > return __first; > ++__first; > case 0: > default: > return __last; > } > } > > > template<typename _InputIterator, typename _Predicate> > inline _InputIterator > __find_if_not(_InputIterator __first, _InputIterator __last, > _Predicate __pred, input_iterator_tag) > { > while (__first != __last && bool(__pred(*__first))) > ++__first; > return __first; > } > > > template<typename _RandomAccessIterator, typename _Predicate> > _RandomAccessIterator > __find_if_not(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Predicate __pred, random_access_iterator_tag) > { > typename iterator_traits<_RandomAccessIterator>::difference_type > __trip_count = (__last - __first) >> 2; > > for (; __trip_count > 0; --__trip_count) > { > if (!bool(__pred(*__first))) > return __first; > ++__first; > > if (!bool(__pred(*__first))) > return __first; > ++__first; > > if (!bool(__pred(*__first))) > return __first; > ++__first; > > if (!bool(__pred(*__first))) > return __first; > ++__first; > } > > switch (__last - __first) > { > case 3: > if (!bool(__pred(*__first))) > return __first; > ++__first; > case 2: > if (!bool(__pred(*__first))) > return __first; > ++__first; > case 1: > if (!bool(__pred(*__first))) > return __first; > ++__first; > case 0: > default: > return __last; > } > } > > > template<typename _InputIterator, typename _Predicate> > inline _InputIterator > __find_if_not(_InputIterator __first, _InputIterator __last, > _Predicate __pred) > { > return std::__find_if_not(__first, __last, __pred, > std::__iterator_category(__first)); > } > > > > > template<typename _InputIterator, typename _Predicate, typename _Distance> > _InputIterator > __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred) > { > for (; __len; --__len, ++__first) > if (!bool(__pred(*__first))) > break; > return __first; > } ># 347 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Integer, typename _Tp> > _ForwardIterator > __search_n(_ForwardIterator __first, _ForwardIterator __last, > _Integer __count, const _Tp& __val, > std::forward_iterator_tag) > { > __first = std::find(__first, __last, __val); > while (__first != __last) > { > typename iterator_traits<_ForwardIterator>::difference_type > __n = __count; > _ForwardIterator __i = __first; > ++__i; > while (__i != __last && __n != 1 && *__i == __val) > { > ++__i; > --__n; > } > if (__n == 1) > return __first; > if (__i == __last) > return __last; > __first = std::find(++__i, __last, __val); > } > return __last; > } > > > > > > > template<typename _RandomAccessIter, typename _Integer, typename _Tp> > _RandomAccessIter > __search_n(_RandomAccessIter __first, _RandomAccessIter __last, > _Integer __count, const _Tp& __val, > std::random_access_iterator_tag) > { > > typedef typename std::iterator_traits<_RandomAccessIter>::difference_type > _DistanceType; > > _DistanceType __tailSize = __last - __first; > const _DistanceType __pattSize = __count; > > if (__tailSize < __pattSize) > return __last; > > const _DistanceType __skipOffset = __pattSize - 1; > _RandomAccessIter __lookAhead = __first + __skipOffset; > __tailSize -= __pattSize; > > while (1) > { > > > while (!(*__lookAhead == __val)) > { > if (__tailSize < __pattSize) > return __last; > __lookAhead += __pattSize; > __tailSize -= __pattSize; > } > _DistanceType __remainder = __skipOffset; > for (_RandomAccessIter __backTrack = __lookAhead - 1; > *__backTrack == __val; --__backTrack) > { > if (--__remainder == 0) > return (__lookAhead - __skipOffset); > } > if (__remainder > __tailSize) > return __last; > __lookAhead += __remainder; > __tailSize -= __remainder; > } > } ># 432 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Integer, typename _Tp, > typename _BinaryPredicate> > _ForwardIterator > __search_n(_ForwardIterator __first, _ForwardIterator __last, > _Integer __count, const _Tp& __val, > _BinaryPredicate __binary_pred, std::forward_iterator_tag) > { > while (__first != __last && !bool(__binary_pred(*__first, __val))) > ++__first; > > while (__first != __last) > { > typename iterator_traits<_ForwardIterator>::difference_type > __n = __count; > _ForwardIterator __i = __first; > ++__i; > while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))) > { > ++__i; > --__n; > } > if (__n == 1) > return __first; > if (__i == __last) > return __last; > __first = ++__i; > while (__first != __last > && !bool(__binary_pred(*__first, __val))) > ++__first; > } > return __last; > } > > > > > > > > template<typename _RandomAccessIter, typename _Integer, typename _Tp, > typename _BinaryPredicate> > _RandomAccessIter > __search_n(_RandomAccessIter __first, _RandomAccessIter __last, > _Integer __count, const _Tp& __val, > _BinaryPredicate __binary_pred, std::random_access_iterator_tag) > { > > typedef typename std::iterator_traits<_RandomAccessIter>::difference_type > _DistanceType; > > _DistanceType __tailSize = __last - __first; > const _DistanceType __pattSize = __count; > > if (__tailSize < __pattSize) > return __last; > > const _DistanceType __skipOffset = __pattSize - 1; > _RandomAccessIter __lookAhead = __first + __skipOffset; > __tailSize -= __pattSize; > > while (1) > { > > > while (!bool(__binary_pred(*__lookAhead, __val))) > { > if (__tailSize < __pattSize) > return __last; > __lookAhead += __pattSize; > __tailSize -= __pattSize; > } > _DistanceType __remainder = __skipOffset; > for (_RandomAccessIter __backTrack = __lookAhead - 1; > __binary_pred(*__backTrack, __val); --__backTrack) > { > if (--__remainder == 0) > return (__lookAhead - __skipOffset); > } > if (__remainder > __tailSize) > return __last; > __lookAhead += __remainder; > __tailSize -= __remainder; > } > } > > > template<typename _ForwardIterator1, typename _ForwardIterator2> > _ForwardIterator1 > __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2, _ForwardIterator2 __last2, > forward_iterator_tag, forward_iterator_tag) > { > if (__first2 == __last2) > return __last1; > else > { > _ForwardIterator1 __result = __last1; > while (1) > { > _ForwardIterator1 __new_result > = std::search(__first1, __last1, __first2, __last2); > if (__new_result == __last1) > return __result; > else > { > __result = __new_result; > __first1 = __new_result; > ++__first1; > } > } > } > } > > template<typename _ForwardIterator1, typename _ForwardIterator2, > typename _BinaryPredicate> > _ForwardIterator1 > __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2, _ForwardIterator2 __last2, > forward_iterator_tag, forward_iterator_tag, > _BinaryPredicate __comp) > { > if (__first2 == __last2) > return __last1; > else > { > _ForwardIterator1 __result = __last1; > while (1) > { > _ForwardIterator1 __new_result > = std::search(__first1, __last1, __first2, > __last2, __comp); > if (__new_result == __last1) > return __result; > else > { > __result = __new_result; > __first1 = __new_result; > ++__first1; > } > } > } > } > > > template<typename _BidirectionalIterator1, typename _BidirectionalIterator2> > _BidirectionalIterator1 > __find_end(_BidirectionalIterator1 __first1, > _BidirectionalIterator1 __last1, > _BidirectionalIterator2 __first2, > _BidirectionalIterator2 __last2, > bidirectional_iterator_tag, bidirectional_iterator_tag) > { > > > > > > > typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; > typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; > > _RevIterator1 __rlast1(__first1); > _RevIterator2 __rlast2(__first2); > _RevIterator1 __rresult = std::search(_RevIterator1(__last1), > __rlast1, > _RevIterator2(__last2), > __rlast2); > > if (__rresult == __rlast1) > return __last1; > else > { > _BidirectionalIterator1 __result = __rresult.base(); > std::advance(__result, -std::distance(__first2, __last2)); > return __result; > } > } > > template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, > typename _BinaryPredicate> > _BidirectionalIterator1 > __find_end(_BidirectionalIterator1 __first1, > _BidirectionalIterator1 __last1, > _BidirectionalIterator2 __first2, > _BidirectionalIterator2 __last2, > bidirectional_iterator_tag, bidirectional_iterator_tag, > _BinaryPredicate __comp) > { > > > > > > > typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; > typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; > > _RevIterator1 __rlast1(__first1); > _RevIterator2 __rlast2(__first2); > _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, > _RevIterator2(__last2), __rlast2, > __comp); > > if (__rresult == __rlast1) > return __last1; > else > { > _BidirectionalIterator1 __result = __rresult.base(); > std::advance(__result, -std::distance(__first2, __last2)); > return __result; > } > } ># 671 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator1, typename _ForwardIterator2> > inline _ForwardIterator1 > find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2, _ForwardIterator2 __last2) > { > > > > > > > ; > ; > > return std::__find_end(__first1, __last1, __first2, __last2, > std::__iterator_category(__first1), > std::__iterator_category(__first2)); > } ># 718 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator1, typename _ForwardIterator2, > typename _BinaryPredicate> > inline _ForwardIterator1 > find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2, _ForwardIterator2 __last2, > _BinaryPredicate __comp) > { > > > > > > > ; > ; > > return std::__find_end(__first1, __last1, __first2, __last2, > std::__iterator_category(__first1), > std::__iterator_category(__first2), > __comp); > } ># 897 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator, typename _Tp> > _OutputIterator > remove_copy(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, const _Tp& __value) > { > > > > > > > ; > > for (; __first != __last; ++__first) > if (!(*__first == __value)) > { > *__result = *__first; > ++__result; > } > return __result; > } ># 934 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator, > typename _Predicate> > _OutputIterator > remove_copy_if(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, _Predicate __pred) > { > > > > > > > ; > > for (; __first != __last; ++__first) > if (!bool(__pred(*__first))) > { > *__result = *__first; > ++__result; > } > return __result; > } ># 1115 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp> > _ForwardIterator > remove(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __value) > { > > > > > > ; > > __first = std::find(__first, __last, __value); > if(__first == __last) > return __first; > _ForwardIterator __result = __first; > ++__first; > for(; __first != __last; ++__first) > if(!(*__first == __value)) > { > *__result = (*__first); > ++__result; > } > return __result; > } ># 1158 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Predicate> > _ForwardIterator > remove_if(_ForwardIterator __first, _ForwardIterator __last, > _Predicate __pred) > { > > > > > > ; > > __first = std::find_if(__first, __last, __pred); > if(__first == __last) > return __first; > _ForwardIterator __result = __first; > ++__first; > for(; __first != __last; ++__first) > if(!bool(__pred(*__first))) > { > *__result = (*__first); > ++__result; > } > return __result; > } ># 1198 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator> > _ForwardIterator > unique(_ForwardIterator __first, _ForwardIterator __last) > { > > > > > > ; > > > __first = std::adjacent_find(__first, __last); > if (__first == __last) > return __last; > > > _ForwardIterator __dest = __first; > ++__first; > while (++__first != __last) > if (!(*__dest == *__first)) > *++__dest = (*__first); > return ++__dest; > } ># 1238 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _BinaryPredicate> > _ForwardIterator > unique(_ForwardIterator __first, _ForwardIterator __last, > _BinaryPredicate __binary_pred) > { > > > > > > > ; > > > __first = std::adjacent_find(__first, __last, __binary_pred); > if (__first == __last) > return __last; > > > _ForwardIterator __dest = __first; > ++__first; > while (++__first != __last) > if (!bool(__binary_pred(*__dest, *__first))) > *++__dest = (*__first); > return ++__dest; > } > > > > > > > template<typename _ForwardIterator, typename _OutputIterator> > _OutputIterator > __unique_copy(_ForwardIterator __first, _ForwardIterator __last, > _OutputIterator __result, > forward_iterator_tag, output_iterator_tag) > { > > _ForwardIterator __next = __first; > *__result = *__first; > while (++__next != __last) > if (!(*__first == *__next)) > { > __first = __next; > *++__result = *__first; > } > return ++__result; > } > > > > > > > template<typename _InputIterator, typename _OutputIterator> > _OutputIterator > __unique_copy(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, > input_iterator_tag, output_iterator_tag) > { > > typename iterator_traits<_InputIterator>::value_type __value = *__first; > *__result = __value; > while (++__first != __last) > if (!(__value == *__first)) > { > __value = *__first; > *++__result = __value; > } > return ++__result; > } > > > > > > > template<typename _InputIterator, typename _ForwardIterator> > _ForwardIterator > __unique_copy(_InputIterator __first, _InputIterator __last, > _ForwardIterator __result, > input_iterator_tag, forward_iterator_tag) > { > > *__result = *__first; > while (++__first != __last) > if (!(*__result == *__first)) > *++__result = *__first; > return ++__result; > } > > > > > > > > template<typename _ForwardIterator, typename _OutputIterator, > typename _BinaryPredicate> > _OutputIterator > __unique_copy(_ForwardIterator __first, _ForwardIterator __last, > _OutputIterator __result, _BinaryPredicate __binary_pred, > forward_iterator_tag, output_iterator_tag) > { > > > > > > _ForwardIterator __next = __first; > *__result = *__first; > while (++__next != __last) > if (!bool(__binary_pred(*__first, *__next))) > { > __first = __next; > *++__result = *__first; > } > return ++__result; > } > > > > > > > > template<typename _InputIterator, typename _OutputIterator, > typename _BinaryPredicate> > _OutputIterator > __unique_copy(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, _BinaryPredicate __binary_pred, > input_iterator_tag, output_iterator_tag) > { > > > > > > typename iterator_traits<_InputIterator>::value_type __value = *__first; > *__result = __value; > while (++__first != __last) > if (!bool(__binary_pred(__value, *__first))) > { > __value = *__first; > *++__result = __value; > } > return ++__result; > } > > > > > > > > template<typename _InputIterator, typename _ForwardIterator, > typename _BinaryPredicate> > _ForwardIterator > __unique_copy(_InputIterator __first, _InputIterator __last, > _ForwardIterator __result, _BinaryPredicate __binary_pred, > input_iterator_tag, forward_iterator_tag) > { > > > > > > *__result = *__first; > while (++__first != __last) > if (!bool(__binary_pred(*__result, *__first))) > *++__result = *__first; > return ++__result; > } > > > > > > > template<typename _BidirectionalIterator> > void > __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, > bidirectional_iterator_tag) > { > while (true) > if (__first == __last || __first == --__last) > return; > else > { > std::iter_swap(__first, __last); > ++__first; > } > } > > > > > > > template<typename _RandomAccessIterator> > void > __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, > random_access_iterator_tag) > { > if (__first == __last) > return; > --__last; > while (__first < __last) > { > std::iter_swap(__first, __last); > ++__first; > --__last; > } > } ># 1466 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator> > inline void > reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) > { > > > > ; > std::__reverse(__first, __last, std::__iterator_category(__first)); > } ># 1493 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator, typename _OutputIterator> > _OutputIterator > reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, > _OutputIterator __result) > { > > > > > > ; > > while (__first != __last) > { > --__last; > *__result = *__last; > ++__result; > } > return __result; > } > > > > > > template<typename _EuclideanRingElement> > _EuclideanRingElement > __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) > { > while (__n != 0) > { > _EuclideanRingElement __t = __m % __n; > __m = __n; > __n = __t; > } > return __m; > } > > > template<typename _ForwardIterator> > void > __rotate(_ForwardIterator __first, > _ForwardIterator __middle, > _ForwardIterator __last, > forward_iterator_tag) > { > if (__first == __middle || __last == __middle) > return; > > _ForwardIterator __first2 = __middle; > do > { > std::iter_swap(__first, __first2); > ++__first; > ++__first2; > if (__first == __middle) > __middle = __first2; > } > while (__first2 != __last); > > __first2 = __middle; > > while (__first2 != __last) > { > std::iter_swap(__first, __first2); > ++__first; > ++__first2; > if (__first == __middle) > __middle = __first2; > else if (__first2 == __last) > __first2 = __middle; > } > } > > > template<typename _BidirectionalIterator> > void > __rotate(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last, > bidirectional_iterator_tag) > { > > > > > if (__first == __middle || __last == __middle) > return; > > std::__reverse(__first, __middle, bidirectional_iterator_tag()); > std::__reverse(__middle, __last, bidirectional_iterator_tag()); > > while (__first != __middle && __middle != __last) > { > std::iter_swap(__first, --__last); > ++__first; > } > > if (__first == __middle) > std::__reverse(__middle, __last, bidirectional_iterator_tag()); > else > std::__reverse(__first, __middle, bidirectional_iterator_tag()); > } > > > template<typename _RandomAccessIterator> > void > __rotate(_RandomAccessIterator __first, > _RandomAccessIterator __middle, > _RandomAccessIterator __last, > random_access_iterator_tag) > { > > > > > if (__first == __middle || __last == __middle) > return; > > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _Distance; > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > _Distance __n = __last - __first; > _Distance __k = __middle - __first; > > if (__k == __n - __k) > { > std::swap_ranges(__first, __middle, __middle); > return; > } > > _RandomAccessIterator __p = __first; > > for (;;) > { > if (__k < __n - __k) > { > if (__is_pod(_ValueType) && __k == 1) > { > _ValueType __t = (*__p); > std::copy(__p + 1, __p + __n, __p); > *(__p + __n - 1) = (__t); > return; > } > _RandomAccessIterator __q = __p + __k; > for (_Distance __i = 0; __i < __n - __k; ++ __i) > { > std::iter_swap(__p, __q); > ++__p; > ++__q; > } > __n %= __k; > if (__n == 0) > return; > std::swap(__n, __k); > __k = __n - __k; > } > else > { > __k = __n - __k; > if (__is_pod(_ValueType) && __k == 1) > { > _ValueType __t = (*(__p + __n - 1)); > std::copy_backward(__p, __p + __n - 1, __p + __n); > *__p = (__t); > return; > } > _RandomAccessIterator __q = __p + __n; > __p = __q - __k; > for (_Distance __i = 0; __i < __n - __k; ++ __i) > { > --__p; > --__q; > std::iter_swap(__p, __q); > } > __n %= __k; > if (__n == 0) > return; > std::swap(__n, __k); > } > } > } ># 1699 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator> > inline void > rotate(_ForwardIterator __first, _ForwardIterator __middle, > _ForwardIterator __last) > { > > > > ; > ; > > typedef typename iterator_traits<_ForwardIterator>::iterator_category > _IterType; > std::__rotate(__first, __middle, __last, _IterType()); > } ># 1735 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _OutputIterator> > _OutputIterator > rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, > _ForwardIterator __last, _OutputIterator __result) > { > > > > > ; > ; > > return std::copy(__first, __middle, > std::copy(__middle, __last, __result)); > } > > > template<typename _ForwardIterator, typename _Predicate> > _ForwardIterator > __partition(_ForwardIterator __first, _ForwardIterator __last, > _Predicate __pred, forward_iterator_tag) > { > if (__first == __last) > return __first; > > while (__pred(*__first)) > if (++__first == __last) > return __first; > > _ForwardIterator __next = __first; > > while (++__next != __last) > if (__pred(*__next)) > { > std::iter_swap(__first, __next); > ++__first; > } > > return __first; > } > > > template<typename _BidirectionalIterator, typename _Predicate> > _BidirectionalIterator > __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, > _Predicate __pred, bidirectional_iterator_tag) > { > while (true) > { > while (true) > if (__first == __last) > return __first; > else if (__pred(*__first)) > ++__first; > else > break; > --__last; > while (true) > if (__first == __last) > return __first; > else if (!bool(__pred(*__last))) > --__last; > else > break; > std::iter_swap(__first, __last); > ++__first; > } > } > > > > > > > template<typename _ForwardIterator, typename _Predicate, typename _Distance> > _ForwardIterator > __inplace_stable_partition(_ForwardIterator __first, > _Predicate __pred, _Distance __len) > { > if (__len == 1) > return __first; > _ForwardIterator __middle = __first; > std::advance(__middle, __len / 2); > _ForwardIterator __left_split = > std::__inplace_stable_partition(__first, __pred, __len / 2); > > > _Distance __right_len = __len - __len / 2; > _ForwardIterator __right_split = > std::__find_if_not_n(__middle, __right_len, __pred); > if (__right_len) > __right_split = std::__inplace_stable_partition(__middle, > __pred, > __right_len); > std::rotate(__left_split, __middle, __right_split); > std::advance(__left_split, std::distance(__middle, __right_split)); > return __left_split; > } > > > > > > > > template<typename _ForwardIterator, typename _Pointer, typename _Predicate, > typename _Distance> > _ForwardIterator > __stable_partition_adaptive(_ForwardIterator __first, > _ForwardIterator __last, > _Predicate __pred, _Distance __len, > _Pointer __buffer, > _Distance __buffer_size) > { > if (__len <= __buffer_size) > { > _ForwardIterator __result1 = __first; > _Pointer __result2 = __buffer; > > > > *__result2 = (*__first); > ++__result2; > ++__first; > for (; __first != __last; ++__first) > if (__pred(*__first)) > { > *__result1 = (*__first); > ++__result1; > } > else > { > *__result2 = (*__first); > ++__result2; > } > std::copy(__buffer, __result2, __result1); > return __result1; > } > else > { > _ForwardIterator __middle = __first; > std::advance(__middle, __len / 2); > _ForwardIterator __left_split = > std::__stable_partition_adaptive(__first, __middle, __pred, > __len / 2, __buffer, > __buffer_size); > > > _Distance __right_len = __len - __len / 2; > _ForwardIterator __right_split = > std::__find_if_not_n(__middle, __right_len, __pred); > if (__right_len) > __right_split = > std::__stable_partition_adaptive(__right_split, __last, __pred, > __right_len, > __buffer, __buffer_size); > std::rotate(__left_split, __middle, __right_split); > std::advance(__left_split, std::distance(__middle, __right_split)); > return __left_split; > } > } ># 1914 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Predicate> > _ForwardIterator > stable_partition(_ForwardIterator __first, _ForwardIterator __last, > _Predicate __pred) > { > > > > > > ; > > __first = std::__find_if_not(__first, __last, __pred); > > if (__first == __last) > return __first; > else > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, > __last); > if (__buf.size() > 0) > return > std::__stable_partition_adaptive(__first, __last, __pred, > _DistanceType(__buf.requested_size()), > __buf.begin(), > _DistanceType(__buf.size())); > else > return > std::__inplace_stable_partition(__first, __pred, > _DistanceType(__buf.requested_size())); > } > } > > > template<typename _RandomAccessIterator> > void > __heap_select(_RandomAccessIterator __first, > _RandomAccessIterator __middle, > _RandomAccessIterator __last) > { > std::make_heap(__first, __middle); > for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) > if (*__i < *__first) > std::__pop_heap(__first, __middle, __i); > } > > > template<typename _RandomAccessIterator, typename _Compare> > void > __heap_select(_RandomAccessIterator __first, > _RandomAccessIterator __middle, > _RandomAccessIterator __last, _Compare __comp) > { > std::make_heap(__first, __middle, __comp); > for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) > if (__comp(*__i, *__first)) > std::__pop_heap(__first, __middle, __i, __comp); > } ># 1998 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _RandomAccessIterator> > _RandomAccessIterator > partial_sort_copy(_InputIterator __first, _InputIterator __last, > _RandomAccessIterator __result_first, > _RandomAccessIterator __result_last) > { > typedef typename iterator_traits<_InputIterator>::value_type > _InputValueType; > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _OutputValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > > > > > ; > ; > > if (__result_first == __result_last) > return __result_last; > _RandomAccessIterator __result_real_last = __result_first; > while(__first != __last && __result_real_last != __result_last) > { > *__result_real_last = *__first; > ++__result_real_last; > ++__first; > } > std::make_heap(__result_first, __result_real_last); > while (__first != __last) > { > if (*__first < *__result_first) > std::__adjust_heap(__result_first, _DistanceType(0), > _DistanceType(__result_real_last > - __result_first), > _InputValueType(*__first)); > ++__first; > } > std::sort_heap(__result_first, __result_real_last); > return __result_real_last; > } ># 2064 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare> > _RandomAccessIterator > partial_sort_copy(_InputIterator __first, _InputIterator __last, > _RandomAccessIterator __result_first, > _RandomAccessIterator __result_last, > _Compare __comp) > { > typedef typename iterator_traits<_InputIterator>::value_type > _InputValueType; > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _OutputValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > > > > > > > > ; > ; > > if (__result_first == __result_last) > return __result_last; > _RandomAccessIterator __result_real_last = __result_first; > while(__first != __last && __result_real_last != __result_last) > { > *__result_real_last = *__first; > ++__result_real_last; > ++__first; > } > std::make_heap(__result_first, __result_real_last, __comp); > while (__first != __last) > { > if (__comp(*__first, *__result_first)) > std::__adjust_heap(__result_first, _DistanceType(0), > _DistanceType(__result_real_last > - __result_first), > _InputValueType(*__first), > __comp); > ++__first; > } > std::sort_heap(__result_first, __result_real_last, __comp); > return __result_real_last; > } > > > template<typename _RandomAccessIterator> > void > __unguarded_linear_insert(_RandomAccessIterator __last) > { > typename iterator_traits<_RandomAccessIterator>::value_type > __val = (*__last); > _RandomAccessIterator __next = __last; > --__next; > while (__val < *__next) > { > *__last = (*__next); > __last = __next; > --__next; > } > *__last = (__val); > } > > > template<typename _RandomAccessIterator, typename _Compare> > void > __unguarded_linear_insert(_RandomAccessIterator __last, > _Compare __comp) > { > typename iterator_traits<_RandomAccessIterator>::value_type > __val = (*__last); > _RandomAccessIterator __next = __last; > --__next; > while (__comp(__val, *__next)) > { > *__last = (*__next); > __last = __next; > --__next; > } > *__last = (__val); > } > > > template<typename _RandomAccessIterator> > void > __insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last) > { > if (__first == __last) > return; > > for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) > { > if (*__i < *__first) > { > typename iterator_traits<_RandomAccessIterator>::value_type > __val = (*__i); > std::copy_backward(__first, __i, __i + 1); > *__first = (__val); > } > else > std::__unguarded_linear_insert(__i); > } > } > > > template<typename _RandomAccessIterator, typename _Compare> > void > __insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last, _Compare __comp) > { > if (__first == __last) return; > > for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) > { > if (__comp(*__i, *__first)) > { > typename iterator_traits<_RandomAccessIterator>::value_type > __val = (*__i); > std::copy_backward(__first, __i, __i + 1); > *__first = (__val); > } > else > std::__unguarded_linear_insert(__i, __comp); > } > } > > > template<typename _RandomAccessIterator> > inline void > __unguarded_insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > for (_RandomAccessIterator __i = __first; __i != __last; ++__i) > std::__unguarded_linear_insert(__i); > } > > > template<typename _RandomAccessIterator, typename _Compare> > inline void > __unguarded_insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last, _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > for (_RandomAccessIterator __i = __first; __i != __last; ++__i) > std::__unguarded_linear_insert(__i, __comp); > } > > > > > > enum { _S_threshold = 16 }; > > > template<typename _RandomAccessIterator> > void > __final_insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last) > { > if (__last - __first > int(_S_threshold)) > { > std::__insertion_sort(__first, __first + int(_S_threshold)); > std::__unguarded_insertion_sort(__first + int(_S_threshold), __last); > } > else > std::__insertion_sort(__first, __last); > } > > > template<typename _RandomAccessIterator, typename _Compare> > void > __final_insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last, _Compare __comp) > { > if (__last - __first > int(_S_threshold)) > { > std::__insertion_sort(__first, __first + int(_S_threshold), __comp); > std::__unguarded_insertion_sort(__first + int(_S_threshold), __last, > __comp); > } > else > std::__insertion_sort(__first, __last, __comp); > } > > > template<typename _RandomAccessIterator, typename _Tp> > _RandomAccessIterator > __unguarded_partition(_RandomAccessIterator __first, > _RandomAccessIterator __last, const _Tp& __pivot) > { > while (true) > { > while (*__first < __pivot) > ++__first; > --__last; > while (__pivot < *__last) > --__last; > if (!(__first < __last)) > return __first; > std::iter_swap(__first, __last); > ++__first; > } > } > > > template<typename _RandomAccessIterator, typename _Tp, typename _Compare> > _RandomAccessIterator > __unguarded_partition(_RandomAccessIterator __first, > _RandomAccessIterator __last, > const _Tp& __pivot, _Compare __comp) > { > while (true) > { > while (__comp(*__first, __pivot)) > ++__first; > --__last; > while (__comp(__pivot, *__last)) > --__last; > if (!(__first < __last)) > return __first; > std::iter_swap(__first, __last); > ++__first; > } > } > > > template<typename _RandomAccessIterator> > inline _RandomAccessIterator > __unguarded_partition_pivot(_RandomAccessIterator __first, > _RandomAccessIterator __last) > { > _RandomAccessIterator __mid = __first + (__last - __first) / 2; > std::__move_median_first(__first, __mid, (__last - 1)); > return std::__unguarded_partition(__first + 1, __last, *__first); > } > > > > template<typename _RandomAccessIterator, typename _Compare> > inline _RandomAccessIterator > __unguarded_partition_pivot(_RandomAccessIterator __first, > _RandomAccessIterator __last, _Compare __comp) > { > _RandomAccessIterator __mid = __first + (__last - __first) / 2; > std::__move_median_first(__first, __mid, (__last - 1), __comp); > return std::__unguarded_partition(__first + 1, __last, *__first, __comp); > } > > > template<typename _RandomAccessIterator, typename _Size> > void > __introsort_loop(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Size __depth_limit) > { > while (__last - __first > int(_S_threshold)) > { > if (__depth_limit == 0) > { > std::partial_sort(__first, __last, __last); > return; > } > --__depth_limit; > _RandomAccessIterator __cut = > std::__unguarded_partition_pivot(__first, __last); > std::__introsort_loop(__cut, __last, __depth_limit); > __last = __cut; > } > } > > > template<typename _RandomAccessIterator, typename _Size, typename _Compare> > void > __introsort_loop(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Size __depth_limit, _Compare __comp) > { > while (__last - __first > int(_S_threshold)) > { > if (__depth_limit == 0) > { > std::partial_sort(__first, __last, __last, __comp); > return; > } > --__depth_limit; > _RandomAccessIterator __cut = > std::__unguarded_partition_pivot(__first, __last, __comp); > std::__introsort_loop(__cut, __last, __depth_limit, __comp); > __last = __cut; > } > } > > > > template<typename _RandomAccessIterator, typename _Size> > void > __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, > _RandomAccessIterator __last, _Size __depth_limit) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > while (__last - __first > 3) > { > if (__depth_limit == 0) > { > std::__heap_select(__first, __nth + 1, __last); > > > std::iter_swap(__first, __nth); > return; > } > --__depth_limit; > _RandomAccessIterator __cut = > std::__unguarded_partition_pivot(__first, __last); > if (__cut <= __nth) > __first = __cut; > else > __last = __cut; > } > std::__insertion_sort(__first, __last); > } > > template<typename _RandomAccessIterator, typename _Size, typename _Compare> > void > __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, > _RandomAccessIterator __last, _Size __depth_limit, > _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > while (__last - __first > 3) > { > if (__depth_limit == 0) > { > std::__heap_select(__first, __nth + 1, __last, __comp); > > std::iter_swap(__first, __nth); > return; > } > --__depth_limit; > _RandomAccessIterator __cut = > std::__unguarded_partition_pivot(__first, __last, __comp); > if (__cut <= __nth) > __first = __cut; > else > __last = __cut; > } > std::__insertion_sort(__first, __last, __comp); > } ># 2448 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp, typename _Compare> > _ForwardIterator > lower_bound(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val, _Compare __comp) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > > > > > > ; > > _DistanceType __len = std::distance(__first, __last); > > while (__len > 0) > { > _DistanceType __half = __len >> 1; > _ForwardIterator __middle = __first; > std::advance(__middle, __half); > if (__comp(*__middle, __val)) > { > __first = __middle; > ++__first; > __len = __len - __half - 1; > } > else > __len = __half; > } > return __first; > } ># 2495 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp> > _ForwardIterator > upper_bound(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > > > > ; > > _DistanceType __len = std::distance(__first, __last); > > while (__len > 0) > { > _DistanceType __half = __len >> 1; > _ForwardIterator __middle = __first; > std::advance(__middle, __half); > if (__val < *__middle) > __len = __half; > else > { > __first = __middle; > ++__first; > __len = __len - __half - 1; > } > } > return __first; > } ># 2544 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp, typename _Compare> > _ForwardIterator > upper_bound(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val, _Compare __comp) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > > > > > > ; > > _DistanceType __len = std::distance(__first, __last); > > while (__len > 0) > { > _DistanceType __half = __len >> 1; > _ForwardIterator __middle = __first; > std::advance(__middle, __half); > if (__comp(__val, *__middle)) > __len = __half; > else > { > __first = __middle; > ++__first; > __len = __len - __half - 1; > } > } > return __first; > } ># 2597 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp> > pair<_ForwardIterator, _ForwardIterator> > equal_range(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > > > > > ; > ; > > _DistanceType __len = std::distance(__first, __last); > > while (__len > 0) > { > _DistanceType __half = __len >> 1; > _ForwardIterator __middle = __first; > std::advance(__middle, __half); > if (*__middle < __val) > { > __first = __middle; > ++__first; > __len = __len - __half - 1; > } > else if (__val < *__middle) > __len = __half; > else > { > _ForwardIterator __left = std::lower_bound(__first, __middle, > __val); > std::advance(__first, __len); > _ForwardIterator __right = std::upper_bound(++__middle, __first, > __val); > return pair<_ForwardIterator, _ForwardIterator>(__left, __right); > } > } > return pair<_ForwardIterator, _ForwardIterator>(__first, __first); > } ># 2659 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp, typename _Compare> > pair<_ForwardIterator, _ForwardIterator> > equal_range(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val, _Compare __comp) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > typedef typename iterator_traits<_ForwardIterator>::difference_type > _DistanceType; > > > > > > > > > ; > > ; > > _DistanceType __len = std::distance(__first, __last); > > while (__len > 0) > { > _DistanceType __half = __len >> 1; > _ForwardIterator __middle = __first; > std::advance(__middle, __half); > if (__comp(*__middle, __val)) > { > __first = __middle; > ++__first; > __len = __len - __half - 1; > } > else if (__comp(__val, *__middle)) > __len = __half; > else > { > _ForwardIterator __left = std::lower_bound(__first, __middle, > __val, __comp); > std::advance(__first, __len); > _ForwardIterator __right = std::upper_bound(++__middle, __first, > __val, __comp); > return pair<_ForwardIterator, _ForwardIterator>(__left, __right); > } > } > return pair<_ForwardIterator, _ForwardIterator>(__first, __first); > } ># 2720 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp> > bool > binary_search(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > > > > > ; > ; > > _ForwardIterator __i = std::lower_bound(__first, __last, __val); > return __i != __last && !(__val < *__i); > } ># 2753 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp, typename _Compare> > bool > binary_search(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __val, _Compare __comp) > { > typedef typename iterator_traits<_ForwardIterator>::value_type > _ValueType; > > > > > > > ; > > ; > > _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); > return __i != __last && !bool(__comp(__val, *__i)); > } > > > > > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > void > __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > while (__first1 != __last1 && __first2 != __last2) > { > if (*__first2 < *__first1) > { > *__result = (*__first2); > ++__first2; > } > else > { > *__result = (*__first1); > ++__first1; > } > ++__result; > } > if (__first1 != __last1) > std::copy(__first1, __last1, __result); > } > > > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > void > __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, _Compare __comp) > { > while (__first1 != __last1 && __first2 != __last2) > { > if (__comp(*__first2, *__first1)) > { > *__result = (*__first2); > ++__first2; > } > else > { > *__result = (*__first1); > ++__first1; > } > ++__result; > } > if (__first1 != __last1) > std::copy(__first1, __last1, __result); > } > > > template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, > typename _BidirectionalIterator3> > void > __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, > _BidirectionalIterator1 __last1, > _BidirectionalIterator2 __first2, > _BidirectionalIterator2 __last2, > _BidirectionalIterator3 __result) > { > if (__first1 == __last1) > { > std::copy_backward(__first2, __last2, __result); > return; > } > else if (__first2 == __last2) > return; > > --__last1; > --__last2; > while (true) > { > if (*__last2 < *__last1) > { > *--__result = (*__last1); > if (__first1 == __last1) > { > std::copy_backward(__first2, ++__last2, __result); > return; > } > --__last1; > } > else > { > *--__result = (*__last2); > if (__first2 == __last2) > return; > --__last2; > } > } > } > > > template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, > typename _BidirectionalIterator3, typename _Compare> > void > __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, > _BidirectionalIterator1 __last1, > _BidirectionalIterator2 __first2, > _BidirectionalIterator2 __last2, > _BidirectionalIterator3 __result, > _Compare __comp) > { > if (__first1 == __last1) > { > std::copy_backward(__first2, __last2, __result); > return; > } > else if (__first2 == __last2) > return; > > --__last1; > --__last2; > while (true) > { > if (__comp(*__last2, *__last1)) > { > *--__result = (*__last1); > if (__first1 == __last1) > { > std::copy_backward(__first2, ++__last2, __result); > return; > } > --__last1; > } > else > { > *--__result = (*__last2); > if (__first2 == __last2) > return; > --__last2; > } > } > } > > > template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, > typename _Distance> > _BidirectionalIterator1 > __rotate_adaptive(_BidirectionalIterator1 __first, > _BidirectionalIterator1 __middle, > _BidirectionalIterator1 __last, > _Distance __len1, _Distance __len2, > _BidirectionalIterator2 __buffer, > _Distance __buffer_size) > { > _BidirectionalIterator2 __buffer_end; > if (__len1 > __len2 && __len2 <= __buffer_size) > { > if (__len2) > { > __buffer_end = std::copy(__middle, __last, __buffer); > std::copy_backward(__first, __middle, __last); > return std::copy(__buffer, __buffer_end, __first); > } > else > return __first; > } > else if (__len1 <= __buffer_size) > { > if (__len1) > { > __buffer_end = std::copy(__first, __middle, __buffer); > std::copy(__middle, __last, __first); > return std::copy_backward(__buffer, __buffer_end, __last); > } > else > return __last; > } > else > { > std::rotate(__first, __middle, __last); > std::advance(__first, std::distance(__middle, __last)); > return __first; > } > } > > > template<typename _BidirectionalIterator, typename _Distance, > typename _Pointer> > void > __merge_adaptive(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last, > _Distance __len1, _Distance __len2, > _Pointer __buffer, _Distance __buffer_size) > { > if (__len1 <= __len2 && __len1 <= __buffer_size) > { > _Pointer __buffer_end = std::copy(__first, __middle, __buffer); > std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last, > __first); > } > else if (__len2 <= __buffer_size) > { > _Pointer __buffer_end = std::copy(__middle, __last, __buffer); > std::__move_merge_adaptive_backward(__first, __middle, __buffer, > __buffer_end, __last); > } > else > { > _BidirectionalIterator __first_cut = __first; > _BidirectionalIterator __second_cut = __middle; > _Distance __len11 = 0; > _Distance __len22 = 0; > if (__len1 > __len2) > { > __len11 = __len1 / 2; > std::advance(__first_cut, __len11); > __second_cut = std::lower_bound(__middle, __last, > *__first_cut); > __len22 = std::distance(__middle, __second_cut); > } > else > { > __len22 = __len2 / 2; > std::advance(__second_cut, __len22); > __first_cut = std::upper_bound(__first, __middle, > *__second_cut); > __len11 = std::distance(__first, __first_cut); > } > _BidirectionalIterator __new_middle = > std::__rotate_adaptive(__first_cut, __middle, __second_cut, > __len1 - __len11, __len22, __buffer, > __buffer_size); > std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, > __len22, __buffer, __buffer_size); > std::__merge_adaptive(__new_middle, __second_cut, __last, > __len1 - __len11, > __len2 - __len22, __buffer, __buffer_size); > } > } > > > template<typename _BidirectionalIterator, typename _Distance, > typename _Pointer, typename _Compare> > void > __merge_adaptive(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last, > _Distance __len1, _Distance __len2, > _Pointer __buffer, _Distance __buffer_size, > _Compare __comp) > { > if (__len1 <= __len2 && __len1 <= __buffer_size) > { > _Pointer __buffer_end = std::copy(__first, __middle, __buffer); > std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last, > __first, __comp); > } > else if (__len2 <= __buffer_size) > { > _Pointer __buffer_end = std::copy(__middle, __last, __buffer); > std::__move_merge_adaptive_backward(__first, __middle, __buffer, > __buffer_end, __last, __comp); > } > else > { > _BidirectionalIterator __first_cut = __first; > _BidirectionalIterator __second_cut = __middle; > _Distance __len11 = 0; > _Distance __len22 = 0; > if (__len1 > __len2) > { > __len11 = __len1 / 2; > std::advance(__first_cut, __len11); > __second_cut = std::lower_bound(__middle, __last, *__first_cut, > __comp); > __len22 = std::distance(__middle, __second_cut); > } > else > { > __len22 = __len2 / 2; > std::advance(__second_cut, __len22); > __first_cut = std::upper_bound(__first, __middle, *__second_cut, > __comp); > __len11 = std::distance(__first, __first_cut); > } > _BidirectionalIterator __new_middle = > std::__rotate_adaptive(__first_cut, __middle, __second_cut, > __len1 - __len11, __len22, __buffer, > __buffer_size); > std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, > __len22, __buffer, __buffer_size, __comp); > std::__merge_adaptive(__new_middle, __second_cut, __last, > __len1 - __len11, > __len2 - __len22, __buffer, > __buffer_size, __comp); > } > } > > > template<typename _BidirectionalIterator, typename _Distance> > void > __merge_without_buffer(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last, > _Distance __len1, _Distance __len2) > { > if (__len1 == 0 || __len2 == 0) > return; > if (__len1 + __len2 == 2) > { > if (*__middle < *__first) > std::iter_swap(__first, __middle); > return; > } > _BidirectionalIterator __first_cut = __first; > _BidirectionalIterator __second_cut = __middle; > _Distance __len11 = 0; > _Distance __len22 = 0; > if (__len1 > __len2) > { > __len11 = __len1 / 2; > std::advance(__first_cut, __len11); > __second_cut = std::lower_bound(__middle, __last, *__first_cut); > __len22 = std::distance(__middle, __second_cut); > } > else > { > __len22 = __len2 / 2; > std::advance(__second_cut, __len22); > __first_cut = std::upper_bound(__first, __middle, *__second_cut); > __len11 = std::distance(__first, __first_cut); > } > std::rotate(__first_cut, __middle, __second_cut); > _BidirectionalIterator __new_middle = __first_cut; > std::advance(__new_middle, std::distance(__middle, __second_cut)); > std::__merge_without_buffer(__first, __first_cut, __new_middle, > __len11, __len22); > std::__merge_without_buffer(__new_middle, __second_cut, __last, > __len1 - __len11, __len2 - __len22); > } > > > template<typename _BidirectionalIterator, typename _Distance, > typename _Compare> > void > __merge_without_buffer(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last, > _Distance __len1, _Distance __len2, > _Compare __comp) > { > if (__len1 == 0 || __len2 == 0) > return; > if (__len1 + __len2 == 2) > { > if (__comp(*__middle, *__first)) > std::iter_swap(__first, __middle); > return; > } > _BidirectionalIterator __first_cut = __first; > _BidirectionalIterator __second_cut = __middle; > _Distance __len11 = 0; > _Distance __len22 = 0; > if (__len1 > __len2) > { > __len11 = __len1 / 2; > std::advance(__first_cut, __len11); > __second_cut = std::lower_bound(__middle, __last, *__first_cut, > __comp); > __len22 = std::distance(__middle, __second_cut); > } > else > { > __len22 = __len2 / 2; > std::advance(__second_cut, __len22); > __first_cut = std::upper_bound(__first, __middle, *__second_cut, > __comp); > __len11 = std::distance(__first, __first_cut); > } > std::rotate(__first_cut, __middle, __second_cut); > _BidirectionalIterator __new_middle = __first_cut; > std::advance(__new_middle, std::distance(__middle, __second_cut)); > std::__merge_without_buffer(__first, __first_cut, __new_middle, > __len11, __len22, __comp); > std::__merge_without_buffer(__new_middle, __second_cut, __last, > __len1 - __len11, __len2 - __len22, __comp); > } ># 3177 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator> > void > inplace_merge(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last) > { > typedef typename iterator_traits<_BidirectionalIterator>::value_type > _ValueType; > typedef typename iterator_traits<_BidirectionalIterator>::difference_type > _DistanceType; > > > > > > ; > ; > > if (__first == __middle || __middle == __last) > return; > > _DistanceType __len1 = std::distance(__first, __middle); > _DistanceType __len2 = std::distance(__middle, __last); > > _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, > __last); > if (__buf.begin() == 0) > std::__merge_without_buffer(__first, __middle, __last, __len1, __len2); > else > std::__merge_adaptive(__first, __middle, __last, __len1, __len2, > __buf.begin(), _DistanceType(__buf.size())); > } ># 3232 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator, typename _Compare> > void > inplace_merge(_BidirectionalIterator __first, > _BidirectionalIterator __middle, > _BidirectionalIterator __last, > _Compare __comp) > { > typedef typename iterator_traits<_BidirectionalIterator>::value_type > _ValueType; > typedef typename iterator_traits<_BidirectionalIterator>::difference_type > _DistanceType; > > > > > > > ; > ; > > if (__first == __middle || __middle == __last) > return; > > const _DistanceType __len1 = std::distance(__first, __middle); > const _DistanceType __len2 = std::distance(__middle, __last); > > _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, > __last); > if (__buf.begin() == 0) > std::__merge_without_buffer(__first, __middle, __last, __len1, > __len2, __comp); > else > std::__merge_adaptive(__first, __middle, __last, __len1, __len2, > __buf.begin(), _DistanceType(__buf.size()), > __comp); > } > > > > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > _OutputIterator > __move_merge(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > while (__first1 != __last1 && __first2 != __last2) > { > if (*__first2 < *__first1) > { > *__result = (*__first2); > ++__first2; > } > else > { > *__result = (*__first1); > ++__first1; > } > ++__result; > } > return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)) > > ; > } > > > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > _OutputIterator > __move_merge(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, _Compare __comp) > { > while (__first1 != __last1 && __first2 != __last2) > { > if (__comp(*__first2, *__first1)) > { > *__result = (*__first2); > ++__first2; > } > else > { > *__result = (*__first1); > ++__first1; > } > ++__result; > } > return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)) > > ; > } > > template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, > typename _Distance> > void > __merge_sort_loop(_RandomAccessIterator1 __first, > _RandomAccessIterator1 __last, > _RandomAccessIterator2 __result, > _Distance __step_size) > { > const _Distance __two_step = 2 * __step_size; > > while (__last - __first >= __two_step) > { > __result = std::__move_merge(__first, __first + __step_size, > __first + __step_size, > __first + __two_step, __result); > __first += __two_step; > } > > __step_size = std::min(_Distance(__last - __first), __step_size); > std::__move_merge(__first, __first + __step_size, > __first + __step_size, __last, __result); > } > > template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, > typename _Distance, typename _Compare> > void > __merge_sort_loop(_RandomAccessIterator1 __first, > _RandomAccessIterator1 __last, > _RandomAccessIterator2 __result, _Distance __step_size, > _Compare __comp) > { > const _Distance __two_step = 2 * __step_size; > > while (__last - __first >= __two_step) > { > __result = std::__move_merge(__first, __first + __step_size, > __first + __step_size, > __first + __two_step, > __result, __comp); > __first += __two_step; > } > __step_size = std::min(_Distance(__last - __first), __step_size); > > std::__move_merge(__first,__first + __step_size, > __first + __step_size, __last, __result, __comp); > } > > template<typename _RandomAccessIterator, typename _Distance> > void > __chunk_insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Distance __chunk_size) > { > while (__last - __first >= __chunk_size) > { > std::__insertion_sort(__first, __first + __chunk_size); > __first += __chunk_size; > } > std::__insertion_sort(__first, __last); > } > > template<typename _RandomAccessIterator, typename _Distance, > typename _Compare> > void > __chunk_insertion_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Distance __chunk_size, _Compare __comp) > { > while (__last - __first >= __chunk_size) > { > std::__insertion_sort(__first, __first + __chunk_size, __comp); > __first += __chunk_size; > } > std::__insertion_sort(__first, __last, __comp); > } > > enum { _S_chunk_size = 7 }; > > template<typename _RandomAccessIterator, typename _Pointer> > void > __merge_sort_with_buffer(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Pointer __buffer) > { > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _Distance; > > const _Distance __len = __last - __first; > const _Pointer __buffer_last = __buffer + __len; > > _Distance __step_size = _S_chunk_size; > std::__chunk_insertion_sort(__first, __last, __step_size); > > while (__step_size < __len) > { > std::__merge_sort_loop(__first, __last, __buffer, __step_size); > __step_size *= 2; > std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size); > __step_size *= 2; > } > } > > template<typename _RandomAccessIterator, typename _Pointer, typename _Compare> > void > __merge_sort_with_buffer(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Pointer __buffer, _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _Distance; > > const _Distance __len = __last - __first; > const _Pointer __buffer_last = __buffer + __len; > > _Distance __step_size = _S_chunk_size; > std::__chunk_insertion_sort(__first, __last, __step_size, __comp); > > while (__step_size < __len) > { > std::__merge_sort_loop(__first, __last, __buffer, > __step_size, __comp); > __step_size *= 2; > std::__merge_sort_loop(__buffer, __buffer_last, __first, > __step_size, __comp); > __step_size *= 2; > } > } > > template<typename _RandomAccessIterator, typename _Pointer, > typename _Distance> > void > __stable_sort_adaptive(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Pointer __buffer, _Distance __buffer_size) > { > const _Distance __len = (__last - __first + 1) / 2; > const _RandomAccessIterator __middle = __first + __len; > if (__len > __buffer_size) > { > std::__stable_sort_adaptive(__first, __middle, > __buffer, __buffer_size); > std::__stable_sort_adaptive(__middle, __last, > __buffer, __buffer_size); > } > else > { > std::__merge_sort_with_buffer(__first, __middle, __buffer); > std::__merge_sort_with_buffer(__middle, __last, __buffer); > } > std::__merge_adaptive(__first, __middle, __last, > _Distance(__middle - __first), > _Distance(__last - __middle), > __buffer, __buffer_size); > } > > template<typename _RandomAccessIterator, typename _Pointer, > typename _Distance, typename _Compare> > void > __stable_sort_adaptive(_RandomAccessIterator __first, > _RandomAccessIterator __last, > _Pointer __buffer, _Distance __buffer_size, > _Compare __comp) > { > const _Distance __len = (__last - __first + 1) / 2; > const _RandomAccessIterator __middle = __first + __len; > if (__len > __buffer_size) > { > std::__stable_sort_adaptive(__first, __middle, __buffer, > __buffer_size, __comp); > std::__stable_sort_adaptive(__middle, __last, __buffer, > __buffer_size, __comp); > } > else > { > std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); > std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); > } > std::__merge_adaptive(__first, __middle, __last, > _Distance(__middle - __first), > _Distance(__last - __middle), > __buffer, __buffer_size, > __comp); > } > > > template<typename _RandomAccessIterator> > void > __inplace_stable_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last) > { > if (__last - __first < 15) > { > std::__insertion_sort(__first, __last); > return; > } > _RandomAccessIterator __middle = __first + (__last - __first) / 2; > std::__inplace_stable_sort(__first, __middle); > std::__inplace_stable_sort(__middle, __last); > std::__merge_without_buffer(__first, __middle, __last, > __middle - __first, > __last - __middle); > } > > > template<typename _RandomAccessIterator, typename _Compare> > void > __inplace_stable_sort(_RandomAccessIterator __first, > _RandomAccessIterator __last, _Compare __comp) > { > if (__last - __first < 15) > { > std::__insertion_sort(__first, __last, __comp); > return; > } > _RandomAccessIterator __middle = __first + (__last - __first) / 2; > std::__inplace_stable_sort(__first, __middle, __comp); > std::__inplace_stable_sort(__middle, __last, __comp); > std::__merge_without_buffer(__first, __middle, __last, > __middle - __first, > __last - __middle, > __comp); > } ># 3572 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2> > bool > includes(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (*__first2 < *__first1) > return false; > else if(*__first1 < *__first2) > ++__first1; > else > ++__first1, ++__first2; > > return __first2 == __last2; > } ># 3622 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _Compare> > bool > includes(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _Compare __comp) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (__comp(*__first2, *__first1)) > return false; > else if(__comp(*__first1, *__first2)) > ++__first1; > else > ++__first1, ++__first2; > > return __first2 == __last2; > } ># 3677 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator> > bool > next_permutation(_BidirectionalIterator __first, > _BidirectionalIterator __last) > { > > > > > > ; > > if (__first == __last) > return false; > _BidirectionalIterator __i = __first; > ++__i; > if (__i == __last) > return false; > __i = __last; > --__i; > > for(;;) > { > _BidirectionalIterator __ii = __i; > --__i; > if (*__i < *__ii) > { > _BidirectionalIterator __j = __last; > while (!(*__i < *--__j)) > {} > std::iter_swap(__i, __j); > std::reverse(__ii, __last); > return true; > } > if (__i == __first) > { > std::reverse(__first, __last); > return false; > } > } > } ># 3734 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator, typename _Compare> > bool > next_permutation(_BidirectionalIterator __first, > _BidirectionalIterator __last, _Compare __comp) > { > > > > > > > ; > > if (__first == __last) > return false; > _BidirectionalIterator __i = __first; > ++__i; > if (__i == __last) > return false; > __i = __last; > --__i; > > for(;;) > { > _BidirectionalIterator __ii = __i; > --__i; > if (__comp(*__i, *__ii)) > { > _BidirectionalIterator __j = __last; > while (!bool(__comp(*__i, *--__j))) > {} > std::iter_swap(__i, __j); > std::reverse(__ii, __last); > return true; > } > if (__i == __first) > { > std::reverse(__first, __last); > return false; > } > } > } ># 3790 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator> > bool > prev_permutation(_BidirectionalIterator __first, > _BidirectionalIterator __last) > { > > > > > > ; > > if (__first == __last) > return false; > _BidirectionalIterator __i = __first; > ++__i; > if (__i == __last) > return false; > __i = __last; > --__i; > > for(;;) > { > _BidirectionalIterator __ii = __i; > --__i; > if (*__ii < *__i) > { > _BidirectionalIterator __j = __last; > while (!(*--__j < *__i)) > {} > std::iter_swap(__i, __j); > std::reverse(__ii, __last); > return true; > } > if (__i == __first) > { > std::reverse(__first, __last); > return false; > } > } > } ># 3847 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _BidirectionalIterator, typename _Compare> > bool > prev_permutation(_BidirectionalIterator __first, > _BidirectionalIterator __last, _Compare __comp) > { > > > > > > > ; > > if (__first == __last) > return false; > _BidirectionalIterator __i = __first; > ++__i; > if (__i == __last) > return false; > __i = __last; > --__i; > > for(;;) > { > _BidirectionalIterator __ii = __i; > --__i; > if (__comp(*__ii, *__i)) > { > _BidirectionalIterator __j = __last; > while (!bool(__comp(*--__j, *__i))) > {} > std::iter_swap(__i, __j); > std::reverse(__ii, __last); > return true; > } > if (__i == __first) > { > std::reverse(__first, __last); > return false; > } > } > } ># 3907 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator, typename _Tp> > _OutputIterator > replace_copy(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, > const _Tp& __old_value, const _Tp& __new_value) > { > > > > > > > ; > > for (; __first != __last; ++__first, ++__result) > if (*__first == __old_value) > *__result = __new_value; > else > *__result = *__first; > return __result; > } ># 3944 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator, > typename _Predicate, typename _Tp> > _OutputIterator > replace_copy_if(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, > _Predicate __pred, const _Tp& __new_value) > { > > > > > > > ; > > for (; __first != __last; ++__first, ++__result) > if (__pred(*__first)) > *__result = __new_value; > else > *__result = *__first; > return __result; > } ># 4418 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > > > ># 4434 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _Function> > _Function > for_each(_InputIterator __first, _InputIterator __last, _Function __f) > { > > > ; > for (; __first != __last; ++__first) > __f(*__first); > return (__f); > } ># 4455 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _Tp> > inline _InputIterator > find(_InputIterator __first, _InputIterator __last, > const _Tp& __val) > { > > > > > ; > return std::__find(__first, __last, __val, > std::__iterator_category(__first)); > } ># 4479 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _Predicate> > inline _InputIterator > find_if(_InputIterator __first, _InputIterator __last, > _Predicate __pred) > { > > > > > ; > return std::__find_if(__first, __last, __pred, > std::__iterator_category(__first)); > } ># 4509 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _ForwardIterator> > _InputIterator > find_first_of(_InputIterator __first1, _InputIterator __last1, > _ForwardIterator __first2, _ForwardIterator __last2) > { > > > > > > > ; > ; > > for (; __first1 != __last1; ++__first1) > for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) > if (*__first1 == *__iter) > return __first1; > return __last1; > } ># 4549 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _ForwardIterator, > typename _BinaryPredicate> > _InputIterator > find_first_of(_InputIterator __first1, _InputIterator __last1, > _ForwardIterator __first2, _ForwardIterator __last2, > _BinaryPredicate __comp) > { > > > > > > > ; > ; > > for (; __first1 != __last1; ++__first1) > for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) > if (__comp(*__first1, *__iter)) > return __first1; > return __last1; > } ># 4581 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator> > _ForwardIterator > adjacent_find(_ForwardIterator __first, _ForwardIterator __last) > { > > > > > ; > if (__first == __last) > return __last; > _ForwardIterator __next = __first; > while(++__next != __last) > { > if (*__first == *__next) > return __first; > __first = __next; > } > return __last; > } ># 4613 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _BinaryPredicate> > _ForwardIterator > adjacent_find(_ForwardIterator __first, _ForwardIterator __last, > _BinaryPredicate __binary_pred) > { > > > > > > ; > if (__first == __last) > return __last; > _ForwardIterator __next = __first; > while(++__next != __last) > { > if (__binary_pred(*__first, *__next)) > return __first; > __first = __next; > } > return __last; > } ># 4645 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _Tp> > typename iterator_traits<_InputIterator>::difference_type > count(_InputIterator __first, _InputIterator __last, const _Tp& __value) > { > > > > > ; > typename iterator_traits<_InputIterator>::difference_type __n = 0; > for (; __first != __last; ++__first) > if (*__first == __value) > ++__n; > return __n; > } ># 4670 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _Predicate> > typename iterator_traits<_InputIterator>::difference_type > count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) > { > > > > > ; > typename iterator_traits<_InputIterator>::difference_type __n = 0; > for (; __first != __last; ++__first) > if (__pred(*__first)) > ++__n; > return __n; > } ># 4712 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator1, typename _ForwardIterator2> > _ForwardIterator1 > search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2, _ForwardIterator2 __last2) > { > > > > > > > ; > ; > > > if (__first1 == __last1 || __first2 == __last2) > return __first1; > > > _ForwardIterator2 __p1(__first2); > if (++__p1 == __last2) > return std::find(__first1, __last1, *__first2); > > > _ForwardIterator2 __p; > _ForwardIterator1 __current = __first1; > > for (;;) > { > __first1 = std::find(__first1, __last1, *__first2); > if (__first1 == __last1) > return __last1; > > __p = __p1; > __current = __first1; > if (++__current == __last1) > return __last1; > > while (*__current == *__p) > { > if (++__p == __last2) > return __first1; > if (++__current == __last1) > return __last1; > } > ++__first1; > } > return __first1; > } ># 4783 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator1, typename _ForwardIterator2, > typename _BinaryPredicate> > _ForwardIterator1 > search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, > _ForwardIterator2 __first2, _ForwardIterator2 __last2, > _BinaryPredicate __predicate) > { > > > > > > > ; > ; > > > if (__first1 == __last1 || __first2 == __last2) > return __first1; > > > _ForwardIterator2 __p1(__first2); > if (++__p1 == __last2) > { > while (__first1 != __last1 > && !bool(__predicate(*__first1, *__first2))) > ++__first1; > return __first1; > } > > > _ForwardIterator2 __p; > _ForwardIterator1 __current = __first1; > > for (;;) > { > while (__first1 != __last1 > && !bool(__predicate(*__first1, *__first2))) > ++__first1; > if (__first1 == __last1) > return __last1; > > __p = __p1; > __current = __first1; > if (++__current == __last1) > return __last1; > > while (__predicate(*__current, *__p)) > { > if (++__p == __last2) > return __first1; > if (++__current == __last1) > return __last1; > } > ++__first1; > } > return __first1; > } ># 4858 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Integer, typename _Tp> > _ForwardIterator > search_n(_ForwardIterator __first, _ForwardIterator __last, > _Integer __count, const _Tp& __val) > { > > > > > ; > > if (__count <= 0) > return __first; > if (__count == 1) > return std::find(__first, __last, __val); > return std::__search_n(__first, __last, __count, __val, > std::__iterator_category(__first)); > } ># 4895 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Integer, typename _Tp, > typename _BinaryPredicate> > _ForwardIterator > search_n(_ForwardIterator __first, _ForwardIterator __last, > _Integer __count, const _Tp& __val, > _BinaryPredicate __binary_pred) > { > > > > > ; > > if (__count <= 0) > return __first; > if (__count == 1) > { > while (__first != __last && !bool(__binary_pred(*__first, __val))) > ++__first; > return __first; > } > return std::__search_n(__first, __last, __count, __val, __binary_pred, > std::__iterator_category(__first)); > } ># 4937 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator, > typename _UnaryOperation> > _OutputIterator > transform(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, _UnaryOperation __unary_op) > { > > > > > > ; > > for (; __first != __last; ++__first, ++__result) > *__result = __unary_op(*__first); > return __result; > } ># 4974 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _BinaryOperation> > _OutputIterator > transform(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _OutputIterator __result, > _BinaryOperation __binary_op) > { > > > > > > > ; > > for (; __first1 != __last1; ++__first1, ++__first2, ++__result) > *__result = __binary_op(*__first1, *__first2); > return __result; > } ># 5007 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Tp> > void > replace(_ForwardIterator __first, _ForwardIterator __last, > const _Tp& __old_value, const _Tp& __new_value) > { > > > > > > > > ; > > for (; __first != __last; ++__first) > if (*__first == __old_value) > *__first = __new_value; > } ># 5039 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Predicate, typename _Tp> > void > replace_if(_ForwardIterator __first, _ForwardIterator __last, > _Predicate __pred, const _Tp& __new_value) > { > > > > > > > > ; > > for (; __first != __last; ++__first) > if (__pred(*__first)) > *__first = __new_value; > } ># 5071 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Generator> > void > generate(_ForwardIterator __first, _ForwardIterator __last, > _Generator __gen) > { > > > > > ; > > for (; __first != __last; ++__first) > *__first = __gen(); > } ># 5102 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _OutputIterator, typename _Size, typename _Generator> > _OutputIterator > generate_n(_OutputIterator __first, _Size __n, _Generator __gen) > { > > > > > > for (__decltype(__n + 0) __niter = __n; > __niter > 0; --__niter, ++__first) > *__first = __gen(); > return __first; > } ># 5139 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator> > inline _OutputIterator > unique_copy(_InputIterator __first, _InputIterator __last, > _OutputIterator __result) > { > > > > > > > ; > > if (__first == __last) > return __result; > return std::__unique_copy(__first, __last, __result, > std::__iterator_category(__first), > std::__iterator_category(__result)); > } ># 5178 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator, typename _OutputIterator, > typename _BinaryPredicate> > inline _OutputIterator > unique_copy(_InputIterator __first, _InputIterator __last, > _OutputIterator __result, > _BinaryPredicate __binary_pred) > { > > > > > ; > > if (__first == __last) > return __result; > return std::__unique_copy(__first, __last, __result, __binary_pred, > std::__iterator_category(__first), > std::__iterator_category(__result)); > } ># 5210 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator> > inline void > random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > > > > ; > > if (__first != __last) > for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) > std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1))); > } ># 5238 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator, typename _RandomNumberGenerator> > void > random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, > > > > _RandomNumberGenerator& __rand) > > { > > > > ; > > if (__first == __last) > return; > for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) > std::iter_swap(__i, __first + __rand((__i - __first) + 1)); > } ># 5274 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Predicate> > inline _ForwardIterator > partition(_ForwardIterator __first, _ForwardIterator __last, > _Predicate __pred) > { > > > > > > ; > > return std::__partition(__first, __last, __pred, > std::__iterator_category(__first)); > } ># 5308 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator> > inline void > partial_sort(_RandomAccessIterator __first, > _RandomAccessIterator __middle, > _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > ; > ; > > std::__heap_select(__first, __middle, __last); > std::sort_heap(__first, __middle); > } ># 5347 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > inline void > partial_sort(_RandomAccessIterator __first, > _RandomAccessIterator __middle, > _RandomAccessIterator __last, > _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > > ; > ; > > std::__heap_select(__first, __middle, __last, __comp); > std::sort_heap(__first, __middle, __comp); > } ># 5384 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator> > inline void > nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, > _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > ; > ; > > if (__first == __last || __nth == __last) > return; > > std::__introselect(__first, __nth, __last, > std::__lg(__last - __first) * 2); > } ># 5423 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > inline void > nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, > _RandomAccessIterator __last, _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > > ; > ; > > if (__first == __last || __nth == __last) > return; > > std::__introselect(__first, __nth, __last, > std::__lg(__last - __first) * 2, __comp); > } ># 5461 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator> > inline void > sort(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > ; > > if (__first != __last) > { > std::__introsort_loop(__first, __last, > std::__lg(__last - __first) * 2); > std::__final_insertion_sort(__first, __last); > } > } ># 5497 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > inline void > sort(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > > > > > > > ; > > if (__first != __last) > { > std::__introsort_loop(__first, __last, > std::__lg(__last - __first) * 2, __comp); > std::__final_insertion_sort(__first, __last, __comp); > } > } ># 5539 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > _OutputIterator > merge(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > { > if (*__first2 < *__first1) > { > *__result = *__first2; > ++__first2; > } > else > { > *__result = *__first1; > ++__first1; > } > ++__result; > } > return std::copy(__first2, __last2, std::copy(__first1, __last1, > __result)); > } ># 5603 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > _OutputIterator > merge(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, _Compare __comp) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > { > if (__comp(*__first2, *__first1)) > { > *__result = *__first2; > ++__first2; > } > else > { > *__result = *__first1; > ++__first1; > } > ++__result; > } > return std::copy(__first2, __last2, std::copy(__first1, __last1, > __result)); > } ># 5663 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator> > inline void > stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > > ; > > _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, > __last); > if (__buf.begin() == 0) > std::__inplace_stable_sort(__first, __last); > else > std::__stable_sort_adaptive(__first, __last, __buf.begin(), > _DistanceType(__buf.size())); > } ># 5705 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _RandomAccessIterator, typename _Compare> > inline void > stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, > _Compare __comp) > { > typedef typename iterator_traits<_RandomAccessIterator>::value_type > _ValueType; > typedef typename iterator_traits<_RandomAccessIterator>::difference_type > _DistanceType; > > > > > > > > ; > > _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, > __last); > if (__buf.begin() == 0) > std::__inplace_stable_sort(__first, __last, __comp); > else > std::__stable_sort_adaptive(__first, __last, __buf.begin(), > _DistanceType(__buf.size()), __comp); > } ># 5751 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > _OutputIterator > set_union(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > { > if (*__first1 < *__first2) > { > *__result = *__first1; > ++__first1; > } > else if (*__first2 < *__first1) > { > *__result = *__first2; > ++__first2; > } > else > { > *__result = *__first1; > ++__first1; > ++__first2; > } > ++__result; > } > return std::copy(__first2, __last2, std::copy(__first1, __last1, > __result)); > } ># 5818 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > _OutputIterator > set_union(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, _Compare __comp) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > { > if (__comp(*__first1, *__first2)) > { > *__result = *__first1; > ++__first1; > } > else if (__comp(*__first2, *__first1)) > { > *__result = *__first2; > ++__first2; > } > else > { > *__result = *__first1; > ++__first1; > ++__first2; > } > ++__result; > } > return std::copy(__first2, __last2, std::copy(__first1, __last1, > __result)); > } ># 5885 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > _OutputIterator > set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (*__first1 < *__first2) > ++__first1; > else if (*__first2 < *__first1) > ++__first2; > else > { > *__result = *__first1; > ++__first1; > ++__first2; > ++__result; > } > return __result; > } ># 5942 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > _OutputIterator > set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, _Compare __comp) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (__comp(*__first1, *__first2)) > ++__first1; > else if (__comp(*__first2, *__first1)) > ++__first2; > else > { > *__result = *__first1; > ++__first1; > ++__first2; > ++__result; > } > return __result; > } ># 6000 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > _OutputIterator > set_difference(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (*__first1 < *__first2) > { > *__result = *__first1; > ++__first1; > ++__result; > } > else if (*__first2 < *__first1) > ++__first2; > else > { > ++__first1; > ++__first2; > } > return std::copy(__first1, __last1, __result); > } ># 6061 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > _OutputIterator > set_difference(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, _Compare __comp) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (__comp(*__first1, *__first2)) > { > *__result = *__first1; > ++__first1; > ++__result; > } > else if (__comp(*__first2, *__first1)) > ++__first2; > else > { > ++__first1; > ++__first2; > } > return std::copy(__first1, __last1, __result); > } ># 6119 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator> > _OutputIterator > set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (*__first1 < *__first2) > { > *__result = *__first1; > ++__first1; > ++__result; > } > else if (*__first2 < *__first1) > { > *__result = *__first2; > ++__first2; > ++__result; > } > else > { > ++__first1; > ++__first2; > } > return std::copy(__first2, __last2, std::copy(__first1, > __last1, __result)); > } ># 6185 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _InputIterator1, typename _InputIterator2, > typename _OutputIterator, typename _Compare> > _OutputIterator > set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, > _InputIterator2 __first2, _InputIterator2 __last2, > _OutputIterator __result, > _Compare __comp) > { > typedef typename iterator_traits<_InputIterator1>::value_type > _ValueType1; > typedef typename iterator_traits<_InputIterator2>::value_type > _ValueType2; > > > > > > > > > > > > > ; > ; > > while (__first1 != __last1 && __first2 != __last2) > if (__comp(*__first1, *__first2)) > { > *__result = *__first1; > ++__first1; > ++__result; > } > else if (__comp(*__first2, *__first1)) > { > *__result = *__first2; > ++__first2; > ++__result; > } > else > { > ++__first1; > ++__first2; > } > return std::copy(__first2, __last2, > std::copy(__first1, __last1, __result)); > } ># 6242 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator> > _ForwardIterator > min_element(_ForwardIterator __first, _ForwardIterator __last) > { > > > > > ; > > if (__first == __last) > return __first; > _ForwardIterator __result = __first; > while (++__first != __last) > if (*__first < *__result) > __result = __first; > return __result; > } ># 6270 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Compare> > _ForwardIterator > min_element(_ForwardIterator __first, _ForwardIterator __last, > _Compare __comp) > { > > > > > > ; > > if (__first == __last) > return __first; > _ForwardIterator __result = __first; > while (++__first != __last) > if (__comp(*__first, *__result)) > __result = __first; > return __result; > } ># 6298 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator> > _ForwardIterator > max_element(_ForwardIterator __first, _ForwardIterator __last) > { > > > > > ; > > if (__first == __last) > return __first; > _ForwardIterator __result = __first; > while (++__first != __last) > if (*__result < *__first) > __result = __first; > return __result; > } ># 6326 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3 > template<typename _ForwardIterator, typename _Compare> > _ForwardIterator > max_element(_ForwardIterator __first, _ForwardIterator __last, > _Compare __comp) > { > > > > > > ; > > if (__first == __last) return __first; > _ForwardIterator __result = __first; > while (++__first != __last) > if (__comp(*__result, *__first)) > __result = __first; > return __result; > } > > >} ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 2 3 ># 77 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 179 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" > > > > > > > > > >typedef signed char qint8; >typedef unsigned char quint8; >typedef short qint16; >typedef unsigned short quint16; >typedef int qint32; >typedef unsigned int quint32; ># 202 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >typedef long long qint64; >typedef unsigned long long quint64; > > >typedef qint64 qlonglong; >typedef quint64 qulonglong; ># 229 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >namespace QtPrivate { > template <class T> > struct AlignOfHelper > { > char c; > T type; > > AlignOfHelper(); > ~AlignOfHelper(); > }; > > template <class T> > struct AlignOf_Default > { > enum { Value = sizeof(AlignOfHelper<T>) - sizeof(T) }; > }; > > template <class T> struct AlignOf : AlignOf_Default<T> { }; > template <class T> struct AlignOf<T &> : AlignOf<T> {}; > template <size_t N, class T> struct AlignOf<T[N]> : AlignOf<T> {}; ># 269 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >} ># 285 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >template <int> struct QIntegerForSize; >template <> struct QIntegerForSize<1> { typedef quint8 Unsigned; typedef qint8 Signed; }; >template <> struct QIntegerForSize<2> { typedef quint16 Unsigned; typedef qint16 Signed; }; >template <> struct QIntegerForSize<4> { typedef quint32 Unsigned; typedef qint32 Signed; }; >template <> struct QIntegerForSize<8> { typedef quint64 Unsigned; typedef qint64 Signed; }; >template <class T> struct QIntegerForSizeof: QIntegerForSize<sizeof(T)> { }; >typedef QIntegerForSizeof<void*>::Unsigned quintptr; >typedef QIntegerForSizeof<void*>::Signed qptrdiff; >typedef qptrdiff qintptr; > > > > > > >typedef unsigned char uchar; >typedef unsigned short ushort; >typedef unsigned int uint; >typedef unsigned long ulong; > ># 396 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >typedef int QNoImplicitBoolCast; > > > > > > > >typedef double qreal; > > > > > > >template <typename T> > inline T qAbs(const T &t) { return t >= 0 ? t : -t; } > > inline int qRound(double d) >{ return d >= 0.0 ? int(d + 0.5) : int(d - int(d-1) + 0.5) + int(d-1); } > inline int qRound(float d) >{ return d >= 0.0f ? int(d + 0.5f) : int(d - int(d-1) + 0.5f) + int(d-1); } > > > > > > > > inline qint64 qRound64(double d) >{ return d >= 0.0 ? qint64(d + 0.5) : qint64(d - double(qint64(d-1)) + 0.5) + qint64(d-1); } > inline qint64 qRound64(float d) >{ return d >= 0.0f ? qint64(d + 0.5f) : qint64(d - float(qint64(d-1)) + 0.5f) + qint64(d-1); } > > > > > > > >template <typename T> > inline const T &qMin(const T &a, const T &b) { return (a < b) ? a : b; } >template <typename T> > inline const T &qMax(const T &a, const T &b) { return (a < b) ? b : a; } >template <typename T> > inline const T &qBound(const T &min, const T &val, const T &max) >{ return qMax(min, qMin(max, val)); } > > > > > >class QDataStream; ># 457 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qfeatures.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qfeatures.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qfeatures.h" 2 ># 458 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 612 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >inline void qt_noop(void) {} ># 640 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >__attribute__((visibility("default"))) const char *qVersion(); >__attribute__((visibility("default"))) bool qSharedBuild(); ># 674 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >class QString; >__attribute__((visibility("default"))) QString qt_error_string(int errorCode = -1); > > >__attribute__((__noreturn__)) > >__attribute__((visibility("default"))) void qt_assert(const char *assertion, const char *file, int line); ># 695 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >__attribute__((__noreturn__)) > >__attribute__((visibility("default"))) void qt_assert_x(const char *where, const char *what, const char *file, int line); ># 713 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >template <bool Test> class QStaticAssertFailure; >template <> class QStaticAssertFailure<true> {}; ># 723 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >__attribute__((visibility("default"))) void qt_check_pointer(const char *, int); >__attribute__((visibility("default"))) void qBadAlloc(); ># 736 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >template <typename T> >inline T *q_check_ptr(T *p) { do { if (!(p)) qBadAlloc(); } while (0); return p; } > >typedef void (*QFunctionPointer)(); > > > > > > static inline bool qFuzzyCompare(double p1, double p2) >{ > return (qAbs(p1 - p2) <= 0.000000000001 * qMin(qAbs(p1), qAbs(p2))); >} > > static inline bool qFuzzyCompare(float p1, float p2) >{ > return (qAbs(p1 - p2) <= 0.00001f * qMin(qAbs(p1), qAbs(p2))); >} > > > > > static inline bool qFuzzyIsNull(double d) >{ > return qAbs(d) <= 0.000000000001; >} > > > > > static inline bool qFuzzyIsNull(float f) >{ > return qAbs(f) <= 0.00001f; >} > > > > > > >static inline bool qIsNull(double d) >{ > union U { > double d; > quint64 u; > }; > U val; > val.d = d; > return val.u == quint64(0); >} > > > > > > >static inline bool qIsNull(float f) >{ > union U { > float f; > quint32 u; > }; > U val; > val.f = f; > return val.u == 0u; >} ># 823 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >template <typename T> >inline void qSwap(T &value1, T &value2) >{ > using std::swap; > swap(value1, value2); >} > > >__attribute__((visibility("default"))) void *qMalloc(size_t size) __attribute__((alloc_size(1))); >__attribute__((visibility("default"))) void qFree(void *ptr); >__attribute__((visibility("default"))) void *qRealloc(void *ptr, size_t size) __attribute__((alloc_size(2))); >__attribute__((visibility("default"))) void *qMemCopy(void *dest, const void *src, size_t n); >__attribute__((visibility("default"))) void *qMemSet(void *dest, int c, size_t n); > >__attribute__((visibility("default"))) void *qMallocAligned(size_t size, size_t alignment) __attribute__((alloc_size(1))); >__attribute__((visibility("default"))) void *qReallocAligned(void *ptr, size_t size, size_t oldsize, size_t alignment) __attribute__((alloc_size(2))); >__attribute__((visibility("default"))) void qFreeAligned(void *ptr); ># 878 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >template <typename T> >class QForeachContainer { >public: > inline QForeachContainer(const T& t) : c(t), brk(0), i(c.begin()), e(c.end()) { } > const T c; > int brk; > typename T::const_iterator i, e; >}; ># 949 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >template <typename T> static inline T *qGetPtrHelper(T *ptr) { return ptr; } >template <typename Wrapper> static inline typename Wrapper::pointer qGetPtrHelper(const Wrapper &p) { return p.data(); } ># 982 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >__attribute__((visibility("default"))) QString qtTrId(const char *id, int n = -1); ># 1012 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >class QByteArray; >__attribute__((visibility("default"))) QByteArray qgetenv(const char *varName); >__attribute__((visibility("default"))) bool qputenv(const char *varName, const QByteArray& value); > >inline int qIntCast(double f) { return int(f); } >inline int qIntCast(float f) { return int(f); } > > > > >__attribute__((visibility("default"))) void qsrand(uint seed); >__attribute__((visibility("default"))) int qrand(); ># 1043 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" >namespace QtPrivate { > >template <bool B, typename T = void> struct QEnableIf; >template <typename T> struct QEnableIf<true, T> { typedef T Type; }; >} > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobalstatic.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobalstatic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 2 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qbasicatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" 2 ># 84 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic_x86.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qgenericatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qgenericatomic.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qgenericatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qgenericatomic.h" 2 > > > ># 65 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qgenericatomic.h" >template<typename T> struct QAtomicIntegerTraits { enum { IsInteger = 0 }; }; > >template <typename T> struct QAtomicAdditiveType >{ > typedef T AdditiveT; > static const int AddScale = 1; >}; >template <typename T> struct QAtomicAdditiveType<T *> >{ > typedef qptrdiff AdditiveT; > static const int AddScale = sizeof(T); >}; > > >template <typename BaseClass> struct QGenericAtomicOps >{ > template <typename T> struct AtomicType { typedef T Type; typedef T *PointerType; }; > > static void acquireMemoryFence() { BaseClass::orderedMemoryFence(); } > static void releaseMemoryFence() { BaseClass::orderedMemoryFence(); } > static void orderedMemoryFence() { } > > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > T load(const T &_q_value) > { > return _q_value; > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > void store(T &_q_value, X newValue) > { > _q_value = newValue; > } > > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > T loadAcquire(const T &_q_value) > { > T tmp = *static_cast<const volatile T *>(&_q_value); > BaseClass::acquireMemoryFence(); > return tmp; > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > void storeRelease(T &_q_value, X newValue) > { > BaseClass::releaseMemoryFence(); > *static_cast<volatile T *>(&_q_value) = newValue; > } > > static inline bool isReferenceCountingNative() > { return BaseClass::isFetchAndAddNative(); } > static inline bool isReferenceCountingWaitFree() > { return BaseClass::isFetchAndAddWaitFree(); } > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > bool ref(T &_q_value) > { > return BaseClass::fetchAndAddRelaxed(_q_value, 1) != T(-1); > } > > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > bool deref(T &_q_value) > { > return BaseClass::fetchAndAddRelaxed(_q_value, -1) != 1; > } ># 139 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qgenericatomic.h" > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > bool testAndSetAcquire(T &_q_value, X expectedValue, X newValue) > { > bool tmp = BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue); > BaseClass::acquireMemoryFence(); > return tmp; > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > bool testAndSetRelease(T &_q_value, X expectedValue, X newValue) > { > BaseClass::releaseMemoryFence(); > return BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue); > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > bool testAndSetOrdered(T &_q_value, X expectedValue, X newValue) > { > BaseClass::orderedMemoryFence(); > return BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue); > } > > static inline bool isFetchAndStoreNative() { return false; } > static inline bool isFetchAndStoreWaitFree() { return false; } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndStoreRelaxed(T &_q_value, X newValue) > { > > for(;;) { > register T tmp = load(_q_value); > if (BaseClass::testAndSetRelaxed(_q_value, tmp, newValue)) > return tmp; > } > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndStoreAcquire(T &_q_value, X newValue) > { > T tmp = BaseClass::fetchAndStoreRelaxed(_q_value, newValue); > BaseClass::acquireMemoryFence(); > return tmp; > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndStoreRelease(T &_q_value, X newValue) > { > BaseClass::releaseMemoryFence(); > return BaseClass::fetchAndStoreRelaxed(_q_value, newValue); > } > > template <typename T, typename X> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndStoreOrdered(T &_q_value, X newValue) > { > BaseClass::orderedMemoryFence(); > return BaseClass::fetchAndStoreRelaxed(_q_value, newValue); > } > > static inline bool isFetchAndAddNative() { return false; } > static inline bool isFetchAndAddWaitFree() { return false; } > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndAddRelaxed(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) > { > > for(;;) { > register T tmp = BaseClass::load(_q_value); > if (BaseClass::testAndSetRelaxed(_q_value, tmp, T(tmp + valueToAdd))) > return tmp; > } > } > > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndAddAcquire(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) > { > T tmp = BaseClass::fetchAndAddRelaxed(_q_value, valueToAdd); > BaseClass::acquireMemoryFence(); > return tmp; > } > > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndAddRelease(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) > { > BaseClass::releaseMemoryFence(); > return BaseClass::fetchAndAddRelaxed(_q_value, valueToAdd); > } > > template <typename T> static inline __attribute__((always_inline, gnu_inline)) > T fetchAndAddOrdered(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) > { > BaseClass::orderedMemoryFence(); > return BaseClass::fetchAndAddRelaxed(_q_value, valueToAdd); > } >}; > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qgenericatomic.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" 2 > > > > ># 95 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" >template<> struct QAtomicIntegerTraits<int> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<unsigned int> { enum { IsInteger = 1 }; }; > >template <int size> struct QBasicAtomicOps: QGenericAtomicOps<QBasicAtomicOps<size> > >{ > static inline bool isReferenceCountingNative() { return true; } > static inline bool isReferenceCountingWaitFree() { return true; } > template <typename T> static bool ref(T &_q_value); > template <typename T> static bool deref(T &_q_value); > > static inline bool isTestAndSetNative() { return true; } > static inline bool isTestAndSetWaitFree() { return true; } > template <typename T> static bool testAndSetRelaxed(T &_q_value, T expectedValue, T newValue); > > static inline bool isFetchAndStoreNative() { return true; } > static inline bool isFetchAndStoreWaitFree() { return true; } > template <typename T> static T fetchAndStoreRelaxed(T &_q_value, T newValue); > > static inline bool isFetchAndAddNative() { return true; } > static inline bool isFetchAndAddWaitFree() { return true; } > template <typename T> static > T fetchAndAddRelaxed(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd); >}; > >template <typename T> struct QAtomicOps : QBasicAtomicOps<sizeof(T)> >{ > typedef T Type; >}; > > > >template<> struct QAtomicIntegerTraits<char> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<signed char> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<unsigned char> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<short> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<unsigned short> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<long> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<unsigned long> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<long long> { enum { IsInteger = 1 }; }; >template<> struct QAtomicIntegerTraits<unsigned long long> { enum { IsInteger = 1 }; }; ># 164 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" >template<> template<typename T> inline >bool QBasicAtomicOps<1>::ref(T &_q_value) >{ > unsigned char ret; > asm volatile("lock\n" > "addb $1, %0\n" > "setne %1" > : "=m" (_q_value), "=qm" (ret) > : "m" (_q_value) > : "memory"); > return ret != 0; >} > >template<> template<typename T> inline >bool QBasicAtomicOps<2>::ref(T &_q_value) >{ > unsigned char ret; > asm volatile("lock\n" > "incw %0\n" > "setne %1" > : "=m" (_q_value), "=qm" (ret) > : "m" (_q_value) > : "memory"); > return ret != 0; >} > >template<> template<typename T> inline >bool QBasicAtomicOps<4>::ref(T &_q_value) >{ > > > asm volatile("lock; addl $1, %0" : "+m" (_q_value) : : "memory"); > asm goto("jz %l[zero]" : : : : zero); > return true; >zero: > return false; ># 210 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" >} > >template<> template <typename T> inline >bool QBasicAtomicOps<1>::deref(T &_q_value) >{ > unsigned char ret; > asm volatile("lock\n" > "subb $1, %0\n" > "setne %1" > : "=m" (_q_value), "=qm" (ret) > : "m" (_q_value) > : "memory"); > return ret != 0; >} > >template<> template <typename T> inline >bool QBasicAtomicOps<2>::deref(T &_q_value) >{ > unsigned char ret; > asm volatile("lock\n" > "decw %0\n" > "setne %1" > : "=m" (_q_value), "=qm" (ret) > : "m" (_q_value) > : "memory"); > return ret != 0; >} > >template<> template <typename T> inline >bool QBasicAtomicOps<4>::deref(T &_q_value) >{ > > > asm volatile("lock; subl $1, %0" : "+m" (_q_value) : : "memory"); > asm goto("jz %l[zero]" : : : : zero); > return true; >zero: > return false; ># 258 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" >} > >template<int size> template <typename T> inline >bool QBasicAtomicOps<size>::testAndSetRelaxed(T &_q_value, T expectedValue, T newValue) >{ > unsigned char ret; > asm volatile("lock\n" > "cmpxchg %3,%2\n" > "sete %1\n" > : "=a" (newValue), "=qm" (ret), "+m" (_q_value) > : "r" (newValue), "0" (expectedValue) > : "memory"); > return ret != 0; >} > >template<> template <typename T> inline >bool QBasicAtomicOps<1>::testAndSetRelaxed(T &_q_value, T expectedValue, T newValue) >{ > unsigned char ret; > asm volatile("lock\n" > "cmpxchg %3,%2\n" > "sete %1\n" > : "=a" (newValue), "=qm" (ret), "+m" (_q_value) > : "q" (newValue), "0" (expectedValue) > : "memory"); > return ret != 0; >} > >template<int size> template <typename T> inline >T QBasicAtomicOps<size>::fetchAndStoreRelaxed(T &_q_value, T newValue) >{ > asm volatile("xchg %0,%1" > : "=r" (newValue), "+m" (_q_value) > : "0" (newValue) > : "memory"); > return newValue; >} > >template<> template <typename T> inline >T QBasicAtomicOps<1>::fetchAndStoreRelaxed(T &_q_value, T newValue) >{ > asm volatile("xchg %0,%1" > : "=q" (newValue), "+m" (_q_value) > : "0" (newValue) > : "memory"); > return newValue; >} > >template<int size> template <typename T> inline >T QBasicAtomicOps<size>::fetchAndAddRelaxed(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) >{ > T result; > asm volatile("lock\n" > "xadd %0,%1" > : "=r" (result), "+m" (_q_value) > : "0" (T(valueToAdd * QAtomicAdditiveType<T>::AddScale)) > : "memory"); > return result; >} > >template<> template <typename T> inline >T QBasicAtomicOps<1>::fetchAndAddRelaxed(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) >{ > T result; > asm volatile("lock\n" > "xadd %0,%1" > : "=q" (result), "+m" (_q_value) > : "0" (T(valueToAdd * QAtomicAdditiveType<T>::AddScale)) > : "memory"); > return result; >} ># 374 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" >template<> template<typename T> inline >bool QBasicAtomicOps<8>::ref(T &_q_value) >{ > unsigned char ret; > asm volatile("lock\n" > "addq $1, %0\n" > "setne %1" > : "=m" (_q_value), "=qm" (ret) > : "m" (_q_value) > : "memory"); > return ret != 0; >} > >template<> template <typename T> inline >bool QBasicAtomicOps<8>::deref(T &_q_value) >{ > unsigned char ret; > asm volatile("lock\n" > "subq $1, %0\n" > "setne %1" > : "=m" (_q_value), "=qm" (ret) > : "m" (_q_value) > : "memory"); > return ret != 0; >} ># 437 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/arch/qatomic_x86.h" > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic_x86.h" 2 ># 85 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" 2 ># 104 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" > > > > > > > > >template <typename T> >class QBasicAtomicInteger >{ >public: > typedef QAtomicOps<T> Ops; > > typedef char PermittedIntegerType[QAtomicIntegerTraits<T>::IsInteger ? 1 : -1]; > > typename Ops::Type _q_value; > > > T load() const { return Ops::load(_q_value); } > void store(T newValue) { Ops::store(_q_value, newValue); } > > > > T loadAcquire() const { return Ops::loadAcquire(_q_value); } > void storeRelease(T newValue) { Ops::storeRelease(_q_value, newValue); } > > static bool isReferenceCountingNative() { return Ops::isReferenceCountingNative(); } > static bool isReferenceCountingWaitFree() { return Ops::isReferenceCountingWaitFree(); } > > bool ref() { return Ops::ref(_q_value); } > bool deref() { return Ops::deref(_q_value); } > > static bool isTestAndSetNative() { return Ops::isTestAndSetNative(); } > static bool isTestAndSetWaitFree() { return Ops::isTestAndSetWaitFree(); } > > bool testAndSetRelaxed(T expectedValue, T newValue) > { return Ops::testAndSetRelaxed(_q_value, expectedValue, newValue); } > bool testAndSetAcquire(T expectedValue, T newValue) > { return Ops::testAndSetAcquire(_q_value, expectedValue, newValue); } > bool testAndSetRelease(T expectedValue, T newValue) > { return Ops::testAndSetRelease(_q_value, expectedValue, newValue); } > bool testAndSetOrdered(T expectedValue, T newValue) > { return Ops::testAndSetOrdered(_q_value, expectedValue, newValue); } > > static bool isFetchAndStoreNative() { return Ops::isFetchAndStoreNative(); } > static bool isFetchAndStoreWaitFree() { return Ops::isFetchAndStoreWaitFree(); } > > T fetchAndStoreRelaxed(T newValue) > { return Ops::fetchAndStoreRelaxed(_q_value, newValue); } > T fetchAndStoreAcquire(T newValue) > { return Ops::fetchAndStoreAcquire(_q_value, newValue); } > T fetchAndStoreRelease(T newValue) > { return Ops::fetchAndStoreRelease(_q_value, newValue); } > T fetchAndStoreOrdered(T newValue) > { return Ops::fetchAndStoreOrdered(_q_value, newValue); } > > static bool isFetchAndAddNative() { return Ops::isFetchAndAddNative(); } > static bool isFetchAndAddWaitFree() { return Ops::isFetchAndAddWaitFree(); } > > T fetchAndAddRelaxed(T valueToAdd) > { return Ops::fetchAndAddRelaxed(_q_value, valueToAdd); } > T fetchAndAddAcquire(T valueToAdd) > { return Ops::fetchAndAddAcquire(_q_value, valueToAdd); } > T fetchAndAddRelease(T valueToAdd) > { return Ops::fetchAndAddRelease(_q_value, valueToAdd); } > T fetchAndAddOrdered(T valueToAdd) > { return Ops::fetchAndAddOrdered(_q_value, valueToAdd); } ># 180 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" >}; >typedef QBasicAtomicInteger<int> QBasicAtomicInt; > >template <typename X> >class QBasicAtomicPointer >{ >public: > typedef X *Type; > typedef QAtomicOps<Type> Ops; > typedef typename Ops::Type AtomicType; > > AtomicType _q_value; > > > Type load() const { return _q_value; } > void store(Type newValue) { _q_value = newValue; } > > > Type loadAcquire() const { return Ops::loadAcquire(_q_value); } > void storeRelease(Type newValue) { Ops::storeRelease(_q_value, newValue); } > > static bool isTestAndSetNative() { return Ops::isTestAndSetNative(); } > static bool isTestAndSetWaitFree() { return Ops::isTestAndSetWaitFree(); } > > bool testAndSetRelaxed(Type expectedValue, Type newValue) > { return Ops::testAndSetRelaxed(_q_value, expectedValue, newValue); } > bool testAndSetAcquire(Type expectedValue, Type newValue) > { return Ops::testAndSetAcquire(_q_value, expectedValue, newValue); } > bool testAndSetRelease(Type expectedValue, Type newValue) > { return Ops::testAndSetRelease(_q_value, expectedValue, newValue); } > bool testAndSetOrdered(Type expectedValue, Type newValue) > { return Ops::testAndSetOrdered(_q_value, expectedValue, newValue); } > > static bool isFetchAndStoreNative() { return Ops::isFetchAndStoreNative(); } > static bool isFetchAndStoreWaitFree() { return Ops::isFetchAndStoreWaitFree(); } > > Type fetchAndStoreRelaxed(Type newValue) > { return Ops::fetchAndStoreRelaxed(_q_value, newValue); } > Type fetchAndStoreAcquire(Type newValue) > { return Ops::fetchAndStoreAcquire(_q_value, newValue); } > Type fetchAndStoreRelease(Type newValue) > { return Ops::fetchAndStoreRelease(_q_value, newValue); } > Type fetchAndStoreOrdered(Type newValue) > { return Ops::fetchAndStoreOrdered(_q_value, newValue); } > > static bool isFetchAndAddNative() { return Ops::isFetchAndAddNative(); } > static bool isFetchAndAddWaitFree() { return Ops::isFetchAndAddWaitFree(); } > > Type fetchAndAddRelaxed(qptrdiff valueToAdd) > { return Ops::fetchAndAddRelaxed(_q_value, valueToAdd); } > Type fetchAndAddAcquire(qptrdiff valueToAdd) > { return Ops::fetchAndAddAcquire(_q_value, valueToAdd); } > Type fetchAndAddRelease(qptrdiff valueToAdd) > { return Ops::fetchAndAddRelease(_q_value, valueToAdd); } > Type fetchAndAddOrdered(qptrdiff valueToAdd) > { return Ops::fetchAndAddOrdered(_q_value, valueToAdd); } ># 244 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qbasicatomic.h" >}; > > > > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qbasicatomic.h" 2 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 > > > > > > > >#pragma GCC diagnostic push >#pragma GCC diagnostic ignored "-Wextra" > > > >class __attribute__((visibility("default"))) QAtomicInt : public QBasicAtomicInt >{ >public: > > inline QAtomicInt(int value = 0) > { > _q_value = value; > } > > inline QAtomicInt(const QAtomicInt &other) > { > store(other.load()); > } > > inline QAtomicInt &operator=(const QAtomicInt &other) > { > this->store(other.load()); > return *this; > } ># 111 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" >}; > > >template <typename T> >class QAtomicPointer : public QBasicAtomicPointer<T> >{ >public: > inline QAtomicPointer(T *value = 0) > { > this->store(value); > } > inline QAtomicPointer(const QAtomicPointer<T> &other) > { > this->store(other.load()); > } > > inline QAtomicPointer<T> &operator=(const QAtomicPointer<T> &other) > { > this->store(other.load()); > return *this; > } ># 158 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" >}; > > >#pragma GCC diagnostic pop ># 170 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" >template <typename T> >inline void qAtomicAssign(T *&d, T *x) >{ > if (d == x) > return; > x->ref.ref(); > if (!d->ref.deref()) > delete d; > d = x; >} ># 189 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" >template <typename T> >inline void qAtomicDetach(T *&d) >{ > if (d->ref.load() == 1) > return; > T *x = d; > d = new T(*d); > if (!x->ref.deref()) > delete x; >} > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobalstatic.h" 2 > > > > >class QGlobalStaticControl >{ > QBasicAtomicInt *guard; > static __attribute__((visibility("default"))) bool startInternal(QBasicAtomicInt *guard); > static __attribute__((visibility("default"))) void abandonInternal(QBasicAtomicInt *guard); > static __attribute__((visibility("default"))) void completedInternal(QBasicAtomicInt *guard); > >public: > QGlobalStaticControl(QBasicAtomicInt *g) : guard(g) {} > ~QGlobalStaticControl() { if (guard) abandonInternal(guard); } > bool start() > { > if (startInternal(guard)) > return true; > > > guard = 0; > return false; > } > void completed() > { > completedInternal(guard); > guard = 0; > } >}; ># 119 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobalstatic.h" >template <typename T, T *(&innerFunction)(), QBasicAtomicInt &guard> >struct QGlobalStatic >{ > typedef T Type; > > bool isDestroyed() const { return guard.load() < -1; } > bool exists() const { return guard.load() == -1; } > operator Type *() { if (isDestroyed()) return 0; return innerFunction(); } > Type *operator()() { if (isDestroyed()) return 0; return innerFunction(); } > Type *operator->() { return innerFunction(); } > Type &operator*() { return *innerFunction(); } >}; ># 145 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobalstatic.h" > > ># 1054 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 > > ># 1 "../../../../qt5/qtbase/include/QtCore/qlogging.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qlogging.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qlogging.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qlogging.h" 2 ># 52 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qlogging.h" > > > > > > > > >class QDebug; >class QNoDebug; > >enum QtMsgType { QtDebugMsg, QtWarningMsg, QtCriticalMsg, QtFatalMsg, QtSystemMsg = QtCriticalMsg }; > >class QMessageLogContext >{ > QMessageLogContext(const QMessageLogContext &) ; QMessageLogContext &operator=(const QMessageLogContext &) ; >public: > QMessageLogContext() : version(1), line(0), file(0), function(0), category(0) {} > QMessageLogContext(const char *fileName, int lineNumber, const char *functionName, const char *categoryName) > : version(1), line(lineNumber), file(fileName), function(functionName), category(categoryName) {} > > void copy(const QMessageLogContext &logContext); > > int version; > int line; > const char *file; > const char *function; > const char *category; > >private: > friend class QMessageLogger; > friend class QDebug; >}; > >class __attribute__((visibility("default"))) QMessageLogger >{ > QMessageLogger(const QMessageLogger &) ; QMessageLogger &operator=(const QMessageLogger &) ; >public: > QMessageLogger() : context() {} > QMessageLogger(const char *file, int line, const char *function) > : context(file, line, function, "default") {} > QMessageLogger(const char *file, int line, const char *function, const char *category) > : context(file, line, function, category) {} > > void debug(const char *msg, ...) > > __attribute__ ((format (printf, 2, 3))) > > ; > void noDebug(const char *, ...) > > __attribute__ ((format (printf, 2, 3))) > > {} > void warning(const char *msg, ...) > > __attribute__ ((format (printf, 2, 3))) > > ; > void critical(const char *msg, ...) > > __attribute__ ((format (printf, 2, 3))) > > ; > > > __attribute__((__noreturn__)) > > void fatal(const char *msg, ...) > > __attribute__ ((format (printf, 2, 3))) > > ; > > > QDebug debug(); > QDebug warning(); > QDebug critical(); > > QNoDebug noDebug(); > > >private: > QMessageLogContext context; >}; ># 158 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qlogging.h" >__attribute__((visibility("default"))) void qt_message_output(QtMsgType, const QMessageLogContext &context, > const QString &message); > >__attribute__((visibility("default"))) void qErrnoWarning(int code, const char *msg, ...); >__attribute__((visibility("default"))) void qErrnoWarning(const char *msg, ...); > > >typedef void (*QtMsgHandler)(QtMsgType, const char *); >__attribute__((visibility("default"))) QtMsgHandler qInstallMsgHandler(QtMsgHandler); > >typedef void (*QtMessageHandler)(QtMsgType, const QMessageLogContext &, const QString &); >__attribute__((visibility("default"))) QtMessageHandler qInstallMessageHandler(QtMessageHandler); > > >typedef void (*QMessageHandler)(QtMsgType, const QMessageLogContext &, const char *); >__attribute__((visibility("default"))) QMessageHandler qInstallMessageHandler(QMessageHandler); > >__attribute__((visibility("default"))) void qSetMessagePattern(const QString &messagePattern); > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qlogging.h" 2 ># 1057 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qflags.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qflags.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qflags.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qflags.h" 2 > > > > > >class QFlag >{ > int i; >public: > inline QFlag(int i); > inline operator int() const { return i; } >}; > >inline QFlag::QFlag(int ai) : i(ai) {} > >class QIncompatibleFlag >{ > int i; >public: > inline explicit QIncompatibleFlag(int i); > inline operator int() const { return i; } >}; > >inline QIncompatibleFlag::QIncompatibleFlag(int ai) : i(ai) {} > > > > >template<typename Enum> >class QFlags >{ > typedef void **Zero; > int i; >public: > typedef Enum enum_type; > > > > > > inline QFlags(Enum f) : i(f) {} > inline QFlags(Zero = 0) : i(0) {} > inline QFlags(QFlag f) : i(f) {} > > inline QFlags &operator&=(int mask) { i &= mask; return *this; } > inline QFlags &operator&=(uint mask) { i &= mask; return *this; } > inline QFlags &operator|=(QFlags f) { i |= f.i; return *this; } > inline QFlags &operator|=(Enum f) { i |= f; return *this; } > inline QFlags &operator^=(QFlags f) { i ^= f.i; return *this; } > inline QFlags &operator^=(Enum f) { i ^= f; return *this; } > > inline operator int() const { return i; } > > inline QFlags operator|(QFlags f) const { return QFlags(Enum(i | f.i)); } > inline QFlags operator|(Enum f) const { return QFlags(Enum(i | f)); } > inline QFlags operator^(QFlags f) const { return QFlags(Enum(i ^ f.i)); } > inline QFlags operator^(Enum f) const { return QFlags(Enum(i ^ f)); } > inline QFlags operator&(int mask) const { return QFlags(Enum(i & mask)); } > inline QFlags operator&(uint mask) const { return QFlags(Enum(i & mask)); } > inline QFlags operator&(Enum f) const { return QFlags(Enum(i & f)); } > inline QFlags operator~() const { return QFlags(Enum(~i)); } > > inline bool operator!() const { return !i; } > > inline bool testFlag(Enum f) const { return (i & f) == f && (f != 0 || i == int(f) ); } >}; ># 135 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qflags.h" > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qflags.h" 2 ># 1058 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qsysinfo.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qsysinfo.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qsysinfo.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qsysinfo.h" 2 > > > > > > > > >class QString; >class __attribute__((visibility("default"))) QSysInfo { >public: > enum Sizes { > WordSize = (sizeof(void *)<<3) > }; ># 69 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qsysinfo.h" > enum Endian { > BigEndian, > LittleEndian > > > > > > > , ByteOrder = LittleEndian > > > > }; ># 151 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qsysinfo.h" >}; > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qsysinfo.h" 2 ># 1059 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qtypeinfo.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" 2 > > > ># 58 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" >template <typename T> >class QTypeInfo >{ >public: > enum { > isPointer = false, > isComplex = true, > isStatic = true, > isLarge = (sizeof(T)>sizeof(void*)), > isDummy = false, > sizeOf = sizeof(T) > }; >}; > >template<> >class QTypeInfo<void> >{ >public: > enum { > isPointer = false, > isComplex = false, > isStatic = false, > isLarge = false, > isDummy = false, > sizeOf = 0 > }; >}; > >template <typename T> >class QTypeInfo<T*> >{ >public: > enum { > isPointer = true, > isComplex = false, > isStatic = false, > isLarge = false, > isDummy = false, > sizeOf = sizeof(T*) > }; >}; ># 117 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" >template <typename T> class QList; template <typename T> class QTypeInfo< QList<T> > { public: enum { isPointer = false, isComplex = true, isStatic = false, isLarge = (sizeof(QList<T>) > sizeof(void*)), isDummy = false, sizeOf = sizeof(QList<T>) }; }; >template <typename T> class QVector; template <typename T> class QTypeInfo< QVector<T> > { public: enum { isPointer = false, isComplex = true, isStatic = false, isLarge = (sizeof(QVector<T>) > sizeof(void*)), isDummy = false, sizeOf = sizeof(QVector<T>) }; }; >template <typename T> class QQueue; template <typename T> class QTypeInfo< QQueue<T> > { public: enum { isPointer = false, isComplex = true, isStatic = false, isLarge = (sizeof(QQueue<T>) > sizeof(void*)), isDummy = false, sizeOf = sizeof(QQueue<T>) }; }; >template <typename T> class QStack; template <typename T> class QTypeInfo< QStack<T> > { public: enum { isPointer = false, isComplex = true, isStatic = false, isLarge = (sizeof(QStack<T>) > sizeof(void*)), isDummy = false, sizeOf = sizeof(QStack<T>) }; }; >template <typename T> class QLinkedList; template <typename T> class QTypeInfo< QLinkedList<T> > { public: enum { isPointer = false, isComplex = true, isStatic = false, isLarge = (sizeof(QLinkedList<T>) > sizeof(void*)), isDummy = false, sizeOf = sizeof(QLinkedList<T>) }; }; >template <typename T> class QSet; template <typename T> class QTypeInfo< QSet<T> > { public: enum { isPointer = false, isComplex = true, isStatic = false, isLarge = (sizeof(QSet<T>) > sizeof(void*)), isDummy = false, sizeOf = sizeof(QSet<T>) }; }; ># 134 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" >enum { > Q_COMPLEX_TYPE = 0, > Q_PRIMITIVE_TYPE = 0x1, > Q_STATIC_TYPE = 0, > Q_MOVABLE_TYPE = 0x2, > Q_DUMMY_TYPE = 0x4 >}; ># 162 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" >template<typename T> class QFlags; >template<typename T> >class QTypeInfo<QFlags<T> > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QFlags<T>)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QFlags<T>) }; static inline const char *name() { return "QFlags<T>"; } }; ># 191 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qtypeinfo.h" >template<> class QTypeInfo<bool > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(bool)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(bool) }; static inline const char *name() { return "bool"; } }; >template<> class QTypeInfo<char > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(char)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(char) }; static inline const char *name() { return "char"; } }; >template<> class QTypeInfo<signed char > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(signed char)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(signed char) }; static inline const char *name() { return "signed char"; } }; >template<> class QTypeInfo<uchar > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(uchar)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(uchar) }; static inline const char *name() { return "uchar"; } }; >template<> class QTypeInfo<short > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(short)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(short) }; static inline const char *name() { return "short"; } }; >template<> class QTypeInfo<ushort > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(ushort)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(ushort) }; static inline const char *name() { return "ushort"; } }; >template<> class QTypeInfo<int > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(int)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(int) }; static inline const char *name() { return "int"; } }; >template<> class QTypeInfo<uint > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(uint)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(uint) }; static inline const char *name() { return "uint"; } }; >template<> class QTypeInfo<long > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(long)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(long) }; static inline const char *name() { return "long"; } }; >template<> class QTypeInfo<ulong > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(ulong)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(ulong) }; static inline const char *name() { return "ulong"; } }; >template<> class QTypeInfo<qint64 > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(qint64)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(qint64) }; static inline const char *name() { return "qint64"; } }; >template<> class QTypeInfo<quint64 > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(quint64)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(quint64) }; static inline const char *name() { return "quint64"; } }; >template<> class QTypeInfo<float > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(float)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(float) }; static inline const char *name() { return "float"; } }; >template<> class QTypeInfo<double > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(double)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(double) }; static inline const char *name() { return "double"; } }; > >template<> class QTypeInfo<long double > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(long double)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(long double) }; static inline const char *name() { return "long double"; } }; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qtypeinfo.h" 2 ># 1060 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qglobal.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 2 ># 37 "../../../../../../src/qt/creator/src/libs/languageutils/languageutils_global.h" 2 ># 37 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 ># 1 "../../../../../../src/qt/creator/src/libs/languageutils/componentversion.h" 1 ># 38 "../../../../../../src/qt/creator/src/libs/languageutils/componentversion.h" >namespace LanguageUtils { > >class __attribute__((visibility("protected"))) ComponentVersion >{ > int _major; > int _minor; > >public: > static const int NoVersion; > static const int MaxVersion; > > ComponentVersion(); > ComponentVersion(int major, int minor); > explicit ComponentVersion(const QString &versionString); > ~ComponentVersion(); > > int majorVersion() const > { return _major; } > int minorVersion() const > { return _minor; } > > bool isValid() const; > QString toString() const; >}; > >bool __attribute__((visibility("protected"))) operator<(const ComponentVersion &lhs, const ComponentVersion &rhs); >bool __attribute__((visibility("protected"))) operator<=(const ComponentVersion &lhs, const ComponentVersion &rhs); >bool __attribute__((visibility("protected"))) operator>(const ComponentVersion &lhs, const ComponentVersion &rhs); >bool __attribute__((visibility("protected"))) operator>=(const ComponentVersion &lhs, const ComponentVersion &rhs); >bool __attribute__((visibility("protected"))) operator==(const ComponentVersion &lhs, const ComponentVersion &rhs); >bool __attribute__((visibility("protected"))) operator!=(const ComponentVersion &lhs, const ComponentVersion &rhs); > >} ># 38 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 > ># 1 "../../../../qt5/qtbase/include/QtCore/QString" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qchar.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qchar.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qchar.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qchar.h" 2 > > > > > > >class QString; > >struct QLatin1Char >{ >public: > inline explicit QLatin1Char(char c) : ch(c) {} > inline char toLatin1() const { return ch; } > inline ushort unicode() const { return ushort(uchar(ch)); } > >private: > char ch; >}; > > >class __attribute__((visibility("default"))) QChar { >public: > enum SpecialCharacter { > Null = 0x0000, > Tabulation = 0x0009, > LineFeed = 0x000a, > CarriageReturn = 0x000d, > Space = 0x0020, > Nbsp = 0x00a0, > ReplacementCharacter = 0xfffd, > ObjectReplacementCharacter = 0xfffc, > ByteOrderMark = 0xfeff, > ByteOrderSwapped = 0xfffe, > ParagraphSeparator = 0x2029, > LineSeparator = 0x2028, > LastValidCodePoint = 0x10ffff > }; > > QChar() : ucs(0) {} > QChar(ushort rc) : ucs(rc){} > QChar(uchar c, uchar r) : ucs(ushort((r << 8) | c)){} > QChar(short rc) : ucs(ushort(rc)){} > QChar(uint rc) : ucs(ushort(rc & 0xffff)){} > QChar(int rc) : ucs(ushort(rc & 0xffff)){} > QChar(SpecialCharacter s) : ucs(ushort(s)) {} > QChar(QLatin1Char ch) : ucs(ch.unicode()) {} > > > explicit QChar(char c) : ucs(uchar(c)) { } > explicit QChar(uchar c) : ucs(c) { } > > > > enum Category > { > Mark_NonSpacing, > Mark_SpacingCombining, > Mark_Enclosing, > > Number_DecimalDigit, > Number_Letter, > Number_Other, > > Separator_Space, > Separator_Line, > Separator_Paragraph, > > Other_Control, > Other_Format, > Other_Surrogate, > Other_PrivateUse, > Other_NotAssigned, > > Letter_Uppercase, > Letter_Lowercase, > Letter_Titlecase, > Letter_Modifier, > Letter_Other, > > Punctuation_Connector, > Punctuation_Dash, > Punctuation_Open, > Punctuation_Close, > Punctuation_InitialQuote, > Punctuation_FinalQuote, > Punctuation_Other, > > Symbol_Math, > Symbol_Currency, > Symbol_Modifier, > Symbol_Other > }; > > enum Direction > { > DirL, DirR, DirEN, DirES, DirET, DirAN, DirCS, DirB, DirS, DirWS, DirON, > DirLRE, DirLRO, DirAL, DirRLE, DirRLO, DirPDF, DirNSM, DirBN > }; > > enum Decomposition > { > NoDecomposition, > Canonical, > Font, > NoBreak, > Initial, > Medial, > Final, > Isolated, > Circle, > Super, > Sub, > Vertical, > Wide, > Narrow, > Small, > Square, > Compat, > Fraction > }; > > enum Joining > { > OtherJoining, Dual, Right, Center > }; > > enum CombiningClass > { > Combining_BelowLeftAttached = 200, > Combining_BelowAttached = 202, > Combining_BelowRightAttached = 204, > Combining_LeftAttached = 208, > Combining_RightAttached = 210, > Combining_AboveLeftAttached = 212, > Combining_AboveAttached = 214, > Combining_AboveRightAttached = 216, > > Combining_BelowLeft = 218, > Combining_Below = 220, > Combining_BelowRight = 222, > Combining_Left = 224, > Combining_Right = 226, > Combining_AboveLeft = 228, > Combining_Above = 230, > Combining_AboveRight = 232, > > Combining_DoubleBelow = 233, > Combining_DoubleAbove = 234, > Combining_IotaSubscript = 240 > }; > > enum UnicodeVersion { > Unicode_Unassigned, > Unicode_1_1, > Unicode_2_0, > Unicode_2_1_2, > Unicode_3_0, > Unicode_3_1, > Unicode_3_2, > Unicode_4_0, > Unicode_4_1, > Unicode_5_0 > }; > > > inline Category category() const { return QChar::category(ucs); } > inline Direction direction() const { return QChar::direction(ucs); } > inline Joining joining() const { return QChar::joining(ucs); } > inline unsigned char combiningClass() const { return QChar::combiningClass(ucs); } > > inline QChar mirroredChar() const { return QChar::mirroredChar(ucs); } > inline bool hasMirrored() const { return QChar::hasMirrored(ucs); } > > QString decomposition() const; > inline Decomposition decompositionTag() const { return QChar::decompositionTag(ucs); } > > inline int digitValue() const { return QChar::digitValue(ucs); } > inline QChar toLower() const { return QChar::toLower(ucs); } > inline QChar toUpper() const { return QChar::toUpper(ucs); } > inline QChar toTitleCase() const { return QChar::toTitleCase(ucs); } > inline QChar toCaseFolded() const { return QChar::toCaseFolded(ucs); } > > inline UnicodeVersion unicodeVersion() const { return QChar::unicodeVersion(ucs); } > > > inline char toAscii() const { return toLatin1(); } > > inline char toLatin1() const; > inline ushort unicode() const { return ucs; } > inline ushort &unicode() { return ucs; } > > > static inline QChar fromAscii(char c) > { return fromLatin1(c); } > > static inline QChar fromLatin1(char c); > > inline bool isNull() const { return ucs == 0; } > > inline bool isPrint() const { return QChar::isPrint(ucs); } > inline bool isSpace() const { return QChar::isSpace(ucs); } > inline bool isMark() const { return QChar::isMark(ucs); } > inline bool isPunct() const { return QChar::isPunct(ucs); } > inline bool isSymbol() const { return QChar::isSymbol(ucs); } > inline bool isLetter() const { return QChar::isLetter(ucs); } > inline bool isNumber() const { return QChar::isNumber(ucs); } > inline bool isLetterOrNumber() const { return QChar::isLetterOrNumber(ucs); } > inline bool isDigit() const { return QChar::isDigit(ucs); } > inline bool isLower() const { return QChar::isLower(ucs); } > inline bool isUpper() const { return QChar::isUpper(ucs); } > inline bool isTitleCase() const { return QChar::isTitleCase(ucs); } > > inline bool isNonCharacter() const { return QChar::isNonCharacter(ucs); } > inline bool isHighSurrogate() const { return QChar::isHighSurrogate(ucs); } > inline bool isLowSurrogate() const { return QChar::isLowSurrogate(ucs); } > inline bool isSurrogate() const { return QChar::isSurrogate(ucs); } > > inline uchar cell() const { return uchar(ucs & 0xff); } > inline uchar row() const { return uchar((ucs>>8)&0xff); } > inline void setCell(uchar cell); > inline void setRow(uchar row); > > static inline bool isNonCharacter(uint ucs4) { > return ucs4 >= 0xfdd0 && (ucs4 <= 0xfdef || (ucs4 & 0xfffe) == 0xfffe); > } > static inline bool isHighSurrogate(uint ucs4) { > return ((ucs4 & 0xfffffc00) == 0xd800); > } > static inline bool isLowSurrogate(uint ucs4) { > return ((ucs4 & 0xfffffc00) == 0xdc00); > } > static inline bool isSurrogate(uint ucs4) { > return (ucs4 - 0xd800u < 2048u); > } > static inline bool requiresSurrogates(uint ucs4) { > return (ucs4 >= 0x10000); > } > static inline uint surrogateToUcs4(ushort high, ushort low) { > return (uint(high)<<10) + low - 0x35fdc00; > } > static inline uint surrogateToUcs4(QChar high, QChar low) { > return surrogateToUcs4(high.unicode(), low.unicode()); > } > static inline ushort highSurrogate(uint ucs4) { > return ushort((ucs4>>10) + 0xd7c0); > } > static inline ushort lowSurrogate(uint ucs4) { > return ushort(ucs4%0x400 + 0xdc00); > } > > static Category category(uint ucs4); > static Direction direction(uint ucs4); > static Joining joining(uint ucs4); > static unsigned char combiningClass(uint ucs4); > > static uint mirroredChar(uint ucs4); > static bool hasMirrored(uint ucs4); > > static QString decomposition(uint ucs4); > static Decomposition decompositionTag(uint ucs4); > > static int digitValue(uint ucs4); > static uint toLower(uint ucs4); > static uint toUpper(uint ucs4); > static uint toTitleCase(uint ucs4); > static uint toCaseFolded(uint ucs4); > > static UnicodeVersion unicodeVersion(uint ucs4); > > static UnicodeVersion currentUnicodeVersion(); > > static bool isPrint(uint ucs4); > static inline bool isSpace(uint ucs4); > static bool isMark(uint ucs4); > static bool isPunct(uint ucs4); > static bool isSymbol(uint ucs4); > static inline bool isLetter(uint ucs4); > static inline bool isNumber(uint ucs4); > static inline bool isLetterOrNumber(uint ucs4); > static inline bool isDigit(uint ucs4); > static inline bool isLower(uint ucs4); > static inline bool isUpper(uint ucs4); > static inline bool isTitleCase(uint ucs4); > >private: > static bool isSpace_helper(uint ucs4); > static bool isLetter_helper(uint ucs4); > static bool isNumber_helper(uint ucs4); > static bool isLetterOrNumber_helper(uint ucs4); > > > > > > ushort ucs; >}; > >template<> class QTypeInfo<QChar > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QChar)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QChar) }; static inline const char *name() { return "QChar"; } }; > >inline char QChar::toLatin1() const { return ucs > 0xff ? '\0' : char(ucs); } >inline QChar QChar::fromLatin1(char c) { return QChar(ushort(uchar(c))); } > >inline void QChar::setCell(uchar acell) >{ ucs = ushort((ucs & 0xff00) + acell); } >inline void QChar::setRow(uchar arow) >{ ucs = ushort((ushort(arow)<<8) + (ucs&0xff)); } > >inline bool QChar::isSpace(uint ucs4) >{ > > return ucs4 == 0x20 || (ucs4 <= 0x0d && ucs4 >= 0x09) > || (ucs4 > 127 && (ucs4 == 0x85 || ucs4 == 0xa0 || QChar::isSpace_helper(ucs4))); >} >inline bool QChar::isLetter(uint ucs4) >{ > return (ucs4 >= 'A' && ucs4 <= 'z' && (ucs4 >= 'a' || ucs4 <= 'Z')) > || (ucs4 > 127 && QChar::isLetter_helper(ucs4)); >} >inline bool QChar::isNumber(uint ucs4) >{ return (ucs4 <= '9' && ucs4 >= '0') || (ucs4 > 127 && QChar::isNumber_helper(ucs4)); } >inline bool QChar::isLetterOrNumber(uint ucs4) >{ > return (ucs4 >= 'A' && ucs4 <= 'z' && (ucs4 >= 'a' || ucs4 <= 'Z')) > || (ucs4 >= '0' && ucs4 <= '9') > || (ucs4 > 127 && QChar::isLetterOrNumber_helper(ucs4)); >} >inline bool QChar::isDigit(uint ucs4) >{ return (ucs4 <= '9' && ucs4 >= '0') || (ucs4 > 127 && QChar::category(ucs4) == Number_DecimalDigit); } >inline bool QChar::isLower(uint ucs4) >{ return (ucs4 <= 'z' && ucs4 >= 'a') || (ucs4 > 127 && QChar::category(ucs4) == Letter_Lowercase); } >inline bool QChar::isUpper(uint ucs4) >{ return (ucs4 <= 'Z' && ucs4 >= 'A') || (ucs4 > 127 && QChar::category(ucs4) == Letter_Uppercase); } >inline bool QChar::isTitleCase(uint ucs4) >{ return ucs4 > 127 && QChar::category(ucs4) == Letter_Titlecase; } > >inline bool operator==(QChar c1, QChar c2) { return c1.unicode() == c2.unicode(); } >inline bool operator!=(QChar c1, QChar c2) { return c1.unicode() != c2.unicode(); } >inline bool operator<=(QChar c1, QChar c2) { return c1.unicode() <= c2.unicode(); } >inline bool operator>=(QChar c1, QChar c2) { return c1.unicode() >= c2.unicode(); } >inline bool operator<(QChar c1, QChar c2) { return c1.unicode() < c2.unicode(); } >inline bool operator>(QChar c1, QChar c2) { return c1.unicode() > c2.unicode(); } > > >__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, QChar); >__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QChar &); > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qchar.h" 2 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qbytearray.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qrefcount.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qrefcount.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qrefcount.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 2 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qrefcount.h" 2 > > > > > > >namespace QtPrivate >{ > >class RefCount >{ >public: > inline bool ref() { > int count = atomic.load(); > if (count == 0) > return false; > if (count != -1) > atomic.ref(); > return true; > } > > inline bool deref() { > int count = atomic.load(); > if (count == 0) > return false; > if (count == -1) > return true; > return atomic.deref(); > } > > bool setSharable(bool sharable) > { > ((!(!isShared())) ? qt_assert("!isShared()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qrefcount.h",78) : qt_noop()); > if (sharable) > return atomic.testAndSetRelaxed(0, 1); > else > return atomic.testAndSetRelaxed(1, 0); > } > > bool isStatic() const > { > > return atomic.load() == -1; > } > > bool isSharable() const > { > > return atomic.load() != 0; > } > > bool isShared() const > { > int count = atomic.load(); > return (count != 1) && (count != 0); > } > > void initializeOwned() { atomic.store(1); } > void initializeUnsharable() { atomic.store(0); } > > QBasicAtomicInt atomic; >}; > >} > > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qrefcount.h" 2 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qnamespace.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qnamespace.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qnamespace.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qnamespace.h" 2 > > > > > > > >namespace > > > >Qt { ># 106 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qnamespace.h" > enum GlobalColor { > color0, > color1, > black, > white, > darkGray, > gray, > lightGray, > red, > green, > blue, > cyan, > magenta, > yellow, > darkRed, > darkGreen, > darkBlue, > darkCyan, > darkMagenta, > darkYellow, > transparent > }; > > enum KeyboardModifier { > NoModifier = 0x00000000, > ShiftModifier = 0x02000000, > ControlModifier = 0x04000000, > AltModifier = 0x08000000, > MetaModifier = 0x10000000, > KeypadModifier = 0x20000000, > GroupSwitchModifier = 0x40000000, > > KeyboardModifierMask = 0xfe000000 > }; > typedef QFlags<KeyboardModifier> KeyboardModifiers; > > > enum Modifier { > META = Qt::MetaModifier, > SHIFT = Qt::ShiftModifier, > CTRL = Qt::ControlModifier, > ALT = Qt::AltModifier, > MODIFIER_MASK = KeyboardModifierMask, > UNICODE_ACCEL = 0x00000000 > }; > > enum MouseButton { > NoButton = 0x00000000, > LeftButton = 0x00000001, > RightButton = 0x00000002, > MidButton = 0x00000004, > MiddleButton = MidButton, > BackButton = 0x00000008, > XButton1 = BackButton, > ExtraButton1 = XButton1, > ForwardButton = 0x00000010, > XButton2 = ForwardButton, > ExtraButton2 = ForwardButton, > TaskButton = 0x00000020, > ExtraButton3 = TaskButton, > ExtraButton4 = 0x00000040, > ExtraButton5 = 0x00000080, > ExtraButton6 = 0x00000100, > ExtraButton7 = 0x00000200, > ExtraButton8 = 0x00000400, > ExtraButton9 = 0x00000800, > ExtraButton10 = 0x00001000, > ExtraButton11 = 0x00002000, > ExtraButton12 = 0x00004000, > ExtraButton13 = 0x00008000, > ExtraButton14 = 0x00010000, > ExtraButton15 = 0x00020000, > ExtraButton16 = 0x00040000, > ExtraButton17 = 0x00080000, > ExtraButton18 = 0x00100000, > ExtraButton19 = 0x00200000, > ExtraButton20 = 0x00400000, > ExtraButton21 = 0x00800000, > ExtraButton22 = 0x01000000, > ExtraButton23 = 0x02000000, > ExtraButton24 = 0x04000000, > AllButtons = 0x07ffffff, > MaxMouseButton = ExtraButton24, > > MouseButtonMask = 0xffffffff > }; > typedef QFlags<MouseButton> MouseButtons; > > enum Orientation { > Horizontal = 0x1, > Vertical = 0x2 > }; > > typedef QFlags<Orientation> Orientations; > > enum FocusPolicy { > NoFocus = 0, > TabFocus = 0x1, > ClickFocus = 0x2, > StrongFocus = TabFocus | ClickFocus | 0x8, > WheelFocus = StrongFocus | 0x4 > }; > > enum SortOrder { > AscendingOrder, > DescendingOrder > }; > > enum TileRule { > StretchTile, > RepeatTile, > RoundTile > }; > > > > > > enum AlignmentFlag { > AlignLeft = 0x0001, > AlignLeading = AlignLeft, > AlignRight = 0x0002, > AlignTrailing = AlignRight, > AlignHCenter = 0x0004, > AlignJustify = 0x0008, > AlignAbsolute = 0x0010, > AlignHorizontal_Mask = AlignLeft | AlignRight | AlignHCenter | AlignJustify | AlignAbsolute, > > AlignTop = 0x0020, > AlignBottom = 0x0040, > AlignVCenter = 0x0080, > AlignVertical_Mask = AlignTop | AlignBottom | AlignVCenter, > > AlignCenter = AlignVCenter | AlignHCenter > }; > > typedef QFlags<AlignmentFlag> Alignment; > > enum TextFlag { > TextSingleLine = 0x0100, > TextDontClip = 0x0200, > TextExpandTabs = 0x0400, > TextShowMnemonic = 0x0800, > TextWordWrap = 0x1000, > TextWrapAnywhere = 0x2000, > TextDontPrint = 0x4000, > TextIncludeTrailingSpaces = 0x08000000, > TextHideMnemonic = 0x8000, > TextJustificationForced = 0x10000, > TextForceLeftToRight = 0x20000, > TextForceRightToLeft = 0x40000, > TextLongestVariant = 0x80000, > TextBypassShaping = 0x100000 > }; > > enum TextElideMode { > ElideLeft, > ElideRight, > ElideMiddle, > ElideNone > }; > > enum WindowType { > Widget = 0x00000000, > Window = 0x00000001, > Dialog = 0x00000002 | Window, > Sheet = 0x00000004 | Window, > Drawer = Sheet | Dialog, > Popup = 0x00000008 | Window, > Tool = Popup | Dialog, > ToolTip = Popup | Sheet, > SplashScreen = ToolTip | Dialog, > Desktop = 0x00000010 | Window, > SubWindow = 0x00000012, > > WindowType_Mask = 0x000000ff, > MSWindowsFixedSizeDialogHint = 0x00000100, > MSWindowsOwnDC = 0x00000200, > X11BypassWindowManagerHint = 0x00000400, > FramelessWindowHint = 0x00000800, > WindowTitleHint = 0x00001000, > WindowSystemMenuHint = 0x00002000, > WindowMinimizeButtonHint = 0x00004000, > WindowMaximizeButtonHint = 0x00008000, > WindowMinMaxButtonsHint = WindowMinimizeButtonHint | WindowMaximizeButtonHint, > WindowContextHelpButtonHint = 0x00010000, > WindowShadeButtonHint = 0x00020000, > WindowStaysOnTopHint = 0x00040000, > WindowTransparentForInput = 0x00080000, > WindowOverridesSystemGestures = 0x00100000, > WindowDoesNotAcceptFocus = 0x00200000, > > CustomizeWindowHint = 0x02000000, > WindowStaysOnBottomHint = 0x04000000, > WindowCloseButtonHint = 0x08000000, > MacWindowToolBarButtonHint = 0x10000000, > BypassGraphicsProxyWidget = 0x20000000, > WindowOkButtonHint = 0x00080000, > WindowCancelButtonHint = 0x00100000, > WindowSoftkeysVisibleHint = 0x40000000, > WindowSoftkeysRespondHint = 0x80000000 > }; > > typedef QFlags<WindowType> WindowFlags; > > enum WindowState { > WindowNoState = 0x00000000, > WindowMinimized = 0x00000001, > WindowMaximized = 0x00000002, > WindowFullScreen = 0x00000004, > WindowActive = 0x00000008 > }; > > typedef QFlags<WindowState> WindowStates; > > enum ScreenOrientation { > PrimaryOrientation = 0x00000000, > PortraitOrientation = 0x00000001, > LandscapeOrientation = 0x00000002, > InvertedPortraitOrientation = 0x00000004, > InvertedLandscapeOrientation = 0x00000008 > }; > > typedef QFlags<ScreenOrientation> ScreenOrientations; > > enum WidgetAttribute { > WA_Disabled = 0, > WA_UnderMouse = 1, > WA_MouseTracking = 2, > WA_ContentsPropagated = 3, > WA_OpaquePaintEvent = 4, > WA_NoBackground = WA_OpaquePaintEvent, > WA_StaticContents = 5, > WA_LaidOut = 7, > WA_PaintOnScreen = 8, > WA_NoSystemBackground = 9, > WA_UpdatesDisabled = 10, > WA_Mapped = 11, > WA_MacNoClickThrough = 12, > WA_InputMethodEnabled = 14, > WA_WState_Visible = 15, > WA_WState_Hidden = 16, > > WA_ForceDisabled = 32, > WA_KeyCompression = 33, > WA_PendingMoveEvent = 34, > WA_PendingResizeEvent = 35, > WA_SetPalette = 36, > WA_SetFont = 37, > WA_SetCursor = 38, > WA_NoChildEventsFromChildren = 39, > WA_WindowModified = 41, > WA_Resized = 42, > WA_Moved = 43, > WA_PendingUpdate = 44, > WA_InvalidSize = 45, > WA_MacBrushedMetal = 46, > WA_MacMetalStyle = WA_MacBrushedMetal, > WA_CustomWhatsThis = 47, > WA_LayoutOnEntireRect = 48, > WA_OutsideWSRange = 49, > WA_GrabbedShortcut = 50, > WA_TransparentForMouseEvents = 51, > WA_PaintUnclipped = 52, > WA_SetWindowIcon = 53, > WA_NoMouseReplay = 54, > WA_DeleteOnClose = 55, > WA_RightToLeft = 56, > WA_SetLayoutDirection = 57, > WA_NoChildEventsForParent = 58, > WA_ForceUpdatesDisabled = 59, > > WA_WState_Created = 60, > WA_WState_CompressKeys = 61, > WA_WState_InPaintEvent = 62, > WA_WState_Reparented = 63, > WA_WState_ConfigPending = 64, > WA_WState_Polished = 66, > WA_WState_DND = 67, > WA_WState_OwnSizePolicy = 68, > WA_WState_ExplicitShowHide = 69, > > WA_ShowModal = 70, > WA_MouseNoMask = 71, > WA_GroupLeader = 72, > WA_NoMousePropagation = 73, > WA_Hover = 74, > WA_InputMethodTransparent = 75, > WA_QuitOnClose = 76, > > WA_KeyboardFocusChange = 77, > > WA_AcceptDrops = 78, > WA_DropSiteRegistered = 79, > WA_ForceAcceptDrops = WA_DropSiteRegistered, > > WA_WindowPropagation = 80, > > WA_NoX11EventCompression = 81, > WA_TintedBackground = 82, > WA_X11OpenGLOverlay = 83, > WA_AlwaysShowToolTips = 84, > WA_MacOpaqueSizeGrip = 85, > WA_SetStyle = 86, > > WA_SetLocale = 87, > WA_MacShowFocusRect = 88, > > WA_MacNormalSize = 89, > WA_MacSmallSize = 90, > WA_MacMiniSize = 91, > > WA_LayoutUsesWidgetRect = 92, > WA_StyledBackground = 93, > WA_MSWindowsUseDirect3D = 94, > WA_CanHostQMdiSubWindowTitleBar = 95, > > WA_MacAlwaysShowToolWindow = 96, > > WA_StyleSheet = 97, > > WA_ShowWithoutActivating = 98, > > WA_X11BypassTransientForHint = 99, > > WA_NativeWindow = 100, > WA_DontCreateNativeAncestors = 101, > > WA_MacVariableSize = 102, > > WA_DontShowOnScreen = 103, > > > WA_X11NetWmWindowTypeDesktop = 104, > WA_X11NetWmWindowTypeDock = 105, > WA_X11NetWmWindowTypeToolBar = 106, > WA_X11NetWmWindowTypeMenu = 107, > WA_X11NetWmWindowTypeUtility = 108, > WA_X11NetWmWindowTypeSplash = 109, > WA_X11NetWmWindowTypeDialog = 110, > WA_X11NetWmWindowTypeDropDownMenu = 111, > WA_X11NetWmWindowTypePopupMenu = 112, > WA_X11NetWmWindowTypeToolTip = 113, > WA_X11NetWmWindowTypeNotification = 114, > WA_X11NetWmWindowTypeCombo = 115, > WA_X11NetWmWindowTypeDND = 116, > > WA_MacFrameworkScaled = 117, > > WA_SetWindowModality = 118, > WA_WState_WindowOpacitySet = 119, > WA_TranslucentBackground = 120, > > WA_AcceptTouchEvents = 121, > WA_WState_AcceptedTouchBeginEvent = 122, > WA_TouchPadAcceptSingleTouchEvents = 123, > > WA_MergeSoftkeys = 124, > WA_MergeSoftkeysRecursively = 125, > > WA_X11DoNotAcceptFocus = 126, > WA_MacNoShadow = 127, > > > WA_AttributeCount > }; > > enum ApplicationAttribute > { > AA_ImmediateWidgetCreation = 0, > AA_MSWindowsUseDirect3DByDefault = 1, > AA_DontShowIconsInMenus = 2, > AA_NativeWindows = 3, > AA_DontCreateNativeWidgetSiblings = 4, > AA_MacPluginApplication = 5, > AA_DontUseNativeMenuBar = 6, > AA_MacDontSwapCtrlAndMeta = 7, > AA_Use96Dpi = 8, > AA_X11InitThreads = 10, > AA_SynthesizeTouchForUnhandledMouseEvents = 11, > AA_SynthesizeMouseForUnhandledTouchEvents = 12, > > > AA_AttributeCount > }; > > > > > > enum ImageConversionFlag { > ColorMode_Mask = 0x00000003, > AutoColor = 0x00000000, > ColorOnly = 0x00000003, > MonoOnly = 0x00000002, > > > AlphaDither_Mask = 0x0000000c, > ThresholdAlphaDither = 0x00000000, > OrderedAlphaDither = 0x00000004, > DiffuseAlphaDither = 0x00000008, > NoAlpha = 0x0000000c, > > Dither_Mask = 0x00000030, > DiffuseDither = 0x00000000, > OrderedDither = 0x00000010, > ThresholdDither = 0x00000020, > > > DitherMode_Mask = 0x000000c0, > AutoDither = 0x00000000, > PreferDither = 0x00000040, > AvoidDither = 0x00000080, > > NoOpaqueDetection = 0x00000100, > NoFormatConversion = 0x00000200 > }; > typedef QFlags<ImageConversionFlag> ImageConversionFlags; > > enum BGMode { > TransparentMode, > OpaqueMode > }; > > enum Key { > Key_Escape = 0x01000000, > Key_Tab = 0x01000001, > Key_Backtab = 0x01000002, > Key_Backspace = 0x01000003, > Key_Return = 0x01000004, > Key_Enter = 0x01000005, > Key_Insert = 0x01000006, > Key_Delete = 0x01000007, > Key_Pause = 0x01000008, > Key_Print = 0x01000009, > Key_SysReq = 0x0100000a, > Key_Clear = 0x0100000b, > Key_Home = 0x01000010, > Key_End = 0x01000011, > Key_Left = 0x01000012, > Key_Up = 0x01000013, > Key_Right = 0x01000014, > Key_Down = 0x01000015, > Key_PageUp = 0x01000016, > Key_PageDown = 0x01000017, > Key_Shift = 0x01000020, > Key_Control = 0x01000021, > Key_Meta = 0x01000022, > Key_Alt = 0x01000023, > Key_CapsLock = 0x01000024, > Key_NumLock = 0x01000025, > Key_ScrollLock = 0x01000026, > Key_F1 = 0x01000030, > Key_F2 = 0x01000031, > Key_F3 = 0x01000032, > Key_F4 = 0x01000033, > Key_F5 = 0x01000034, > Key_F6 = 0x01000035, > Key_F7 = 0x01000036, > Key_F8 = 0x01000037, > Key_F9 = 0x01000038, > Key_F10 = 0x01000039, > Key_F11 = 0x0100003a, > Key_F12 = 0x0100003b, > Key_F13 = 0x0100003c, > Key_F14 = 0x0100003d, > Key_F15 = 0x0100003e, > Key_F16 = 0x0100003f, > Key_F17 = 0x01000040, > Key_F18 = 0x01000041, > Key_F19 = 0x01000042, > Key_F20 = 0x01000043, > Key_F21 = 0x01000044, > Key_F22 = 0x01000045, > Key_F23 = 0x01000046, > Key_F24 = 0x01000047, > Key_F25 = 0x01000048, > Key_F26 = 0x01000049, > Key_F27 = 0x0100004a, > Key_F28 = 0x0100004b, > Key_F29 = 0x0100004c, > Key_F30 = 0x0100004d, > Key_F31 = 0x0100004e, > Key_F32 = 0x0100004f, > Key_F33 = 0x01000050, > Key_F34 = 0x01000051, > Key_F35 = 0x01000052, > Key_Super_L = 0x01000053, > Key_Super_R = 0x01000054, > Key_Menu = 0x01000055, > Key_Hyper_L = 0x01000056, > Key_Hyper_R = 0x01000057, > Key_Help = 0x01000058, > Key_Direction_L = 0x01000059, > Key_Direction_R = 0x01000060, > Key_Space = 0x20, > Key_Any = Key_Space, > Key_Exclam = 0x21, > Key_QuoteDbl = 0x22, > Key_NumberSign = 0x23, > Key_Dollar = 0x24, > Key_Percent = 0x25, > Key_Ampersand = 0x26, > Key_Apostrophe = 0x27, > Key_ParenLeft = 0x28, > Key_ParenRight = 0x29, > Key_Asterisk = 0x2a, > Key_Plus = 0x2b, > Key_Comma = 0x2c, > Key_Minus = 0x2d, > Key_Period = 0x2e, > Key_Slash = 0x2f, > Key_0 = 0x30, > Key_1 = 0x31, > Key_2 = 0x32, > Key_3 = 0x33, > Key_4 = 0x34, > Key_5 = 0x35, > Key_6 = 0x36, > Key_7 = 0x37, > Key_8 = 0x38, > Key_9 = 0x39, > Key_Colon = 0x3a, > Key_Semicolon = 0x3b, > Key_Less = 0x3c, > Key_Equal = 0x3d, > Key_Greater = 0x3e, > Key_Question = 0x3f, > Key_At = 0x40, > Key_A = 0x41, > Key_B = 0x42, > Key_C = 0x43, > Key_D = 0x44, > Key_E = 0x45, > Key_F = 0x46, > Key_G = 0x47, > Key_H = 0x48, > Key_I = 0x49, > Key_J = 0x4a, > Key_K = 0x4b, > Key_L = 0x4c, > Key_M = 0x4d, > Key_N = 0x4e, > Key_O = 0x4f, > Key_P = 0x50, > Key_Q = 0x51, > Key_R = 0x52, > Key_S = 0x53, > Key_T = 0x54, > Key_U = 0x55, > Key_V = 0x56, > Key_W = 0x57, > Key_X = 0x58, > Key_Y = 0x59, > Key_Z = 0x5a, > Key_BracketLeft = 0x5b, > Key_Backslash = 0x5c, > Key_BracketRight = 0x5d, > Key_AsciiCircum = 0x5e, > Key_Underscore = 0x5f, > Key_QuoteLeft = 0x60, > Key_BraceLeft = 0x7b, > Key_Bar = 0x7c, > Key_BraceRight = 0x7d, > Key_AsciiTilde = 0x7e, > > Key_nobreakspace = 0x0a0, > Key_exclamdown = 0x0a1, > Key_cent = 0x0a2, > Key_sterling = 0x0a3, > Key_currency = 0x0a4, > Key_yen = 0x0a5, > Key_brokenbar = 0x0a6, > Key_section = 0x0a7, > Key_diaeresis = 0x0a8, > Key_copyright = 0x0a9, > Key_ordfeminine = 0x0aa, > Key_guillemotleft = 0x0ab, > Key_notsign = 0x0ac, > Key_hyphen = 0x0ad, > Key_registered = 0x0ae, > Key_macron = 0x0af, > Key_degree = 0x0b0, > Key_plusminus = 0x0b1, > Key_twosuperior = 0x0b2, > Key_threesuperior = 0x0b3, > Key_acute = 0x0b4, > Key_mu = 0x0b5, > Key_paragraph = 0x0b6, > Key_periodcentered = 0x0b7, > Key_cedilla = 0x0b8, > Key_onesuperior = 0x0b9, > Key_masculine = 0x0ba, > Key_guillemotright = 0x0bb, > Key_onequarter = 0x0bc, > Key_onehalf = 0x0bd, > Key_threequarters = 0x0be, > Key_questiondown = 0x0bf, > Key_Agrave = 0x0c0, > Key_Aacute = 0x0c1, > Key_Acircumflex = 0x0c2, > Key_Atilde = 0x0c3, > Key_Adiaeresis = 0x0c4, > Key_Aring = 0x0c5, > Key_AE = 0x0c6, > Key_Ccedilla = 0x0c7, > Key_Egrave = 0x0c8, > Key_Eacute = 0x0c9, > Key_Ecircumflex = 0x0ca, > Key_Ediaeresis = 0x0cb, > Key_Igrave = 0x0cc, > Key_Iacute = 0x0cd, > Key_Icircumflex = 0x0ce, > Key_Idiaeresis = 0x0cf, > Key_ETH = 0x0d0, > Key_Ntilde = 0x0d1, > Key_Ograve = 0x0d2, > Key_Oacute = 0x0d3, > Key_Ocircumflex = 0x0d4, > Key_Otilde = 0x0d5, > Key_Odiaeresis = 0x0d6, > Key_multiply = 0x0d7, > Key_Ooblique = 0x0d8, > Key_Ugrave = 0x0d9, > Key_Uacute = 0x0da, > Key_Ucircumflex = 0x0db, > Key_Udiaeresis = 0x0dc, > Key_Yacute = 0x0dd, > Key_THORN = 0x0de, > Key_ssharp = 0x0df, > Key_division = 0x0f7, > Key_ydiaeresis = 0x0ff, > > > > > > > Key_AltGr = 0x01001103, > Key_Multi_key = 0x01001120, > Key_Codeinput = 0x01001137, > Key_SingleCandidate = 0x0100113c, > Key_MultipleCandidate = 0x0100113d, > Key_PreviousCandidate = 0x0100113e, > > > Key_Mode_switch = 0x0100117e, > > > > Key_Kanji = 0x01001121, > Key_Muhenkan = 0x01001122, > > Key_Henkan = 0x01001123, > Key_Romaji = 0x01001124, > Key_Hiragana = 0x01001125, > Key_Katakana = 0x01001126, > Key_Hiragana_Katakana = 0x01001127, > Key_Zenkaku = 0x01001128, > Key_Hankaku = 0x01001129, > Key_Zenkaku_Hankaku = 0x0100112a, > Key_Touroku = 0x0100112b, > Key_Massyo = 0x0100112c, > Key_Kana_Lock = 0x0100112d, > Key_Kana_Shift = 0x0100112e, > Key_Eisu_Shift = 0x0100112f, > Key_Eisu_toggle = 0x01001130, ># 782 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qnamespace.h" > Key_Hangul = 0x01001131, > Key_Hangul_Start = 0x01001132, > Key_Hangul_End = 0x01001133, > Key_Hangul_Hanja = 0x01001134, > Key_Hangul_Jamo = 0x01001135, > Key_Hangul_Romaja = 0x01001136, > > Key_Hangul_Jeonja = 0x01001138, > Key_Hangul_Banja = 0x01001139, > Key_Hangul_PreHanja = 0x0100113a, > Key_Hangul_PostHanja = 0x0100113b, > > > > Key_Hangul_Special = 0x0100113f, > > > > Key_Dead_Grave = 0x01001250, > Key_Dead_Acute = 0x01001251, > Key_Dead_Circumflex = 0x01001252, > Key_Dead_Tilde = 0x01001253, > Key_Dead_Macron = 0x01001254, > Key_Dead_Breve = 0x01001255, > Key_Dead_Abovedot = 0x01001256, > Key_Dead_Diaeresis = 0x01001257, > Key_Dead_Abovering = 0x01001258, > Key_Dead_Doubleacute = 0x01001259, > Key_Dead_Caron = 0x0100125a, > Key_Dead_Cedilla = 0x0100125b, > Key_Dead_Ogonek = 0x0100125c, > Key_Dead_Iota = 0x0100125d, > Key_Dead_Voiced_Sound = 0x0100125e, > Key_Dead_Semivoiced_Sound = 0x0100125f, > Key_Dead_Belowdot = 0x01001260, > Key_Dead_Hook = 0x01001261, > Key_Dead_Horn = 0x01001262, > > > Key_Back = 0x01000061, > Key_Forward = 0x01000062, > Key_Stop = 0x01000063, > Key_Refresh = 0x01000064, > Key_VolumeDown = 0x01000070, > Key_VolumeMute = 0x01000071, > Key_VolumeUp = 0x01000072, > Key_BassBoost = 0x01000073, > Key_BassUp = 0x01000074, > Key_BassDown = 0x01000075, > Key_TrebleUp = 0x01000076, > Key_TrebleDown = 0x01000077, > Key_MediaPlay = 0x01000080, > Key_MediaStop = 0x01000081, > Key_MediaPrevious = 0x01000082, > Key_MediaNext = 0x01000083, > Key_MediaRecord = 0x01000084, > Key_MediaPause = 0x1000085, > Key_MediaTogglePlayPause = 0x1000086, > Key_HomePage = 0x01000090, > Key_Favorites = 0x01000091, > Key_Search = 0x01000092, > Key_Standby = 0x01000093, > Key_OpenUrl = 0x01000094, > Key_LaunchMail = 0x010000a0, > Key_LaunchMedia = 0x010000a1, > Key_Launch0 = 0x010000a2, > Key_Launch1 = 0x010000a3, > Key_Launch2 = 0x010000a4, > Key_Launch3 = 0x010000a5, > Key_Launch4 = 0x010000a6, > Key_Launch5 = 0x010000a7, > Key_Launch6 = 0x010000a8, > Key_Launch7 = 0x010000a9, > Key_Launch8 = 0x010000aa, > Key_Launch9 = 0x010000ab, > Key_LaunchA = 0x010000ac, > Key_LaunchB = 0x010000ad, > Key_LaunchC = 0x010000ae, > Key_LaunchD = 0x010000af, > Key_LaunchE = 0x010000b0, > Key_LaunchF = 0x010000b1, > Key_MonBrightnessUp = 0x010000b2, > Key_MonBrightnessDown = 0x010000b3, > Key_KeyboardLightOnOff = 0x010000b4, > Key_KeyboardBrightnessUp = 0x010000b5, > Key_KeyboardBrightnessDown = 0x010000b6, > Key_PowerOff = 0x010000b7, > Key_WakeUp = 0x010000b8, > Key_Eject = 0x010000b9, > Key_ScreenSaver = 0x010000ba, > Key_WWW = 0x010000bb, > Key_Memo = 0x010000bc, > Key_LightBulb = 0x010000bd, > Key_Shop = 0x010000be, > Key_History = 0x010000bf, > Key_AddFavorite = 0x010000c0, > Key_HotLinks = 0x010000c1, > Key_BrightnessAdjust = 0x010000c2, > Key_Finance = 0x010000c3, > Key_Community = 0x010000c4, > Key_AudioRewind = 0x010000c5, > Key_BackForward = 0x010000c6, > Key_ApplicationLeft = 0x010000c7, > Key_ApplicationRight = 0x010000c8, > Key_Book = 0x010000c9, > Key_CD = 0x010000ca, > Key_Calculator = 0x010000cb, > Key_ToDoList = 0x010000cc, > Key_ClearGrab = 0x010000cd, > Key_Close = 0x010000ce, > Key_Copy = 0x010000cf, > Key_Cut = 0x010000d0, > Key_Display = 0x010000d1, > Key_DOS = 0x010000d2, > Key_Documents = 0x010000d3, > Key_Excel = 0x010000d4, > Key_Explorer = 0x010000d5, > Key_Game = 0x010000d6, > Key_Go = 0x010000d7, > Key_iTouch = 0x010000d8, > Key_LogOff = 0x010000d9, > Key_Market = 0x010000da, > Key_Meeting = 0x010000db, > Key_MenuKB = 0x010000dc, > Key_MenuPB = 0x010000dd, > Key_MySites = 0x010000de, > Key_News = 0x010000df, > Key_OfficeHome = 0x010000e0, > Key_Option = 0x010000e1, > Key_Paste = 0x010000e2, > Key_Phone = 0x010000e3, > Key_Calendar = 0x010000e4, > Key_Reply = 0x010000e5, > Key_Reload = 0x010000e6, > Key_RotateWindows = 0x010000e7, > Key_RotationPB = 0x010000e8, > Key_RotationKB = 0x010000e9, > Key_Save = 0x010000ea, > Key_Send = 0x010000eb, > Key_Spell = 0x010000ec, > Key_SplitScreen = 0x010000ed, > Key_Support = 0x010000ee, > Key_TaskPane = 0x010000ef, > Key_Terminal = 0x010000f0, > Key_Tools = 0x010000f1, > Key_Travel = 0x010000f2, > Key_Video = 0x010000f3, > Key_Word = 0x010000f4, > Key_Xfer = 0x010000f5, > Key_ZoomIn = 0x010000f6, > Key_ZoomOut = 0x010000f7, > Key_Away = 0x010000f8, > Key_Messenger = 0x010000f9, > Key_WebCam = 0x010000fa, > Key_MailForward = 0x010000fb, > Key_Pictures = 0x010000fc, > Key_Music = 0x010000fd, > Key_Battery = 0x010000fe, > Key_Bluetooth = 0x010000ff, > Key_WLAN = 0x01000100, > Key_UWB = 0x01000101, > Key_AudioForward = 0x01000102, > Key_AudioRepeat = 0x01000103, > Key_AudioRandomPlay = 0x01000104, > Key_Subtitle = 0x01000105, > Key_AudioCycleTrack = 0x01000106, > Key_Time = 0x01000107, > Key_Hibernate = 0x01000108, > Key_View = 0x01000109, > Key_TopMenu = 0x0100010a, > Key_PowerDown = 0x0100010b, > Key_Suspend = 0x0100010c, > Key_ContrastAdjust = 0x0100010d, > > Key_LaunchG = 0x0100010e, > Key_LaunchH = 0x0100010f, > > Key_TouchpadToggle = 0x01000110, > Key_TouchpadOn = 0x01000111, > Key_TouchpadOff = 0x01000112, > > Key_MediaLast = 0x0100ffff, > > > Key_Select = 0x01010000, > Key_Yes = 0x01010001, > Key_No = 0x01010002, > > > Key_Cancel = 0x01020001, > Key_Printer = 0x01020002, > Key_Execute = 0x01020003, > Key_Sleep = 0x01020004, > Key_Play = 0x01020005, > Key_Zoom = 0x01020006, > > > > > > Key_Context1 = 0x01100000, > Key_Context2 = 0x01100001, > Key_Context3 = 0x01100002, > Key_Context4 = 0x01100003, > Key_Call = 0x01100004, > Key_Hangup = 0x01100005, > Key_Flip = 0x01100006, > Key_ToggleCallHangup = 0x01100007, > Key_VoiceDial = 0x01100008, > Key_LastNumberRedial = 0x01100009, > > Key_Camera = 0x01100020, > Key_CameraFocus = 0x01100021, > > Key_unknown = 0x01ffffff > }; > > enum ArrowType { > NoArrow, > UpArrow, > DownArrow, > LeftArrow, > RightArrow > }; > > enum PenStyle { > NoPen, > SolidLine, > DashLine, > DotLine, > DashDotLine, > DashDotDotLine, > CustomDashLine > > , MPenStyle = 0x0f > > }; > > enum PenCapStyle { > FlatCap = 0x00, > SquareCap = 0x10, > RoundCap = 0x20, > MPenCapStyle = 0x30 > }; > > enum PenJoinStyle { > MiterJoin = 0x00, > BevelJoin = 0x40, > RoundJoin = 0x80, > SvgMiterJoin = 0x100, > MPenJoinStyle = 0x1c0 > }; > > enum BrushStyle { > NoBrush, > SolidPattern, > Dense1Pattern, > Dense2Pattern, > Dense3Pattern, > Dense4Pattern, > Dense5Pattern, > Dense6Pattern, > Dense7Pattern, > HorPattern, > VerPattern, > CrossPattern, > BDiagPattern, > FDiagPattern, > DiagCrossPattern, > LinearGradientPattern, > RadialGradientPattern, > ConicalGradientPattern, > TexturePattern = 24 > }; > > enum SizeMode { > AbsoluteSize, > RelativeSize > }; > > enum UIEffect { > UI_General, > UI_AnimateMenu, > UI_FadeMenu, > UI_AnimateCombo, > UI_AnimateTooltip, > UI_FadeTooltip, > UI_AnimateToolBox > }; > > enum CursorShape { > ArrowCursor, > UpArrowCursor, > CrossCursor, > WaitCursor, > IBeamCursor, > SizeVerCursor, > SizeHorCursor, > SizeBDiagCursor, > SizeFDiagCursor, > SizeAllCursor, > BlankCursor, > SplitVCursor, > SplitHCursor, > PointingHandCursor, > ForbiddenCursor, > WhatsThisCursor, > BusyCursor, > OpenHandCursor, > ClosedHandCursor, > DragCopyCursor, > DragMoveCursor, > DragLinkCursor, > LastCursor = DragLinkCursor, > BitmapCursor = 24, > CustomCursor = 25 > }; > > enum TextFormat { > PlainText, > RichText, > AutoText > }; > > enum AspectRatioMode { > IgnoreAspectRatio, > KeepAspectRatio, > KeepAspectRatioByExpanding > }; > > enum DockWidgetArea { > LeftDockWidgetArea = 0x1, > RightDockWidgetArea = 0x2, > TopDockWidgetArea = 0x4, > BottomDockWidgetArea = 0x8, > > DockWidgetArea_Mask = 0xf, > AllDockWidgetAreas = DockWidgetArea_Mask, > NoDockWidgetArea = 0 > }; > enum DockWidgetAreaSizes { > NDockWidgetAreas = 4 > }; > > typedef QFlags<DockWidgetArea> DockWidgetAreas; > > enum ToolBarArea { > LeftToolBarArea = 0x1, > RightToolBarArea = 0x2, > TopToolBarArea = 0x4, > BottomToolBarArea = 0x8, > > ToolBarArea_Mask = 0xf, > AllToolBarAreas = ToolBarArea_Mask, > NoToolBarArea = 0 > }; > > enum ToolBarAreaSizes { > NToolBarAreas = 4 > }; > > typedef QFlags<ToolBarArea> ToolBarAreas; > > enum DateFormat { > TextDate, > ISODate, > SystemLocaleDate, > LocalDate = SystemLocaleDate, > LocaleDate, > SystemLocaleShortDate, > SystemLocaleLongDate, > DefaultLocaleShortDate, > DefaultLocaleLongDate > }; > > enum TimeSpec { > LocalTime, > UTC, > OffsetFromUTC > }; > > enum DayOfWeek { > Monday = 1, > Tuesday = 2, > Wednesday = 3, > Thursday = 4, > Friday = 5, > Saturday = 6, > Sunday = 7 > }; > > enum ScrollBarPolicy { > ScrollBarAsNeeded, > ScrollBarAlwaysOff, > ScrollBarAlwaysOn > }; > > enum CaseSensitivity { > CaseInsensitive, > CaseSensitive > }; > > enum Corner { > TopLeftCorner = 0x00000, > TopRightCorner = 0x00001, > BottomLeftCorner = 0x00002, > BottomRightCorner = 0x00003 > }; > > enum ConnectionType { > AutoConnection, > DirectConnection, > QueuedConnection, > BlockingQueuedConnection, > UniqueConnection = 0x80 > }; > > enum ShortcutContext { > WidgetShortcut, > WindowShortcut, > ApplicationShortcut, > WidgetWithChildrenShortcut > }; > > enum FillRule { > OddEvenFill, > WindingFill > }; > > enum MaskMode { > MaskInColor, > MaskOutColor > }; > > enum ClipOperation { > NoClip, > ReplaceClip, > IntersectClip > }; > > > enum ItemSelectionMode { > ContainsItemShape = 0x0, > IntersectsItemShape = 0x1, > ContainsItemBoundingRect = 0x2, > IntersectsItemBoundingRect = 0x3 > }; > > enum TransformationMode { > FastTransformation, > SmoothTransformation > }; > > enum Axis { > XAxis, > YAxis, > ZAxis > }; > > enum FocusReason { > MouseFocusReason, > TabFocusReason, > BacktabFocusReason, > ActiveWindowFocusReason, > PopupFocusReason, > ShortcutFocusReason, > MenuBarFocusReason, > OtherFocusReason, > NoFocusReason > }; > > enum ContextMenuPolicy { > NoContextMenu, > DefaultContextMenu, > ActionsContextMenu, > CustomContextMenu, > PreventContextMenu > }; > > enum InputMethodQuery { > ImEnabled = 0x1, > ImCursorRectangle = 0x2, > ImMicroFocus = 0x2, > ImFont = 0x4, > ImCursorPosition = 0x8, > ImSurroundingText = 0x10, > ImCurrentSelection = 0x20, > ImMaximumTextLength = 0x40, > ImAnchorPosition = 0x80, > ImHints = 0x100, > ImPreferredLanguage = 0x200, > > ImPlatformData = 0x80000000, > ImQueryInput = ImCursorRectangle | ImCursorPosition | ImSurroundingText | > ImCurrentSelection | ImAnchorPosition, > ImQueryAll = 0xffffffff > }; > typedef QFlags<InputMethodQuery> InputMethodQueries; > > enum InputMethodHint { > ImhNone = 0x0, > > ImhHiddenText = 0x1, > ImhSensitiveData = 0x2, > ImhNoAutoUppercase = 0x4, > ImhPreferNumbers = 0x8, > ImhPreferUppercase = 0x10, > ImhPreferLowercase = 0x20, > ImhNoPredictiveText = 0x40, > > ImhDate = 0x80, > ImhTime = 0x100, > > ImhPreferLatin = 0x200, > > ImhDigitsOnly = 0x10000, > ImhFormattedNumbersOnly = 0x20000, > ImhUppercaseOnly = 0x40000, > ImhLowercaseOnly = 0x80000, > ImhDialableCharactersOnly = 0x100000, > ImhEmailCharactersOnly = 0x200000, > ImhUrlCharactersOnly = 0x400000, > ImhLatinOnly = 0x800000, > > ImhExclusiveInputMask = 0xffff0000 > }; > typedef QFlags<InputMethodHint> InputMethodHints; > > enum ToolButtonStyle { > ToolButtonIconOnly, > ToolButtonTextOnly, > ToolButtonTextBesideIcon, > ToolButtonTextUnderIcon, > ToolButtonFollowStyle > }; > > enum LayoutDirection { > LeftToRight, > RightToLeft, > LayoutDirectionAuto > }; > > enum AnchorPoint { > AnchorLeft = 0, > AnchorHorizontalCenter, > AnchorRight, > AnchorTop, > AnchorVerticalCenter, > AnchorBottom > }; > > enum FindChildOption { > FindDirectChildrenOnly = 0x0, > FindChildrenRecursively = 0x1 > }; > typedef QFlags<FindChildOption> FindChildOptions; > > enum DropAction { > CopyAction = 0x1, > MoveAction = 0x2, > LinkAction = 0x4, > ActionMask = 0xff, > TargetMoveAction = 0x8002, > IgnoreAction = 0x0 > }; > typedef QFlags<DropAction> DropActions; > > enum CheckState { > Unchecked, > PartiallyChecked, > Checked > }; > > enum ItemDataRole { > DisplayRole = 0, > DecorationRole = 1, > EditRole = 2, > ToolTipRole = 3, > StatusTipRole = 4, > WhatsThisRole = 5, > > FontRole = 6, > TextAlignmentRole = 7, > BackgroundColorRole = 8, > BackgroundRole = 8, > TextColorRole = 9, > ForegroundRole = 9, > CheckStateRole = 10, > > AccessibleTextRole = 11, > AccessibleDescriptionRole = 12, > > SizeHintRole = 13, > InitialSortOrderRole = 14, > > DisplayPropertyRole = 27, > DecorationPropertyRole = 28, > ToolTipPropertyRole = 29, > StatusTipPropertyRole = 30, > WhatsThisPropertyRole = 31, > > UserRole = 0x0100 > }; > > enum ItemFlag { > NoItemFlags = 0, > ItemIsSelectable = 1, > ItemIsEditable = 2, > ItemIsDragEnabled = 4, > ItemIsDropEnabled = 8, > ItemIsUserCheckable = 16, > ItemIsEnabled = 32, > ItemIsTristate = 64 > }; > typedef QFlags<ItemFlag> ItemFlags; > > enum MatchFlag { > MatchExactly = 0, > MatchContains = 1, > MatchStartsWith = 2, > MatchEndsWith = 3, > MatchRegExp = 4, > MatchWildcard = 5, > MatchFixedString = 8, > MatchCaseSensitive = 16, > MatchWrap = 32, > MatchRecursive = 64 > }; > typedef QFlags<MatchFlag> MatchFlags; > > typedef void * HANDLE; > typedef WindowFlags WFlags; > > enum WindowModality { > NonModal, > WindowModal, > ApplicationModal > }; > > enum TextInteractionFlag { > NoTextInteraction = 0, > TextSelectableByMouse = 1, > TextSelectableByKeyboard = 2, > LinksAccessibleByMouse = 4, > LinksAccessibleByKeyboard = 8, > TextEditable = 16, > > TextEditorInteraction = TextSelectableByMouse | TextSelectableByKeyboard | TextEditable, > TextBrowserInteraction = TextSelectableByMouse | LinksAccessibleByMouse | LinksAccessibleByKeyboard > }; > typedef QFlags<TextInteractionFlag> TextInteractionFlags; > > enum EventPriority { > HighEventPriority = 1, > NormalEventPriority = 0, > LowEventPriority = -1 > }; > > enum SizeHint { > MinimumSize, > PreferredSize, > MaximumSize, > MinimumDescent, > NSizeHints > }; > > enum WindowFrameSection { > NoSection, > LeftSection, > TopLeftSection, > TopSection, > TopRightSection, > RightSection, > BottomRightSection, > BottomSection, > BottomLeftSection, > TitleBarArea > }; > > enum Initialization { > Uninitialized > }; > > enum CoordinateSystem { > DeviceCoordinates, > LogicalCoordinates > }; > > enum TouchPointState { > TouchPointPressed = 0x01, > TouchPointMoved = 0x02, > TouchPointStationary = 0x04, > TouchPointReleased = 0x08 > }; > typedef QFlags<TouchPointState> TouchPointStates; > > > enum GestureState > { > NoGesture, > GestureStarted = 1, > GestureUpdated = 2, > GestureFinished = 3, > GestureCanceled = 4 > }; > > enum GestureType > { > TapGesture = 1, > TapAndHoldGesture = 2, > PanGesture = 3, > PinchGesture = 4, > SwipeGesture = 5, > > CustomGesture = 0x0100, > > LastGestureType = ~0u > }; > > enum GestureFlag > { > DontStartGestureOnChildren = 0x01, > ReceivePartialGestures = 0x02, > IgnoredGesturesPropagateToParent = 0x04 > }; > typedef QFlags<GestureFlag> GestureFlags; > > > enum NavigationMode > { > NavigationModeNone, > NavigationModeKeypadTabOrder, > NavigationModeKeypadDirectional, > NavigationModeCursorAuto, > NavigationModeCursorForceVisible > }; > > enum CursorMoveStyle { > LogicalMoveStyle, > VisualMoveStyle > }; > > enum TimerType { > PreciseTimer, > CoarseTimer, > VeryCoarseTimer > }; >} > > > > > inline QFlags<Qt::MouseButtons::enum_type> operator|(Qt::MouseButtons::enum_type f1, Qt::MouseButtons::enum_type f2) { return QFlags<Qt::MouseButtons::enum_type>(f1) | f2; } inline QFlags<Qt::MouseButtons::enum_type> operator|(Qt::MouseButtons::enum_type f1, QFlags<Qt::MouseButtons::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::MouseButtons::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::Orientations::enum_type> operator|(Qt::Orientations::enum_type f1, Qt::Orientations::enum_type f2) { return QFlags<Qt::Orientations::enum_type>(f1) | f2; } inline QFlags<Qt::Orientations::enum_type> operator|(Qt::Orientations::enum_type f1, QFlags<Qt::Orientations::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::Orientations::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::KeyboardModifiers::enum_type> operator|(Qt::KeyboardModifiers::enum_type f1, Qt::KeyboardModifiers::enum_type f2) { return QFlags<Qt::KeyboardModifiers::enum_type>(f1) | f2; } inline QFlags<Qt::KeyboardModifiers::enum_type> operator|(Qt::KeyboardModifiers::enum_type f1, QFlags<Qt::KeyboardModifiers::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::KeyboardModifiers::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::WindowFlags::enum_type> operator|(Qt::WindowFlags::enum_type f1, Qt::WindowFlags::enum_type f2) { return QFlags<Qt::WindowFlags::enum_type>(f1) | f2; } inline QFlags<Qt::WindowFlags::enum_type> operator|(Qt::WindowFlags::enum_type f1, QFlags<Qt::WindowFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::WindowFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::Alignment::enum_type> operator|(Qt::Alignment::enum_type f1, Qt::Alignment::enum_type f2) { return QFlags<Qt::Alignment::enum_type>(f1) | f2; } inline QFlags<Qt::Alignment::enum_type> operator|(Qt::Alignment::enum_type f1, QFlags<Qt::Alignment::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::Alignment::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::ImageConversionFlags::enum_type> operator|(Qt::ImageConversionFlags::enum_type f1, Qt::ImageConversionFlags::enum_type f2) { return QFlags<Qt::ImageConversionFlags::enum_type>(f1) | f2; } inline QFlags<Qt::ImageConversionFlags::enum_type> operator|(Qt::ImageConversionFlags::enum_type f1, QFlags<Qt::ImageConversionFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::ImageConversionFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::DockWidgetAreas::enum_type> operator|(Qt::DockWidgetAreas::enum_type f1, Qt::DockWidgetAreas::enum_type f2) { return QFlags<Qt::DockWidgetAreas::enum_type>(f1) | f2; } inline QFlags<Qt::DockWidgetAreas::enum_type> operator|(Qt::DockWidgetAreas::enum_type f1, QFlags<Qt::DockWidgetAreas::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::DockWidgetAreas::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::ToolBarAreas::enum_type> operator|(Qt::ToolBarAreas::enum_type f1, Qt::ToolBarAreas::enum_type f2) { return QFlags<Qt::ToolBarAreas::enum_type>(f1) | f2; } inline QFlags<Qt::ToolBarAreas::enum_type> operator|(Qt::ToolBarAreas::enum_type f1, QFlags<Qt::ToolBarAreas::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::ToolBarAreas::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::WindowStates::enum_type> operator|(Qt::WindowStates::enum_type f1, Qt::WindowStates::enum_type f2) { return QFlags<Qt::WindowStates::enum_type>(f1) | f2; } inline QFlags<Qt::WindowStates::enum_type> operator|(Qt::WindowStates::enum_type f1, QFlags<Qt::WindowStates::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::WindowStates::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::ScreenOrientations::enum_type> operator|(Qt::ScreenOrientations::enum_type f1, Qt::ScreenOrientations::enum_type f2) { return QFlags<Qt::ScreenOrientations::enum_type>(f1) | f2; } inline QFlags<Qt::ScreenOrientations::enum_type> operator|(Qt::ScreenOrientations::enum_type f1, QFlags<Qt::ScreenOrientations::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::ScreenOrientations::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::DropActions::enum_type> operator|(Qt::DropActions::enum_type f1, Qt::DropActions::enum_type f2) { return QFlags<Qt::DropActions::enum_type>(f1) | f2; } inline QFlags<Qt::DropActions::enum_type> operator|(Qt::DropActions::enum_type f1, QFlags<Qt::DropActions::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::DropActions::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::ItemFlags::enum_type> operator|(Qt::ItemFlags::enum_type f1, Qt::ItemFlags::enum_type f2) { return QFlags<Qt::ItemFlags::enum_type>(f1) | f2; } inline QFlags<Qt::ItemFlags::enum_type> operator|(Qt::ItemFlags::enum_type f1, QFlags<Qt::ItemFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::ItemFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::MatchFlags::enum_type> operator|(Qt::MatchFlags::enum_type f1, Qt::MatchFlags::enum_type f2) { return QFlags<Qt::MatchFlags::enum_type>(f1) | f2; } inline QFlags<Qt::MatchFlags::enum_type> operator|(Qt::MatchFlags::enum_type f1, QFlags<Qt::MatchFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::MatchFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::TextInteractionFlags::enum_type> operator|(Qt::TextInteractionFlags::enum_type f1, Qt::TextInteractionFlags::enum_type f2) { return QFlags<Qt::TextInteractionFlags::enum_type>(f1) | f2; } inline QFlags<Qt::TextInteractionFlags::enum_type> operator|(Qt::TextInteractionFlags::enum_type f1, QFlags<Qt::TextInteractionFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::TextInteractionFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::InputMethodQueries::enum_type> operator|(Qt::InputMethodQueries::enum_type f1, Qt::InputMethodQueries::enum_type f2) { return QFlags<Qt::InputMethodQueries::enum_type>(f1) | f2; } inline QFlags<Qt::InputMethodQueries::enum_type> operator|(Qt::InputMethodQueries::enum_type f1, QFlags<Qt::InputMethodQueries::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::InputMethodQueries::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::InputMethodHints::enum_type> operator|(Qt::InputMethodHints::enum_type f1, Qt::InputMethodHints::enum_type f2) { return QFlags<Qt::InputMethodHints::enum_type>(f1) | f2; } inline QFlags<Qt::InputMethodHints::enum_type> operator|(Qt::InputMethodHints::enum_type f1, QFlags<Qt::InputMethodHints::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::InputMethodHints::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > inline QFlags<Qt::TouchPointStates::enum_type> operator|(Qt::TouchPointStates::enum_type f1, Qt::TouchPointStates::enum_type f2) { return QFlags<Qt::TouchPointStates::enum_type>(f1) | f2; } inline QFlags<Qt::TouchPointStates::enum_type> operator|(Qt::TouchPointStates::enum_type f1, QFlags<Qt::TouchPointStates::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::TouchPointStates::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > > inline QFlags<Qt::GestureFlags::enum_type> operator|(Qt::GestureFlags::enum_type f1, Qt::GestureFlags::enum_type f2) { return QFlags<Qt::GestureFlags::enum_type>(f1) | f2; } inline QFlags<Qt::GestureFlags::enum_type> operator|(Qt::GestureFlags::enum_type f1, QFlags<Qt::GestureFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(Qt::GestureFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > > >typedef bool (*qInternalCallback)(void **); > >class __attribute__((visibility("default"))) QInternal { >public: > enum PaintDeviceFlags { > UnknownDevice = 0x00, > Widget = 0x01, > Pixmap = 0x02, > Image = 0x03, > Printer = 0x04, > Picture = 0x05, > Pbuffer = 0x06, > FramebufferObject = 0x07, > CustomRaster = 0x08, > MacQuartz = 0x09, > PaintBuffer = 0x0a, > OpenGL = 0x0b > }; > enum RelayoutType { > RelayoutNormal, > RelayoutDragging, > RelayoutDropped > }; > > enum DockPosition { > LeftDock, > RightDock, > TopDock, > BottomDock, > DockCount > }; > > enum Callback { > EventNotifyCallback, > LastCallback > }; > static bool registerCallback(Callback, qInternalCallback); > static bool unregisterCallback(Callback, qInternalCallback); > static bool activateCallbacks(Callback, void **); >}; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qnamespace.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qarraydata.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qrefcount.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" 2 ># 1 "/usr/include/string.h" 1 3 4 ># 29 "/usr/include/string.h" 3 4 >extern "C" { > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 35 "/usr/include/string.h" 2 3 4 > > > > > > > > > >extern void *memcpy (void *__restrict __dest, > __const void *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern void *memmove (void *__dest, __const void *__src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > > > >extern void *memccpy (void *__restrict __dest, __const void *__restrict __src, > int __c, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > > >extern void *memset (void *__s, int __c, size_t __n) throw () __attribute__ ((__nonnull__ (1))); > > >extern int memcmp (__const void *__s1, __const void *__s2, size_t __n) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > > >extern "C++" >{ >extern void *memchr (void *__s, int __c, size_t __n) > throw () __asm ("memchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern __const void *memchr (__const void *__s, int __c, size_t __n) > throw () __asm ("memchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void * >memchr (void *__s, int __c, size_t __n) throw () >{ > return __builtin_memchr (__s, __c, __n); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const void * >memchr (__const void *__s, int __c, size_t __n) throw () >{ > return __builtin_memchr (__s, __c, __n); >} > >} > > > > > > > > > > >extern "C++" void *rawmemchr (void *__s, int __c) > throw () __asm ("rawmemchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern "C++" __const void *rawmemchr (__const void *__s, int __c) > throw () __asm ("rawmemchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > > > > > > >extern "C++" void *memrchr (void *__s, int __c, size_t __n) > throw () __asm ("memrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern "C++" __const void *memrchr (__const void *__s, int __c, size_t __n) > throw () __asm ("memrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > > > > > > > > >extern char *strcpy (char *__restrict __dest, __const char *__restrict __src) > throw () __attribute__ ((__nonnull__ (1, 2))); > >extern char *strncpy (char *__restrict __dest, > __const char *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern char *strcat (char *__restrict __dest, __const char *__restrict __src) > throw () __attribute__ ((__nonnull__ (1, 2))); > >extern char *strncat (char *__restrict __dest, __const char *__restrict __src, > size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int strcmp (__const char *__s1, __const char *__s2) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > >extern int strncmp (__const char *__s1, __const char *__s2, size_t __n) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern int strcoll (__const char *__s1, __const char *__s2) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > >extern size_t strxfrm (char *__restrict __dest, > __const char *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (2))); > ># 165 "/usr/include/string.h" 3 4 >extern int strcoll_l (__const char *__s1, __const char *__s2, __locale_t __l) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3))); > >extern size_t strxfrm_l (char *__dest, __const char *__src, size_t __n, > __locale_t __l) throw () __attribute__ ((__nonnull__ (2, 4))); > > > > > >extern char *strdup (__const char *__s) > throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1))); > > > > > > >extern char *strndup (__const char *__string, size_t __n) > throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1))); ># 210 "/usr/include/string.h" 3 4 > > > >extern "C++" >{ >extern char *strchr (char *__s, int __c) > throw () __asm ("strchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern __const char *strchr (__const char *__s, int __c) > throw () __asm ("strchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char * >strchr (char *__s, int __c) throw () >{ > return __builtin_strchr (__s, __c); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char * >strchr (__const char *__s, int __c) throw () >{ > return __builtin_strchr (__s, __c); >} > >} > > > > > > >extern "C++" >{ >extern char *strrchr (char *__s, int __c) > throw () __asm ("strrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern __const char *strrchr (__const char *__s, int __c) > throw () __asm ("strrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char * >strrchr (char *__s, int __c) throw () >{ > return __builtin_strrchr (__s, __c); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char * >strrchr (__const char *__s, int __c) throw () >{ > return __builtin_strrchr (__s, __c); >} > >} > > > > > > > > > > >extern "C++" char *strchrnul (char *__s, int __c) > throw () __asm ("strchrnul") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern "C++" __const char *strchrnul (__const char *__s, int __c) > throw () __asm ("strchrnul") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > > > > > > > > >extern size_t strcspn (__const char *__s, __const char *__reject) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern size_t strspn (__const char *__s, __const char *__accept) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern "C++" >{ >extern char *strpbrk (char *__s, __const char *__accept) > throw () __asm ("strpbrk") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); >extern __const char *strpbrk (__const char *__s, __const char *__accept) > throw () __asm ("strpbrk") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char * >strpbrk (char *__s, __const char *__accept) throw () >{ > return __builtin_strpbrk (__s, __accept); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char * >strpbrk (__const char *__s, __const char *__accept) throw () >{ > return __builtin_strpbrk (__s, __accept); >} > >} > > > > > > >extern "C++" >{ >extern char *strstr (char *__haystack, __const char *__needle) > throw () __asm ("strstr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); >extern __const char *strstr (__const char *__haystack, > __const char *__needle) > throw () __asm ("strstr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char * >strstr (char *__haystack, __const char *__needle) throw () >{ > return __builtin_strstr (__haystack, __needle); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char * >strstr (__const char *__haystack, __const char *__needle) throw () >{ > return __builtin_strstr (__haystack, __needle); >} > >} > > > > > > > >extern char *strtok (char *__restrict __s, __const char *__restrict __delim) > throw () __attribute__ ((__nonnull__ (2))); > > > > >extern char *__strtok_r (char *__restrict __s, > __const char *__restrict __delim, > char **__restrict __save_ptr) > throw () __attribute__ ((__nonnull__ (2, 3))); > >extern char *strtok_r (char *__restrict __s, __const char *__restrict __delim, > char **__restrict __save_ptr) > throw () __attribute__ ((__nonnull__ (2, 3))); > > > > > >extern "C++" char *strcasestr (char *__haystack, __const char *__needle) > throw () __asm ("strcasestr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); >extern "C++" __const char *strcasestr (__const char *__haystack, > __const char *__needle) > throw () __asm ("strcasestr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); ># 382 "/usr/include/string.h" 3 4 >extern void *memmem (__const void *__haystack, size_t __haystacklen, > __const void *__needle, size_t __needlelen) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 3))); > > > >extern void *__mempcpy (void *__restrict __dest, > __const void *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); >extern void *mempcpy (void *__restrict __dest, > __const void *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > > >extern size_t strlen (__const char *__s) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > > > > >extern size_t strnlen (__const char *__string, size_t __maxlen) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > > > > >extern char *strerror (int __errnum) throw (); > ># 438 "/usr/include/string.h" 3 4 >extern char *strerror_r (int __errnum, char *__buf, size_t __buflen) > throw () __attribute__ ((__nonnull__ (2))); > > > > > >extern char *strerror_l (int __errnum, __locale_t __l) throw (); > > > > > >extern void __bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1))); > > > >extern void bcopy (__const void *__src, void *__dest, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern void bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1))); > > >extern int bcmp (__const void *__s1, __const void *__s2, size_t __n) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > > >extern "C++" >{ >extern char *index (char *__s, int __c) > throw () __asm ("index") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern __const char *index (__const char *__s, int __c) > throw () __asm ("index") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char * >index (char *__s, int __c) throw () >{ > return __builtin_index (__s, __c); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char * >index (__const char *__s, int __c) throw () >{ > return __builtin_index (__s, __c); >} > >} > > > > > > > >extern "C++" >{ >extern char *rindex (char *__s, int __c) > throw () __asm ("rindex") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); >extern __const char *rindex (__const char *__s, int __c) > throw () __asm ("rindex") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); > > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char * >rindex (char *__s, int __c) throw () >{ > return __builtin_rindex (__s, __c); >} > >extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char * >rindex (__const char *__s, int __c) throw () >{ > return __builtin_rindex (__s, __c); >} > >} > > > > > > > >extern int ffs (int __i) throw () __attribute__ ((__const__)); > > > > >extern int ffsl (long int __l) throw () __attribute__ ((__const__)); > >__extension__ extern int ffsll (long long int __ll) > throw () __attribute__ ((__const__)); > > > > >extern int strcasecmp (__const char *__s1, __const char *__s2) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern int strncasecmp (__const char *__s1, __const char *__s2, size_t __n) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > > > > >extern int strcasecmp_l (__const char *__s1, __const char *__s2, > __locale_t __loc) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3))); > >extern int strncasecmp_l (__const char *__s1, __const char *__s2, > size_t __n, __locale_t __loc) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 4))); > > > > > >extern char *strsep (char **__restrict __stringp, > __const char *__restrict __delim) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > >extern char *strsignal (int __sig) throw (); > > >extern char *__stpcpy (char *__restrict __dest, __const char *__restrict __src) > throw () __attribute__ ((__nonnull__ (1, 2))); >extern char *stpcpy (char *__restrict __dest, __const char *__restrict __src) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern char *__stpncpy (char *__restrict __dest, > __const char *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); >extern char *stpncpy (char *__restrict __dest, > __const char *__restrict __src, size_t __n) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > >extern int strverscmp (__const char *__s1, __const char *__s2) > throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); > > >extern char *strfry (char *__string) throw () __attribute__ ((__nonnull__ (1))); > > >extern void *memfrob (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1))); > > > > > > > >extern "C++" char *basename (char *__filename) > throw () __asm ("basename") __attribute__ ((__nonnull__ (1))); >extern "C++" __const char *basename (__const char *__filename) > throw () __asm ("basename") __attribute__ ((__nonnull__ (1))); ># 646 "/usr/include/string.h" 3 4 >} ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" 2 > > > > > >struct QArrayAllocatedData; >struct QArrayForeignData; >struct __attribute__((visibility("default"))) QArrayData >{ > enum ArrayType { > RawDataType = 0x00, > AllocatedDataType = 0x01, > ForeignDataType = 0x02 > }; > > enum ArrayOption { > DataTypeBits = 0x0007, > Unsharable = 0x0010, > CapacityReserved = 0x0020, > GrowsForward = 0x0040, > GrowsBackwards = 0x0080, > > > StaticDataFlags = RawDataType, > > DefaultAllocationFlags = 0, > > DefaultRawFlags = 0 > }; > typedef QFlags<ArrayOption> ArrayOptions; > > QtPrivate::RefCount ref; > uint flags; > int size; > > qptrdiff offset; > > > ArrayType type() const > { > return ArrayType(flags & DataTypeBits); > } > > inline QArrayAllocatedData *asAllocatedData(); > inline const QArrayAllocatedData *asAllocatedData() const; > inline QArrayForeignData *asForeignData(); > inline const QArrayForeignData *asForeignData() const; > inline int capacity() const; > > void *data() > { > ((!(size == 0 || offset < 0 || size_t(offset) >= sizeof(QArrayData))) ? qt_assert("size == 0 || offset < 0 || size_t(offset) >= sizeof(QArrayData)", > "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" ># 98 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" > , > 99 ># 98 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" > ) : qt_noop()) > ; > return reinterpret_cast<char *>(this) + offset; > } > > const void *data() const > { > ((!(size == 0 || offset < 0 || size_t(offset) >= sizeof(QArrayData))) ? qt_assert("size == 0 || offset < 0 || size_t(offset) >= sizeof(QArrayData)", > "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" ># 105 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" > , > 106 ># 105 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" > ) : qt_noop()) > ; > return reinterpret_cast<const char *>(this) + offset; > } > > > > > bool isMutable() const > { > return type() == AllocatedDataType; > } > > inline size_t detachCapacity(size_t newSize) const; > > ArrayOptions detachFlags() const > { > ArrayOptions result = DefaultAllocationFlags; > if (!ref.isSharable()) > result |= Unsharable; > if (flags & CapacityReserved) > result |= CapacityReserved; > return result; > } > > ArrayOptions cloneFlags() const > { > ArrayOptions result = DefaultAllocationFlags; > if (flags & CapacityReserved) > result |= CapacityReserved; > return result; > } > > static QArrayData *allocate(size_t objectSize, size_t alignment, > size_t capacity, ArrayOptions options = DefaultAllocationFlags) > __attribute__ ((__warn_unused_result__)); > static QArrayData *reallocateUnaligned(QArrayData *data, size_t objectSize, > size_t newCapacity, ArrayOptions newOptions = DefaultAllocationFlags) > __attribute__ ((__warn_unused_result__)); > static QArrayData *prepareRawData(ArrayOptions options = ArrayOptions(RawDataType)) > __attribute__ ((__warn_unused_result__)); > static QArrayData *prepareForeignData(ArrayOptions options = ArrayOptions(ForeignDataType)) > __attribute__ ((__warn_unused_result__)); > static void deallocate(QArrayData *data, size_t objectSize, > size_t alignment); > > static const QArrayData shared_null[2]; > static QArrayData *sharedNull() { return const_cast<QArrayData*>(shared_null); } >}; > >struct QArrayAllocatedData : public QArrayData >{ > uint alloc; > > >}; > >struct QArrayForeignData : public QArrayData >{ > void *token; > void (*notifyFunction)(void *); > >}; > > inline QFlags<QArrayData::ArrayOptions::enum_type> operator|(QArrayData::ArrayOptions::enum_type f1, QArrayData::ArrayOptions::enum_type f2) { return QFlags<QArrayData::ArrayOptions::enum_type>(f1) | f2; } inline QFlags<QArrayData::ArrayOptions::enum_type> operator|(QArrayData::ArrayOptions::enum_type f1, QFlags<QArrayData::ArrayOptions::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(QArrayData::ArrayOptions::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > >inline size_t QArrayData::detachCapacity(size_t newSize) const >{ > if (type() == AllocatedDataType && (flags & CapacityReserved) && newSize < asAllocatedData()->alloc) > return asAllocatedData()->alloc; > return newSize; >} > >inline QArrayAllocatedData *QArrayData::asAllocatedData() >{ > ((!(type() == AllocatedDataType)) ? qt_assert("type() == AllocatedDataType","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h",180) : qt_noop()); > return static_cast<QArrayAllocatedData *>(this); >} > >inline const QArrayAllocatedData *QArrayData::asAllocatedData() const >{ > ((!(type() == AllocatedDataType)) ? qt_assert("type() == AllocatedDataType","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h",186) : qt_noop()); > return static_cast<const QArrayAllocatedData *>(this); >} > >inline QArrayForeignData *QArrayData::asForeignData() >{ > ((!(type() == ForeignDataType)) ? qt_assert("type() == ForeignDataType","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h",192) : qt_noop()); > return static_cast<QArrayForeignData *>(this); >} > >inline const QArrayForeignData *QArrayData::asForeignData() const >{ > ((!(type() == ForeignDataType)) ? qt_assert("type() == ForeignDataType","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h",198) : qt_noop()); > return static_cast<const QArrayForeignData *>(this); >} > >inline int QArrayData::capacity() const >{ > return type() == QArrayData::AllocatedDataType ? asAllocatedData()->alloc : 0; >} > >template <class T> >struct QTypedArrayData > : QArrayData >{ ># 281 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" > typedef T* iterator; > typedef const T* const_iterator; > > > T *data() { return static_cast<T *>(QArrayData::data()); } > const T *data() const { return static_cast<const T *>(QArrayData::data()); } > > iterator begin() { return data(); } > iterator end() { return data() + size; } > const_iterator begin() const { return data(); } > const_iterator end() const { return data() + size; } > const_iterator constBegin() const { return data(); } > const_iterator constEnd() const { return data() + size; } > > class AlignmentDummy { QArrayData header; T data; }; > > static QTypedArrayData *allocate(size_t capacity, > ArrayOptions options = DefaultAllocationFlags) __attribute__ ((__warn_unused_result__)) > { > enum {q_static_assert_result300 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > return static_cast<QTypedArrayData *>(QArrayData::allocate(sizeof(T), > __alignof__(AlignmentDummy), capacity, options)); > } > > static QTypedArrayData *reallocateUnaligned(QTypedArrayData *data, size_t capacity, > ArrayOptions options = DefaultAllocationFlags) __attribute__ ((__warn_unused_result__)) > { > enum {q_static_assert_result308 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > enum {q_static_assert_result309 = sizeof(QStaticAssertFailure<!!(__alignof__(AlignmentDummy) <= __alignof__(QTypedArrayData))>)}; > return static_cast<QTypedArrayData *>(QArrayData::reallocateUnaligned(data, sizeof(T), > capacity, options)); > } > > static void deallocate(QArrayData *data) > { > enum {q_static_assert_result316 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > QArrayData::deallocate(data, sizeof(T), __alignof__(AlignmentDummy)); > } > > static QTypedArrayData *fromRawData(const T *data, size_t n, > ArrayOptions options = DefaultRawFlags) > { > enum {q_static_assert_result323 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > QTypedArrayData *result = static_cast<QTypedArrayData *>(prepareRawData(options)); > if (result) { > ((!(!result->ref.isShared())) ? qt_assert("!result->ref.isShared()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h",326) : qt_noop()); > > result->offset = reinterpret_cast<const char *>(data) > - reinterpret_cast<const char *>(result); > result->size = int(n); > } > return result; > } > > static QTypedArrayData *sharedNull() > { > enum {q_static_assert_result337 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > return static_cast<QTypedArrayData *>(QArrayData::sharedNull()); > } > > static QTypedArrayData *sharedEmpty() > { > enum {q_static_assert_result343 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > return allocate( 0); > } > > static QTypedArrayData *unsharableEmpty() > { > enum {q_static_assert_result349 = sizeof(QStaticAssertFailure<!!(sizeof(QTypedArrayData) == sizeof(QArrayData))>)}; > return allocate( 0, Unsharable); > } >}; > >template <class T, size_t N> >struct QStaticArrayData >{ > > QArrayData header; > T data[N]; >}; > > >template <class T> >struct QArrayDataPointerRef >{ > QTypedArrayData<T> *ptr; >}; ># 436 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qarraydata.h" >namespace QtPrivate { > template <class T, size_t N> > inline QArrayDataPointerRef<T> qMakeArrayLiteral(const T (&array)[N]) > { > union { T type_must_be_POD; } dummy; (void)dummy; > > QArrayDataPointerRef<T> result = { QTypedArrayData<T>::allocate(N) }; > do { if (!(result.ptr)) qBadAlloc(); } while (0); > > ::memcpy(result.ptr->data(), array, N * sizeof(T)); > result.ptr->size = N; > > return result; > } >} > > > > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qarraydata.h" 2 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" 2 > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stdarg.h" 1 3 4 ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stdarg.h" 3 4 >typedef __builtin_va_list __gnuc_va_list; ># 102 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stdarg.h" 3 4 >typedef __gnuc_va_list va_list; ># 52 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" 2 ># 69 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" > > > > > > > > > >__attribute__((visibility("default"))) char *qstrdup(const char *); > >inline uint qstrlen(const char *str) >{ return str ? uint(strlen(str)) : 0; } > >inline uint qstrnlen(const char *str, uint maxlen) >{ > uint length = 0; > if (str) { > while (length < maxlen && *str++) > length++; > } > return length; >} > >__attribute__((visibility("default"))) char *qstrcpy(char *dst, const char *src); >__attribute__((visibility("default"))) char *qstrncpy(char *dst, const char *src, uint len); > >__attribute__((visibility("default"))) int qstrcmp(const char *str1, const char *str2); >__attribute__((visibility("default"))) int qstrcmp(const QByteArray &str1, const QByteArray &str2); >__attribute__((visibility("default"))) int qstrcmp(const QByteArray &str1, const char *str2); >static inline int qstrcmp(const char *str1, const QByteArray &str2) >{ return -qstrcmp(str2, str1); } > >inline int qstrncmp(const char *str1, const char *str2, uint len) >{ > return (str1 && str2) ? strncmp(str1, str2, len) > : (str1 ? 1 : (str2 ? -1 : 0)); >} >__attribute__((visibility("default"))) int qstricmp(const char *, const char *); >__attribute__((visibility("default"))) int qstrnicmp(const char *, const char *, uint len); > > >__attribute__((visibility("default"))) int qvsnprintf(char *str, size_t n, const char *fmt, va_list ap); >__attribute__((visibility("default"))) int qsnprintf(char *str, size_t n, const char *fmt, ...); > > > >__attribute__((visibility("default"))) quint16 qChecksum(const char *s, uint len); > >class QByteRef; >class QString; >class QDataStream; >template <typename T> class QList; > >typedef QArrayData QByteArrayData; > >template<int N> struct QStaticByteArrayData >{ > QByteArrayData ba; > char data[N + 1]; > > QByteArrayData *data_ptr() const > { > ((!(ba.ref.isStatic())) ? qt_assert("ba.ref.isStatic()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h",132) : qt_noop()); > return const_cast<QByteArrayData *>(&ba); > } >}; > >struct QByteArrayDataPtr >{ > QByteArrayData *ptr; >}; ># 188 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" >class __attribute__((visibility("default"))) QByteArray >{ >private: > typedef QTypedArrayData<char> Data; > >public: > inline QByteArray(); > QByteArray(const char *, int size = -1); > QByteArray(int size, char c); > QByteArray(int size, Qt::Initialization); > inline QByteArray(const QByteArray &); > inline ~QByteArray(); > > QByteArray &operator=(const QByteArray &); > QByteArray &operator=(const char *str); > > > > > > > inline void swap(QByteArray &other) { qSwap(d, other.d); } > > inline int size() const; > bool isEmpty() const; > void resize(int size); > > QByteArray &fill(char c, int size = -1); > > int capacity() const; > void reserve(int size); > void squeeze(); > > > operator const char *() const; > operator const void *() const; > > char *data(); > const char *data() const; > inline const char *constData() const; > inline void detach(); > bool isDetached() const; > inline bool isSharedWith(const QByteArray &other) const { return d == other.d; } > void clear(); > > char at(int i) const; > char operator[](int i) const; > char operator[](uint i) const; > QByteRef operator[](int i); > QByteRef operator[](uint i); > > int indexOf(char c, int from = 0) const; > int indexOf(const char *c, int from = 0) const; > int indexOf(const QByteArray &a, int from = 0) const; > int lastIndexOf(char c, int from = -1) const; > int lastIndexOf(const char *c, int from = -1) const; > int lastIndexOf(const QByteArray &a, int from = -1) const; > > bool contains(char c) const; > bool contains(const char *a) const; > bool contains(const QByteArray &a) const; > int count(char c) const; > int count(const char *a) const; > int count(const QByteArray &a) const; > > QByteArray left(int len) const; > QByteArray right(int len) const; > QByteArray mid(int index, int len = -1) const; > > bool startsWith(const QByteArray &a) const; > bool startsWith(char c) const; > bool startsWith(const char *c) const; > > bool endsWith(const QByteArray &a) const; > bool endsWith(char c) const; > bool endsWith(const char *c) const; > > void truncate(int pos); > void chop(int n); > > QByteArray toLower() const; > QByteArray toUpper() const; > > QByteArray trimmed() const; > QByteArray simplified() const; > QByteArray leftJustified(int width, char fill = ' ', bool truncate = false) const; > QByteArray rightJustified(int width, char fill = ' ', bool truncate = false) const; > > QByteArray &prepend(char c); > QByteArray &prepend(const char *s); > QByteArray &prepend(const char *s, int len); > QByteArray &prepend(const QByteArray &a); > QByteArray &append(char c); > QByteArray &append(const char *s); > QByteArray &append(const char *s, int len); > QByteArray &append(const QByteArray &a); > QByteArray &insert(int i, char c); > QByteArray &insert(int i, const char *s); > QByteArray &insert(int i, const char *s, int len); > QByteArray &insert(int i, const QByteArray &a); > QByteArray &remove(int index, int len); > QByteArray &replace(int index, int len, const char *s); > QByteArray &replace(int index, int len, const char *s, int alen); > QByteArray &replace(int index, int len, const QByteArray &s); > QByteArray &replace(char before, const char *after); > QByteArray &replace(char before, const QByteArray &after); > QByteArray &replace(const char *before, const char *after); > QByteArray &replace(const char *before, int bsize, const char *after, int asize); > QByteArray &replace(const QByteArray &before, const QByteArray &after); > QByteArray &replace(const QByteArray &before, const char *after); > QByteArray &replace(const char *before, const QByteArray &after); > QByteArray &replace(char before, char after); > QByteArray &operator+=(char c); > QByteArray &operator+=(const char *s); > QByteArray &operator+=(const QByteArray &a); > > QList<QByteArray> split(char sep) const; > > QByteArray repeated(int times) const; ># 320 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h" > inline bool operator==(const QString &s2) const; > inline bool operator!=(const QString &s2) const; > inline bool operator<(const QString &s2) const; > inline bool operator>(const QString &s2) const; > inline bool operator<=(const QString &s2) const; > inline bool operator>=(const QString &s2) const; > > > short toShort(bool *ok = 0, int base = 10) const; > ushort toUShort(bool *ok = 0, int base = 10) const; > int toInt(bool *ok = 0, int base = 10) const; > uint toUInt(bool *ok = 0, int base = 10) const; > long toLong(bool *ok = 0, int base = 10) const; > ulong toULong(bool *ok = 0, int base = 10) const; > qlonglong toLongLong(bool *ok = 0, int base = 10) const; > qulonglong toULongLong(bool *ok = 0, int base = 10) const; > float toFloat(bool *ok = 0) const; > double toDouble(bool *ok = 0) const; > QByteArray toBase64() const; > QByteArray toHex() const; > QByteArray toPercentEncoding(const QByteArray &exclude = QByteArray(), > const QByteArray &include = QByteArray(), > char percent = '%') const; > > QByteArray &setNum(short, int base = 10); > QByteArray &setNum(ushort, int base = 10); > QByteArray &setNum(int, int base = 10); > QByteArray &setNum(uint, int base = 10); > QByteArray &setNum(qlonglong, int base = 10); > QByteArray &setNum(qulonglong, int base = 10); > QByteArray &setNum(float, char f = 'g', int prec = 6); > QByteArray &setNum(double, char f = 'g', int prec = 6); > QByteArray &setRawData(const char *a, uint n); > > static QByteArray number(int, int base = 10); > static QByteArray number(uint, int base = 10); > static QByteArray number(qlonglong, int base = 10); > static QByteArray number(qulonglong, int base = 10); > static QByteArray number(double, char f = 'g', int prec = 6); > static QByteArray fromRawData(const char *, int size); > static QByteArray fromBase64(const QByteArray &base64); > static QByteArray fromHex(const QByteArray &hexEncoded); > static QByteArray fromPercentEncoding(const QByteArray &pctEncoded, char percent = '%'); > > > typedef char *iterator; > typedef const char *const_iterator; > typedef iterator Iterator; > typedef const_iterator ConstIterator; > iterator begin(); > const_iterator begin() const; > const_iterator cbegin() const; > const_iterator constBegin() const; > iterator end(); > const_iterator end() const; > const_iterator cend() const; > const_iterator constEnd() const; > > > typedef const char & const_reference; > typedef char & reference; > typedef char value_type; > void push_back(char c); > void push_back(const char *c); > void push_back(const QByteArray &a); > void push_front(char c); > void push_front(const char *c); > void push_front(const QByteArray &a); > > inline int count() const { return d->size; } > int length() const { return d->size; } > bool isNull() const; > > inline QByteArray(QByteArrayDataPtr dd) > : d(reinterpret_cast<Data *>(dd.ptr)) > { > } > >private: > operator QNoImplicitBoolCast() const; > Data *d; > void reallocData(uint alloc, Data::ArrayOptions options); > void expand(int i); > QByteArray nulTerminated() const; > > friend class QByteRef; > friend class QString; > friend __attribute__((visibility("default"))) QByteArray qUncompress(const uchar *data, int nbytes); >public: > typedef Data * DataPtr; > inline DataPtr &data_ptr() { return d; } >}; > >inline QByteArray::QByteArray(): d(Data::sharedNull()) { } >inline QByteArray::~QByteArray() { if (!d->ref.deref()) Data::deallocate(d); } >inline int QByteArray::size() const >{ return d->size; } > >inline char QByteArray::at(int i) const >{ ((!(i >= 0 && i < size())) ? qt_assert("i >= 0 && i < size()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h",419) : qt_noop()); return d->data()[i]; } >inline char QByteArray::operator[](int i) const >{ ((!(i >= 0 && i < size())) ? qt_assert("i >= 0 && i < size()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h",421) : qt_noop()); return d->data()[i]; } >inline char QByteArray::operator[](uint i) const >{ ((!(i < uint(size()))) ? qt_assert("i < uint(size())","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h",423) : qt_noop()); return d->data()[i]; } > >inline bool QByteArray::isEmpty() const >{ return d->size == 0; } > >inline QByteArray::operator const char *() const >{ return d->data(); } >inline QByteArray::operator const void *() const >{ return d->data(); } > >inline char *QByteArray::data() >{ detach(); return d->data(); } >inline const char *QByteArray::data() const >{ return d->data(); } >inline const char *QByteArray::constData() const >{ return d->data(); } >inline void QByteArray::detach() >{ if (d->ref.isShared() || !d->isMutable()) reallocData(uint(d->size) + 1u, d->detachFlags()); } >inline bool QByteArray::isDetached() const >{ return !d->ref.isShared(); } >inline QByteArray::QByteArray(const QByteArray &a) : d(a.d) >{ d->ref.ref(); } > >inline int QByteArray::capacity() const >{ int realCapacity = d->capacity(); return realCapacity ? realCapacity - 1 : 0; } > >inline void QByteArray::reserve(int asize) >{ > if (d->ref.isShared() || asize > capacity()) { > reallocData(uint(asize) + 1u, d->detachFlags() | Data::CapacityReserved); > } else { > d->flags |= Data::CapacityReserved; > } >} > >inline void QByteArray::squeeze() >{ > if (d->ref.isShared() || d->size < capacity()) { > reallocData(uint(d->size) + 1u, d->detachFlags() & ~Data::CapacityReserved); > } else { > d->flags &= ~Data::CapacityReserved; > } >} > >class __attribute__((visibility("default"))) QByteRef { > QByteArray &a; > int i; > inline QByteRef(QByteArray &array, int idx) > : a(array),i(idx) {} > friend class QByteArray; >public: > inline operator char() const > { return i < a.d->size ? a.d->data()[i] : char(0); } > inline QByteRef &operator=(char c) > { if (i >= a.d->size) a.expand(i); else a.detach(); > a.d->data()[i] = c; return *this; } > inline QByteRef &operator=(const QByteRef &c) > { if (i >= a.d->size) a.expand(i); else a.detach(); > a.d->data()[i] = c.a.d->data()[c.i]; return *this; } > inline bool operator==(char c) const > { return a.d->data()[i] == c; } > inline bool operator!=(char c) const > { return a.d->data()[i] != c; } > inline bool operator>(char c) const > { return a.d->data()[i] > c; } > inline bool operator>=(char c) const > { return a.d->data()[i] >= c; } > inline bool operator<(char c) const > { return a.d->data()[i] < c; } > inline bool operator<=(char c) const > { return a.d->data()[i] <= c; } >}; > >inline QByteRef QByteArray::operator[](int i) >{ ((!(i >= 0)) ? qt_assert("i >= 0","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qbytearray.h",497) : qt_noop()); return QByteRef(*this, i); } >inline QByteRef QByteArray::operator[](uint i) >{ return QByteRef(*this, i); } >inline QByteArray::iterator QByteArray::begin() >{ detach(); return d->data(); } >inline QByteArray::const_iterator QByteArray::begin() const >{ return d->data(); } >inline QByteArray::const_iterator QByteArray::cbegin() const >{ return d->data(); } >inline QByteArray::const_iterator QByteArray::constBegin() const >{ return d->data(); } >inline QByteArray::iterator QByteArray::end() >{ detach(); return d->data() + d->size; } >inline QByteArray::const_iterator QByteArray::end() const >{ return d->data() + d->size; } >inline QByteArray::const_iterator QByteArray::cend() const >{ return d->data() + d->size; } >inline QByteArray::const_iterator QByteArray::constEnd() const >{ return d->data() + d->size; } >inline QByteArray &QByteArray::operator+=(char c) >{ return append(c); } >inline QByteArray &QByteArray::operator+=(const char *s) >{ return append(s); } >inline QByteArray &QByteArray::operator+=(const QByteArray &a) >{ return append(a); } >inline void QByteArray::push_back(char c) >{ append(c); } >inline void QByteArray::push_back(const char *c) >{ append(c); } >inline void QByteArray::push_back(const QByteArray &a) >{ append(a); } >inline void QByteArray::push_front(char c) >{ prepend(c); } >inline void QByteArray::push_front(const char *c) >{ prepend(c); } >inline void QByteArray::push_front(const QByteArray &a) >{ prepend(a); } >inline bool QByteArray::contains(const QByteArray &a) const >{ return indexOf(a) != -1; } >inline bool QByteArray::contains(char c) const >{ return indexOf(c) != -1; } >inline bool operator==(const QByteArray &a1, const QByteArray &a2) >{ return (a1.size() == a2.size()) && (memcmp(a1.constData(), a2.constData(), a1.size())==0); } >inline bool operator==(const QByteArray &a1, const char *a2) >{ return a2 ? qstrcmp(a1,a2) == 0 : a1.isEmpty(); } >inline bool operator==(const char *a1, const QByteArray &a2) >{ return a1 ? qstrcmp(a1,a2) == 0 : a2.isEmpty(); } >inline bool operator!=(const QByteArray &a1, const QByteArray &a2) >{ return !(a1==a2); } >inline bool operator!=(const QByteArray &a1, const char *a2) >{ return a2 ? qstrcmp(a1,a2) != 0 : !a1.isEmpty(); } >inline bool operator!=(const char *a1, const QByteArray &a2) >{ return a1 ? qstrcmp(a1,a2) != 0 : !a2.isEmpty(); } >inline bool operator<(const QByteArray &a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) < 0; } > inline bool operator<(const QByteArray &a1, const char *a2) >{ return qstrcmp(a1, a2) < 0; } >inline bool operator<(const char *a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) < 0; } >inline bool operator<=(const QByteArray &a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) <= 0; } >inline bool operator<=(const QByteArray &a1, const char *a2) >{ return qstrcmp(a1, a2) <= 0; } >inline bool operator<=(const char *a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) <= 0; } >inline bool operator>(const QByteArray &a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) > 0; } >inline bool operator>(const QByteArray &a1, const char *a2) >{ return qstrcmp(a1, a2) > 0; } >inline bool operator>(const char *a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) > 0; } >inline bool operator>=(const QByteArray &a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) >= 0; } >inline bool operator>=(const QByteArray &a1, const char *a2) >{ return qstrcmp(a1, a2) >= 0; } >inline bool operator>=(const char *a1, const QByteArray &a2) >{ return qstrcmp(a1, a2) >= 0; } > >inline const QByteArray operator+(const QByteArray &a1, const QByteArray &a2) >{ return QByteArray(a1) += a2; } >inline const QByteArray operator+(const QByteArray &a1, const char *a2) >{ return QByteArray(a1) += a2; } >inline const QByteArray operator+(const QByteArray &a1, char a2) >{ return QByteArray(a1) += a2; } >inline const QByteArray operator+(const char *a1, const QByteArray &a2) >{ return QByteArray(a1) += a2; } >inline const QByteArray operator+(char a1, const QByteArray &a2) >{ return QByteArray(&a1, 1) += a2; } > >inline bool QByteArray::contains(const char *c) const >{ return indexOf(c) != -1; } >inline QByteArray &QByteArray::replace(char before, const char *c) >{ return replace(&before, 1, c, qstrlen(c)); } >inline QByteArray &QByteArray::replace(const QByteArray &before, const char *c) >{ return replace(before.constData(), before.size(), c, qstrlen(c)); } >inline QByteArray &QByteArray::replace(const char *before, const char *after) >{ return replace(before, qstrlen(before), after, qstrlen(after)); } > >inline QByteArray &QByteArray::setNum(short n, int base) >{ return setNum(qlonglong(n), base); } >inline QByteArray &QByteArray::setNum(ushort n, int base) >{ return setNum(qulonglong(n), base); } >inline QByteArray &QByteArray::setNum(int n, int base) >{ return setNum(qlonglong(n), base); } >inline QByteArray &QByteArray::setNum(uint n, int base) >{ return setNum(qulonglong(n), base); } >inline QByteArray &QByteArray::setNum(float n, char f, int prec) >{ return setNum(double(n),f,prec); } > > > >__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QByteArray &); >__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QByteArray &); > > > >__attribute__((visibility("default"))) QByteArray qCompress(const uchar* data, int nbytes, int compressionLevel = -1); >__attribute__((visibility("default"))) QByteArray qUncompress(const uchar* data, int nbytes); >inline QByteArray qCompress(const QByteArray& data, int compressionLevel = -1) >{ return qCompress(reinterpret_cast<const uchar *>(data.constData()), data.size(), compressionLevel); } >inline QByteArray qUncompress(const QByteArray& data) >{ return qUncompress(reinterpret_cast<const uchar*>(data.constData()), data.size()); } > > >template<> class QTypeInfo<QByteArray > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QByteArray)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QByteArray) }; static inline const char *name() { return "QByteArray"; } }; >template <> inline void qSwap<QByteArray>(QByteArray &value1, QByteArray &value2) { qSwap(value1.data_ptr(), value2.data_ptr()); } namespace std { template<> inline void swap< ::QByteArray>(::QByteArray &value1, ::QByteArray &value2) { swap(value1.data_ptr(), value2.data_ptr()); } } > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qbytearray.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qrefcount.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qnamespace.h" 1 ># 49 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 2 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 1 3 ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 3 > ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stringfwd.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stringfwd.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stringfwd.h" 3 > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _Alloc> > class allocator; > > > > > > > > template<class _CharT> > struct char_traits; > > template<typename _CharT, typename _Traits = char_traits<_CharT>, > typename _Alloc = allocator<_CharT> > > class basic_string; > > template<> struct char_traits<char>; > > typedef basic_string<char> string; > > > template<> struct char_traits<wchar_t>; > > typedef basic_string<wchar_t> wstring; ># 85 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stringfwd.h" 3 > >} ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 1 3 ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 > > > > ># 1 "/usr/include/wchar.h" 1 3 4 ># 37 "/usr/include/wchar.h" 3 4 ># 1 "/usr/include/stdio.h" 1 3 4 ># 45 "/usr/include/stdio.h" 3 4 >struct _IO_FILE; > > > >typedef struct _IO_FILE FILE; > > > > > ># 65 "/usr/include/stdio.h" 3 4 >typedef struct _IO_FILE __FILE; ># 38 "/usr/include/wchar.h" 2 3 4 > > > > ># 1 "/usr/include/bits/wchar.h" 1 3 4 ># 43 "/usr/include/wchar.h" 2 3 4 ># 52 "/usr/include/wchar.h" 3 4 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 354 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 3 4 >typedef unsigned int wint_t; ># 53 "/usr/include/wchar.h" 2 3 4 ># 83 "/usr/include/wchar.h" 3 4 >typedef struct >{ > int __count; > union > { > > unsigned int __wch; > > > > char __wchb[4]; > } __value; >} __mbstate_t; ># 104 "/usr/include/wchar.h" 3 4 > > >typedef __mbstate_t mbstate_t; > > > ># 129 "/usr/include/wchar.h" 3 4 >extern "C" { > > > > >struct tm; > > > > > > > > > >extern wchar_t *wcscpy (wchar_t *__restrict __dest, > __const wchar_t *__restrict __src) throw (); > >extern wchar_t *wcsncpy (wchar_t *__restrict __dest, > __const wchar_t *__restrict __src, size_t __n) > throw (); > > >extern wchar_t *wcscat (wchar_t *__restrict __dest, > __const wchar_t *__restrict __src) throw (); > >extern wchar_t *wcsncat (wchar_t *__restrict __dest, > __const wchar_t *__restrict __src, size_t __n) > throw (); > > >extern int wcscmp (__const wchar_t *__s1, __const wchar_t *__s2) > throw () __attribute__ ((__pure__)); > >extern int wcsncmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) > throw () __attribute__ ((__pure__)); > > > > >extern int wcscasecmp (__const wchar_t *__s1, __const wchar_t *__s2) throw (); > > >extern int wcsncasecmp (__const wchar_t *__s1, __const wchar_t *__s2, > size_t __n) throw (); > > > > > >extern int wcscasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2, > __locale_t __loc) throw (); > >extern int wcsncasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2, > size_t __n, __locale_t __loc) throw (); > > > > > >extern int wcscoll (__const wchar_t *__s1, __const wchar_t *__s2) throw (); > > > >extern size_t wcsxfrm (wchar_t *__restrict __s1, > __const wchar_t *__restrict __s2, size_t __n) throw (); > > > > > > > > >extern int wcscoll_l (__const wchar_t *__s1, __const wchar_t *__s2, > __locale_t __loc) throw (); > > > > >extern size_t wcsxfrm_l (wchar_t *__s1, __const wchar_t *__s2, > size_t __n, __locale_t __loc) throw (); > > >extern wchar_t *wcsdup (__const wchar_t *__s) throw () __attribute__ ((__malloc__)); > > > > > >extern "C++" wchar_t *wcschr (wchar_t *__wcs, wchar_t __wc) > throw () __asm ("wcschr") __attribute__ ((__pure__)); >extern "C++" __const wchar_t *wcschr (__const wchar_t *__wcs, wchar_t __wc) > throw () __asm ("wcschr") __attribute__ ((__pure__)); > > > > > > >extern "C++" wchar_t *wcsrchr (wchar_t *__wcs, wchar_t __wc) > throw () __asm ("wcsrchr") __attribute__ ((__pure__)); >extern "C++" __const wchar_t *wcsrchr (__const wchar_t *__wcs, wchar_t __wc) > throw () __asm ("wcsrchr") __attribute__ ((__pure__)); > > > > > > > > > >extern wchar_t *wcschrnul (__const wchar_t *__s, wchar_t __wc) > throw () __attribute__ ((__pure__)); > > > > > >extern size_t wcscspn (__const wchar_t *__wcs, __const wchar_t *__reject) > throw () __attribute__ ((__pure__)); > > >extern size_t wcsspn (__const wchar_t *__wcs, __const wchar_t *__accept) > throw () __attribute__ ((__pure__)); > > >extern "C++" wchar_t *wcspbrk (wchar_t *__wcs, __const wchar_t *__accept) > throw () __asm ("wcspbrk") __attribute__ ((__pure__)); >extern "C++" __const wchar_t *wcspbrk (__const wchar_t *__wcs, > __const wchar_t *__accept) > throw () __asm ("wcspbrk") __attribute__ ((__pure__)); > > > > > > >extern "C++" wchar_t *wcsstr (wchar_t *__haystack, __const wchar_t *__needle) > throw () __asm ("wcsstr") __attribute__ ((__pure__)); >extern "C++" __const wchar_t *wcsstr (__const wchar_t *__haystack, > __const wchar_t *__needle) > throw () __asm ("wcsstr") __attribute__ ((__pure__)); > > > > > > >extern wchar_t *wcstok (wchar_t *__restrict __s, > __const wchar_t *__restrict __delim, > wchar_t **__restrict __ptr) throw (); > > >extern size_t wcslen (__const wchar_t *__s) throw () __attribute__ ((__pure__)); > > > > > >extern "C++" wchar_t *wcswcs (wchar_t *__haystack, __const wchar_t *__needle) > throw () __asm ("wcswcs") __attribute__ ((__pure__)); >extern "C++" __const wchar_t *wcswcs (__const wchar_t *__haystack, > __const wchar_t *__needle) > throw () __asm ("wcswcs") __attribute__ ((__pure__)); ># 303 "/usr/include/wchar.h" 3 4 >extern size_t wcsnlen (__const wchar_t *__s, size_t __maxlen) > throw () __attribute__ ((__pure__)); > > > > > > >extern "C++" wchar_t *wmemchr (wchar_t *__s, wchar_t __c, size_t __n) > throw () __asm ("wmemchr") __attribute__ ((__pure__)); >extern "C++" __const wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, > size_t __n) > throw () __asm ("wmemchr") __attribute__ ((__pure__)); > > > > > > >extern int wmemcmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) > throw () __attribute__ ((__pure__)); > > >extern wchar_t *wmemcpy (wchar_t *__restrict __s1, > __const wchar_t *__restrict __s2, size_t __n) throw (); > > > >extern wchar_t *wmemmove (wchar_t *__s1, __const wchar_t *__s2, size_t __n) > throw (); > > >extern wchar_t *wmemset (wchar_t *__s, wchar_t __c, size_t __n) throw (); > > > > > >extern wchar_t *wmempcpy (wchar_t *__restrict __s1, > __const wchar_t *__restrict __s2, size_t __n) > throw (); > > > > > > >extern wint_t btowc (int __c) throw (); > > > >extern int wctob (wint_t __c) throw (); > > > >extern int mbsinit (__const mbstate_t *__ps) throw () __attribute__ ((__pure__)); > > > >extern size_t mbrtowc (wchar_t *__restrict __pwc, > __const char *__restrict __s, size_t __n, > mbstate_t *__p) throw (); > > >extern size_t wcrtomb (char *__restrict __s, wchar_t __wc, > mbstate_t *__restrict __ps) throw (); > > >extern size_t __mbrlen (__const char *__restrict __s, size_t __n, > mbstate_t *__restrict __ps) throw (); >extern size_t mbrlen (__const char *__restrict __s, size_t __n, > mbstate_t *__restrict __ps) throw (); > > > > > > > > >extern wint_t __btowc_alias (int __c) __asm ("btowc"); >extern __inline __attribute__ ((__gnu_inline__)) wint_t >__attribute__ ((__leaf__)) btowc (int __c) throw () >{ return (__builtin_constant_p (__c) && __c >= '\0' && __c <= '\x7f' > ? (wint_t) __c : __btowc_alias (__c)); } > >extern int __wctob_alias (wint_t __c) __asm ("wctob"); >extern __inline __attribute__ ((__gnu_inline__)) int >__attribute__ ((__leaf__)) wctob (wint_t __wc) throw () >{ return (__builtin_constant_p (__wc) && __wc >= L'\0' && __wc <= L'\x7f' > ? (int) __wc : __wctob_alias (__wc)); } > >extern __inline __attribute__ ((__gnu_inline__)) size_t >__attribute__ ((__leaf__)) mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw () > >{ return (__ps != __null > ? mbrtowc (__null, __s, __n, __ps) : __mbrlen (__s, __n, __null)); } > > > > > >extern size_t mbsrtowcs (wchar_t *__restrict __dst, > __const char **__restrict __src, size_t __len, > mbstate_t *__restrict __ps) throw (); > > > >extern size_t wcsrtombs (char *__restrict __dst, > __const wchar_t **__restrict __src, size_t __len, > mbstate_t *__restrict __ps) throw (); > > > > > > >extern size_t mbsnrtowcs (wchar_t *__restrict __dst, > __const char **__restrict __src, size_t __nmc, > size_t __len, mbstate_t *__restrict __ps) throw (); > > > >extern size_t wcsnrtombs (char *__restrict __dst, > __const wchar_t **__restrict __src, > size_t __nwc, size_t __len, > mbstate_t *__restrict __ps) throw (); > > > > > > >extern int wcwidth (wchar_t __c) throw (); > > > >extern int wcswidth (__const wchar_t *__s, size_t __n) throw (); > > > > > > >extern double wcstod (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr) throw (); > > > > > >extern float wcstof (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr) throw (); >extern long double wcstold (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr) throw (); > > > > > > > >extern long int wcstol (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, int __base) throw (); > > > >extern unsigned long int wcstoul (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, int __base) > throw (); > > > > > > >__extension__ >extern long long int wcstoll (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, int __base) > throw (); > > > >__extension__ >extern unsigned long long int wcstoull (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, > int __base) throw (); > > > > > > >__extension__ >extern long long int wcstoq (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, int __base) > throw (); > > > >__extension__ >extern unsigned long long int wcstouq (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, > int __base) throw (); ># 527 "/usr/include/wchar.h" 3 4 >extern long int wcstol_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, int __base, > __locale_t __loc) throw (); > >extern unsigned long int wcstoul_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, > int __base, __locale_t __loc) throw (); > >__extension__ >extern long long int wcstoll_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, > int __base, __locale_t __loc) throw (); > >__extension__ >extern unsigned long long int wcstoull_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, > int __base, __locale_t __loc) > throw (); > >extern double wcstod_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, __locale_t __loc) > throw (); > >extern float wcstof_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, __locale_t __loc) > throw (); > >extern long double wcstold_l (__const wchar_t *__restrict __nptr, > wchar_t **__restrict __endptr, > __locale_t __loc) throw (); > > > > > > >extern wchar_t *wcpcpy (wchar_t *__restrict __dest, > __const wchar_t *__restrict __src) throw (); > > > >extern wchar_t *wcpncpy (wchar_t *__restrict __dest, > __const wchar_t *__restrict __src, size_t __n) > throw (); > > > > > > >extern __FILE *open_wmemstream (wchar_t **__bufloc, size_t *__sizeloc) throw (); > > > > > > >extern int fwide (__FILE *__fp, int __mode) throw (); > > > > > > >extern int fwprintf (__FILE *__restrict __stream, > __const wchar_t *__restrict __format, ...) > ; > > > > >extern int wprintf (__const wchar_t *__restrict __format, ...) > ; > >extern int swprintf (wchar_t *__restrict __s, size_t __n, > __const wchar_t *__restrict __format, ...) > throw () ; > > > > > >extern int vfwprintf (__FILE *__restrict __s, > __const wchar_t *__restrict __format, > __gnuc_va_list __arg) > ; > > > > >extern int vwprintf (__const wchar_t *__restrict __format, > __gnuc_va_list __arg) > ; > > >extern int vswprintf (wchar_t *__restrict __s, size_t __n, > __const wchar_t *__restrict __format, > __gnuc_va_list __arg) > throw () ; > > > > > > >extern int fwscanf (__FILE *__restrict __stream, > __const wchar_t *__restrict __format, ...) > ; > > > > >extern int wscanf (__const wchar_t *__restrict __format, ...) > ; > >extern int swscanf (__const wchar_t *__restrict __s, > __const wchar_t *__restrict __format, ...) > throw () ; ># 677 "/usr/include/wchar.h" 3 4 > > > > > > > > > >extern int vfwscanf (__FILE *__restrict __s, > __const wchar_t *__restrict __format, > __gnuc_va_list __arg) > ; > > > > >extern int vwscanf (__const wchar_t *__restrict __format, > __gnuc_va_list __arg) > ; > >extern int vswscanf (__const wchar_t *__restrict __s, > __const wchar_t *__restrict __format, > __gnuc_va_list __arg) > throw () ; ># 733 "/usr/include/wchar.h" 3 4 > > > > > > > > > >extern wint_t fgetwc (__FILE *__stream); >extern wint_t getwc (__FILE *__stream); > > > > > >extern wint_t getwchar (void); > > > > > > >extern wint_t fputwc (wchar_t __wc, __FILE *__stream); >extern wint_t putwc (wchar_t __wc, __FILE *__stream); > > > > > >extern wint_t putwchar (wchar_t __wc); > > > > > > > >extern wchar_t *fgetws (wchar_t *__restrict __ws, int __n, > __FILE *__restrict __stream); > > > > > >extern int fputws (__const wchar_t *__restrict __ws, > __FILE *__restrict __stream); > > > > > > >extern wint_t ungetwc (wint_t __wc, __FILE *__stream); > ># 798 "/usr/include/wchar.h" 3 4 >extern wint_t getwc_unlocked (__FILE *__stream); >extern wint_t getwchar_unlocked (void); > > > > > > > >extern wint_t fgetwc_unlocked (__FILE *__stream); > > > > > > > >extern wint_t fputwc_unlocked (wchar_t __wc, __FILE *__stream); ># 824 "/usr/include/wchar.h" 3 4 >extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream); >extern wint_t putwchar_unlocked (wchar_t __wc); ># 834 "/usr/include/wchar.h" 3 4 >extern wchar_t *fgetws_unlocked (wchar_t *__restrict __ws, int __n, > __FILE *__restrict __stream); > > > > > > > >extern int fputws_unlocked (__const wchar_t *__restrict __ws, > __FILE *__restrict __stream); > > > > > > > >extern size_t wcsftime (wchar_t *__restrict __s, size_t __maxsize, > __const wchar_t *__restrict __format, > __const struct tm *__restrict __tp) throw (); > > > > > > > >extern size_t wcsftime_l (wchar_t *__restrict __s, size_t __maxsize, > __const wchar_t *__restrict __format, > __const struct tm *__restrict __tp, > __locale_t __loc) throw (); ># 888 "/usr/include/wchar.h" 3 4 >} ># 47 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 2 3 ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 >namespace std >{ > using ::mbstate_t; >} ># 137 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > using ::wint_t; > > using ::btowc; > using ::fgetwc; > using ::fgetws; > using ::fputwc; > using ::fputws; > using ::fwide; > using ::fwprintf; > using ::fwscanf; > using ::getwc; > using ::getwchar; > using ::mbrlen; > using ::mbrtowc; > using ::mbsinit; > using ::mbsrtowcs; > using ::putwc; > using ::putwchar; > > using ::swprintf; > > using ::swscanf; > using ::ungetwc; > using ::vfwprintf; > > using ::vfwscanf; > > > using ::vswprintf; > > > using ::vswscanf; > > using ::vwprintf; > > using ::vwscanf; > > using ::wcrtomb; > using ::wcscat; > using ::wcscmp; > using ::wcscoll; > using ::wcscpy; > using ::wcscspn; > using ::wcsftime; > using ::wcslen; > using ::wcsncat; > using ::wcsncmp; > using ::wcsncpy; > using ::wcsrtombs; > using ::wcsspn; > using ::wcstod; > > using ::wcstof; > > using ::wcstok; > using ::wcstol; > using ::wcstoul; > using ::wcsxfrm; > using ::wctob; > using ::wmemcmp; > using ::wmemcpy; > using ::wmemmove; > using ::wmemset; > using ::wprintf; > using ::wscanf; > using ::wcschr; > using ::wcspbrk; > using ::wcsrchr; > using ::wcsstr; > using ::wmemchr; ># 234 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 > >} > > > > > > > >namespace __gnu_cxx >{ > > > > > > using ::wcstold; ># 259 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 > using ::wcstoll; > using ::wcstoull; > >} > >namespace std >{ > using ::__gnu_cxx::wcstold; > using ::__gnu_cxx::wcstoll; > using ::__gnu_cxx::wcstoull; >} ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 2 3 ># 70 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 90 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > typedef long streamoff; ># 100 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > typedef ptrdiff_t streamsize; ># 113 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > template<typename _StateT> > class fpos > { > private: > streamoff _M_off; > _StateT _M_state; > > public: > > > > > fpos() > : _M_off(0), _M_state() { } ># 135 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > fpos(streamoff __off) > : _M_off(__off), _M_state() { } > > > operator streamoff() const { return _M_off; } > > > void > state(_StateT __st) > { _M_state = __st; } > > > _StateT > state() const > { return _M_state; } > > > > > > fpos& > operator+=(streamoff __off) > { > _M_off += __off; > return *this; > } > > > > > > fpos& > operator-=(streamoff __off) > { > _M_off -= __off; > return *this; > } > > > > > > > > fpos > operator+(streamoff __off) const > { > fpos __pos(*this); > __pos += __off; > return __pos; > } > > > > > > > > fpos > operator-(streamoff __off) const > { > fpos __pos(*this); > __pos -= __off; > return __pos; > } > > > > > > > streamoff > operator-(const fpos& __other) const > { return _M_off - __other._M_off; } > }; > > > > > > > template<typename _StateT> > inline bool > operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) > { return streamoff(__lhs) == streamoff(__rhs); } > > template<typename _StateT> > inline bool > operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) > { return streamoff(__lhs) != streamoff(__rhs); } > > > > > > typedef fpos<mbstate_t> streampos; > > typedef fpos<mbstate_t> wstreampos; ># 241 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/postypes.h" 3 > >} ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 3 > > > > ># 1 "/usr/include/wchar.h" 1 3 4 ># 47 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwchar" 2 3 ># 44 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 2 3 > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > ># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 3 > template<typename _CharT> > struct _Char_types > { > typedef unsigned long int_type; > typedef std::streampos pos_type; > typedef std::streamoff off_type; > typedef std::mbstate_t state_type; > }; ># 84 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 3 > template<typename _CharT> > struct char_traits > { > typedef _CharT char_type; > typedef typename _Char_types<_CharT>::int_type int_type; > typedef typename _Char_types<_CharT>::pos_type pos_type; > typedef typename _Char_types<_CharT>::off_type off_type; > typedef typename _Char_types<_CharT>::state_type state_type; > > static void > assign(char_type& __c1, const char_type& __c2) > { __c1 = __c2; } > > static bool > eq(const char_type& __c1, const char_type& __c2) > { return __c1 == __c2; } > > static bool > lt(const char_type& __c1, const char_type& __c2) > { return __c1 < __c2; } > > static int > compare(const char_type* __s1, const char_type* __s2, std::size_t __n); > > static std::size_t > length(const char_type* __s); > > static const char_type* > find(const char_type* __s, std::size_t __n, const char_type& __a); > > static char_type* > move(char_type* __s1, const char_type* __s2, std::size_t __n); > > static char_type* > copy(char_type* __s1, const char_type* __s2, std::size_t __n); > > static char_type* > assign(char_type* __s, std::size_t __n, char_type __a); > > static char_type > to_char_type(const int_type& __c) > { return static_cast<char_type>(__c); } > > static int_type > to_int_type(const char_type& __c) > { return static_cast<int_type>(__c); } > > static bool > eq_int_type(const int_type& __c1, const int_type& __c2) > { return __c1 == __c2; } > > static int_type > eof() > { return static_cast<int_type>(-1); } > > static int_type > not_eof(const int_type& __c) > { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); } > }; > > template<typename _CharT> > int > char_traits<_CharT>:: > compare(const char_type* __s1, const char_type* __s2, std::size_t __n) > { > for (std::size_t __i = 0; __i < __n; ++__i) > if (lt(__s1[__i], __s2[__i])) > return -1; > else if (lt(__s2[__i], __s1[__i])) > return 1; > return 0; > } > > template<typename _CharT> > std::size_t > char_traits<_CharT>:: > length(const char_type* __p) > { > std::size_t __i = 0; > while (!eq(__p[__i], char_type())) > ++__i; > return __i; > } > > template<typename _CharT> > const typename char_traits<_CharT>::char_type* > char_traits<_CharT>:: > find(const char_type* __s, std::size_t __n, const char_type& __a) > { > for (std::size_t __i = 0; __i < __n; ++__i) > if (eq(__s[__i], __a)) > return __s + __i; > return 0; > } > > template<typename _CharT> > typename char_traits<_CharT>::char_type* > char_traits<_CharT>:: > move(char_type* __s1, const char_type* __s2, std::size_t __n) > { > return static_cast<_CharT*>(__builtin_memmove(__s1, __s2, > __n * sizeof(char_type))); > } > > template<typename _CharT> > typename char_traits<_CharT>::char_type* > char_traits<_CharT>:: > copy(char_type* __s1, const char_type* __s2, std::size_t __n) > { > > std::copy(__s2, __s2 + __n, __s1); > return __s1; > } > > template<typename _CharT> > typename char_traits<_CharT>::char_type* > char_traits<_CharT>:: > assign(char_type* __s, std::size_t __n, char_type __a) > { > > std::fill_n(__s, __n, __a); > return __s; > } > > >} > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 228 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/char_traits.h" 3 > template<class _CharT> > struct char_traits : public __gnu_cxx::char_traits<_CharT> > { }; > > > > template<> > struct char_traits<char> > { > typedef char char_type; > typedef int int_type; > typedef streampos pos_type; > typedef streamoff off_type; > typedef mbstate_t state_type; > > static void > assign(char_type& __c1, const char_type& __c2) > { __c1 = __c2; } > > static bool > eq(const char_type& __c1, const char_type& __c2) > { return __c1 == __c2; } > > static bool > lt(const char_type& __c1, const char_type& __c2) > { return __c1 < __c2; } > > static int > compare(const char_type* __s1, const char_type* __s2, size_t __n) > { return __builtin_memcmp(__s1, __s2, __n); } > > static size_t > length(const char_type* __s) > { return __builtin_strlen(__s); } > > static const char_type* > find(const char_type* __s, size_t __n, const char_type& __a) > { return static_cast<const char_type*>(__builtin_memchr(__s, __a, __n)); } > > static char_type* > move(char_type* __s1, const char_type* __s2, size_t __n) > { return static_cast<char_type*>(__builtin_memmove(__s1, __s2, __n)); } > > static char_type* > copy(char_type* __s1, const char_type* __s2, size_t __n) > { return static_cast<char_type*>(__builtin_memcpy(__s1, __s2, __n)); } > > static char_type* > assign(char_type* __s, size_t __n, char_type __a) > { return static_cast<char_type*>(__builtin_memset(__s, __a, __n)); } > > static char_type > to_char_type(const int_type& __c) > { return static_cast<char_type>(__c); } > > > > static int_type > to_int_type(const char_type& __c) > { return static_cast<int_type>(static_cast<unsigned char>(__c)); } > > static bool > eq_int_type(const int_type& __c1, const int_type& __c2) > { return __c1 == __c2; } > > static int_type > eof() > { return static_cast<int_type>(-1); } > > static int_type > not_eof(const int_type& __c) > { return (__c == eof()) ? 0 : __c; } > }; > > > > > template<> > struct char_traits<wchar_t> > { > typedef wchar_t char_type; > typedef wint_t int_type; > typedef streamoff off_type; > typedef wstreampos pos_type; > typedef mbstate_t state_type; > > static void > assign(char_type& __c1, const char_type& __c2) > { __c1 = __c2; } > > static bool > eq(const char_type& __c1, const char_type& __c2) > { return __c1 == __c2; } > > static bool > lt(const char_type& __c1, const char_type& __c2) > { return __c1 < __c2; } > > static int > compare(const char_type* __s1, const char_type* __s2, size_t __n) > { return wmemcmp(__s1, __s2, __n); } > > static size_t > length(const char_type* __s) > { return wcslen(__s); } > > static const char_type* > find(const char_type* __s, size_t __n, const char_type& __a) > { return wmemchr(__s, __a, __n); } > > static char_type* > move(char_type* __s1, const char_type* __s2, size_t __n) > { return wmemmove(__s1, __s2, __n); } > > static char_type* > copy(char_type* __s1, const char_type* __s2, size_t __n) > { return wmemcpy(__s1, __s2, __n); } > > static char_type* > assign(char_type* __s, size_t __n, char_type __a) > { return wmemset(__s, __a, __n); } > > static char_type > to_char_type(const int_type& __c) > { return char_type(__c); } > > static int_type > to_int_type(const char_type& __c) > { return int_type(__c); } > > static bool > eq_int_type(const int_type& __c1, const int_type& __c2) > { return __c1 == __c2; } > > static int_type > eof() > { return static_cast<int_type>((0xffffffffu)); } > > static int_type > not_eof(const int_type& __c) > { return eq_int_type(__c, eof()) ? 0 : __c; } > }; > > > >} ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++locale.h" 1 3 ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++locale.h" 3 > ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++locale.h" 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/clocale" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/clocale" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/clocale" 3 > > ># 1 "/usr/include/locale.h" 1 3 4 ># 29 "/usr/include/locale.h" 3 4 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 30 "/usr/include/locale.h" 2 3 4 ># 1 "/usr/include/bits/locale.h" 1 3 4 ># 27 "/usr/include/bits/locale.h" 3 4 >enum >{ > __LC_CTYPE = 0, > __LC_NUMERIC = 1, > __LC_TIME = 2, > __LC_COLLATE = 3, > __LC_MONETARY = 4, > __LC_MESSAGES = 5, > __LC_ALL = 6, > __LC_PAPER = 7, > __LC_NAME = 8, > __LC_ADDRESS = 9, > __LC_TELEPHONE = 10, > __LC_MEASUREMENT = 11, > __LC_IDENTIFICATION = 12 >}; ># 31 "/usr/include/locale.h" 2 3 4 > >extern "C" { ># 51 "/usr/include/locale.h" 3 4 > > > >struct lconv >{ > > > char *decimal_point; > char *thousands_sep; > > > > > > char *grouping; > > > > > > char *int_curr_symbol; > char *currency_symbol; > char *mon_decimal_point; > char *mon_thousands_sep; > char *mon_grouping; > char *positive_sign; > char *negative_sign; > char int_frac_digits; > char frac_digits; > > char p_cs_precedes; > > char p_sep_by_space; > > char n_cs_precedes; > > char n_sep_by_space; > > > > > > > char p_sign_posn; > char n_sign_posn; > > > char int_p_cs_precedes; > > char int_p_sep_by_space; > > char int_n_cs_precedes; > > char int_n_sep_by_space; > > > > > > > char int_p_sign_posn; > char int_n_sign_posn; ># 121 "/usr/include/locale.h" 3 4 >}; > > > >extern char *setlocale (int __category, __const char *__locale) throw (); > > >extern struct lconv *localeconv (void) throw (); > > ># 152 "/usr/include/locale.h" 3 4 >extern __locale_t newlocale (int __category_mask, __const char *__locale, > __locale_t __base) throw (); ># 187 "/usr/include/locale.h" 3 4 >extern __locale_t duplocale (__locale_t __dataset) throw (); > > > >extern void freelocale (__locale_t __dataset) throw (); > > > > > > >extern __locale_t uselocale (__locale_t __dataset) throw (); > > > > > > > >} ># 45 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/clocale" 2 3 ># 53 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/clocale" 3 >namespace std >{ > using ::lconv; > using ::setlocale; > using ::localeconv; >} ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++locale.h" 2 3 > > > > > > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > > > extern "C" __typeof(uselocale) __uselocale; > > >} > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > typedef __locale_t __c_locale; > > > > > > inline int > __convert_from_v(const __c_locale& __cloc __attribute__ ((__unused__)), > char* __out, > const int __size __attribute__ ((__unused__)), > const char* __fmt, ...) > { > > __c_locale __old = __gnu_cxx::__uselocale(__cloc); ># 89 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/c++locale.h" 3 > __builtin_va_list __args; > __builtin_va_start(__args, __fmt); > > > const int __ret = __builtin_vsnprintf(__out, __size, __fmt, __args); > > > > > __builtin_va_end(__args); > > > __gnu_cxx::__uselocale(__old); > > > > > > > > return __ret; > } > > >} ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iosfwd" 1 3 ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iosfwd" 3 > ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iosfwd" 3 > > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 76 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iosfwd" 3 > class ios_base; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_ios; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_streambuf; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_istream; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_ostream; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_iostream; > > template<typename _CharT, typename _Traits = char_traits<_CharT>, > typename _Alloc = allocator<_CharT> > > class basic_stringbuf; > > template<typename _CharT, typename _Traits = char_traits<_CharT>, > typename _Alloc = allocator<_CharT> > > class basic_istringstream; > > template<typename _CharT, typename _Traits = char_traits<_CharT>, > typename _Alloc = allocator<_CharT> > > class basic_ostringstream; > > template<typename _CharT, typename _Traits = char_traits<_CharT>, > typename _Alloc = allocator<_CharT> > > class basic_stringstream; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_filebuf; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_ifstream; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_ofstream; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class basic_fstream; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class istreambuf_iterator; > > template<typename _CharT, typename _Traits = char_traits<_CharT> > > class ostreambuf_iterator; > > > > typedef basic_ios<char> ios; > > > typedef basic_streambuf<char> streambuf; > > > typedef basic_istream<char> istream; > > > typedef basic_ostream<char> ostream; > > > typedef basic_iostream<char> iostream; > > > typedef basic_stringbuf<char> stringbuf; > > > typedef basic_istringstream<char> istringstream; > > > typedef basic_ostringstream<char> ostringstream; > > > typedef basic_stringstream<char> stringstream; > > > typedef basic_filebuf<char> filebuf; > > > typedef basic_ifstream<char> ifstream; > > > typedef basic_ofstream<char> ofstream; > > > typedef basic_fstream<char> fstream; > > > > typedef basic_ios<wchar_t> wios; > > > typedef basic_streambuf<wchar_t> wstreambuf; > > > typedef basic_istream<wchar_t> wistream; > > > typedef basic_ostream<wchar_t> wostream; > > > typedef basic_iostream<wchar_t> wiostream; > > > typedef basic_stringbuf<wchar_t> wstringbuf; > > > typedef basic_istringstream<wchar_t> wistringstream; > > > typedef basic_ostringstream<wchar_t> wostringstream; > > > typedef basic_stringstream<wchar_t> wstringstream; > > > typedef basic_filebuf<wchar_t> wfilebuf; > > > typedef basic_ifstream<wchar_t> wifstream; > > > typedef basic_ofstream<wchar_t> wofstream; > > > typedef basic_fstream<wchar_t> wfstream; > > > > >} ># 44 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 3 > > ># 1 "/usr/include/ctype.h" 1 3 4 ># 30 "/usr/include/ctype.h" 3 4 >extern "C" { ># 48 "/usr/include/ctype.h" 3 4 >enum >{ > _ISupper = ((0) < 8 ? ((1 << (0)) << 8) : ((1 << (0)) >> 8)), > _ISlower = ((1) < 8 ? ((1 << (1)) << 8) : ((1 << (1)) >> 8)), > _ISalpha = ((2) < 8 ? ((1 << (2)) << 8) : ((1 << (2)) >> 8)), > _ISdigit = ((3) < 8 ? ((1 << (3)) << 8) : ((1 << (3)) >> 8)), > _ISxdigit = ((4) < 8 ? ((1 << (4)) << 8) : ((1 << (4)) >> 8)), > _ISspace = ((5) < 8 ? ((1 << (5)) << 8) : ((1 << (5)) >> 8)), > _ISprint = ((6) < 8 ? ((1 << (6)) << 8) : ((1 << (6)) >> 8)), > _ISgraph = ((7) < 8 ? ((1 << (7)) << 8) : ((1 << (7)) >> 8)), > _ISblank = ((8) < 8 ? ((1 << (8)) << 8) : ((1 << (8)) >> 8)), > _IScntrl = ((9) < 8 ? ((1 << (9)) << 8) : ((1 << (9)) >> 8)), > _ISpunct = ((10) < 8 ? ((1 << (10)) << 8) : ((1 << (10)) >> 8)), > _ISalnum = ((11) < 8 ? ((1 << (11)) << 8) : ((1 << (11)) >> 8)) >}; ># 81 "/usr/include/ctype.h" 3 4 >extern __const unsigned short int **__ctype_b_loc (void) > throw () __attribute__ ((__const)); >extern __const __int32_t **__ctype_tolower_loc (void) > throw () __attribute__ ((__const)); >extern __const __int32_t **__ctype_toupper_loc (void) > throw () __attribute__ ((__const)); ># 106 "/usr/include/ctype.h" 3 4 > > > > > > >extern int isalnum (int) throw (); >extern int isalpha (int) throw (); >extern int iscntrl (int) throw (); >extern int isdigit (int) throw (); >extern int islower (int) throw (); >extern int isgraph (int) throw (); >extern int isprint (int) throw (); >extern int ispunct (int) throw (); >extern int isspace (int) throw (); >extern int isupper (int) throw (); >extern int isxdigit (int) throw (); > > > >extern int tolower (int __c) throw (); > > >extern int toupper (int __c) throw (); > > > > > > > > >extern int isblank (int) throw (); > > > > > > >extern int isctype (int __c, int __mask) throw (); > > > > > > >extern int isascii (int __c) throw (); > > > >extern int toascii (int __c) throw (); > > > >extern int _toupper (int) throw (); >extern int _tolower (int) throw (); ># 273 "/usr/include/ctype.h" 3 4 >extern int isalnum_l (int, __locale_t) throw (); >extern int isalpha_l (int, __locale_t) throw (); >extern int iscntrl_l (int, __locale_t) throw (); >extern int isdigit_l (int, __locale_t) throw (); >extern int islower_l (int, __locale_t) throw (); >extern int isgraph_l (int, __locale_t) throw (); >extern int isprint_l (int, __locale_t) throw (); >extern int ispunct_l (int, __locale_t) throw (); >extern int isspace_l (int, __locale_t) throw (); >extern int isupper_l (int, __locale_t) throw (); >extern int isxdigit_l (int, __locale_t) throw (); > >extern int isblank_l (int, __locale_t) throw (); > > > >extern int __tolower_l (int __c, __locale_t __l) throw (); >extern int tolower_l (int __c, __locale_t __l) throw (); > > >extern int __toupper_l (int __c, __locale_t __l) throw (); >extern int toupper_l (int __c, __locale_t __l) throw (); ># 349 "/usr/include/ctype.h" 3 4 >} ># 45 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 2 3 ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 3 >namespace std >{ > using ::isalnum; > using ::isalpha; > using ::iscntrl; > using ::isdigit; > using ::isgraph; > using ::islower; > using ::isprint; > using ::ispunct; > using ::isspace; > using ::isupper; > using ::isxdigit; > using ::tolower; > using ::toupper; >} ># 45 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 57 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/localefwd.h" 3 > class locale; > > template<typename _Facet> > bool > has_facet(const locale&) throw(); > > template<typename _Facet> > const _Facet& > use_facet(const locale&); > > > template<typename _CharT> > bool > isspace(_CharT, const locale&); > > template<typename _CharT> > bool > isprint(_CharT, const locale&); > > template<typename _CharT> > bool > iscntrl(_CharT, const locale&); > > template<typename _CharT> > bool > isupper(_CharT, const locale&); > > template<typename _CharT> > bool > islower(_CharT, const locale&); > > template<typename _CharT> > bool > isalpha(_CharT, const locale&); > > template<typename _CharT> > bool > isdigit(_CharT, const locale&); > > template<typename _CharT> > bool > ispunct(_CharT, const locale&); > > template<typename _CharT> > bool > isxdigit(_CharT, const locale&); > > template<typename _CharT> > bool > isalnum(_CharT, const locale&); > > template<typename _CharT> > bool > isgraph(_CharT, const locale&); > > template<typename _CharT> > _CharT > toupper(_CharT, const locale&); > > template<typename _CharT> > _CharT > tolower(_CharT, const locale&); > > > class ctype_base; > template<typename _CharT> > class ctype; > template<> class ctype<char>; > > template<> class ctype<wchar_t>; > > template<typename _CharT> > class ctype_byname; > > > class codecvt_base; > template<typename _InternT, typename _ExternT, typename _StateT> > class codecvt; > template<> class codecvt<char, char, mbstate_t>; > > template<> class codecvt<wchar_t, char, mbstate_t>; > > template<typename _InternT, typename _ExternT, typename _StateT> > class codecvt_byname; > > > > template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > > class num_get; > template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > > class num_put; > > template<typename _CharT> class numpunct; > template<typename _CharT> class numpunct_byname; > > > template<typename _CharT> > class collate; > template<typename _CharT> class > collate_byname; > > > class time_base; > template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > > class time_get; > template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > > class time_get_byname; > template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > > class time_put; > template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > > class time_put_byname; > > > class money_base; > > template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > > class money_get; > template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > > class money_put; > > template<typename _CharT, bool _Intl = false> > class moneypunct; > template<typename _CharT, bool _Intl = false> > class moneypunct_byname; > > > class messages_base; > template<typename _CharT> > class messages; > template<typename _CharT> > class messages_byname; > > >} ># 46 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream_insert.h" 1 3 ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream_insert.h" 3 > ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream_insert.h" 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cxxabi_forced.h" 1 3 ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cxxabi_forced.h" 3 > ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/cxxabi_forced.h" 3 > >#pragma GCC visibility push(default) > > >namespace __cxxabiv1 >{ > > > > > > > > class __forced_unwind > { > virtual ~__forced_unwind() throw(); > > > virtual void __pure_dummy() = 0; > }; >} > > >#pragma GCC visibility pop ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream_insert.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits> > inline void > __ostream_write(basic_ostream<_CharT, _Traits>& __out, > const _CharT* __s, streamsize __n) > { > typedef basic_ostream<_CharT, _Traits> __ostream_type; > typedef typename __ostream_type::ios_base __ios_base; > > const streamsize __put = __out.rdbuf()->sputn(__s, __n); > if (__put != __n) > __out.setstate(__ios_base::badbit); > } > > template<typename _CharT, typename _Traits> > inline void > __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n) > { > typedef basic_ostream<_CharT, _Traits> __ostream_type; > typedef typename __ostream_type::ios_base __ios_base; > > const _CharT __c = __out.fill(); > for (; __n > 0; --__n) > { > const typename _Traits::int_type __put = __out.rdbuf()->sputc(__c); > if (_Traits::eq_int_type(__put, _Traits::eof())) > { > __out.setstate(__ios_base::badbit); > break; > } > } > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > __ostream_insert(basic_ostream<_CharT, _Traits>& __out, > const _CharT* __s, streamsize __n) > { > typedef basic_ostream<_CharT, _Traits> __ostream_type; > typedef typename __ostream_type::ios_base __ios_base; > > typename __ostream_type::sentry __cerb(__out); > if (__cerb) > { > try > { > const streamsize __w = __out.width(); > if (__w > __n) > { > const bool __left = ((__out.flags() > & __ios_base::adjustfield) > == __ios_base::left); > if (!__left) > __ostream_fill(__out, __w - __n); > if (__out.good()) > __ostream_write(__out, __s, __n); > if (__left && __out.good()) > __ostream_fill(__out, __w - __n); > } > else > __ostream_write(__out, __s, __n); > __out.width(0); > } > catch(__cxxabiv1::__forced_unwind&) > { > __out._M_setstate(__ios_base::badbit); > throw; > } > catch(...) > { __out._M_setstate(__ios_base::badbit); } > } > return __out; > } > > > > > extern template ostream& __ostream_insert(ostream&, const char*, streamsize); > > > extern template wostream& __ostream_insert(wostream&, const wchar_t*, > streamsize); > > > > >} ># 47 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 1 3 ># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 102 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Arg, typename _Result> > struct unary_function > { > > typedef _Arg argument_type; > > > typedef _Result result_type; > }; > > > > > template<typename _Arg1, typename _Arg2, typename _Result> > struct binary_function > { > > typedef _Arg1 first_argument_type; > > > typedef _Arg2 second_argument_type; > > > typedef _Result result_type; > }; ># 141 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Tp> > struct plus : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x + __y; } > }; > > > template<typename _Tp> > struct minus : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x - __y; } > }; > > > template<typename _Tp> > struct multiplies : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x * __y; } > }; > > > template<typename _Tp> > struct divides : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x / __y; } > }; > > > template<typename _Tp> > struct modulus : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x % __y; } > }; > > > template<typename _Tp> > struct negate : public unary_function<_Tp, _Tp> > { > _Tp > operator()(const _Tp& __x) const > { return -__x; } > }; ># 205 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Tp> > struct equal_to : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x == __y; } > }; > > > template<typename _Tp> > struct not_equal_to : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x != __y; } > }; > > > template<typename _Tp> > struct greater : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x > __y; } > }; > > > template<typename _Tp> > struct less : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x < __y; } > }; > > > template<typename _Tp> > struct greater_equal : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x >= __y; } > }; > > > template<typename _Tp> > struct less_equal : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x <= __y; } > }; ># 269 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Tp> > struct logical_and : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x && __y; } > }; > > > template<typename _Tp> > struct logical_or : public binary_function<_Tp, _Tp, bool> > { > bool > operator()(const _Tp& __x, const _Tp& __y) const > { return __x || __y; } > }; > > > template<typename _Tp> > struct logical_not : public unary_function<_Tp, bool> > { > bool > operator()(const _Tp& __x) const > { return !__x; } > }; > > > > > template<typename _Tp> > struct bit_and : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x & __y; } > }; > > template<typename _Tp> > struct bit_or : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x | __y; } > }; > > template<typename _Tp> > struct bit_xor : public binary_function<_Tp, _Tp, _Tp> > { > _Tp > operator()(const _Tp& __x, const _Tp& __y) const > { return __x ^ __y; } > }; ># 352 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Predicate> > class unary_negate > : public unary_function<typename _Predicate::argument_type, bool> > { > protected: > _Predicate _M_pred; > > public: > explicit > unary_negate(const _Predicate& __x) : _M_pred(__x) { } > > bool > operator()(const typename _Predicate::argument_type& __x) const > { return !_M_pred(__x); } > }; > > > template<typename _Predicate> > inline unary_negate<_Predicate> > not1(const _Predicate& __pred) > { return unary_negate<_Predicate>(__pred); } > > > template<typename _Predicate> > class binary_negate > : public binary_function<typename _Predicate::first_argument_type, > typename _Predicate::second_argument_type, bool> > { > protected: > _Predicate _M_pred; > > public: > explicit > binary_negate(const _Predicate& __x) : _M_pred(__x) { } > > bool > operator()(const typename _Predicate::first_argument_type& __x, > const typename _Predicate::second_argument_type& __y) const > { return !_M_pred(__x, __y); } > }; > > > template<typename _Predicate> > inline binary_negate<_Predicate> > not2(const _Predicate& __pred) > { return binary_negate<_Predicate>(__pred); } ># 423 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Arg, typename _Result> > class pointer_to_unary_function : public unary_function<_Arg, _Result> > { > protected: > _Result (*_M_ptr)(_Arg); > > public: > pointer_to_unary_function() { } > > explicit > pointer_to_unary_function(_Result (*__x)(_Arg)) > : _M_ptr(__x) { } > > _Result > operator()(_Arg __x) const > { return _M_ptr(__x); } > }; > > > template<typename _Arg, typename _Result> > inline pointer_to_unary_function<_Arg, _Result> > ptr_fun(_Result (*__x)(_Arg)) > { return pointer_to_unary_function<_Arg, _Result>(__x); } > > > template<typename _Arg1, typename _Arg2, typename _Result> > class pointer_to_binary_function > : public binary_function<_Arg1, _Arg2, _Result> > { > protected: > _Result (*_M_ptr)(_Arg1, _Arg2); > > public: > pointer_to_binary_function() { } > > explicit > pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) > : _M_ptr(__x) { } > > _Result > operator()(_Arg1 __x, _Arg2 __y) const > { return _M_ptr(__x, __y); } > }; > > > template<typename _Arg1, typename _Arg2, typename _Result> > inline pointer_to_binary_function<_Arg1, _Arg2, _Result> > ptr_fun(_Result (*__x)(_Arg1, _Arg2)) > { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); } > > > template<typename _Tp> > struct _Identity > > > > : public unary_function<_Tp,_Tp> > > { > _Tp& > operator()(_Tp& __x) const > { return __x; } > > const _Tp& > operator()(const _Tp& __x) const > { return __x; } > }; > > template<typename _Pair> > struct _Select1st > > : public unary_function<_Pair, typename _Pair::first_type> > > { > typename _Pair::first_type& > operator()(_Pair& __x) const > { return __x.first; } > > const typename _Pair::first_type& > operator()(const _Pair& __x) const > { return __x.first; } ># 516 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > }; > > template<typename _Pair> > struct _Select2nd > > : public unary_function<_Pair, typename _Pair::second_type> > > { > typename _Pair::second_type& > operator()(_Pair& __x) const > { return __x.second; } > > const typename _Pair::second_type& > operator()(const _Pair& __x) const > { return __x.second; } > }; ># 551 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 3 > template<typename _Ret, typename _Tp> > class mem_fun_t : public unary_function<_Tp*, _Ret> > { > public: > explicit > mem_fun_t(_Ret (_Tp::*__pf)()) > : _M_f(__pf) { } > > _Ret > operator()(_Tp* __p) const > { return (__p->*_M_f)(); } > > private: > _Ret (_Tp::*_M_f)(); > }; > > > > template<typename _Ret, typename _Tp> > class const_mem_fun_t : public unary_function<const _Tp*, _Ret> > { > public: > explicit > const_mem_fun_t(_Ret (_Tp::*__pf)() const) > : _M_f(__pf) { } > > _Ret > operator()(const _Tp* __p) const > { return (__p->*_M_f)(); } > > private: > _Ret (_Tp::*_M_f)() const; > }; > > > > template<typename _Ret, typename _Tp> > class mem_fun_ref_t : public unary_function<_Tp, _Ret> > { > public: > explicit > mem_fun_ref_t(_Ret (_Tp::*__pf)()) > : _M_f(__pf) { } > > _Ret > operator()(_Tp& __r) const > { return (__r.*_M_f)(); } > > private: > _Ret (_Tp::*_M_f)(); > }; > > > > template<typename _Ret, typename _Tp> > class const_mem_fun_ref_t : public unary_function<_Tp, _Ret> > { > public: > explicit > const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const) > : _M_f(__pf) { } > > _Ret > operator()(const _Tp& __r) const > { return (__r.*_M_f)(); } > > private: > _Ret (_Tp::*_M_f)() const; > }; > > > > template<typename _Ret, typename _Tp, typename _Arg> > class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret> > { > public: > explicit > mem_fun1_t(_Ret (_Tp::*__pf)(_Arg)) > : _M_f(__pf) { } > > _Ret > operator()(_Tp* __p, _Arg __x) const > { return (__p->*_M_f)(__x); } > > private: > _Ret (_Tp::*_M_f)(_Arg); > }; > > > > template<typename _Ret, typename _Tp, typename _Arg> > class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret> > { > public: > explicit > const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const) > : _M_f(__pf) { } > > _Ret > operator()(const _Tp* __p, _Arg __x) const > { return (__p->*_M_f)(__x); } > > private: > _Ret (_Tp::*_M_f)(_Arg) const; > }; > > > > template<typename _Ret, typename _Tp, typename _Arg> > class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> > { > public: > explicit > mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) > : _M_f(__pf) { } > > _Ret > operator()(_Tp& __r, _Arg __x) const > { return (__r.*_M_f)(__x); } > > private: > _Ret (_Tp::*_M_f)(_Arg); > }; > > > > template<typename _Ret, typename _Tp, typename _Arg> > class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> > { > public: > explicit > const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const) > : _M_f(__pf) { } > > _Ret > operator()(const _Tp& __r, _Arg __x) const > { return (__r.*_M_f)(__x); } > > private: > _Ret (_Tp::*_M_f)(_Arg) const; > }; > > > > template<typename _Ret, typename _Tp> > inline mem_fun_t<_Ret, _Tp> > mem_fun(_Ret (_Tp::*__f)()) > { return mem_fun_t<_Ret, _Tp>(__f); } > > template<typename _Ret, typename _Tp> > inline const_mem_fun_t<_Ret, _Tp> > mem_fun(_Ret (_Tp::*__f)() const) > { return const_mem_fun_t<_Ret, _Tp>(__f); } > > template<typename _Ret, typename _Tp> > inline mem_fun_ref_t<_Ret, _Tp> > mem_fun_ref(_Ret (_Tp::*__f)()) > { return mem_fun_ref_t<_Ret, _Tp>(__f); } > > template<typename _Ret, typename _Tp> > inline const_mem_fun_ref_t<_Ret, _Tp> > mem_fun_ref(_Ret (_Tp::*__f)() const) > { return const_mem_fun_ref_t<_Ret, _Tp>(__f); } > > template<typename _Ret, typename _Tp, typename _Arg> > inline mem_fun1_t<_Ret, _Tp, _Arg> > mem_fun(_Ret (_Tp::*__f)(_Arg)) > { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } > > template<typename _Ret, typename _Tp, typename _Arg> > inline const_mem_fun1_t<_Ret, _Tp, _Arg> > mem_fun(_Ret (_Tp::*__f)(_Arg) const) > { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } > > template<typename _Ret, typename _Tp, typename _Arg> > inline mem_fun1_ref_t<_Ret, _Tp, _Arg> > mem_fun_ref(_Ret (_Tp::*__f)(_Arg)) > { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } > > template<typename _Ret, typename _Tp, typename _Arg> > inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> > mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const) > { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } > > > > >} > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/backward/binders.h" 1 3 ># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/backward/binders.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 104 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/backward/binders.h" 3 > template<typename _Operation> > class binder1st > : public unary_function<typename _Operation::second_argument_type, > typename _Operation::result_type> > { > protected: > _Operation op; > typename _Operation::first_argument_type value; > > public: > binder1st(const _Operation& __x, > const typename _Operation::first_argument_type& __y) > : op(__x), value(__y) { } > > typename _Operation::result_type > operator()(const typename _Operation::second_argument_type& __x) const > { return op(value, __x); } > > > > typename _Operation::result_type > operator()(typename _Operation::second_argument_type& __x) const > { return op(value, __x); } > } ; > > > template<typename _Operation, typename _Tp> > inline binder1st<_Operation> > bind1st(const _Operation& __fn, const _Tp& __x) > { > typedef typename _Operation::first_argument_type _Arg1_type; > return binder1st<_Operation>(__fn, _Arg1_type(__x)); > } > > > template<typename _Operation> > class binder2nd > : public unary_function<typename _Operation::first_argument_type, > typename _Operation::result_type> > { > protected: > _Operation op; > typename _Operation::second_argument_type value; > > public: > binder2nd(const _Operation& __x, > const typename _Operation::second_argument_type& __y) > : op(__x), value(__y) { } > > typename _Operation::result_type > operator()(const typename _Operation::first_argument_type& __x) const > { return op(__x, value); } > > > > typename _Operation::result_type > operator()(typename _Operation::first_argument_type& __x) const > { return op(__x, value); } > } ; > > > template<typename _Operation, typename _Tp> > inline binder2nd<_Operation> > bind2nd(const _Operation& __fn, const _Tp& __x) > { > typedef typename _Operation::second_argument_type _Arg2_type; > return binder2nd<_Operation>(__fn, _Arg2_type(__x)); > } > > > >} ># 742 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_function.h" 2 3 ># 51 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/range_access.h" 1 3 ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/range_access.h" 3 > ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/range_access.h" 3 ># 54 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/atomicity.h" 1 3 ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/atomicity.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr.h" 1 3 ># 31 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr.h" 3 >#pragma GCC visibility push(default) ># 150 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr.h" 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 ># 1 "/usr/include/pthread.h" 1 3 4 ># 25 "/usr/include/pthread.h" 3 4 ># 1 "/usr/include/sched.h" 1 3 4 ># 30 "/usr/include/sched.h" 3 4 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 31 "/usr/include/sched.h" 2 3 4 > > > ># 1 "/usr/include/time.h" 1 3 4 ># 35 "/usr/include/sched.h" 2 3 4 ># 43 "/usr/include/sched.h" 3 4 ># 1 "/usr/include/bits/sched.h" 1 3 4 ># 74 "/usr/include/bits/sched.h" 3 4 >struct sched_param > { > int __sched_priority; > }; > >extern "C" { > > > >extern int clone (int (*__fn) (void *__arg), void *__child_stack, > int __flags, void *__arg, ...) throw (); > > >extern int unshare (int __flags) throw (); > > >extern int sched_getcpu (void) throw (); > > >extern int setns (int __fd, int __nstype) throw (); > > > >} > > > > > > > >struct __sched_param > { > int __sched_priority; > }; ># 120 "/usr/include/bits/sched.h" 3 4 >typedef unsigned long int __cpu_mask; > > > > > > >typedef struct >{ > __cpu_mask __bits[1024 / (8 * sizeof (__cpu_mask))]; >} cpu_set_t; ># 203 "/usr/include/bits/sched.h" 3 4 >extern "C" { > >extern int __sched_cpucount (size_t __setsize, const cpu_set_t *__setp) > throw (); >extern cpu_set_t *__sched_cpualloc (size_t __count) throw () ; >extern void __sched_cpufree (cpu_set_t *__set) throw (); > >} ># 44 "/usr/include/sched.h" 2 3 4 > > > > >extern "C" { > > >extern int sched_setparam (__pid_t __pid, __const struct sched_param *__param) > throw (); > > >extern int sched_getparam (__pid_t __pid, struct sched_param *__param) throw (); > > >extern int sched_setscheduler (__pid_t __pid, int __policy, > __const struct sched_param *__param) throw (); > > >extern int sched_getscheduler (__pid_t __pid) throw (); > > >extern int sched_yield (void) throw (); > > >extern int sched_get_priority_max (int __algorithm) throw (); > > >extern int sched_get_priority_min (int __algorithm) throw (); > > >extern int sched_rr_get_interval (__pid_t __pid, struct timespec *__t) throw (); ># 118 "/usr/include/sched.h" 3 4 >extern int sched_setaffinity (__pid_t __pid, size_t __cpusetsize, > __const cpu_set_t *__cpuset) throw (); > > >extern int sched_getaffinity (__pid_t __pid, size_t __cpusetsize, > cpu_set_t *__cpuset) throw (); > > >} ># 26 "/usr/include/pthread.h" 2 3 4 ># 1 "/usr/include/time.h" 1 3 4 ># 30 "/usr/include/time.h" 3 4 >extern "C" { > > > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4 ># 39 "/usr/include/time.h" 2 3 4 > > > ># 1 "/usr/include/bits/time.h" 1 3 4 ># 86 "/usr/include/bits/time.h" 3 4 ># 1 "/usr/include/bits/timex.h" 1 3 4 ># 24 "/usr/include/bits/timex.h" 3 4 >struct timex >{ > unsigned int modes; > long int offset; > long int freq; > long int maxerror; > long int esterror; > int status; > long int constant; > long int precision; > long int tolerance; > struct timeval time; > long int tick; > > long int ppsfreq; > long int jitter; > int shift; > long int stabil; > long int jitcnt; > long int calcnt; > long int errcnt; > long int stbcnt; > > int tai; > > > int :32; int :32; int :32; int :32; > int :32; int :32; int :32; int :32; > int :32; int :32; int :32; >}; ># 87 "/usr/include/bits/time.h" 2 3 4 > >extern "C" { > > >extern int clock_adjtime (__clockid_t __clock_id, struct timex *__utx) throw (); > >} ># 43 "/usr/include/time.h" 2 3 4 ># 131 "/usr/include/time.h" 3 4 > > >struct tm >{ > int tm_sec; > int tm_min; > int tm_hour; > int tm_mday; > int tm_mon; > int tm_year; > int tm_wday; > int tm_yday; > int tm_isdst; > > > long int tm_gmtoff; > __const char *tm_zone; > > > > >}; > > > > > > > > >struct itimerspec > { > struct timespec it_interval; > struct timespec it_value; > }; > > >struct sigevent; ># 180 "/usr/include/time.h" 3 4 > > > >extern clock_t clock (void) throw (); > > >extern time_t time (time_t *__timer) throw (); > > >extern double difftime (time_t __time1, time_t __time0) > throw () __attribute__ ((__const__)); > > >extern time_t mktime (struct tm *__tp) throw (); > > > > > >extern size_t strftime (char *__restrict __s, size_t __maxsize, > __const char *__restrict __format, > __const struct tm *__restrict __tp) throw (); > > > > > >extern char *strptime (__const char *__restrict __s, > __const char *__restrict __fmt, struct tm *__tp) > throw (); > > > > > > > >extern size_t strftime_l (char *__restrict __s, size_t __maxsize, > __const char *__restrict __format, > __const struct tm *__restrict __tp, > __locale_t __loc) throw (); > > > >extern char *strptime_l (__const char *__restrict __s, > __const char *__restrict __fmt, struct tm *__tp, > __locale_t __loc) throw (); > > > > > > >extern struct tm *gmtime (__const time_t *__timer) throw (); > > > >extern struct tm *localtime (__const time_t *__timer) throw (); > > > > > >extern struct tm *gmtime_r (__const time_t *__restrict __timer, > struct tm *__restrict __tp) throw (); > > > >extern struct tm *localtime_r (__const time_t *__restrict __timer, > struct tm *__restrict __tp) throw (); > > > > > >extern char *asctime (__const struct tm *__tp) throw (); > > >extern char *ctime (__const time_t *__timer) throw (); > > > > > > > >extern char *asctime_r (__const struct tm *__restrict __tp, > char *__restrict __buf) throw (); > > >extern char *ctime_r (__const time_t *__restrict __timer, > char *__restrict __buf) throw (); > > > > >extern char *__tzname[2]; >extern int __daylight; >extern long int __timezone; > > > > >extern char *tzname[2]; > > > >extern void tzset (void) throw (); > > > >extern int daylight; >extern long int timezone; > > > > > >extern int stime (__const time_t *__when) throw (); ># 313 "/usr/include/time.h" 3 4 >extern time_t timegm (struct tm *__tp) throw (); > > >extern time_t timelocal (struct tm *__tp) throw (); > > >extern int dysize (int __year) throw () __attribute__ ((__const__)); ># 328 "/usr/include/time.h" 3 4 >extern int nanosleep (__const struct timespec *__requested_time, > struct timespec *__remaining); > > > >extern int clock_getres (clockid_t __clock_id, struct timespec *__res) throw (); > > >extern int clock_gettime (clockid_t __clock_id, struct timespec *__tp) throw (); > > >extern int clock_settime (clockid_t __clock_id, __const struct timespec *__tp) > throw (); > > > > > > >extern int clock_nanosleep (clockid_t __clock_id, int __flags, > __const struct timespec *__req, > struct timespec *__rem); > > >extern int clock_getcpuclockid (pid_t __pid, clockid_t *__clock_id) throw (); > > > > >extern int timer_create (clockid_t __clock_id, > struct sigevent *__restrict __evp, > timer_t *__restrict __timerid) throw (); > > >extern int timer_delete (timer_t __timerid) throw (); > > >extern int timer_settime (timer_t __timerid, int __flags, > __const struct itimerspec *__restrict __value, > struct itimerspec *__restrict __ovalue) throw (); > > >extern int timer_gettime (timer_t __timerid, struct itimerspec *__value) > throw (); > > >extern int timer_getoverrun (timer_t __timerid) throw (); ># 390 "/usr/include/time.h" 3 4 >extern int getdate_err; ># 399 "/usr/include/time.h" 3 4 >extern struct tm *getdate (__const char *__string); ># 413 "/usr/include/time.h" 3 4 >extern int getdate_r (__const char *__restrict __string, > struct tm *__restrict __resbufp); > > >} ># 27 "/usr/include/pthread.h" 2 3 4 > > ># 1 "/usr/include/bits/setjmp.h" 1 3 4 ># 27 "/usr/include/bits/setjmp.h" 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 28 "/usr/include/bits/setjmp.h" 2 3 4 > > > > >typedef long int __jmp_buf[8]; ># 30 "/usr/include/pthread.h" 2 3 4 ># 1 "/usr/include/bits/wordsize.h" 1 3 4 ># 31 "/usr/include/pthread.h" 2 3 4 > > > >enum >{ > PTHREAD_CREATE_JOINABLE, > > PTHREAD_CREATE_DETACHED > >}; > > > >enum >{ > PTHREAD_MUTEX_TIMED_NP, > PTHREAD_MUTEX_RECURSIVE_NP, > PTHREAD_MUTEX_ERRORCHECK_NP, > PTHREAD_MUTEX_ADAPTIVE_NP > > , > PTHREAD_MUTEX_NORMAL = PTHREAD_MUTEX_TIMED_NP, > PTHREAD_MUTEX_RECURSIVE = PTHREAD_MUTEX_RECURSIVE_NP, > PTHREAD_MUTEX_ERRORCHECK = PTHREAD_MUTEX_ERRORCHECK_NP, > PTHREAD_MUTEX_DEFAULT = PTHREAD_MUTEX_NORMAL > > > > , PTHREAD_MUTEX_FAST_NP = PTHREAD_MUTEX_TIMED_NP > >}; > > > > >enum >{ > PTHREAD_MUTEX_STALLED, > PTHREAD_MUTEX_STALLED_NP = PTHREAD_MUTEX_STALLED, > PTHREAD_MUTEX_ROBUST, > PTHREAD_MUTEX_ROBUST_NP = PTHREAD_MUTEX_ROBUST >}; > > > > > >enum >{ > PTHREAD_PRIO_NONE, > PTHREAD_PRIO_INHERIT, > PTHREAD_PRIO_PROTECT >}; ># 115 "/usr/include/pthread.h" 3 4 >enum >{ > PTHREAD_RWLOCK_PREFER_READER_NP, > PTHREAD_RWLOCK_PREFER_WRITER_NP, > PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP, > PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_READER_NP >}; ># 147 "/usr/include/pthread.h" 3 4 >enum >{ > PTHREAD_INHERIT_SCHED, > > PTHREAD_EXPLICIT_SCHED > >}; > > > >enum >{ > PTHREAD_SCOPE_SYSTEM, > > PTHREAD_SCOPE_PROCESS > >}; > > > >enum >{ > PTHREAD_PROCESS_PRIVATE, > > PTHREAD_PROCESS_SHARED > >}; ># 182 "/usr/include/pthread.h" 3 4 >struct _pthread_cleanup_buffer >{ > void (*__routine) (void *); > void *__arg; > int __canceltype; > struct _pthread_cleanup_buffer *__prev; >}; > > >enum >{ > PTHREAD_CANCEL_ENABLE, > > PTHREAD_CANCEL_DISABLE > >}; >enum >{ > PTHREAD_CANCEL_DEFERRED, > > PTHREAD_CANCEL_ASYNCHRONOUS > >}; ># 220 "/usr/include/pthread.h" 3 4 >extern "C" { > > > > >extern int pthread_create (pthread_t *__restrict __newthread, > __const pthread_attr_t *__restrict __attr, > void *(*__start_routine) (void *), > void *__restrict __arg) throw () __attribute__ ((__nonnull__ (1, 3))); > > > > > >extern void pthread_exit (void *__retval) __attribute__ ((__noreturn__)); > > > > > > > >extern int pthread_join (pthread_t __th, void **__thread_return); > > > > >extern int pthread_tryjoin_np (pthread_t __th, void **__thread_return) throw (); > > > > > > > >extern int pthread_timedjoin_np (pthread_t __th, void **__thread_return, > __const struct timespec *__abstime); > > > > > > >extern int pthread_detach (pthread_t __th) throw (); > > > >extern pthread_t pthread_self (void) throw () __attribute__ ((__const__)); > > >extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw (); > > > > > > > >extern int pthread_attr_init (pthread_attr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_attr_destroy (pthread_attr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_attr_getdetachstate (__const pthread_attr_t *__attr, > int *__detachstate) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_setdetachstate (pthread_attr_t *__attr, > int __detachstate) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_attr_getguardsize (__const pthread_attr_t *__attr, > size_t *__guardsize) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_setguardsize (pthread_attr_t *__attr, > size_t __guardsize) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_attr_getschedparam (__const pthread_attr_t *__restrict > __attr, > struct sched_param *__restrict __param) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_setschedparam (pthread_attr_t *__restrict __attr, > __const struct sched_param *__restrict > __param) throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_getschedpolicy (__const pthread_attr_t *__restrict > __attr, int *__restrict __policy) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_attr_getinheritsched (__const pthread_attr_t *__restrict > __attr, int *__restrict __inherit) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_setinheritsched (pthread_attr_t *__attr, > int __inherit) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_attr_getscope (__const pthread_attr_t *__restrict __attr, > int *__restrict __scope) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_attr_getstackaddr (__const pthread_attr_t *__restrict > __attr, void **__restrict __stackaddr) > throw () __attribute__ ((__nonnull__ (1, 2))) __attribute__ ((__deprecated__)); > > > > > >extern int pthread_attr_setstackaddr (pthread_attr_t *__attr, > void *__stackaddr) > throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__)); > > >extern int pthread_attr_getstacksize (__const pthread_attr_t *__restrict > __attr, size_t *__restrict __stacksize) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > >extern int pthread_attr_setstacksize (pthread_attr_t *__attr, > size_t __stacksize) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_attr_getstack (__const pthread_attr_t *__restrict __attr, > void **__restrict __stackaddr, > size_t *__restrict __stacksize) > throw () __attribute__ ((__nonnull__ (1, 2, 3))); > > > > >extern int pthread_attr_setstack (pthread_attr_t *__attr, void *__stackaddr, > size_t __stacksize) throw () __attribute__ ((__nonnull__ (1))); > > > > > >extern int pthread_attr_setaffinity_np (pthread_attr_t *__attr, > size_t __cpusetsize, > __const cpu_set_t *__cpuset) > throw () __attribute__ ((__nonnull__ (1, 3))); > > > >extern int pthread_attr_getaffinity_np (__const pthread_attr_t *__attr, > size_t __cpusetsize, > cpu_set_t *__cpuset) > throw () __attribute__ ((__nonnull__ (1, 3))); > > > > > >extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr) > throw () __attribute__ ((__nonnull__ (2))); > > > > > > > >extern int pthread_setschedparam (pthread_t __target_thread, int __policy, > __const struct sched_param *__param) > throw () __attribute__ ((__nonnull__ (3))); > > >extern int pthread_getschedparam (pthread_t __target_thread, > int *__restrict __policy, > struct sched_param *__restrict __param) > throw () __attribute__ ((__nonnull__ (2, 3))); > > >extern int pthread_setschedprio (pthread_t __target_thread, int __prio) > throw (); > > > > >extern int pthread_getname_np (pthread_t __target_thread, char *__buf, > size_t __buflen) > throw () __attribute__ ((__nonnull__ (2))); > > >extern int pthread_setname_np (pthread_t __target_thread, __const char *__name) > throw () __attribute__ ((__nonnull__ (2))); > > > > > >extern int pthread_getconcurrency (void) throw (); > > >extern int pthread_setconcurrency (int __level) throw (); > > > > > > > >extern int pthread_yield (void) throw (); > > > > >extern int pthread_setaffinity_np (pthread_t __th, size_t __cpusetsize, > __const cpu_set_t *__cpuset) > throw () __attribute__ ((__nonnull__ (3))); > > >extern int pthread_getaffinity_np (pthread_t __th, size_t __cpusetsize, > cpu_set_t *__cpuset) > throw () __attribute__ ((__nonnull__ (3))); ># 478 "/usr/include/pthread.h" 3 4 >extern int pthread_once (pthread_once_t *__once_control, > void (*__init_routine) (void)) __attribute__ ((__nonnull__ (1, 2))); ># 490 "/usr/include/pthread.h" 3 4 >extern int pthread_setcancelstate (int __state, int *__oldstate); > > > >extern int pthread_setcanceltype (int __type, int *__oldtype); > > >extern int pthread_cancel (pthread_t __th); > > > > >extern void pthread_testcancel (void); > > > > >typedef struct >{ > struct > { > __jmp_buf __cancel_jmp_buf; > int __mask_was_saved; > } __cancel_jmp_buf[1]; > void *__pad[4]; >} __pthread_unwind_buf_t __attribute__ ((__aligned__)); ># 524 "/usr/include/pthread.h" 3 4 >struct __pthread_cleanup_frame >{ > void (*__cancel_routine) (void *); > void *__cancel_arg; > int __do_it; > int __cancel_type; >}; > > > > >class __pthread_cleanup_class >{ > void (*__cancel_routine) (void *); > void *__cancel_arg; > int __do_it; > int __cancel_type; > > public: > __pthread_cleanup_class (void (*__fct) (void *), void *__arg) > : __cancel_routine (__fct), __cancel_arg (__arg), __do_it (1) { } > ~__pthread_cleanup_class () { if (__do_it) __cancel_routine (__cancel_arg); } > void __setdoit (int __newval) { __do_it = __newval; } > void __defer () { pthread_setcanceltype (PTHREAD_CANCEL_DEFERRED, > &__cancel_type); } > void __restore () const { pthread_setcanceltype (__cancel_type, 0); } >}; ># 726 "/usr/include/pthread.h" 3 4 >struct __jmp_buf_tag; >extern int __sigsetjmp (struct __jmp_buf_tag *__env, int __savemask) throw (); > > > > > >extern int pthread_mutex_init (pthread_mutex_t *__mutex, > __const pthread_mutexattr_t *__mutexattr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_mutex_destroy (pthread_mutex_t *__mutex) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_mutex_trylock (pthread_mutex_t *__mutex) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_mutex_lock (pthread_mutex_t *__mutex) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_mutex_timedlock (pthread_mutex_t *__restrict __mutex, > __const struct timespec *__restrict > __abstime) throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern int pthread_mutex_unlock (pthread_mutex_t *__mutex) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_mutex_getprioceiling (__const pthread_mutex_t * > __restrict __mutex, > int *__restrict __prioceiling) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern int pthread_mutex_setprioceiling (pthread_mutex_t *__restrict __mutex, > int __prioceiling, > int *__restrict __old_ceiling) > throw () __attribute__ ((__nonnull__ (1, 3))); > > > > >extern int pthread_mutex_consistent (pthread_mutex_t *__mutex) > throw () __attribute__ ((__nonnull__ (1))); > >extern int pthread_mutex_consistent_np (pthread_mutex_t *__mutex) > throw () __attribute__ ((__nonnull__ (1))); ># 790 "/usr/include/pthread.h" 3 4 >extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_mutexattr_getpshared (__const pthread_mutexattr_t * > __restrict __attr, > int *__restrict __pshared) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_mutexattr_setpshared (pthread_mutexattr_t *__attr, > int __pshared) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_mutexattr_gettype (__const pthread_mutexattr_t *__restrict > __attr, int *__restrict __kind) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > > >extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_mutexattr_getprotocol (__const pthread_mutexattr_t * > __restrict __attr, > int *__restrict __protocol) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern int pthread_mutexattr_setprotocol (pthread_mutexattr_t *__attr, > int __protocol) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_mutexattr_getprioceiling (__const pthread_mutexattr_t * > __restrict __attr, > int *__restrict __prioceiling) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_mutexattr_setprioceiling (pthread_mutexattr_t *__attr, > int __prioceiling) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_mutexattr_getrobust (__const pthread_mutexattr_t *__attr, > int *__robustness) > throw () __attribute__ ((__nonnull__ (1, 2))); > >extern int pthread_mutexattr_getrobust_np (__const pthread_mutexattr_t *__attr, > int *__robustness) > throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern int pthread_mutexattr_setrobust (pthread_mutexattr_t *__attr, > int __robustness) > throw () __attribute__ ((__nonnull__ (1))); > >extern int pthread_mutexattr_setrobust_np (pthread_mutexattr_t *__attr, > int __robustness) > throw () __attribute__ ((__nonnull__ (1))); ># 872 "/usr/include/pthread.h" 3 4 >extern int pthread_rwlock_init (pthread_rwlock_t *__restrict __rwlock, > __const pthread_rwlockattr_t *__restrict > __attr) throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock, > __const struct timespec *__restrict > __abstime) throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock, > __const struct timespec *__restrict > __abstime) throw () __attribute__ ((__nonnull__ (1, 2))); > > > >extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock) > throw () __attribute__ ((__nonnull__ (1))); > > > > > >extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlockattr_getpshared (__const pthread_rwlockattr_t * > __restrict __attr, > int *__restrict __pshared) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr, > int __pshared) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_rwlockattr_getkind_np (__const pthread_rwlockattr_t * > __restrict __attr, > int *__restrict __pref) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr, > int __pref) throw () __attribute__ ((__nonnull__ (1))); > > > > > > > >extern int pthread_cond_init (pthread_cond_t *__restrict __cond, > __const pthread_condattr_t *__restrict > __cond_attr) throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_cond_destroy (pthread_cond_t *__cond) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_cond_signal (pthread_cond_t *__cond) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_cond_broadcast (pthread_cond_t *__cond) > throw () __attribute__ ((__nonnull__ (1))); > > > > > > >extern int pthread_cond_wait (pthread_cond_t *__restrict __cond, > pthread_mutex_t *__restrict __mutex) > __attribute__ ((__nonnull__ (1, 2))); ># 984 "/usr/include/pthread.h" 3 4 >extern int pthread_cond_timedwait (pthread_cond_t *__restrict __cond, > pthread_mutex_t *__restrict __mutex, > __const struct timespec *__restrict > __abstime) __attribute__ ((__nonnull__ (1, 2, 3))); > > > > >extern int pthread_condattr_init (pthread_condattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_condattr_destroy (pthread_condattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_condattr_getpshared (__const pthread_condattr_t * > __restrict __attr, > int *__restrict __pshared) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_condattr_setpshared (pthread_condattr_t *__attr, > int __pshared) throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_condattr_getclock (__const pthread_condattr_t * > __restrict __attr, > __clockid_t *__restrict __clock_id) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_condattr_setclock (pthread_condattr_t *__attr, > __clockid_t __clock_id) > throw () __attribute__ ((__nonnull__ (1))); ># 1028 "/usr/include/pthread.h" 3 4 >extern int pthread_spin_init (pthread_spinlock_t *__lock, int __pshared) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_spin_destroy (pthread_spinlock_t *__lock) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_spin_lock (pthread_spinlock_t *__lock) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_spin_trylock (pthread_spinlock_t *__lock) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_spin_unlock (pthread_spinlock_t *__lock) > throw () __attribute__ ((__nonnull__ (1))); > > > > > > >extern int pthread_barrier_init (pthread_barrier_t *__restrict __barrier, > __const pthread_barrierattr_t *__restrict > __attr, unsigned int __count) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_barrier_destroy (pthread_barrier_t *__barrier) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_barrier_wait (pthread_barrier_t *__barrier) > throw () __attribute__ ((__nonnull__ (1))); > > > >extern int pthread_barrierattr_init (pthread_barrierattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_barrierattr_destroy (pthread_barrierattr_t *__attr) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_barrierattr_getpshared (__const pthread_barrierattr_t * > __restrict __attr, > int *__restrict __pshared) > throw () __attribute__ ((__nonnull__ (1, 2))); > > >extern int pthread_barrierattr_setpshared (pthread_barrierattr_t *__attr, > int __pshared) > throw () __attribute__ ((__nonnull__ (1))); ># 1095 "/usr/include/pthread.h" 3 4 >extern int pthread_key_create (pthread_key_t *__key, > void (*__destr_function) (void *)) > throw () __attribute__ ((__nonnull__ (1))); > > >extern int pthread_key_delete (pthread_key_t __key) throw (); > > >extern void *pthread_getspecific (pthread_key_t __key) throw (); > > >extern int pthread_setspecific (pthread_key_t __key, > __const void *__pointer) throw () ; > > > > >extern int pthread_getcpuclockid (pthread_t __thread_id, > __clockid_t *__clock_id) > throw () __attribute__ ((__nonnull__ (2))); ># 1129 "/usr/include/pthread.h" 3 4 >extern int pthread_atfork (void (*__prepare) (void), > void (*__parent) (void), > void (*__child) (void)) throw (); > > > > >extern __inline __attribute__ ((__gnu_inline__)) int >__attribute__ ((__leaf__)) pthread_equal (pthread_t __thread1, pthread_t __thread2) throw () >{ > return __thread1 == __thread2; >} > > >} ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 2 3 ># 53 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >typedef pthread_t __gthread_t; >typedef pthread_key_t __gthread_key_t; >typedef pthread_once_t __gthread_once_t; >typedef pthread_mutex_t __gthread_mutex_t; >typedef pthread_mutex_t __gthread_recursive_mutex_t; >typedef pthread_cond_t __gthread_cond_t; >typedef struct timespec __gthread_time_t; ># 140 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >static __typeof(pthread_once) __gthrw_pthread_once __attribute__ ((__weakref__("pthread_once"))); >static __typeof(pthread_getspecific) __gthrw_pthread_getspecific __attribute__ ((__weakref__("pthread_getspecific"))); >static __typeof(pthread_setspecific) __gthrw_pthread_setspecific __attribute__ ((__weakref__("pthread_setspecific"))); > >static __typeof(pthread_create) __gthrw_pthread_create __attribute__ ((__weakref__("pthread_create"))); >static __typeof(pthread_join) __gthrw_pthread_join __attribute__ ((__weakref__("pthread_join"))); >static __typeof(pthread_equal) __gthrw_pthread_equal __attribute__ ((__weakref__("pthread_equal"))); >static __typeof(pthread_self) __gthrw_pthread_self __attribute__ ((__weakref__("pthread_self"))); >static __typeof(pthread_detach) __gthrw_pthread_detach __attribute__ ((__weakref__("pthread_detach"))); > >static __typeof(pthread_cancel) __gthrw_pthread_cancel __attribute__ ((__weakref__("pthread_cancel"))); > >static __typeof(sched_yield) __gthrw_sched_yield __attribute__ ((__weakref__("sched_yield"))); > >static __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __attribute__ ((__weakref__("pthread_mutex_lock"))); >static __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __attribute__ ((__weakref__("pthread_mutex_trylock"))); > >static __typeof(pthread_mutex_timedlock) __gthrw_pthread_mutex_timedlock __attribute__ ((__weakref__("pthread_mutex_timedlock"))); > >static __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __attribute__ ((__weakref__("pthread_mutex_unlock"))); >static __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __attribute__ ((__weakref__("pthread_mutex_init"))); >static __typeof(pthread_mutex_destroy) __gthrw_pthread_mutex_destroy __attribute__ ((__weakref__("pthread_mutex_destroy"))); > >static __typeof(pthread_cond_init) __gthrw_pthread_cond_init __attribute__ ((__weakref__("pthread_cond_init"))); >static __typeof(pthread_cond_broadcast) __gthrw_pthread_cond_broadcast __attribute__ ((__weakref__("pthread_cond_broadcast"))); >static __typeof(pthread_cond_signal) __gthrw_pthread_cond_signal __attribute__ ((__weakref__("pthread_cond_signal"))); >static __typeof(pthread_cond_wait) __gthrw_pthread_cond_wait __attribute__ ((__weakref__("pthread_cond_wait"))); >static __typeof(pthread_cond_timedwait) __gthrw_pthread_cond_timedwait __attribute__ ((__weakref__("pthread_cond_timedwait"))); >static __typeof(pthread_cond_destroy) __gthrw_pthread_cond_destroy __attribute__ ((__weakref__("pthread_cond_destroy"))); > > >static __typeof(pthread_key_create) __gthrw_pthread_key_create __attribute__ ((__weakref__("pthread_key_create"))); >static __typeof(pthread_key_delete) __gthrw_pthread_key_delete __attribute__ ((__weakref__("pthread_key_delete"))); >static __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __attribute__ ((__weakref__("pthread_mutexattr_init"))); >static __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __attribute__ ((__weakref__("pthread_mutexattr_settype"))); >static __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __attribute__ ((__weakref__("pthread_mutexattr_destroy"))); ># 258 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >static inline int >__gthread_active_p (void) >{ > > > > static void *const __gthread_active_ptr > = __extension__ (void *) &__gthrw_pthread_cancel; > > > > > return __gthread_active_ptr != 0; >} ># 677 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >static inline int >__gthread_create (__gthread_t *__threadid, void *(*__func) (void*), > void *__args) >{ > return __gthrw_pthread_create (__threadid, __null, __func, __args); >} > >static inline int >__gthread_join (__gthread_t __threadid, void **__value_ptr) >{ > return __gthrw_pthread_join (__threadid, __value_ptr); >} > >static inline int >__gthread_detach (__gthread_t __threadid) >{ > return __gthrw_pthread_detach (__threadid); >} > >static inline int >__gthread_equal (__gthread_t __t1, __gthread_t __t2) >{ > return __gthrw_pthread_equal (__t1, __t2); >} > >static inline __gthread_t >__gthread_self (void) >{ > return __gthrw_pthread_self (); >} > >static inline int >__gthread_yield (void) >{ > return __gthrw_sched_yield (); >} > >static inline int >__gthread_once (__gthread_once_t *__once, void (*__func) (void)) >{ > if (__gthread_active_p ()) > return __gthrw_pthread_once (__once, __func); > else > return -1; >} > >static inline int >__gthread_key_create (__gthread_key_t *__key, void (*__dtor) (void *)) >{ > return __gthrw_pthread_key_create (__key, __dtor); >} > >static inline int >__gthread_key_delete (__gthread_key_t __key) >{ > return __gthrw_pthread_key_delete (__key); >} > >static inline void * >__gthread_getspecific (__gthread_key_t __key) >{ > return __gthrw_pthread_getspecific (__key); >} > >static inline int >__gthread_setspecific (__gthread_key_t __key, const void *__ptr) >{ > return __gthrw_pthread_setspecific (__key, __ptr); >} ># 756 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >static inline int >__gthread_mutex_destroy (__gthread_mutex_t *__mutex) >{ > if (__gthread_active_p ()) > return __gthrw_pthread_mutex_destroy (__mutex); > else > return 0; >} > >static inline int >__gthread_mutex_lock (__gthread_mutex_t *__mutex) >{ > if (__gthread_active_p ()) > return __gthrw_pthread_mutex_lock (__mutex); > else > return 0; >} > >static inline int >__gthread_mutex_trylock (__gthread_mutex_t *__mutex) >{ > if (__gthread_active_p ()) > return __gthrw_pthread_mutex_trylock (__mutex); > else > return 0; >} > > >static inline int >__gthread_mutex_timedlock (__gthread_mutex_t *__mutex, > const __gthread_time_t *__abs_timeout) >{ > if (__gthread_active_p ()) > return __gthrw_pthread_mutex_timedlock (__mutex, __abs_timeout); > else > return 0; >} > > >static inline int >__gthread_mutex_unlock (__gthread_mutex_t *__mutex) >{ > if (__gthread_active_p ()) > return __gthrw_pthread_mutex_unlock (__mutex); > else > return 0; >} ># 828 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >static inline int >__gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *__mutex) >{ > return __gthread_mutex_lock (__mutex); >} > >static inline int >__gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *__mutex) >{ > return __gthread_mutex_trylock (__mutex); >} > > >static inline int >__gthread_recursive_mutex_timedlock (__gthread_recursive_mutex_t *__mutex, > const __gthread_time_t *__abs_timeout) >{ > return __gthread_mutex_timedlock (__mutex, __abs_timeout); >} > > >static inline int >__gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *__mutex) >{ > return __gthread_mutex_unlock (__mutex); >} ># 864 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr-default.h" 3 >static inline int >__gthread_cond_broadcast (__gthread_cond_t *__cond) >{ > return __gthrw_pthread_cond_broadcast (__cond); >} > >static inline int >__gthread_cond_signal (__gthread_cond_t *__cond) >{ > return __gthrw_pthread_cond_signal (__cond); >} > >static inline int >__gthread_cond_wait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex) >{ > return __gthrw_pthread_cond_wait (__cond, __mutex); >} > >static inline int >__gthread_cond_timedwait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex, > const __gthread_time_t *__abs_timeout) >{ > return __gthrw_pthread_cond_timedwait (__cond, __mutex, __abs_timeout); >} > >static inline int >__gthread_cond_wait_recursive (__gthread_cond_t *__cond, > __gthread_recursive_mutex_t *__mutex) >{ > return __gthread_cond_wait (__cond, __mutex); >} > >static inline int >__gthread_cond_timedwait_recursive (__gthread_cond_t *__cond, > __gthread_recursive_mutex_t *__mutex, > const __gthread_time_t *__abs_timeout) >{ > return __gthread_cond_timedwait (__cond, __mutex, __abs_timeout); >} > >static inline int >__gthread_cond_destroy (__gthread_cond_t* __cond) >{ > return __gthrw_pthread_cond_destroy (__cond); >} ># 151 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/gthr.h" 2 3 > > >#pragma GCC visibility pop ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/atomicity.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/atomic_word.h" 1 3 ># 32 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/atomic_word.h" 3 >typedef int _Atomic_word; ># 36 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/atomicity.h" 2 3 > >namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) >{ > > > > > > > > static inline _Atomic_word > __exchange_and_add(volatile _Atomic_word* __mem, int __val) > { return __atomic_fetch_add(__mem, __val, 4); } > > static inline void > __atomic_add(volatile _Atomic_word* __mem, int __val) > { __atomic_fetch_add(__mem, __val, 4); } ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ext/atomicity.h" 3 > static inline _Atomic_word > __exchange_and_add_single(_Atomic_word* __mem, int __val) > { > _Atomic_word __result = *__mem; > *__mem += __val; > return __result; > } > > static inline void > __atomic_add_single(_Atomic_word* __mem, int __val) > { *__mem += __val; } > > static inline _Atomic_word > __attribute__ ((__unused__)) > __exchange_and_add_dispatch(_Atomic_word* __mem, int __val) > { > > if (__gthread_active_p()) > return __exchange_and_add(__mem, __val); > else > return __exchange_and_add_single(__mem, __val); > > > > } > > static inline void > __attribute__ ((__unused__)) > __atomic_add_dispatch(_Atomic_word* __mem, int __val) > { > > if (__gthread_active_p()) > __atomic_add(__mem, __val); > else > __atomic_add_single(__mem, __val); > > > > } > > >} ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 2 3 > > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 108 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > class basic_string > { > typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type; > > > public: > typedef _Traits traits_type; > typedef typename _Traits::char_type value_type; > typedef _Alloc allocator_type; > typedef typename _CharT_alloc_type::size_type size_type; > typedef typename _CharT_alloc_type::difference_type difference_type; > typedef typename _CharT_alloc_type::reference reference; > typedef typename _CharT_alloc_type::const_reference const_reference; > typedef typename _CharT_alloc_type::pointer pointer; > typedef typename _CharT_alloc_type::const_pointer const_pointer; > typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator; > typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string> > const_iterator; > typedef std::reverse_iterator<const_iterator> const_reverse_iterator; > typedef std::reverse_iterator<iterator> reverse_iterator; > > private: ># 145 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > struct _Rep_base > { > size_type _M_length; > size_type _M_capacity; > _Atomic_word _M_refcount; > }; > > struct _Rep : _Rep_base > { > > typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc; ># 170 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > static const size_type _S_max_size; > static const _CharT _S_terminal; > > > > static size_type _S_empty_rep_storage[]; > > static _Rep& > _S_empty_rep() > { > > > > void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); > return *reinterpret_cast<_Rep*>(__p); > } > > bool > _M_is_leaked() const > { return this->_M_refcount < 0; } > > bool > _M_is_shared() const > { return this->_M_refcount > 0; } > > void > _M_set_leaked() > { this->_M_refcount = -1; } > > void > _M_set_sharable() > { this->_M_refcount = 0; } > > void > _M_set_length_and_sharable(size_type __n) > { > > if (__builtin_expect(this != &_S_empty_rep(), false)) > > { > this->_M_set_sharable(); > this->_M_length = __n; > traits_type::assign(this->_M_refdata()[__n], _S_terminal); > > > } > } > > _CharT* > _M_refdata() throw() > { return reinterpret_cast<_CharT*>(this + 1); } > > _CharT* > _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2) > { > return (!_M_is_leaked() && __alloc1 == __alloc2) > ? _M_refcopy() : _M_clone(__alloc1); > } > > > static _Rep* > _S_create(size_type, size_type, const _Alloc&); > > void > _M_dispose(const _Alloc& __a) > { > > if (__builtin_expect(this != &_S_empty_rep(), false)) > > { > > ; > if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount, > -1) <= 0) > { > ; > _M_destroy(__a); > } > } > } > > void > _M_destroy(const _Alloc&) throw(); > > _CharT* > _M_refcopy() throw() > { > > if (__builtin_expect(this != &_S_empty_rep(), false)) > > __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1); > return _M_refdata(); > } > > _CharT* > _M_clone(const _Alloc&, size_type __res = 0); > }; > > > struct _Alloc_hider : _Alloc > { > _Alloc_hider(_CharT* __dat, const _Alloc& __a) > : _Alloc(__a), _M_p(__dat) { } > > _CharT* _M_p; > }; > > public: > > > > > static const size_type npos = static_cast<size_type>(-1); > > private: > > mutable _Alloc_hider _M_dataplus; > > _CharT* > _M_data() const > { return _M_dataplus._M_p; } > > _CharT* > _M_data(_CharT* __p) > { return (_M_dataplus._M_p = __p); } > > _Rep* > _M_rep() const > { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); } > > > > iterator > _M_ibegin() const > { return iterator(_M_data()); } > > iterator > _M_iend() const > { return iterator(_M_data() + this->size()); } > > void > _M_leak() > { > if (!_M_rep()->_M_is_leaked()) > _M_leak_hard(); > } > > size_type > _M_check(size_type __pos, const char* __s) const > { > if (__pos > this->size()) > __throw_out_of_range((__s)); > return __pos; > } > > void > _M_check_length(size_type __n1, size_type __n2, const char* __s) const > { > if (this->max_size() - (this->size() - __n1) < __n2) > __throw_length_error((__s)); > } > > > size_type > _M_limit(size_type __pos, size_type __off) const > { > const bool __testoff = __off < this->size() - __pos; > return __testoff ? __off : this->size() - __pos; > } > > > bool > _M_disjunct(const _CharT* __s) const > { > return (less<const _CharT*>()(__s, _M_data()) > || less<const _CharT*>()(_M_data() + this->size(), __s)); > } > > > > static void > _M_copy(_CharT* __d, const _CharT* __s, size_type __n) > { > if (__n == 1) > traits_type::assign(*__d, *__s); > else > traits_type::copy(__d, __s, __n); > } > > static void > _M_move(_CharT* __d, const _CharT* __s, size_type __n) > { > if (__n == 1) > traits_type::assign(*__d, *__s); > else > traits_type::move(__d, __s, __n); > } > > static void > _M_assign(_CharT* __d, size_type __n, _CharT __c) > { > if (__n == 1) > traits_type::assign(*__d, __c); > else > traits_type::assign(__d, __n, __c); > } > > > > template<class _Iterator> > static void > _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2) > { > for (; __k1 != __k2; ++__k1, ++__p) > traits_type::assign(*__p, *__k1); > } > > static void > _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) > { _S_copy_chars(__p, __k1.base(), __k2.base()); } > > static void > _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2) > { _S_copy_chars(__p, __k1.base(), __k2.base()); } > > static void > _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) > { _M_copy(__p, __k1, __k2 - __k1); } > > static void > _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) > { _M_copy(__p, __k1, __k2 - __k1); } > > static int > _S_compare(size_type __n1, size_type __n2) > { > const difference_type __d = difference_type(__n1 - __n2); > > if (__d > __gnu_cxx::__numeric_traits<int>::__max) > return __gnu_cxx::__numeric_traits<int>::__max; > else if (__d < __gnu_cxx::__numeric_traits<int>::__min) > return __gnu_cxx::__numeric_traits<int>::__min; > else > return int(__d); > } > > void > _M_mutate(size_type __pos, size_type __len1, size_type __len2); > > void > _M_leak_hard(); > > static _Rep& > _S_empty_rep() > { return _Rep::_S_empty_rep(); } > > public: > > > > > > > > basic_string() > > : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { } > > > > > > > > explicit > basic_string(const _Alloc& __a); > > > > > > > basic_string(const basic_string& __str); > > > > > > > basic_string(const basic_string& __str, size_type __pos, > size_type __n = npos); > > > > > > > > basic_string(const basic_string& __str, size_type __pos, > size_type __n, const _Alloc& __a); ># 480 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string(const _CharT* __s, size_type __n, > const _Alloc& __a = _Alloc()); > > > > > > basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); > > > > > > > basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()); ># 528 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<class _InputIterator> > basic_string(_InputIterator __beg, _InputIterator __end, > const _Alloc& __a = _Alloc()); > > > > > ~basic_string() > { _M_rep()->_M_dispose(this->get_allocator()); } > > > > > > basic_string& > operator=(const basic_string& __str) > { return this->assign(__str); } > > > > > > basic_string& > operator=(const _CharT* __s) > { return this->assign(__s); } ># 561 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > operator=(_CharT __c) > { > this->assign(1, __c); > return *this; > } ># 601 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > iterator > begin() > { > _M_leak(); > return iterator(_M_data()); > } > > > > > > const_iterator > begin() const > { return const_iterator(_M_data()); } > > > > > > iterator > end() > { > _M_leak(); > return iterator(_M_data() + this->size()); > } > > > > > > const_iterator > end() const > { return const_iterator(_M_data() + this->size()); } > > > > > > > reverse_iterator > rbegin() > { return reverse_iterator(this->end()); } > > > > > > > const_reverse_iterator > rbegin() const > { return const_reverse_iterator(this->end()); } > > > > > > > reverse_iterator > rend() > { return reverse_iterator(this->begin()); } > > > > > > > const_reverse_iterator > rend() const > { return const_reverse_iterator(this->begin()); } ># 707 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > public: > > > > size_type > size() const > { return _M_rep()->_M_length; } > > > > size_type > length() const > { return _M_rep()->_M_length; } > > > size_type > max_size() const > { return _Rep::_S_max_size; } ># 736 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > void > resize(size_type __n, _CharT __c); ># 749 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > void > resize(size_type __n) > { this->resize(__n, _CharT()); } ># 772 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > capacity() const > { return _M_rep()->_M_capacity; } ># 793 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > void > reserve(size_type __res_arg = 0); > > > > > void > clear() > { _M_mutate(0, this->size(), 0); } > > > > > > bool > empty() const > { return this->size() == 0; } ># 822 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > const_reference > operator[] (size_type __pos) const > { > ; > return _M_data()[__pos]; > } ># 839 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > reference > operator[](size_type __pos) > { > > ; > > ; > _M_leak(); > return _M_data()[__pos]; > } ># 860 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > const_reference > at(size_type __n) const > { > if (__n >= this->size()) > __throw_out_of_range(("basic_string::at")); > return _M_data()[__n]; > } ># 879 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > reference > at(size_type __n) > { > if (__n >= size()) > __throw_out_of_range(("basic_string::at")); > _M_leak(); > return _M_data()[__n]; > } ># 928 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > operator+=(const basic_string& __str) > { return this->append(__str); } > > > > > > > basic_string& > operator+=(const _CharT* __s) > { return this->append(__s); } > > > > > > > basic_string& > operator+=(_CharT __c) > { > this->push_back(__c); > return *this; > } ># 969 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > append(const basic_string& __str); ># 985 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > append(const basic_string& __str, size_type __pos, size_type __n); > > > > > > > > basic_string& > append(const _CharT* __s, size_type __n); > > > > > > > basic_string& > append(const _CharT* __s) > { > ; > return this->append(__s, traits_type::length(__s)); > } ># 1017 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > append(size_type __n, _CharT __c); ># 1039 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<class _InputIterator> > basic_string& > append(_InputIterator __first, _InputIterator __last) > { return this->replace(_M_iend(), _M_iend(), __first, __last); } > > > > > > void > push_back(_CharT __c) > { > const size_type __len = 1 + this->size(); > if (__len > this->capacity() || _M_rep()->_M_is_shared()) > this->reserve(__len); > traits_type::assign(_M_data()[this->size()], __c); > _M_rep()->_M_set_length_and_sharable(__len); > } > > > > > > > basic_string& > assign(const basic_string& __str); ># 1096 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > assign(const basic_string& __str, size_type __pos, size_type __n) > { return this->assign(__str._M_data() > + __str._M_check(__pos, "basic_string::assign"), > __str._M_limit(__pos, __n)); } ># 1112 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > assign(const _CharT* __s, size_type __n); ># 1124 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > assign(const _CharT* __s) > { > ; > return this->assign(__s, traits_type::length(__s)); > } ># 1140 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > assign(size_type __n, _CharT __c) > { return _M_replace_aux(size_type(0), this->size(), __n, __c); } ># 1152 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<class _InputIterator> > basic_string& > assign(_InputIterator __first, _InputIterator __last) > { return this->replace(_M_ibegin(), _M_iend(), __first, __last); } ># 1181 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > void > insert(iterator __p, size_type __n, _CharT __c) > { this->replace(__p, __p, __n, __c); } ># 1197 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<class _InputIterator> > void > insert(iterator __p, _InputIterator __beg, _InputIterator __end) > { this->replace(__p, __p, __beg, __end); } ># 1229 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > insert(size_type __pos1, const basic_string& __str) > { return this->insert(__pos1, __str, size_type(0), __str.size()); } ># 1251 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > insert(size_type __pos1, const basic_string& __str, > size_type __pos2, size_type __n) > { return this->insert(__pos1, __str._M_data() > + __str._M_check(__pos2, "basic_string::insert"), > __str._M_limit(__pos2, __n)); } ># 1274 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > insert(size_type __pos, const _CharT* __s, size_type __n); ># 1292 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > insert(size_type __pos, const _CharT* __s) > { > ; > return this->insert(__pos, __s, traits_type::length(__s)); > } ># 1315 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > insert(size_type __pos, size_type __n, _CharT __c) > { return _M_replace_aux(_M_check(__pos, "basic_string::insert"), > size_type(0), __n, __c); } ># 1333 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > iterator > insert(iterator __p, _CharT __c) > { > ; > const size_type __pos = __p - _M_ibegin(); > _M_replace_aux(__pos, size_type(0), size_type(1), __c); > _M_rep()->_M_set_leaked(); > return iterator(_M_data() + __pos); > } ># 1358 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > erase(size_type __pos = 0, size_type __n = npos) > { > _M_mutate(_M_check(__pos, "basic_string::erase"), > _M_limit(__pos, __n), size_type(0)); > return *this; > } ># 1374 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > iterator > erase(iterator __position) > { > > ; > const size_type __pos = __position - _M_ibegin(); > _M_mutate(__pos, size_type(1), size_type(0)); > _M_rep()->_M_set_leaked(); > return iterator(_M_data() + __pos); > } ># 1394 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > iterator > erase(iterator __first, iterator __last); ># 1425 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(size_type __pos, size_type __n, const basic_string& __str) > { return this->replace(__pos, __n, __str._M_data(), __str.size()); } ># 1447 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(size_type __pos1, size_type __n1, const basic_string& __str, > size_type __pos2, size_type __n2) > { return this->replace(__pos1, __n1, __str._M_data() > + __str._M_check(__pos2, "basic_string::replace"), > __str._M_limit(__pos2, __n2)); } ># 1472 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(size_type __pos, size_type __n1, const _CharT* __s, > size_type __n2); ># 1492 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(size_type __pos, size_type __n1, const _CharT* __s) > { > ; > return this->replace(__pos, __n1, __s, traits_type::length(__s)); > } ># 1516 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) > { return _M_replace_aux(_M_check(__pos, "basic_string::replace"), > _M_limit(__pos, __n1), __n2, __c); } ># 1534 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(iterator __i1, iterator __i2, const basic_string& __str) > { return this->replace(__i1, __i2, __str._M_data(), __str.size()); } ># 1553 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) > { > > ; > return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n); > } ># 1574 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(iterator __i1, iterator __i2, const _CharT* __s) > { > ; > return this->replace(__i1, __i2, __s, traits_type::length(__s)); > } ># 1595 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string& > replace(iterator __i1, iterator __i2, size_type __n, _CharT __c) > { > > ; > return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c); > } ># 1618 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<class _InputIterator> > basic_string& > replace(iterator __i1, iterator __i2, > _InputIterator __k1, _InputIterator __k2) > { > > ; > ; > typedef typename std::__is_integer<_InputIterator>::__type _Integral; > return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral()); > } > > > > basic_string& > replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) > { > > ; > ; > return this->replace(__i1 - _M_ibegin(), __i2 - __i1, > __k1, __k2 - __k1); > } > > basic_string& > replace(iterator __i1, iterator __i2, > const _CharT* __k1, const _CharT* __k2) > { > > ; > ; > return this->replace(__i1 - _M_ibegin(), __i2 - __i1, > __k1, __k2 - __k1); > } > > basic_string& > replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2) > { > > ; > ; > return this->replace(__i1 - _M_ibegin(), __i2 - __i1, > __k1.base(), __k2 - __k1); > } > > basic_string& > replace(iterator __i1, iterator __i2, > const_iterator __k1, const_iterator __k2) > { > > ; > ; > return this->replace(__i1 - _M_ibegin(), __i2 - __i1, > __k1.base(), __k2 - __k1); > } ># 1694 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > private: > template<class _Integer> > basic_string& > _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n, > _Integer __val, __true_type) > { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); } > > template<class _InputIterator> > basic_string& > _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, > _InputIterator __k2, __false_type); > > basic_string& > _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, > _CharT __c); > > basic_string& > _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, > size_type __n2); > > > > template<class _InIterator> > static _CharT* > _S_construct_aux(_InIterator __beg, _InIterator __end, > const _Alloc& __a, __false_type) > { > typedef typename iterator_traits<_InIterator>::iterator_category _Tag; > return _S_construct(__beg, __end, __a, _Tag()); > } > > > > template<class _Integer> > static _CharT* > _S_construct_aux(_Integer __beg, _Integer __end, > const _Alloc& __a, __true_type) > { return _S_construct_aux_2(static_cast<size_type>(__beg), > __end, __a); } > > static _CharT* > _S_construct_aux_2(size_type __req, _CharT __c, const _Alloc& __a) > { return _S_construct(__req, __c, __a); } > > template<class _InIterator> > static _CharT* > _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a) > { > typedef typename std::__is_integer<_InIterator>::__type _Integral; > return _S_construct_aux(__beg, __end, __a, _Integral()); > } > > > template<class _InIterator> > static _CharT* > _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, > input_iterator_tag); > > > > template<class _FwdIterator> > static _CharT* > _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, > forward_iterator_tag); > > static _CharT* > _S_construct(size_type __req, _CharT __c, const _Alloc& __a); > > public: ># 1776 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > copy(_CharT* __s, size_type __n, size_type __pos = 0) const; ># 1786 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > void > swap(basic_string& __s); ># 1796 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > const _CharT* > c_str() const > { return _M_data(); } > > > > > > > > const _CharT* > data() const > { return _M_data(); } > > > > > allocator_type > get_allocator() const > { return _M_dataplus; } ># 1829 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find(const _CharT* __s, size_type __pos, size_type __n) const; ># 1842 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find(const basic_string& __str, size_type __pos = 0) const > > { return this->find(__str.data(), __pos, __str.size()); } ># 1857 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find(const _CharT* __s, size_type __pos = 0) const > { > ; > return this->find(__s, __pos, traits_type::length(__s)); > } ># 1874 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find(_CharT __c, size_type __pos = 0) const ; ># 1887 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > rfind(const basic_string& __str, size_type __pos = npos) const > > { return this->rfind(__str.data(), __pos, __str.size()); } ># 1904 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > rfind(const _CharT* __s, size_type __pos, size_type __n) const; ># 1917 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > rfind(const _CharT* __s, size_type __pos = npos) const > { > ; > return this->rfind(__s, __pos, traits_type::length(__s)); > } ># 1934 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > rfind(_CharT __c, size_type __pos = npos) const ; ># 1948 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_of(const basic_string& __str, size_type __pos = 0) const > > { return this->find_first_of(__str.data(), __pos, __str.size()); } ># 1965 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_of(const _CharT* __s, size_type __pos, size_type __n) const; ># 1978 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_of(const _CharT* __s, size_type __pos = 0) const > { > ; > return this->find_first_of(__s, __pos, traits_type::length(__s)); > } ># 1997 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_of(_CharT __c, size_type __pos = 0) const > { return this->find(__c, __pos); } ># 2012 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_of(const basic_string& __str, size_type __pos = npos) const > > { return this->find_last_of(__str.data(), __pos, __str.size()); } ># 2029 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_of(const _CharT* __s, size_type __pos, size_type __n) const; ># 2042 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_of(const _CharT* __s, size_type __pos = npos) const > { > ; > return this->find_last_of(__s, __pos, traits_type::length(__s)); > } ># 2061 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_of(_CharT __c, size_type __pos = npos) const > { return this->rfind(__c, __pos); } ># 2075 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_not_of(const basic_string& __str, size_type __pos = 0) const > > { return this->find_first_not_of(__str.data(), __pos, __str.size()); } ># 2092 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_not_of(const _CharT* __s, size_type __pos, > size_type __n) const; ># 2106 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_not_of(const _CharT* __s, size_type __pos = 0) const > { > ; > return this->find_first_not_of(__s, __pos, traits_type::length(__s)); > } ># 2123 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_first_not_of(_CharT __c, size_type __pos = 0) const > ; ># 2138 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_not_of(const basic_string& __str, size_type __pos = npos) const > > { return this->find_last_not_of(__str.data(), __pos, __str.size()); } ># 2155 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_not_of(const _CharT* __s, size_type __pos, > size_type __n) const; ># 2169 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_not_of(const _CharT* __s, size_type __pos = npos) const > { > ; > return this->find_last_not_of(__s, __pos, traits_type::length(__s)); > } ># 2186 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > size_type > find_last_not_of(_CharT __c, size_type __pos = npos) const > ; ># 2202 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > basic_string > substr(size_type __pos = 0, size_type __n = npos) const > { return basic_string(*this, > _M_check(__pos, "basic_string::substr"), __n); } ># 2221 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > int > compare(const basic_string& __str) const > { > const size_type __size = this->size(); > const size_type __osize = __str.size(); > const size_type __len = std::min(__size, __osize); > > int __r = traits_type::compare(_M_data(), __str.data(), __len); > if (!__r) > __r = _S_compare(__size, __osize); > return __r; > } ># 2253 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > int > compare(size_type __pos, size_type __n, const basic_string& __str) const; ># 2279 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > int > compare(size_type __pos1, size_type __n1, const basic_string& __str, > size_type __pos2, size_type __n2) const; ># 2297 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > int > compare(const _CharT* __s) const; ># 2321 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > int > compare(size_type __pos, size_type __n1, const _CharT* __s) const; ># 2348 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > int > compare(size_type __pos, size_type __n1, const _CharT* __s, > size_type __n2) const; > }; ># 2360 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc> > operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { > basic_string<_CharT, _Traits, _Alloc> __str(__lhs); > __str.append(__rhs); > return __str; > } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT,_Traits,_Alloc> > operator+(const _CharT* __lhs, > const basic_string<_CharT,_Traits,_Alloc>& __rhs); > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT,_Traits,_Alloc> > operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline basic_string<_CharT, _Traits, _Alloc> > operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { > basic_string<_CharT, _Traits, _Alloc> __str(__lhs); > __str.append(__rhs); > return __str; > } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline basic_string<_CharT, _Traits, _Alloc> > operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) > { > typedef basic_string<_CharT, _Traits, _Alloc> __string_type; > typedef typename __string_type::size_type __size_type; > __string_type __str(__lhs); > __str.append(__size_type(1), __rhs); > return __str; > } ># 2481 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __lhs.compare(__rhs) == 0; } > > template<typename _CharT> > inline > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type > operator==(const basic_string<_CharT>& __lhs, > const basic_string<_CharT>& __rhs) > { return (__lhs.size() == __rhs.size() > && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(), > __lhs.size())); } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator==(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __rhs.compare(__lhs) == 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { return __lhs.compare(__rhs) == 0; } ># 2527 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return !(__lhs == __rhs); } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator!=(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return !(__lhs == __rhs); } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { return !(__lhs == __rhs); } ># 2564 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __lhs.compare(__rhs) < 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { return __lhs.compare(__rhs) < 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator<(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __rhs.compare(__lhs) > 0; } ># 2601 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __lhs.compare(__rhs) > 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { return __lhs.compare(__rhs) > 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator>(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __rhs.compare(__lhs) < 0; } ># 2638 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __lhs.compare(__rhs) <= 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { return __lhs.compare(__rhs) <= 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator<=(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __rhs.compare(__lhs) >= 0; } ># 2675 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __lhs.compare(__rhs) >= 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, > const _CharT* __rhs) > { return __lhs.compare(__rhs) >= 0; } > > > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > inline bool > operator>=(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { return __rhs.compare(__lhs) <= 0; } ># 2712 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline void > swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, > basic_string<_CharT, _Traits, _Alloc>& __rhs) > { __lhs.swap(__rhs); } ># 2730 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > basic_istream<_CharT, _Traits>& > operator>>(basic_istream<_CharT, _Traits>& __is, > basic_string<_CharT, _Traits, _Alloc>& __str); > > template<> > basic_istream<char>& > operator>>(basic_istream<char>& __is, basic_string<char>& __str); ># 2748 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline basic_ostream<_CharT, _Traits>& > operator<<(basic_ostream<_CharT, _Traits>& __os, > const basic_string<_CharT, _Traits, _Alloc>& __str) > { > > > return __ostream_insert(__os, __str.data(), __str.size()); > } ># 2772 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > basic_istream<_CharT, _Traits>& > getline(basic_istream<_CharT, _Traits>& __is, > basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim); ># 2790 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.h" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > inline basic_istream<_CharT, _Traits>& > getline(basic_istream<_CharT, _Traits>& __is, > basic_string<_CharT, _Traits, _Alloc>& __str) > { return getline(__is, __str, __is.widen('\n')); } > > template<> > basic_istream<char>& > getline(basic_istream<char>& __in, basic_string<char>& __str, > char __delim); > > > template<> > basic_istream<wchar_t>& > getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str, > wchar_t __delim); > > > >} ># 55 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.tcc" 1 3 ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.tcc" 3 > ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.tcc" 3 > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits, typename _Alloc> > const typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4; > > template<typename _CharT, typename _Traits, typename _Alloc> > const _CharT > basic_string<_CharT, _Traits, _Alloc>:: > _Rep::_S_terminal = _CharT(); > > template<typename _CharT, typename _Traits, typename _Alloc> > const typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>::npos; > > > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[ > (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) / > sizeof(size_type)]; > > > > > > template<typename _CharT, typename _Traits, typename _Alloc> > template<typename _InIterator> > _CharT* > basic_string<_CharT, _Traits, _Alloc>:: > _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, > input_iterator_tag) > { > > if (__beg == __end && __a == _Alloc()) > return _S_empty_rep()._M_refdata(); > > > _CharT __buf[128]; > size_type __len = 0; > while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT)) > { > __buf[__len++] = *__beg; > ++__beg; > } > _Rep* __r = _Rep::_S_create(__len, size_type(0), __a); > _M_copy(__r->_M_refdata(), __buf, __len); > try > { > while (__beg != __end) > { > if (__len == __r->_M_capacity) > { > > _Rep* __another = _Rep::_S_create(__len + 1, __len, __a); > _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len); > __r->_M_destroy(__a); > __r = __another; > } > __r->_M_refdata()[__len++] = *__beg; > ++__beg; > } > } > catch(...) > { > __r->_M_destroy(__a); > throw; > } > __r->_M_set_length_and_sharable(__len); > return __r->_M_refdata(); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > template <typename _InIterator> > _CharT* > basic_string<_CharT, _Traits, _Alloc>:: > _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, > forward_iterator_tag) > { > > if (__beg == __end && __a == _Alloc()) > return _S_empty_rep()._M_refdata(); > > > if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end) > __throw_logic_error(("basic_string::_S_construct null not valid")); > > const size_type __dnew = static_cast<size_type>(std::distance(__beg, > __end)); > > _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a); > try > { _S_copy_chars(__r->_M_refdata(), __beg, __end); } > catch(...) > { > __r->_M_destroy(__a); > throw; > } > __r->_M_set_length_and_sharable(__dnew); > return __r->_M_refdata(); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > _CharT* > basic_string<_CharT, _Traits, _Alloc>:: > _S_construct(size_type __n, _CharT __c, const _Alloc& __a) > { > > if (__n == 0 && __a == _Alloc()) > return _S_empty_rep()._M_refdata(); > > > _Rep* __r = _Rep::_S_create(__n, size_type(0), __a); > if (__n) > _M_assign(__r->_M_refdata(), __n, __c); > > __r->_M_set_length_and_sharable(__n); > return __r->_M_refdata(); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(const basic_string& __str) > : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()), > __str.get_allocator()), > __str.get_allocator()) > { } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(const _Alloc& __a) > : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a) > { } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(const basic_string& __str, size_type __pos, size_type __n) > : _M_dataplus(_S_construct(__str._M_data() > + __str._M_check(__pos, > "basic_string::basic_string"), > __str._M_data() + __str._M_limit(__pos, __n) > + __pos, _Alloc()), _Alloc()) > { } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(const basic_string& __str, size_type __pos, > size_type __n, const _Alloc& __a) > : _M_dataplus(_S_construct(__str._M_data() > + __str._M_check(__pos, > "basic_string::basic_string"), > __str._M_data() + __str._M_limit(__pos, __n) > + __pos, __a), __a) > { } > > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(const _CharT* __s, size_type __n, const _Alloc& __a) > : _M_dataplus(_S_construct(__s, __s + __n, __a), __a) > { } > > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(const _CharT* __s, const _Alloc& __a) > : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) : > __s + npos, __a), __a) > { } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(size_type __n, _CharT __c, const _Alloc& __a) > : _M_dataplus(_S_construct(__n, __c, __a), __a) > { } > > > template<typename _CharT, typename _Traits, typename _Alloc> > template<typename _InputIterator> > basic_string<_CharT, _Traits, _Alloc>:: > basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a) > : _M_dataplus(_S_construct(__beg, __end, __a), __a) > { } ># 242 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.tcc" 3 > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > assign(const basic_string& __str) > { > if (_M_rep() != __str._M_rep()) > { > > const allocator_type __a = this->get_allocator(); > _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator()); > _M_rep()->_M_dispose(__a); > _M_data(__tmp); > } > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > assign(const _CharT* __s, size_type __n) > { > ; > _M_check_length(this->size(), __n, "basic_string::assign"); > if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) > return _M_replace_safe(size_type(0), this->size(), __s, __n); > else > { > > const size_type __pos = __s - _M_data(); > if (__pos >= __n) > _M_copy(_M_data(), __s, __n); > else if (__pos) > _M_move(_M_data(), __s, __n); > _M_rep()->_M_set_length_and_sharable(__n); > return *this; > } > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > append(size_type __n, _CharT __c) > { > if (__n) > { > _M_check_length(size_type(0), __n, "basic_string::append"); > const size_type __len = __n + this->size(); > if (__len > this->capacity() || _M_rep()->_M_is_shared()) > this->reserve(__len); > _M_assign(_M_data() + this->size(), __n, __c); > _M_rep()->_M_set_length_and_sharable(__len); > } > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > append(const _CharT* __s, size_type __n) > { > ; > if (__n) > { > _M_check_length(size_type(0), __n, "basic_string::append"); > const size_type __len = __n + this->size(); > if (__len > this->capacity() || _M_rep()->_M_is_shared()) > { > if (_M_disjunct(__s)) > this->reserve(__len); > else > { > const size_type __off = __s - _M_data(); > this->reserve(__len); > __s = _M_data() + __off; > } > } > _M_copy(_M_data() + this->size(), __s, __n); > _M_rep()->_M_set_length_and_sharable(__len); > } > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > append(const basic_string& __str) > { > const size_type __size = __str.size(); > if (__size) > { > const size_type __len = __size + this->size(); > if (__len > this->capacity() || _M_rep()->_M_is_shared()) > this->reserve(__len); > _M_copy(_M_data() + this->size(), __str._M_data(), __size); > _M_rep()->_M_set_length_and_sharable(__len); > } > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > append(const basic_string& __str, size_type __pos, size_type __n) > { > __str._M_check(__pos, "basic_string::append"); > __n = __str._M_limit(__pos, __n); > if (__n) > { > const size_type __len = __n + this->size(); > if (__len > this->capacity() || _M_rep()->_M_is_shared()) > this->reserve(__len); > _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n); > _M_rep()->_M_set_length_and_sharable(__len); > } > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > insert(size_type __pos, const _CharT* __s, size_type __n) > { > ; > _M_check(__pos, "basic_string::insert"); > _M_check_length(size_type(0), __n, "basic_string::insert"); > if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) > return _M_replace_safe(__pos, size_type(0), __s, __n); > else > { > > const size_type __off = __s - _M_data(); > _M_mutate(__pos, 0, __n); > __s = _M_data() + __off; > _CharT* __p = _M_data() + __pos; > if (__s + __n <= __p) > _M_copy(__p, __s, __n); > else if (__s >= __p) > _M_copy(__p, __s + __n, __n); > else > { > const size_type __nleft = __p - __s; > _M_copy(__p, __s, __nleft); > _M_copy(__p + __nleft, __p + __n, __n - __nleft); > } > return *this; > } > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::iterator > basic_string<_CharT, _Traits, _Alloc>:: > erase(iterator __first, iterator __last) > { > > ; > > > > > const size_type __size = __last - __first; > if (__size) > { > const size_type __pos = __first - _M_ibegin(); > _M_mutate(__pos, __size, size_type(0)); > _M_rep()->_M_set_leaked(); > return iterator(_M_data() + __pos); > } > else > return __first; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > replace(size_type __pos, size_type __n1, const _CharT* __s, > size_type __n2) > { > ; > _M_check(__pos, "basic_string::replace"); > __n1 = _M_limit(__pos, __n1); > _M_check_length(__n1, __n2, "basic_string::replace"); > bool __left; > if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) > return _M_replace_safe(__pos, __n1, __s, __n2); > else if ((__left = __s + __n2 <= _M_data() + __pos) > || _M_data() + __pos + __n1 <= __s) > { > > size_type __off = __s - _M_data(); > __left ? __off : (__off += __n2 - __n1); > _M_mutate(__pos, __n1, __n2); > _M_copy(_M_data() + __pos, _M_data() + __off, __n2); > return *this; > } > else > { > > const basic_string __tmp(__s, __n2); > return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2); > } > } > > template<typename _CharT, typename _Traits, typename _Alloc> > void > basic_string<_CharT, _Traits, _Alloc>::_Rep:: > _M_destroy(const _Alloc& __a) throw () > { > const size_type __size = sizeof(_Rep_base) + > (this->_M_capacity + 1) * sizeof(_CharT); > _Raw_bytes_alloc(__a).deallocate(reinterpret_cast<char*>(this), __size); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > void > basic_string<_CharT, _Traits, _Alloc>:: > _M_leak_hard() > { > > if (_M_rep() == &_S_empty_rep()) > return; > > if (_M_rep()->_M_is_shared()) > _M_mutate(0, 0, 0); > _M_rep()->_M_set_leaked(); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > void > basic_string<_CharT, _Traits, _Alloc>:: > _M_mutate(size_type __pos, size_type __len1, size_type __len2) > { > const size_type __old_size = this->size(); > const size_type __new_size = __old_size + __len2 - __len1; > const size_type __how_much = __old_size - __pos - __len1; > > if (__new_size > this->capacity() || _M_rep()->_M_is_shared()) > { > > const allocator_type __a = get_allocator(); > _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a); > > if (__pos) > _M_copy(__r->_M_refdata(), _M_data(), __pos); > if (__how_much) > _M_copy(__r->_M_refdata() + __pos + __len2, > _M_data() + __pos + __len1, __how_much); > > _M_rep()->_M_dispose(__a); > _M_data(__r->_M_refdata()); > } > else if (__how_much && __len1 != __len2) > { > > _M_move(_M_data() + __pos + __len2, > _M_data() + __pos + __len1, __how_much); > } > _M_rep()->_M_set_length_and_sharable(__new_size); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > void > basic_string<_CharT, _Traits, _Alloc>:: > reserve(size_type __res) > { > if (__res != this->capacity() || _M_rep()->_M_is_shared()) > { > > if (__res < this->size()) > __res = this->size(); > const allocator_type __a = get_allocator(); > _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size()); > _M_rep()->_M_dispose(__a); > _M_data(__tmp); > } > } > > template<typename _CharT, typename _Traits, typename _Alloc> > void > basic_string<_CharT, _Traits, _Alloc>:: > swap(basic_string& __s) > { > if (_M_rep()->_M_is_leaked()) > _M_rep()->_M_set_sharable(); > if (__s._M_rep()->_M_is_leaked()) > __s._M_rep()->_M_set_sharable(); > if (this->get_allocator() == __s.get_allocator()) > { > _CharT* __tmp = _M_data(); > _M_data(__s._M_data()); > __s._M_data(__tmp); > } > > else > { > const basic_string __tmp1(_M_ibegin(), _M_iend(), > __s.get_allocator()); > const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(), > this->get_allocator()); > *this = __tmp2; > __s = __tmp1; > } > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::_Rep* > basic_string<_CharT, _Traits, _Alloc>::_Rep:: > _S_create(size_type __capacity, size_type __old_capacity, > const _Alloc& __alloc) > { > > > if (__capacity > _S_max_size) > __throw_length_error(("basic_string::_S_create")); ># 579 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_string.tcc" 3 > const size_type __pagesize = 4096; > const size_type __malloc_header_size = 4 * sizeof(void*); > > > > > > > > if (__capacity > __old_capacity && __capacity < 2 * __old_capacity) > __capacity = 2 * __old_capacity; > > > > > size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); > > const size_type __adj_size = __size + __malloc_header_size; > if (__adj_size > __pagesize && __capacity > __old_capacity) > { > const size_type __extra = __pagesize - __adj_size % __pagesize; > __capacity += __extra / sizeof(_CharT); > > if (__capacity > _S_max_size) > __capacity = _S_max_size; > __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); > } > > > > void* __place = _Raw_bytes_alloc(__alloc).allocate(__size); > _Rep *__p = new (__place) _Rep; > __p->_M_capacity = __capacity; > > > > > > > > __p->_M_set_sharable(); > return __p; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > _CharT* > basic_string<_CharT, _Traits, _Alloc>::_Rep:: > _M_clone(const _Alloc& __alloc, size_type __res) > { > > const size_type __requested_cap = this->_M_length + __res; > _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity, > __alloc); > if (this->_M_length) > _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length); > > __r->_M_set_length_and_sharable(this->_M_length); > return __r->_M_refdata(); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > void > basic_string<_CharT, _Traits, _Alloc>:: > resize(size_type __n, _CharT __c) > { > const size_type __size = this->size(); > _M_check_length(__size, __n, "basic_string::resize"); > if (__size < __n) > this->append(__n - __size, __c); > else if (__n < __size) > this->erase(__n); > > } > > template<typename _CharT, typename _Traits, typename _Alloc> > template<typename _InputIterator> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, > _InputIterator __k2, __false_type) > { > const basic_string __s(__k1, __k2); > const size_type __n1 = __i2 - __i1; > _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch"); > return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(), > __s.size()); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, > _CharT __c) > { > _M_check_length(__n1, __n2, "basic_string::_M_replace_aux"); > _M_mutate(__pos1, __n1, __n2); > if (__n2) > _M_assign(_M_data() + __pos1, __n2, __c); > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc>& > basic_string<_CharT, _Traits, _Alloc>:: > _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, > size_type __n2) > { > _M_mutate(__pos1, __n1, __n2); > if (__n2) > _M_copy(_M_data() + __pos1, __s, __n2); > return *this; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc> > operator+(const _CharT* __lhs, > const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { > ; > typedef basic_string<_CharT, _Traits, _Alloc> __string_type; > typedef typename __string_type::size_type __size_type; > const __size_type __len = _Traits::length(__lhs); > __string_type __str; > __str.reserve(__len + __rhs.size()); > __str.append(__lhs, __len); > __str.append(__rhs); > return __str; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_string<_CharT, _Traits, _Alloc> > operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) > { > typedef basic_string<_CharT, _Traits, _Alloc> __string_type; > typedef typename __string_type::size_type __size_type; > __string_type __str; > const __size_type __len = __rhs.size(); > __str.reserve(__len + 1); > __str.append(__size_type(1), __lhs); > __str.append(__rhs); > return __str; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > copy(_CharT* __s, size_type __n, size_type __pos) const > { > _M_check(__pos, "basic_string::copy"); > __n = _M_limit(__pos, __n); > ; > if (__n) > _M_copy(__s, _M_data() + __pos, __n); > > return __n; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find(const _CharT* __s, size_type __pos, size_type __n) const > { > ; > const size_type __size = this->size(); > const _CharT* __data = _M_data(); > > if (__n == 0) > return __pos <= __size ? __pos : npos; > > if (__n <= __size) > { > for (; __pos <= __size - __n; ++__pos) > if (traits_type::eq(__data[__pos], __s[0]) > && traits_type::compare(__data + __pos + 1, > __s + 1, __n - 1) == 0) > return __pos; > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find(_CharT __c, size_type __pos) const > { > size_type __ret = npos; > const size_type __size = this->size(); > if (__pos < __size) > { > const _CharT* __data = _M_data(); > const size_type __n = __size - __pos; > const _CharT* __p = traits_type::find(__data + __pos, __n, __c); > if (__p) > __ret = __p - __data; > } > return __ret; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > rfind(const _CharT* __s, size_type __pos, size_type __n) const > { > ; > const size_type __size = this->size(); > if (__n <= __size) > { > __pos = std::min(size_type(__size - __n), __pos); > const _CharT* __data = _M_data(); > do > { > if (traits_type::compare(__data + __pos, __s, __n) == 0) > return __pos; > } > while (__pos-- > 0); > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > rfind(_CharT __c, size_type __pos) const > { > size_type __size = this->size(); > if (__size) > { > if (--__size > __pos) > __size = __pos; > for (++__size; __size-- > 0; ) > if (traits_type::eq(_M_data()[__size], __c)) > return __size; > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find_first_of(const _CharT* __s, size_type __pos, size_type __n) const > { > ; > for (; __n && __pos < this->size(); ++__pos) > { > const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]); > if (__p) > return __pos; > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find_last_of(const _CharT* __s, size_type __pos, size_type __n) const > { > ; > size_type __size = this->size(); > if (__size && __n) > { > if (--__size > __pos) > __size = __pos; > do > { > if (traits_type::find(__s, __n, _M_data()[__size])) > return __size; > } > while (__size-- != 0); > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const > { > ; > for (; __pos < this->size(); ++__pos) > if (!traits_type::find(__s, __n, _M_data()[__pos])) > return __pos; > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find_first_not_of(_CharT __c, size_type __pos) const > { > for (; __pos < this->size(); ++__pos) > if (!traits_type::eq(_M_data()[__pos], __c)) > return __pos; > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const > { > ; > size_type __size = this->size(); > if (__size) > { > if (--__size > __pos) > __size = __pos; > do > { > if (!traits_type::find(__s, __n, _M_data()[__size])) > return __size; > } > while (__size--); > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > typename basic_string<_CharT, _Traits, _Alloc>::size_type > basic_string<_CharT, _Traits, _Alloc>:: > find_last_not_of(_CharT __c, size_type __pos) const > { > size_type __size = this->size(); > if (__size) > { > if (--__size > __pos) > __size = __pos; > do > { > if (!traits_type::eq(_M_data()[__size], __c)) > return __size; > } > while (__size--); > } > return npos; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > int > basic_string<_CharT, _Traits, _Alloc>:: > compare(size_type __pos, size_type __n, const basic_string& __str) const > { > _M_check(__pos, "basic_string::compare"); > __n = _M_limit(__pos, __n); > const size_type __osize = __str.size(); > const size_type __len = std::min(__n, __osize); > int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len); > if (!__r) > __r = _S_compare(__n, __osize); > return __r; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > int > basic_string<_CharT, _Traits, _Alloc>:: > compare(size_type __pos1, size_type __n1, const basic_string& __str, > size_type __pos2, size_type __n2) const > { > _M_check(__pos1, "basic_string::compare"); > __str._M_check(__pos2, "basic_string::compare"); > __n1 = _M_limit(__pos1, __n1); > __n2 = __str._M_limit(__pos2, __n2); > const size_type __len = std::min(__n1, __n2); > int __r = traits_type::compare(_M_data() + __pos1, > __str.data() + __pos2, __len); > if (!__r) > __r = _S_compare(__n1, __n2); > return __r; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > int > basic_string<_CharT, _Traits, _Alloc>:: > compare(const _CharT* __s) const > { > ; > const size_type __size = this->size(); > const size_type __osize = traits_type::length(__s); > const size_type __len = std::min(__size, __osize); > int __r = traits_type::compare(_M_data(), __s, __len); > if (!__r) > __r = _S_compare(__size, __osize); > return __r; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > int > basic_string <_CharT, _Traits, _Alloc>:: > compare(size_type __pos, size_type __n1, const _CharT* __s) const > { > ; > _M_check(__pos, "basic_string::compare"); > __n1 = _M_limit(__pos, __n1); > const size_type __osize = traits_type::length(__s); > const size_type __len = std::min(__n1, __osize); > int __r = traits_type::compare(_M_data() + __pos, __s, __len); > if (!__r) > __r = _S_compare(__n1, __osize); > return __r; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > int > basic_string <_CharT, _Traits, _Alloc>:: > compare(size_type __pos, size_type __n1, const _CharT* __s, > size_type __n2) const > { > ; > _M_check(__pos, "basic_string::compare"); > __n1 = _M_limit(__pos, __n1); > const size_type __len = std::min(__n1, __n2); > int __r = traits_type::compare(_M_data() + __pos, __s, __len); > if (!__r) > __r = _S_compare(__n1, __n2); > return __r; > } > > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_istream<_CharT, _Traits>& > operator>>(basic_istream<_CharT, _Traits>& __in, > basic_string<_CharT, _Traits, _Alloc>& __str) > { > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef basic_string<_CharT, _Traits, _Alloc> __string_type; > typedef typename __istream_type::ios_base __ios_base; > typedef typename __istream_type::int_type __int_type; > typedef typename __string_type::size_type __size_type; > typedef ctype<_CharT> __ctype_type; > typedef typename __ctype_type::ctype_base __ctype_base; > > __size_type __extracted = 0; > typename __ios_base::iostate __err = __ios_base::goodbit; > typename __istream_type::sentry __cerb(__in, false); > if (__cerb) > { > try > { > > __str.erase(); > _CharT __buf[128]; > __size_type __len = 0; > const streamsize __w = __in.width(); > const __size_type __n = __w > 0 ? static_cast<__size_type>(__w) > : __str.max_size(); > const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); > const __int_type __eof = _Traits::eof(); > __int_type __c = __in.rdbuf()->sgetc(); > > while (__extracted < __n > && !_Traits::eq_int_type(__c, __eof) > && !__ct.is(__ctype_base::space, > _Traits::to_char_type(__c))) > { > if (__len == sizeof(__buf) / sizeof(_CharT)) > { > __str.append(__buf, sizeof(__buf) / sizeof(_CharT)); > __len = 0; > } > __buf[__len++] = _Traits::to_char_type(__c); > ++__extracted; > __c = __in.rdbuf()->snextc(); > } > __str.append(__buf, __len); > > if (_Traits::eq_int_type(__c, __eof)) > __err |= __ios_base::eofbit; > __in.width(0); > } > catch(__cxxabiv1::__forced_unwind&) > { > __in._M_setstate(__ios_base::badbit); > throw; > } > catch(...) > { > > > > __in._M_setstate(__ios_base::badbit); > } > } > > if (!__extracted) > __err |= __ios_base::failbit; > if (__err) > __in.setstate(__err); > return __in; > } > > template<typename _CharT, typename _Traits, typename _Alloc> > basic_istream<_CharT, _Traits>& > getline(basic_istream<_CharT, _Traits>& __in, > basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) > { > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef basic_string<_CharT, _Traits, _Alloc> __string_type; > typedef typename __istream_type::ios_base __ios_base; > typedef typename __istream_type::int_type __int_type; > typedef typename __string_type::size_type __size_type; > > __size_type __extracted = 0; > const __size_type __n = __str.max_size(); > typename __ios_base::iostate __err = __ios_base::goodbit; > typename __istream_type::sentry __cerb(__in, true); > if (__cerb) > { > try > { > __str.erase(); > const __int_type __idelim = _Traits::to_int_type(__delim); > const __int_type __eof = _Traits::eof(); > __int_type __c = __in.rdbuf()->sgetc(); > > while (__extracted < __n > && !_Traits::eq_int_type(__c, __eof) > && !_Traits::eq_int_type(__c, __idelim)) > { > __str += _Traits::to_char_type(__c); > ++__extracted; > __c = __in.rdbuf()->snextc(); > } > > if (_Traits::eq_int_type(__c, __eof)) > __err |= __ios_base::eofbit; > else if (_Traits::eq_int_type(__c, __idelim)) > { > ++__extracted; > __in.rdbuf()->sbumpc(); > } > else > __err |= __ios_base::failbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > __in._M_setstate(__ios_base::badbit); > throw; > } > catch(...) > { > > > > __in._M_setstate(__ios_base::badbit); > } > } > if (!__extracted) > __err |= __ios_base::failbit; > if (__err) > __in.setstate(__err); > return __in; > } > > > > > extern template class basic_string<char>; > extern template > basic_istream<char>& > operator>>(basic_istream<char>&, string&); > extern template > basic_ostream<char>& > operator<<(basic_ostream<char>&, const string&); > extern template > basic_istream<char>& > getline(basic_istream<char>&, string&, char); > extern template > basic_istream<char>& > getline(basic_istream<char>&, string&); > > > extern template class basic_string<wchar_t>; > extern template > basic_istream<wchar_t>& > operator>>(basic_istream<wchar_t>&, wstring&); > extern template > basic_ostream<wchar_t>& > operator<<(basic_ostream<wchar_t>&, const wstring&); > extern template > basic_istream<wchar_t>& > getline(basic_istream<wchar_t>&, wstring&, wchar_t); > extern template > basic_istream<wchar_t>& > getline(basic_istream<wchar_t>&, wstring&); > > > > >} ># 56 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 2 3 ># 51 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 2 ># 67 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" > > > > > >class QCharRef; >class QRegExp; >class QRegularExpression; >class QString; >class QStringList; >class QTextCodec; >class QStringRef; >template <typename T> class QVector; > >class QLatin1String >{ >public: > inline explicit QLatin1String(const char *s) : m_size(s ? int(strlen(s)) : 0), m_data(s) {} > inline explicit QLatin1String(const char *s, int sz) : m_size(sz), m_data(s) {} > inline explicit QLatin1String(const QByteArray &s) : m_size(int(qstrnlen(s.constData(), s.size()))), m_data(s.constData()) {} > > inline const char *latin1() const { return m_data; } > inline int size() const { return m_size; } > inline const char *data() const { return m_data; } > > inline bool operator==(const QString &s) const; > inline bool operator!=(const QString &s) const; > inline bool operator>(const QString &s) const; > inline bool operator<(const QString &s) const; > inline bool operator>=(const QString &s) const; > inline bool operator<=(const QString &s) const; > > > inline bool operator==(const char *s) const; > inline bool operator!=(const char *s) const; > inline bool operator<(const char *s) const; > inline bool operator>(const char *s) const; > inline bool operator<=(const char *s) const; > inline bool operator>=(const char *s) const; > > inline bool operator==(const QByteArray &s) const; > inline bool operator!=(const QByteArray &s) const; > inline bool operator<(const QByteArray &s) const; > inline bool operator>(const QByteArray &s) const; > inline bool operator<=(const QByteArray &s) const; > inline bool operator>=(const QByteArray &s) const; > > >private: > int m_size; > const char *m_data; >}; >template<> class QTypeInfo<QLatin1String > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QLatin1String)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QLatin1String) }; static inline const char *name() { return "QLatin1String"; } }; > > >typedef QLatin1String QLatin1Literal; > > >typedef QTypedArrayData<ushort> QStringData; ># 147 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" >typedef ushort qunicodechar; > > > >enum { > q_static_assert_result152 ># 151 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" > = sizeof(QStaticAssertFailure<!!(sizeof(qunicodechar) == 2)>)} > ; ># 205 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" >template <int N> >struct QStaticStringData >{ > QArrayData str; > qunicodechar data[N + 1]; > > QStringData *data_ptr() const > { > ((!(str.ref.isStatic())) ? qt_assert("str.ref.isStatic()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",213) : qt_noop()); > return const_cast<QStringData *>(static_cast<const QStringData*>(&str)); > } >}; > >struct QStringDataPtr >{ > QStringData *ptr; >}; > >class __attribute__((visibility("default"))) QString >{ >public: > typedef QStringData Data; > > inline QString(); > explicit QString(const QChar *unicode, int size = -1); > QString(QChar c); > QString(int size, QChar c); > inline QString(QLatin1String latin1); > inline QString(const QString &); > inline ~QString(); > QString &operator=(QChar c); > QString &operator=(const QString &); > inline QString &operator=(QLatin1String latin1); > > > > > > inline void swap(QString &other) { qSwap(d, other.d); } > inline int size() const { return d->size; } > inline int count() const { return d->size; } > inline int length() const; > inline bool isEmpty() const; > void resize(int size); > > QString &fill(QChar c, int size = -1); > void truncate(int pos); > void chop(int n); > > int capacity() const; > inline void reserve(int size); > inline void squeeze(); > > inline const QChar *unicode() const; > inline QChar *data(); > inline const QChar *data() const; > inline const QChar *constData() const; > > inline void detach(); > inline bool isDetached() const; > inline bool isSharedWith(const QString &other) const { return d == other.d; } > void clear(); > > inline const QChar at(int i) const; > const QChar operator[](int i) const; > QCharRef operator[](int i); > const QChar operator[](uint i) const; > QCharRef operator[](uint i); > > QString arg(qlonglong a, int fieldwidth=0, int base=10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(qulonglong a, int fieldwidth=0, int base=10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(long a, int fieldwidth=0, int base=10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(ulong a, int fieldwidth=0, int base=10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(int a, int fieldWidth = 0, int base = 10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(uint a, int fieldWidth = 0, int base = 10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(short a, int fieldWidth = 0, int base = 10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(ushort a, int fieldWidth = 0, int base = 10, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(double a, int fieldWidth = 0, char fmt = 'g', int prec = -1, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(char a, int fieldWidth = 0, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(QChar a, int fieldWidth = 0, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a, int fieldWidth = 0, > QChar fillChar = QLatin1Char(' ')) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6, > const QString &a7) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6, > const QString &a7, const QString &a8) const __attribute__ ((__warn_unused_result__)); > QString arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6, > const QString &a7, const QString &a8, const QString &a9) const __attribute__ ((__warn_unused_result__)); > > QString &vsprintf(const char *format, va_list ap) > > __attribute__ ((format (printf, 2, 0))) > > ; > QString &sprintf(const char *format, ...) > > __attribute__ ((format (printf, 2, 3))) > > ; > > int indexOf(QChar c, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int indexOf(const QString &s, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int indexOf(QLatin1String s, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int indexOf(const QStringRef &s, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(QChar c, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(const QString &s, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(QLatin1String s, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(const QStringRef &s, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > inline bool contains(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > inline bool contains(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > inline bool contains(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int count(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int count(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int count(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > > int indexOf(const QRegExp &, int from = 0) const; > int lastIndexOf(const QRegExp &, int from = -1) const; > inline bool contains(const QRegExp &rx) const { return indexOf(rx) != -1; } > int count(const QRegExp &) const; > > int indexOf(QRegExp &, int from = 0) const; > int lastIndexOf(QRegExp &, int from = -1) const; > inline bool contains(QRegExp &rx) const { return indexOf(rx) != -1; } > > > > int indexOf(const QRegularExpression &re, int from = 0) const; > int lastIndexOf(const QRegularExpression &re, int from = -1) const; > bool contains(const QRegularExpression &re) const; > int count(const QRegularExpression &re) const; > > > enum SectionFlag { > SectionDefault = 0x00, > SectionSkipEmpty = 0x01, > SectionIncludeLeadingSep = 0x02, > SectionIncludeTrailingSep = 0x04, > SectionCaseInsensitiveSeps = 0x08 > }; > typedef QFlags<SectionFlag> SectionFlags; > > QString section(QChar sep, int start, int end = -1, SectionFlags flags = SectionDefault) const; > QString section(const QString &in_sep, int start, int end = -1, SectionFlags flags = SectionDefault) const; > > QString section(const QRegExp ®, int start, int end = -1, SectionFlags flags = SectionDefault) const; > > > QString section(const QRegularExpression &re, int start, int end = -1, SectionFlags flags = SectionDefault) const; > > QString left(int n) const __attribute__ ((__warn_unused_result__)); > QString right(int n) const __attribute__ ((__warn_unused_result__)); > QString mid(int position, int n = -1) const __attribute__ ((__warn_unused_result__)); > QStringRef leftRef(int n) const __attribute__ ((__warn_unused_result__)); > QStringRef rightRef(int n) const __attribute__ ((__warn_unused_result__)); > QStringRef midRef(int position, int n = -1) const __attribute__ ((__warn_unused_result__)); > > bool startsWith(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool startsWith(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool startsWith(QLatin1String s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool startsWith(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(QLatin1String s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > QString leftJustified(int width, QChar fill = QLatin1Char(' '), bool trunc = false) const __attribute__ ((__warn_unused_result__)); > QString rightJustified(int width, QChar fill = QLatin1Char(' '), bool trunc = false) const __attribute__ ((__warn_unused_result__)); > > QString toLower() const __attribute__ ((__warn_unused_result__)); > QString toUpper() const __attribute__ ((__warn_unused_result__)); > QString toCaseFolded() const __attribute__ ((__warn_unused_result__)); > > QString trimmed() const __attribute__ ((__warn_unused_result__)); > QString simplified() const __attribute__ ((__warn_unused_result__)); > QString toHtmlEscaped() const __attribute__ ((__warn_unused_result__)); > > QString &insert(int i, QChar c); > QString &insert(int i, const QChar *uc, int len); > inline QString &insert(int i, const QString &s) { return insert(i, s.constData(), s.length()); } > QString &insert(int i, QLatin1String s); > QString &append(QChar c); > QString &append(const QString &s); > QString &append(const QStringRef &s); > QString &append(QLatin1String s); > inline QString &prepend(QChar c) { return insert(0, c); } > inline QString &prepend(const QString &s) { return insert(0, s); } > inline QString &prepend(QLatin1String s) { return insert(0, s); } > > inline QString &operator+=(QChar c) { > if (d->ref.isShared() || d->size + 1 > capacity()) > reallocData(uint(d->size) + 2u, true); > d->data()[d->size++] = c.unicode(); > d->data()[d->size] = '\0'; > return *this; > } > > inline QString &operator+=(QChar::SpecialCharacter c) { return append(QChar(c)); } > inline QString &operator+=(const QString &s) { return append(s); } > inline QString &operator+=(const QStringRef &s) { return append(s); } > inline QString &operator+=(QLatin1String s) { return append(s); } > > QString &remove(int i, int len); > QString &remove(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &remove(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(int i, int len, QChar after); > QString &replace(int i, int len, const QChar *s, int slen); > QString &replace(int i, int len, const QString &after); > QString &replace(QChar before, QChar after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(const QChar *before, int blen, const QChar *after, int alen, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(QLatin1String before, QLatin1String after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(QLatin1String before, const QString &after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(const QString &before, QLatin1String after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(const QString &before, const QString &after, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(QChar c, const QString &after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > QString &replace(QChar c, QLatin1String after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > > QString &replace(const QRegExp &rx, const QString &after); > inline QString &remove(const QRegExp &rx) > { return replace(rx, QString()); } > > > QString &replace(const QRegularExpression &re, const QString &after); > inline QString &remove(const QRegularExpression &re) > { return replace(re, QString()); } > > > enum SplitBehavior { KeepEmptyParts, SkipEmptyParts }; > > QStringList split(const QString &sep, SplitBehavior behavior = KeepEmptyParts, > Qt::CaseSensitivity cs = Qt::CaseSensitive) const __attribute__ ((__warn_unused_result__)); > QStringList split(QChar sep, SplitBehavior behavior = KeepEmptyParts, > Qt::CaseSensitivity cs = Qt::CaseSensitive) const __attribute__ ((__warn_unused_result__)); > > QStringList split(const QRegExp &sep, SplitBehavior behavior = KeepEmptyParts) const __attribute__ ((__warn_unused_result__)); > > > QStringList split(const QRegularExpression &sep, SplitBehavior behavior = KeepEmptyParts) const __attribute__ ((__warn_unused_result__)); > > enum NormalizationForm { > NormalizationForm_D, > NormalizationForm_C, > NormalizationForm_KD, > NormalizationForm_KC > }; > QString normalized(NormalizationForm mode, QChar::UnicodeVersion version = QChar::Unicode_Unassigned) const __attribute__ ((__warn_unused_result__)); > > QString repeated(int times) const; > > const ushort *utf16() const; > > QByteArray toLatin1() const __attribute__ ((__warn_unused_result__)); > QByteArray toUtf8() const __attribute__ ((__warn_unused_result__)); > QByteArray toLocal8Bit() const __attribute__ ((__warn_unused_result__)); > QVector<uint> toUcs4() const __attribute__ ((__warn_unused_result__)); > > > static inline QString fromLatin1(const char *str, int size = -1) > { > QStringDataPtr dataPtr = { fromLatin1_helper(str, (str && size == -1) ? int(strlen(str)) : size) }; > return QString(dataPtr); > } > static inline QString fromUtf8(const char *str, int size = -1) > { > return fromUtf8_helper(str, (str && size == -1) ? int(strlen(str)) : size); > } > static inline QString fromLocal8Bit(const char *str, int size = -1) > { > return fromLocal8Bit_helper(str, (str && size == -1) ? int(strlen(str)) : size); > } > static inline QString fromLatin1(const QByteArray &str) > { return fromLatin1(str.data(), qstrnlen(str.constData(), str.size())); } > static inline QString fromUtf8(const QByteArray &str) > { return fromUtf8(str.data(), qstrnlen(str.constData(), str.size())); } > static inline QString fromLocal8Bit(const QByteArray &str) > { return fromLocal8Bit(str.data(), qstrnlen(str.constData(), str.size())); } > static QString fromUtf16(const ushort *, int size = -1); > static QString fromUcs4(const uint *, int size = -1); > static QString fromRawData(const QChar *, int size); > > > static inline QString fromAscii(const char *str, int size = -1) > { return fromLatin1(str, size); } > static inline QString fromAscii(const QByteArray &str) > { return fromLatin1(str); } > QByteArray toAscii() const __attribute__ ((__warn_unused_result__)) > { return toLatin1(); } > > > inline int toWCharArray(wchar_t *array) const; > static inline QString fromWCharArray(const wchar_t *string, int size = -1) __attribute__ ((__warn_unused_result__)); > > QString &setRawData(const QChar *unicode, int size); > QString &setUnicode(const QChar *unicode, int size); > inline QString &setUtf16(const ushort *utf16, int size); > > int compare(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int compare(QLatin1String other, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > static inline int compare(const QString &s1, const QString &s2, Qt::CaseSensitivity cs = Qt::CaseSensitive) > { return s1.compare(s2, cs); } > > static inline int compare(const QString &s1, QLatin1String s2, > Qt::CaseSensitivity cs = Qt::CaseSensitive) > { return s1.compare(s2, cs); } > static inline int compare(QLatin1String s1, const QString &s2, > Qt::CaseSensitivity cs = Qt::CaseSensitive) > { return -s2.compare(s1, cs); } > > int compare(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > static int compare(const QString &s1, const QStringRef &s2, > Qt::CaseSensitivity = Qt::CaseSensitive); > > int localeAwareCompare(const QString& s) const; > static int localeAwareCompare(const QString& s1, const QString& s2) > { return s1.localeAwareCompare(s2); } > > int localeAwareCompare(const QStringRef &s) const; > static int localeAwareCompare(const QString& s1, const QStringRef& s2); > > short toShort(bool *ok=0, int base=10) const; > ushort toUShort(bool *ok=0, int base=10) const; > int toInt(bool *ok=0, int base=10) const; > uint toUInt(bool *ok=0, int base=10) const; > long toLong(bool *ok=0, int base=10) const; > ulong toULong(bool *ok=0, int base=10) const; > qlonglong toLongLong(bool *ok=0, int base=10) const; > qulonglong toULongLong(bool *ok=0, int base=10) const; > float toFloat(bool *ok=0) const; > double toDouble(bool *ok=0) const; > > QString &setNum(short, int base=10); > QString &setNum(ushort, int base=10); > QString &setNum(int, int base=10); > QString &setNum(uint, int base=10); > QString &setNum(long, int base=10); > QString &setNum(ulong, int base=10); > QString &setNum(qlonglong, int base=10); > QString &setNum(qulonglong, int base=10); > QString &setNum(float, char f='g', int prec=6); > QString &setNum(double, char f='g', int prec=6); > > static QString number(int, int base=10); > static QString number(uint, int base=10); > static QString number(long, int base=10); > static QString number(ulong, int base=10); > static QString number(qlonglong, int base=10); > static QString number(qulonglong, int base=10); > static QString number(double, char f='g', int prec=6); > > friend __attribute__((visibility("default"))) bool operator==(const QString &s1, const QString &s2); > friend __attribute__((visibility("default"))) bool operator<(const QString &s1, const QString &s2); > friend inline bool operator>(const QString &s1, const QString &s2) { return s2 < s1; } > friend inline bool operator!=(const QString &s1, const QString &s2) { return !(s1 == s2); } > friend inline bool operator<=(const QString &s1, const QString &s2) { return !(s1 > s2); } > friend inline bool operator>=(const QString &s1, const QString &s2) { return !(s1 < s2); } > > bool operator==(QLatin1String s) const; > bool operator<(QLatin1String s) const; > bool operator>(QLatin1String s) const; > inline bool operator!=(QLatin1String s) const { return !operator==(s); } > inline bool operator<=(QLatin1String s) const { return !operator>(s); } > inline bool operator>=(QLatin1String s) const { return !operator<(s); } > > > > inline QString(const char *ch) > : d(fromAscii_helper(ch, ch ? int(strlen(ch)) : -1)) > {} > inline QString(const QByteArray &a) > : d(fromAscii_helper(a.constData(), qstrnlen(a.constData(), a.size()))) > {} > inline QString &operator=(const char *ch) > { return (*this = fromUtf8(ch)); } > inline QString &operator=(const QByteArray &a) > { return (*this = fromUtf8(a)); } > inline QString &operator=(char c) > { return (*this = QChar::fromLatin1(c)); } > > > inline QString &prepend(const char *s) > { return prepend(QString::fromUtf8(s)); } > inline QString &prepend(const QByteArray &s) > { return prepend(QString::fromUtf8(s)); } > inline QString &append(const char *s) > { return append(QString::fromUtf8(s)); } > inline QString &append(const QByteArray &s) > { return append(QString::fromUtf8(s)); } > inline QString &operator+=(const char *s) > { return append(QString::fromUtf8(s)); } > inline QString &operator+=(const QByteArray &s) > { return append(QString::fromUtf8(s)); } > inline QString &operator+=(char c) > { return append(QChar::fromLatin1(c)); } > > inline bool operator==(const char *s) const; > inline bool operator!=(const char *s) const; > inline bool operator<(const char *s) const; > inline bool operator<=(const char *s) const; > inline bool operator>(const char *s) const; > inline bool operator>=(const char *s) const; > > inline bool operator==(const QByteArray &s) const; > inline bool operator!=(const QByteArray &s) const; > inline bool operator<(const QByteArray &s) const; > inline bool operator>(const QByteArray &s) const; > inline bool operator<=(const QByteArray &s) const; > inline bool operator>=(const QByteArray &s) const; > > friend inline bool operator==(const char *s1, const QString &s2); > friend inline bool operator!=(const char *s1, const QString &s2); > friend inline bool operator<(const char *s1, const QString &s2); > friend inline bool operator>(const char *s1, const QString &s2); > friend inline bool operator<=(const char *s1, const QString &s2); > friend inline bool operator>=(const char *s1, const QString &s2); > > friend inline bool operator==(const char *s1, const QStringRef &s2); > friend inline bool operator!=(const char *s1, const QStringRef &s2); > friend inline bool operator<(const char *s1, const QStringRef &s2); > friend inline bool operator>(const char *s1, const QStringRef &s2); > friend inline bool operator<=(const char *s1, const QStringRef &s2); > friend inline bool operator>=(const char *s1, const QStringRef &s2); > > > typedef QChar *iterator; > typedef const QChar *const_iterator; > typedef iterator Iterator; > typedef const_iterator ConstIterator; > iterator begin(); > const_iterator begin() const; > const_iterator cbegin() const; > const_iterator constBegin() const; > iterator end(); > const_iterator end() const; > const_iterator cend() const; > const_iterator constEnd() const; > > > typedef const QChar & const_reference; > typedef QChar & reference; > typedef QChar value_type; > inline void push_back(QChar c) { append(c); } > inline void push_back(const QString &s) { append(s); } > inline void push_front(QChar c) { prepend(c); } > inline void push_front(const QString &s) { prepend(s); } > > static inline QString fromStdString(const std::string &s); > inline std::string toStdString() const; > static inline QString fromStdWString(const std::wstring &s); > inline std::wstring toStdWString() const; > > > struct Null { }; > static const Null null; > inline QString(const Null &): d(Data::sharedNull()) {} > inline QString &operator=(const Null &) { *this = QString(); return *this; } > inline bool isNull() const { return d == Data::sharedNull(); } > > > bool isSimpleText() const; > bool isRightToLeft() const; > > QString(int size, Qt::Initialization); > inline QString(QStringDataPtr dd) : d(dd.ptr) {} > >private: ># 704 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" > Data *d; > > void reallocData(uint alloc, bool grow = false); > void expand(int i); > void updateProperties() const; > QString multiArg(int numArgs, const QString **args) const; > static int compare_helper(const QChar *data1, int length1, > const QChar *data2, int length2, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > static int compare_helper(const QChar *data1, int length1, > const char *data2, int length2, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > static int compare_helper(const QChar *data1, int length1, > QLatin1String s2, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > static int localeAwareCompare_helper(const QChar *data1, int length1, > const QChar *data2, int length2); > static Data *fromLatin1_helper(const char *str, int size = -1); > static Data *fromAscii_helper(const char *str, int size = -1); > static QString fromUtf8_helper(const char *str, int size); > static QString fromLocal8Bit_helper(const char *, int size); > static int toUcs4_helper(const ushort *uc, int length, uint *out); > void replace_helper(uint *indices, int nIndices, int blen, const QChar *after, int alen); > friend class QCharRef; > friend class QTextCodec; > friend class QStringRef; > friend class QByteArray; > friend struct QAbstractConcatenable; > >public: > typedef Data * DataPtr; > inline DataPtr &data_ptr() { return d; } >}; > >inline QString::QString(QLatin1String aLatin1) : d(fromLatin1_helper(aLatin1.latin1(), aLatin1.size())) >{ } >inline int QString::length() const >{ return d->size; } >inline const QChar QString::at(int i) const >{ ((!(uint(i) < uint(size()))) ? qt_assert("uint(i) < uint(size())","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",743) : qt_noop()); return d->data()[i]; } >inline const QChar QString::operator[](int i) const >{ ((!(uint(i) < uint(size()))) ? qt_assert("uint(i) < uint(size())","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",745) : qt_noop()); return d->data()[i]; } >inline const QChar QString::operator[](uint i) const >{ ((!(i < uint(size()))) ? qt_assert("i < uint(size())","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",747) : qt_noop()); return d->data()[i]; } >inline bool QString::isEmpty() const >{ return d->size == 0; } >inline const QChar *QString::unicode() const >{ return reinterpret_cast<const QChar*>(d->data()); } >inline const QChar *QString::data() const >{ return reinterpret_cast<const QChar*>(d->data()); } >inline QChar *QString::data() >{ detach(); return reinterpret_cast<QChar*>(d->data()); } >inline const QChar *QString::constData() const >{ return reinterpret_cast<const QChar*>(d->data()); } >inline void QString::detach() >{ if (d->ref.isShared() || !d->isMutable()) reallocData(uint(d->size) + 1u); } >inline bool QString::isDetached() const >{ return !d->ref.isShared(); } >inline QString &QString::operator=(QLatin1String s) >{ > *this = fromLatin1(s.latin1(), s.size()); > return *this; >} >inline void QString::clear() >{ if (!isNull()) *this = QString(); } >inline QString::QString(const QString &other) : d(other.d) >{ ((!(&other != this)) ? qt_assert("&other != this","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",770) : qt_noop()); d->ref.ref(); } >inline int QString::capacity() const >{ int realCapacity = d->capacity(); return realCapacity ? realCapacity - 1 : 0; } >inline QString &QString::setNum(short n, int base) >{ return setNum(qlonglong(n), base); } >inline QString &QString::setNum(ushort n, int base) >{ return setNum(qulonglong(n), base); } >inline QString &QString::setNum(int n, int base) >{ return setNum(qlonglong(n), base); } >inline QString &QString::setNum(uint n, int base) >{ return setNum(qulonglong(n), base); } >inline QString &QString::setNum(long n, int base) >{ return setNum(qlonglong(n), base); } >inline QString &QString::setNum(ulong n, int base) >{ return setNum(qulonglong(n), base); } >inline QString &QString::setNum(float n, char f, int prec) >{ return setNum(double(n),f,prec); } >inline QString QString::arg(int a, int fieldWidth, int base, QChar fillChar) const >{ return arg(qlonglong(a), fieldWidth, base, fillChar); } >inline QString QString::arg(uint a, int fieldWidth, int base, QChar fillChar) const >{ return arg(qulonglong(a), fieldWidth, base, fillChar); } >inline QString QString::arg(long a, int fieldWidth, int base, QChar fillChar) const >{ return arg(qlonglong(a), fieldWidth, base, fillChar); } >inline QString QString::arg(ulong a, int fieldWidth, int base, QChar fillChar) const >{ return arg(qulonglong(a), fieldWidth, base, fillChar); } >inline QString QString::arg(short a, int fieldWidth, int base, QChar fillChar) const >{ return arg(qlonglong(a), fieldWidth, base, fillChar); } >inline QString QString::arg(ushort a, int fieldWidth, int base, QChar fillChar) const >{ return arg(qulonglong(a), fieldWidth, base, fillChar); } >inline QString QString::arg(const QString &a1, const QString &a2) const >{ const QString *args[2] = { &a1, &a2 }; return multiArg(2, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3) const >{ const QString *args[3] = { &a1, &a2, &a3 }; return multiArg(3, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4) const >{ const QString *args[4] = { &a1, &a2, &a3, &a4 }; return multiArg(4, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5) const >{ const QString *args[5] = { &a1, &a2, &a3, &a4, &a5 }; return multiArg(5, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6) const >{ const QString *args[6] = { &a1, &a2, &a3, &a4, &a5, &a6 }; return multiArg(6, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6, > const QString &a7) const >{ const QString *args[7] = { &a1, &a2, &a3, &a4, &a5, &a6, &a7 }; return multiArg(7, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6, > const QString &a7, const QString &a8) const >{ const QString *args[8] = { &a1, &a2, &a3, &a4, &a5, &a6, &a7, &a8 }; return multiArg(8, args); } >inline QString QString::arg(const QString &a1, const QString &a2, const QString &a3, > const QString &a4, const QString &a5, const QString &a6, > const QString &a7, const QString &a8, const QString &a9) const >{ const QString *args[9] = { &a1, &a2, &a3, &a4, &a5, &a6, &a7, &a8, &a9 }; return multiArg(9, args); } > >inline QString QString::section(QChar asep, int astart, int aend, SectionFlags aflags) const >{ return section(QString(asep), astart, aend, aflags); } > >inline int QString::toWCharArray(wchar_t *array) const >{ > if (sizeof(wchar_t) == sizeof(QChar)) { > memcpy(array, d->data(), sizeof(QChar) * size()); > return size(); > } > return toUcs4_helper(d->data(), size(), reinterpret_cast<uint *>(array)); >} >inline QString QString::fromWCharArray(const wchar_t *string, int size) >{ > return sizeof(wchar_t) == sizeof(QChar) ? fromUtf16(reinterpret_cast<const ushort *>(string), size) > : fromUcs4(reinterpret_cast<const uint *>(string), size); >} > > >class __attribute__((visibility("default"))) QCharRef { > QString &s; > int i; > inline QCharRef(QString &str, int idx) > : s(str),i(idx) {} > friend class QString; >public: > > > > > inline operator QChar() const > { return i < s.d->size ? s.d->data()[i] : 0; } > inline QCharRef &operator=(QChar c) > { if (i >= s.d->size) s.expand(i); else s.detach(); > s.d->data()[i] = c.unicode(); return *this; } > > > > inline QCharRef &operator=(char c) > { return operator=(QChar::fromLatin1(c)); } > inline QCharRef &operator=(uchar c) > { return operator=(QChar::fromLatin1(c)); } > > inline QCharRef &operator=(const QCharRef &c) { return operator=(QChar(c)); } > inline QCharRef &operator=(ushort rc) { return operator=(QChar(rc)); } > inline QCharRef &operator=(short rc) { return operator=(QChar(rc)); } > inline QCharRef &operator=(uint rc) { return operator=(QChar(rc)); } > inline QCharRef &operator=(int rc) { return operator=(QChar(rc)); } > > > inline bool isNull() const { return QChar(*this).isNull(); } > inline bool isPrint() const { return QChar(*this).isPrint(); } > inline bool isPunct() const { return QChar(*this).isPunct(); } > inline bool isSpace() const { return QChar(*this).isSpace(); } > inline bool isMark() const { return QChar(*this).isMark(); } > inline bool isLetter() const { return QChar(*this).isLetter(); } > inline bool isNumber() const { return QChar(*this).isNumber(); } > inline bool isLetterOrNumber() { return QChar(*this).isLetterOrNumber(); } > inline bool isDigit() const { return QChar(*this).isDigit(); } > inline bool isLower() const { return QChar(*this).isLower(); } > inline bool isUpper() const { return QChar(*this).isUpper(); } > inline bool isTitleCase() const { return QChar(*this).isTitleCase(); } > > inline int digitValue() const { return QChar(*this).digitValue(); } > QChar toLower() const { return QChar(*this).toLower(); } > QChar toUpper() const { return QChar(*this).toUpper(); } > QChar toTitleCase () const { return QChar(*this).toTitleCase(); } > > QChar::Category category() const { return QChar(*this).category(); } > QChar::Direction direction() const { return QChar(*this).direction(); } > QChar::Joining joining() const { return QChar(*this).joining(); } > bool hasMirrored() const { return QChar(*this).hasMirrored(); } > QChar mirroredChar() const { return QChar(*this).mirroredChar(); } > QString decomposition() const { return QChar(*this).decomposition(); } > QChar::Decomposition decompositionTag() const { return QChar(*this).decompositionTag(); } > uchar combiningClass() const { return QChar(*this).combiningClass(); } > > QChar::UnicodeVersion unicodeVersion() const { return QChar(*this).unicodeVersion(); } > > inline uchar cell() const { return QChar(*this).cell(); } > inline uchar row() const { return QChar(*this).row(); } > inline void setCell(uchar cell); > inline void setRow(uchar row); > > > char toAscii() const { return QChar(*this).toLatin1(); } > > char toLatin1() const { return QChar(*this).toLatin1(); } > ushort unicode() const { return QChar(*this).unicode(); } > ushort& unicode() { return s.data()[i].unicode(); } > >}; >template<> class QTypeInfo<QCharRef > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QCharRef)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QCharRef) }; static inline const char *name() { return "QCharRef"; } }; > >inline void QCharRef::setRow(uchar arow) { QChar(*this).setRow(arow); } >inline void QCharRef::setCell(uchar acell) { QChar(*this).setCell(acell); } > > >inline QString::QString() : d(Data::sharedNull()) {} >inline QString::~QString() { if (!d->ref.deref()) Data::deallocate(d); } > >inline void QString::reserve(int asize) >{ > if (d->ref.isShared() || asize > capacity()) > reallocData(uint(asize) + 1u); > > > d->flags |= Data::CapacityReserved; >} > >inline void QString::squeeze() >{ > if (d->ref.isShared() || d->size < capacity()) > reallocData(uint(d->size) + 1u); > > > d->flags &= ~Data::CapacityReserved; >} > >inline QString &QString::setUtf16(const ushort *autf16, int asize) >{ return setUnicode(reinterpret_cast<const QChar *>(autf16), asize); } >inline QCharRef QString::operator[](int i) >{ ((!(i >= 0)) ? qt_assert("i >= 0","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",946) : qt_noop()); return QCharRef(*this, i); } >inline QCharRef QString::operator[](uint i) >{ return QCharRef(*this, i); } >inline QString::iterator QString::begin() >{ detach(); return reinterpret_cast<QChar*>(d->data()); } >inline QString::const_iterator QString::begin() const >{ return reinterpret_cast<const QChar*>(d->data()); } >inline QString::const_iterator QString::cbegin() const >{ return reinterpret_cast<const QChar*>(d->data()); } >inline QString::const_iterator QString::constBegin() const >{ return reinterpret_cast<const QChar*>(d->data()); } >inline QString::iterator QString::end() >{ detach(); return reinterpret_cast<QChar*>(d->data() + d->size); } >inline QString::const_iterator QString::end() const >{ return reinterpret_cast<const QChar*>(d->data() + d->size); } >inline QString::const_iterator QString::cend() const >{ return reinterpret_cast<const QChar*>(d->data() + d->size); } >inline QString::const_iterator QString::constEnd() const >{ return reinterpret_cast<const QChar*>(d->data() + d->size); } >inline bool QString::contains(const QString &s, Qt::CaseSensitivity cs) const >{ return indexOf(s, 0, cs) != -1; } >inline bool QString::contains(const QStringRef &s, Qt::CaseSensitivity cs) const >{ return indexOf(s, 0, cs) != -1; } >inline bool QString::contains(QChar c, Qt::CaseSensitivity cs) const >{ return indexOf(c, 0, cs) != -1; } > > >inline bool operator==(QString::Null, QString::Null) { return true; } >inline bool operator==(QString::Null, const QString &s) { return s.isNull(); } >inline bool operator==(const QString &s, QString::Null) { return s.isNull(); } >inline bool operator!=(QString::Null, QString::Null) { return false; } >inline bool operator!=(QString::Null, const QString &s) { return !s.isNull(); } >inline bool operator!=(const QString &s, QString::Null) { return !s.isNull(); } > >inline bool operator==(QLatin1String s1, QLatin1String s2) >{ return (s1.size() == s2.size() && !memcmp(s1.latin1(), s2.latin1(), s1.size())); } >inline bool operator!=(QLatin1String s1, QLatin1String s2) >{ return (s1.size() != s2.size() || memcmp(s1.latin1(), s2.latin1(), s1.size())); } >inline bool operator<(QLatin1String s1, QLatin1String s2) >{ int r = memcmp(s1.latin1(), s2.latin1(), qMin(s1.size(), s2.size())); > return (r < 0) || (r == 0 && s1.size() < s2.size()); } >inline bool operator<=(QLatin1String s1, QLatin1String s2) >{ int r = memcmp(s1.latin1(), s2.latin1(), qMin(s1.size(), s2.size())); > return (r < 0) || (r == 0 && s1.size() <= s2.size()); } >inline bool operator>(QLatin1String s1, QLatin1String s2) >{ int r = memcmp(s1.latin1(), s2.latin1(), qMin(s1.size(), s2.size())); > return (r > 0) || (r == 0 && s1.size() > s2.size()); } >inline bool operator>=(QLatin1String s1, QLatin1String s2) >{ int r = memcmp(s1.latin1(), s2.latin1(), qMin(s1.size(), s2.size())); > return (r > 0) || (r == 0 && s1.size() >= s2.size()); } > >inline bool QLatin1String::operator==(const QString &s) const >{ return s == *this; } >inline bool QLatin1String::operator!=(const QString &s) const >{ return s != *this; } >inline bool QLatin1String::operator>(const QString &s) const >{ return s < *this; } >inline bool QLatin1String::operator<(const QString &s) const >{ return s > *this; } >inline bool QLatin1String::operator>=(const QString &s) const >{ return s <= *this; } >inline bool QLatin1String::operator<=(const QString &s) const >{ return s >= *this; } > > >inline bool QString::operator==(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) == 0; } >inline bool QString::operator!=(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) != 0; } >inline bool QString::operator<(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) < 0; } >inline bool QString::operator>(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) > 0; } >inline bool QString::operator<=(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) <= 0; } >inline bool QString::operator>=(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) >= 0; } > >inline bool operator==(const char *s1, const QString &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) == 0; } >inline bool operator!=(const char *s1, const QString &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) != 0; } >inline bool operator<(const char *s1, const QString &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) < 0; } >inline bool operator>(const char *s1, const QString &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) > 0; } >inline bool operator<=(const char *s1, const QString &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) <= 0; } >inline bool operator>=(const char *s1, const QString &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) >= 0; } > >inline bool operator==(const char *s1, QLatin1String s2) >{ return QString::fromUtf8(s1) == s2; } >inline bool operator!=(const char *s1, QLatin1String s2) >{ return QString::fromUtf8(s1) != s2; } >inline bool operator<(const char *s1, QLatin1String s2) >{ return (QString::fromUtf8(s1) < s2); } >inline bool operator>(const char *s1, QLatin1String s2) >{ return (QString::fromUtf8(s1) > s2); } >inline bool operator<=(const char *s1, QLatin1String s2) >{ return (QString::fromUtf8(s1) <= s2); } >inline bool operator>=(const char *s1, QLatin1String s2) >{ return (QString::fromUtf8(s1) >= s2); } > >inline bool QLatin1String::operator==(const char *s) const >{ return QString::fromUtf8(s) == *this; } >inline bool QLatin1String::operator!=(const char *s) const >{ return QString::fromUtf8(s) != *this; } >inline bool QLatin1String::operator<(const char *s) const >{ return QString::fromUtf8(s) > *this; } >inline bool QLatin1String::operator>(const char *s) const >{ return QString::fromUtf8(s) < *this; } >inline bool QLatin1String::operator<=(const char *s) const >{ return QString::fromUtf8(s) >= *this; } >inline bool QLatin1String::operator>=(const char *s) const >{ return QString::fromUtf8(s) <= *this; } > >inline bool QLatin1String::operator==(const QByteArray &s) const >{ return QString::fromUtf8(s) == *this; } >inline bool QLatin1String::operator!=(const QByteArray &s) const >{ return QString::fromUtf8(s) != *this; } >inline bool QLatin1String::operator<(const QByteArray &s) const >{ return QString::fromUtf8(s) > *this; } >inline bool QLatin1String::operator>(const QByteArray &s) const >{ return QString::fromUtf8(s) < *this; } >inline bool QLatin1String::operator<=(const QByteArray &s) const >{ return QString::fromUtf8(s) >= *this; } >inline bool QLatin1String::operator>=(const QByteArray &s) const >{ return QString::fromUtf8(s) <= *this; } > >inline bool QString::operator==(const QByteArray &s) const >{ return QString::compare_helper(constData(), size(), s.constData(), qstrnlen(s.constData(), s.size())) == 0; } >inline bool QString::operator!=(const QByteArray &s) const >{ return QString::compare_helper(constData(), size(), s.constData(), qstrnlen(s.constData(), s.size())) != 0; } >inline bool QString::operator<(const QByteArray &s) const >{ return QString::compare_helper(constData(), size(), s.constData(), qstrnlen(s.constData(), s.size())) < 0; } >inline bool QString::operator>(const QByteArray &s) const >{ return QString::compare_helper(constData(), size(), s.constData(), qstrnlen(s.constData(), s.size())) > 0; } >inline bool QString::operator<=(const QByteArray &s) const >{ return QString::compare_helper(constData(), size(), s.constData(), qstrnlen(s.constData(), s.size())) <= 0; } >inline bool QString::operator>=(const QByteArray &s) const >{ return QString::compare_helper(constData(), size(), s.constData(), qstrnlen(s.constData(), s.size())) >= 0; } > >inline bool QByteArray::operator==(const QString &s) const >{ return QString::compare_helper(s.constData(), s.size(), constData(), qstrnlen(constData(), size())) == 0; } >inline bool QByteArray::operator!=(const QString &s) const >{ return QString::compare_helper(s.constData(), s.size(), constData(), qstrnlen(constData(), size())) != 0; } >inline bool QByteArray::operator<(const QString &s) const >{ return QString::compare_helper(s.constData(), s.size(), constData(), qstrnlen(constData(), size())) < 0; } >inline bool QByteArray::operator>(const QString &s) const >{ return QString::compare_helper(s.constData(), s.size(), constData(), qstrnlen(constData(), size())) > 0; } >inline bool QByteArray::operator<=(const QString &s) const >{ return QString::compare_helper(s.constData(), s.size(), constData(), qstrnlen(constData(), size())) <= 0; } >inline bool QByteArray::operator>=(const QString &s) const >{ return QString::compare_helper(s.constData(), s.size(), constData(), qstrnlen(constData(), size())) >= 0; } ># 1145 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" >inline std::string QString::toStdString() const >{ const QByteArray asc = toUtf8(); return std::string(asc.constData(), asc.length()); } > >inline QString QString::fromStdString(const std::string &s) >{ return fromUtf8(s.data(), int(s.size())); } > >inline std::wstring QString::toStdWString() const >{ > std::wstring str; > str.resize(length()); > > > > > > > > str.resize(toWCharArray(&(*str.begin()))); > return str; >} > >inline QString QString::fromStdWString(const std::wstring &s) >{ return fromWCharArray(s.data(), int(s.size())); } > > >__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QString &); >__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QString &); > > >template<> class QTypeInfo<QString > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QString)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QString) }; static inline const char *name() { return "QString"; } }; >template <> inline void qSwap<QString>(QString &value1, QString &value2) { qSwap(value1.data_ptr(), value2.data_ptr()); } namespace std { template<> inline void swap< ::QString>(::QString &value1, ::QString &value2) { swap(value1.data_ptr(), value2.data_ptr()); } } > inline QFlags<QString::SectionFlags::enum_type> operator|(QString::SectionFlags::enum_type f1, QString::SectionFlags::enum_type f2) { return QFlags<QString::SectionFlags::enum_type>(f1) | f2; } inline QFlags<QString::SectionFlags::enum_type> operator|(QString::SectionFlags::enum_type f1, QFlags<QString::SectionFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(QString::SectionFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > > >class __attribute__((visibility("default"))) QStringRef { > const QString *m_string; > int m_position; > int m_size; >public: > inline QStringRef():m_string(0), m_position(0), m_size(0){} > inline QStringRef(const QString *string, int position, int size); > inline QStringRef(const QString *string); > inline QStringRef(const QStringRef &other) > :m_string(other.m_string), m_position(other.m_position), m_size(other.m_size) > {} > > inline ~QStringRef(){} > inline const QString *string() const { return m_string; } > inline int position() const { return m_position; } > inline int size() const { return m_size; } > inline int count() const { return m_size; } > inline int length() const { return m_size; } > > inline QStringRef &operator=(const QStringRef &other) { > m_string = other.m_string; m_position = other.m_position; > m_size = other.m_size; return *this; > } > > int indexOf(const QString &str, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int indexOf(QChar ch, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int indexOf(QLatin1String str, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int indexOf(const QStringRef &str, int from = 0, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(const QString &str, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(QChar ch, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(QLatin1String str, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int lastIndexOf(const QStringRef &str, int from = -1, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > inline bool contains(const QString &str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > inline bool contains(QChar ch, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > inline bool contains(QLatin1String str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > inline bool contains(const QStringRef &str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > int count(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int count(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int count(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > bool startsWith(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool startsWith(QLatin1String s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool startsWith(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool startsWith(const QStringRef &c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > bool endsWith(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(QLatin1String s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > bool endsWith(const QStringRef &c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > inline QStringRef &operator=(const QString *string); > > inline const QChar *unicode() const { > if (!m_string) > return reinterpret_cast<const QChar *>(QString::Data::sharedNull()->data()); > return m_string->unicode() + m_position; > } > inline const QChar *data() const { return unicode(); } > inline const QChar *constData() const { return unicode(); } > > > QByteArray toAscii() const __attribute__ ((__warn_unused_result__)) > { return toLatin1(); } > > QByteArray toLatin1() const __attribute__ ((__warn_unused_result__)); > QByteArray toUtf8() const __attribute__ ((__warn_unused_result__)); > QByteArray toLocal8Bit() const __attribute__ ((__warn_unused_result__)); > QVector<uint> toUcs4() const __attribute__ ((__warn_unused_result__)); > > inline void clear() { m_string = 0; m_position = m_size = 0; } > QString toString() const; > inline bool isEmpty() const { return m_size == 0; } > inline bool isNull() const { return m_string == 0 || m_string->isNull(); } > > QStringRef appendTo(QString *string) const; > > inline const QChar at(int i) const > { ((!(i >= 0 && i < size())) ? qt_assert("i >= 0 && i < size()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h",1258) : qt_noop()); return m_string->at(i + m_position); } > > > > inline bool operator==(const char *s) const; > inline bool operator!=(const char *s) const; > inline bool operator<(const char *s) const; > inline bool operator<=(const char *s) const; > inline bool operator>(const char *s) const; > inline bool operator>=(const char *s) const; > > > int compare(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int compare(const QStringRef &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > int compare(QLatin1String s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > static int compare(const QStringRef &s1, const QString &s2, > Qt::CaseSensitivity = Qt::CaseSensitive); > static int compare(const QStringRef &s1, const QStringRef &s2, > Qt::CaseSensitivity = Qt::CaseSensitive); > static int compare(const QStringRef &s1, QLatin1String s2, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > > int localeAwareCompare(const QString &s) const; > int localeAwareCompare(const QStringRef &s) const; > static int localeAwareCompare(const QStringRef &s1, const QString &s2); > static int localeAwareCompare(const QStringRef &s1, const QStringRef &s2); >}; >template<> class QTypeInfo<QStringRef > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QStringRef)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QStringRef) }; static inline const char *name() { return "QStringRef"; } }; > >inline QStringRef &QStringRef::operator=(const QString *aString) >{ m_string = aString; m_position = 0; m_size = aString?aString->size():0; return *this; } > >inline QStringRef::QStringRef(const QString *aString, int aPosition, int aSize) > :m_string(aString), m_position(aPosition), m_size(aSize){} > >inline QStringRef::QStringRef(const QString *aString) > :m_string(aString), m_position(0), m_size(aString?aString->size() : 0){} > >__attribute__((visibility("default"))) bool operator==(const QStringRef &s1,const QStringRef &s2); >inline bool operator!=(const QStringRef &s1,const QStringRef &s2) >{ return !(s1 == s2); } >__attribute__((visibility("default"))) bool operator==(const QString &s1,const QStringRef &s2); >inline bool operator!=(const QString &s1,const QStringRef &s2) >{ return !(s1 == s2); } >inline bool operator==(const QStringRef &s1,const QString &s2) >{ return s2 == s1; } >inline bool operator!=(const QStringRef &s1,const QString &s2) >{ return s2 != s1; } >__attribute__((visibility("default"))) bool operator==(QLatin1String s1, const QStringRef &s2); >inline bool operator!=(QLatin1String s1, const QStringRef &s2) >{ return !(s1 == s2); } >inline bool operator==(const QStringRef &s1, QLatin1String s2) >{ return s2 == s1; } >inline bool operator!=(const QStringRef &s1, QLatin1String s2) >{ return s2 != s1; } > >__attribute__((visibility("default"))) bool operator<(const QStringRef &s1,const QStringRef &s2); >inline bool operator>(const QStringRef &s1, const QStringRef &s2) >{ return s2 < s1; } >inline bool operator<=(const QStringRef &s1, const QStringRef &s2) >{ return !(s1 > s2); } >inline bool operator>=(const QStringRef &s1, const QStringRef &s2) >{ return !(s1 < s2); } > > >inline bool QStringRef::operator==(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) == 0; } >inline bool QStringRef::operator!=(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) != 0; } >inline bool QStringRef::operator<(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) < 0; } >inline bool QStringRef::operator<=(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) > 0; } >inline bool QStringRef::operator>(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) <= 0; } >inline bool QStringRef::operator>=(const char *s) const >{ return QString::compare_helper(constData(), size(), s, -1) >= 0; } > >inline bool operator==(const char *s1, const QStringRef &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) == 0; } >inline bool operator!=(const char *s1, const QStringRef &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) != 0; } >inline bool operator<(const char *s1, const QStringRef &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) < 0; } >inline bool operator<=(const char *s1, const QStringRef &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) > 0; } >inline bool operator>(const char *s1, const QStringRef &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) <= 0; } >inline bool operator>=(const char *s1, const QStringRef &s2) >{ return QString::compare_helper(s2.constData(), s2.size(), s1, -1) >= 0; } > > >inline int QString::compare(const QStringRef &s, Qt::CaseSensitivity cs) const >{ return QString::compare_helper(constData(), length(), s.constData(), s.length(), cs); } >inline int QString::compare(const QString &s1, const QStringRef &s2, Qt::CaseSensitivity cs) >{ return QString::compare_helper(s1.constData(), s1.length(), s2.constData(), s2.length(), cs); } >inline int QStringRef::compare(const QString &s, Qt::CaseSensitivity cs) const >{ return QString::compare_helper(constData(), length(), s.constData(), s.length(), cs); } >inline int QStringRef::compare(const QStringRef &s, Qt::CaseSensitivity cs) const >{ return QString::compare_helper(constData(), length(), s.constData(), s.length(), cs); } >inline int QStringRef::compare(QLatin1String s, Qt::CaseSensitivity cs) const >{ return QString::compare_helper(constData(), length(), s, cs); } >inline int QStringRef::compare(const QStringRef &s1, const QString &s2, Qt::CaseSensitivity cs) >{ return QString::compare_helper(s1.constData(), s1.length(), s2.constData(), s2.length(), cs); } >inline int QStringRef::compare(const QStringRef &s1, const QStringRef &s2, Qt::CaseSensitivity cs) >{ return QString::compare_helper(s1.constData(), s1.length(), s2.constData(), s2.length(), cs); } >inline int QStringRef::compare(const QStringRef &s1, QLatin1String s2, Qt::CaseSensitivity cs) >{ return QString::compare_helper(s1.constData(), s1.length(), s2, cs); } > >inline int QString::localeAwareCompare(const QStringRef &s) const >{ return localeAwareCompare_helper(constData(), length(), s.constData(), s.length()); } >inline int QString::localeAwareCompare(const QString& s1, const QStringRef& s2) >{ return localeAwareCompare_helper(s1.constData(), s1.length(), s2.constData(), s2.length()); } >inline int QStringRef::localeAwareCompare(const QString &s) const >{ return QString::localeAwareCompare_helper(constData(), length(), s.constData(), s.length()); } >inline int QStringRef::localeAwareCompare(const QStringRef &s) const >{ return QString::localeAwareCompare_helper(constData(), length(), s.constData(), s.length()); } >inline int QStringRef::localeAwareCompare(const QStringRef &s1, const QString &s2) >{ return QString::localeAwareCompare_helper(s1.constData(), s1.length(), s2.constData(), s2.length()); } >inline int QStringRef::localeAwareCompare(const QStringRef &s1, const QStringRef &s2) >{ return QString::localeAwareCompare_helper(s1.constData(), s1.length(), s2.constData(), s2.length()); } > >inline bool QStringRef::contains(const QString &s, Qt::CaseSensitivity cs) const >{ return indexOf(s, 0, cs) != -1; } >inline bool QStringRef::contains(QLatin1String s, Qt::CaseSensitivity cs) const >{ return indexOf(s, 0, cs) != -1; } >inline bool QStringRef::contains(QChar c, Qt::CaseSensitivity cs) const >{ return indexOf(c, 0, cs) != -1; } >inline bool QStringRef::contains(const QStringRef &s, Qt::CaseSensitivity cs) const >{ return indexOf(s, 0, cs) != -1; } > >namespace Qt { > > inline QString escape(const QString &plain) { > return plain.toHtmlEscaped(); >} > >} > > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qstringbuilder.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringbuilder.h" 1 ># 52 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringbuilder.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 2 ># 53 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringbuilder.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qbytearray.h" 1 ># 54 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringbuilder.h" 2 > > > > > > > > >struct __attribute__((visibility("default"))) QAbstractConcatenable >{ >protected: > static void convertFromAscii(const char *a, int len, QChar *&out); > static inline void convertFromAscii(char a, QChar *&out) > { > *out++ = QLatin1Char(a); > } >}; > >template <typename T> struct QConcatenable {}; > >namespace QtStringBuilder { > template <typename A, typename B> struct ConvertToTypeHelper > { typedef A ConvertTo; }; > template <typename T> struct ConvertToTypeHelper<T, QString> > { typedef QString ConvertTo; }; >} > >template<typename Builder, typename T> >struct QStringBuilderCommon >{ > T toUpper() const { return resolved().toUpper(); } > T toLower() const { return resolved().toLower(); } > >protected: > const T resolved() const { return *static_cast<const Builder*>(this); } >}; > >template<typename Builder, typename T> >struct QStringBuilderBase : public QStringBuilderCommon<Builder, T> >{ >}; > >template<typename Builder> >struct QStringBuilderBase<Builder, QString> : public QStringBuilderCommon<Builder, QString> >{ > QByteArray toLatin1() const { return this->resolved().toLatin1(); } > QByteArray toUtf8() const { return this->resolved().toUtf8(); } > QByteArray toLocal8Bit() const { return this->resolved().toLocal8Bit(); } >}; > >template <typename A, typename B> >class QStringBuilder : public QStringBuilderBase<QStringBuilder<A, B>, typename QtStringBuilder::ConvertToTypeHelper<typename QConcatenable<A>::ConvertTo, typename QConcatenable<B>::ConvertTo>::ConvertTo> >{ >public: > QStringBuilder(const A &a_, const B &b_) : a(a_), b(b_) {} >private: > friend class QByteArray; > friend class QString; > template <typename T> T convertTo() const > { > const uint len = QConcatenable< QStringBuilder<A, B> >::size(*this); > T s(len, Qt::Uninitialized); > > typename T::iterator d = s.data(); > typename T::const_iterator const start = d; > QConcatenable< QStringBuilder<A, B> >::appendTo(*this, d); > > if (!QConcatenable< QStringBuilder<A, B> >::ExactSize && int(len) != d - start) { > > > s.resize(d - start); > } > return s; > } > > typedef QConcatenable<QStringBuilder<A, B> > Concatenable; > typedef typename Concatenable::ConvertTo ConvertTo; >public: > operator ConvertTo() const { return convertTo<ConvertTo>(); } > > int size() const { return Concatenable::size(*this); } > > const A &a; > const B &b; >}; > >template <> >class QStringBuilder <QString, QString> : public QStringBuilderBase<QStringBuilder<QString, QString>, QString> >{ > public: > QStringBuilder(const QString &a_, const QString &b_) : a(a_), b(b_) {} > > operator QString() const > { QString r(a); r += b; return r; } > > const QString &a; > const QString &b; >}; > >template <> >class QStringBuilder <QByteArray, QByteArray> : public QStringBuilderBase<QStringBuilder<QByteArray, QByteArray>, QByteArray> >{ > public: > QStringBuilder(const QByteArray &a_, const QByteArray &b_) : a(a_), b(b_) {} > > operator QByteArray() const > { QByteArray r(a); r += b; return r; } > > const QByteArray &a; > const QByteArray &b; >}; > > >template <> struct QConcatenable<char> : private QAbstractConcatenable >{ > typedef char type; > typedef QByteArray ConvertTo; > enum { ExactSize = true }; > static int size(const char) { return 1; } > > static inline void appendTo(const char c, QChar *&out) > { > QAbstractConcatenable::convertFromAscii(c, out); > } > > static inline void appendTo(const char c, char *&out) > { *out++ = c; } >}; > >template <> struct QConcatenable<QLatin1Char> >{ > typedef QLatin1Char type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(const QLatin1Char) { return 1; } > static inline void appendTo(const QLatin1Char c, QChar *&out) > { *out++ = c; } > static inline void appendTo(const QLatin1Char c, char *&out) > { *out++ = c.toLatin1(); } >}; > >template <> struct QConcatenable<QChar> : private QAbstractConcatenable >{ > typedef QChar type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(const QChar) { return 1; } > static inline void appendTo(const QChar c, QChar *&out) > { *out++ = c; } >}; > >template <> struct QConcatenable<QChar::SpecialCharacter> : private QAbstractConcatenable >{ > typedef QChar::SpecialCharacter type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(const QChar::SpecialCharacter) { return 1; } > static inline void appendTo(const QChar::SpecialCharacter c, QChar *&out) > { *out++ = c; } >}; > >template <> struct QConcatenable<QCharRef> : private QAbstractConcatenable >{ > typedef QCharRef type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(QCharRef) { return 1; } > static inline void appendTo(QCharRef c, QChar *&out) > { *out++ = QChar(c); } >}; > >template <> struct QConcatenable<QLatin1String> >{ > typedef QLatin1String type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(const QLatin1String a) { return a.size(); } > static inline void appendTo(const QLatin1String a, QChar *&out) > { > if (a.data()) { > for (const char *s = a.data(); *s; ) > *out++ = QLatin1Char(*s++); > } > } > static inline void appendTo(const QLatin1String a, char *&out) > { > if (a.data()) { > for (const char *s = a.data(); *s; ) > *out++ = *s++; > } > } >}; > >template <> struct QConcatenable<QString> : private QAbstractConcatenable >{ > typedef QString type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(const QString &a) { return a.size(); } > static inline void appendTo(const QString &a, QChar *&out) > { > const int n = a.size(); > memcpy(out, reinterpret_cast<const char*>(a.constData()), sizeof(QChar) * n); > out += n; > } >}; > >template <> struct QConcatenable<QStringRef> : private QAbstractConcatenable >{ > typedef QStringRef type; > typedef QString ConvertTo; > enum { ExactSize = true }; > static int size(const QStringRef &a) { return a.size(); } > static inline void appendTo(const QStringRef &a, QChar *&out) > { > const int n = a.size(); > memcpy(out, reinterpret_cast<const char*>(a.constData()), sizeof(QChar) * n); > out += n; > } >}; > >template <int N> struct QConcatenable<char[N]> : private QAbstractConcatenable >{ > typedef char type[N]; > typedef QByteArray ConvertTo; > enum { ExactSize = false }; > static int size(const char[N]) { return N - 1; } > > static inline void appendTo(const char a[N], QChar *&out) > { > QAbstractConcatenable::convertFromAscii(a, N - 1, out); > } > > static inline void appendTo(const char a[N], char *&out) > { > while (*a) > *out++ = *a++; > } >}; > >template <int N> struct QConcatenable<const char[N]> : private QAbstractConcatenable >{ > typedef const char type[N]; > typedef QByteArray ConvertTo; > enum { ExactSize = false }; > static int size(const char[N]) { return N - 1; } > > static inline void appendTo(const char a[N], QChar *&out) > { > QAbstractConcatenable::convertFromAscii(a, N - 1, out); > } > > static inline void appendTo(const char a[N], char *&out) > { > while (*a) > *out++ = *a++; > } >}; > >template <> struct QConcatenable<const char *> : private QAbstractConcatenable >{ > typedef char const *type; > typedef QByteArray ConvertTo; > enum { ExactSize = false }; > static int size(const char *a) { return qstrlen(a); } > > static inline void appendTo(const char *a, QChar *&out) > { QAbstractConcatenable::convertFromAscii(a, -1, out); } > > static inline void appendTo(const char *a, char *&out) > { > if (!a) > return; > while (*a) > *out++ = *a++; > } >}; > >template <> struct QConcatenable<QByteArray> : private QAbstractConcatenable >{ > typedef QByteArray type; > typedef QByteArray ConvertTo; > enum { ExactSize = false }; > static int size(const QByteArray &ba) { return ba.size(); } > > static inline void appendTo(const QByteArray &ba, QChar *&out) > { > QAbstractConcatenable::convertFromAscii(ba.constData(), ba.size(), out); > } > > static inline void appendTo(const QByteArray &ba, char *&out) > { > const char *a = ba.constData(); > const char * const end = ba.end(); > while (a != end) > *out++ = *a++; > } >}; > > >template <typename A, typename B> >struct QConcatenable< QStringBuilder<A, B> > >{ > typedef QStringBuilder<A, B> type; > typedef typename QtStringBuilder::ConvertToTypeHelper<typename QConcatenable<A>::ConvertTo, typename QConcatenable<B>::ConvertTo>::ConvertTo ConvertTo; > enum { ExactSize = QConcatenable<A>::ExactSize && QConcatenable<B>::ExactSize }; > static int size(const type &p) > { > return QConcatenable<A>::size(p.a) + QConcatenable<B>::size(p.b); > } > template<typename T> static inline void appendTo(const type &p, T *&out) > { > QConcatenable<A>::appendTo(p.a, out); > QConcatenable<B>::appendTo(p.b, out); > } >}; > >template <typename A, typename B> >QStringBuilder<typename QConcatenable<A>::type, typename QConcatenable<B>::type> >operator%(const A &a, const B &b) >{ > return QStringBuilder<typename QConcatenable<A>::type, typename QConcatenable<B>::type>(a, b); >} > > > > >template <typename A, typename B> >QStringBuilder<typename QConcatenable<A>::type, typename QConcatenable<B>::type> >operator+(const A &a, const B &b) >{ > return QStringBuilder<typename QConcatenable<A>::type, typename QConcatenable<B>::type>(a, b); >} > > >namespace QtStringBuilder { >template <typename A, typename B> >QByteArray &appendToByteArray(QByteArray &a, const QStringBuilder<A, B> &b, char) >{ > > int len = a.size() + QConcatenable< QStringBuilder<A, B> >::size(b); > a.reserve(len); > char *it = a.data() + a.size(); > QConcatenable< QStringBuilder<A, B> >::appendTo(b, it); > a.resize(len); > return a; >} ># 410 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringbuilder.h" >} > >template <typename A, typename B> >QByteArray &operator+=(QByteArray &a, const QStringBuilder<A, B> &b) >{ > return QtStringBuilder::appendToByteArray(a, b, > typename QConcatenable< QStringBuilder<A, B> >::ConvertTo::value_type()); >} > >template <typename A, typename B> >QString &operator+=(QString &a, const QStringBuilder<A, B> &b) >{ > int len = a.size() + QConcatenable< QStringBuilder<A, B> >::size(b); > a.reserve(len); > QChar *it = a.data() + a.size(); > QConcatenable< QStringBuilder<A, B> >::appendTo(b, it); > a.resize(it - a.constData()); > return a; >} > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qstringbuilder.h" 2 ># 1403 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstring.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QString" 2 ># 40 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QStringList" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qstringlist.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qalgorithms.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qalgorithms.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qalgorithms.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qalgorithms.h" 2 > > > > > > > > > > >namespace QAlgorithmsPrivate { > >template <typename RandomAccessIterator, typename T, typename LessThan> > void qSortHelper(RandomAccessIterator start, RandomAccessIterator end, const T &t, LessThan lessThan); >template <typename RandomAccessIterator, typename T> >inline void qSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &dummy); > >template <typename RandomAccessIterator, typename T, typename LessThan> > void qStableSortHelper(RandomAccessIterator start, RandomAccessIterator end, const T &t, LessThan lessThan); >template <typename RandomAccessIterator, typename T> >inline void qStableSortHelper(RandomAccessIterator, RandomAccessIterator, const T &); > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qLowerBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan); >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qUpperBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan); >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qBinaryFindHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan); > >} > >template <typename InputIterator, typename OutputIterator> >inline OutputIterator qCopy(InputIterator begin, InputIterator end, OutputIterator dest) >{ > while (begin != end) > *dest++ = *begin++; > return dest; >} > >template <typename BiIterator1, typename BiIterator2> >inline BiIterator2 qCopyBackward(BiIterator1 begin, BiIterator1 end, BiIterator2 dest) >{ > while (begin != end) > *--dest = *--end; > return dest; >} > >template <typename InputIterator1, typename InputIterator2> >inline bool qEqual(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2) >{ > for (; first1 != last1; ++first1, ++first2) > if (!(*first1 == *first2)) > return false; > return true; >} > >template <typename ForwardIterator, typename T> >inline void qFill(ForwardIterator first, ForwardIterator last, const T &val) >{ > for (; first != last; ++first) > *first = val; >} > >template <typename Container, typename T> >inline void qFill(Container &container, const T &val) >{ > qFill(container.begin(), container.end(), val); >} > >template <typename InputIterator, typename T> >inline InputIterator qFind(InputIterator first, InputIterator last, const T &val) >{ > while (first != last && !(*first == val)) > ++first; > return first; >} > >template <typename Container, typename T> >inline typename Container::const_iterator qFind(const Container &container, const T &val) >{ > return qFind(container.constBegin(), container.constEnd(), val); >} > >template <typename InputIterator, typename T, typename Size> >inline void qCount(InputIterator first, InputIterator last, const T &value, Size &n) >{ > for (; first != last; ++first) > if (*first == value) > ++n; >} > >template <typename Container, typename T, typename Size> >inline void qCount(const Container &container, const T &value, Size &n) >{ > qCount(container.constBegin(), container.constEnd(), value, n); >} ># 154 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qalgorithms.h" >template <typename T> >class qLess >{ >public: > inline bool operator()(const T &t1, const T &t2) const > { > return (t1 < t2); > } >}; > >template <typename T> >class qGreater >{ >public: > inline bool operator()(const T &t1, const T &t2) const > { > return (t2 < t1); > } >}; > > >template <typename RandomAccessIterator> >inline void qSort(RandomAccessIterator start, RandomAccessIterator end) >{ > if (start != end) > QAlgorithmsPrivate::qSortHelper(start, end, *start); >} > >template <typename RandomAccessIterator, typename LessThan> >inline void qSort(RandomAccessIterator start, RandomAccessIterator end, LessThan lessThan) >{ > if (start != end) > QAlgorithmsPrivate::qSortHelper(start, end, *start, lessThan); >} > >template<typename Container> >inline void qSort(Container &c) >{ > > > > > if (!c.empty()) > QAlgorithmsPrivate::qSortHelper(c.begin(), c.end(), *c.begin()); >} > >template <typename RandomAccessIterator> >inline void qStableSort(RandomAccessIterator start, RandomAccessIterator end) >{ > if (start != end) > QAlgorithmsPrivate::qStableSortHelper(start, end, *start); >} > >template <typename RandomAccessIterator, typename LessThan> >inline void qStableSort(RandomAccessIterator start, RandomAccessIterator end, LessThan lessThan) >{ > if (start != end) > QAlgorithmsPrivate::qStableSortHelper(start, end, *start, lessThan); >} > >template<typename Container> >inline void qStableSort(Container &c) >{ > > > > > if (!c.empty()) > QAlgorithmsPrivate::qStableSortHelper(c.begin(), c.end(), *c.begin()); >} > >template <typename RandomAccessIterator, typename T> > RandomAccessIterator qLowerBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value) >{ > > > > RandomAccessIterator middle; > int n = end - begin; > int half; > > while (n > 0) { > half = n >> 1; > middle = begin + half; > if (*middle < value) { > begin = middle + 1; > n -= half + 1; > } else { > n = half; > } > } > return begin; >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qLowerBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan) >{ > return QAlgorithmsPrivate::qLowerBoundHelper(begin, end, value, lessThan); >} > >template <typename Container, typename T> > typename Container::const_iterator qLowerBound(const Container &container, const T &value) >{ > return QAlgorithmsPrivate::qLowerBoundHelper(container.constBegin(), container.constEnd(), value, qLess<T>()); >} > >template <typename RandomAccessIterator, typename T> > RandomAccessIterator qUpperBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value) >{ > > RandomAccessIterator middle; > int n = end - begin; > int half; > > while (n > 0) { > half = n >> 1; > middle = begin + half; > if (value < *middle) { > n = half; > } else { > begin = middle + 1; > n -= half + 1; > } > } > return begin; >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qUpperBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan) >{ > return QAlgorithmsPrivate::qUpperBoundHelper(begin, end, value, lessThan); >} > >template <typename Container, typename T> > typename Container::const_iterator qUpperBound(const Container &container, const T &value) >{ > return QAlgorithmsPrivate::qUpperBoundHelper(container.constBegin(), container.constEnd(), value, qLess<T>()); >} > >template <typename RandomAccessIterator, typename T> > RandomAccessIterator qBinaryFind(RandomAccessIterator begin, RandomAccessIterator end, const T &value) >{ > > RandomAccessIterator it = qLowerBound(begin, end, value); > > if (it == end || value < *it) > return end; > > return it; >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qBinaryFind(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan) >{ > return QAlgorithmsPrivate::qBinaryFindHelper(begin, end, value, lessThan); >} > >template <typename Container, typename T> > typename Container::const_iterator qBinaryFind(const Container &container, const T &value) >{ > return QAlgorithmsPrivate::qBinaryFindHelper(container.constBegin(), container.constEnd(), value, qLess<T>()); >} > >template <typename ForwardIterator> > void qDeleteAll(ForwardIterator begin, ForwardIterator end) >{ > while (begin != end) { > delete *begin; > ++begin; > } >} > >template <typename Container> >inline void qDeleteAll(const Container &c) >{ > qDeleteAll(c.begin(), c.end()); >} > > > > > >namespace QAlgorithmsPrivate { > >template <typename RandomAccessIterator, typename T, typename LessThan> > void qSortHelper(RandomAccessIterator start, RandomAccessIterator end, const T &t, LessThan lessThan) >{ >top: > int span = int(end - start); > if (span < 2) > return; > > --end; > RandomAccessIterator low = start, high = end - 1; > RandomAccessIterator pivot = start + span / 2; > > if (lessThan(*end, *start)) > qSwap(*end, *start); > if (span == 2) > return; > > if (lessThan(*pivot, *start)) > qSwap(*pivot, *start); > if (lessThan(*end, *pivot)) > qSwap(*end, *pivot); > if (span == 3) > return; > > qSwap(*pivot, *end); > > while (low < high) { > while (low < high && lessThan(*low, *end)) > ++low; > > while (high > low && lessThan(*end, *high)) > --high; > > if (low < high) { > qSwap(*low, *high); > ++low; > --high; > } else { > break; > } > } > > if (lessThan(*low, *end)) > ++low; > > qSwap(*end, *low); > qSortHelper(start, low, t, lessThan); > > start = low + 1; > ++end; > goto top; >} > >template <typename RandomAccessIterator, typename T> >inline void qSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &dummy) >{ > qSortHelper(begin, end, dummy, qLess<T>()); >} > >template <typename RandomAccessIterator> > void qReverse(RandomAccessIterator begin, RandomAccessIterator end) >{ > --end; > while (begin < end) > qSwap(*begin++, *end--); >} > >template <typename RandomAccessIterator> > void qRotate(RandomAccessIterator begin, RandomAccessIterator middle, RandomAccessIterator end) >{ > qReverse(begin, middle); > qReverse(middle, end); > qReverse(begin, end); >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > void qMerge(RandomAccessIterator begin, RandomAccessIterator pivot, RandomAccessIterator end, T &t, LessThan lessThan) >{ > const int len1 = pivot - begin; > const int len2 = end - pivot; > > if (len1 == 0 || len2 == 0) > return; > > if (len1 + len2 == 2) { > if (lessThan(*(begin + 1), *(begin))) > qSwap(*begin, *(begin + 1)); > return; > } > > RandomAccessIterator firstCut; > RandomAccessIterator secondCut; > int len2Half; > if (len1 > len2) { > const int len1Half = len1 / 2; > firstCut = begin + len1Half; > secondCut = qLowerBound(pivot, end, *firstCut, lessThan); > len2Half = secondCut - pivot; > } else { > len2Half = len2 / 2; > secondCut = pivot + len2Half; > firstCut = qUpperBound(begin, pivot, *secondCut, lessThan); > } > > qRotate(firstCut, pivot, secondCut); > const RandomAccessIterator newPivot = firstCut + len2Half; > qMerge(begin, firstCut, newPivot, t, lessThan); > qMerge(newPivot, secondCut, end, t, lessThan); >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > void qStableSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &t, LessThan lessThan) >{ > const int span = end - begin; > if (span < 2) > return; > > const RandomAccessIterator middle = begin + span / 2; > qStableSortHelper(begin, middle, t, lessThan); > qStableSortHelper(middle, end, t, lessThan); > qMerge(begin, middle, end, t, lessThan); >} > >template <typename RandomAccessIterator, typename T> >inline void qStableSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &dummy) >{ > qStableSortHelper(begin, end, dummy, qLess<T>()); >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qLowerBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan) >{ > RandomAccessIterator middle; > int n = int(end - begin); > int half; > > while (n > 0) { > half = n >> 1; > middle = begin + half; > if (lessThan(*middle, value)) { > begin = middle + 1; > n -= half + 1; > } else { > n = half; > } > } > return begin; >} > > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qUpperBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan) >{ > RandomAccessIterator middle; > int n = end - begin; > int half; > > while (n > 0) { > half = n >> 1; > middle = begin + half; > if (lessThan(value, *middle)) { > n = half; > } else { > begin = middle + 1; > n -= half + 1; > } > } > return begin; >} > >template <typename RandomAccessIterator, typename T, typename LessThan> > RandomAccessIterator qBinaryFindHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan) >{ > RandomAccessIterator it = qLowerBoundHelper(begin, end, value, lessThan); > > if (it == end || lessThan(value, *it)) > return end; > > return it; >} > >} > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qalgorithms.h" 2 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qdatastream.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qdatastream.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qdatastream.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qscopedpointer.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qscopedpointer.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qscopedpointer.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qscopedpointer.h" 2 > > > > > > >template <typename T> >struct QScopedPointerDeleter >{ > static inline void cleanup(T *pointer) > { > > > > typedef char IsIncompleteType[ sizeof(T) ? 1 : -1 ]; > (void) sizeof(IsIncompleteType); > > delete pointer; > } >}; > >template <typename T> >struct QScopedPointerArrayDeleter >{ > static inline void cleanup(T *pointer) > { > > > > typedef char IsIncompleteType[ sizeof(T) ? 1 : -1 ]; > (void) sizeof(IsIncompleteType); > > delete [] pointer; > } >}; > >struct QScopedPointerPodDeleter >{ > static inline void cleanup(void *pointer) { if (pointer) free(pointer); } >}; > >template <typename T, typename Cleanup = QScopedPointerDeleter<T> > >class QScopedPointer >{ > typedef T *QScopedPointer:: *RestrictedBool; >public: > explicit inline QScopedPointer(T *p = 0) : d(p) > { > } > > inline ~QScopedPointer() > { > T *oldD = this->d; > Cleanup::cleanup(oldD); > this->d = 0; > } > > inline T &operator*() const > { > ((!(d)) ? qt_assert("d","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qscopedpointer.h",105) : qt_noop()); > return *d; > } > > inline T *operator->() const > { > ((!(d)) ? qt_assert("d","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qscopedpointer.h",111) : qt_noop()); > return d; > } > > inline bool operator!() const > { > return !d; > } > > > > > > > > inline operator RestrictedBool() const > { > return isNull() ? 0 : &QScopedPointer::d; > } > > > inline T *data() const > { > return d; > } > > inline bool isNull() const > { > return !d; > } > > inline void reset(T *other = 0) > { > if (d == other) > return; > T *oldD = d; > d = other; > Cleanup::cleanup(oldD); > } > > inline T *take() > { > T *oldD = d; > d = 0; > return oldD; > } > > inline void swap(QScopedPointer<T, Cleanup> &other) > { > qSwap(d, other.d); > } > > typedef T *pointer; > >protected: > T *d; > >private: > QScopedPointer(const QScopedPointer &) ; QScopedPointer &operator=(const QScopedPointer &) ; >}; > >template <class T, class Cleanup> >inline bool operator==(const QScopedPointer<T, Cleanup> &lhs, const QScopedPointer<T, Cleanup> &rhs) >{ > return lhs.data() == rhs.data(); >} > >template <class T, class Cleanup> >inline bool operator!=(const QScopedPointer<T, Cleanup> &lhs, const QScopedPointer<T, Cleanup> &rhs) >{ > return lhs.data() != rhs.data(); >} > >template <class T, class Cleanup> >inline void qSwap(QScopedPointer<T, Cleanup> &p1, QScopedPointer<T, Cleanup> &p2) >{ p1.swap(p2); } > > >namespace std { > template <class T, class Cleanup> > inline void swap(::QScopedPointer<T, Cleanup> &p1, ::QScopedPointer<T, Cleanup> &p2) > { p1.swap(p2); } >} > > > > >namespace QtPrivate { > template <typename X, typename Y> struct QScopedArrayEnsureSameType; > template <typename X> struct QScopedArrayEnsureSameType<X,X> { typedef X* Type; }; > template <typename X> struct QScopedArrayEnsureSameType<const X, X> { typedef X* Type; }; >} > >template <typename T, typename Cleanup = QScopedPointerArrayDeleter<T> > >class QScopedArrayPointer : public QScopedPointer<T, Cleanup> >{ >public: > inline QScopedArrayPointer() : QScopedPointer<T, Cleanup>(0) {} > > template <typename D> > explicit inline QScopedArrayPointer(D *p, typename QtPrivate::QScopedArrayEnsureSameType<T,D>::Type = 0) > : QScopedPointer<T, Cleanup>(p) > { > } > > inline T &operator[](int i) > { > return this->d[i]; > } > > inline const T &operator[](int i) const > { > return this->d[i]; > } > >private: > explicit inline QScopedArrayPointer(void *) { ># 236 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qscopedpointer.h" > } > > QScopedArrayPointer(const QScopedArrayPointer &) ; QScopedArrayPointer &operator=(const QScopedArrayPointer &) ; >}; > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qscopedpointer.h" 2 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qdatastream.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qiodevice.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qiodevice.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qiodevice.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qobject.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 1 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qobjectdefs.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qnamespace.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" 2 > ># 1 "../../../../qt5/qtbase/include/QtCore/qobjectdefs_impl.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" > > > > > >namespace QtPrivate { > template <typename T> struct RemoveRef { typedef T Type; }; > template <typename T> struct RemoveRef<T&> { typedef T Type; }; > template <typename T> struct RemoveConstRef { typedef T Type; }; > template <typename T> struct RemoveConstRef<const T&> { typedef T Type; }; ># 66 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" > template <typename Head, typename Tail> struct List { typedef Head Car; typedef Tail Cdr; }; > template <typename L, int N> struct List_Left { typedef List<typename L::Car, typename List_Left<typename L::Cdr, N - 1>::Value > Value; }; > template <typename L> struct List_Left<L,0> { typedef void Value; }; ># 81 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" > template <typename L, int N> struct List_Select { typedef typename List_Select<typename L::Cdr, N - 1>::Value Value; }; > template <typename L> struct List_Select<L,0> { typedef typename L::Car Value; }; > > > > > > > > template <typename T> > struct ApplyReturnValue { > void *data; > ApplyReturnValue(void *data_) : data(data_) {} > }; > template<typename T, typename U> > void operator,(const T &value, const ApplyReturnValue<U> &container) { > if (container.data) > *reinterpret_cast<U*>(container.data) = value; > } > > > > > > > > template<typename T> > void operator,(T, const ApplyReturnValue<void> &) {} ># 128 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" > template<typename Func> struct FunctionPointer { enum {ArgumentCount = -1}; }; > template<class Obj, typename Ret> struct FunctionPointer<Ret (Obj::*) ()> > { > typedef Obj Object; > typedef void Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (); > enum {ArgumentCount = 0}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { (o->*f)(), ApplyReturnValue<R>(arg[0]); } > }; > template<class Obj, typename Ret, typename Arg1> struct FunctionPointer<Ret (Obj::*) (Arg1)> > { > typedef Obj Object; > typedef List<Arg1, void> Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (Arg1); > enum {ArgumentCount = 1}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { > (o->*f)((*reinterpret_cast<typename RemoveRef<typename Args::Car>::Type *>(arg[1]))), ApplyReturnValue<R>(arg[0]); > } > }; > template<class Obj, typename Ret, typename Arg1, typename Arg2> struct FunctionPointer<Ret (Obj::*) (Arg1, Arg2)> > { > typedef Obj Object; > typedef List<Arg1, List<Arg2, void> > Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (Arg1, Arg2); > enum {ArgumentCount = 2}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { > (o->*f)( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2])), ApplyReturnValue<R>(arg[0]); > } > }; > template<class Obj, typename Ret, typename Arg1, typename Arg2, typename Arg3> struct FunctionPointer<Ret (Obj::*) (Arg1, Arg2, Arg3)> > { > typedef Obj Object; > typedef List<Arg1, List<Arg2, List<Arg3, void> > > Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (Arg1, Arg2, Arg3); > enum {ArgumentCount = 3}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { > (o->*f)( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3])), ApplyReturnValue<R>(arg[0]); > } > }; > template<class Obj, typename Ret, typename Arg1, typename Arg2, typename Arg3, typename Arg4> struct FunctionPointer<Ret (Obj::*) (Arg1, Arg2, Arg3, Arg4)> > { > typedef Obj Object; > typedef List<Arg1, List<Arg2, List<Arg3, List<Arg4, void> > > > Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (Arg1, Arg2, Arg3, Arg4); > enum {ArgumentCount = 4}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { > (o->*f)( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4])), ApplyReturnValue<R>(arg[0]); > } > }; > template<class Obj, typename Ret, typename Arg1, typename Arg2, typename Arg3, typename Arg4, typename Arg5> struct FunctionPointer<Ret (Obj::*) (Arg1, Arg2, Arg3, Arg4, Arg5)> > { > typedef Obj Object; > typedef List<Arg1, List<Arg2, List<Arg3, List<Arg4, List<Arg5, void> > > > > Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (Arg1, Arg2, Arg3, Arg4, Arg5); > enum {ArgumentCount = 5}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { > (o->*f)( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 4>::Value>::Type *>(arg[5])), ApplyReturnValue<R>(arg[0]); > } > }; > template<class Obj, typename Ret, typename Arg1, typename Arg2, typename Arg3, typename Arg4, typename Arg5, typename Arg6> > struct FunctionPointer<Ret (Obj::*) (Arg1, Arg2, Arg3, Arg4, Arg5, Arg6)> > { > typedef Obj Object; > typedef List<Arg1, List<Arg2, List<Arg3, List<Arg4, List<Arg5, List<Arg6, void> > > > > > Arguments; > typedef Ret ReturnType; > typedef Ret (Obj::*Function) (Arg1, Arg2, Arg3, Arg4, Arg5, Arg6); > enum {ArgumentCount = 6}; > template <typename Args, typename R> > static void call(Function f, Obj *o, void **arg) { > (o->*f)( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 4>::Value>::Type *>(arg[5]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 5>::Value>::Type *>(arg[6])), ApplyReturnValue<R>(arg[0]); > } > }; > > template<typename Ret> struct FunctionPointer<Ret (*) ()> > { > typedef void Arguments; > typedef Ret (*Function) (); > typedef Ret ReturnType; > enum {ArgumentCount = 0}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) { f(), ApplyReturnValue<R>(arg[0]); } > }; > template<typename Ret, typename Arg1> struct FunctionPointer<Ret (*) (Arg1)> > { > typedef List<Arg1, void> Arguments; > typedef Ret ReturnType; > typedef Ret (*Function) (Arg1); > enum {ArgumentCount = 1}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) > { f(*reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1])), ApplyReturnValue<R>(arg[0]); } > }; > template<typename Ret, typename Arg1, typename Arg2> struct FunctionPointer<Ret (*) (Arg1, Arg2)> > { > typedef List<Arg1, List<Arg2, void> > Arguments; > typedef Ret ReturnType; > typedef Ret (*Function) (Arg1, Arg2); > enum {ArgumentCount = 2}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) { > f(*reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2])), ApplyReturnValue<R>(arg[0]); } > }; > template<typename Ret, typename Arg1, typename Arg2, typename Arg3> struct FunctionPointer<Ret (*) (Arg1, Arg2, Arg3)> > { > typedef List<Arg1, List<Arg2, List<Arg3, void> > > Arguments; > typedef Ret ReturnType; > typedef Ret (*Function) (Arg1, Arg2, Arg3); > enum {ArgumentCount = 3}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Ret, typename Arg1, typename Arg2, typename Arg3, typename Arg4> struct FunctionPointer<Ret (*) (Arg1, Arg2, Arg3, Arg4)> > { > typedef List<Arg1, List<Arg2, List<Arg3, List<Arg4, void> > > > Arguments; > typedef Ret ReturnType; > typedef Ret (*Function) (Arg1, Arg2, Arg3, Arg4); > enum {ArgumentCount = 4}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Ret, typename Arg1, typename Arg2, typename Arg3, typename Arg4, typename Arg5> struct FunctionPointer<Ret (*) (Arg1, Arg2, Arg3, Arg4, Arg5)> > { > typedef List<Arg1, List<Arg2, List<Arg3, > List<Arg4, List<Arg5, void > > > > > Arguments; > typedef Ret ReturnType; > typedef Ret (*Function) (Arg1, Arg2, Arg3, Arg4, Arg5); > enum {ArgumentCount = 5}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 4>::Value>::Type *>(arg[5])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Ret, typename Arg1, typename Arg2, typename Arg3, typename Arg4, typename Arg5, typename Arg6> struct FunctionPointer<Ret (*) (Arg1, Arg2, Arg3, Arg4, Arg5, Arg6)> > { > typedef List<Arg1, List<Arg2, List<Arg3, List<Arg4, List<Arg5, List<Arg6, void> > > > > > Arguments; > typedef Ret ReturnType; > typedef Ret (*Function) (Arg1, Arg2, Arg3, Arg4, Arg5, Arg6); > enum {ArgumentCount = 6}; > template <typename Args, typename R> > static void call(Function f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 4>::Value>::Type *>(arg[5]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 5>::Value>::Type *>(arg[6])), ApplyReturnValue<R>(arg[0]); > } > }; > > template<typename F, int N> struct Functor; > template<typename Function> struct Functor<Function, 0> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { f(), ApplyReturnValue<R>(arg[0]); } > }; > template<typename Function> struct Functor<Function, 1> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { > f(*reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Function> struct Functor<Function, 2> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Function> struct Functor<Function, 3> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[4])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Function> struct Functor<Function, 4> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Function> struct Functor<Function, 5> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 4>::Value>::Type *>(arg[5])), ApplyReturnValue<R>(arg[0]); > } > }; > template<typename Function> struct Functor<Function, 6> > { > template <typename Args, typename R> > static void call(Function &f, void *, void **arg) { > f( *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 0>::Value>::Type *>(arg[1]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 1>::Value>::Type *>(arg[2]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 2>::Value>::Type *>(arg[3]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 3>::Value>::Type *>(arg[4]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 4>::Value>::Type *>(arg[5]), > *reinterpret_cast<typename RemoveRef<typename List_Select<Args, 5>::Value>::Type *>(arg[6])), ApplyReturnValue<R>(arg[0]); > } > }; ># 444 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" > template<typename A1, typename A2> struct AreArgumentsCompatible { > static int test(A2); > static char test(...); > static A1 dummy(); > enum { value = sizeof(test(dummy())) == sizeof(int) }; > }; > template<typename A1, typename A2> struct AreArgumentsCompatible<A1, A2&> { enum { value = false }; }; > template<typename A> struct AreArgumentsCompatible<A&, A&> { enum { value = true }; }; > > template<typename A> struct AreArgumentsCompatible<void, A> { enum { value = true }; }; > template<typename A> struct AreArgumentsCompatible<A, void> { enum { value = true }; }; > template<> struct AreArgumentsCompatible<void, void> { enum { value = true }; }; > > > template <typename List1, typename List2> struct CheckCompatibleArguments { enum { value = false }; }; > template <> struct CheckCompatibleArguments<void, void> { enum { value = true }; }; > template <typename List1> struct CheckCompatibleArguments<List1, void> { enum { value = true }; }; > template <typename Arg1, typename Arg2, typename Tail1, typename Tail2> struct CheckCompatibleArguments<List<Arg1, Tail1>, List<Arg2, Tail2> > > { > enum { value = AreArgumentsCompatible<typename RemoveConstRef<Arg1>::Type, typename RemoveConstRef<Arg2>::Type>::value > && CheckCompatibleArguments<Tail1, Tail2>::value }; > }; ># 478 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs_impl.h" >} > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qobjectdefs_impl.h" 2 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" 2 > > > > > > >class QByteArray; >struct QArrayData; >typedef QArrayData QByteArrayData; > >class QString; ># 133 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" >template <typename T> >inline int qYouForgotTheQ_OBJECT_Macro(T, T) { return 0; } > >template <typename T1, typename T2> >inline void qYouForgotTheQ_OBJECT_Macro(T1, T2) {} ># 208 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" >__attribute__((visibility("default"))) const char *qFlagLocation(const char *method); ># 236 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobjectdefs.h" >class QObject; >class QMetaMethod; >class QMetaEnum; >class QMetaProperty; >class QMetaClassInfo; > > >class __attribute__((visibility("default"))) QGenericArgument >{ >public: > inline QGenericArgument(const char *aName = 0, const void *aData = 0) > : _data(aData), _name(aName) {} > inline void *data() const { return const_cast<void *>(_data); } > inline const char *name() const { return _name; } > >private: > const void *_data; > const char *_name; >}; > >class __attribute__((visibility("default"))) QGenericReturnArgument: public QGenericArgument >{ >public: > inline QGenericReturnArgument(const char *aName = 0, void *aData = 0) > : QGenericArgument(aName, aData) > {} >}; > >template <class T> >class QArgument: public QGenericArgument >{ >public: > inline QArgument(const char *aName, const T &aData) > : QGenericArgument(aName, static_cast<const void *>(&aData)) > {} >}; >template <class T> >class QArgument<T &>: public QGenericArgument >{ >public: > inline QArgument(const char *aName, T &aData) > : QGenericArgument(aName, static_cast<const void *>(&aData)) > {} >}; > > >template <typename T> >class QReturnArgument: public QGenericReturnArgument >{ >public: > inline QReturnArgument(const char *aName, T &aData) > : QGenericReturnArgument(aName, static_cast<void *>(&aData)) > {} >}; > >struct __attribute__((visibility("default"))) QMetaObject >{ > class Connection; > const char *className() const; > const QMetaObject *superClass() const; > > QObject *cast(QObject *obj) const; > const QObject *cast(const QObject *obj) const; > > > QString tr(const char *s, const char *c, int n = -1) const; > > > int methodOffset() const; > int enumeratorOffset() const; > int propertyOffset() const; > int classInfoOffset() const; > > int constructorCount() const; > int methodCount() const; > int enumeratorCount() const; > int propertyCount() const; > int classInfoCount() const; > > int indexOfConstructor(const char *constructor) const; > int indexOfMethod(const char *method) const; > int indexOfSignal(const char *signal) const; > int indexOfSlot(const char *slot) const; > int indexOfEnumerator(const char *name) const; > int indexOfProperty(const char *name) const; > int indexOfClassInfo(const char *name) const; > > QMetaMethod constructor(int index) const; > QMetaMethod method(int index) const; > QMetaEnum enumerator(int index) const; > QMetaProperty property(int index) const; > QMetaClassInfo classInfo(int index) const; > QMetaProperty userProperty() const; > > static bool checkConnectArgs(const char *signal, const char *method); > static bool checkConnectArgs(const QMetaMethod &signal, > const QMetaMethod &method); > static QByteArray normalizedSignature(const char *method); > static QByteArray normalizedType(const char *type); > > > static Connection connect(const QObject *sender, int signal_index, > const QObject *receiver, int method_index, > int type = 0, int *types = 0); > > static bool disconnect(const QObject *sender, int signal_index, > const QObject *receiver, int method_index); > static bool disconnectOne(const QObject *sender, int signal_index, > const QObject *receiver, int method_index); > > static void connectSlotsByName(QObject *o); > > > static void activate(QObject *sender, int signal_index, void **argv); > static void activate(QObject *sender, const QMetaObject *, int local_signal_index, void **argv); > static void activate(QObject *sender, int method_offset, int signal_offset, int local_signal_index, void **argv); > > static bool invokeMethod(QObject *obj, const char *member, > Qt::ConnectionType, > QGenericReturnArgument ret, > QGenericArgument val0 = QGenericArgument(0), > QGenericArgument val1 = QGenericArgument(), > QGenericArgument val2 = QGenericArgument(), > QGenericArgument val3 = QGenericArgument(), > QGenericArgument val4 = QGenericArgument(), > QGenericArgument val5 = QGenericArgument(), > QGenericArgument val6 = QGenericArgument(), > QGenericArgument val7 = QGenericArgument(), > QGenericArgument val8 = QGenericArgument(), > QGenericArgument val9 = QGenericArgument()); > > static inline bool invokeMethod(QObject *obj, const char *member, > QGenericReturnArgument ret, > QGenericArgument val0 = QGenericArgument(0), > QGenericArgument val1 = QGenericArgument(), > QGenericArgument val2 = QGenericArgument(), > QGenericArgument val3 = QGenericArgument(), > QGenericArgument val4 = QGenericArgument(), > QGenericArgument val5 = QGenericArgument(), > QGenericArgument val6 = QGenericArgument(), > QGenericArgument val7 = QGenericArgument(), > QGenericArgument val8 = QGenericArgument(), > QGenericArgument val9 = QGenericArgument()) > { > return invokeMethod(obj, member, Qt::AutoConnection, ret, val0, val1, val2, val3, > val4, val5, val6, val7, val8, val9); > } > > static inline bool invokeMethod(QObject *obj, const char *member, > Qt::ConnectionType type, > QGenericArgument val0 = QGenericArgument(0), > QGenericArgument val1 = QGenericArgument(), > QGenericArgument val2 = QGenericArgument(), > QGenericArgument val3 = QGenericArgument(), > QGenericArgument val4 = QGenericArgument(), > QGenericArgument val5 = QGenericArgument(), > QGenericArgument val6 = QGenericArgument(), > QGenericArgument val7 = QGenericArgument(), > QGenericArgument val8 = QGenericArgument(), > QGenericArgument val9 = QGenericArgument()) > { > return invokeMethod(obj, member, type, QGenericReturnArgument(), val0, val1, val2, > val3, val4, val5, val6, val7, val8, val9); > } > > static inline bool invokeMethod(QObject *obj, const char *member, > QGenericArgument val0 = QGenericArgument(0), > QGenericArgument val1 = QGenericArgument(), > QGenericArgument val2 = QGenericArgument(), > QGenericArgument val3 = QGenericArgument(), > QGenericArgument val4 = QGenericArgument(), > QGenericArgument val5 = QGenericArgument(), > QGenericArgument val6 = QGenericArgument(), > QGenericArgument val7 = QGenericArgument(), > QGenericArgument val8 = QGenericArgument(), > QGenericArgument val9 = QGenericArgument()) > { > return invokeMethod(obj, member, Qt::AutoConnection, QGenericReturnArgument(), val0, > val1, val2, val3, val4, val5, val6, val7, val8, val9); > } > > QObject *newInstance(QGenericArgument val0 = QGenericArgument(0), > QGenericArgument val1 = QGenericArgument(), > QGenericArgument val2 = QGenericArgument(), > QGenericArgument val3 = QGenericArgument(), > QGenericArgument val4 = QGenericArgument(), > QGenericArgument val5 = QGenericArgument(), > QGenericArgument val6 = QGenericArgument(), > QGenericArgument val7 = QGenericArgument(), > QGenericArgument val8 = QGenericArgument(), > QGenericArgument val9 = QGenericArgument()) const; > > enum Call { > InvokeMetaMethod, > ReadProperty, > WriteProperty, > ResetProperty, > QueryPropertyDesignable, > QueryPropertyScriptable, > QueryPropertyStored, > QueryPropertyEditable, > QueryPropertyUser, > CreateInstance, > IndexOfMethod > }; > > int static_metacall(Call, int, void **) const; > static int metacall(QObject *, Call, int, void **); > > struct { > const QMetaObject *superdata; > const QByteArrayData *stringdata; > const uint *data; > typedef void (*StaticMetacallFunction)(QObject *, QMetaObject::Call, int, void **); > StaticMetacallFunction static_metacall; > const QMetaObject **relatedMetaObjects; > void *extradata; > } d; >}; > >class __attribute__((visibility("default"))) QMetaObject::Connection { > void *d_ptr; > explicit Connection(void *data) : d_ptr(data) { } > friend class QObject; > friend struct QMetaObject; >public: > ~Connection(); > Connection(); > Connection(const Connection &other); > Connection &operator=(const Connection &other); > > > > typedef void *Connection::*RestrictedBool; > operator RestrictedBool() const { return d_ptr ? &Connection::d_ptr : 0; } > > > > > > > >}; > >inline const QMetaObject *QMetaObject::superClass() const >{ return d.superdata; } > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qobjectdefs.h" 2 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 49 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qbytearray.h" 1 ># 50 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qlist.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qalgorithms.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qiterator.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qiterator.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qiterator.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qiterator.h" 2 > > > > ># 191 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qiterator.h" > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qiterator.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qrefcount.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 2 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 1 3 ># 58 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 3 > ># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 3 > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 1 3 ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ios" 1 3 ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ios" 3 > ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ios" 3 > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > class locale > { > public: > > > typedef int category; > > > class facet; > class id; > class _Impl; > > friend class facet; > friend class _Impl; > > template<typename _Facet> > friend bool > has_facet(const locale&) throw(); > > template<typename _Facet> > friend const _Facet& > use_facet(const locale&); > > template<typename _Cache> > friend struct __use_cache; ># 100 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > static const category none = 0; > static const category ctype = 1L << 0; > static const category numeric = 1L << 1; > static const category collate = 1L << 2; > static const category time = 1L << 3; > static const category monetary = 1L << 4; > static const category messages = 1L << 5; > static const category all = (ctype | numeric | collate | > time | monetary | messages); ># 119 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > locale() throw(); ># 128 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > locale(const locale& __other) throw(); ># 138 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > explicit > locale(const char* __s); ># 153 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > locale(const locale& __base, const char* __s, category __cat); ># 166 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > locale(const locale& __base, const locale& __add, category __cat); ># 179 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > template<typename _Facet> > locale(const locale& __other, _Facet* __f); > > > ~locale() throw(); ># 193 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > const locale& > operator=(const locale& __other) throw(); ># 208 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > template<typename _Facet> > locale > combine(const locale& __other) const; > > > > > > > string > name() const; ># 227 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > bool > operator==(const locale& __other) const throw(); > > > > > > > > bool > operator!=(const locale& __other) const throw() > { return !(this->operator==(__other)); } ># 255 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > template<typename _Char, typename _Traits, typename _Alloc> > bool > operator()(const basic_string<_Char, _Traits, _Alloc>& __s1, > const basic_string<_Char, _Traits, _Alloc>& __s2) const; ># 271 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > static locale > global(const locale& __loc); > > > > > static const locale& > classic(); > > private: > > _Impl* _M_impl; > > > static _Impl* _S_classic; > > > static _Impl* _S_global; > > > > > > static const char* const* const _S_categories; ># 306 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > enum { _S_categories_size = 6 + 6 }; > > > static __gthread_once_t _S_once; > > > explicit > locale(_Impl*) throw(); > > static void > _S_initialize(); > > static void > _S_initialize_once() throw(); > > static category > _S_normalize_category(category); > > void > _M_coalesce(const locale& __base, const locale& __add, category __cat); > }; ># 340 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > class locale::facet > { > private: > friend class locale; > friend class locale::_Impl; > > mutable _Atomic_word _M_refcount; > > > static __c_locale _S_c_locale; > > > static const char _S_c_name[2]; > > > static __gthread_once_t _S_once; > > > static void > _S_initialize_once(); > > protected: ># 371 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > explicit > facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0) > { } > > > virtual > ~facet(); > > static void > _S_create_c_locale(__c_locale& __cloc, const char* __s, > __c_locale __old = 0); > > static __c_locale > _S_clone_c_locale(__c_locale& __cloc) throw(); > > static void > _S_destroy_c_locale(__c_locale& __cloc); > > static __c_locale > _S_lc_ctype_c_locale(__c_locale __cloc, const char* __s); > > > > static __c_locale > _S_get_c_locale(); > > __attribute__ ((__const__)) static const char* > _S_get_c_name() throw(); > > private: > void > _M_add_reference() const throw() > { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } > > void > _M_remove_reference() const throw() > { > > ; > if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) > { > ; > try > { delete this; } > catch(...) > { } > } > } > > facet(const facet&); > > facet& > operator=(const facet&); > }; ># 438 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > class locale::id > { > private: > friend class locale; > friend class locale::_Impl; > > template<typename _Facet> > friend const _Facet& > use_facet(const locale&); > > template<typename _Facet> > friend bool > has_facet(const locale&) throw(); > > > > > mutable size_t _M_index; > > > static _Atomic_word _S_refcount; > > void > operator=(const id&); > > id(const id&); > > public: > > > > id() { } > > size_t > _M_id() const throw(); > }; > > > > class locale::_Impl > { > public: > > friend class locale; > friend class locale::facet; > > template<typename _Facet> > friend bool > has_facet(const locale&) throw(); > > template<typename _Facet> > friend const _Facet& > use_facet(const locale&); > > template<typename _Cache> > friend struct __use_cache; > > private: > > _Atomic_word _M_refcount; > const facet** _M_facets; > size_t _M_facets_size; > const facet** _M_caches; > char** _M_names; > static const locale::id* const _S_id_ctype[]; > static const locale::id* const _S_id_numeric[]; > static const locale::id* const _S_id_collate[]; > static const locale::id* const _S_id_time[]; > static const locale::id* const _S_id_monetary[]; > static const locale::id* const _S_id_messages[]; > static const locale::id* const* const _S_facet_categories[]; > > void > _M_add_reference() throw() > { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } > > void > _M_remove_reference() throw() > { > > ; > if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) > { > ; > try > { delete this; } > catch(...) > { } > } > } > > _Impl(const _Impl&, size_t); > _Impl(const char*, size_t); > _Impl(size_t) throw(); > > ~_Impl() throw(); > > _Impl(const _Impl&); > > void > operator=(const _Impl&); > > bool > _M_check_same_name() > { > bool __ret = true; > if (_M_names[1]) > > for (size_t __i = 0; __ret && __i < _S_categories_size - 1; ++__i) > __ret = __builtin_strcmp(_M_names[__i], _M_names[__i + 1]) == 0; > return __ret; > } > > void > _M_replace_categories(const _Impl*, category); > > void > _M_replace_category(const _Impl*, const locale::id* const*); > > void > _M_replace_facet(const _Impl*, const locale::id*); > > void > _M_install_facet(const locale::id*, const facet*); > > template<typename _Facet> > void > _M_init_facet(_Facet* __facet) > { _M_install_facet(&_Facet::id, __facet); } > > void > _M_install_cache(const facet*, size_t); > }; ># 585 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > template<typename _CharT> > class collate : public locale::facet > { > public: > > > > typedef _CharT char_type; > typedef basic_string<_CharT> string_type; > > > protected: > > > __c_locale _M_c_locale_collate; > > public: > > static locale::id id; ># 612 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > explicit > collate(size_t __refs = 0) > : facet(__refs), _M_c_locale_collate(_S_get_c_locale()) > { } ># 626 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > explicit > collate(__c_locale __cloc, size_t __refs = 0) > : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc)) > { } ># 643 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > int > compare(const _CharT* __lo1, const _CharT* __hi1, > const _CharT* __lo2, const _CharT* __hi2) const > { return this->do_compare(__lo1, __hi1, __lo2, __hi2); } ># 662 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > string_type > transform(const _CharT* __lo, const _CharT* __hi) const > { return this->do_transform(__lo, __hi); } ># 676 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > long > hash(const _CharT* __lo, const _CharT* __hi) const > { return this->do_hash(__lo, __hi); } > > > int > _M_compare(const _CharT*, const _CharT*) const throw(); > > size_t > _M_transform(_CharT*, const _CharT*, size_t) const throw(); > > protected: > > virtual > ~collate() > { _S_destroy_c_locale(_M_c_locale_collate); } ># 705 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > virtual int > do_compare(const _CharT* __lo1, const _CharT* __hi1, > const _CharT* __lo2, const _CharT* __hi2) const; ># 719 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > virtual string_type > do_transform(const _CharT* __lo, const _CharT* __hi) const; ># 732 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 3 > virtual long > do_hash(const _CharT* __lo, const _CharT* __hi) const; > }; > > template<typename _CharT> > locale::id collate<_CharT>::id; > > > template<> > int > collate<char>::_M_compare(const char*, const char*) const throw(); > > template<> > size_t > collate<char>::_M_transform(char*, const char*, size_t) const throw(); > > > template<> > int > collate<wchar_t>::_M_compare(const wchar_t*, const wchar_t*) const throw(); > > template<> > size_t > collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const throw(); > > > > template<typename _CharT> > class collate_byname : public collate<_CharT> > { > public: > > > typedef _CharT char_type; > typedef basic_string<_CharT> string_type; > > > explicit > collate_byname(const char* __s, size_t __refs = 0) > : collate<_CharT>(__refs) > { > if (__builtin_strcmp(__s, "C") != 0 > && __builtin_strcmp(__s, "POSIX") != 0) > { > this->_S_destroy_c_locale(this->_M_c_locale_collate); > this->_S_create_c_locale(this->_M_c_locale_collate, __s); > } > } > > protected: > virtual > ~collate_byname() { } > }; > > >} > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.tcc" 1 3 ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.tcc" 3 > ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.tcc" 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _Facet> > locale:: > locale(const locale& __other, _Facet* __f) > { > _M_impl = new _Impl(*__other._M_impl, 1); > > try > { _M_impl->_M_install_facet(&_Facet::id, __f); } > catch(...) > { > _M_impl->_M_remove_reference(); > throw; > } > delete [] _M_impl->_M_names[0]; > _M_impl->_M_names[0] = 0; > } > > template<typename _Facet> > locale > locale:: > combine(const locale& __other) const > { > _Impl* __tmp = new _Impl(*_M_impl, 1); > try > { > __tmp->_M_replace_facet(__other._M_impl, &_Facet::id); > } > catch(...) > { > __tmp->_M_remove_reference(); > throw; > } > return locale(__tmp); > } > > template<typename _CharT, typename _Traits, typename _Alloc> > bool > locale:: > operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1, > const basic_string<_CharT, _Traits, _Alloc>& __s2) const > { > typedef std::collate<_CharT> __collate_type; > const __collate_type& __collate = use_facet<__collate_type>(*this); > return (__collate.compare(__s1.data(), __s1.data() + __s1.length(), > __s2.data(), __s2.data() + __s2.length()) < 0); > } ># 101 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.tcc" 3 > template<typename _Facet> > bool > has_facet(const locale& __loc) throw() > { > const size_t __i = _Facet::id._M_id(); > const locale::facet** __facets = __loc._M_impl->_M_facets; > return (__i < __loc._M_impl->_M_facets_size > > && dynamic_cast<const _Facet*>(__facets[__i])); > > > > } ># 128 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.tcc" 3 > template<typename _Facet> > const _Facet& > use_facet(const locale& __loc) > { > const size_t __i = _Facet::id._M_id(); > const locale::facet** __facets = __loc._M_impl->_M_facets; > if (__i >= __loc._M_impl->_M_facets_size || !__facets[__i]) > __throw_bad_cast(); > > return dynamic_cast<const _Facet&>(*__facets[__i]); > > > > } > > > > template<typename _CharT> > int > collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const throw () > { return 0; } > > > template<typename _CharT> > size_t > collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const throw () > { return 0; } > > template<typename _CharT> > int > collate<_CharT>:: > do_compare(const _CharT* __lo1, const _CharT* __hi1, > const _CharT* __lo2, const _CharT* __hi2) const > { > > > const string_type __one(__lo1, __hi1); > const string_type __two(__lo2, __hi2); > > const _CharT* __p = __one.c_str(); > const _CharT* __pend = __one.data() + __one.length(); > const _CharT* __q = __two.c_str(); > const _CharT* __qend = __two.data() + __two.length(); > > > > > for (;;) > { > const int __res = _M_compare(__p, __q); > if (__res) > return __res; > > __p += char_traits<_CharT>::length(__p); > __q += char_traits<_CharT>::length(__q); > if (__p == __pend && __q == __qend) > return 0; > else if (__p == __pend) > return -1; > else if (__q == __qend) > return 1; > > __p++; > __q++; > } > } > > template<typename _CharT> > typename collate<_CharT>::string_type > collate<_CharT>:: > do_transform(const _CharT* __lo, const _CharT* __hi) const > { > string_type __ret; > > > const string_type __str(__lo, __hi); > > const _CharT* __p = __str.c_str(); > const _CharT* __pend = __str.data() + __str.length(); > > size_t __len = (__hi - __lo) * 2; > > _CharT* __c = new _CharT[__len]; > > try > { > > > > for (;;) > { > > size_t __res = _M_transform(__c, __p, __len); > > > if (__res >= __len) > { > __len = __res + 1; > delete [] __c, __c = 0; > __c = new _CharT[__len]; > __res = _M_transform(__c, __p, __len); > } > > __ret.append(__c, __res); > __p += char_traits<_CharT>::length(__p); > if (__p == __pend) > break; > > __p++; > __ret.push_back(_CharT()); > } > } > catch(...) > { > delete [] __c; > throw; > } > > delete [] __c; > > return __ret; > } > > template<typename _CharT> > long > collate<_CharT>:: > do_hash(const _CharT* __lo, const _CharT* __hi) const > { > unsigned long __val = 0; > for (; __lo < __hi; ++__lo) > __val = > *__lo + ((__val << 7) > | (__val >> (__gnu_cxx::__numeric_traits<unsigned long>:: > __digits - 7))); > return static_cast<long>(__val); > } > > > > > extern template class collate<char>; > extern template class collate_byname<char>; > > extern template > const collate<char>& > use_facet<collate<char> >(const locale&); > > extern template > bool > has_facet<collate<char> >(const locale&); > > > extern template class collate<wchar_t>; > extern template class collate_byname<wchar_t>; > > extern template > const collate<wchar_t>& > use_facet<collate<wchar_t> >(const locale&); > > extern template > bool > has_facet<collate<wchar_t> >(const locale&); > > > > >} ># 790 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_classes.h" 2 3 ># 44 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > > > > enum _Ios_Fmtflags > { > _S_boolalpha = 1L << 0, > _S_dec = 1L << 1, > _S_fixed = 1L << 2, > _S_hex = 1L << 3, > _S_internal = 1L << 4, > _S_left = 1L << 5, > _S_oct = 1L << 6, > _S_right = 1L << 7, > _S_scientific = 1L << 8, > _S_showbase = 1L << 9, > _S_showpoint = 1L << 10, > _S_showpos = 1L << 11, > _S_skipws = 1L << 12, > _S_unitbuf = 1L << 13, > _S_uppercase = 1L << 14, > _S_adjustfield = _S_left | _S_right | _S_internal, > _S_basefield = _S_dec | _S_oct | _S_hex, > _S_floatfield = _S_scientific | _S_fixed, > _S_ios_fmtflags_end = 1L << 16 > }; > > inline _Ios_Fmtflags > operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b) > { return _Ios_Fmtflags(static_cast<int>(__a) & static_cast<int>(__b)); } > > inline _Ios_Fmtflags > operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b) > { return _Ios_Fmtflags(static_cast<int>(__a) | static_cast<int>(__b)); } > > inline _Ios_Fmtflags > operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b) > { return _Ios_Fmtflags(static_cast<int>(__a) ^ static_cast<int>(__b)); } > > inline _Ios_Fmtflags > operator~(_Ios_Fmtflags __a) > { return _Ios_Fmtflags(~static_cast<int>(__a)); } > > inline const _Ios_Fmtflags& > operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) > { return __a = __a | __b; } > > inline const _Ios_Fmtflags& > operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) > { return __a = __a & __b; } > > inline const _Ios_Fmtflags& > operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) > { return __a = __a ^ __b; } > > > enum _Ios_Openmode > { > _S_app = 1L << 0, > _S_ate = 1L << 1, > _S_bin = 1L << 2, > _S_in = 1L << 3, > _S_out = 1L << 4, > _S_trunc = 1L << 5, > _S_ios_openmode_end = 1L << 16 > }; > > inline _Ios_Openmode > operator&(_Ios_Openmode __a, _Ios_Openmode __b) > { return _Ios_Openmode(static_cast<int>(__a) & static_cast<int>(__b)); } > > inline _Ios_Openmode > operator|(_Ios_Openmode __a, _Ios_Openmode __b) > { return _Ios_Openmode(static_cast<int>(__a) | static_cast<int>(__b)); } > > inline _Ios_Openmode > operator^(_Ios_Openmode __a, _Ios_Openmode __b) > { return _Ios_Openmode(static_cast<int>(__a) ^ static_cast<int>(__b)); } > > inline _Ios_Openmode > operator~(_Ios_Openmode __a) > { return _Ios_Openmode(~static_cast<int>(__a)); } > > inline const _Ios_Openmode& > operator|=(_Ios_Openmode& __a, _Ios_Openmode __b) > { return __a = __a | __b; } > > inline const _Ios_Openmode& > operator&=(_Ios_Openmode& __a, _Ios_Openmode __b) > { return __a = __a & __b; } > > inline const _Ios_Openmode& > operator^=(_Ios_Openmode& __a, _Ios_Openmode __b) > { return __a = __a ^ __b; } > > > enum _Ios_Iostate > { > _S_goodbit = 0, > _S_badbit = 1L << 0, > _S_eofbit = 1L << 1, > _S_failbit = 1L << 2, > _S_ios_iostate_end = 1L << 16 > }; > > inline _Ios_Iostate > operator&(_Ios_Iostate __a, _Ios_Iostate __b) > { return _Ios_Iostate(static_cast<int>(__a) & static_cast<int>(__b)); } > > inline _Ios_Iostate > operator|(_Ios_Iostate __a, _Ios_Iostate __b) > { return _Ios_Iostate(static_cast<int>(__a) | static_cast<int>(__b)); } > > inline _Ios_Iostate > operator^(_Ios_Iostate __a, _Ios_Iostate __b) > { return _Ios_Iostate(static_cast<int>(__a) ^ static_cast<int>(__b)); } > > inline _Ios_Iostate > operator~(_Ios_Iostate __a) > { return _Ios_Iostate(~static_cast<int>(__a)); } > > inline const _Ios_Iostate& > operator|=(_Ios_Iostate& __a, _Ios_Iostate __b) > { return __a = __a | __b; } > > inline const _Ios_Iostate& > operator&=(_Ios_Iostate& __a, _Ios_Iostate __b) > { return __a = __a & __b; } > > inline const _Ios_Iostate& > operator^=(_Ios_Iostate& __a, _Ios_Iostate __b) > { return __a = __a ^ __b; } > > > enum _Ios_Seekdir > { > _S_beg = 0, > _S_cur = 1, > _S_end = 2, > _S_ios_seekdir_end = 1L << 16 > }; ># 201 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > class ios_base > { > public: > > > > > > > > class failure : public exception > { > public: > > > explicit > failure(const string& __str) throw(); > > > > virtual > ~failure() throw(); > > virtual const char* > what() const throw(); > > private: > string _M_msg; > }; ># 257 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > typedef _Ios_Fmtflags fmtflags; > > > static const fmtflags boolalpha = _S_boolalpha; > > > static const fmtflags dec = _S_dec; > > > static const fmtflags fixed = _S_fixed; > > > static const fmtflags hex = _S_hex; > > > > > static const fmtflags internal = _S_internal; > > > > static const fmtflags left = _S_left; > > > static const fmtflags oct = _S_oct; > > > > static const fmtflags right = _S_right; > > > static const fmtflags scientific = _S_scientific; > > > > static const fmtflags showbase = _S_showbase; > > > > static const fmtflags showpoint = _S_showpoint; > > > static const fmtflags showpos = _S_showpos; > > > static const fmtflags skipws = _S_skipws; > > > static const fmtflags unitbuf = _S_unitbuf; > > > > static const fmtflags uppercase = _S_uppercase; > > > static const fmtflags adjustfield = _S_adjustfield; > > > static const fmtflags basefield = _S_basefield; > > > static const fmtflags floatfield = _S_floatfield; ># 332 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > typedef _Ios_Iostate iostate; > > > > static const iostate badbit = _S_badbit; > > > static const iostate eofbit = _S_eofbit; > > > > > static const iostate failbit = _S_failbit; > > > static const iostate goodbit = _S_goodbit; ># 363 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > typedef _Ios_Openmode openmode; > > > static const openmode app = _S_app; > > > static const openmode ate = _S_ate; > > > > > static const openmode binary = _S_bin; > > > static const openmode in = _S_in; > > > static const openmode out = _S_out; > > > static const openmode trunc = _S_trunc; ># 395 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > typedef _Ios_Seekdir seekdir; > > > static const seekdir beg = _S_beg; > > > static const seekdir cur = _S_cur; > > > static const seekdir end = _S_end; > > > typedef int io_state; > typedef int open_mode; > typedef int seek_dir; > > typedef std::streampos streampos; > typedef std::streamoff streamoff; ># 421 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > enum event > { > erase_event, > imbue_event, > copyfmt_event > }; ># 438 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > typedef void (*event_callback) (event __e, ios_base& __b, int __i); ># 450 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > void > register_callback(event_callback __fn, int __index); > > protected: > streamsize _M_precision; > streamsize _M_width; > fmtflags _M_flags; > iostate _M_exception; > iostate _M_streambuf_state; > > > > struct _Callback_list > { > > _Callback_list* _M_next; > ios_base::event_callback _M_fn; > int _M_index; > _Atomic_word _M_refcount; > > _Callback_list(ios_base::event_callback __fn, int __index, > _Callback_list* __cb) > : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { } > > void > _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } > > > int > _M_remove_reference() > { > > ; > int __res = __gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1); > if (__res == 0) > { > ; > } > return __res; > } > }; > > _Callback_list* _M_callbacks; > > void > _M_call_callbacks(event __ev) throw(); > > void > _M_dispose_callbacks(void) throw(); > > > struct _Words > { > void* _M_pword; > long _M_iword; > _Words() : _M_pword(0), _M_iword(0) { } > }; > > > _Words _M_word_zero; > > > > enum { _S_local_word_size = 8 }; > _Words _M_local_word[_S_local_word_size]; > > > int _M_word_size; > _Words* _M_word; > > _Words& > _M_grow_words(int __index, bool __iword); > > > locale _M_ios_locale; > > void > _M_init() throw(); > > public: > > > > > > class Init > { > friend class ios_base; > public: > Init(); > ~Init(); > > private: > static _Atomic_word _S_refcount; > static bool _S_synced_with_stdio; > }; > > > > > > > fmtflags > flags() const > { return _M_flags; } ># 563 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > fmtflags > flags(fmtflags __fmtfl) > { > fmtflags __old = _M_flags; > _M_flags = __fmtfl; > return __old; > } ># 579 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > fmtflags > setf(fmtflags __fmtfl) > { > fmtflags __old = _M_flags; > _M_flags |= __fmtfl; > return __old; > } ># 596 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > fmtflags > setf(fmtflags __fmtfl, fmtflags __mask) > { > fmtflags __old = _M_flags; > _M_flags &= ~__mask; > _M_flags |= (__fmtfl & __mask); > return __old; > } > > > > > > > > void > unsetf(fmtflags __mask) > { _M_flags &= ~__mask; } ># 622 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > streamsize > precision() const > { return _M_precision; } > > > > > > > streamsize > precision(streamsize __prec) > { > streamsize __old = _M_precision; > _M_precision = __prec; > return __old; > } > > > > > > > > streamsize > width() const > { return _M_width; } > > > > > > > streamsize > width(streamsize __wide) > { > streamsize __old = _M_width; > _M_width = __wide; > return __old; > } ># 673 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > static bool > sync_with_stdio(bool __sync = true); ># 685 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > locale > imbue(const locale& __loc) throw(); ># 696 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > locale > getloc() const > { return _M_ios_locale; } ># 707 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > const locale& > _M_getloc() const > { return _M_ios_locale; } ># 726 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > static int > xalloc() throw(); ># 742 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > long& > iword(int __ix) > { > _Words& __word = (__ix < _M_word_size) > ? _M_word[__ix] : _M_grow_words(__ix, true); > return __word._M_iword; > } ># 763 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > void*& > pword(int __ix) > { > _Words& __word = (__ix < _M_word_size) > ? _M_word[__ix] : _M_grow_words(__ix, false); > return __word._M_pword; > } ># 780 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h" 3 > virtual ~ios_base(); > > protected: > ios_base() throw (); > > > > private: > ios_base(const ios_base&); > > ios_base& > operator=(const ios_base&); > }; > > > > inline ios_base& > boolalpha(ios_base& __base) > { > __base.setf(ios_base::boolalpha); > return __base; > } > > > inline ios_base& > noboolalpha(ios_base& __base) > { > __base.unsetf(ios_base::boolalpha); > return __base; > } > > > inline ios_base& > showbase(ios_base& __base) > { > __base.setf(ios_base::showbase); > return __base; > } > > > inline ios_base& > noshowbase(ios_base& __base) > { > __base.unsetf(ios_base::showbase); > return __base; > } > > > inline ios_base& > showpoint(ios_base& __base) > { > __base.setf(ios_base::showpoint); > return __base; > } > > > inline ios_base& > noshowpoint(ios_base& __base) > { > __base.unsetf(ios_base::showpoint); > return __base; > } > > > inline ios_base& > showpos(ios_base& __base) > { > __base.setf(ios_base::showpos); > return __base; > } > > > inline ios_base& > noshowpos(ios_base& __base) > { > __base.unsetf(ios_base::showpos); > return __base; > } > > > inline ios_base& > skipws(ios_base& __base) > { > __base.setf(ios_base::skipws); > return __base; > } > > > inline ios_base& > noskipws(ios_base& __base) > { > __base.unsetf(ios_base::skipws); > return __base; > } > > > inline ios_base& > uppercase(ios_base& __base) > { > __base.setf(ios_base::uppercase); > return __base; > } > > > inline ios_base& > nouppercase(ios_base& __base) > { > __base.unsetf(ios_base::uppercase); > return __base; > } > > > inline ios_base& > unitbuf(ios_base& __base) > { > __base.setf(ios_base::unitbuf); > return __base; > } > > > inline ios_base& > nounitbuf(ios_base& __base) > { > __base.unsetf(ios_base::unitbuf); > return __base; > } > > > > inline ios_base& > internal(ios_base& __base) > { > __base.setf(ios_base::internal, ios_base::adjustfield); > return __base; > } > > > inline ios_base& > left(ios_base& __base) > { > __base.setf(ios_base::left, ios_base::adjustfield); > return __base; > } > > > inline ios_base& > right(ios_base& __base) > { > __base.setf(ios_base::right, ios_base::adjustfield); > return __base; > } > > > > inline ios_base& > dec(ios_base& __base) > { > __base.setf(ios_base::dec, ios_base::basefield); > return __base; > } > > > inline ios_base& > hex(ios_base& __base) > { > __base.setf(ios_base::hex, ios_base::basefield); > return __base; > } > > > inline ios_base& > oct(ios_base& __base) > { > __base.setf(ios_base::oct, ios_base::basefield); > return __base; > } > > > > inline ios_base& > fixed(ios_base& __base) > { > __base.setf(ios_base::fixed, ios_base::floatfield); > return __base; > } > > > inline ios_base& > scientific(ios_base& __base) > { > __base.setf(ios_base::scientific, ios_base::floatfield); > return __base; > } > > >} ># 44 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ios" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 1 3 ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 ># 46 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits> > streamsize > __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*, > basic_streambuf<_CharT, _Traits>*, bool&); ># 116 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > template<typename _CharT, typename _Traits> > class basic_streambuf > { > public: > > > > > > > typedef _CharT char_type; > typedef _Traits traits_type; > typedef typename traits_type::int_type int_type; > typedef typename traits_type::pos_type pos_type; > typedef typename traits_type::off_type off_type; > > > > > typedef basic_streambuf<char_type, traits_type> __streambuf_type; > > > friend class basic_ios<char_type, traits_type>; > friend class basic_istream<char_type, traits_type>; > friend class basic_ostream<char_type, traits_type>; > friend class istreambuf_iterator<char_type, traits_type>; > friend class ostreambuf_iterator<char_type, traits_type>; > > friend streamsize > __copy_streambufs_eof<>(__streambuf_type*, __streambuf_type*, bool&); > > template<bool _IsMove, typename _CharT2> > friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, > _CharT2*>::__type > __copy_move_a2(istreambuf_iterator<_CharT2>, > istreambuf_iterator<_CharT2>, _CharT2*); > > template<typename _CharT2> > friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, > istreambuf_iterator<_CharT2> >::__type > find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, > const _CharT2&); > > template<typename _CharT2, typename _Traits2> > friend basic_istream<_CharT2, _Traits2>& > operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*); > > template<typename _CharT2, typename _Traits2, typename _Alloc> > friend basic_istream<_CharT2, _Traits2>& > operator>>(basic_istream<_CharT2, _Traits2>&, > basic_string<_CharT2, _Traits2, _Alloc>&); > > template<typename _CharT2, typename _Traits2, typename _Alloc> > friend basic_istream<_CharT2, _Traits2>& > getline(basic_istream<_CharT2, _Traits2>&, > basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2); > > protected: ># 182 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > char_type* _M_in_beg; > char_type* _M_in_cur; > char_type* _M_in_end; > char_type* _M_out_beg; > char_type* _M_out_cur; > char_type* _M_out_end; > > > locale _M_buf_locale; > > public: > > virtual > ~basic_streambuf() > { } ># 206 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > locale > pubimbue(const locale& __loc) > { > locale __tmp(this->getloc()); > this->imbue(__loc); > _M_buf_locale = __loc; > return __tmp; > } ># 223 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > locale > getloc() const > { return _M_buf_locale; } ># 236 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > __streambuf_type* > pubsetbuf(char_type* __s, streamsize __n) > { return this->setbuf(__s, __n); } ># 248 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > pos_type > pubseekoff(off_type __off, ios_base::seekdir __way, > ios_base::openmode __mode = ios_base::in | ios_base::out) > { return this->seekoff(__off, __way, __mode); } ># 260 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > pos_type > pubseekpos(pos_type __sp, > ios_base::openmode __mode = ios_base::in | ios_base::out) > { return this->seekpos(__sp, __mode); } > > > > > int > pubsync() { return this->sync(); } ># 281 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > streamsize > in_avail() > { > const streamsize __ret = this->egptr() - this->gptr(); > return __ret ? __ret : this->showmanyc(); > } ># 295 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > int_type > snextc() > { > int_type __ret = traits_type::eof(); > if (__builtin_expect(!traits_type::eq_int_type(this->sbumpc(), > __ret), true)) > __ret = this->sgetc(); > return __ret; > } ># 313 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > int_type > sbumpc() > { > int_type __ret; > if (__builtin_expect(this->gptr() < this->egptr(), true)) > { > __ret = traits_type::to_int_type(*this->gptr()); > this->gbump(1); > } > else > __ret = this->uflow(); > return __ret; > } ># 335 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > int_type > sgetc() > { > int_type __ret; > if (__builtin_expect(this->gptr() < this->egptr(), true)) > __ret = traits_type::to_int_type(*this->gptr()); > else > __ret = this->underflow(); > return __ret; > } ># 354 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > streamsize > sgetn(char_type* __s, streamsize __n) > { return this->xsgetn(__s, __n); } ># 369 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > int_type > sputbackc(char_type __c) > { > int_type __ret; > const bool __testpos = this->eback() < this->gptr(); > if (__builtin_expect(!__testpos || > !traits_type::eq(__c, this->gptr()[-1]), false)) > __ret = this->pbackfail(traits_type::to_int_type(__c)); > else > { > this->gbump(-1); > __ret = traits_type::to_int_type(*this->gptr()); > } > return __ret; > } ># 394 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > int_type > sungetc() > { > int_type __ret; > if (__builtin_expect(this->eback() < this->gptr(), true)) > { > this->gbump(-1); > __ret = traits_type::to_int_type(*this->gptr()); > } > else > __ret = this->pbackfail(); > return __ret; > } ># 421 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > int_type > sputc(char_type __c) > { > int_type __ret; > if (__builtin_expect(this->pptr() < this->epptr(), true)) > { > *this->pptr() = __c; > this->pbump(1); > __ret = traits_type::to_int_type(__c); > } > else > __ret = this->overflow(traits_type::to_int_type(__c)); > return __ret; > } ># 447 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > streamsize > sputn(const char_type* __s, streamsize __n) > { return this->xsputn(__s, __n); } > > protected: ># 461 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > basic_streambuf() > : _M_in_beg(0), _M_in_cur(0), _M_in_end(0), > _M_out_beg(0), _M_out_cur(0), _M_out_end(0), > _M_buf_locale(locale()) > { } ># 479 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > char_type* > eback() const { return _M_in_beg; } > > char_type* > gptr() const { return _M_in_cur; } > > char_type* > egptr() const { return _M_in_end; } ># 495 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > void > gbump(int __n) { _M_in_cur += __n; } ># 506 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > void > setg(char_type* __gbeg, char_type* __gnext, char_type* __gend) > { > _M_in_beg = __gbeg; > _M_in_cur = __gnext; > _M_in_end = __gend; > } ># 526 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > char_type* > pbase() const { return _M_out_beg; } > > char_type* > pptr() const { return _M_out_cur; } > > char_type* > epptr() const { return _M_out_end; } ># 542 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > void > pbump(int __n) { _M_out_cur += __n; } ># 552 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > void > setp(char_type* __pbeg, char_type* __pend) > { > _M_out_beg = _M_out_cur = __pbeg; > _M_out_end = __pend; > } ># 573 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual void > imbue(const locale& __loc) > { } ># 588 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual basic_streambuf<char_type,_Traits>* > setbuf(char_type*, streamsize) > { return this; } ># 599 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual pos_type > seekoff(off_type, ios_base::seekdir, > ios_base::openmode = ios_base::in | ios_base::out) > { return pos_type(off_type(-1)); } ># 611 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual pos_type > seekpos(pos_type, > ios_base::openmode = ios_base::in | ios_base::out) > { return pos_type(off_type(-1)); } ># 624 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual int > sync() { return 0; } ># 646 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual streamsize > showmanyc() { return 0; } ># 662 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual streamsize > xsgetn(char_type* __s, streamsize __n); ># 684 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual int_type > underflow() > { return traits_type::eof(); } ># 697 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual int_type > uflow() > { > int_type __ret = traits_type::eof(); > const bool __testeof = traits_type::eq_int_type(this->underflow(), > __ret); > if (!__testeof) > { > __ret = traits_type::to_int_type(*this->gptr()); > this->gbump(1); > } > return __ret; > } ># 721 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual int_type > pbackfail(int_type __c = traits_type::eof()) > { return traits_type::eof(); } ># 739 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual streamsize > xsputn(const char_type* __s, streamsize __n); ># 765 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > virtual int_type > overflow(int_type __c = traits_type::eof()) > { return traits_type::eof(); } > > > > public: ># 780 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 3 > void > stossc() > { > if (this->gptr() < this->egptr()) > this->gbump(1); > else > this->uflow(); > } > > > > void > __safe_gbump(streamsize __n) { _M_in_cur += __n; } > > void > __safe_pbump(streamsize __n) { _M_out_cur += __n; } > > private: > > > basic_streambuf(const __streambuf_type& __sb) > : _M_in_beg(__sb._M_in_beg), _M_in_cur(__sb._M_in_cur), > _M_in_end(__sb._M_in_end), _M_out_beg(__sb._M_out_beg), > _M_out_cur(__sb._M_out_cur), _M_out_end(__sb._M_out_cur), > _M_buf_locale(__sb._M_buf_locale) > { } > > __streambuf_type& > operator=(const __streambuf_type&) { return *this; }; > }; > > > template<> > streamsize > __copy_streambufs_eof(basic_streambuf<char>* __sbin, > basic_streambuf<char>* __sbout, bool& __ineof); > > template<> > streamsize > __copy_streambufs_eof(basic_streambuf<wchar_t>* __sbin, > basic_streambuf<wchar_t>* __sbout, bool& __ineof); > > > >} > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf.tcc" 1 3 ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf.tcc" 3 > ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf.tcc" 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits> > streamsize > basic_streambuf<_CharT, _Traits>:: > xsgetn(char_type* __s, streamsize __n) > { > streamsize __ret = 0; > while (__ret < __n) > { > const streamsize __buf_len = this->egptr() - this->gptr(); > if (__buf_len) > { > const streamsize __remaining = __n - __ret; > const streamsize __len = std::min(__buf_len, __remaining); > traits_type::copy(__s, this->gptr(), __len); > __ret += __len; > __s += __len; > this->__safe_gbump(__len); > } > > if (__ret < __n) > { > const int_type __c = this->uflow(); > if (!traits_type::eq_int_type(__c, traits_type::eof())) > { > traits_type::assign(*__s++, traits_type::to_char_type(__c)); > ++__ret; > } > else > break; > } > } > return __ret; > } > > template<typename _CharT, typename _Traits> > streamsize > basic_streambuf<_CharT, _Traits>:: > xsputn(const char_type* __s, streamsize __n) > { > streamsize __ret = 0; > while (__ret < __n) > { > const streamsize __buf_len = this->epptr() - this->pptr(); > if (__buf_len) > { > const streamsize __remaining = __n - __ret; > const streamsize __len = std::min(__buf_len, __remaining); > traits_type::copy(this->pptr(), __s, __len); > __ret += __len; > __s += __len; > this->__safe_pbump(__len); > } > > if (__ret < __n) > { > int_type __c = this->overflow(traits_type::to_int_type(*__s)); > if (!traits_type::eq_int_type(__c, traits_type::eof())) > { > ++__ret; > ++__s; > } > else > break; > } > } > return __ret; > } > > > > > template<typename _CharT, typename _Traits> > streamsize > __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin, > basic_streambuf<_CharT, _Traits>* __sbout, > bool& __ineof) > { > streamsize __ret = 0; > __ineof = true; > typename _Traits::int_type __c = __sbin->sgetc(); > while (!_Traits::eq_int_type(__c, _Traits::eof())) > { > __c = __sbout->sputc(_Traits::to_char_type(__c)); > if (_Traits::eq_int_type(__c, _Traits::eof())) > { > __ineof = false; > break; > } > ++__ret; > __c = __sbin->snextc(); > } > return __ret; > } > > template<typename _CharT, typename _Traits> > inline streamsize > __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin, > basic_streambuf<_CharT, _Traits>* __sbout) > { > bool __ineof; > return __copy_streambufs_eof(__sbin, __sbout, __ineof); > } > > > > > extern template class basic_streambuf<char>; > extern template > streamsize > __copy_streambufs(basic_streambuf<char>*, > basic_streambuf<char>*); > extern template > streamsize > __copy_streambufs_eof(basic_streambuf<char>*, > basic_streambuf<char>*, bool&); > > > extern template class basic_streambuf<wchar_t>; > extern template > streamsize > __copy_streambufs(basic_streambuf<wchar_t>*, > basic_streambuf<wchar_t>*); > extern template > streamsize > __copy_streambufs_eof(basic_streambuf<wchar_t>*, > basic_streambuf<wchar_t>*, bool&); > > > > >} ># 827 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/streambuf" 2 3 ># 45 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ios" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 1 3 ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > ># 36 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwctype" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwctype" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwctype" 3 ># 52 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwctype" 3 ># 1 "/usr/include/wctype.h" 1 3 4 ># 34 "/usr/include/wctype.h" 3 4 ># 1 "/usr/include/wchar.h" 1 3 4 ># 35 "/usr/include/wctype.h" 2 3 4 ># 50 "/usr/include/wctype.h" 3 4 > > > >typedef unsigned long int wctype_t; > ># 72 "/usr/include/wctype.h" 3 4 >enum >{ > __ISwupper = 0, > __ISwlower = 1, > __ISwalpha = 2, > __ISwdigit = 3, > __ISwxdigit = 4, > __ISwspace = 5, > __ISwprint = 6, > __ISwgraph = 7, > __ISwblank = 8, > __ISwcntrl = 9, > __ISwpunct = 10, > __ISwalnum = 11, > > _ISwupper = ((__ISwupper) < 8 ? (int) ((1UL << (__ISwupper)) << 24) : ((__ISwupper) < 16 ? (int) ((1UL << (__ISwupper)) << 8) : ((__ISwupper) < 24 ? (int) ((1UL << (__ISwupper)) >> 8) : (int) ((1UL << (__ISwupper)) >> 24)))), > _ISwlower = ((__ISwlower) < 8 ? (int) ((1UL << (__ISwlower)) << 24) : ((__ISwlower) < 16 ? (int) ((1UL << (__ISwlower)) << 8) : ((__ISwlower) < 24 ? (int) ((1UL << (__ISwlower)) >> 8) : (int) ((1UL << (__ISwlower)) >> 24)))), > _ISwalpha = ((__ISwalpha) < 8 ? (int) ((1UL << (__ISwalpha)) << 24) : ((__ISwalpha) < 16 ? (int) ((1UL << (__ISwalpha)) << 8) : ((__ISwalpha) < 24 ? (int) ((1UL << (__ISwalpha)) >> 8) : (int) ((1UL << (__ISwalpha)) >> 24)))), > _ISwdigit = ((__ISwdigit) < 8 ? (int) ((1UL << (__ISwdigit)) << 24) : ((__ISwdigit) < 16 ? (int) ((1UL << (__ISwdigit)) << 8) : ((__ISwdigit) < 24 ? (int) ((1UL << (__ISwdigit)) >> 8) : (int) ((1UL << (__ISwdigit)) >> 24)))), > _ISwxdigit = ((__ISwxdigit) < 8 ? (int) ((1UL << (__ISwxdigit)) << 24) : ((__ISwxdigit) < 16 ? (int) ((1UL << (__ISwxdigit)) << 8) : ((__ISwxdigit) < 24 ? (int) ((1UL << (__ISwxdigit)) >> 8) : (int) ((1UL << (__ISwxdigit)) >> 24)))), > _ISwspace = ((__ISwspace) < 8 ? (int) ((1UL << (__ISwspace)) << 24) : ((__ISwspace) < 16 ? (int) ((1UL << (__ISwspace)) << 8) : ((__ISwspace) < 24 ? (int) ((1UL << (__ISwspace)) >> 8) : (int) ((1UL << (__ISwspace)) >> 24)))), > _ISwprint = ((__ISwprint) < 8 ? (int) ((1UL << (__ISwprint)) << 24) : ((__ISwprint) < 16 ? (int) ((1UL << (__ISwprint)) << 8) : ((__ISwprint) < 24 ? (int) ((1UL << (__ISwprint)) >> 8) : (int) ((1UL << (__ISwprint)) >> 24)))), > _ISwgraph = ((__ISwgraph) < 8 ? (int) ((1UL << (__ISwgraph)) << 24) : ((__ISwgraph) < 16 ? (int) ((1UL << (__ISwgraph)) << 8) : ((__ISwgraph) < 24 ? (int) ((1UL << (__ISwgraph)) >> 8) : (int) ((1UL << (__ISwgraph)) >> 24)))), > _ISwblank = ((__ISwblank) < 8 ? (int) ((1UL << (__ISwblank)) << 24) : ((__ISwblank) < 16 ? (int) ((1UL << (__ISwblank)) << 8) : ((__ISwblank) < 24 ? (int) ((1UL << (__ISwblank)) >> 8) : (int) ((1UL << (__ISwblank)) >> 24)))), > _ISwcntrl = ((__ISwcntrl) < 8 ? (int) ((1UL << (__ISwcntrl)) << 24) : ((__ISwcntrl) < 16 ? (int) ((1UL << (__ISwcntrl)) << 8) : ((__ISwcntrl) < 24 ? (int) ((1UL << (__ISwcntrl)) >> 8) : (int) ((1UL << (__ISwcntrl)) >> 24)))), > _ISwpunct = ((__ISwpunct) < 8 ? (int) ((1UL << (__ISwpunct)) << 24) : ((__ISwpunct) < 16 ? (int) ((1UL << (__ISwpunct)) << 8) : ((__ISwpunct) < 24 ? (int) ((1UL << (__ISwpunct)) >> 8) : (int) ((1UL << (__ISwpunct)) >> 24)))), > _ISwalnum = ((__ISwalnum) < 8 ? (int) ((1UL << (__ISwalnum)) << 24) : ((__ISwalnum) < 16 ? (int) ((1UL << (__ISwalnum)) << 8) : ((__ISwalnum) < 24 ? (int) ((1UL << (__ISwalnum)) >> 8) : (int) ((1UL << (__ISwalnum)) >> 24)))) >}; > > > >extern "C" { > > > > > > > > >extern int iswalnum (wint_t __wc) throw (); > > > > > >extern int iswalpha (wint_t __wc) throw (); > > >extern int iswcntrl (wint_t __wc) throw (); > > > >extern int iswdigit (wint_t __wc) throw (); > > > >extern int iswgraph (wint_t __wc) throw (); > > > > >extern int iswlower (wint_t __wc) throw (); > > >extern int iswprint (wint_t __wc) throw (); > > > > >extern int iswpunct (wint_t __wc) throw (); > > > > >extern int iswspace (wint_t __wc) throw (); > > > > >extern int iswupper (wint_t __wc) throw (); > > > > >extern int iswxdigit (wint_t __wc) throw (); > > > > > >extern int iswblank (wint_t __wc) throw (); ># 172 "/usr/include/wctype.h" 3 4 >extern wctype_t wctype (__const char *__property) throw (); > > > >extern int iswctype (wint_t __wc, wctype_t __desc) throw (); > > > > > > > > > > >typedef __const __int32_t *wctrans_t; > > > > > > > >extern wint_t towlower (wint_t __wc) throw (); > > >extern wint_t towupper (wint_t __wc) throw (); > > >} ># 214 "/usr/include/wctype.h" 3 4 >extern "C" { > > > > >extern wctrans_t wctrans (__const char *__property) throw (); > > >extern wint_t towctrans (wint_t __wc, wctrans_t __desc) throw (); > > > > > > > > >extern int iswalnum_l (wint_t __wc, __locale_t __locale) throw (); > > > > > >extern int iswalpha_l (wint_t __wc, __locale_t __locale) throw (); > > >extern int iswcntrl_l (wint_t __wc, __locale_t __locale) throw (); > > > >extern int iswdigit_l (wint_t __wc, __locale_t __locale) throw (); > > > >extern int iswgraph_l (wint_t __wc, __locale_t __locale) throw (); > > > > >extern int iswlower_l (wint_t __wc, __locale_t __locale) throw (); > > >extern int iswprint_l (wint_t __wc, __locale_t __locale) throw (); > > > > >extern int iswpunct_l (wint_t __wc, __locale_t __locale) throw (); > > > > >extern int iswspace_l (wint_t __wc, __locale_t __locale) throw (); > > > > >extern int iswupper_l (wint_t __wc, __locale_t __locale) throw (); > > > > >extern int iswxdigit_l (wint_t __wc, __locale_t __locale) throw (); > > > > >extern int iswblank_l (wint_t __wc, __locale_t __locale) throw (); > > > >extern wctype_t wctype_l (__const char *__property, __locale_t __locale) > throw (); > > > >extern int iswctype_l (wint_t __wc, wctype_t __desc, __locale_t __locale) > throw (); > > > > > > > >extern wint_t towlower_l (wint_t __wc, __locale_t __locale) throw (); > > >extern wint_t towupper_l (wint_t __wc, __locale_t __locale) throw (); > > > >extern wctrans_t wctrans_l (__const char *__property, __locale_t __locale) > throw (); > > >extern wint_t towctrans_l (wint_t __wc, wctrans_t __desc, > __locale_t __locale) throw (); > > > >} ># 53 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwctype" 2 3 ># 82 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cwctype" 3 >namespace std >{ > using ::wctrans_t; > using ::wctype_t; > using ::wint_t; > > using ::iswalnum; > using ::iswalpha; > > using ::iswblank; > > using ::iswcntrl; > using ::iswctype; > using ::iswdigit; > using ::iswgraph; > using ::iswlower; > using ::iswprint; > using ::iswpunct; > using ::iswspace; > using ::iswupper; > using ::iswxdigit; > using ::towctrans; > using ::towlower; > using ::towupper; > using ::wctrans; > using ::wctype; >} ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 1 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 3 > ># 42 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/cctype" 3 ># 43 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/ctype_base.h" 1 3 ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/ctype_base.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > struct ctype_base > { > > typedef const int* __to_type; > > > > typedef unsigned short mask; > static const mask upper = _ISupper; > static const mask lower = _ISlower; > static const mask alpha = _ISalpha; > static const mask digit = _ISdigit; > static const mask xdigit = _ISxdigit; > static const mask space = _ISspace; > static const mask print = _ISprint; > static const mask graph = _ISalpha | _ISdigit | _ISpunct; > static const mask cntrl = _IScntrl; > static const mask punct = _ISpunct; > static const mask alnum = _ISalpha | _ISdigit; > }; > > >} ># 44 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 2 3 > > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf_iterator.h" 1 3 ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf_iterator.h" 3 > ># 36 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf_iterator.h" 3 > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 51 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf_iterator.h" 3 > template<typename _CharT, typename _Traits> > class istreambuf_iterator > : public iterator<input_iterator_tag, _CharT, typename _Traits::off_type, > _CharT*, > > > > > _CharT&> > > { > public: > > > > typedef _CharT char_type; > typedef _Traits traits_type; > typedef typename _Traits::int_type int_type; > typedef basic_streambuf<_CharT, _Traits> streambuf_type; > typedef basic_istream<_CharT, _Traits> istream_type; > > > template<typename _CharT2> > friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, > ostreambuf_iterator<_CharT2> >::__type > copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, > ostreambuf_iterator<_CharT2>); > > template<bool _IsMove, typename _CharT2> > friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, > _CharT2*>::__type > __copy_move_a2(istreambuf_iterator<_CharT2>, > istreambuf_iterator<_CharT2>, _CharT2*); > > template<typename _CharT2> > friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, > istreambuf_iterator<_CharT2> >::__type > find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, > const _CharT2&); > > private: > > > > > > > > mutable streambuf_type* _M_sbuf; > mutable int_type _M_c; > > public: > > istreambuf_iterator() throw() > : _M_sbuf(0), _M_c(traits_type::eof()) { } ># 114 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/streambuf_iterator.h" 3 > istreambuf_iterator(istream_type& __s) throw() > : _M_sbuf(__s.rdbuf()), _M_c(traits_type::eof()) { } > > > istreambuf_iterator(streambuf_type* __s) throw() > : _M_sbuf(__s), _M_c(traits_type::eof()) { } > > > > > char_type > operator*() const > { > > > > > > > > return traits_type::to_char_type(_M_get()); > } > > > istreambuf_iterator& > operator++() > { > > > ; > if (_M_sbuf) > { > _M_sbuf->sbumpc(); > _M_c = traits_type::eof(); > } > return *this; > } > > > istreambuf_iterator > operator++(int) > { > > > ; > > istreambuf_iterator __old = *this; > if (_M_sbuf) > { > __old._M_c = _M_sbuf->sbumpc(); > _M_c = traits_type::eof(); > } > return __old; > } > > > > > > bool > equal(const istreambuf_iterator& __b) const > { return _M_at_eof() == __b._M_at_eof(); } > > private: > int_type > _M_get() const > { > const int_type __eof = traits_type::eof(); > int_type __ret = __eof; > if (_M_sbuf) > { > if (!traits_type::eq_int_type(_M_c, __eof)) > __ret = _M_c; > else if (!traits_type::eq_int_type((__ret = _M_sbuf->sgetc()), > __eof)) > _M_c = __ret; > else > _M_sbuf = 0; > } > return __ret; > } > > bool > _M_at_eof() const > { > const int_type __eof = traits_type::eof(); > return traits_type::eq_int_type(_M_get(), __eof); > } > }; > > template<typename _CharT, typename _Traits> > inline bool > operator==(const istreambuf_iterator<_CharT, _Traits>& __a, > const istreambuf_iterator<_CharT, _Traits>& __b) > { return __a.equal(__b); } > > template<typename _CharT, typename _Traits> > inline bool > operator!=(const istreambuf_iterator<_CharT, _Traits>& __a, > const istreambuf_iterator<_CharT, _Traits>& __b) > { return !__a.equal(__b); } > > > template<typename _CharT, typename _Traits> > class ostreambuf_iterator > : public iterator<output_iterator_tag, void, void, void, void> > { > public: > > > > typedef _CharT char_type; > typedef _Traits traits_type; > typedef basic_streambuf<_CharT, _Traits> streambuf_type; > typedef basic_ostream<_CharT, _Traits> ostream_type; > > > template<typename _CharT2> > friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, > ostreambuf_iterator<_CharT2> >::__type > copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, > ostreambuf_iterator<_CharT2>); > > private: > streambuf_type* _M_sbuf; > bool _M_failed; > > public: > > ostreambuf_iterator(ostream_type& __s) throw() > : _M_sbuf(__s.rdbuf()), _M_failed(!_M_sbuf) { } > > > ostreambuf_iterator(streambuf_type* __s) throw() > : _M_sbuf(__s), _M_failed(!_M_sbuf) { } > > > ostreambuf_iterator& > operator=(_CharT __c) > { > if (!_M_failed && > _Traits::eq_int_type(_M_sbuf->sputc(__c), _Traits::eof())) > _M_failed = true; > return *this; > } > > > ostreambuf_iterator& > operator*() > { return *this; } > > > ostreambuf_iterator& > operator++(int) > { return *this; } > > > ostreambuf_iterator& > operator++() > { return *this; } > > > bool > failed() const throw() > { return _M_failed; } > > ostreambuf_iterator& > _M_put(const _CharT* __ws, streamsize __len) > { > if (__builtin_expect(!_M_failed, true) > && __builtin_expect(this->_M_sbuf->sputn(__ws, __len) != __len, > false)) > _M_failed = true; > return *this; > } > }; > > > template<typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > ostreambuf_iterator<_CharT> >::__type > copy(istreambuf_iterator<_CharT> __first, > istreambuf_iterator<_CharT> __last, > ostreambuf_iterator<_CharT> __result) > { > if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) > { > bool __ineof; > __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof); > if (!__ineof) > __result._M_failed = true; > } > return __result; > } > > template<bool _IsMove, typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > ostreambuf_iterator<_CharT> >::__type > __copy_move_a2(_CharT* __first, _CharT* __last, > ostreambuf_iterator<_CharT> __result) > { > const streamsize __num = __last - __first; > if (__num > 0) > __result._M_put(__first, __num); > return __result; > } > > template<bool _IsMove, typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > ostreambuf_iterator<_CharT> >::__type > __copy_move_a2(const _CharT* __first, const _CharT* __last, > ostreambuf_iterator<_CharT> __result) > { > const streamsize __num = __last - __first; > if (__num > 0) > __result._M_put(__first, __num); > return __result; > } > > template<bool _IsMove, typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > _CharT*>::__type > __copy_move_a2(istreambuf_iterator<_CharT> __first, > istreambuf_iterator<_CharT> __last, _CharT* __result) > { > typedef istreambuf_iterator<_CharT> __is_iterator_type; > typedef typename __is_iterator_type::traits_type traits_type; > typedef typename __is_iterator_type::streambuf_type streambuf_type; > typedef typename traits_type::int_type int_type; > > if (__first._M_sbuf && !__last._M_sbuf) > { > streambuf_type* __sb = __first._M_sbuf; > int_type __c = __sb->sgetc(); > while (!traits_type::eq_int_type(__c, traits_type::eof())) > { > const streamsize __n = __sb->egptr() - __sb->gptr(); > if (__n > 1) > { > traits_type::copy(__result, __sb->gptr(), __n); > __sb->__safe_gbump(__n); > __result += __n; > __c = __sb->underflow(); > } > else > { > *__result++ = traits_type::to_char_type(__c); > __c = __sb->snextc(); > } > } > } > return __result; > } > > template<typename _CharT> > typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, > istreambuf_iterator<_CharT> >::__type > find(istreambuf_iterator<_CharT> __first, > istreambuf_iterator<_CharT> __last, const _CharT& __val) > { > typedef istreambuf_iterator<_CharT> __is_iterator_type; > typedef typename __is_iterator_type::traits_type traits_type; > typedef typename __is_iterator_type::streambuf_type streambuf_type; > typedef typename traits_type::int_type int_type; > > if (__first._M_sbuf && !__last._M_sbuf) > { > const int_type __ival = traits_type::to_int_type(__val); > streambuf_type* __sb = __first._M_sbuf; > int_type __c = __sb->sgetc(); > while (!traits_type::eq_int_type(__c, traits_type::eof()) > && !traits_type::eq_int_type(__c, __ival)) > { > streamsize __n = __sb->egptr() - __sb->gptr(); > if (__n > 1) > { > const _CharT* __p = traits_type::find(__sb->gptr(), > __n, __val); > if (__p) > __n = __p - __sb->gptr(); > __sb->__safe_gbump(__n); > __c = __sb->sgetc(); > } > else > __c = __sb->snextc(); > } > > if (!traits_type::eq_int_type(__c, traits_type::eof())) > __first._M_c = __c; > else > __first._M_sbuf = 0; > } > return __first; > } > > > > >} ># 51 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 66 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<typename _Tp> > void > __convert_to_v(const char*, _Tp&, ios_base::iostate&, > const __c_locale&) throw(); > > > template<> > void > __convert_to_v(const char*, float&, ios_base::iostate&, > const __c_locale&) throw(); > > template<> > void > __convert_to_v(const char*, double&, ios_base::iostate&, > const __c_locale&) throw(); > > template<> > void > __convert_to_v(const char*, long double&, ios_base::iostate&, > const __c_locale&) throw(); > > > > template<typename _CharT, typename _Traits> > struct __pad > { > static void > _S_pad(ios_base& __io, _CharT __fill, _CharT* __news, > const _CharT* __olds, streamsize __newlen, streamsize __oldlen); > }; > > > > > > > template<typename _CharT> > _CharT* > __add_grouping(_CharT* __s, _CharT __sep, > const char* __gbeg, size_t __gsize, > const _CharT* __first, const _CharT* __last); > > > > > template<typename _CharT> > inline > ostreambuf_iterator<_CharT> > __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) > { > __s._M_put(__ws, __len); > return __s; > } > > > template<typename _CharT, typename _OutIter> > inline > _OutIter > __write(_OutIter __s, const _CharT* __ws, int __len) > { > for (int __j = 0; __j < __len; __j++, ++__s) > *__s = __ws[__j]; > return __s; > } ># 144 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<typename _CharT> > class __ctype_abstract_base : public locale::facet, public ctype_base > { > public: > > > typedef _CharT char_type; ># 163 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > bool > is(mask __m, char_type __c) const > { return this->do_is(__m, __c); } ># 180 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > is(const char_type *__lo, const char_type *__hi, mask *__vec) const > { return this->do_is(__lo, __hi, __vec); } ># 196 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > scan_is(mask __m, const char_type* __lo, const char_type* __hi) const > { return this->do_scan_is(__m, __lo, __hi); } ># 212 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > scan_not(mask __m, const char_type* __lo, const char_type* __hi) const > { return this->do_scan_not(__m, __lo, __hi); } ># 226 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > toupper(char_type __c) const > { return this->do_toupper(__c); } ># 241 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > toupper(char_type *__lo, const char_type* __hi) const > { return this->do_toupper(__lo, __hi); } ># 255 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > tolower(char_type __c) const > { return this->do_tolower(__c); } ># 270 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > tolower(char_type* __lo, const char_type* __hi) const > { return this->do_tolower(__lo, __hi); } ># 287 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > widen(char __c) const > { return this->do_widen(__c); } ># 306 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char* > widen(const char* __lo, const char* __hi, char_type* __to) const > { return this->do_widen(__lo, __hi, __to); } ># 325 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char > narrow(char_type __c, char __dfault) const > { return this->do_narrow(__c, __dfault); } ># 347 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > narrow(const char_type* __lo, const char_type* __hi, > char __dfault, char* __to) const > { return this->do_narrow(__lo, __hi, __dfault, __to); } > > protected: > explicit > __ctype_abstract_base(size_t __refs = 0): facet(__refs) { } > > virtual > ~__ctype_abstract_base() { } ># 372 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual bool > do_is(mask __m, char_type __c) const = 0; ># 391 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_is(const char_type* __lo, const char_type* __hi, > mask* __vec) const = 0; ># 410 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_scan_is(mask __m, const char_type* __lo, > const char_type* __hi) const = 0; ># 429 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_scan_not(mask __m, const char_type* __lo, > const char_type* __hi) const = 0; ># 447 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_toupper(char_type __c) const = 0; ># 464 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_toupper(char_type* __lo, const char_type* __hi) const = 0; ># 480 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_tolower(char_type __c) const = 0; ># 497 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_tolower(char_type* __lo, const char_type* __hi) const = 0; ># 516 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_widen(char __c) const = 0; ># 537 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char* > do_widen(const char* __lo, const char* __hi, char_type* __to) const = 0; ># 558 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char > do_narrow(char_type __c, char __dfault) const = 0; ># 583 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_narrow(const char_type* __lo, const char_type* __hi, > char __dfault, char* __to) const = 0; > }; ># 606 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<typename _CharT> > class ctype : public __ctype_abstract_base<_CharT> > { > public: > > typedef _CharT char_type; > typedef typename __ctype_abstract_base<_CharT>::mask mask; > > > static locale::id id; > > explicit > ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { } > > protected: > virtual > ~ctype(); > > virtual bool > do_is(mask __m, char_type __c) const; > > virtual const char_type* > do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; > > virtual const char_type* > do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; > > virtual const char_type* > do_scan_not(mask __m, const char_type* __lo, > const char_type* __hi) const; > > virtual char_type > do_toupper(char_type __c) const; > > virtual const char_type* > do_toupper(char_type* __lo, const char_type* __hi) const; > > virtual char_type > do_tolower(char_type __c) const; > > virtual const char_type* > do_tolower(char_type* __lo, const char_type* __hi) const; > > virtual char_type > do_widen(char __c) const; > > virtual const char* > do_widen(const char* __lo, const char* __hi, char_type* __dest) const; > > virtual char > do_narrow(char_type, char __dfault) const; > > virtual const char_type* > do_narrow(const char_type* __lo, const char_type* __hi, > char __dfault, char* __to) const; > }; > > template<typename _CharT> > locale::id ctype<_CharT>::id; ># 675 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<> > class ctype<char> : public locale::facet, public ctype_base > { > public: > > > typedef char char_type; > > protected: > > __c_locale _M_c_locale_ctype; > bool _M_del; > __to_type _M_toupper; > __to_type _M_tolower; > const mask* _M_table; > mutable char _M_widen_ok; > mutable char _M_widen[1 + static_cast<unsigned char>(-1)]; > mutable char _M_narrow[1 + static_cast<unsigned char>(-1)]; > mutable char _M_narrow_ok; > > > public: > > static locale::id id; > > static const size_t table_size = 1 + static_cast<unsigned char>(-1); ># 712 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0); ># 725 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false, > size_t __refs = 0); ># 738 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > inline bool > is(mask __m, char __c) const; ># 753 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > inline const char* > is(const char* __lo, const char* __hi, mask* __vec) const; ># 767 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > inline const char* > scan_is(mask __m, const char* __lo, const char* __hi) const; ># 781 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > inline const char* > scan_not(mask __m, const char* __lo, const char* __hi) const; ># 796 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > toupper(char_type __c) const > { return this->do_toupper(__c); } ># 813 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > toupper(char_type *__lo, const char_type* __hi) const > { return this->do_toupper(__lo, __hi); } ># 829 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > tolower(char_type __c) const > { return this->do_tolower(__c); } ># 846 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > tolower(char_type* __lo, const char_type* __hi) const > { return this->do_tolower(__lo, __hi); } ># 866 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > widen(char __c) const > { > if (_M_widen_ok) > return _M_widen[static_cast<unsigned char>(__c)]; > this->_M_widen_init(); > return this->do_widen(__c); > } ># 893 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char* > widen(const char* __lo, const char* __hi, char_type* __to) const > { > if (_M_widen_ok == 1) > { > __builtin_memcpy(__to, __lo, __hi - __lo); > return __hi; > } > if (!_M_widen_ok) > _M_widen_init(); > return this->do_widen(__lo, __hi, __to); > } ># 924 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char > narrow(char_type __c, char __dfault) const > { > if (_M_narrow[static_cast<unsigned char>(__c)]) > return _M_narrow[static_cast<unsigned char>(__c)]; > const char __t = do_narrow(__c, __dfault); > if (__t != __dfault) > _M_narrow[static_cast<unsigned char>(__c)] = __t; > return __t; > } ># 957 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > const char_type* > narrow(const char_type* __lo, const char_type* __hi, > char __dfault, char* __to) const > { > if (__builtin_expect(_M_narrow_ok == 1, true)) > { > __builtin_memcpy(__to, __lo, __hi - __lo); > return __hi; > } > if (!_M_narrow_ok) > _M_narrow_init(); > return this->do_narrow(__lo, __hi, __dfault, __to); > } > > > > > > const mask* > table() const throw() > { return _M_table; } > > > static const mask* > classic_table() throw(); > protected: > > > > > > > > virtual > ~ctype(); ># 1006 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_toupper(char_type __c) const; ># 1023 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_toupper(char_type* __lo, const char_type* __hi) const; ># 1039 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_tolower(char_type __c) const; ># 1056 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_tolower(char_type* __lo, const char_type* __hi) const; ># 1076 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_widen(char __c) const > { return __c; } ># 1099 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char* > do_widen(const char* __lo, const char* __hi, char_type* __to) const > { > __builtin_memcpy(__to, __lo, __hi - __lo); > return __hi; > } ># 1125 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char > do_narrow(char_type __c, char __dfault) const > { return __c; } ># 1151 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_narrow(const char_type* __lo, const char_type* __hi, > char __dfault, char* __to) const > { > __builtin_memcpy(__to, __lo, __hi - __lo); > return __hi; > } > > private: > void _M_narrow_init() const; > void _M_widen_init() const; > }; ># 1176 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<> > class ctype<wchar_t> : public __ctype_abstract_base<wchar_t> > { > public: > > > typedef wchar_t char_type; > typedef wctype_t __wmask_type; > > protected: > __c_locale _M_c_locale_ctype; > > > bool _M_narrow_ok; > char _M_narrow[128]; > wint_t _M_widen[1 + static_cast<unsigned char>(-1)]; > > > mask _M_bit[16]; > __wmask_type _M_wmask[16]; > > public: > > > static locale::id id; ># 1209 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > ctype(size_t __refs = 0); ># 1220 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > ctype(__c_locale __cloc, size_t __refs = 0); > > protected: > __wmask_type > _M_convert_to_wmask(const mask __m) const throw(); > > > virtual > ~ctype(); ># 1244 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual bool > do_is(mask __m, char_type __c) const; ># 1263 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; ># 1281 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; ># 1299 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_scan_not(mask __m, const char_type* __lo, > const char_type* __hi) const; ># 1316 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_toupper(char_type __c) const; ># 1333 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_toupper(char_type* __lo, const char_type* __hi) const; ># 1349 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_tolower(char_type __c) const; ># 1366 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_tolower(char_type* __lo, const char_type* __hi) const; ># 1386 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_widen(char __c) const; ># 1408 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char* > do_widen(const char* __lo, const char* __hi, char_type* __to) const; ># 1431 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char > do_narrow(char_type __c, char __dfault) const; ># 1457 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual const char_type* > do_narrow(const char_type* __lo, const char_type* __hi, > char __dfault, char* __to) const; > > > void > _M_initialize_ctype() throw(); > }; > > > > template<typename _CharT> > class ctype_byname : public ctype<_CharT> > { > public: > typedef typename ctype<_CharT>::mask mask; > > explicit > ctype_byname(const char* __s, size_t __refs = 0); > > protected: > virtual > ~ctype_byname() { }; > }; > > > template<> > class ctype_byname<char> : public ctype<char> > { > public: > explicit > ctype_byname(const char* __s, size_t __refs = 0); > > protected: > virtual > ~ctype_byname(); > }; > > > template<> > class ctype_byname<wchar_t> : public ctype<wchar_t> > { > public: > explicit > ctype_byname(const char* __s, size_t __refs = 0); > > protected: > virtual > ~ctype_byname(); > }; > > > >} > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/ctype_inline.h" 1 3 ># 37 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/x86_64-redhat-linux/bits/ctype_inline.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > bool > ctype<char>:: > is(mask __m, char __c) const > { return _M_table[static_cast<unsigned char>(__c)] & __m; } > > const char* > ctype<char>:: > is(const char* __low, const char* __high, mask* __vec) const > { > while (__low < __high) > *__vec++ = _M_table[static_cast<unsigned char>(*__low++)]; > return __high; > } > > const char* > ctype<char>:: > scan_is(mask __m, const char* __low, const char* __high) const > { > while (__low < __high > && !(_M_table[static_cast<unsigned char>(*__low)] & __m)) > ++__low; > return __low; > } > > const char* > ctype<char>:: > scan_not(mask __m, const char* __low, const char* __high) const > { > while (__low < __high > && (_M_table[static_cast<unsigned char>(*__low)] & __m) != 0) > ++__low; > return __low; > } > > >} ># 1514 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 2 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > class __num_base > { > public: > > > enum > { > _S_ominus, > _S_oplus, > _S_ox, > _S_oX, > _S_odigits, > _S_odigits_end = _S_odigits + 16, > _S_oudigits = _S_odigits_end, > _S_oudigits_end = _S_oudigits + 16, > _S_oe = _S_odigits + 14, > _S_oE = _S_oudigits + 14, > _S_oend = _S_oudigits_end > }; > > > > > > > static const char* _S_atoms_out; > > > > static const char* _S_atoms_in; > > enum > { > _S_iminus, > _S_iplus, > _S_ix, > _S_iX, > _S_izero, > _S_ie = _S_izero + 14, > _S_iE = _S_izero + 20, > _S_iend = 26 > }; > > > > static void > _S_format_float(const ios_base& __io, char* __fptr, char __mod) throw(); > }; > > template<typename _CharT> > struct __numpunct_cache : public locale::facet > { > const char* _M_grouping; > size_t _M_grouping_size; > bool _M_use_grouping; > const _CharT* _M_truename; > size_t _M_truename_size; > const _CharT* _M_falsename; > size_t _M_falsename_size; > _CharT _M_decimal_point; > _CharT _M_thousands_sep; > > > > > > _CharT _M_atoms_out[__num_base::_S_oend]; > > > > > > _CharT _M_atoms_in[__num_base::_S_iend]; > > bool _M_allocated; > > __numpunct_cache(size_t __refs = 0) > : facet(__refs), _M_grouping(0), _M_grouping_size(0), > _M_use_grouping(false), > _M_truename(0), _M_truename_size(0), _M_falsename(0), > _M_falsename_size(0), _M_decimal_point(_CharT()), > _M_thousands_sep(_CharT()), _M_allocated(false) > { } > > ~__numpunct_cache(); > > void > _M_cache(const locale& __loc); > > private: > __numpunct_cache& > operator=(const __numpunct_cache&); > > explicit > __numpunct_cache(const __numpunct_cache&); > }; > > template<typename _CharT> > __numpunct_cache<_CharT>::~__numpunct_cache() > { > if (_M_allocated) > { > delete [] _M_grouping; > delete [] _M_truename; > delete [] _M_falsename; > } > } ># 1642 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<typename _CharT> > class numpunct : public locale::facet > { > public: > > > > typedef _CharT char_type; > typedef basic_string<_CharT> string_type; > > typedef __numpunct_cache<_CharT> __cache_type; > > protected: > __cache_type* _M_data; > > public: > > static locale::id id; > > > > > > > explicit > numpunct(size_t __refs = 0) > : facet(__refs), _M_data(0) > { _M_initialize_numpunct(); } ># 1680 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > numpunct(__cache_type* __cache, size_t __refs = 0) > : facet(__refs), _M_data(__cache) > { _M_initialize_numpunct(); } ># 1694 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > numpunct(__c_locale __cloc, size_t __refs = 0) > : facet(__refs), _M_data(0) > { _M_initialize_numpunct(__cloc); } ># 1708 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > decimal_point() const > { return this->do_decimal_point(); } ># 1721 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > char_type > thousands_sep() const > { return this->do_thousands_sep(); } ># 1752 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > string > grouping() const > { return this->do_grouping(); } ># 1765 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > string_type > truename() const > { return this->do_truename(); } ># 1778 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > string_type > falsename() const > { return this->do_falsename(); } > > protected: > > virtual > ~numpunct(); ># 1795 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_decimal_point() const > { return _M_data->_M_decimal_point; } ># 1807 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual char_type > do_thousands_sep() const > { return _M_data->_M_thousands_sep; } ># 1820 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual string > do_grouping() const > { return _M_data->_M_grouping; } ># 1833 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual string_type > do_truename() const > { return _M_data->_M_truename; } ># 1846 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual string_type > do_falsename() const > { return _M_data->_M_falsename; } > > > void > _M_initialize_numpunct(__c_locale __cloc = 0); > }; > > template<typename _CharT> > locale::id numpunct<_CharT>::id; > > template<> > numpunct<char>::~numpunct(); > > template<> > void > numpunct<char>::_M_initialize_numpunct(__c_locale __cloc); > > > template<> > numpunct<wchar_t>::~numpunct(); > > template<> > void > numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc); > > > > template<typename _CharT> > class numpunct_byname : public numpunct<_CharT> > { > public: > typedef _CharT char_type; > typedef basic_string<_CharT> string_type; > > explicit > numpunct_byname(const char* __s, size_t __refs = 0) > : numpunct<_CharT>(__refs) > { > if (__builtin_strcmp(__s, "C") != 0 > && __builtin_strcmp(__s, "POSIX") != 0) > { > __c_locale __tmp; > this->_S_create_c_locale(__tmp, __s); > this->_M_initialize_numpunct(__tmp); > this->_S_destroy_c_locale(__tmp); > } > } > > protected: > virtual > ~numpunct_byname() { } > }; > > ># 1916 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<typename _CharT, typename _InIter> > class num_get : public locale::facet > { > public: > > > > typedef _CharT char_type; > typedef _InIter iter_type; > > > > static locale::id id; ># 1937 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > num_get(size_t __refs = 0) : facet(__refs) { } ># 1963 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, bool& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } ># 1999 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, long& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned short& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned int& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned long& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, long long& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned long long& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } ># 2058 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, float& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, double& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, long double& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } ># 2100 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > get(iter_type __in, iter_type __end, ios_base& __io, > ios_base::iostate& __err, void*& __v) const > { return this->do_get(__in, __end, __io, __err, __v); } > > protected: > > virtual ~num_get() { } > > iter_type > _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&, > string&) const; > > template<typename _ValueT> > iter_type > _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&, > _ValueT&) const; > > template<typename _CharT2> > typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, int>::__type > _M_find(const _CharT2*, size_t __len, _CharT2 __c) const > { > int __ret = -1; > if (__len <= 10) > { > if (__c >= _CharT2('0') && __c < _CharT2(_CharT2('0') + __len)) > __ret = __c - _CharT2('0'); > } > else > { > if (__c >= _CharT2('0') && __c <= _CharT2('9')) > __ret = __c - _CharT2('0'); > else if (__c >= _CharT2('a') && __c <= _CharT2('f')) > __ret = 10 + (__c - _CharT2('a')); > else if (__c >= _CharT2('A') && __c <= _CharT2('F')) > __ret = 10 + (__c - _CharT2('A')); > } > return __ret; > } > > template<typename _CharT2> > typename __gnu_cxx::__enable_if<!__is_char<_CharT2>::__value, > int>::__type > _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const > { > int __ret = -1; > const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); > if (__q) > { > __ret = __q - __zero; > if (__ret > 15) > __ret -= 6; > } > return __ret; > } ># 2171 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual iter_type > do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const; > > virtual iter_type > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, long& __v) const > { return _M_extract_int(__beg, __end, __io, __err, __v); } > > virtual iter_type > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned short& __v) const > { return _M_extract_int(__beg, __end, __io, __err, __v); } > > virtual iter_type > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned int& __v) const > { return _M_extract_int(__beg, __end, __io, __err, __v); } > > virtual iter_type > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned long& __v) const > { return _M_extract_int(__beg, __end, __io, __err, __v); } > > > virtual iter_type > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, long long& __v) const > { return _M_extract_int(__beg, __end, __io, __err, __v); } > > virtual iter_type > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, unsigned long long& __v) const > { return _M_extract_int(__beg, __end, __io, __err, __v); } > > > virtual iter_type > do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, float&) const; > > virtual iter_type > do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, > double&) const; > > > > > > > > virtual iter_type > do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, > long double&) const; > > > virtual iter_type > do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, void*&) const; ># 2234 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > }; > > template<typename _CharT, typename _InIter> > locale::id num_get<_CharT, _InIter>::id; ># 2252 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > template<typename _CharT, typename _OutIter> > class num_put : public locale::facet > { > public: > > > > typedef _CharT char_type; > typedef _OutIter iter_type; > > > > static locale::id id; ># 2273 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > explicit > num_put(size_t __refs = 0) : facet(__refs) { } ># 2291 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const > { return this->do_put(__s, __io, __fill, __v); } ># 2333 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, long __v) const > { return this->do_put(__s, __io, __fill, __v); } > > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, > unsigned long __v) const > { return this->do_put(__s, __io, __fill, __v); } > > > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const > { return this->do_put(__s, __io, __fill, __v); } > > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, > unsigned long long __v) const > { return this->do_put(__s, __io, __fill, __v); } ># 2396 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, double __v) const > { return this->do_put(__s, __io, __fill, __v); } > > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, > long double __v) const > { return this->do_put(__s, __io, __fill, __v); } ># 2421 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > iter_type > put(iter_type __s, ios_base& __io, char_type __fill, > const void* __v) const > { return this->do_put(__s, __io, __fill, __v); } > > protected: > template<typename _ValueT> > iter_type > _M_insert_float(iter_type, ios_base& __io, char_type __fill, > char __mod, _ValueT __v) const; > > void > _M_group_float(const char* __grouping, size_t __grouping_size, > char_type __sep, const char_type* __p, char_type* __new, > char_type* __cs, int& __len) const; > > template<typename _ValueT> > iter_type > _M_insert_int(iter_type, ios_base& __io, char_type __fill, > _ValueT __v) const; > > void > _M_group_int(const char* __grouping, size_t __grouping_size, > char_type __sep, ios_base& __io, char_type* __new, > char_type* __cs, int& __len) const; > > void > _M_pad(char_type __fill, streamsize __w, ios_base& __io, > char_type* __new, const char_type* __cs, int& __len) const; > > > virtual > ~num_put() { }; ># 2469 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3 > virtual iter_type > do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const; > > virtual iter_type > do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const > { return _M_insert_int(__s, __io, __fill, __v); } > > virtual iter_type > do_put(iter_type __s, ios_base& __io, char_type __fill, > unsigned long __v) const > { return _M_insert_int(__s, __io, __fill, __v); } > > > virtual iter_type > do_put(iter_type __s, ios_base& __io, char_type __fill, > long long __v) const > { return _M_insert_int(__s, __io, __fill, __v); } > > virtual iter_type > do_put(iter_type __s, ios_base& __io, char_type __fill, > unsigned long long __v) const > { return _M_insert_int(__s, __io, __fill, __v); } > > > virtual iter_type > do_put(iter_type, ios_base&, char_type, double) const; > > > > > > > virtual iter_type > do_put(iter_type, ios_base&, char_type, long double) const; > > > virtual iter_type > do_put(iter_type, ios_base&, char_type, const void*) const; > > > > > > > > }; > > template <typename _CharT, typename _OutIter> > locale::id num_put<_CharT, _OutIter>::id; > > > > > > > > > > template<typename _CharT> > inline bool > isspace(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::space, __c); } > > > template<typename _CharT> > inline bool > isprint(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::print, __c); } > > > template<typename _CharT> > inline bool > iscntrl(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::cntrl, __c); } > > > template<typename _CharT> > inline bool > isupper(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::upper, __c); } > > > template<typename _CharT> > inline bool > islower(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::lower, __c); } > > > template<typename _CharT> > inline bool > isalpha(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alpha, __c); } > > > template<typename _CharT> > inline bool > isdigit(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::digit, __c); } > > > template<typename _CharT> > inline bool > ispunct(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::punct, __c); } > > > template<typename _CharT> > inline bool > isxdigit(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::xdigit, __c); } > > > template<typename _CharT> > inline bool > isalnum(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alnum, __c); } > > > template<typename _CharT> > inline bool > isgraph(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::graph, __c); } > > > template<typename _CharT> > inline _CharT > toupper(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).toupper(__c); } > > > template<typename _CharT> > inline _CharT > tolower(_CharT __c, const locale& __loc) > { return use_facet<ctype<_CharT> >(__loc).tolower(__c); } > > >} > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 1 3 ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > ># 36 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > > template<typename _Facet> > struct __use_cache > { > const _Facet* > operator() (const locale& __loc) const; > }; > > > template<typename _CharT> > struct __use_cache<__numpunct_cache<_CharT> > > { > const __numpunct_cache<_CharT>* > operator() (const locale& __loc) const > { > const size_t __i = numpunct<_CharT>::id._M_id(); > const locale::facet** __caches = __loc._M_impl->_M_caches; > if (!__caches[__i]) > { > __numpunct_cache<_CharT>* __tmp = 0; > try > { > __tmp = new __numpunct_cache<_CharT>; > __tmp->_M_cache(__loc); > } > catch(...) > { > delete __tmp; > throw; > } > __loc._M_impl->_M_install_cache(__tmp, __i); > } > return static_cast<const __numpunct_cache<_CharT>*>(__caches[__i]); > } > }; > > template<typename _CharT> > void > __numpunct_cache<_CharT>::_M_cache(const locale& __loc) > { > _M_allocated = true; > > const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc); > > char* __grouping = 0; > _CharT* __truename = 0; > _CharT* __falsename = 0; > try > { > _M_grouping_size = __np.grouping().size(); > __grouping = new char[_M_grouping_size]; > __np.grouping().copy(__grouping, _M_grouping_size); > _M_grouping = __grouping; > _M_use_grouping = (_M_grouping_size > && static_cast<signed char>(_M_grouping[0]) > 0 > && (_M_grouping[0] > != __gnu_cxx::__numeric_traits<char>::__max)); > > _M_truename_size = __np.truename().size(); > __truename = new _CharT[_M_truename_size]; > __np.truename().copy(__truename, _M_truename_size); > _M_truename = __truename; > > _M_falsename_size = __np.falsename().size(); > __falsename = new _CharT[_M_falsename_size]; > __np.falsename().copy(__falsename, _M_falsename_size); > _M_falsename = __falsename; > > _M_decimal_point = __np.decimal_point(); > _M_thousands_sep = __np.thousands_sep(); > > const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc); > __ct.widen(__num_base::_S_atoms_out, > __num_base::_S_atoms_out > + __num_base::_S_oend, _M_atoms_out); > __ct.widen(__num_base::_S_atoms_in, > __num_base::_S_atoms_in > + __num_base::_S_iend, _M_atoms_in); > } > catch(...) > { > delete [] __grouping; > delete [] __truename; > delete [] __falsename; > throw; > } > } ># 138 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > __attribute__ ((__pure__)) bool > __verify_grouping(const char* __grouping, size_t __grouping_size, > const string& __grouping_tmp) throw (); > > > > template<typename _CharT, typename _InIter> > _InIter > num_get<_CharT, _InIter>:: > _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io, > ios_base::iostate& __err, string& __xtrc) const > { > typedef char_traits<_CharT> __traits_type; > typedef __numpunct_cache<_CharT> __cache_type; > __use_cache<__cache_type> __uc; > const locale& __loc = __io._M_getloc(); > const __cache_type* __lc = __uc(__loc); > const _CharT* __lit = __lc->_M_atoms_in; > char_type __c = char_type(); > > > bool __testeof = __beg == __end; > > > if (!__testeof) > { > __c = *__beg; > const bool __plus = __c == __lit[__num_base::_S_iplus]; > if ((__plus || __c == __lit[__num_base::_S_iminus]) > && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) > && !(__c == __lc->_M_decimal_point)) > { > __xtrc += __plus ? '+' : '-'; > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > } > > > bool __found_mantissa = false; > int __sep_pos = 0; > while (!__testeof) > { > if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) > || __c == __lc->_M_decimal_point) > break; > else if (__c == __lit[__num_base::_S_izero]) > { > if (!__found_mantissa) > { > __xtrc += '0'; > __found_mantissa = true; > } > ++__sep_pos; > > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > else > break; > } > > > bool __found_dec = false; > bool __found_sci = false; > string __found_grouping; > if (__lc->_M_use_grouping) > __found_grouping.reserve(32); > const char_type* __lit_zero = __lit + __num_base::_S_izero; > > if (!__lc->_M_allocated) > > while (!__testeof) > { > const int __digit = _M_find(__lit_zero, 10, __c); > if (__digit != -1) > { > __xtrc += '0' + __digit; > __found_mantissa = true; > } > else if (__c == __lc->_M_decimal_point > && !__found_dec && !__found_sci) > { > __xtrc += '.'; > __found_dec = true; > } > else if ((__c == __lit[__num_base::_S_ie] > || __c == __lit[__num_base::_S_iE]) > && !__found_sci && __found_mantissa) > { > > __xtrc += 'e'; > __found_sci = true; > > > if (++__beg != __end) > { > __c = *__beg; > const bool __plus = __c == __lit[__num_base::_S_iplus]; > if (__plus || __c == __lit[__num_base::_S_iminus]) > __xtrc += __plus ? '+' : '-'; > else > continue; > } > else > { > __testeof = true; > break; > } > } > else > break; > > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > else > while (!__testeof) > { > > > if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) > { > if (!__found_dec && !__found_sci) > { > > > if (__sep_pos) > { > __found_grouping += static_cast<char>(__sep_pos); > __sep_pos = 0; > } > else > { > > > __xtrc.clear(); > break; > } > } > else > break; > } > else if (__c == __lc->_M_decimal_point) > { > if (!__found_dec && !__found_sci) > { > > > > if (__found_grouping.size()) > __found_grouping += static_cast<char>(__sep_pos); > __xtrc += '.'; > __found_dec = true; > } > else > break; > } > else > { > const char_type* __q = > __traits_type::find(__lit_zero, 10, __c); > if (__q) > { > __xtrc += '0' + (__q - __lit_zero); > __found_mantissa = true; > ++__sep_pos; > } > else if ((__c == __lit[__num_base::_S_ie] > || __c == __lit[__num_base::_S_iE]) > && !__found_sci && __found_mantissa) > { > > if (__found_grouping.size() && !__found_dec) > __found_grouping += static_cast<char>(__sep_pos); > __xtrc += 'e'; > __found_sci = true; > > > if (++__beg != __end) > { > __c = *__beg; > const bool __plus = __c == __lit[__num_base::_S_iplus]; > if ((__plus || __c == __lit[__num_base::_S_iminus]) > && !(__lc->_M_use_grouping > && __c == __lc->_M_thousands_sep) > && !(__c == __lc->_M_decimal_point)) > __xtrc += __plus ? '+' : '-'; > else > continue; > } > else > { > __testeof = true; > break; > } > } > else > break; > } > > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > > > > if (__found_grouping.size()) > { > > if (!__found_dec && !__found_sci) > __found_grouping += static_cast<char>(__sep_pos); > > if (!std::__verify_grouping(__lc->_M_grouping, > __lc->_M_grouping_size, > __found_grouping)) > __err = ios_base::failbit; > } > > return __beg; > } > > template<typename _CharT, typename _InIter> > template<typename _ValueT> > _InIter > num_get<_CharT, _InIter>:: > _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io, > ios_base::iostate& __err, _ValueT& __v) const > { > typedef char_traits<_CharT> __traits_type; > using __gnu_cxx::__add_unsigned; > typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; > typedef __numpunct_cache<_CharT> __cache_type; > __use_cache<__cache_type> __uc; > const locale& __loc = __io._M_getloc(); > const __cache_type* __lc = __uc(__loc); > const _CharT* __lit = __lc->_M_atoms_in; > char_type __c = char_type(); > > > const ios_base::fmtflags __basefield = __io.flags() > & ios_base::basefield; > const bool __oct = __basefield == ios_base::oct; > int __base = __oct ? 8 : (__basefield == ios_base::hex ? 16 : 10); > > > bool __testeof = __beg == __end; > > > bool __negative = false; > if (!__testeof) > { > __c = *__beg; > __negative = __c == __lit[__num_base::_S_iminus]; > if ((__negative || __c == __lit[__num_base::_S_iplus]) > && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) > && !(__c == __lc->_M_decimal_point)) > { > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > } > > > > bool __found_zero = false; > int __sep_pos = 0; > while (!__testeof) > { > if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) > || __c == __lc->_M_decimal_point) > break; > else if (__c == __lit[__num_base::_S_izero] > && (!__found_zero || __base == 10)) > { > __found_zero = true; > ++__sep_pos; > if (__basefield == 0) > __base = 8; > if (__base == 8) > __sep_pos = 0; > } > else if (__found_zero > && (__c == __lit[__num_base::_S_ix] > || __c == __lit[__num_base::_S_iX])) > { > if (__basefield == 0) > __base = 16; > if (__base == 16) > { > __found_zero = false; > __sep_pos = 0; > } > else > break; > } > else > break; > > if (++__beg != __end) > { > __c = *__beg; > if (!__found_zero) > break; > } > else > __testeof = true; > } > > > > const size_t __len = (__base == 16 ? __num_base::_S_iend > - __num_base::_S_izero : __base); > > > string __found_grouping; > if (__lc->_M_use_grouping) > __found_grouping.reserve(32); > bool __testfail = false; > bool __testoverflow = false; > const __unsigned_type __max = > (__negative && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) > ? -__gnu_cxx::__numeric_traits<_ValueT>::__min > : __gnu_cxx::__numeric_traits<_ValueT>::__max; > const __unsigned_type __smax = __max / __base; > __unsigned_type __result = 0; > int __digit = 0; > const char_type* __lit_zero = __lit + __num_base::_S_izero; > > if (!__lc->_M_allocated) > > while (!__testeof) > { > __digit = _M_find(__lit_zero, __len, __c); > if (__digit == -1) > break; > > if (__result > __smax) > __testoverflow = true; > else > { > __result *= __base; > __testoverflow |= __result > __max - __digit; > __result += __digit; > ++__sep_pos; > } > > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > else > while (!__testeof) > { > > > if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) > { > > > if (__sep_pos) > { > __found_grouping += static_cast<char>(__sep_pos); > __sep_pos = 0; > } > else > { > __testfail = true; > break; > } > } > else if (__c == __lc->_M_decimal_point) > break; > else > { > const char_type* __q = > __traits_type::find(__lit_zero, __len, __c); > if (!__q) > break; > > __digit = __q - __lit_zero; > if (__digit > 15) > __digit -= 6; > if (__result > __smax) > __testoverflow = true; > else > { > __result *= __base; > __testoverflow |= __result > __max - __digit; > __result += __digit; > ++__sep_pos; > } > } > > if (++__beg != __end) > __c = *__beg; > else > __testeof = true; > } > > > > if (__found_grouping.size()) > { > > __found_grouping += static_cast<char>(__sep_pos); > > if (!std::__verify_grouping(__lc->_M_grouping, > __lc->_M_grouping_size, > __found_grouping)) > __err = ios_base::failbit; > } > > > > if ((!__sep_pos && !__found_zero && !__found_grouping.size()) > || __testfail) > { > __v = 0; > __err = ios_base::failbit; > } > else if (__testoverflow) > { > if (__negative > && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) > __v = __gnu_cxx::__numeric_traits<_ValueT>::__min; > else > __v = __gnu_cxx::__numeric_traits<_ValueT>::__max; > __err = ios_base::failbit; > } > else > __v = __negative ? -__result : __result; > > if (__testeof) > __err |= ios_base::eofbit; > return __beg; > } > > > > template<typename _CharT, typename _InIter> > _InIter > num_get<_CharT, _InIter>:: > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, bool& __v) const > { > if (!(__io.flags() & ios_base::boolalpha)) > { > > > > long __l = -1; > __beg = _M_extract_int(__beg, __end, __io, __err, __l); > if (__l == 0 || __l == 1) > __v = bool(__l); > else > { > > > __v = true; > __err = ios_base::failbit; > if (__beg == __end) > __err |= ios_base::eofbit; > } > } > else > { > > typedef __numpunct_cache<_CharT> __cache_type; > __use_cache<__cache_type> __uc; > const locale& __loc = __io._M_getloc(); > const __cache_type* __lc = __uc(__loc); > > bool __testf = true; > bool __testt = true; > bool __donef = __lc->_M_falsename_size == 0; > bool __donet = __lc->_M_truename_size == 0; > bool __testeof = false; > size_t __n = 0; > while (!__donef || !__donet) > { > if (__beg == __end) > { > __testeof = true; > break; > } > > const char_type __c = *__beg; > > if (!__donef) > __testf = __c == __lc->_M_falsename[__n]; > > if (!__testf && __donet) > break; > > if (!__donet) > __testt = __c == __lc->_M_truename[__n]; > > if (!__testt && __donef) > break; > > if (!__testt && !__testf) > break; > > ++__n; > ++__beg; > > __donef = !__testf || __n >= __lc->_M_falsename_size; > __donet = !__testt || __n >= __lc->_M_truename_size; > } > if (__testf && __n == __lc->_M_falsename_size && __n) > { > __v = false; > if (__testt && __n == __lc->_M_truename_size) > __err = ios_base::failbit; > else > __err = __testeof ? ios_base::eofbit : ios_base::goodbit; > } > else if (__testt && __n == __lc->_M_truename_size && __n) > { > __v = true; > __err = __testeof ? ios_base::eofbit : ios_base::goodbit; > } > else > { > > > __v = false; > __err = ios_base::failbit; > if (__testeof) > __err |= ios_base::eofbit; > } > } > return __beg; > } > > template<typename _CharT, typename _InIter> > _InIter > num_get<_CharT, _InIter>:: > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, float& __v) const > { > string __xtrc; > __xtrc.reserve(32); > __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); > std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); > if (__beg == __end) > __err |= ios_base::eofbit; > return __beg; > } > > template<typename _CharT, typename _InIter> > _InIter > num_get<_CharT, _InIter>:: > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, double& __v) const > { > string __xtrc; > __xtrc.reserve(32); > __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); > std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); > if (__beg == __end) > __err |= ios_base::eofbit; > return __beg; > } ># 732 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > template<typename _CharT, typename _InIter> > _InIter > num_get<_CharT, _InIter>:: > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, long double& __v) const > { > string __xtrc; > __xtrc.reserve(32); > __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); > std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); > if (__beg == __end) > __err |= ios_base::eofbit; > return __beg; > } > > template<typename _CharT, typename _InIter> > _InIter > num_get<_CharT, _InIter>:: > do_get(iter_type __beg, iter_type __end, ios_base& __io, > ios_base::iostate& __err, void*& __v) const > { > > typedef ios_base::fmtflags fmtflags; > const fmtflags __fmt = __io.flags(); > __io.flags((__fmt & ~ios_base::basefield) | ios_base::hex); > > typedef __gnu_cxx::__conditional_type<(sizeof(void*) > <= sizeof(unsigned long)), > unsigned long, unsigned long long>::__type _UIntPtrType; > > _UIntPtrType __ul; > __beg = _M_extract_int(__beg, __end, __io, __err, __ul); > > > __io.flags(__fmt); > > __v = reinterpret_cast<void*>(__ul); > return __beg; > } > > > > template<typename _CharT, typename _OutIter> > void > num_put<_CharT, _OutIter>:: > _M_pad(_CharT __fill, streamsize __w, ios_base& __io, > _CharT* __new, const _CharT* __cs, int& __len) const > { > > > __pad<_CharT, char_traits<_CharT> >::_S_pad(__io, __fill, __new, > __cs, __w, __len); > __len = static_cast<int>(__w); > } > > > > template<typename _CharT, typename _ValueT> > int > __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit, > ios_base::fmtflags __flags, bool __dec) > { > _CharT* __buf = __bufend; > if (__builtin_expect(__dec, true)) > { > > do > { > *--__buf = __lit[(__v % 10) + __num_base::_S_odigits]; > __v /= 10; > } > while (__v != 0); > } > else if ((__flags & ios_base::basefield) == ios_base::oct) > { > > do > { > *--__buf = __lit[(__v & 0x7) + __num_base::_S_odigits]; > __v >>= 3; > } > while (__v != 0); > } > else > { > > const bool __uppercase = __flags & ios_base::uppercase; > const int __case_offset = __uppercase ? __num_base::_S_oudigits > : __num_base::_S_odigits; > do > { > *--__buf = __lit[(__v & 0xf) + __case_offset]; > __v >>= 4; > } > while (__v != 0); > } > return __bufend - __buf; > } > > > > template<typename _CharT, typename _OutIter> > void > num_put<_CharT, _OutIter>:: > _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep, > ios_base&, _CharT* __new, _CharT* __cs, int& __len) const > { > _CharT* __p = std::__add_grouping(__new, __sep, __grouping, > __grouping_size, __cs, __cs + __len); > __len = __p - __new; > } > > template<typename _CharT, typename _OutIter> > template<typename _ValueT> > _OutIter > num_put<_CharT, _OutIter>:: > _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill, > _ValueT __v) const > { > using __gnu_cxx::__add_unsigned; > typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; > typedef __numpunct_cache<_CharT> __cache_type; > __use_cache<__cache_type> __uc; > const locale& __loc = __io._M_getloc(); > const __cache_type* __lc = __uc(__loc); > const _CharT* __lit = __lc->_M_atoms_out; > const ios_base::fmtflags __flags = __io.flags(); > > > const int __ilen = 5 * sizeof(_ValueT); > _CharT* __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * __ilen)); > > > > const ios_base::fmtflags __basefield = __flags & ios_base::basefield; > const bool __dec = (__basefield != ios_base::oct > && __basefield != ios_base::hex); > const __unsigned_type __u = ((__v > 0 || !__dec) > ? __unsigned_type(__v) > : -__unsigned_type(__v)); > int __len = __int_to_char(__cs + __ilen, __u, __lit, __flags, __dec); > __cs += __ilen - __len; > > > if (__lc->_M_use_grouping) > { > > > _CharT* __cs2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * (__len + 1) > * 2)); > _M_group_int(__lc->_M_grouping, __lc->_M_grouping_size, > __lc->_M_thousands_sep, __io, __cs2 + 2, __cs, __len); > __cs = __cs2 + 2; > } > > > if (__builtin_expect(__dec, true)) > { > > if (__v >= 0) > { > if (bool(__flags & ios_base::showpos) > && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) > *--__cs = __lit[__num_base::_S_oplus], ++__len; > } > else > *--__cs = __lit[__num_base::_S_ominus], ++__len; > } > else if (bool(__flags & ios_base::showbase) && __v) > { > if (__basefield == ios_base::oct) > *--__cs = __lit[__num_base::_S_odigits], ++__len; > else > { > > const bool __uppercase = __flags & ios_base::uppercase; > *--__cs = __lit[__num_base::_S_ox + __uppercase]; > > *--__cs = __lit[__num_base::_S_odigits]; > __len += 2; > } > } > > > const streamsize __w = __io.width(); > if (__w > static_cast<streamsize>(__len)) > { > _CharT* __cs3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * __w)); > _M_pad(__fill, __w, __io, __cs3, __cs, __len); > __cs = __cs3; > } > __io.width(0); > > > > return std::__write(__s, __cs, __len); > } > > template<typename _CharT, typename _OutIter> > void > num_put<_CharT, _OutIter>:: > _M_group_float(const char* __grouping, size_t __grouping_size, > _CharT __sep, const _CharT* __p, _CharT* __new, > _CharT* __cs, int& __len) const > { > > > > const int __declen = __p ? __p - __cs : __len; > _CharT* __p2 = std::__add_grouping(__new, __sep, __grouping, > __grouping_size, > __cs, __cs + __declen); > > > int __newlen = __p2 - __new; > if (__p) > { > char_traits<_CharT>::copy(__p2, __p, __len - __declen); > __newlen += __len - __declen; > } > __len = __newlen; > } ># 968 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > template<typename _CharT, typename _OutIter> > template<typename _ValueT> > _OutIter > num_put<_CharT, _OutIter>:: > _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, > _ValueT __v) const > { > typedef __numpunct_cache<_CharT> __cache_type; > __use_cache<__cache_type> __uc; > const locale& __loc = __io._M_getloc(); > const __cache_type* __lc = __uc(__loc); > > > const streamsize __prec = __io.precision() < 0 ? 6 : __io.precision(); > > const int __max_digits = > __gnu_cxx::__numeric_traits<_ValueT>::__digits10; > > > int __len; > > char __fbuf[16]; > __num_base::_S_format_float(__io, __fbuf, __mod); > > > > > int __cs_size = __max_digits * 3; > char* __cs = static_cast<char*>(__builtin_alloca(__cs_size)); > __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, > __fbuf, __prec, __v); > > > if (__len >= __cs_size) > { > __cs_size = __len + 1; > __cs = static_cast<char*>(__builtin_alloca(__cs_size)); > __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, > __fbuf, __prec, __v); > } ># 1029 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); > > _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * __len)); > __ctype.widen(__cs, __cs + __len, __ws); > > > _CharT* __wp = 0; > const char* __p = char_traits<char>::find(__cs, __len, '.'); > if (__p) > { > __wp = __ws + (__p - __cs); > *__wp = __lc->_M_decimal_point; > } > > > > > if (__lc->_M_use_grouping > && (__wp || __len < 3 || (__cs[1] <= '9' && __cs[2] <= '9' > && __cs[1] >= '0' && __cs[2] >= '0'))) > { > > > _CharT* __ws2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * __len * 2)); > > streamsize __off = 0; > if (__cs[0] == '-' || __cs[0] == '+') > { > __off = 1; > __ws2[0] = __ws[0]; > __len -= 1; > } > > _M_group_float(__lc->_M_grouping, __lc->_M_grouping_size, > __lc->_M_thousands_sep, __wp, __ws2 + __off, > __ws + __off, __len); > __len += __off; > > __ws = __ws2; > } > > > const streamsize __w = __io.width(); > if (__w > static_cast<streamsize>(__len)) > { > _CharT* __ws3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * __w)); > _M_pad(__fill, __w, __io, __ws3, __ws, __len); > __ws = __ws3; > } > __io.width(0); > > > > return std::__write(__s, __ws, __len); > } > > template<typename _CharT, typename _OutIter> > _OutIter > num_put<_CharT, _OutIter>:: > do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const > { > const ios_base::fmtflags __flags = __io.flags(); > if ((__flags & ios_base::boolalpha) == 0) > { > const long __l = __v; > __s = _M_insert_int(__s, __io, __fill, __l); > } > else > { > typedef __numpunct_cache<_CharT> __cache_type; > __use_cache<__cache_type> __uc; > const locale& __loc = __io._M_getloc(); > const __cache_type* __lc = __uc(__loc); > > const _CharT* __name = __v ? __lc->_M_truename > : __lc->_M_falsename; > int __len = __v ? __lc->_M_truename_size > : __lc->_M_falsename_size; > > const streamsize __w = __io.width(); > if (__w > static_cast<streamsize>(__len)) > { > const streamsize __plen = __w - __len; > _CharT* __ps > = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) > * __plen)); > > char_traits<_CharT>::assign(__ps, __plen, __fill); > __io.width(0); > > if ((__flags & ios_base::adjustfield) == ios_base::left) > { > __s = std::__write(__s, __name, __len); > __s = std::__write(__s, __ps, __plen); > } > else > { > __s = std::__write(__s, __ps, __plen); > __s = std::__write(__s, __name, __len); > } > return __s; > } > __io.width(0); > __s = std::__write(__s, __name, __len); > } > return __s; > } > > template<typename _CharT, typename _OutIter> > _OutIter > num_put<_CharT, _OutIter>:: > do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const > { return _M_insert_float(__s, __io, __fill, char(), __v); } ># 1154 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > template<typename _CharT, typename _OutIter> > _OutIter > num_put<_CharT, _OutIter>:: > do_put(iter_type __s, ios_base& __io, char_type __fill, > long double __v) const > { return _M_insert_float(__s, __io, __fill, 'L', __v); } > > template<typename _CharT, typename _OutIter> > _OutIter > num_put<_CharT, _OutIter>:: > do_put(iter_type __s, ios_base& __io, char_type __fill, > const void* __v) const > { > const ios_base::fmtflags __flags = __io.flags(); > const ios_base::fmtflags __fmt = ~(ios_base::basefield > | ios_base::uppercase); > __io.flags((__flags & __fmt) | (ios_base::hex | ios_base::showbase)); > > typedef __gnu_cxx::__conditional_type<(sizeof(const void*) > <= sizeof(unsigned long)), > unsigned long, unsigned long long>::__type _UIntPtrType; > > __s = _M_insert_int(__s, __io, __fill, > reinterpret_cast<_UIntPtrType>(__v)); > __io.flags(__flags); > return __s; > } > > ># 1191 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.tcc" 3 > template<typename _CharT, typename _Traits> > void > __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill, > _CharT* __news, const _CharT* __olds, > streamsize __newlen, streamsize __oldlen) > { > const size_t __plen = static_cast<size_t>(__newlen - __oldlen); > const ios_base::fmtflags __adjust = __io.flags() & ios_base::adjustfield; > > > if (__adjust == ios_base::left) > { > _Traits::copy(__news, __olds, __oldlen); > _Traits::assign(__news + __oldlen, __plen, __fill); > return; > } > > size_t __mod = 0; > if (__adjust == ios_base::internal) > { > > > > const locale& __loc = __io._M_getloc(); > const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); > > if (__ctype.widen('-') == __olds[0] > || __ctype.widen('+') == __olds[0]) > { > __news[0] = __olds[0]; > __mod = 1; > ++__news; > } > else if (__ctype.widen('0') == __olds[0] > && __oldlen > 1 > && (__ctype.widen('x') == __olds[1] > || __ctype.widen('X') == __olds[1])) > { > __news[0] = __olds[0]; > __news[1] = __olds[1]; > __mod = 2; > __news += 2; > } > > } > _Traits::assign(__news, __plen, __fill); > _Traits::copy(__news + __plen, __olds + __mod, __oldlen - __mod); > } > > template<typename _CharT> > _CharT* > __add_grouping(_CharT* __s, _CharT __sep, > const char* __gbeg, size_t __gsize, > const _CharT* __first, const _CharT* __last) > { > size_t __idx = 0; > size_t __ctr = 0; > > while (__last - __first > __gbeg[__idx] > && static_cast<signed char>(__gbeg[__idx]) > 0 > && __gbeg[__idx] != __gnu_cxx::__numeric_traits<char>::__max) > { > __last -= __gbeg[__idx]; > __idx < __gsize - 1 ? ++__idx : ++__ctr; > } > > while (__first != __last) > *__s++ = *__first++; > > while (__ctr--) > { > *__s++ = __sep; > for (char __i = __gbeg[__idx]; __i > 0; --__i) > *__s++ = *__first++; > } > > while (__idx--) > { > *__s++ = __sep; > for (char __i = __gbeg[__idx]; __i > 0; --__i) > *__s++ = *__first++; > } > > return __s; > } > > > > > extern template class numpunct<char>; > extern template class numpunct_byname<char>; > extern template class num_get<char>; > extern template class num_put<char>; > extern template class ctype_byname<char>; > > extern template > const ctype<char>& > use_facet<ctype<char> >(const locale&); > > extern template > const numpunct<char>& > use_facet<numpunct<char> >(const locale&); > > extern template > const num_put<char>& > use_facet<num_put<char> >(const locale&); > > extern template > const num_get<char>& > use_facet<num_get<char> >(const locale&); > > extern template > bool > has_facet<ctype<char> >(const locale&); > > extern template > bool > has_facet<numpunct<char> >(const locale&); > > extern template > bool > has_facet<num_put<char> >(const locale&); > > extern template > bool > has_facet<num_get<char> >(const locale&); > > > extern template class numpunct<wchar_t>; > extern template class numpunct_byname<wchar_t>; > extern template class num_get<wchar_t>; > extern template class num_put<wchar_t>; > extern template class ctype_byname<wchar_t>; > > extern template > const ctype<wchar_t>& > use_facet<ctype<wchar_t> >(const locale&); > > extern template > const numpunct<wchar_t>& > use_facet<numpunct<wchar_t> >(const locale&); > > extern template > const num_put<wchar_t>& > use_facet<num_put<wchar_t> >(const locale&); > > extern template > const num_get<wchar_t>& > use_facet<num_get<wchar_t> >(const locale&); > > extern template > bool > has_facet<ctype<wchar_t> >(const locale&); > > extern template > bool > has_facet<numpunct<wchar_t> >(const locale&); > > extern template > bool > has_facet<num_put<wchar_t> >(const locale&); > > extern template > bool > has_facet<num_get<wchar_t> >(const locale&); > > > > >} ># 2608 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 2 3 ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 2 3 > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _Facet> > inline const _Facet& > __check_facet(const _Facet* __f) > { > if (!__f) > __throw_bad_cast(); > return *__f; > } ># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > template<typename _CharT, typename _Traits> > class basic_ios : public ios_base > { > public: > > > > > > > typedef _CharT char_type; > typedef typename _Traits::int_type int_type; > typedef typename _Traits::pos_type pos_type; > typedef typename _Traits::off_type off_type; > typedef _Traits traits_type; > > > > > > > typedef ctype<_CharT> __ctype_type; > typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > > __num_put_type; > typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > > __num_get_type; > > > > protected: > basic_ostream<_CharT, _Traits>* _M_tie; > mutable char_type _M_fill; > mutable bool _M_fill_init; > basic_streambuf<_CharT, _Traits>* _M_streambuf; > > > const __ctype_type* _M_ctype; > > const __num_put_type* _M_num_put; > > const __num_get_type* _M_num_get; > > public: > > > > > > > > operator void*() const > { return this->fail() ? 0 : const_cast<basic_ios*>(this); } > > bool > operator!() const > { return this->fail(); } ># 128 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > iostate > rdstate() const > { return _M_streambuf_state; } ># 139 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > void > clear(iostate __state = goodbit); > > > > > > > > void > setstate(iostate __state) > { this->clear(this->rdstate() | __state); } > > > > > void > _M_setstate(iostate __state) > { > > > _M_streambuf_state |= __state; > if (this->exceptions() & __state) > throw; > } > > > > > > > > bool > good() const > { return this->rdstate() == 0; } > > > > > > > > bool > eof() const > { return (this->rdstate() & eofbit) != 0; } ># 192 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > bool > fail() const > { return (this->rdstate() & (badbit | failbit)) != 0; } > > > > > > > > bool > bad() const > { return (this->rdstate() & badbit) != 0; } ># 213 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > iostate > exceptions() const > { return _M_exception; } ># 248 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > void > exceptions(iostate __except) > { > _M_exception = __except; > this->clear(_M_streambuf_state); > } > > > > > > > > explicit > basic_ios(basic_streambuf<_CharT, _Traits>* __sb) > : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0), > _M_ctype(0), _M_num_put(0), _M_num_get(0) > { this->init(__sb); } > > > > > > > > virtual > ~basic_ios() { } ># 286 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > basic_ostream<_CharT, _Traits>* > tie() const > { return _M_tie; } ># 298 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > basic_ostream<_CharT, _Traits>* > tie(basic_ostream<_CharT, _Traits>* __tiestr) > { > basic_ostream<_CharT, _Traits>* __old = _M_tie; > _M_tie = __tiestr; > return __old; > } > > > > > > > > basic_streambuf<_CharT, _Traits>* > rdbuf() const > { return _M_streambuf; } ># 338 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > basic_streambuf<_CharT, _Traits>* > rdbuf(basic_streambuf<_CharT, _Traits>* __sb); ># 352 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > basic_ios& > copyfmt(const basic_ios& __rhs); > > > > > > > > char_type > fill() const > { > if (!_M_fill_init) > { > _M_fill = this->widen(' '); > _M_fill_init = true; > } > return _M_fill; > } ># 381 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > char_type > fill(char_type __ch) > { > char_type __old = this->fill(); > _M_fill = __ch; > return __old; > } ># 401 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > locale > imbue(const locale& __loc); ># 421 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > char > narrow(char_type __c, char __dfault) const > { return __check_facet(_M_ctype).narrow(__c, __dfault); } ># 440 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 3 > char_type > widen(char __c) const > { return __check_facet(_M_ctype).widen(__c); } > > protected: > > > > > > > > basic_ios() > : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), > _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0) > { } > > > > > > > > void > init(basic_streambuf<_CharT, _Traits>* __sb); > > void > _M_cache_locale(const locale& __loc); > }; > > >} > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.tcc" 1 3 ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.tcc" 3 > ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.tcc" 3 > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits> > void > basic_ios<_CharT, _Traits>::clear(iostate __state) > { > if (this->rdbuf()) > _M_streambuf_state = __state; > else > _M_streambuf_state = __state | badbit; > if (this->exceptions() & this->rdstate()) > __throw_ios_failure(("basic_ios::clear")); > } > > template<typename _CharT, typename _Traits> > basic_streambuf<_CharT, _Traits>* > basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb) > { > basic_streambuf<_CharT, _Traits>* __old = _M_streambuf; > _M_streambuf = __sb; > this->clear(); > return __old; > } > > template<typename _CharT, typename _Traits> > basic_ios<_CharT, _Traits>& > basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs) > { > > > if (this != &__rhs) > { > > > > > _Words* __words = (__rhs._M_word_size <= _S_local_word_size) ? > _M_local_word : new _Words[__rhs._M_word_size]; > > > _Callback_list* __cb = __rhs._M_callbacks; > if (__cb) > __cb->_M_add_reference(); > _M_call_callbacks(erase_event); > if (_M_word != _M_local_word) > { > delete [] _M_word; > _M_word = 0; > } > _M_dispose_callbacks(); > > > _M_callbacks = __cb; > for (int __i = 0; __i < __rhs._M_word_size; ++__i) > __words[__i] = __rhs._M_word[__i]; > _M_word = __words; > _M_word_size = __rhs._M_word_size; > > this->flags(__rhs.flags()); > this->width(__rhs.width()); > this->precision(__rhs.precision()); > this->tie(__rhs.tie()); > this->fill(__rhs.fill()); > _M_ios_locale = __rhs.getloc(); > _M_cache_locale(_M_ios_locale); > > _M_call_callbacks(copyfmt_event); > > > this->exceptions(__rhs.exceptions()); > } > return *this; > } > > > template<typename _CharT, typename _Traits> > locale > basic_ios<_CharT, _Traits>::imbue(const locale& __loc) > { > locale __old(this->getloc()); > ios_base::imbue(__loc); > _M_cache_locale(__loc); > if (this->rdbuf() != 0) > this->rdbuf()->pubimbue(__loc); > return __old; > } > > template<typename _CharT, typename _Traits> > void > basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb) > { > > ios_base::_M_init(); > > > _M_cache_locale(_M_ios_locale); ># 147 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.tcc" 3 > _M_fill = _CharT(); > _M_fill_init = false; > > _M_tie = 0; > _M_exception = goodbit; > _M_streambuf = __sb; > _M_streambuf_state = __sb ? goodbit : badbit; > } > > template<typename _CharT, typename _Traits> > void > basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc) > { > if (__builtin_expect(has_facet<__ctype_type>(__loc), true)) > _M_ctype = &use_facet<__ctype_type>(__loc); > else > _M_ctype = 0; > > if (__builtin_expect(has_facet<__num_put_type>(__loc), true)) > _M_num_put = &use_facet<__num_put_type>(__loc); > else > _M_num_put = 0; > > if (__builtin_expect(has_facet<__num_get_type>(__loc), true)) > _M_num_get = &use_facet<__num_get_type>(__loc); > else > _M_num_get = 0; > } > > > > > extern template class basic_ios<char>; > > > extern template class basic_ios<wchar_t>; > > > > >} ># 474 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/basic_ios.h" 2 3 ># 46 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ios" 2 3 ># 41 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 2 3 > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 55 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > template<typename _CharT, typename _Traits> > class basic_ostream : virtual public basic_ios<_CharT, _Traits> > { > public: > > typedef _CharT char_type; > typedef typename _Traits::int_type int_type; > typedef typename _Traits::pos_type pos_type; > typedef typename _Traits::off_type off_type; > typedef _Traits traits_type; > > > typedef basic_streambuf<_CharT, _Traits> __streambuf_type; > typedef basic_ios<_CharT, _Traits> __ios_type; > typedef basic_ostream<_CharT, _Traits> __ostream_type; > typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > > __num_put_type; > typedef ctype<_CharT> __ctype_type; ># 81 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > explicit > basic_ostream(__streambuf_type* __sb) > { this->init(__sb); } > > > > > > > virtual > ~basic_ostream() { } > > > class sentry; > friend class sentry; ># 105 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > operator<<(__ostream_type& (*__pf)(__ostream_type&)) > { > > > > return __pf(*this); > } > > __ostream_type& > operator<<(__ios_type& (*__pf)(__ios_type&)) > { > > > > __pf(*this); > return *this; > } > > __ostream_type& > operator<<(ios_base& (*__pf) (ios_base&)) > { > > > > __pf(*this); > return *this; > } ># 163 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > operator<<(long __n) > { return _M_insert(__n); } > > __ostream_type& > operator<<(unsigned long __n) > { return _M_insert(__n); } > > __ostream_type& > operator<<(bool __n) > { return _M_insert(__n); } > > __ostream_type& > operator<<(short __n); > > __ostream_type& > operator<<(unsigned short __n) > { > > > return _M_insert(static_cast<unsigned long>(__n)); > } > > __ostream_type& > operator<<(int __n); > > __ostream_type& > operator<<(unsigned int __n) > { > > > return _M_insert(static_cast<unsigned long>(__n)); > } > > > __ostream_type& > operator<<(long long __n) > { return _M_insert(__n); } > > __ostream_type& > operator<<(unsigned long long __n) > { return _M_insert(__n); } ># 217 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > operator<<(double __f) > { return _M_insert(__f); } > > __ostream_type& > operator<<(float __f) > { > > > return _M_insert(static_cast<double>(__f)); > } > > __ostream_type& > operator<<(long double __f) > { return _M_insert(__f); } ># 242 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > operator<<(const void* __p) > { return _M_insert(__p); } ># 267 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > operator<<(__streambuf_type* __sb); ># 300 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > put(char_type __c); > > > > > > > void > _M_write(const char_type* __s, streamsize __n) > { > const streamsize __put = this->rdbuf()->sputn(__s, __n); > if (__put != __n) > this->setstate(ios_base::badbit); > } ># 332 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > write(const char_type* __s, streamsize __n); ># 345 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > flush(); ># 355 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > pos_type > tellp(); ># 366 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > seekp(pos_type); ># 378 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > __ostream_type& > seekp(off_type, ios_base::seekdir); > > protected: > basic_ostream() > { this->init(0); } > > template<typename _ValueT> > __ostream_type& > _M_insert(_ValueT __v); > }; ># 397 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > template <typename _CharT, typename _Traits> > class basic_ostream<_CharT, _Traits>::sentry > { > > bool _M_ok; > basic_ostream<_CharT, _Traits>& _M_os; > > public: ># 416 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > explicit > sentry(basic_ostream<_CharT, _Traits>& __os); ># 426 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > ~sentry() > { > > if (bool(_M_os.flags() & ios_base::unitbuf) && !uncaught_exception()) > { > > if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1) > _M_os.setstate(ios_base::badbit); > } > } ># 447 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > operator bool() const > { return _M_ok; } > }; ># 467 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > template<typename _CharT, typename _Traits> > inline basic_ostream<_CharT, _Traits>& > operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c) > { return __ostream_insert(__out, &__c, 1); } > > template<typename _CharT, typename _Traits> > inline basic_ostream<_CharT, _Traits>& > operator<<(basic_ostream<_CharT, _Traits>& __out, char __c) > { return (__out << __out.widen(__c)); } > > > template <class _Traits> > inline basic_ostream<char, _Traits>& > operator<<(basic_ostream<char, _Traits>& __out, char __c) > { return __ostream_insert(__out, &__c, 1); } > > > template<class _Traits> > inline basic_ostream<char, _Traits>& > operator<<(basic_ostream<char, _Traits>& __out, signed char __c) > { return (__out << static_cast<char>(__c)); } > > template<class _Traits> > inline basic_ostream<char, _Traits>& > operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c) > { return (__out << static_cast<char>(__c)); } ># 509 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > template<typename _CharT, typename _Traits> > inline basic_ostream<_CharT, _Traits>& > operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) > { > if (!__s) > __out.setstate(ios_base::badbit); > else > __ostream_insert(__out, __s, > static_cast<streamsize>(_Traits::length(__s))); > return __out; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits> & > operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s); > > > template<class _Traits> > inline basic_ostream<char, _Traits>& > operator<<(basic_ostream<char, _Traits>& __out, const char* __s) > { > if (!__s) > __out.setstate(ios_base::badbit); > else > __ostream_insert(__out, __s, > static_cast<streamsize>(_Traits::length(__s))); > return __out; > } > > > template<class _Traits> > inline basic_ostream<char, _Traits>& > operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s) > { return (__out << reinterpret_cast<const char*>(__s)); } > > template<class _Traits> > inline basic_ostream<char, _Traits> & > operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s) > { return (__out << reinterpret_cast<const char*>(__s)); } ># 560 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > template<typename _CharT, typename _Traits> > inline basic_ostream<_CharT, _Traits>& > endl(basic_ostream<_CharT, _Traits>& __os) > { return flush(__os.put(__os.widen('\n'))); } ># 572 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > template<typename _CharT, typename _Traits> > inline basic_ostream<_CharT, _Traits>& > ends(basic_ostream<_CharT, _Traits>& __os) > { return __os.put(_CharT()); } > > > > > > > template<typename _CharT, typename _Traits> > inline basic_ostream<_CharT, _Traits>& > flush(basic_ostream<_CharT, _Traits>& __os) > { return __os.flush(); } ># 604 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 3 > >} > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream.tcc" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream.tcc" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/ostream.tcc" 3 > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>::sentry:: > sentry(basic_ostream<_CharT, _Traits>& __os) > : _M_ok(false), _M_os(__os) > { > > if (__os.tie() && __os.good()) > __os.tie()->flush(); > > if (__os.good()) > _M_ok = true; > else > __os.setstate(ios_base::failbit); > } > > template<typename _CharT, typename _Traits> > template<typename _ValueT> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > _M_insert(_ValueT __v) > { > sentry __cerb(*this); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const __num_put_type& __np = __check_facet(this->_M_num_put); > if (__np.put(*this, *this, this->fill(), __v).failed()) > __err |= ios_base::badbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > operator<<(short __n) > { > > > const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; > if (__fmt == ios_base::oct || __fmt == ios_base::hex) > return _M_insert(static_cast<long>(static_cast<unsigned short>(__n))); > else > return _M_insert(static_cast<long>(__n)); > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > operator<<(int __n) > { > > > const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; > if (__fmt == ios_base::oct || __fmt == ios_base::hex) > return _M_insert(static_cast<long>(static_cast<unsigned int>(__n))); > else > return _M_insert(static_cast<long>(__n)); > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > operator<<(__streambuf_type* __sbin) > { > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this); > if (__cerb && __sbin) > { > try > { > if (!__copy_streambufs(__sbin, this->rdbuf())) > __err |= ios_base::failbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::failbit); } > } > else if (!__sbin) > __err |= ios_base::badbit; > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > put(char_type __c) > { > > > > > > > sentry __cerb(*this); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const int_type __put = this->rdbuf()->sputc(__c); > if (traits_type::eq_int_type(__put, traits_type::eof())) > __err |= ios_base::badbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > write(const _CharT* __s, streamsize __n) > { > > > > > > > > sentry __cerb(*this); > if (__cerb) > { > try > { _M_write(__s, __n); } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > flush() > { > > > > ios_base::iostate __err = ios_base::goodbit; > try > { > if (this->rdbuf() && this->rdbuf()->pubsync() == -1) > __err |= ios_base::badbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > typename basic_ostream<_CharT, _Traits>::pos_type > basic_ostream<_CharT, _Traits>:: > tellp() > { > pos_type __ret = pos_type(-1); > try > { > if (!this->fail()) > __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out); > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > return __ret; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > seekp(pos_type __pos) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > if (!this->fail()) > { > > > const pos_type __p = this->rdbuf()->pubseekpos(__pos, > ios_base::out); > > > if (__p == pos_type(off_type(-1))) > __err |= ios_base::failbit; > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > basic_ostream<_CharT, _Traits>:: > seekp(off_type __off, ios_base::seekdir __dir) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > if (!this->fail()) > { > > > const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, > ios_base::out); > > > if (__p == pos_type(off_type(-1))) > __err |= ios_base::failbit; > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > basic_ostream<_CharT, _Traits>& > operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s) > { > if (!__s) > __out.setstate(ios_base::badbit); > else > { > > > const size_t __clen = char_traits<char>::length(__s); > try > { > struct __ptr_guard > { > _CharT *__p; > __ptr_guard (_CharT *__ip): __p(__ip) { } > ~__ptr_guard() { delete[] __p; } > _CharT* __get() { return __p; } > } __pg (new _CharT[__clen]); > > _CharT *__ws = __pg.__get(); > for (size_t __i = 0; __i < __clen; ++__i) > __ws[__i] = __out.widen(__s[__i]); > __ostream_insert(__out, __ws, __clen); > } > catch(__cxxabiv1::__forced_unwind&) > { > __out._M_setstate(ios_base::badbit); > throw; > } > catch(...) > { __out._M_setstate(ios_base::badbit); } > } > return __out; > } > > > > > extern template class basic_ostream<char>; > extern template ostream& endl(ostream&); > extern template ostream& ends(ostream&); > extern template ostream& flush(ostream&); > extern template ostream& operator<<(ostream&, char); > extern template ostream& operator<<(ostream&, unsigned char); > extern template ostream& operator<<(ostream&, signed char); > extern template ostream& operator<<(ostream&, const char*); > extern template ostream& operator<<(ostream&, const unsigned char*); > extern template ostream& operator<<(ostream&, const signed char*); > > extern template ostream& ostream::_M_insert(long); > extern template ostream& ostream::_M_insert(unsigned long); > extern template ostream& ostream::_M_insert(bool); > > extern template ostream& ostream::_M_insert(long long); > extern template ostream& ostream::_M_insert(unsigned long long); > > extern template ostream& ostream::_M_insert(double); > extern template ostream& ostream::_M_insert(long double); > extern template ostream& ostream::_M_insert(const void*); > > > extern template class basic_ostream<wchar_t>; > extern template wostream& endl(wostream&); > extern template wostream& ends(wostream&); > extern template wostream& flush(wostream&); > extern template wostream& operator<<(wostream&, wchar_t); > extern template wostream& operator<<(wostream&, char); > extern template wostream& operator<<(wostream&, const wchar_t*); > extern template wostream& operator<<(wostream&, const char*); > > extern template wostream& wostream::_M_insert(long); > extern template wostream& wostream::_M_insert(unsigned long); > extern template wostream& wostream::_M_insert(bool); > > extern template wostream& wostream::_M_insert(long long); > extern template wostream& wostream::_M_insert(unsigned long long); > > extern template wostream& wostream::_M_insert(double); > extern template wostream& wostream::_M_insert(long double); > extern template wostream& wostream::_M_insert(const void*); > > > > >} ># 608 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/ostream" 2 3 ># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 1 3 ># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > ># 55 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > template<typename _CharT, typename _Traits> > class basic_istream : virtual public basic_ios<_CharT, _Traits> > { > public: > > typedef _CharT char_type; > typedef typename _Traits::int_type int_type; > typedef typename _Traits::pos_type pos_type; > typedef typename _Traits::off_type off_type; > typedef _Traits traits_type; > > > typedef basic_streambuf<_CharT, _Traits> __streambuf_type; > typedef basic_ios<_CharT, _Traits> __ios_type; > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > > __num_get_type; > typedef ctype<_CharT> __ctype_type; > > protected: > > > > > > streamsize _M_gcount; > > public: > > > > > > > > explicit > basic_istream(__streambuf_type* __sb) > : _M_gcount(streamsize(0)) > { this->init(__sb); } > > > > > > > virtual > ~basic_istream() > { _M_gcount = streamsize(0); } > > > class sentry; > friend class sentry; ># 117 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > operator>>(__istream_type& (*__pf)(__istream_type&)) > { return __pf(*this); } > > __istream_type& > operator>>(__ios_type& (*__pf)(__ios_type&)) > { > __pf(*this); > return *this; > } > > __istream_type& > operator>>(ios_base& (*__pf)(ios_base&)) > { > __pf(*this); > return *this; > } ># 165 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > operator>>(bool& __n) > { return _M_extract(__n); } > > __istream_type& > operator>>(short& __n); > > __istream_type& > operator>>(unsigned short& __n) > { return _M_extract(__n); } > > __istream_type& > operator>>(int& __n); > > __istream_type& > operator>>(unsigned int& __n) > { return _M_extract(__n); } > > __istream_type& > operator>>(long& __n) > { return _M_extract(__n); } > > __istream_type& > operator>>(unsigned long& __n) > { return _M_extract(__n); } > > > __istream_type& > operator>>(long long& __n) > { return _M_extract(__n); } > > __istream_type& > operator>>(unsigned long long& __n) > { return _M_extract(__n); } ># 211 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > operator>>(float& __f) > { return _M_extract(__f); } > > __istream_type& > operator>>(double& __f) > { return _M_extract(__f); } > > __istream_type& > operator>>(long double& __f) > { return _M_extract(__f); } ># 232 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > operator>>(void*& __p) > { return _M_extract(__p); } ># 256 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > operator>>(__streambuf_type* __sb); ># 266 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > streamsize > gcount() const > { return _M_gcount; } ># 299 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > int_type > get(); ># 313 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > get(char_type& __c); ># 340 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > get(char_type* __s, streamsize __n, char_type __delim); ># 351 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > get(char_type* __s, streamsize __n) > { return this->get(__s, __n, this->widen('\n')); } ># 374 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > get(__streambuf_type& __sb, char_type __delim); ># 384 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > get(__streambuf_type& __sb) > { return this->get(__sb, this->widen('\n')); } ># 413 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > getline(char_type* __s, streamsize __n, char_type __delim); ># 424 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > getline(char_type* __s, streamsize __n) > { return this->getline(__s, __n, this->widen('\n')); } ># 448 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > ignore(streamsize __n, int_type __delim); > > __istream_type& > ignore(streamsize __n); > > __istream_type& > ignore(); ># 465 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > int_type > peek(); ># 483 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > read(char_type* __s, streamsize __n); ># 502 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > streamsize > readsome(char_type* __s, streamsize __n); ># 519 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > putback(char_type __c); ># 535 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > unget(); ># 553 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > int > sync(); ># 568 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > pos_type > tellg(); ># 583 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > seekg(pos_type); ># 599 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > __istream_type& > seekg(off_type, ios_base::seekdir); > > > protected: > basic_istream() > : _M_gcount(streamsize(0)) > { this->init(0); } > > template<typename _ValueT> > __istream_type& > _M_extract(_ValueT& __v); > }; > > > template<> > basic_istream<char>& > basic_istream<char>:: > getline(char_type* __s, streamsize __n, char_type __delim); > > template<> > basic_istream<char>& > basic_istream<char>:: > ignore(streamsize __n); > > template<> > basic_istream<char>& > basic_istream<char>:: > ignore(streamsize __n, int_type __delim); > > > template<> > basic_istream<wchar_t>& > basic_istream<wchar_t>:: > getline(char_type* __s, streamsize __n, char_type __delim); > > template<> > basic_istream<wchar_t>& > basic_istream<wchar_t>:: > ignore(streamsize __n); > > template<> > basic_istream<wchar_t>& > basic_istream<wchar_t>:: > ignore(streamsize __n, int_type __delim); ># 654 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > template<typename _CharT, typename _Traits> > class basic_istream<_CharT, _Traits>::sentry > { > > bool _M_ok; > > public: > > typedef _Traits traits_type; > typedef basic_streambuf<_CharT, _Traits> __streambuf_type; > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef typename __istream_type::__ctype_type __ctype_type; > typedef typename _Traits::int_type __int_type; ># 690 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > explicit > sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false); ># 703 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > operator bool() const > { return _M_ok; } > }; ># 719 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c); > > template<class _Traits> > inline basic_istream<char, _Traits>& > operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c) > { return (__in >> reinterpret_cast<char&>(__c)); } > > template<class _Traits> > inline basic_istream<char, _Traits>& > operator>>(basic_istream<char, _Traits>& __in, signed char& __c) > { return (__in >> reinterpret_cast<char&>(__c)); } ># 761 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s); > > > template<> > basic_istream<char>& > operator>>(basic_istream<char>& __in, char* __s); > > template<class _Traits> > inline basic_istream<char, _Traits>& > operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s) > { return (__in >> reinterpret_cast<char*>(__s)); } > > template<class _Traits> > inline basic_istream<char, _Traits>& > operator>>(basic_istream<char, _Traits>& __in, signed char* __s) > { return (__in >> reinterpret_cast<char*>(__s)); } ># 788 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > template<typename _CharT, typename _Traits> > class basic_iostream > : public basic_istream<_CharT, _Traits>, > public basic_ostream<_CharT, _Traits> > { > public: > > > > typedef _CharT char_type; > typedef typename _Traits::int_type int_type; > typedef typename _Traits::pos_type pos_type; > typedef typename _Traits::off_type off_type; > typedef _Traits traits_type; > > > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef basic_ostream<_CharT, _Traits> __ostream_type; > > > > > > > > explicit > basic_iostream(basic_streambuf<_CharT, _Traits>* __sb) > : __istream_type(__sb), __ostream_type(__sb) { } > > > > > virtual > ~basic_iostream() { } > > protected: > basic_iostream() > : __istream_type(), __ostream_type() { } > }; ># 848 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > ws(basic_istream<_CharT, _Traits>& __is); ># 870 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 3 > >} > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/istream.tcc" 1 3 ># 39 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/istream.tcc" 3 > ># 40 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/istream.tcc" 3 > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>::sentry:: > sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false) > { > ios_base::iostate __err = ios_base::goodbit; > if (__in.good()) > { > if (__in.tie()) > __in.tie()->flush(); > if (!__noskip && bool(__in.flags() & ios_base::skipws)) > { > const __int_type __eof = traits_type::eof(); > __streambuf_type* __sb = __in.rdbuf(); > __int_type __c = __sb->sgetc(); > > const __ctype_type& __ct = __check_facet(__in._M_ctype); > while (!traits_type::eq_int_type(__c, __eof) > && __ct.is(ctype_base::space, > traits_type::to_char_type(__c))) > __c = __sb->snextc(); > > > > > if (traits_type::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > } > } > > if (__in.good() && __err == ios_base::goodbit) > _M_ok = true; > else > { > __err |= ios_base::failbit; > __in.setstate(__err); > } > } > > template<typename _CharT, typename _Traits> > template<typename _ValueT> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > _M_extract(_ValueT& __v) > { > sentry __cerb(*this, false); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const __num_get_type& __ng = __check_facet(this->_M_num_get); > __ng.get(*this, 0, *this, __err, __v); > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > operator>>(short& __n) > { > > > sentry __cerb(*this, false); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > long __l; > const __num_get_type& __ng = __check_facet(this->_M_num_get); > __ng.get(*this, 0, *this, __err, __l); > > > > if (__l < __gnu_cxx::__numeric_traits<short>::__min) > { > __err |= ios_base::failbit; > __n = __gnu_cxx::__numeric_traits<short>::__min; > } > else if (__l > __gnu_cxx::__numeric_traits<short>::__max) > { > __err |= ios_base::failbit; > __n = __gnu_cxx::__numeric_traits<short>::__max; > } > else > __n = short(__l); > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > operator>>(int& __n) > { > > > sentry __cerb(*this, false); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > long __l; > const __num_get_type& __ng = __check_facet(this->_M_num_get); > __ng.get(*this, 0, *this, __err, __l); > > > > if (__l < __gnu_cxx::__numeric_traits<int>::__min) > { > __err |= ios_base::failbit; > __n = __gnu_cxx::__numeric_traits<int>::__min; > } > else if (__l > __gnu_cxx::__numeric_traits<int>::__max) > { > __err |= ios_base::failbit; > __n = __gnu_cxx::__numeric_traits<int>::__max; > } > else > __n = int(__l); > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > operator>>(__streambuf_type* __sbout) > { > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this, false); > if (__cerb && __sbout) > { > try > { > bool __ineof; > if (!__copy_streambufs_eof(this->rdbuf(), __sbout, __ineof)) > __err |= ios_base::failbit; > if (__ineof) > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::failbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::failbit); } > } > else if (!__sbout) > __err |= ios_base::failbit; > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > typename basic_istream<_CharT, _Traits>::int_type > basic_istream<_CharT, _Traits>:: > get(void) > { > const int_type __eof = traits_type::eof(); > int_type __c = __eof; > _M_gcount = 0; > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this, true); > if (__cerb) > { > try > { > __c = this->rdbuf()->sbumpc(); > > if (!traits_type::eq_int_type(__c, __eof)) > _M_gcount = 1; > else > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > if (!_M_gcount) > __err |= ios_base::failbit; > if (__err) > this->setstate(__err); > return __c; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > get(char_type& __c) > { > _M_gcount = 0; > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this, true); > if (__cerb) > { > try > { > const int_type __cb = this->rdbuf()->sbumpc(); > > if (!traits_type::eq_int_type(__cb, traits_type::eof())) > { > _M_gcount = 1; > __c = traits_type::to_char_type(__cb); > } > else > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > if (!_M_gcount) > __err |= ios_base::failbit; > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > get(char_type* __s, streamsize __n, char_type __delim) > { > _M_gcount = 0; > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this, true); > if (__cerb) > { > try > { > const int_type __idelim = traits_type::to_int_type(__delim); > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > int_type __c = __sb->sgetc(); > > while (_M_gcount + 1 < __n > && !traits_type::eq_int_type(__c, __eof) > && !traits_type::eq_int_type(__c, __idelim)) > { > *__s++ = traits_type::to_char_type(__c); > ++_M_gcount; > __c = __sb->snextc(); > } > if (traits_type::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > > > if (__n > 0) > *__s = char_type(); > if (!_M_gcount) > __err |= ios_base::failbit; > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > get(__streambuf_type& __sb, char_type __delim) > { > _M_gcount = 0; > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this, true); > if (__cerb) > { > try > { > const int_type __idelim = traits_type::to_int_type(__delim); > const int_type __eof = traits_type::eof(); > __streambuf_type* __this_sb = this->rdbuf(); > int_type __c = __this_sb->sgetc(); > char_type __c2 = traits_type::to_char_type(__c); > > while (!traits_type::eq_int_type(__c, __eof) > && !traits_type::eq_int_type(__c, __idelim) > && !traits_type::eq_int_type(__sb.sputc(__c2), __eof)) > { > ++_M_gcount; > __c = __this_sb->snextc(); > __c2 = traits_type::to_char_type(__c); > } > if (traits_type::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > if (!_M_gcount) > __err |= ios_base::failbit; > if (__err) > this->setstate(__err); > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > getline(char_type* __s, streamsize __n, char_type __delim) > { > _M_gcount = 0; > ios_base::iostate __err = ios_base::goodbit; > sentry __cerb(*this, true); > if (__cerb) > { > try > { > const int_type __idelim = traits_type::to_int_type(__delim); > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > int_type __c = __sb->sgetc(); > > while (_M_gcount + 1 < __n > && !traits_type::eq_int_type(__c, __eof) > && !traits_type::eq_int_type(__c, __idelim)) > { > *__s++ = traits_type::to_char_type(__c); > __c = __sb->snextc(); > ++_M_gcount; > } > if (traits_type::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > else > { > if (traits_type::eq_int_type(__c, __idelim)) > { > __sb->sbumpc(); > ++_M_gcount; > } > else > __err |= ios_base::failbit; > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > > > if (__n > 0) > *__s = char_type(); > if (!_M_gcount) > __err |= ios_base::failbit; > if (__err) > this->setstate(__err); > return *this; > } > > > > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > ignore(void) > { > _M_gcount = 0; > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > > if (traits_type::eq_int_type(__sb->sbumpc(), __eof)) > __err |= ios_base::eofbit; > else > _M_gcount = 1; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > ignore(streamsize __n) > { > _M_gcount = 0; > sentry __cerb(*this, true); > if (__cerb && __n > 0) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > int_type __c = __sb->sgetc(); ># 515 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/istream.tcc" 3 > bool __large_ignore = false; > while (true) > { > while (_M_gcount < __n > && !traits_type::eq_int_type(__c, __eof)) > { > ++_M_gcount; > __c = __sb->snextc(); > } > if (__n == __gnu_cxx::__numeric_traits<streamsize>::__max > && !traits_type::eq_int_type(__c, __eof)) > { > _M_gcount = > __gnu_cxx::__numeric_traits<streamsize>::__min; > __large_ignore = true; > } > else > break; > } > > if (__large_ignore) > _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__max; > > if (traits_type::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > ignore(streamsize __n, int_type __delim) > { > _M_gcount = 0; > sentry __cerb(*this, true); > if (__cerb && __n > 0) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > int_type __c = __sb->sgetc(); > > > bool __large_ignore = false; > while (true) > { > while (_M_gcount < __n > && !traits_type::eq_int_type(__c, __eof) > && !traits_type::eq_int_type(__c, __delim)) > { > ++_M_gcount; > __c = __sb->snextc(); > } > if (__n == __gnu_cxx::__numeric_traits<streamsize>::__max > && !traits_type::eq_int_type(__c, __eof) > && !traits_type::eq_int_type(__c, __delim)) > { > _M_gcount = > __gnu_cxx::__numeric_traits<streamsize>::__min; > __large_ignore = true; > } > else > break; > } > > if (__large_ignore) > _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__max; > > if (traits_type::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > else if (traits_type::eq_int_type(__c, __delim)) > { > if (_M_gcount > < __gnu_cxx::__numeric_traits<streamsize>::__max) > ++_M_gcount; > __sb->sbumpc(); > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > typename basic_istream<_CharT, _Traits>::int_type > basic_istream<_CharT, _Traits>:: > peek(void) > { > int_type __c = traits_type::eof(); > _M_gcount = 0; > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > __c = this->rdbuf()->sgetc(); > if (traits_type::eq_int_type(__c, traits_type::eof())) > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return __c; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > read(char_type* __s, streamsize __n) > { > _M_gcount = 0; > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > _M_gcount = this->rdbuf()->sgetn(__s, __n); > if (_M_gcount != __n) > __err |= (ios_base::eofbit | ios_base::failbit); > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > streamsize > basic_istream<_CharT, _Traits>:: > readsome(char_type* __s, streamsize __n) > { > _M_gcount = 0; > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > > const streamsize __num = this->rdbuf()->in_avail(); > if (__num > 0) > _M_gcount = this->rdbuf()->sgetn(__s, std::min(__num, __n)); > else if (__num == -1) > __err |= ios_base::eofbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return _M_gcount; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > putback(char_type __c) > { > > > _M_gcount = 0; > > this->clear(this->rdstate() & ~ios_base::eofbit); > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > if (!__sb > || traits_type::eq_int_type(__sb->sputbackc(__c), __eof)) > __err |= ios_base::badbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > unget(void) > { > > > _M_gcount = 0; > > this->clear(this->rdstate() & ~ios_base::eofbit); > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const int_type __eof = traits_type::eof(); > __streambuf_type* __sb = this->rdbuf(); > if (!__sb > || traits_type::eq_int_type(__sb->sungetc(), __eof)) > __err |= ios_base::badbit; > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > int > basic_istream<_CharT, _Traits>:: > sync(void) > { > > > int __ret = -1; > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > __streambuf_type* __sb = this->rdbuf(); > if (__sb) > { > if (__sb->pubsync() == -1) > __err |= ios_base::badbit; > else > __ret = 0; > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return __ret; > } > > template<typename _CharT, typename _Traits> > typename basic_istream<_CharT, _Traits>::pos_type > basic_istream<_CharT, _Traits>:: > tellg(void) > { > > > pos_type __ret = pos_type(-1); > sentry __cerb(*this, true); > if (__cerb) > { > try > { > if (!this->fail()) > __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, > ios_base::in); > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > } > return __ret; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > seekg(pos_type __pos) > { > > > > this->clear(this->rdstate() & ~ios_base::eofbit); > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > if (!this->fail()) > { > > const pos_type __p = this->rdbuf()->pubseekpos(__pos, > ios_base::in); > > > if (__p == pos_type(off_type(-1))) > __err |= ios_base::failbit; > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > basic_istream<_CharT, _Traits>:: > seekg(off_type __off, ios_base::seekdir __dir) > { > > > > this->clear(this->rdstate() & ~ios_base::eofbit); > sentry __cerb(*this, true); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > if (!this->fail()) > { > > const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, > ios_base::in); > > > if (__p == pos_type(off_type(-1))) > __err |= ios_base::failbit; > } > } > catch(__cxxabiv1::__forced_unwind&) > { > this->_M_setstate(ios_base::badbit); > throw; > } > catch(...) > { this->_M_setstate(ios_base::badbit); } > if (__err) > this->setstate(__err); > } > return *this; > } > > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c) > { > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef typename __istream_type::int_type __int_type; > > typename __istream_type::sentry __cerb(__in, false); > if (__cerb) > { > ios_base::iostate __err = ios_base::goodbit; > try > { > const __int_type __cb = __in.rdbuf()->sbumpc(); > if (!_Traits::eq_int_type(__cb, _Traits::eof())) > __c = _Traits::to_char_type(__cb); > else > __err |= (ios_base::eofbit | ios_base::failbit); > } > catch(__cxxabiv1::__forced_unwind&) > { > __in._M_setstate(ios_base::badbit); > throw; > } > catch(...) > { __in._M_setstate(ios_base::badbit); } > if (__err) > __in.setstate(__err); > } > return __in; > } > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s) > { > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef basic_streambuf<_CharT, _Traits> __streambuf_type; > typedef typename _Traits::int_type int_type; > typedef _CharT char_type; > typedef ctype<_CharT> __ctype_type; > > streamsize __extracted = 0; > ios_base::iostate __err = ios_base::goodbit; > typename __istream_type::sentry __cerb(__in, false); > if (__cerb) > { > try > { > > streamsize __num = __in.width(); > if (__num <= 0) > __num = __gnu_cxx::__numeric_traits<streamsize>::__max; > > const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); > > const int_type __eof = _Traits::eof(); > __streambuf_type* __sb = __in.rdbuf(); > int_type __c = __sb->sgetc(); > > while (__extracted < __num - 1 > && !_Traits::eq_int_type(__c, __eof) > && !__ct.is(ctype_base::space, > _Traits::to_char_type(__c))) > { > *__s++ = _Traits::to_char_type(__c); > ++__extracted; > __c = __sb->snextc(); > } > if (_Traits::eq_int_type(__c, __eof)) > __err |= ios_base::eofbit; > > > > *__s = char_type(); > __in.width(0); > } > catch(__cxxabiv1::__forced_unwind&) > { > __in._M_setstate(ios_base::badbit); > throw; > } > catch(...) > { __in._M_setstate(ios_base::badbit); } > } > if (!__extracted) > __err |= ios_base::failbit; > if (__err) > __in.setstate(__err); > return __in; > } > > > template<typename _CharT, typename _Traits> > basic_istream<_CharT, _Traits>& > ws(basic_istream<_CharT, _Traits>& __in) > { > typedef basic_istream<_CharT, _Traits> __istream_type; > typedef basic_streambuf<_CharT, _Traits> __streambuf_type; > typedef typename __istream_type::int_type __int_type; > typedef ctype<_CharT> __ctype_type; > > const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); > const __int_type __eof = _Traits::eof(); > __streambuf_type* __sb = __in.rdbuf(); > __int_type __c = __sb->sgetc(); > > while (!_Traits::eq_int_type(__c, __eof) > && __ct.is(ctype_base::space, _Traits::to_char_type(__c))) > __c = __sb->snextc(); > > if (_Traits::eq_int_type(__c, __eof)) > __in.setstate(ios_base::eofbit); > return __in; > } > > > > > extern template class basic_istream<char>; > extern template istream& ws(istream&); > extern template istream& operator>>(istream&, char&); > extern template istream& operator>>(istream&, char*); > extern template istream& operator>>(istream&, unsigned char&); > extern template istream& operator>>(istream&, signed char&); > extern template istream& operator>>(istream&, unsigned char*); > extern template istream& operator>>(istream&, signed char*); > > extern template istream& istream::_M_extract(unsigned short&); > extern template istream& istream::_M_extract(unsigned int&); > extern template istream& istream::_M_extract(long&); > extern template istream& istream::_M_extract(unsigned long&); > extern template istream& istream::_M_extract(bool&); > > extern template istream& istream::_M_extract(long long&); > extern template istream& istream::_M_extract(unsigned long long&); > > extern template istream& istream::_M_extract(float&); > extern template istream& istream::_M_extract(double&); > extern template istream& istream::_M_extract(long double&); > extern template istream& istream::_M_extract(void*&); > > extern template class basic_iostream<char>; > > > extern template class basic_istream<wchar_t>; > extern template wistream& ws(wistream&); > extern template wistream& operator>>(wistream&, wchar_t&); > extern template wistream& operator>>(wistream&, wchar_t*); > > extern template wistream& wistream::_M_extract(unsigned short&); > extern template wistream& wistream::_M_extract(unsigned int&); > extern template wistream& wistream::_M_extract(long&); > extern template wistream& wistream::_M_extract(unsigned long&); > extern template wistream& wistream::_M_extract(bool&); > > extern template wistream& wistream::_M_extract(long long&); > extern template wistream& wistream::_M_extract(unsigned long long&); > > extern template wistream& wistream::_M_extract(float&); > extern template wistream& wistream::_M_extract(double&); > extern template wistream& wistream::_M_extract(long double&); > extern template wistream& wistream::_M_extract(void*&); > > extern template class basic_iostream<wchar_t>; > > > > >} ># 874 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/istream" 2 3 ># 66 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stream_iterator.h" 1 3 ># 33 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stream_iterator.h" 3 > ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stream_iterator.h" 3 > > > >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > > > > > > > template<typename _Tp, typename _CharT = char, > typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t> > class istream_iterator > : public iterator<input_iterator_tag, _Tp, _Dist, const _Tp*, const _Tp&> > { > public: > typedef _CharT char_type; > typedef _Traits traits_type; > typedef basic_istream<_CharT, _Traits> istream_type; > > private: > istream_type* _M_stream; > _Tp _M_value; > bool _M_ok; > > public: > > istream_iterator() > : _M_stream(0), _M_value(), _M_ok(false) {} > > > istream_iterator(istream_type& __s) > : _M_stream(&__s) > { _M_read(); } > > istream_iterator(const istream_iterator& __obj) > : _M_stream(__obj._M_stream), _M_value(__obj._M_value), > _M_ok(__obj._M_ok) > { } > > const _Tp& > operator*() const > { > > > ; > return _M_value; > } > > const _Tp* > operator->() const { return &(operator*()); } > > istream_iterator& > operator++() > { > > > ; > _M_read(); > return *this; > } > > istream_iterator > operator++(int) > { > > > ; > istream_iterator __tmp = *this; > _M_read(); > return __tmp; > } > > bool > _M_equal(const istream_iterator& __x) const > { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); } > > private: > void > _M_read() > { > _M_ok = (_M_stream && *_M_stream) ? true : false; > if (_M_ok) > { > *_M_stream >> _M_value; > _M_ok = *_M_stream ? true : false; > } > } > }; > > > template<typename _Tp, typename _CharT, typename _Traits, typename _Dist> > inline bool > operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, > const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) > { return __x._M_equal(__y); } > > > template <class _Tp, class _CharT, class _Traits, class _Dist> > inline bool > operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, > const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) > { return !__x._M_equal(__y); } ># 152 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stream_iterator.h" 3 > template<typename _Tp, typename _CharT = char, > typename _Traits = char_traits<_CharT> > > class ostream_iterator > : public iterator<output_iterator_tag, void, void, void, void> > { > public: > > > typedef _CharT char_type; > typedef _Traits traits_type; > typedef basic_ostream<_CharT, _Traits> ostream_type; > > > private: > ostream_type* _M_stream; > const _CharT* _M_string; > > public: > > ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {} ># 183 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stream_iterator.h" 3 > ostream_iterator(ostream_type& __s, const _CharT* __c) > : _M_stream(&__s), _M_string(__c) { } > > > ostream_iterator(const ostream_iterator& __obj) > : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { } > > > > ostream_iterator& > operator=(const _Tp& __value) > { > > > ; > *_M_stream << __value; > if (_M_string) *_M_stream << _M_string; > return *this; > } > > ostream_iterator& > operator*() > { return *this; } > > ostream_iterator& > operator++() > { return *this; } > > ostream_iterator& > operator++(int) > { return *this; } > }; > > > > >} ># 67 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 2 3 ># 50 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 2 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 1 3 ># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 3 > ># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 3 > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 1 3 ># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > namespace __detail > { > ># 78 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > struct _List_node_base > { > _List_node_base* _M_next; > _List_node_base* _M_prev; > > static void > swap(_List_node_base& __x, _List_node_base& __y) throw(); > > void > _M_transfer(_List_node_base* const __first, > _List_node_base* const __last) throw(); > > void > _M_reverse() throw(); > > void > _M_hook(_List_node_base* const __position) throw(); > > void > _M_unhook() throw(); > }; > > > } > > > > > template<typename _Tp> > struct _List_node : public __detail::_List_node_base > { > > _Tp _M_data; > > > > > > > > }; > > > > > > > template<typename _Tp> > struct _List_iterator > { > typedef _List_iterator<_Tp> _Self; > typedef _List_node<_Tp> _Node; > > typedef ptrdiff_t difference_type; > typedef std::bidirectional_iterator_tag iterator_category; > typedef _Tp value_type; > typedef _Tp* pointer; > typedef _Tp& reference; > > _List_iterator() > : _M_node() { } > > explicit > _List_iterator(__detail::_List_node_base* __x) > : _M_node(__x) { } > > > reference > operator*() const > { return static_cast<_Node*>(_M_node)->_M_data; } > > pointer > operator->() const > { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); } > > _Self& > operator++() > { > _M_node = _M_node->_M_next; > return *this; > } > > _Self > operator++(int) > { > _Self __tmp = *this; > _M_node = _M_node->_M_next; > return __tmp; > } > > _Self& > operator--() > { > _M_node = _M_node->_M_prev; > return *this; > } > > _Self > operator--(int) > { > _Self __tmp = *this; > _M_node = _M_node->_M_prev; > return __tmp; > } > > bool > operator==(const _Self& __x) const > { return _M_node == __x._M_node; } > > bool > operator!=(const _Self& __x) const > { return _M_node != __x._M_node; } > > > __detail::_List_node_base* _M_node; > }; > > > > > > > template<typename _Tp> > struct _List_const_iterator > { > typedef _List_const_iterator<_Tp> _Self; > typedef const _List_node<_Tp> _Node; > typedef _List_iterator<_Tp> iterator; > > typedef ptrdiff_t difference_type; > typedef std::bidirectional_iterator_tag iterator_category; > typedef _Tp value_type; > typedef const _Tp* pointer; > typedef const _Tp& reference; > > _List_const_iterator() > : _M_node() { } > > explicit > _List_const_iterator(const __detail::_List_node_base* __x) > : _M_node(__x) { } > > _List_const_iterator(const iterator& __x) > : _M_node(__x._M_node) { } > > > > reference > operator*() const > { return static_cast<_Node*>(_M_node)->_M_data; } > > pointer > operator->() const > { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); } > > _Self& > operator++() > { > _M_node = _M_node->_M_next; > return *this; > } > > _Self > operator++(int) > { > _Self __tmp = *this; > _M_node = _M_node->_M_next; > return __tmp; > } > > _Self& > operator--() > { > _M_node = _M_node->_M_prev; > return *this; > } > > _Self > operator--(int) > { > _Self __tmp = *this; > _M_node = _M_node->_M_prev; > return __tmp; > } > > bool > operator==(const _Self& __x) const > { return _M_node == __x._M_node; } > > bool > operator!=(const _Self& __x) const > { return _M_node != __x._M_node; } > > > const __detail::_List_node_base* _M_node; > }; > > template<typename _Val> > inline bool > operator==(const _List_iterator<_Val>& __x, > const _List_const_iterator<_Val>& __y) > { return __x._M_node == __y._M_node; } > > template<typename _Val> > inline bool > operator!=(const _List_iterator<_Val>& __x, > const _List_const_iterator<_Val>& __y) > { return __x._M_node != __y._M_node; } > > > > template<typename _Tp, typename _Alloc> > class _List_base > { > protected: ># 306 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > typedef typename _Alloc::template rebind<_List_node<_Tp> >::other > _Node_alloc_type; > > typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; > > struct _List_impl > : public _Node_alloc_type > { > __detail::_List_node_base _M_node; > > > > > > _List_impl() > : _Node_alloc_type(), _M_node() > > > > { } > > _List_impl(const _Node_alloc_type& __a) > : _Node_alloc_type(__a), _M_node() > > > > { } > > > > > > > }; > > _List_impl _M_impl; > > _List_node<_Tp>* > _M_get_node() > { > _List_node<_Tp>* __tmp = _M_impl._Node_alloc_type::allocate(1); > > > > return __tmp; > } > > void > _M_put_node(_List_node<_Tp>* __p) > { > _M_impl._Node_alloc_type::deallocate(__p, 1); > > > > } > > public: > typedef _Alloc allocator_type; > > _Node_alloc_type& > _M_get_Node_allocator() > { return *static_cast<_Node_alloc_type*>(&_M_impl); } > > const _Node_alloc_type& > _M_get_Node_allocator() const > { return *static_cast<const _Node_alloc_type*>(&_M_impl); } > > _Tp_alloc_type > _M_get_Tp_allocator() const > { return _Tp_alloc_type(_M_get_Node_allocator()); } > > allocator_type > get_allocator() const > { return allocator_type(_M_get_Node_allocator()); } > > _List_base() > : _M_impl() > { _M_init(); } > > _List_base(const _Node_alloc_type& __a) > : _M_impl(__a) > { _M_init(); } ># 400 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > ~_List_base() > { _M_clear(); } > > void > _M_clear(); > > void > _M_init() > { > this->_M_impl._M_node._M_next = &this->_M_impl._M_node; > this->_M_impl._M_node._M_prev = &this->_M_impl._M_node; > } > }; ># 457 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _Tp, typename _Alloc = std::allocator<_Tp> > > class list : protected _List_base<_Tp, _Alloc> > { > > typedef typename _Alloc::value_type _Alloc_value_type; > > > > typedef _List_base<_Tp, _Alloc> _Base; > typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; > typedef typename _Base::_Node_alloc_type _Node_alloc_type; > > public: > typedef _Tp value_type; > typedef typename _Tp_alloc_type::pointer pointer; > typedef typename _Tp_alloc_type::const_pointer const_pointer; > typedef typename _Tp_alloc_type::reference reference; > typedef typename _Tp_alloc_type::const_reference const_reference; > typedef _List_iterator<_Tp> iterator; > typedef _List_const_iterator<_Tp> const_iterator; > typedef std::reverse_iterator<const_iterator> const_reverse_iterator; > typedef std::reverse_iterator<iterator> reverse_iterator; > typedef size_t size_type; > typedef ptrdiff_t difference_type; > typedef _Alloc allocator_type; > > protected: > > > typedef _List_node<_Tp> _Node; > > using _Base::_M_impl; > using _Base::_M_put_node; > using _Base::_M_get_node; > using _Base::_M_get_Tp_allocator; > using _Base::_M_get_Node_allocator; ># 501 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > _Node* > _M_create_node(const value_type& __x) > { > _Node* __p = this->_M_get_node(); > try > { > _M_get_Tp_allocator().construct > (std::__addressof(__p->_M_data), __x); > } > catch(...) > { > _M_put_node(__p); > throw; > } > return __p; > } ># 537 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > public: > > > > > > list() > : _Base() { } > > > > > > explicit > list(const allocator_type& __a) > : _Base(_Node_alloc_type(__a)) { } ># 588 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > explicit > list(size_type __n, const value_type& __value = value_type(), > const allocator_type& __a = allocator_type()) > : _Base(_Node_alloc_type(__a)) > { _M_fill_initialize(__n, __value); } ># 602 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > list(const list& __x) > : _Base(__x._M_get_Node_allocator()) > { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); } ># 641 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _InputIterator> > list(_InputIterator __first, _InputIterator __last, > const allocator_type& __a = allocator_type()) > : _Base(_Node_alloc_type(__a)) > { > > typedef typename std::__is_integer<_InputIterator>::__type _Integral; > _M_initialize_dispatch(__first, __last, _Integral()); > } ># 666 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > list& > operator=(const list& __x); ># 712 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > assign(size_type __n, const value_type& __val) > { _M_fill_assign(__n, __val); } ># 728 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _InputIterator> > void > assign(_InputIterator __first, _InputIterator __last) > { > > typedef typename std::__is_integer<_InputIterator>::__type _Integral; > _M_assign_dispatch(__first, __last, _Integral()); > } ># 751 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > allocator_type > get_allocator() const > { return _Base::get_allocator(); } > > > > > > > iterator > begin() > { return iterator(this->_M_impl._M_node._M_next); } > > > > > > > const_iterator > begin() const > { return const_iterator(this->_M_impl._M_node._M_next); } > > > > > > > iterator > end() > { return iterator(&this->_M_impl._M_node); } > > > > > > > const_iterator > end() const > { return const_iterator(&this->_M_impl._M_node); } > > > > > > > reverse_iterator > rbegin() > { return reverse_iterator(end()); } > > > > > > > const_reverse_iterator > rbegin() const > { return const_reverse_iterator(end()); } > > > > > > > reverse_iterator > rend() > { return reverse_iterator(begin()); } > > > > > > > const_reverse_iterator > rend() const > { return const_reverse_iterator(begin()); } ># 870 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > bool > empty() const > { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node; } > > > size_type > size() const > { > > > > return std::distance(begin(), end()); > > } > > > size_type > max_size() const > { return _M_get_Node_allocator().max_size(); } ># 926 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > resize(size_type __new_size, value_type __x = value_type()); > > > > > > > > reference > front() > { return *begin(); } > > > > > > const_reference > front() const > { return *begin(); } > > > > > > reference > back() > { > iterator __tmp = end(); > --__tmp; > return *__tmp; > } > > > > > > const_reference > back() const > { > const_iterator __tmp = end(); > --__tmp; > return *__tmp; > } ># 982 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > push_front(const value_type& __x) > { this->_M_insert(begin(), __x); } ># 1009 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > pop_front() > { this->_M_erase(begin()); } ># 1023 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > push_back(const value_type& __x) > { this->_M_insert(end(), __x); } ># 1049 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > pop_back() > { this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); } ># 1082 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > iterator > insert(iterator __position, const value_type& __x); ># 1131 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > insert(iterator __position, size_type __n, const value_type& __x) > { > list __tmp(__n, __x, get_allocator()); > splice(__position, __tmp); > } ># 1151 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _InputIterator> > void > insert(iterator __position, _InputIterator __first, > _InputIterator __last) > { > list __tmp(__first, __last, get_allocator()); > splice(__position, __tmp); > } ># 1175 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > iterator > erase(iterator __position); ># 1196 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > iterator > erase(iterator __first, iterator __last) > { > while (__first != __last) > __first = erase(__first); > return __last; > } ># 1213 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > swap(list& __x) > { > __detail::_List_node_base::swap(this->_M_impl._M_node, > __x._M_impl._M_node); > > > > > > > std::__alloc_swap<typename _Base::_Node_alloc_type>:: > _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()); > } > > > > > > > > void > clear() > { > _Base::_M_clear(); > _Base::_M_init(); > } ># 1253 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > > > > splice(iterator __position, list& __x) > > { > if (!__x.empty()) > { > _M_check_equal_allocators(__x); > > this->_M_transfer(__position, __x.begin(), __x.end()); > > > > > > } > } ># 1288 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > > > > splice(iterator __position, list& __x, iterator __i) > > { > iterator __j = __i; > ++__j; > if (__position == __i || __position == __j) > return; > > if (this != &__x) > { > _M_check_equal_allocators(__x); > > > > > > } > > this->_M_transfer(__position, __i, __j); > } ># 1331 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > > > > > splice(iterator __position, list& __x, iterator __first, > iterator __last) > > { > if (__first != __last) > { > if (this != &__x) > { > _M_check_equal_allocators(__x); > > > > > > > } > > this->_M_transfer(__position, __first, __last); > } > } ># 1374 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > remove(const _Tp& __value); ># 1388 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _Predicate> > void > remove_if(_Predicate); ># 1402 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > unique(); ># 1417 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _BinaryPredicate> > void > unique(_BinaryPredicate); ># 1438 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > merge(list& __x); ># 1465 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _StrictWeakOrdering> > void > merge(list& __x, _StrictWeakOrdering __comp); > > > > > > > > void > reverse() > { this->_M_impl._M_node._M_reverse(); } > > > > > > > > void > sort(); > > > > > > > > template<typename _StrictWeakOrdering> > void > sort(_StrictWeakOrdering); > > protected: > > > > > > > template<typename _Integer> > void > _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) > { _M_fill_initialize(static_cast<size_type>(__n), __x); } > > > template<typename _InputIterator> > void > _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, > __false_type) > { > for (; __first != __last; ++__first) > push_back(*__first); > } > > > > void > _M_fill_initialize(size_type __n, const value_type& __x) > { > for (; __n; --__n) > push_back(__x); > } ># 1549 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _Integer> > void > _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) > { _M_fill_assign(__n, __val); } > > > template<typename _InputIterator> > void > _M_assign_dispatch(_InputIterator __first, _InputIterator __last, > __false_type); > > > > void > _M_fill_assign(size_type __n, const value_type& __val); > > > > void > _M_transfer(iterator __position, iterator __first, iterator __last) > { __position._M_node->_M_transfer(__first._M_node, __last._M_node); } > > > > void > _M_insert(iterator __position, const value_type& __x) > { > _Node* __tmp = _M_create_node(__x); > __tmp->_M_hook(__position._M_node); > } ># 1590 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > void > _M_erase(iterator __position) > { > __position._M_node->_M_unhook(); > _Node* __n = static_cast<_Node*>(__position._M_node); > > > > _M_get_Tp_allocator().destroy(std::__addressof(__n->_M_data)); > > _M_put_node(__n); > } > > > void > _M_check_equal_allocators(list& __x) > { > if (std::__alloc_neq<typename _Base::_Node_alloc_type>:: > _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator())) > __throw_runtime_error(("list::_M_check_equal_allocators")); > } > }; ># 1623 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _Tp, typename _Alloc> > inline bool > operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) > { > > > > > typedef typename list<_Tp, _Alloc>::const_iterator const_iterator; > const_iterator __end1 = __x.end(); > const_iterator __end2 = __y.end(); > > const_iterator __i1 = __x.begin(); > const_iterator __i2 = __y.begin(); > while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) > { > ++__i1; > ++__i2; > } > return __i1 == __end1 && __i2 == __end2; > > } ># 1657 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_list.h" 3 > template<typename _Tp, typename _Alloc> > inline bool > operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) > { return std::lexicographical_compare(__x.begin(), __x.end(), > __y.begin(), __y.end()); } > > > template<typename _Tp, typename _Alloc> > inline bool > operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) > { return !(__x == __y); } > > > template<typename _Tp, typename _Alloc> > inline bool > operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) > { return __y < __x; } > > > template<typename _Tp, typename _Alloc> > inline bool > operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) > { return !(__y < __x); } > > > template<typename _Tp, typename _Alloc> > inline bool > operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) > { return !(__x < __y); } > > > template<typename _Tp, typename _Alloc> > inline void > swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) > { __x.swap(__y); } > > >} ># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 2 3 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/list.tcc" 1 3 ># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/list.tcc" 3 >namespace std __attribute__ ((__visibility__ ("default"))) >{ > > > template<typename _Tp, typename _Alloc> > void > _List_base<_Tp, _Alloc>:: > _M_clear() > { > typedef _List_node<_Tp> _Node; > _Node* __cur = static_cast<_Node*>(_M_impl._M_node._M_next); > while (__cur != &_M_impl._M_node) > { > _Node* __tmp = __cur; > __cur = static_cast<_Node*>(__cur->_M_next); > > > > _M_get_Tp_allocator().destroy(std::__addressof(__tmp->_M_data)); > > _M_put_node(__tmp); > } > } ># 97 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/list.tcc" 3 > template<typename _Tp, typename _Alloc> > typename list<_Tp, _Alloc>::iterator > list<_Tp, _Alloc>:: > insert(iterator __position, const value_type& __x) > { > _Node* __tmp = _M_create_node(__x); > __tmp->_M_hook(__position._M_node); > return iterator(__tmp); > } > > template<typename _Tp, typename _Alloc> > typename list<_Tp, _Alloc>::iterator > list<_Tp, _Alloc>:: > erase(iterator __position) > { > iterator __ret = iterator(__position._M_node->_M_next); > _M_erase(__position); > return __ret; > } ># 167 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/list.tcc" 3 > template<typename _Tp, typename _Alloc> > void > list<_Tp, _Alloc>:: > resize(size_type __new_size, value_type __x) > { > iterator __i = begin(); > size_type __len = 0; > for (; __i != end() && __len < __new_size; ++__i, ++__len) > ; > if (__len == __new_size) > erase(__i, end()); > else > insert(end(), __new_size - __len, __x); > } > > > template<typename _Tp, typename _Alloc> > list<_Tp, _Alloc>& > list<_Tp, _Alloc>:: > operator=(const list& __x) > { > if (this != &__x) > { > iterator __first1 = begin(); > iterator __last1 = end(); > const_iterator __first2 = __x.begin(); > const_iterator __last2 = __x.end(); > for (; __first1 != __last1 && __first2 != __last2; > ++__first1, ++__first2) > *__first1 = *__first2; > if (__first2 == __last2) > erase(__first1, __last1); > else > insert(__last1, __first2, __last2); > } > return *this; > } > > template<typename _Tp, typename _Alloc> > void > list<_Tp, _Alloc>:: > _M_fill_assign(size_type __n, const value_type& __val) > { > iterator __i = begin(); > for (; __i != end() && __n > 0; ++__i, --__n) > *__i = __val; > if (__n > 0) > insert(end(), __n, __val); > else > erase(__i, end()); > } > > template<typename _Tp, typename _Alloc> > template <typename _InputIterator> > void > list<_Tp, _Alloc>:: > _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2, > __false_type) > { > iterator __first1 = begin(); > iterator __last1 = end(); > for (; __first1 != __last1 && __first2 != __last2; > ++__first1, ++__first2) > *__first1 = *__first2; > if (__first2 == __last2) > erase(__first1, __last1); > else > insert(__last1, __first2, __last2); > } > > template<typename _Tp, typename _Alloc> > void > list<_Tp, _Alloc>:: > remove(const value_type& __value) > { > iterator __first = begin(); > iterator __last = end(); > iterator __extra = __last; > while (__first != __last) > { > iterator __next = __first; > ++__next; > if (*__first == __value) > { > > > > if (std::__addressof(*__first) != std::__addressof(__value)) > _M_erase(__first); > else > __extra = __first; > } > __first = __next; > } > if (__extra != __last) > _M_erase(__extra); > } > > template<typename _Tp, typename _Alloc> > void > list<_Tp, _Alloc>:: > unique() > { > iterator __first = begin(); > iterator __last = end(); > if (__first == __last) > return; > iterator __next = __first; > while (++__next != __last) > { > if (*__first == *__next) > _M_erase(__next); > else > __first = __next; > __next = __first; > } > } > > template<typename _Tp, typename _Alloc> > void > list<_Tp, _Alloc>:: > > > > merge(list& __x) > > { > > > if (this != &__x) > { > _M_check_equal_allocators(__x); > > iterator __first1 = begin(); > iterator __last1 = end(); > iterator __first2 = __x.begin(); > iterator __last2 = __x.end(); > while (__first1 != __last1 && __first2 != __last2) > if (*__first2 < *__first1) > { > iterator __next = __first2; > _M_transfer(__first1, __first2, ++__next); > __first2 = __next; > } > else > ++__first1; > if (__first2 != __last2) > _M_transfer(__last1, __first2, __last2); > > > > > > } > } > > template<typename _Tp, typename _Alloc> > template <typename _StrictWeakOrdering> > void > list<_Tp, _Alloc>:: > > > > merge(list& __x, _StrictWeakOrdering __comp) > > { > > > if (this != &__x) > { > _M_check_equal_allocators(__x); > > iterator __first1 = begin(); > iterator __last1 = end(); > iterator __first2 = __x.begin(); > iterator __last2 = __x.end(); > while (__first1 != __last1 && __first2 != __last2) > if (__comp(*__first2, *__first1)) > { > iterator __next = __first2; > _M_transfer(__first1, __first2, ++__next); > __first2 = __next; > } > else > ++__first1; > if (__first2 != __last2) > _M_transfer(__last1, __first2, __last2); > > > > > > } > } > > template<typename _Tp, typename _Alloc> > void > list<_Tp, _Alloc>:: > sort() > { > > if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node > && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) > { > list __carry; > list __tmp[64]; > list * __fill = &__tmp[0]; > list * __counter; > > do > { > __carry.splice(__carry.begin(), *this, begin()); > > for(__counter = &__tmp[0]; > __counter != __fill && !__counter->empty(); > ++__counter) > { > __counter->merge(__carry); > __carry.swap(*__counter); > } > __carry.swap(*__counter); > if (__counter == __fill) > ++__fill; > } > while ( !empty() ); > > for (__counter = &__tmp[1]; __counter != __fill; ++__counter) > __counter->merge(*(__counter - 1)); > swap( *(__fill - 1) ); > } > } > > template<typename _Tp, typename _Alloc> > template <typename _Predicate> > void > list<_Tp, _Alloc>:: > remove_if(_Predicate __pred) > { > iterator __first = begin(); > iterator __last = end(); > while (__first != __last) > { > iterator __next = __first; > ++__next; > if (__pred(*__first)) > _M_erase(__first); > __first = __next; > } > } > > template<typename _Tp, typename _Alloc> > template <typename _BinaryPredicate> > void > list<_Tp, _Alloc>:: > unique(_BinaryPredicate __binary_pred) > { > iterator __first = begin(); > iterator __last = end(); > if (__first == __last) > return; > iterator __next = __first; > while (++__next != __last) > { > if (__binary_pred(*__first, *__next)) > _M_erase(__next); > else > __first = __next; > __next = __first; > } > } > > template<typename _Tp, typename _Alloc> > template <typename _StrictWeakOrdering> > void > list<_Tp, _Alloc>:: > sort(_StrictWeakOrdering __comp) > { > > if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node > && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) > { > list __carry; > list __tmp[64]; > list * __fill = &__tmp[0]; > list * __counter; > > do > { > __carry.splice(__carry.begin(), *this, begin()); > > for(__counter = &__tmp[0]; > __counter != __fill && !__counter->empty(); > ++__counter) > { > __counter->merge(__carry, __comp); > __carry.swap(*__counter); > } > __carry.swap(*__counter); > if (__counter == __fill) > ++__fill; > } > while ( !empty() ); > > for (__counter = &__tmp[1]; __counter != __fill; ++__counter) > __counter->merge(*(__counter - 1), __comp); > swap(*(__fill - 1)); > } > } > > >} ># 66 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 2 3 ># 51 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 2 > > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 1 3 4 ># 34 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 3 4 ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/syslimits.h" 1 3 4 > > > > > > ># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 1 3 4 ># 169 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 3 4 ># 1 "/usr/include/limits.h" 1 3 4 ># 145 "/usr/include/limits.h" 3 4 ># 1 "/usr/include/bits/posix1_lim.h" 1 3 4 ># 157 "/usr/include/bits/posix1_lim.h" 3 4 ># 1 "/usr/include/bits/local_lim.h" 1 3 4 ># 39 "/usr/include/bits/local_lim.h" 3 4 ># 1 "/usr/include/linux/limits.h" 1 3 4 ># 40 "/usr/include/bits/local_lim.h" 2 3 4 ># 158 "/usr/include/bits/posix1_lim.h" 2 3 4 ># 146 "/usr/include/limits.h" 2 3 4 > > > ># 1 "/usr/include/bits/posix2_lim.h" 1 3 4 ># 150 "/usr/include/limits.h" 2 3 4 > > > ># 1 "/usr/include/bits/xopen_lim.h" 1 3 4 ># 34 "/usr/include/bits/xopen_lim.h" 3 4 ># 1 "/usr/include/bits/stdio_lim.h" 1 3 4 ># 35 "/usr/include/bits/xopen_lim.h" 2 3 4 ># 154 "/usr/include/limits.h" 2 3 4 ># 170 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 2 3 4 ># 8 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/syslimits.h" 2 3 4 ># 35 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 2 3 4 ># 58 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" 2 > > > > > > > >template <typename T> class QVector; >template <typename T> class QSet; > >struct __attribute__((visibility("default"))) QListData { > struct Data { > QtPrivate::RefCount ref; > int alloc, begin, end; > void *array[1]; > }; > enum { DataHeaderSize = sizeof(Data) - sizeof(void *) }; > > Data *detach(int alloc); > Data *detach_grow(int *i, int n); > void realloc(int alloc); > static const Data shared_null; > Data *d; > void **erase(void **xi); > void **append(int n); > void **append(); > void **append(const QListData &l); > void **prepend(); > void **insert(int i); > void remove(int i); > void remove(int i, int n); > void move(int from, int to); > inline int size() const { return d->end - d->begin; } > inline bool isEmpty() const { return d->end == d->begin; } > inline void **at(int i) const { return d->array + d->begin + i; } > inline void **begin() const { return d->array + d->begin; } > inline void **end() const { return d->array + d->end; } >}; > >template <typename T> >class QList >{ > struct Node { void *v; > > > > inline T &t() > { return *reinterpret_cast<T*>(QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic > ? v : this); } > > }; > > union { QListData p; QListData::Data *d; }; > >public: > inline QList() : d(const_cast<QListData::Data *>(&QListData::shared_null)) { } > QList(const QList<T> &l); > ~QList(); > QList<T> &operator=(const QList<T> &l); > > > > > > inline void swap(QList<T> &other) { qSwap(d, other.d); } > > > > > > bool operator==(const QList<T> &l) const; > inline bool operator!=(const QList<T> &l) const { return !(*this == l); } > > inline int size() const { return p.size(); } > > inline void detach() { if (d->ref.isShared()) detach_helper(); } > > inline void detachShared() > { > > if (d->ref.isShared() && this->d != &QListData::shared_null) > detach_helper(); > } > > inline bool isDetached() const { return !d->ref.isShared(); } > inline void setSharable(bool sharable) > { > if (sharable == d->ref.isSharable()) > return; > if (!sharable) > detach(); > if (d != &QListData::shared_null) > d->ref.setSharable(sharable); > } > inline bool isSharedWith(const QList<T> &other) const { return d == other.d; } > > inline bool isEmpty() const { return p.isEmpty(); } > > void clear(); > > const T &at(int i) const; > const T &operator[](int i) const; > T &operator[](int i); > > void reserve(int size); > void append(const T &t); > void append(const QList<T> &t); > void prepend(const T &t); > void insert(int i, const T &t); > void replace(int i, const T &t); > void removeAt(int i); > int removeAll(const T &t); > bool removeOne(const T &t); > T takeAt(int i); > T takeFirst(); > T takeLast(); > void move(int from, int to); > void swap(int i, int j); > int indexOf(const T &t, int from = 0) const; > int lastIndexOf(const T &t, int from = -1) const; > bool contains(const T &t) const; > int count(const T &t) const; > > class const_iterator; > > class iterator { > public: > Node *i; > typedef std::random_access_iterator_tag iterator_category; > typedef qptrdiff difference_type; > typedef T value_type; > typedef T *pointer; > typedef T &reference; > > inline iterator() : i(0) {} > inline iterator(Node *n) : i(n) {} > inline iterator(const iterator &o): i(o.i){} > inline T &operator*() const { return i->t(); } > inline T *operator->() const { return &i->t(); } > inline T &operator[](int j) const { return i[j].t(); } > inline bool operator==(const iterator &o) const { return i == o.i; } > inline bool operator!=(const iterator &o) const { return i != o.i; } > inline bool operator<(const iterator& other) const { return i < other.i; } > inline bool operator<=(const iterator& other) const { return i <= other.i; } > inline bool operator>(const iterator& other) const { return i > other.i; } > inline bool operator>=(const iterator& other) const { return i >= other.i; } > > inline bool operator==(const const_iterator &o) const > { return i == o.i; } > inline bool operator!=(const const_iterator &o) const > { return i != o.i; } > inline bool operator<(const const_iterator& other) const > { return i < other.i; } > inline bool operator<=(const const_iterator& other) const > { return i <= other.i; } > inline bool operator>(const const_iterator& other) const > { return i > other.i; } > inline bool operator>=(const const_iterator& other) const > { return i >= other.i; } > > inline iterator &operator++() { ++i; return *this; } > inline iterator operator++(int) { Node *n = i; ++i; return n; } > inline iterator &operator--() { i--; return *this; } > inline iterator operator--(int) { Node *n = i; i--; return n; } > inline iterator &operator+=(int j) { i+=j; return *this; } > inline iterator &operator-=(int j) { i-=j; return *this; } > inline iterator operator+(int j) const { return iterator(i+j); } > inline iterator operator-(int j) const { return iterator(i-j); } > inline int operator-(iterator j) const { return int(i - j.i); } > }; > friend class iterator; > > class const_iterator { > public: > Node *i; > typedef std::random_access_iterator_tag iterator_category; > typedef qptrdiff difference_type; > typedef T value_type; > typedef const T *pointer; > typedef const T &reference; > > inline const_iterator() : i(0) {} > inline const_iterator(Node *n) : i(n) {} > inline const_iterator(const const_iterator &o): i(o.i) {} > > > > inline const_iterator(const iterator &o): i(o.i) {} > > inline const T &operator*() const { return i->t(); } > inline const T *operator->() const { return &i->t(); } > inline const T &operator[](int j) const { return i[j].t(); } > inline bool operator==(const const_iterator &o) const { return i == o.i; } > inline bool operator!=(const const_iterator &o) const { return i != o.i; } > inline bool operator<(const const_iterator& other) const { return i < other.i; } > inline bool operator<=(const const_iterator& other) const { return i <= other.i; } > inline bool operator>(const const_iterator& other) const { return i > other.i; } > inline bool operator>=(const const_iterator& other) const { return i >= other.i; } > inline const_iterator &operator++() { ++i; return *this; } > inline const_iterator operator++(int) { Node *n = i; ++i; return n; } > inline const_iterator &operator--() { i--; return *this; } > inline const_iterator operator--(int) { Node *n = i; i--; return n; } > inline const_iterator &operator+=(int j) { i+=j; return *this; } > inline const_iterator &operator-=(int j) { i-=j; return *this; } > inline const_iterator operator+(int j) const { return const_iterator(i+j); } > inline const_iterator operator-(int j) const { return const_iterator(i-j); } > inline int operator-(const_iterator j) const { return i - j.i; } > }; > friend class const_iterator; > > > inline iterator begin() { detach(); return reinterpret_cast<Node *>(p.begin()); } > inline const_iterator begin() const { return reinterpret_cast<Node *>(p.begin()); } > inline const_iterator cbegin() const { return reinterpret_cast<Node *>(p.begin()); } > inline const_iterator constBegin() const { return reinterpret_cast<Node *>(p.begin()); } > inline iterator end() { detach(); return reinterpret_cast<Node *>(p.end()); } > inline const_iterator end() const { return reinterpret_cast<Node *>(p.end()); } > inline const_iterator cend() const { return reinterpret_cast<Node *>(p.end()); } > inline const_iterator constEnd() const { return reinterpret_cast<Node *>(p.end()); } > iterator insert(iterator before, const T &t); > iterator erase(iterator pos); > iterator erase(iterator first, iterator last); > > > typedef iterator Iterator; > typedef const_iterator ConstIterator; > inline int count() const { return p.size(); } > inline int length() const { return p.size(); } > inline T& first() { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",286) : qt_noop()); return *begin(); } > inline const T& first() const { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",287) : qt_noop()); return at(0); } > T& last() { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",288) : qt_noop()); return *(--end()); } > const T& last() const { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",289) : qt_noop()); return at(count() - 1); } > inline void removeFirst() { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",290) : qt_noop()); erase(begin()); } > inline void removeLast() { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",291) : qt_noop()); erase(--end()); } > inline bool startsWith(const T &t) const { return !isEmpty() && first() == t; } > inline bool endsWith(const T &t) const { return !isEmpty() && last() == t; } > QList<T> mid(int pos, int length = -1) const; > > T value(int i) const; > T value(int i, const T &defaultValue) const; > > > inline void push_back(const T &t) { append(t); } > inline void push_front(const T &t) { prepend(t); } > inline T& front() { return first(); } > inline const T& front() const { return first(); } > inline T& back() { return last(); } > inline const T& back() const { return last(); } > inline void pop_front() { removeFirst(); } > inline void pop_back() { removeLast(); } > inline bool empty() const { return isEmpty(); } > typedef int size_type; > typedef T value_type; > typedef value_type *pointer; > typedef const value_type *const_pointer; > typedef value_type &reference; > typedef const value_type &const_reference; > typedef qptrdiff difference_type; > > > QList<T> &operator+=(const QList<T> &l); > inline QList<T> operator+(const QList<T> &l) const > { QList n = *this; n += l; return n; } > inline QList<T> &operator+=(const T &t) > { append(t); return *this; } > inline QList<T> &operator<< (const T &t) > { append(t); return *this; } > inline QList<T> &operator<<(const QList<T> &l) > { *this += l; return *this; } > > QVector<T> toVector() const; > QSet<T> toSet() const; > > static QList<T> fromVector(const QVector<T> &vector); > static QList<T> fromSet(const QSet<T> &set); > > static inline QList<T> fromStdList(const std::list<T> &list) > { QList<T> tmp; qCopy(list.begin(), list.end(), std::back_inserter(tmp)); return tmp; } > inline std::list<T> toStdList() const > { std::list<T> tmp; qCopy(constBegin(), constEnd(), std::back_inserter(tmp)); return tmp; } > >private: > Node *detach_helper_grow(int i, int n); > void detach_helper(int alloc); > void detach_helper(); > void dealloc(QListData::Data *d); > > void node_construct(Node *n, const T &t); > void node_destruct(Node *n); > void node_copy(Node *from, Node *to, Node *src); > void node_destruct(Node *from, Node *to); >}; > > > > > > > >template <typename T> >inline void QList<T>::node_construct(Node *n, const T &t) >{ > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) n->v = new T(t); > else if (QTypeInfo<T>::isComplex) new (n) T(t); > > > > > > > > else ::memcpy(n, &t, sizeof(T)); > >} > >template <typename T> >inline void QList<T>::node_destruct(Node *n) >{ > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) delete reinterpret_cast<T*>(n->v); > else if (QTypeInfo<T>::isComplex) reinterpret_cast<T*>(n)->~T(); >} > >template <typename T> >inline void QList<T>::node_copy(Node *from, Node *to, Node *src) >{ > Node *current = from; > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) { > try { > while(current != to) { > current->v = new T(*reinterpret_cast<T*>(src->v)); > ++current; > ++src; > } > } catch (...) { > while (current-- != from) > delete reinterpret_cast<T*>(current->v); > throw; > } > > } else if (QTypeInfo<T>::isComplex) { > try { > while(current != to) { > new (current) T(*reinterpret_cast<T*>(src)); > ++current; > ++src; > } > } catch (...) { > while (current-- != from) > (reinterpret_cast<T*>(current))->~T(); > throw; > } > } else { > if (src != from && to - from > 0) > memcpy(from, src, (to - from) * sizeof(Node)); > } >} > >template <typename T> >inline void QList<T>::node_destruct(Node *from, Node *to) >{ > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) > while(from != to) --to, delete reinterpret_cast<T*>(to->v); > else if (QTypeInfo<T>::isComplex) > while (from != to) --to, reinterpret_cast<T*>(to)->~T(); >} > >template <typename T> >inline QList<T> &QList<T>::operator=(const QList<T> &l) >{ > if (d != l.d) { > QList<T> tmp(l); > tmp.swap(*this); > } > return *this; >} >template <typename T> >inline typename QList<T>::iterator QList<T>::insert(iterator before, const T &t) >{ > int iBefore = int(before.i - reinterpret_cast<Node *>(p.begin())); > Node *n = reinterpret_cast<Node *>(p.insert(iBefore)); > try { > node_construct(n, t); > } catch (...) { > p.remove(iBefore); > throw; > } > return n; >} >template <typename T> >inline typename QList<T>::iterator QList<T>::erase(iterator it) >{ node_destruct(it.i); > return reinterpret_cast<Node *>(p.erase(reinterpret_cast<void**>(it.i))); } >template <typename T> >inline const T &QList<T>::at(int i) const >{ ((!(i >= 0 && i < p.size())) ? qt_assert_x("QList<T>::at", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",452) : qt_noop()); > return reinterpret_cast<Node *>(p.at(i))->t(); } >template <typename T> >inline const T &QList<T>::operator[](int i) const >{ ((!(i >= 0 && i < p.size())) ? qt_assert_x("QList<T>::operator[]", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",456) : qt_noop()); > return reinterpret_cast<Node *>(p.at(i))->t(); } >template <typename T> >inline T &QList<T>::operator[](int i) >{ ((!(i >= 0 && i < p.size())) ? qt_assert_x("QList<T>::operator[]", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",460) : qt_noop()); > detach(); return reinterpret_cast<Node *>(p.at(i))->t(); } >template <typename T> >inline void QList<T>::removeAt(int i) >{ if(i >= 0 && i < p.size()) { detach(); > node_destruct(reinterpret_cast<Node *>(p.at(i))); p.remove(i); } } >template <typename T> >inline T QList<T>::takeAt(int i) >{ ((!(i >= 0 && i < p.size())) ? qt_assert_x("QList<T>::take", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",468) : qt_noop()); > detach(); Node *n = reinterpret_cast<Node *>(p.at(i)); T t = n->t(); node_destruct(n); > p.remove(i); return t; } >template <typename T> >inline T QList<T>::takeFirst() >{ T t = first(); removeFirst(); return t; } >template <typename T> >inline T QList<T>::takeLast() >{ T t = last(); removeLast(); return t; } > >template <typename T> > void QList<T>::reserve(int alloc) >{ > if (d->alloc < alloc) { > if (d->ref.isShared()) > detach_helper(alloc); > else > p.realloc(alloc); > } >} > >template <typename T> > void QList<T>::append(const T &t) >{ > if (d->ref.isShared()) { > Node *n = detach_helper_grow(2147483647, 1); > try { > node_construct(n, t); > } catch (...) { > --d->end; > throw; > } > } else { > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) { > Node *n = reinterpret_cast<Node *>(p.append()); > try { > node_construct(n, t); > } catch (...) { > --d->end; > throw; > } > } else { > Node *n, copy; > node_construct(©, t); > try { > n = reinterpret_cast<Node *>(p.append());; > } catch (...) { > node_destruct(©); > throw; > } > *n = copy; > } > } >} > >template <typename T> >inline void QList<T>::prepend(const T &t) >{ > if (d->ref.isShared()) { > Node *n = detach_helper_grow(0, 1); > try { > node_construct(n, t); > } catch (...) { > ++d->begin; > throw; > } > } else { > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) { > Node *n = reinterpret_cast<Node *>(p.prepend()); > try { > node_construct(n, t); > } catch (...) { > ++d->begin; > throw; > } > } else { > Node *n, copy; > node_construct(©, t); > try { > n = reinterpret_cast<Node *>(p.prepend());; > } catch (...) { > node_destruct(©); > throw; > } > *n = copy; > } > } >} > >template <typename T> >inline void QList<T>::insert(int i, const T &t) >{ > if (d->ref.isShared()) { > Node *n = detach_helper_grow(i, 1); > try { > node_construct(n, t); > } catch (...) { > p.remove(i); > throw; > } > } else { > if (QTypeInfo<T>::isLarge || QTypeInfo<T>::isStatic) { > Node *n = reinterpret_cast<Node *>(p.insert(i)); > try { > node_construct(n, t); > } catch (...) { > p.remove(i); > throw; > } > } else { > Node *n, copy; > node_construct(©, t); > try { > n = reinterpret_cast<Node *>(p.insert(i));; > } catch (...) { > node_destruct(©); > throw; > } > *n = copy; > } > } >} > >template <typename T> >inline void QList<T>::replace(int i, const T &t) >{ > ((!(i >= 0 && i < p.size())) ? qt_assert_x("QList<T>::replace", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",594) : qt_noop()); > detach(); > reinterpret_cast<Node *>(p.at(i))->t() = t; >} > >template <typename T> >inline void QList<T>::swap(int i, int j) >{ > ((!(i >= 0 && i < p.size() && j >= 0 && j < p.size())) ? qt_assert_x("QList<T>::swap", "index out of range", > "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" ># 602 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" > , > 603 ># 602 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" > ) : qt_noop()) > ; > detach(); > void *t = d->array[d->begin + i]; > d->array[d->begin + i] = d->array[d->begin + j]; > d->array[d->begin + j] = t; >} > >template <typename T> >inline void QList<T>::move(int from, int to) >{ > ((!(from >= 0 && from < p.size() && to >= 0 && to < p.size())) ? qt_assert_x("QList<T>::move", "index out of range", > "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" ># 613 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" > , > 614 ># 613 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h" > ) : qt_noop()) > ; > detach(); > p.move(from, to); >} > >template<typename T> > QList<T> QList<T>::mid(int pos, int alength) const >{ > if (alength < 0 || pos + alength > size()) > alength = size() - pos; > if (pos == 0 && alength == size()) > return *this; > QList<T> cpy; > if (alength <= 0) > return cpy; > cpy.reserve(alength); > cpy.d->end = alength; > try { > cpy.node_copy(reinterpret_cast<Node *>(cpy.p.begin()), > reinterpret_cast<Node *>(cpy.p.end()), > reinterpret_cast<Node *>(p.begin() + pos)); > } catch (...) { > > cpy.d->end = 0; > throw; > } > return cpy; >} > >template<typename T> > T QList<T>::value(int i) const >{ > if (i < 0 || i >= p.size()) { > return T(); > } > return reinterpret_cast<Node *>(p.at(i))->t(); >} > >template<typename T> > T QList<T>::value(int i, const T& defaultValue) const >{ > return ((i < 0 || i >= p.size()) ? defaultValue : reinterpret_cast<Node *>(p.at(i))->t()); >} > >template <typename T> > typename QList<T>::Node *QList<T>::detach_helper_grow(int i, int c) >{ > Node *n = reinterpret_cast<Node *>(p.begin()); > QListData::Data *x = p.detach_grow(&i, c); > try { > node_copy(reinterpret_cast<Node *>(p.begin()), > reinterpret_cast<Node *>(p.begin() + i), n); > } catch (...) { > free(d); > d = x; > throw; > } > try { > node_copy(reinterpret_cast<Node *>(p.begin() + i + c), > reinterpret_cast<Node *>(p.end()), n + i); > } catch (...) { > node_destruct(reinterpret_cast<Node *>(p.begin()), > reinterpret_cast<Node *>(p.begin() + i)); > free(d); > d = x; > throw; > } > > if (!x->ref.deref()) > dealloc(x); > > return reinterpret_cast<Node *>(p.begin() + i); >} > >template <typename T> > void QList<T>::detach_helper(int alloc) >{ > Node *n = reinterpret_cast<Node *>(p.begin()); > QListData::Data *x = p.detach(alloc); > try { > node_copy(reinterpret_cast<Node *>(p.begin()), reinterpret_cast<Node *>(p.end()), n); > } catch (...) { > free(d); > d = x; > throw; > } > > if (!x->ref.deref()) > dealloc(x); >} > >template <typename T> > void QList<T>::detach_helper() >{ > detach_helper(d->alloc); >} > >template <typename T> > QList<T>::QList(const QList<T> &l) > : d(l.d) >{ > if (!d->ref.ref()) { > p.detach(d->alloc); > > struct Cleanup > { > Cleanup(QListData::Data *d) : d_(d) {} > ~Cleanup() { if (d_) free(d_); } > > QListData::Data *d_; > } tryCatch(d); > > node_copy(reinterpret_cast<Node *>(p.begin()), > reinterpret_cast<Node *>(p.end()), > reinterpret_cast<Node *>(l.p.begin())); > tryCatch.d_ = 0; > } >} > >template <typename T> > QList<T>::~QList() >{ > if (!d->ref.deref()) > dealloc(d); >} > >template <typename T> > bool QList<T>::operator==(const QList<T> &l) const >{ > if (p.size() != l.p.size()) > return false; > if (d == l.d) > return true; > Node *i = reinterpret_cast<Node *>(p.end()); > Node *b = reinterpret_cast<Node *>(p.begin()); > Node *li = reinterpret_cast<Node *>(l.p.end()); > while (i != b) { > --i; --li; > if (!(i->t() == li->t())) > return false; > } > return true; >} > >template <typename T> > void QList<T>::dealloc(QListData::Data *data) >{ > node_destruct(reinterpret_cast<Node *>(data->array + data->begin), > reinterpret_cast<Node *>(data->array + data->end)); > free(data); >} > > >template <typename T> > void QList<T>::clear() >{ > *this = QList<T>(); >} > >template <typename T> > int QList<T>::removeAll(const T &_t) >{ > int index = indexOf(_t); > if (index == -1) > return 0; > > const T t = _t; > detach(); > > Node *i = reinterpret_cast<Node *>(p.at(index)); > Node *e = reinterpret_cast<Node *>(p.end()); > Node *n = i; > node_destruct(i); > while (++i != e) { > if (i->t() == t) > node_destruct(i); > else > *n++ = *i; > } > > int removedCount = e - n; > d->end -= removedCount; > return removedCount; >} > >template <typename T> > bool QList<T>::removeOne(const T &_t) >{ > int index = indexOf(_t); > if (index != -1) { > removeAt(index); > return true; > } > return false; >} > >template <typename T> > typename QList<T>::iterator QList<T>::erase(typename QList<T>::iterator afirst, > typename QList<T>::iterator alast) >{ > for (Node *n = afirst.i; n < alast.i; ++n) > node_destruct(n); > int idx = afirst - begin(); > p.remove(idx, alast - afirst); > return begin() + idx; >} > >template <typename T> > QList<T> &QList<T>::operator+=(const QList<T> &l) >{ > if (!l.isEmpty()) { > if (isEmpty()) { > *this = l; > } else { > Node *n = (d->ref.isShared()) > ? detach_helper_grow(2147483647, l.size()) > : reinterpret_cast<Node *>(p.append(l.p)); > try { > node_copy(n, reinterpret_cast<Node *>(p.end()), > reinterpret_cast<Node *>(l.p.begin())); > } catch (...) { > > d->end -= int(reinterpret_cast<Node *>(p.end()) - n); > throw; > } > } > } > return *this; >} > >template <typename T> >inline void QList<T>::append(const QList<T> &t) >{ > *this += t; >} > >template <typename T> > int QList<T>::indexOf(const T &t, int from) const >{ > if (from < 0) > from = qMax(from + p.size(), 0); > if (from < p.size()) { > Node *n = reinterpret_cast<Node *>(p.at(from -1)); > Node *e = reinterpret_cast<Node *>(p.end()); > while (++n != e) > if (n->t() == t) > return int(n - reinterpret_cast<Node *>(p.begin())); > } > return -1; >} > >template <typename T> > int QList<T>::lastIndexOf(const T &t, int from) const >{ > if (from < 0) > from += p.size(); > else if (from >= p.size()) > from = p.size()-1; > if (from >= 0) { > Node *b = reinterpret_cast<Node *>(p.begin()); > Node *n = reinterpret_cast<Node *>(p.at(from + 1)); > while (n-- != b) { > if (n->t() == t) > return n - b; > } > } > return -1; >} > >template <typename T> > bool QList<T>::contains(const T &t) const >{ > Node *b = reinterpret_cast<Node *>(p.begin()); > Node *i = reinterpret_cast<Node *>(p.end()); > while (i-- != b) > if (i->t() == t) > return true; > return false; >} > >template <typename T> > int QList<T>::count(const T &t) const >{ > int c = 0; > Node *b = reinterpret_cast<Node *>(p.begin()); > Node *i = reinterpret_cast<Node *>(p.end()); > while (i-- != b) > if (i->t() == t) > ++c; > return c; >} > >template <class T> class QListIterator { typedef typename QList<T>::const_iterator const_iterator; QList<T> c; const_iterator i; public: inline QListIterator(const QList<T> &container) : c(container), i(c.constBegin()) {} inline QListIterator &operator=(const QList<T> &container) { c = container; i = c.constBegin(); return *this; } inline void toFront() { i = c.constBegin(); } inline void toBack() { i = c.constEnd(); } inline bool hasNext() const { return i != c.constEnd(); } inline const T &next() { return *i++; } inline const T &peekNext() const { return *i; } inline bool hasPrevious() const { return i != c.constBegin(); } inline const T &previous() { return *--i; } inline const T &peekPrevious() const { const_iterator p = i; return *--p; } inline bool findNext(const T &t) { while (i != c.constEnd()) if (*i++ == t) return true; return false; } inline bool findPrevious(const T &t) { while (i != c.constBegin()) if (*(--i) == t) return true; return false; } }; >template <class T> class QMutableListIterator { typedef typename QList<T>::iterator iterator; typedef typename QList<T>::const_iterator const_iterator; QList<T> *c; iterator i, n; inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } public: inline QMutableListIterator(QList<T> &container) : c(&container) { c->setSharable(false); i = c->begin(); n = c->end(); } inline ~QMutableListIterator() { c->setSharable(true); } inline QMutableListIterator &operator=(QList<T> &container) { c->setSharable(true); c = &container; c->setSharable(false); i = c->begin(); n = c->end(); return *this; } inline void toFront() { i = c->begin(); n = c->end(); } inline void toBack() { i = c->end(); n = i; } inline bool hasNext() const { return c->constEnd() != const_iterator(i); } inline T &next() { n = i++; return *n; } inline T &peekNext() const { return *i; } inline bool hasPrevious() const { return c->constBegin() != const_iterator(i); } inline T &previous() { n = --i; return *n; } inline T &peekPrevious() const { iterator p = i; return *--p; } inline void remove() { if (c->constEnd() != const_iterator(n)) { i = c->erase(n); n = c->end(); } } inline void setValue(const T &t) const { if (c->constEnd() != const_iterator(n)) *n = t; } inline T &value() { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",907) : qt_noop()); return *n; } inline const T &value() const { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qlist.h",907) : qt_noop()); return *n; } inline void insert(const T &t) { n = i = c->insert(i, t); ++i; } inline bool findNext(const T &t) { while (c->constEnd() != const_iterator(n = i)) if (*i++ == t) return true; return false; } inline bool findPrevious(const T &t) { while (c->constBegin() != const_iterator(i)) if (*(n = --i) == t) return true; n = c->end(); return false; } }; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qlist.h" 2 ># 51 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qscopedpointer.h" 1 ># 55 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qmetatype.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qbytearray.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qvarlengtharray.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qcontainerfwd.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qcontainerfwd.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qcontainerfwd.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qcontainerfwd.h" 2 > > > > > > >template <class Key, class T> class QCache; >template <class Key, class T> class QHash; >template <class T> class QLinkedList; >template <class T> class QList; >template <class Key, class T> class QMap; >template <class Key, class T> class QMultiHash; >template <class Key, class T> class QMultiMap; >template <class T1, class T2> struct QPair; >template <class T> class QQueue; >template <class T> class QSet; >template <class T> class QStack; >template<class T, int Prealloc = 256> class QVarLengthArray; >template <class T> class QVector; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qcontainerfwd.h" 2 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qalgorithms.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h" 2 > > > > > > > > > > >template<class T, int Prealloc> >class QPodList; > > >template<class T, int Prealloc> >class QVarLengthArray >{ >public: > inline explicit QVarLengthArray(int size = 0); > > inline QVarLengthArray(const QVarLengthArray<T, Prealloc> &other) > : a(Prealloc), s(0), ptr(reinterpret_cast<T *>(array)) > { > append(other.constData(), other.size()); > } > > inline ~QVarLengthArray() { > if (QTypeInfo<T>::isComplex) { > T *i = ptr + s; > while (i-- != ptr) > i->~T(); > } > if (ptr != reinterpret_cast<T *>(array)) > free(ptr); > } > inline QVarLengthArray<T, Prealloc> &operator=(const QVarLengthArray<T, Prealloc> &other) > { > if (this != &other) { > clear(); > append(other.constData(), other.size()); > } > return *this; > } > > inline void removeLast() { > ((!(s > 0)) ? qt_assert("s > 0","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",93) : qt_noop()); > realloc(s - 1, a); > } > inline int size() const { return s; } > inline int count() const { return s; } > inline int length() const { return s; } > inline T& first() { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",99) : qt_noop()); return *begin(); } > inline const T& first() const { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",100) : qt_noop()); return *begin(); } > T& last() { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",101) : qt_noop()); return *(end() - 1); } > const T& last() const { ((!(!isEmpty())) ? qt_assert("!isEmpty()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",102) : qt_noop()); return *(end() - 1); } > inline bool isEmpty() const { return (s == 0); } > inline void resize(int size); > inline void clear() { resize(0); } > > inline int capacity() const { return a; } > inline void reserve(int size); > > inline T &operator[](int idx) { > ((!(idx >= 0 && idx < s)) ? qt_assert("idx >= 0 && idx < s","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",111) : qt_noop()); > return ptr[idx]; > } > inline const T &operator[](int idx) const { > ((!(idx >= 0 && idx < s)) ? qt_assert("idx >= 0 && idx < s","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",115) : qt_noop()); > return ptr[idx]; > } > inline const T &at(int idx) const { return operator[](idx); } > > T value(int i) const; > T value(int i, const T &defaultValue) const; > > inline void append(const T &t) { > if (s == a) > realloc(s, s<<1); > const int idx = s++; > if (QTypeInfo<T>::isComplex) { > new (ptr + idx) T(t); > } else { > ptr[idx] = t; > } > } > void append(const T *buf, int size); > inline QVarLengthArray<T, Prealloc> &operator<<(const T &t) > { append(t); return *this; } > inline QVarLengthArray<T, Prealloc> &operator+=(const T &t) > { append(t); return *this; } > > void prepend(const T &t); > void insert(int i, const T &t); > void insert(int i, int n, const T &t); > void replace(int i, const T &t); > void remove(int i); > void remove(int i, int n); > > > inline T *data() { return ptr; } > inline const T *data() const { return ptr; } > inline const T * constData() const { return ptr; } > typedef int size_type; > typedef T value_type; > typedef value_type *pointer; > typedef const value_type *const_pointer; > typedef value_type &reference; > typedef const value_type &const_reference; > typedef qptrdiff difference_type; > > > typedef T* iterator; > typedef const T* const_iterator; > > inline iterator begin() { return ptr; } > inline const_iterator begin() const { return ptr; } > inline const_iterator cbegin() const { return ptr; } > inline const_iterator constBegin() const { return ptr; } > inline iterator end() { return ptr + s; } > inline const_iterator end() const { return ptr + s; } > inline const_iterator cend() const { return ptr + s; } > inline const_iterator constEnd() const { return ptr + s; } > iterator insert(iterator before, int n, const T &x); > inline iterator insert(iterator before, const T &x) { return insert(before, 1, x); } > iterator erase(iterator begin, iterator end); > inline iterator erase(iterator pos) { return erase(pos, pos+1); } > >private: > friend class QPodList<T, Prealloc>; > void realloc(int size, int alloc); > > int a; > int s; > T *ptr; > union { > char array[Prealloc * sizeof(T)]; > qint64 q_for_alignment_1; > double q_for_alignment_2; > }; >}; > >template <class T, int Prealloc> >inline QVarLengthArray<T, Prealloc>::QVarLengthArray(int asize) > : s(asize) { > if (s > Prealloc) { > ptr = reinterpret_cast<T *>(malloc(s * sizeof(T))); > do { if (!(ptr)) qBadAlloc(); } while (0); > a = s; > } else { > ptr = reinterpret_cast<T *>(array); > a = Prealloc; > } > if (QTypeInfo<T>::isComplex) { > T *i = ptr + s; > while (i != ptr) > new (--i) T; > } >} > >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::resize(int asize) >{ realloc(asize, qMax(asize, a)); } > >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::reserve(int asize) >{ if (asize > a) realloc(s, asize); } > >template <class T, int Prealloc> > void QVarLengthArray<T, Prealloc>::append(const T *abuf, int increment) >{ > ((!(abuf)) ? qt_assert("abuf","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",218) : qt_noop()); > if (increment <= 0) > return; > > const int asize = s + increment; > > if (asize >= a) > realloc(s, qMax(s*2, asize)); > > if (QTypeInfo<T>::isComplex) { > > while (s < asize) > new (ptr+(s++)) T(*abuf++); > } else { > memcpy(&ptr[s], abuf, increment * sizeof(T)); > s = asize; > } >} > >template <class T, int Prealloc> > void QVarLengthArray<T, Prealloc>::realloc(int asize, int aalloc) >{ > ((!(aalloc >= asize)) ? qt_assert("aalloc >= asize","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",240) : qt_noop()); > T *oldPtr = ptr; > int osize = s; > > const int copySize = qMin(asize, osize); > if (aalloc != a) { > ptr = reinterpret_cast<T *>(malloc(aalloc * sizeof(T))); > do { if (!(ptr)) qBadAlloc(); } while (0); > if (ptr) { > s = 0; > a = aalloc; > > if (QTypeInfo<T>::isStatic) { > try { > > while (s < copySize) { > new (ptr+s) T(*(oldPtr+s)); > (oldPtr+s)->~T(); > s++; > } > } catch (...) { > > int sClean = s; > while (sClean < osize) > (oldPtr+(sClean++))->~T(); > if (oldPtr != reinterpret_cast<T *>(array) && oldPtr != ptr) > free(oldPtr); > throw; > } > } else { > memcpy(ptr, oldPtr, copySize * sizeof(T)); > } > } else { > ptr = oldPtr; > return; > } > } > s = copySize; > > if (QTypeInfo<T>::isComplex) { > > while (osize > asize) > (oldPtr+(--osize))->~T(); > } > > if (oldPtr != reinterpret_cast<T *>(array) && oldPtr != ptr) > free(oldPtr); > > if (QTypeInfo<T>::isComplex) { > > while (s < asize) > new (ptr+(s++)) T; > } else { > s = asize; > } >} > >template <class T, int Prealloc> > T QVarLengthArray<T, Prealloc>::value(int i) const >{ > if (i < 0 || i >= size()) { > return T(); > } > return at(i); >} >template <class T, int Prealloc> > T QVarLengthArray<T, Prealloc>::value(int i, const T &defaultValue) const >{ > return (i < 0 || i >= size()) ? defaultValue : at(i); >} > >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::insert(int i, const T &t) >{ ((!(i >= 0 && i <= s)) ? qt_assert_x("QVarLengthArray::insert", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",313) : qt_noop()); > insert(begin() + i, 1, t); } >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::insert(int i, int n, const T &t) >{ ((!(i >= 0 && i <= s)) ? qt_assert_x("QVarLengthArray::insert", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",317) : qt_noop()); > insert(begin() + i, n, t); } >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::remove(int i, int n) >{ ((!(i >= 0 && n >= 0 && i + n <= s)) ? qt_assert_x("QVarLengthArray::remove", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",321) : qt_noop()); > erase(begin() + i, begin() + i + n); } >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::remove(int i) >{ ((!(i >= 0 && i < s)) ? qt_assert_x("QVarLengthArray::remove", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",325) : qt_noop()); > erase(begin() + i, begin() + i + 1); } >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::prepend(const T &t) >{ insert(begin(), 1, t); } > >template <class T, int Prealloc> >inline void QVarLengthArray<T, Prealloc>::replace(int i, const T &t) >{ > ((!(i >= 0 && i < s)) ? qt_assert_x("QVarLengthArray::replace", "index out of range","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qvarlengtharray.h",334) : qt_noop()); > const T copy(t); > data()[i] = copy; >} > > >template <class T, int Prealloc> > typename QVarLengthArray<T, Prealloc>::iterator QVarLengthArray<T, Prealloc>::insert(iterator before, size_type n, const T &t) >{ > int offset = int(before - ptr); > if (n != 0) { > resize(s + n); > const T copy(t); > if (QTypeInfo<T>::isStatic) { > T *b = ptr + offset; > T *j = ptr + s; > T *i = j - n; > while (i != b) > *--j = *--i; > i = b + n; > while (i != b) > *--i = copy; > } else { > T *b = ptr + offset; > T *i = b + n; > memmove(i, b, (s - offset - n) * sizeof(T)); > while (i != b) > new (--i) T(copy); > } > } > return ptr + offset; >} > >template <class T, int Prealloc> > typename QVarLengthArray<T, Prealloc>::iterator QVarLengthArray<T, Prealloc>::erase(iterator abegin, iterator aend) >{ > int f = int(abegin - ptr); > int l = int(aend - ptr); > int n = l - f; > if (QTypeInfo<T>::isComplex) { > qCopy(ptr + l, ptr + s, ptr + f); > T *i = ptr + s; > T *b = ptr + s - n; > while (i != b) { > --i; > i->~T(); > } > } else { > memmove(ptr + f, ptr + l, (s - l) * sizeof(T)); > } > s -= n; > return ptr + f; >} > >template <typename T, int Prealloc1, int Prealloc2> >bool operator==(const QVarLengthArray<T, Prealloc1> &l, const QVarLengthArray<T, Prealloc2> &r) >{ > if (l.size() != r.size()) > return false; > for (int i = 0; i < l.size(); i++) { > if (l.at(i) != r.at(i)) > return false; > } > return true; >} > >template <typename T, int Prealloc1, int Prealloc2> >bool operator!=(const QVarLengthArray<T, Prealloc1> &l, const QVarLengthArray<T, Prealloc2> &r) >{ > return !(l == r); >} > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qvarlengtharray.h" 2 ># 49 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qisenum.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qisenum.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qisenum.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/global/qisenum.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qisenum.h" 2 ># 50 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 2 > ># 1 "../../../../qt5/qtbase/include/QtCore/qobjectdefs.h" 1 ># 52 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" 2 > > > > > > > > > > ># 189 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" >class QDataStream; >class QMetaTypeInterface; >struct QMetaObject; > >class __attribute__((visibility("default"))) QMetaType { > enum ExtensionFlag { NoExtensionFlags, > CreateEx = 0x1, DestroyEx = 0x2, > ConstructEx = 0x4, DestructEx = 0x8, > NameEx = 0x10, SizeEx = 0x20, > CtorEx = 0x40, DtorEx = 0x80, > FlagsEx = 0x100 > }; >public: > > > enum Type { > > Void = 43, Bool = 1, Int = 2, UInt = 3, LongLong = 4, ULongLong = 5, Double = 6, Long = 32, Short = 33, Char = 34, ULong = 35, UShort = 36, UChar = 37, Float = 38, SChar = 49, VoidStar = 31, QChar = 7, QString = 10, QStringList = 11, QByteArray = 12, QBitArray = 13, QDate = 14, QTime = 15, QDateTime = 16, QUrl = 17, QLocale = 18, QRect = 19, QRectF = 20, QSize = 21, QSizeF = 22, QLine = 23, QLineF = 24, QPoint = 25, QPointF = 26, QRegExp = 27, QEasingCurve = 29, QUuid = 30, QVariant = 41, QModelIndex = 42, QRegularExpression = 44, QJsonValue = 45, QJsonObject = 46, QJsonArray = 47, QJsonDocument = 48, QObjectStar = 39, QWidgetStar = 40, QVariantMap = 8, QVariantList = 9, QVariantHash = 28, QFont = 64, QPixmap = 65, QBrush = 66, QColor = 67, QPalette = 68, QIcon = 69, QImage = 70, QPolygon = 71, QRegion = 72, QBitmap = 73, QCursor = 74, QKeySequence = 75, QPen = 76, QTextLength = 77, QTextFormat = 78, QMatrix = 79, QTransform = 80, QMatrix4x4 = 81, QVector2D = 82, QVector3D = 83, QVector4D = 84, QQuaternion = 85, QPolygonF = 86, QSizePolicy = 121, > > FirstCoreType = Bool, > LastCoreType = SChar, > FirstGuiType = QFont, > LastGuiType = QPolygonF, > FirstWidgetsType = QSizePolicy, > LastWidgetsType = QSizePolicy, > HighestInternalId = LastWidgetsType, > > QReal = sizeof(qreal) == sizeof(double) ? Double : Float, > > UnknownType = 0, > User = 1024 > }; ># 245 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" > enum TypeFlag { > NeedsConstruction = 0x1, > NeedsDestruction = 0x2, > MovableType = 0x4, > PointerToQObject = 0x8, > IsEnumeration = 0x10 > }; > typedef QFlags<TypeFlag> TypeFlags; > > typedef void (*Deleter)(void *); > typedef void *(*Creator)(const void *); > > typedef void (*Destructor)(void *); > typedef void *(*Constructor)(void *, const void *); > > typedef void (*SaveOperator)(QDataStream &, const void *); > typedef void (*LoadOperator)(QDataStream &, void *); > > static void registerStreamOperators(const char *typeName, SaveOperator saveOp, > LoadOperator loadOp); > static void registerStreamOperators(int type, SaveOperator saveOp, > LoadOperator loadOp); > > static int registerType(const char *typeName, Deleter deleter, > Creator creator); > static int registerType(const char *typeName, Deleter deleter, > Creator creator, > Destructor destructor, > Constructor constructor, > int size, > QMetaType::TypeFlags flags, > const QMetaObject *metaObject); > static int registerNormalizedType(const ::QByteArray &normalizedTypeName, Deleter deleter, > Creator creator, > Destructor destructor, > Constructor constructor, > int size, > QMetaType::TypeFlags flags, > const QMetaObject *metaObject); > static int registerTypedef(const char *typeName, int aliasId); > static int registerNormalizedTypedef(const ::QByteArray &normalizedTypeName, int aliasId); > static int type(const char *typeName); > static const char *typeName(int type); > static int sizeOf(int type); > static TypeFlags typeFlags(int type); > static bool isRegistered(int type); > static void *create(int type, const void *copy = 0); > > static void *construct(int type, const void *copy = 0) > { return create(type, copy); } > > static void destroy(int type, void *data); > static void *construct(int type, void *where, const void *copy); > static void destruct(int type, void *where); > > > static bool save(QDataStream &stream, int type, const void *data); > static bool load(QDataStream &stream, int type, void *data); > > > explicit QMetaType(const int type); > inline ~QMetaType(); > > inline bool isValid() const; > inline bool isRegistered() const; > inline int sizeOf() const; > inline TypeFlags flags() const; > > inline void *create(const void *copy = 0) const; > inline void destroy(void *data) const; > inline void *construct(void *where, const void *copy = 0) const; > inline void destruct(void *data) const; >private: > static QMetaType typeInfo(const int type); > inline QMetaType(const ExtensionFlag extensionFlags, const QMetaTypeInterface *info, > Creator creator, > Deleter deleter, > SaveOperator saveOp, > LoadOperator loadOp, > Constructor constructor, > Destructor destructor, > uint sizeOf, > uint theTypeFlags, > int typeId, > const QMetaObject *metaObject); > QMetaType(const QMetaType &other); > QMetaType &operator =(const QMetaType &); > inline bool isExtended(const ExtensionFlag flag) const { return m_extensionFlags & flag; } > > > void ctor(const QMetaTypeInterface *info); > void dtor(); > uint sizeExtended() const; > QMetaType::TypeFlags flagsExtended() const; > void *createExtended(const void *copy = 0) const; > void destroyExtended(void *data) const; > void *constructExtended(void *where, const void *copy = 0) const; > void destructExtended(void *data) const; > > Creator m_creator; > Deleter m_deleter; > SaveOperator m_saveOp; > LoadOperator m_loadOp; > Constructor m_constructor; > Destructor m_destructor; > void *m_extension; > uint m_size; > uint m_typeFlags; > uint m_extensionFlags; > int m_typeId; > const QMetaObject *m_metaObject; >}; > > > > inline QFlags<QMetaType::TypeFlags::enum_type> operator|(QMetaType::TypeFlags::enum_type f1, QMetaType::TypeFlags::enum_type f2) { return QFlags<QMetaType::TypeFlags::enum_type>(f1) | f2; } inline QFlags<QMetaType::TypeFlags::enum_type> operator|(QMetaType::TypeFlags::enum_type f1, QFlags<QMetaType::TypeFlags::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(QMetaType::TypeFlags::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > >template <typename T> >void qMetaTypeDeleteHelper(void *t) >{ > delete static_cast<T*>(t); >} >template <> inline void qMetaTypeDeleteHelper<void>(void *) {} > >template <typename T> >void *qMetaTypeCreateHelper(const void *t) >{ > if (t) > return new T(*static_cast<const T*>(t)); > return new T(); >} > >template <> inline void *qMetaTypeCreateHelper<void>(const void *) { return 0; } > >template <typename T> >void qMetaTypeDestructHelper(void *t) >{ > (void)t; > static_cast<T*>(t)->~T(); >} > >template <> inline void qMetaTypeDestructHelper<void>(void *) {} > >template <typename T> >void *qMetaTypeConstructHelper(void *where, const void *t) >{ > if (t) > return new (where) T(*static_cast<const T*>(t)); > return new (where) T; >} > >template <> inline void *qMetaTypeConstructHelper<void>(void *, const void *) { return 0; } > > >template <typename T> >void qMetaTypeSaveHelper(QDataStream &stream, const void *t) >{ > stream << *static_cast<const T*>(t); >} > >template <> inline void qMetaTypeSaveHelper<void>(QDataStream &, const void *) {} > >template <typename T> >void qMetaTypeLoadHelper(QDataStream &stream, void *t) >{ > stream >> *static_cast<T*>(t); >} > >template <> inline void qMetaTypeLoadHelper<void>(QDataStream &, void *) {} > > >class QObject; >class QWidget; > >namespace QtPrivate >{ > template<typename T> > struct IsPointerToTypeDerivedFromQObject > { > enum { Value = false }; > }; > > > template<> > struct IsPointerToTypeDerivedFromQObject<void*> > { > enum { Value = false }; > }; > template<> > struct IsPointerToTypeDerivedFromQObject<QObject*> > { > enum { Value = true }; > }; > template<> > struct IsPointerToTypeDerivedFromQObject<QWidget*> > { > enum { Value = true }; > }; > > template<typename T> > struct IsPointerToTypeDerivedFromQObject<T*> > { > typedef qint8 yes_type; > typedef qint64 no_type; > > > static yes_type checkType(QObject* ); > > static no_type checkType(...); > enum {q_static_assert_result454 = sizeof(QStaticAssertFailure<!!(sizeof(T))>)}; > enum { Value = sizeof(checkType(static_cast<T*>(0))) == sizeof(yes_type) }; > }; > > template<typename T, bool = IsPointerToTypeDerivedFromQObject<T>::Value> > struct MetaObjectForType > { > static inline const QMetaObject *value() { return 0; } > }; > template<typename T> > struct MetaObjectForType<T*, true> > { > static inline const QMetaObject *value() { return &T::staticMetaObject; } > }; >} > >template <typename T, bool = QtPrivate::IsPointerToTypeDerivedFromQObject<T>::Value> >struct QMetaTypeIdQObject >{ > enum { > Defined = 0 > }; >}; > >template <typename T> >struct QMetaTypeId : public QMetaTypeIdQObject<T> >{ >}; > >template <typename T> >struct QMetaTypeId2 >{ > enum { Defined = QMetaTypeId<T>::Defined }; > static inline int qt_metatype_id() { return QMetaTypeId<T>::qt_metatype_id(); } >}; > >namespace QtPrivate { > template <typename T, bool Defined = QMetaTypeId2<T>::Defined> > struct QMetaTypeIdHelper { > static inline int qt_metatype_id() > { return QMetaTypeId2<T>::qt_metatype_id(); } > }; > template <typename T> struct QMetaTypeIdHelper<T, false> { > static inline int qt_metatype_id() > { return -1; } > }; > > > template <class Result> struct IsPointerToTypeDerivedFromQObject<Result(*)()> { enum { Value = false }; }; > template <class Result, class Arg0> struct IsPointerToTypeDerivedFromQObject<Result(*)(Arg0)> { enum { Value = false }; }; > template <class Result, class Arg0, class Arg1> struct IsPointerToTypeDerivedFromQObject<Result(*)(Arg0, Arg1)> { enum { Value = false }; }; > template <class Result, class Arg0, class Arg1, class Arg2> struct IsPointerToTypeDerivedFromQObject<Result(*)(Arg0, Arg1, Arg2)> { enum { Value = false }; }; > > template<typename T> > struct QMetaTypeTypeFlags > { > enum { Flags = (!QTypeInfo<T>::isStatic ? QMetaType::MovableType : 0) > | (QTypeInfo<T>::isComplex ? QMetaType::NeedsConstruction : 0) > | (QTypeInfo<T>::isComplex ? QMetaType::NeedsDestruction : 0) > | (IsPointerToTypeDerivedFromQObject<T>::Value ? QMetaType::PointerToQObject : 0) > | (__is_enum(T) ? QMetaType::IsEnumeration : 0) > }; > }; >} > >template <typename T> >int qRegisterNormalizedMetaType(const ::QByteArray &normalizedTypeName > > , T * dummy = 0 > >) >{ > const int typedefOf = dummy ? -1 : QtPrivate::QMetaTypeIdHelper<T>::qt_metatype_id(); > if (typedefOf != -1) > return QMetaType::registerNormalizedTypedef(normalizedTypeName, typedefOf); > > QMetaType::TypeFlags flags(QtPrivate::QMetaTypeTypeFlags<T>::Flags); > return QMetaType::registerNormalizedType(normalizedTypeName, qMetaTypeDeleteHelper<T>, > qMetaTypeCreateHelper<T>, > qMetaTypeDestructHelper<T>, > qMetaTypeConstructHelper<T>, > sizeof(T), > flags, > QtPrivate::MetaObjectForType<T>::value()); >} > >template <typename T> >int qRegisterMetaType(const char *typeName > > , T * dummy = 0 > >) >{ > > > > ::QByteArray normalizedTypeName = QMetaObject::normalizedType(typeName); > > return qRegisterNormalizedMetaType<T>(normalizedTypeName, dummy); >} > > >template <typename T> >void qRegisterMetaTypeStreamOperators(const char *typeName > > , T * = 0 > >) >{ > qRegisterMetaType<T>(typeName); > QMetaType::registerStreamOperators(typeName, qMetaTypeSaveHelper<T>, qMetaTypeLoadHelper<T>); >} > > >template <typename T> >inline int qMetaTypeId( > > T * = 0 > >) >{ > enum {q_static_assert_result575 = sizeof(QStaticAssertFailure<!!(QMetaTypeId2<T>::Defined)>)}; > return QMetaTypeId2<T>::qt_metatype_id(); >} > >template <typename T> >inline int qRegisterMetaType( > > T * dummy = 0 > >) >{ > > > > return qMetaTypeId(dummy); > >} > >template <typename T> >struct QMetaTypeIdQObject<T*, true> >{ > enum { > Defined = 1 > }; > > static int qt_metatype_id() > { > static QBasicAtomicInt metatype_id = { (0) }; > if (!metatype_id.load()) { > const int len = int(strlen(T::staticMetaObject.className())); > QVarLengthArray<char, 16> classNameStar; > classNameStar.append(T::staticMetaObject.className(), len); > classNameStar.append("*\0", 2); > metatype_id.storeRelease(qRegisterMetaType<T*>(classNameStar.constData(), > reinterpret_cast<T**>(quintptr(-1)))); > } > return metatype_id.loadAcquire(); > } >}; > > >template <typename T> >inline int qRegisterMetaTypeStreamOperators() >{ > register int id = qMetaTypeId<T>(); > QMetaType::registerStreamOperators(id, qMetaTypeSaveHelper<T>, qMetaTypeLoadHelper<T>); > return id; >} ># 664 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" >class QChar; class QString; class QStringList; class QByteArray; class QBitArray; class QDate; class QTime; class QDateTime; class QUrl; class QLocale; class QRect; class QRectF; class QSize; class QSizeF; class QLine; class QLineF; class QPoint; class QPointF; class QRegExp; class QEasingCurve; class QUuid; class QVariant; class QModelIndex; class QRegularExpression; class QJsonValue; class QJsonObject; class QJsonArray; class QJsonDocument; >class QFont; class QPixmap; class QBrush; class QColor; class QPalette; class QIcon; class QImage; class QPolygon; class QRegion; class QBitmap; class QCursor; class QKeySequence; class QPen; class QTextLength; class QTextFormat; class QMatrix; class QTransform; class QMatrix4x4; class QVector2D; class QVector3D; class QVector4D; class QQuaternion; class QPolygonF; >class QSizePolicy; > > > >template <class T> class QList; >template <class T> class QLinkedList; >template <class T> class QVector; >template <class T> class QQueue; >template <class T> class QStack; >template <class T> class QSet; >template <class T> class QSharedPointer; >template <class T1, class T2> class QMap; >template <class T1, class T2> class QHash; >template <class T1, class T2> struct QPair; >typedef QList<QVariant> QVariantList; >typedef QMap<QString, QVariant> QVariantMap; >typedef QHash<QString, QVariant> QVariantHash; ># 718 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qmetatype.h" >template <typename T> struct QMetaTypeId< QList<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QList<T> >( QByteArray(QByteArray("QList" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QList<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template <typename T> struct QMetaTypeId< QVector<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QVector<T> >( QByteArray(QByteArray("QVector" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QVector<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template <typename T> struct QMetaTypeId< QQueue<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QQueue<T> >( QByteArray(QByteArray("QQueue" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QQueue<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template <typename T> struct QMetaTypeId< QStack<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QStack<T> >( QByteArray(QByteArray("QStack" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QStack<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template <typename T> struct QMetaTypeId< QSet<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QSet<T> >( QByteArray(QByteArray("QSet" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QSet<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template <typename T> struct QMetaTypeId< QSharedPointer<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QSharedPointer<T> >( QByteArray(QByteArray("QSharedPointer" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QSharedPointer<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template <typename T> struct QMetaTypeId< QLinkedList<T> > { enum { Defined = QMetaTypeId2<T>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QLinkedList<T> >( QByteArray(QByteArray("QLinkedList" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ">").constData(), reinterpret_cast< QLinkedList<T> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; > >template<typename T, typename U> struct QMetaTypeId< QHash<T, U> > { enum { Defined = QMetaTypeId2<T>::Defined && QMetaTypeId2<U>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QHash<T, U> >( QByteArray(QByteArray("QHash" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ", " + QMetaType::typeName(qMetaTypeId<U>()) + ">").constData(), reinterpret_cast< QHash<T, U> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template<typename T, typename U> struct QMetaTypeId< QMap<T, U> > { enum { Defined = QMetaTypeId2<T>::Defined && QMetaTypeId2<U>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QMap<T, U> >( QByteArray(QByteArray("QMap" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ", " + QMetaType::typeName(qMetaTypeId<U>()) + ">").constData(), reinterpret_cast< QMap<T, U> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; >template<typename T, typename U> struct QMetaTypeId< QPair<T, U> > { enum { Defined = QMetaTypeId2<T>::Defined && QMetaTypeId2<U>::Defined }; static int qt_metatype_id() { static QBasicAtomicInt metatype_id = { (0) }; if (!metatype_id.load()) metatype_id.storeRelease(qRegisterMetaType< QPair<T, U> >( QByteArray(QByteArray("QPair" "<") + QMetaType::typeName(qMetaTypeId<T>()) + ", " + QMetaType::typeName(qMetaTypeId<U>()) + ">").constData(), reinterpret_cast< QPair<T, U> *>(quintptr(-1)))); return metatype_id.loadAcquire(); } }; > >inline QMetaType::QMetaType(const ExtensionFlag extensionFlags, const QMetaTypeInterface *info, > Creator creator, > Deleter deleter, > SaveOperator saveOp, > LoadOperator loadOp, > Constructor constructor, > Destructor destructor, > uint size, > uint theTypeFlags, > int typeId, > const QMetaObject *metaObject) > : m_creator(creator) > , m_deleter(deleter) > , m_saveOp(saveOp) > , m_loadOp(loadOp) > , m_constructor(constructor) > , m_destructor(destructor) > , m_extension(0) > , m_size(size) > , m_typeFlags(theTypeFlags) > , m_extensionFlags(extensionFlags) > , m_typeId(typeId) > , m_metaObject(metaObject) >{ > if (__builtin_expect(!!(isExtended(CtorEx) || typeId == QMetaType::Void), false)) > ctor(info); >} > >inline QMetaType::~QMetaType() >{ > if (__builtin_expect(!!(isExtended(DtorEx)), false)) > dtor(); >} > >inline bool QMetaType::isValid() const >{ > return m_typeId != UnknownType; >} > >inline bool QMetaType::isRegistered() const >{ > return isValid(); >} > >inline void *QMetaType::create(const void *copy) const >{ > if (__builtin_expect(!!(isExtended(CreateEx)), false)) > return createExtended(copy); > return m_creator(copy); >} > >inline void QMetaType::destroy(void *data) const >{ > if (__builtin_expect(!!(isExtended(DestroyEx)), false)) > return destroyExtended(data); > m_deleter(data); >} > >inline void *QMetaType::construct(void *where, const void *copy) const >{ > if (__builtin_expect(!!(isExtended(ConstructEx)), false)) > return constructExtended(where, copy); > return m_constructor(where, copy); >} > >inline void QMetaType::destruct(void *data) const >{ > if (__builtin_expect(!!(isExtended(DestructEx)), false)) > return destructExtended(data); > if (__builtin_expect(!!(!data), false)) > return; > m_destructor(data); >} > >inline int QMetaType::sizeOf() const >{ > if (__builtin_expect(!!(isExtended(SizeEx)), false)) > return sizeExtended(); > return m_size; >} > >inline QMetaType::TypeFlags QMetaType::flags() const >{ > if (__builtin_expect(!!(isExtended(FlagsEx)), false)) > return flagsExtended(); > return QMetaType::TypeFlags(m_typeFlags); >} > > > > > > > > template<> struct QMetaTypeId2<void> { enum { Defined = 1, MetaType = QMetaType::Void }; static inline int qt_metatype_id() { return QMetaType::Void; } }; template<> struct QMetaTypeId2<bool> { enum { Defined = 1, MetaType = QMetaType::Bool }; static inline int qt_metatype_id() { return QMetaType::Bool; } }; template<> struct QMetaTypeId2<int> { enum { Defined = 1, MetaType = QMetaType::Int }; static inline int qt_metatype_id() { return QMetaType::Int; } }; template<> struct QMetaTypeId2<uint> { enum { Defined = 1, MetaType = QMetaType::UInt }; static inline int qt_metatype_id() { return QMetaType::UInt; } }; template<> struct QMetaTypeId2<qlonglong> { enum { Defined = 1, MetaType = QMetaType::LongLong }; static inline int qt_metatype_id() { return QMetaType::LongLong; } }; template<> struct QMetaTypeId2<qulonglong> { enum { Defined = 1, MetaType = QMetaType::ULongLong }; static inline int qt_metatype_id() { return QMetaType::ULongLong; } }; template<> struct QMetaTypeId2<double> { enum { Defined = 1, MetaType = QMetaType::Double }; static inline int qt_metatype_id() { return QMetaType::Double; } }; template<> struct QMetaTypeId2<long> { enum { Defined = 1, MetaType = QMetaType::Long }; static inline int qt_metatype_id() { return QMetaType::Long; } }; template<> struct QMetaTypeId2<short> { enum { Defined = 1, MetaType = QMetaType::Short }; static inline int qt_metatype_id() { return QMetaType::Short; } }; template<> struct QMetaTypeId2<char> { enum { Defined = 1, MetaType = QMetaType::Char }; static inline int qt_metatype_id() { return QMetaType::Char; } }; template<> struct QMetaTypeId2<ulong> { enum { Defined = 1, MetaType = QMetaType::ULong }; static inline int qt_metatype_id() { return QMetaType::ULong; } }; template<> struct QMetaTypeId2<ushort> { enum { Defined = 1, MetaType = QMetaType::UShort }; static inline int qt_metatype_id() { return QMetaType::UShort; } }; template<> struct QMetaTypeId2<uchar> { enum { Defined = 1, MetaType = QMetaType::UChar }; static inline int qt_metatype_id() { return QMetaType::UChar; } }; template<> struct QMetaTypeId2<float> { enum { Defined = 1, MetaType = QMetaType::Float }; static inline int qt_metatype_id() { return QMetaType::Float; } }; template<> struct QMetaTypeId2<signed char> { enum { Defined = 1, MetaType = QMetaType::SChar }; static inline int qt_metatype_id() { return QMetaType::SChar; } }; template<> struct QMetaTypeId2<void*> { enum { Defined = 1, MetaType = QMetaType::VoidStar }; static inline int qt_metatype_id() { return QMetaType::VoidStar; } }; template<> struct QMetaTypeId2<QChar> { enum { Defined = 1, MetaType = QMetaType::QChar }; static inline int qt_metatype_id() { return QMetaType::QChar; } }; template<> struct QMetaTypeId2<QString> { enum { Defined = 1, MetaType = QMetaType::QString }; static inline int qt_metatype_id() { return QMetaType::QString; } }; template<> struct QMetaTypeId2<QStringList> { enum { Defined = 1, MetaType = QMetaType::QStringList }; static inline int qt_metatype_id() { return QMetaType::QStringList; } }; template<> struct QMetaTypeId2<QByteArray> { enum { Defined = 1, MetaType = QMetaType::QByteArray }; static inline int qt_metatype_id() { return QMetaType::QByteArray; } }; template<> struct QMetaTypeId2<QBitArray> { enum { Defined = 1, MetaType = QMetaType::QBitArray }; static inline int qt_metatype_id() { return QMetaType::QBitArray; } }; template<> struct QMetaTypeId2<QDate> { enum { Defined = 1, MetaType = QMetaType::QDate }; static inline int qt_metatype_id() { return QMetaType::QDate; } }; template<> struct QMetaTypeId2<QTime> { enum { Defined = 1, MetaType = QMetaType::QTime }; static inline int qt_metatype_id() { return QMetaType::QTime; } }; template<> struct QMetaTypeId2<QDateTime> { enum { Defined = 1, MetaType = QMetaType::QDateTime }; static inline int qt_metatype_id() { return QMetaType::QDateTime; } }; template<> struct QMetaTypeId2<QUrl> { enum { Defined = 1, MetaType = QMetaType::QUrl }; static inline int qt_metatype_id() { return QMetaType::QUrl; } }; template<> struct QMetaTypeId2<QLocale> { enum { Defined = 1, MetaType = QMetaType::QLocale }; static inline int qt_metatype_id() { return QMetaType::QLocale; } }; template<> struct QMetaTypeId2<QRect> { enum { Defined = 1, MetaType = QMetaType::QRect }; static inline int qt_metatype_id() { return QMetaType::QRect; } }; template<> struct QMetaTypeId2<QRectF> { enum { Defined = 1, MetaType = QMetaType::QRectF }; static inline int qt_metatype_id() { return QMetaType::QRectF; } }; template<> struct QMetaTypeId2<QSize> { enum { Defined = 1, MetaType = QMetaType::QSize }; static inline int qt_metatype_id() { return QMetaType::QSize; } }; template<> struct QMetaTypeId2<QSizeF> { enum { Defined = 1, MetaType = QMetaType::QSizeF }; static inline int qt_metatype_id() { return QMetaType::QSizeF; } }; template<> struct QMetaTypeId2<QLine> { enum { Defined = 1, MetaType = QMetaType::QLine }; static inline int qt_metatype_id() { return QMetaType::QLine; } }; template<> struct QMetaTypeId2<QLineF> { enum { Defined = 1, MetaType = QMetaType::QLineF }; static inline int qt_metatype_id() { return QMetaType::QLineF; } }; template<> struct QMetaTypeId2<QPoint> { enum { Defined = 1, MetaType = QMetaType::QPoint }; static inline int qt_metatype_id() { return QMetaType::QPoint; } }; template<> struct QMetaTypeId2<QPointF> { enum { Defined = 1, MetaType = QMetaType::QPointF }; static inline int qt_metatype_id() { return QMetaType::QPointF; } }; template<> struct QMetaTypeId2<QRegExp> { enum { Defined = 1, MetaType = QMetaType::QRegExp }; static inline int qt_metatype_id() { return QMetaType::QRegExp; } }; template<> struct QMetaTypeId2<QEasingCurve> { enum { Defined = 1, MetaType = QMetaType::QEasingCurve }; static inline int qt_metatype_id() { return QMetaType::QEasingCurve; } }; template<> struct QMetaTypeId2<QUuid> { enum { Defined = 1, MetaType = QMetaType::QUuid }; static inline int qt_metatype_id() { return QMetaType::QUuid; } }; template<> struct QMetaTypeId2<QVariant> { enum { Defined = 1, MetaType = QMetaType::QVariant }; static inline int qt_metatype_id() { return QMetaType::QVariant; } }; template<> struct QMetaTypeId2<QModelIndex> { enum { Defined = 1, MetaType = QMetaType::QModelIndex }; static inline int qt_metatype_id() { return QMetaType::QModelIndex; } }; template<> struct QMetaTypeId2<QRegularExpression> { enum { Defined = 1, MetaType = QMetaType::QRegularExpression }; static inline int qt_metatype_id() { return QMetaType::QRegularExpression; } }; template<> struct QMetaTypeId2<QJsonValue> { enum { Defined = 1, MetaType = QMetaType::QJsonValue }; static inline int qt_metatype_id() { return QMetaType::QJsonValue; } }; template<> struct QMetaTypeId2<QJsonObject> { enum { Defined = 1, MetaType = QMetaType::QJsonObject }; static inline int qt_metatype_id() { return QMetaType::QJsonObject; } }; template<> struct QMetaTypeId2<QJsonArray> { enum { Defined = 1, MetaType = QMetaType::QJsonArray }; static inline int qt_metatype_id() { return QMetaType::QJsonArray; } }; template<> struct QMetaTypeId2<QJsonDocument> { enum { Defined = 1, MetaType = QMetaType::QJsonDocument }; static inline int qt_metatype_id() { return QMetaType::QJsonDocument; } }; template<> struct QMetaTypeId2<QObject*> { enum { Defined = 1, MetaType = QMetaType::QObjectStar }; static inline int qt_metatype_id() { return QMetaType::QObjectStar; } }; template<> struct QMetaTypeId2<QWidget*> { enum { Defined = 1, MetaType = QMetaType::QWidgetStar }; static inline int qt_metatype_id() { return QMetaType::QWidgetStar; } }; template<> struct QMetaTypeId2<QVariantMap> { enum { Defined = 1, MetaType = QMetaType::QVariantMap }; static inline int qt_metatype_id() { return QMetaType::QVariantMap; } }; template<> struct QMetaTypeId2<QVariantList> { enum { Defined = 1, MetaType = QMetaType::QVariantList }; static inline int qt_metatype_id() { return QMetaType::QVariantList; } }; template<> struct QMetaTypeId2<QVariantHash> { enum { Defined = 1, MetaType = QMetaType::QVariantHash }; static inline int qt_metatype_id() { return QMetaType::QVariantHash; } }; template<> struct QMetaTypeId2<QFont> { enum { Defined = 1, MetaType = QMetaType::QFont }; static inline int qt_metatype_id() { return QMetaType::QFont; } }; template<> struct QMetaTypeId2<QPixmap> { enum { Defined = 1, MetaType = QMetaType::QPixmap }; static inline int qt_metatype_id() { return QMetaType::QPixmap; } }; template<> struct QMetaTypeId2<QBrush> { enum { Defined = 1, MetaType = QMetaType::QBrush }; static inline int qt_metatype_id() { return QMetaType::QBrush; } }; template<> struct QMetaTypeId2<QColor> { enum { Defined = 1, MetaType = QMetaType::QColor }; static inline int qt_metatype_id() { return QMetaType::QColor; } }; template<> struct QMetaTypeId2<QPalette> { enum { Defined = 1, MetaType = QMetaType::QPalette }; static inline int qt_metatype_id() { return QMetaType::QPalette; } }; template<> struct QMetaTypeId2<QIcon> { enum { Defined = 1, MetaType = QMetaType::QIcon }; static inline int qt_metatype_id() { return QMetaType::QIcon; } }; template<> struct QMetaTypeId2<QImage> { enum { Defined = 1, MetaType = QMetaType::QImage }; static inline int qt_metatype_id() { return QMetaType::QImage; } }; template<> struct QMetaTypeId2<QPolygon> { enum { Defined = 1, MetaType = QMetaType::QPolygon }; static inline int qt_metatype_id() { return QMetaType::QPolygon; } }; template<> struct QMetaTypeId2<QRegion> { enum { Defined = 1, MetaType = QMetaType::QRegion }; static inline int qt_metatype_id() { return QMetaType::QRegion; } }; template<> struct QMetaTypeId2<QBitmap> { enum { Defined = 1, MetaType = QMetaType::QBitmap }; static inline int qt_metatype_id() { return QMetaType::QBitmap; } }; template<> struct QMetaTypeId2<QCursor> { enum { Defined = 1, MetaType = QMetaType::QCursor }; static inline int qt_metatype_id() { return QMetaType::QCursor; } }; template<> struct QMetaTypeId2<QKeySequence> { enum { Defined = 1, MetaType = QMetaType::QKeySequence }; static inline int qt_metatype_id() { return QMetaType::QKeySequence; } }; template<> struct QMetaTypeId2<QPen> { enum { Defined = 1, MetaType = QMetaType::QPen }; static inline int qt_metatype_id() { return QMetaType::QPen; } }; template<> struct QMetaTypeId2<QTextLength> { enum { Defined = 1, MetaType = QMetaType::QTextLength }; static inline int qt_metatype_id() { return QMetaType::QTextLength; } }; template<> struct QMetaTypeId2<QTextFormat> { enum { Defined = 1, MetaType = QMetaType::QTextFormat }; static inline int qt_metatype_id() { return QMetaType::QTextFormat; } }; template<> struct QMetaTypeId2<QMatrix> { enum { Defined = 1, MetaType = QMetaType::QMatrix }; static inline int qt_metatype_id() { return QMetaType::QMatrix; } }; template<> struct QMetaTypeId2<QTransform> { enum { Defined = 1, MetaType = QMetaType::QTransform }; static inline int qt_metatype_id() { return QMetaType::QTransform; } }; template<> struct QMetaTypeId2<QMatrix4x4> { enum { Defined = 1, MetaType = QMetaType::QMatrix4x4 }; static inline int qt_metatype_id() { return QMetaType::QMatrix4x4; } }; template<> struct QMetaTypeId2<QVector2D> { enum { Defined = 1, MetaType = QMetaType::QVector2D }; static inline int qt_metatype_id() { return QMetaType::QVector2D; } }; template<> struct QMetaTypeId2<QVector3D> { enum { Defined = 1, MetaType = QMetaType::QVector3D }; static inline int qt_metatype_id() { return QMetaType::QVector3D; } }; template<> struct QMetaTypeId2<QVector4D> { enum { Defined = 1, MetaType = QMetaType::QVector4D }; static inline int qt_metatype_id() { return QMetaType::QVector4D; } }; template<> struct QMetaTypeId2<QQuaternion> { enum { Defined = 1, MetaType = QMetaType::QQuaternion }; static inline int qt_metatype_id() { return QMetaType::QQuaternion; } }; template<> struct QMetaTypeId2<QPolygonF> { enum { Defined = 1, MetaType = QMetaType::QPolygonF }; static inline int qt_metatype_id() { return QMetaType::QPolygonF; } }; template<> struct QMetaTypeId2<QSizePolicy> { enum { Defined = 1, MetaType = QMetaType::QSizePolicy }; static inline int qt_metatype_id() { return QMetaType::QSizePolicy; } }; > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qmetatype.h" 2 ># 56 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 > ># 1 "../../../../qt5/qtbase/include/QtCore/qobject_impl.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject_impl.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject_impl.h" > > > > > >namespace QtPrivate { ># 65 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject_impl.h" > template <typename ArgList> struct TypesAreDeclaredMetaType { enum { Value = false }; }; > template <> struct TypesAreDeclaredMetaType<void> { enum { Value = true }; }; > template <typename Arg, typename Tail> struct TypesAreDeclaredMetaType<List<Arg, Tail> > { enum { Value = QMetaTypeId2<Arg>::Defined && TypesAreDeclaredMetaType<Tail>::Value }; }; > > template <typename ArgList, bool Declared = TypesAreDeclaredMetaType<ArgList>::Value > struct ConnectionTypes > { static const int *types() { return 0; } }; > template <> struct ConnectionTypes<void, true> > { static const int *types() { static const int t[1] = { 0 }; return t; } }; > template <typename Arg1> struct ConnectionTypes<List<Arg1, void>, true> > { static const int *types() { static const int t[2] = { QtPrivate::QMetaTypeIdHelper<Arg1>::qt_metatype_id(), 0 }; return t; } }; > template <typename Arg1, typename Arg2> struct ConnectionTypes<List<Arg1, List<Arg2, void> >, true> > { static const int *types() { static const int t[3] = { QtPrivate::QMetaTypeIdHelper<Arg1>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg2>::qt_metatype_id(), 0 }; return t; } }; > template <typename Arg1, typename Arg2, typename Arg3> struct ConnectionTypes<List<Arg1, List<Arg2, List<Arg3, void> > >, true> > { static const int *types() { static const int t[4] = { QtPrivate::QMetaTypeIdHelper<Arg1>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg2>::qt_metatype_id(), > QtPrivate::QMetaTypeIdHelper<Arg3>::qt_metatype_id(), 0 }; return t; } }; > template <typename Arg1, typename Arg2, typename Arg3, typename Arg4> struct ConnectionTypes<List<Arg1, List<Arg2, List<Arg3, List<Arg4, void> > > >, true> > { static const int *types() { static const int t[4] = { QtPrivate::QMetaTypeIdHelper<Arg1>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg2>::qt_metatype_id(), > QtPrivate::QMetaTypeIdHelper<Arg3>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg4>::qt_metatype_id(), 0 }; return t; } }; > template <typename Arg1, typename Arg2, typename Arg3, typename Arg4, typename Arg5> struct ConnectionTypes<List<Arg1, List<Arg2, List<Arg3, List<Arg4, List<Arg5, void> > > > >, true> > { static const int *types() { static const int t[4] = { QtPrivate::QMetaTypeIdHelper<Arg1>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg2>::qt_metatype_id(), > QtPrivate::QMetaTypeIdHelper<Arg3>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg4>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg5>::qt_metatype_id(), 0 }; return t; } }; > template <typename Arg1, typename Arg2, typename Arg3, typename Arg4, typename Arg5, typename Arg6> > struct ConnectionTypes<List<Arg1, List<Arg2, List<Arg3, List<Arg4, List<Arg5, List<Arg6, void> > > > > >, true> > { static const int *types() { static const int t[4] = { QtPrivate::QMetaTypeIdHelper<Arg1>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg2>::qt_metatype_id(), > QtPrivate::QMetaTypeIdHelper<Arg3>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg4>::qt_metatype_id(), QtPrivate::QMetaTypeIdHelper<Arg5>::qt_metatype_id(), > QtPrivate::QMetaTypeIdHelper<Arg6>::qt_metatype_id(), 0 }; return t; } }; ># 102 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject_impl.h" >} > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qobject_impl.h" 2 ># 58 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" 2 > > > > > > >class QEvent; >class QTimerEvent; >class QChildEvent; >struct QMetaObject; >class QVariant; >class QObjectPrivate; >class QObject; >class QThread; >class QWidget; > >class QRegExp; > > >class QRegularExpression; > > >class QObjectUserData; > >struct QDynamicMetaObjectData; > >typedef QList<QObject*> QObjectList; > >__attribute__((visibility("default"))) void qt_qFindChildren_helper(const QObject *parent, const QString &name, > const QMetaObject &mo, QList<void *> *list, Qt::FindChildOptions options); >__attribute__((visibility("default"))) void qt_qFindChildren_helper(const QObject *parent, const QRegExp &re, > const QMetaObject &mo, QList<void *> *list, Qt::FindChildOptions options); >__attribute__((visibility("default"))) void qt_qFindChildren_helper(const QObject *parent, const QRegularExpression &re, > const QMetaObject &mo, QList<void *> *list, Qt::FindChildOptions options); >__attribute__((visibility("default"))) QObject *qt_qFindChild_helper(const QObject *parent, const QString &name, const QMetaObject &mo, Qt::FindChildOptions options); > >class __attribute__((visibility("default"))) QObjectData { >public: > virtual ~QObjectData() = 0; > QObject *q_ptr; > QObject *parent; > QObjectList children; > > uint isWidget : 1; > uint blockSig : 1; > uint wasDeleted : 1; > uint isDeletingChildren : 1; > uint sendChildEvents : 1; > uint receiveChildEvents : 1; > uint isWindow : 1; > uint unused : 25; > int postedEvents; > QDynamicMetaObjectData *metaObject; > QMetaObject *dynamicMetaObject() const; >}; > > >class __attribute__((visibility("default"))) QObject >{ > public: template <typename T> inline void qt_check_for_QOBJECT_macro(const T &_q_argument) const { int i = qYouForgotTheQ_OBJECT_Macro(this, &_q_argument); i = i + 1; } static const QMetaObject staticMetaObject; virtual const QMetaObject *metaObject() const; virtual void *qt_metacast(const char *); static inline QString tr(const char *s, const char *c = 0, int n = -1) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c = 0, int n = -1) { return staticMetaObject.tr(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **); > > inline QObjectPrivate* d_func() { return reinterpret_cast<QObjectPrivate *>(qGetPtrHelper(d_ptr)); } inline const QObjectPrivate* d_func() const { return reinterpret_cast<const QObjectPrivate *>(qGetPtrHelper(d_ptr)); } friend class QObjectPrivate; > >public: > explicit QObject(QObject *parent=0); > virtual ~QObject(); > > virtual bool event(QEvent *); > virtual bool eventFilter(QObject *, QEvent *); ># 143 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > QString objectName() const; > void setObjectName(const QString &name); > > inline bool isWidgetType() const { return d_ptr->isWidget; } > inline bool isWindowType() const { return d_ptr->isWindow; } > > inline bool signalsBlocked() const { return d_ptr->blockSig; } > bool blockSignals(bool b); > > QThread *thread() const; > void moveToThread(QThread *thread); > > int startTimer(int interval, Qt::TimerType timerType = Qt::CoarseTimer); > void killTimer(int id); > > template<typename T> > inline T findChild(const QString &aName = QString(), Qt::FindChildOptions options = Qt::FindChildrenRecursively) const > { return static_cast<T>(qt_qFindChild_helper(this, aName, reinterpret_cast<T>(0)->staticMetaObject, options)); } > > template<typename T> > inline QList<T> findChildren(const QString &aName = QString(), Qt::FindChildOptions options = Qt::FindChildrenRecursively) const > { > QList<T> list; > union { > QList<T> *typedList; > QList<void *> *voidList; > } u; > u.typedList = &list; > qt_qFindChildren_helper(this, aName, reinterpret_cast<T>(0)->staticMetaObject, u.voidList, options); > return list; > } > > > template<typename T> > inline QList<T> findChildren(const QRegExp &re, Qt::FindChildOptions options = Qt::FindChildrenRecursively) const > { > QList<T> list; > union { > QList<T> *typedList; > QList<void *> *voidList; > } u; > u.typedList = &list; > qt_qFindChildren_helper(this, re, reinterpret_cast<T>(0)->staticMetaObject, u.voidList, options); > return list; > } > > > > template<typename T> > inline QList<T> findChildren(const QRegularExpression &re, Qt::FindChildOptions options = Qt::FindChildrenRecursively) const > { > QList<T> list; > union { > QList<T> *typedList; > QList<void *> *voidList; > } u; > u.typedList = &list; > qt_qFindChildren_helper(this, re, reinterpret_cast<T>(0)->staticMetaObject, u.voidList, options); > return list; > } > > > inline const QObjectList &children() const { return d_ptr->children; } > > void setParent(QObject *); > void installEventFilter(QObject *); > void removeEventFilter(QObject *); > > static QMetaObject::Connection connect(const QObject *sender, const char *signal, > const QObject *receiver, const char *member, Qt::ConnectionType = Qt::AutoConnection); > > static QMetaObject::Connection connect(const QObject *sender, const QMetaMethod &signal, > const QObject *receiver, const QMetaMethod &method, > Qt::ConnectionType type = Qt::AutoConnection); > > inline QMetaObject::Connection connect(const QObject *sender, const char *signal, > const char *member, Qt::ConnectionType type = Qt::AutoConnection) const; > > > > > > > template <typename Func1, typename Func2> > static inline QMetaObject::Connection connect(const typename QtPrivate::FunctionPointer<Func1>::Object *sender, Func1 signal, > const typename QtPrivate::FunctionPointer<Func2>::Object *receiver, Func2 slot, > Qt::ConnectionType type = Qt::AutoConnection) > { > typedef QtPrivate::FunctionPointer<Func1> SignalType; > typedef QtPrivate::FunctionPointer<Func2> SlotType; > reinterpret_cast<typename SignalType::Object *>(0)->qt_check_for_QOBJECT_macro(*reinterpret_cast<typename SignalType::Object *>(0)); > > > enum { > q_static_assert_result237 ># 236 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!(int(SignalType::ArgumentCount) >= int(SlotType::ArgumentCount))>)} > ; > enum { > q_static_assert_result239 ># 238 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!((QtPrivate::CheckCompatibleArguments<typename SignalType::Arguments, typename SlotType::Arguments>::value))>)} > ; > enum { > q_static_assert_result241 ># 240 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!((QtPrivate::AreArgumentsCompatible<typename SlotType::ReturnType, typename SignalType::ReturnType>::value))>)} > ; > > const int *types = 0; > if (type == Qt::QueuedConnection || type == Qt::BlockingQueuedConnection) > types = QtPrivate::ConnectionTypes<typename SignalType::Arguments>::types(); > > return connectImpl(sender, reinterpret_cast<void **>(&signal), > receiver, reinterpret_cast<void **>(&slot), > new QSlotObject<Func2, typename QtPrivate::List_Left<typename SignalType::Arguments, SlotType::ArgumentCount>::Value, > typename SignalType::ReturnType>(slot), > type, types, &SignalType::Object::staticMetaObject); > } > > > template <typename Func1, typename Func2> > static inline typename QtPrivate::QEnableIf<int(QtPrivate::FunctionPointer<Func2>::ArgumentCount) >= 0, QMetaObject::Connection>::Type > connect(const typename QtPrivate::FunctionPointer<Func1>::Object *sender, Func1 signal, Func2 slot) > { > typedef QtPrivate::FunctionPointer<Func1> SignalType; > typedef QtPrivate::FunctionPointer<Func2> SlotType; > > > enum { > q_static_assert_result264 ># 263 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!(int(SignalType::ArgumentCount) >= int(SlotType::ArgumentCount))>)} > ; > enum { > q_static_assert_result266 ># 265 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!((QtPrivate::CheckCompatibleArguments<typename SignalType::Arguments, typename SlotType::Arguments>::value))>)} > ; > enum { > q_static_assert_result268 ># 267 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!((QtPrivate::AreArgumentsCompatible<typename SlotType::ReturnType, typename SignalType::ReturnType>::value))>)} > ; > > return connectImpl(sender, reinterpret_cast<void **>(&signal), sender, 0, > new QStaticSlotObject<Func2, > typename QtPrivate::List_Left<typename SignalType::Arguments, SlotType::ArgumentCount>::Value, > typename SignalType::ReturnType>(slot), > Qt::DirectConnection, 0, &SignalType::Object::staticMetaObject); > } > > > template <typename Func1, typename Func2> > static inline typename QtPrivate::QEnableIf<QtPrivate::FunctionPointer<Func2>::ArgumentCount == -1, QMetaObject::Connection>::Type > connect(const typename QtPrivate::FunctionPointer<Func1>::Object *sender, Func1 signal, Func2 slot) > { > typedef QtPrivate::FunctionPointer<Func1> SignalType; > > return connectImpl(sender, reinterpret_cast<void **>(&signal), sender, 0, > new QFunctorSlotObject<Func2, SignalType::ArgumentCount, typename SignalType::Arguments, typename SignalType::ReturnType>(slot), > Qt::DirectConnection, 0, &SignalType::Object::staticMetaObject); > } > > > static bool disconnect(const QObject *sender, const char *signal, > const QObject *receiver, const char *member); > static bool disconnect(const QObject *sender, const QMetaMethod &signal, > const QObject *receiver, const QMetaMethod &member); > inline bool disconnect(const char *signal = 0, > const QObject *receiver = 0, const char *member = 0) const > { return disconnect(this, signal, receiver, member); } > inline bool disconnect(const QObject *receiver, const char *member = 0) const > { return disconnect(this, 0, receiver, member); } > static bool disconnect(const QMetaObject::Connection &); > > > > > template <typename Func1, typename Func2> > static inline bool disconnect(const typename QtPrivate::FunctionPointer<Func1>::Object *sender, Func1 signal, > const typename QtPrivate::FunctionPointer<Func2>::Object *receiver, Func2 slot) > { > typedef QtPrivate::FunctionPointer<Func1> SignalType; > typedef QtPrivate::FunctionPointer<Func2> SlotType; > reinterpret_cast<typename SignalType::Object *>(0)->qt_check_for_QOBJECT_macro(*reinterpret_cast<typename SignalType::Object *>(0)); > > > enum { > q_static_assert_result314 ># 313 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" > = sizeof(QStaticAssertFailure<!!((QtPrivate::CheckCompatibleArguments<typename SignalType::Arguments, typename SlotType::Arguments>::value))>)} > ; > > return disconnectImpl(sender, reinterpret_cast<void **>(&signal), receiver, reinterpret_cast<void **>(&slot), > &SignalType::Object::staticMetaObject); > } > template <typename Func1> > static inline bool disconnect(const typename QtPrivate::FunctionPointer<Func1>::Object *sender, Func1 signal, > const QObject *receiver, void **zero) > { > > > > ((!(!zero)) ? qt_assert("!zero","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h",326) : qt_noop()); > typedef QtPrivate::FunctionPointer<Func1> SignalType; > return disconnectImpl(sender, reinterpret_cast<void **>(&signal), receiver, zero, > &SignalType::Object::staticMetaObject); > } > > > > void dumpObjectTree(); > void dumpObjectInfo(); > > > bool setProperty(const char *name, const QVariant &value); > QVariant property(const char *name) const; > QList<QByteArray> dynamicPropertyNames() const; > > > > static uint registerUserData(); > void setUserData(uint id, QObjectUserData* data); > QObjectUserData* userData(uint id) const; > > >public: > void destroyed(QObject * = 0); > void objectNameChanged(const QString &objectName); > >public: > inline QObject *parent() const { return d_ptr->parent; } > > inline bool inherits(const char *classname) const > { return const_cast<QObject *>(this)->qt_metacast(classname) != 0; } > >public : > void deleteLater(); > >protected: > QObject *sender() const; > int senderSignalIndex() const; > int receivers(const char* signal) const; > bool isSignalConnected(const QMetaMethod &signal) const; > > virtual void timerEvent(QTimerEvent *); > virtual void childEvent(QChildEvent *); > virtual void customEvent(QEvent *); > > virtual void connectNotify(const QMetaMethod &signal); > virtual void disconnectNotify(const QMetaMethod &signal); > >protected: > QObject(QObjectPrivate &dd, QObject *parent = 0); > >protected: > QScopedPointer<QObjectData> d_ptr; > > static const QMetaObject staticQtMetaObject; > > friend struct QMetaObject; > friend struct QMetaObjectPrivate; > friend class QMetaCallEvent; > friend class QApplication; > friend class QApplicationPrivate; > friend class QCoreApplication; > friend class QCoreApplicationPrivate; > friend class QWidget; > friend class QThreadData; > >private: > QObject(const QObject &) ; QObject &operator=(const QObject &) ; > > > private: > > struct __attribute__((visibility("default"))) QSlotObjectBase { > QAtomicInt ref; > QSlotObjectBase() : ref(1) {} > virtual ~QSlotObjectBase(); > virtual void call(QObject *receiver, void **a) = 0; > virtual bool compare(void **); > }; > > > template<typename Func, typename Args, typename R> struct QSlotObject : QSlotObjectBase > { > typedef QtPrivate::FunctionPointer<Func> FuncType; > Func function; > QSlotObject(Func f) : function(f) {} > virtual void call(QObject *receiver, void **a) { > FuncType::template call<Args, R>(function, static_cast<typename FuncType::Object *>(receiver), a); > } > virtual bool compare(void **f) { > return *reinterpret_cast<Func *>(f) == function; > } > }; > > > template<typename Func, typename Args, typename R> struct QStaticSlotObject : QSlotObjectBase > { > typedef QtPrivate::FunctionPointer<Func> FuncType; > Func function; > QStaticSlotObject(Func f) : function(f) {} > virtual void call(QObject *receiver, void **a) { > FuncType::template call<Args, R>(function, receiver, a); > } > }; > > > > template<typename Func, int N, typename Args, typename R> struct QFunctorSlotObject : QSlotObjectBase > { > typedef QtPrivate::Functor<Func, N> FuncType; > Func function; > QFunctorSlotObject(const Func &f) : function(f) {} > virtual void call(QObject *receiver, void **a) { > FuncType::template call<Args, R>(function, receiver, a); > } > }; > > static QMetaObject::Connection connectImpl(const QObject *sender, void **signal, > const QObject *receiver, void **slotPtr, > QSlotObjectBase *slot, Qt::ConnectionType type, > const int *types, const QMetaObject *senderMetaObject); > > static bool disconnectImpl(const QObject *sender, void **signal, const QObject *receiver, void **slot, > const QMetaObject *senderMetaObject); > >}; > >inline QMetaObject::Connection QObject::connect(const QObject *asender, const char *asignal, > const char *amember, Qt::ConnectionType atype) const >{ return connect(asender, asignal, this, amember, atype); } > > >class __attribute__((visibility("default"))) QObjectUserData { >public: > virtual ~QObjectUserData(); >}; ># 471 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" >template<typename T> >inline T qFindChild(const QObject *o, const QString &name = QString()) >{ return o->findChild<T>(name); } > >template<typename T> >inline QList<T> qFindChildren(const QObject *o, const QString &name = QString()) >{ > return o->findChildren<T>(name); >} > > >template<typename T> >inline QList<T> qFindChildren(const QObject *o, const QRegExp &re) >{ > return o->findChildren<T>(re); >} > > > > >template <class T> >inline T qobject_cast(QObject *object) >{ > > reinterpret_cast<T>(object)->qt_check_for_QOBJECT_macro(*reinterpret_cast<T>(object)); > > return static_cast<T>(reinterpret_cast<T>(object)->staticMetaObject.cast(object)); >} > >template <class T> >inline T qobject_cast(const QObject *object) >{ > > reinterpret_cast<T>(object)->qt_check_for_QOBJECT_macro(*reinterpret_cast<T>(const_cast<QObject *>(object))); > > return static_cast<T>(reinterpret_cast<T>(object)->staticMetaObject.cast(object)); >} > > >template <class T> inline const char * qobject_interface_iid() >{ return 0; } ># 524 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/kernel/qobject.h" >__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QObject *); > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qobject.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qiodevice.h" 2 > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 52 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qiodevice.h" 2 > > > > > > > > > > >class QByteArray; >class QIODevicePrivate; > >class __attribute__((visibility("default"))) QIODevice > > : public QObject > >{ > > public: template <typename T> inline void qt_check_for_QOBJECT_macro(const T &_q_argument) const { int i = qYouForgotTheQ_OBJECT_Macro(this, &_q_argument); i = i + 1; } static const QMetaObject staticMetaObject; virtual const QMetaObject *metaObject() const; virtual void *qt_metacast(const char *); static inline QString tr(const char *s, const char *c = 0, int n = -1) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c = 0, int n = -1) { return staticMetaObject.tr(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **); > >public: > enum OpenModeFlag { > NotOpen = 0x0000, > ReadOnly = 0x0001, > WriteOnly = 0x0002, > ReadWrite = ReadOnly | WriteOnly, > Append = 0x0004, > Truncate = 0x0008, > Text = 0x0010, > Unbuffered = 0x0020 > }; > typedef QFlags<OpenModeFlag> OpenMode; > > QIODevice(); > > explicit QIODevice(QObject *parent); > > virtual ~QIODevice(); > > OpenMode openMode() const; > > void setTextModeEnabled(bool enabled); > bool isTextModeEnabled() const; > > bool isOpen() const; > bool isReadable() const; > bool isWritable() const; > virtual bool isSequential() const; > > virtual bool open(OpenMode mode); > virtual void close(); > > > > virtual qint64 pos() const; > virtual qint64 size() const; > virtual bool seek(qint64 pos); > virtual bool atEnd() const; > virtual bool reset(); > > virtual qint64 bytesAvailable() const; > virtual qint64 bytesToWrite() const; > > qint64 read(char *data, qint64 maxlen); > QByteArray read(qint64 maxlen); > QByteArray readAll(); > qint64 readLine(char *data, qint64 maxlen); > QByteArray readLine(qint64 maxlen = 0); > virtual bool canReadLine() const; > > qint64 write(const char *data, qint64 len); > qint64 write(const char *data); > inline qint64 write(const QByteArray &data) > { return write(data.constData(), data.size()); } > > qint64 peek(char *data, qint64 maxlen); > QByteArray peek(qint64 maxlen); > > virtual bool waitForReadyRead(int msecs); > virtual bool waitForBytesWritten(int msecs); > > void ungetChar(char c); > bool putChar(char c); > bool getChar(char *c); > > QString errorString() const; > > >public: > void readyRead(); > void bytesWritten(qint64 bytes); > void aboutToClose(); > void readChannelFinished(); > > >protected: > > > > QIODevice(QIODevicePrivate &dd, QObject *parent = 0); > > virtual qint64 readData(char *data, qint64 maxlen) = 0; > virtual qint64 readLineData(char *data, qint64 maxlen); > virtual qint64 writeData(const char *data, qint64 len) = 0; > > void setOpenMode(OpenMode openMode); > > void setErrorString(const QString &errorString); > > > > > >private: > inline QIODevicePrivate* d_func() { return reinterpret_cast<QIODevicePrivate *>(qGetPtrHelper(d_ptr)); } inline const QIODevicePrivate* d_func() const { return reinterpret_cast<const QIODevicePrivate *>(qGetPtrHelper(d_ptr)); } friend class QIODevicePrivate; > QIODevice(const QIODevice &) ; QIODevice &operator=(const QIODevice &) ; >}; > > inline QFlags<QIODevice::OpenMode::enum_type> operator|(QIODevice::OpenMode::enum_type f1, QIODevice::OpenMode::enum_type f2) { return QFlags<QIODevice::OpenMode::enum_type>(f1) | f2; } inline QFlags<QIODevice::OpenMode::enum_type> operator|(QIODevice::OpenMode::enum_type f1, QFlags<QIODevice::OpenMode::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(QIODevice::OpenMode::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); } > > >class QDebug; >__attribute__((visibility("default"))) QDebug operator<<(QDebug debug, QIODevice::OpenMode modes); > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qiodevice.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qdatastream.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/io/qdatastream.h" 2 > > > > > > > > > > >class QByteArray; >class QIODevice; > >template <typename T> class QList; >template <typename T> class QLinkedList; >template <typename T> class QVector; >template <typename T> class QSet; >template <class Key, class T> class QHash; >template <class Key, class T> class QMap; > > >class QDataStreamPrivate; >class __attribute__((visibility("default"))) QDataStream >{ >public: > enum Version { > Qt_1_0 = 1, > Qt_2_0 = 2, > Qt_2_1 = 3, > Qt_3_0 = 4, > Qt_3_1 = 5, > Qt_3_3 = 6, > Qt_4_0 = 7, > Qt_4_1 = Qt_4_0, > Qt_4_2 = 8, > Qt_4_3 = 9, > Qt_4_4 = 10, > Qt_4_5 = 11, > Qt_4_6 = 12, > Qt_4_7 = Qt_4_6, > Qt_4_8 = Qt_4_7, > Qt_4_9 = Qt_4_8, > Qt_5_0 = 13 > > > > }; > > enum ByteOrder { > BigEndian = QSysInfo::BigEndian, > LittleEndian = QSysInfo::LittleEndian > }; > > enum Status { > Ok, > ReadPastEnd, > ReadCorruptData, > WriteFailed > }; > > enum FloatingPointPrecision { > SinglePrecision, > DoublePrecision > }; > > QDataStream(); > explicit QDataStream(QIODevice *); > QDataStream(QByteArray *, QIODevice::OpenMode flags); > QDataStream(const QByteArray &); > ~QDataStream(); > > QIODevice *device() const; > void setDevice(QIODevice *); > void unsetDevice(); > > bool atEnd() const; > > Status status() const; > void setStatus(Status status); > void resetStatus(); > > FloatingPointPrecision floatingPointPrecision() const; > void setFloatingPointPrecision(FloatingPointPrecision precision); > > ByteOrder byteOrder() const; > void setByteOrder(ByteOrder); > > int version() const; > void setVersion(int); > > QDataStream &operator>>(qint8 &i); > QDataStream &operator>>(quint8 &i); > QDataStream &operator>>(qint16 &i); > QDataStream &operator>>(quint16 &i); > QDataStream &operator>>(qint32 &i); > QDataStream &operator>>(quint32 &i); > QDataStream &operator>>(qint64 &i); > QDataStream &operator>>(quint64 &i); > > QDataStream &operator>>(bool &i); > QDataStream &operator>>(float &f); > QDataStream &operator>>(double &f); > QDataStream &operator>>(char *&str); > > QDataStream &operator<<(qint8 i); > QDataStream &operator<<(quint8 i); > QDataStream &operator<<(qint16 i); > QDataStream &operator<<(quint16 i); > QDataStream &operator<<(qint32 i); > QDataStream &operator<<(quint32 i); > QDataStream &operator<<(qint64 i); > QDataStream &operator<<(quint64 i); > QDataStream &operator<<(bool i); > QDataStream &operator<<(float f); > QDataStream &operator<<(double f); > QDataStream &operator<<(const char *str); > > QDataStream &readBytes(char *&, uint &len); > int readRawData(char *, int len); > > QDataStream &writeBytes(const char *, uint len); > int writeRawData(const char *, int len); > > int skipRawData(int len); > >private: > QDataStream(const QDataStream &) ; QDataStream &operator=(const QDataStream &) ; > > QScopedPointer<QDataStreamPrivate> d; > > QIODevice *dev; > bool owndev; > bool noswap; > ByteOrder byteorder; > int ver; > Status q_status; >}; > > > > > > >inline QIODevice *QDataStream::device() const >{ return dev; } > >inline QDataStream::ByteOrder QDataStream::byteOrder() const >{ return byteorder; } > >inline int QDataStream::version() const >{ return ver; } > >inline void QDataStream::setVersion(int v) >{ ver = v; } > >inline QDataStream &QDataStream::operator>>(quint8 &i) >{ return *this >> reinterpret_cast<qint8&>(i); } > >inline QDataStream &QDataStream::operator>>(quint16 &i) >{ return *this >> reinterpret_cast<qint16&>(i); } > >inline QDataStream &QDataStream::operator>>(quint32 &i) >{ return *this >> reinterpret_cast<qint32&>(i); } > >inline QDataStream &QDataStream::operator>>(quint64 &i) >{ return *this >> reinterpret_cast<qint64&>(i); } > >inline QDataStream &QDataStream::operator<<(quint8 i) >{ return *this << qint8(i); } > >inline QDataStream &QDataStream::operator<<(quint16 i) >{ return *this << qint16(i); } > >inline QDataStream &QDataStream::operator<<(quint32 i) >{ return *this << qint32(i); } > >inline QDataStream &QDataStream::operator<<(quint64 i) >{ return *this << qint64(i); } > >template <typename T> >QDataStream& operator>>(QDataStream& s, QList<T>& l) >{ > l.clear(); > quint32 c; > s >> c; > l.reserve(c); > for(quint32 i = 0; i < c; ++i) > { > T t; > s >> t; > l.append(t); > if (s.atEnd()) > break; > } > return s; >} > >template <typename T> >QDataStream& operator<<(QDataStream& s, const QList<T>& l) >{ > s << quint32(l.size()); > for (int i = 0; i < l.size(); ++i) > s << l.at(i); > return s; >} > >template <typename T> >QDataStream& operator>>(QDataStream& s, QLinkedList<T>& l) >{ > l.clear(); > quint32 c; > s >> c; > for(quint32 i = 0; i < c; ++i) > { > T t; > s >> t; > l.append(t); > if (s.atEnd()) > break; > } > return s; >} > >template <typename T> >QDataStream& operator<<(QDataStream& s, const QLinkedList<T>& l) >{ > s << quint32(l.size()); > typename QLinkedList<T>::ConstIterator it = l.constBegin(); > for(; it != l.constEnd(); ++it) > s << *it; > return s; >} > >template<typename T> >QDataStream& operator>>(QDataStream& s, QVector<T>& v) >{ > v.clear(); > quint32 c; > s >> c; > v.resize(c); > for(quint32 i = 0; i < c; ++i) { > T t; > s >> t; > v[i] = t; > } > return s; >} > >template<typename T> >QDataStream& operator<<(QDataStream& s, const QVector<T>& v) >{ > s << quint32(v.size()); > for (typename QVector<T>::const_iterator it = v.begin(); it != v.end(); ++it) > s << *it; > return s; >} > >template <typename T> >QDataStream &operator>>(QDataStream &in, QSet<T> &set) >{ > set.clear(); > quint32 c; > in >> c; > for (quint32 i = 0; i < c; ++i) { > T t; > in >> t; > set << t; > if (in.atEnd()) > break; > } > return in; >} > >template <typename T> >QDataStream& operator<<(QDataStream &out, const QSet<T> &set) >{ > out << quint32(set.size()); > typename QSet<T>::const_iterator i = set.constBegin(); > while (i != set.constEnd()) { > out << *i; > ++i; > } > return out; >} > >template <class Key, class T> > QDataStream &operator>>(QDataStream &in, QHash<Key, T> &hash) >{ > QDataStream::Status oldStatus = in.status(); > in.resetStatus(); > hash.clear(); > > quint32 n; > in >> n; > > for (quint32 i = 0; i < n; ++i) { > if (in.status() != QDataStream::Ok) > break; > > Key k; > T t; > in >> k >> t; > hash.insertMulti(k, t); > } > > if (in.status() != QDataStream::Ok) > hash.clear(); > if (oldStatus != QDataStream::Ok) > in.setStatus(oldStatus); > return in; >} > >template <class Key, class T> > QDataStream &operator<<(QDataStream &out, const QHash<Key, T>& hash) >{ > out << quint32(hash.size()); > typename QHash<Key, T>::ConstIterator it = hash.end(); > typename QHash<Key, T>::ConstIterator begin = hash.begin(); > while (it != begin) { > --it; > out << it.key() << it.value(); > } > return out; >} > > > > >template <class aKey, class aT> > QDataStream &operator>>(QDataStream &in, QMap<aKey, aT> &map) > >{ > QDataStream::Status oldStatus = in.status(); > in.resetStatus(); > map.clear(); > > quint32 n; > in >> n; > > map.detach(); > for (quint32 i = 0; i < n; ++i) { > if (in.status() != QDataStream::Ok) > break; > > aKey key; > aT value; > in >> key >> value; > map.insertMulti(key, value); > } > if (in.status() != QDataStream::Ok) > map.clear(); > if (oldStatus != QDataStream::Ok) > in.setStatus(oldStatus); > return in; >} > >template <class Key, class T> > QDataStream &operator<<(QDataStream &out, const QMap<Key, T> &map) >{ > out << quint32(map.size()); > typename QMap<Key, T>::ConstIterator it = map.end(); > typename QMap<Key, T>::ConstIterator begin = map.begin(); > while (it != begin) { > --it; > out << it.key() << it.value(); > } > return out; >} > > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qdatastream.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qlist.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qregexp.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qregexp.h" 1 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qregexp.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qregexp.h" 2 > > > > > > >struct QRegExpPrivate; >class QStringList; > >class __attribute__((visibility("default"))) QRegExp >{ >public: > enum PatternSyntax { > RegExp, > Wildcard, > FixedString, > RegExp2, > WildcardUnix, > W3CXmlSchema11 }; > enum CaretMode { CaretAtZero, CaretAtOffset, CaretWontMatch }; > > QRegExp(); > explicit QRegExp(const QString &pattern, Qt::CaseSensitivity cs = Qt::CaseSensitive, > PatternSyntax syntax = RegExp); > QRegExp(const QRegExp &rx); > ~QRegExp(); > QRegExp &operator=(const QRegExp &rx); > > > > > inline void swap(QRegExp &other) { qSwap(priv, other.priv); } > > bool operator==(const QRegExp &rx) const; > inline bool operator!=(const QRegExp &rx) const { return !operator==(rx); } > > bool isEmpty() const; > bool isValid() const; > QString pattern() const; > void setPattern(const QString &pattern); > Qt::CaseSensitivity caseSensitivity() const; > void setCaseSensitivity(Qt::CaseSensitivity cs); > PatternSyntax patternSyntax() const; > void setPatternSyntax(PatternSyntax syntax); > > bool isMinimal() const; > void setMinimal(bool minimal); > > bool exactMatch(const QString &str) const; > > int indexIn(const QString &str, int offset = 0, CaretMode caretMode = CaretAtZero) const; > int lastIndexIn(const QString &str, int offset = -1, CaretMode caretMode = CaretAtZero) const; > int matchedLength() const; > > int captureCount() const; > QStringList capturedTexts() const; > QStringList capturedTexts(); > QString cap(int nth = 0) const; > QString cap(int nth = 0); > int pos(int nth = 0) const; > int pos(int nth = 0); > QString errorString() const; > QString errorString(); > > > static QString escape(const QString &str); > >private: > QRegExpPrivate *priv; >}; > >template<> class QTypeInfo<QRegExp > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QRegExp)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QRegExp) }; static inline const char *name() { return "QRegExp"; } }; > > >__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &out, const QRegExp ®Exp); >__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &in, QRegExp ®Exp); > > > >__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QRegExp &); > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qregexp.h" 2 ># 49 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 50 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qstringmatcher.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringmatcher.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringmatcher.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qstring.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringmatcher.h" 2 > > > > > > >class QStringMatcherPrivate; > >class __attribute__((visibility("default"))) QStringMatcher >{ >public: > QStringMatcher(); > explicit QStringMatcher(const QString &pattern, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > QStringMatcher(const QChar *uc, int len, > Qt::CaseSensitivity cs = Qt::CaseSensitive); > QStringMatcher(const QStringMatcher &other); > ~QStringMatcher(); > > QStringMatcher &operator=(const QStringMatcher &other); > > void setPattern(const QString &pattern); > void setCaseSensitivity(Qt::CaseSensitivity cs); > > int indexIn(const QString &str, int from = 0) const; > int indexIn(const QChar *str, int length, int from = 0) const; > QString pattern() const; > inline Qt::CaseSensitivity caseSensitivity() const { return q_cs; } > >private: > QStringMatcherPrivate *d_ptr; > QString q_pattern; > Qt::CaseSensitivity q_cs; > > > > > > struct Data { > uchar q_skiptable[256]; > const QChar *uc; > int len; > }; > union { > uint q_data[256]; > Data p; > }; > > > >}; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qstringmatcher.h" 2 ># 51 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qstringlist.h" 2 > > > > > > >class QRegExp; >class QRegularExpression; > >typedef QListIterator<QString> QStringListIterator; >typedef QMutableListIterator<QString> QMutableStringListIterator; > >class QStringList : public QList<QString> >{ >public: > inline QStringList() { } > inline explicit QStringList(const QString &i) { append(i); } > inline QStringList(const QStringList &l) : QList<QString>(l) { } > inline QStringList(const QList<QString> &l) : QList<QString>(l) { } > > > > > inline void sort(Qt::CaseSensitivity cs = Qt::CaseSensitive); > inline int removeDuplicates(); > > inline QString join(const QString &sep) const; > > inline QStringList filter(const QString &str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > inline bool contains(const QString &str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const; > > inline QStringList &replaceInStrings(const QString &before, const QString &after, Qt::CaseSensitivity cs = Qt::CaseSensitive); > > inline QStringList operator+(const QStringList &other) const > { QStringList n = *this; n += other; return n; } > inline QStringList &operator<<(const QString &str) > { append(str); return *this; } > inline QStringList &operator<<(const QStringList &l) > { *this += l; return *this; } > > > inline QStringList filter(const QRegExp &rx) const; > inline QStringList &replaceInStrings(const QRegExp &rx, const QString &after); > inline int indexOf(const QRegExp &rx, int from = 0) const; > inline int lastIndexOf(const QRegExp &rx, int from = -1) const; > inline int indexOf(QRegExp &rx, int from = 0) const; > inline int lastIndexOf(QRegExp &rx, int from = -1) const; > > > > > inline QStringList filter(const QRegularExpression &re) const; > inline QStringList &replaceInStrings(const QRegularExpression &re, const QString &after); > inline int indexOf(const QRegularExpression &re, int from = 0) const; > inline int lastIndexOf(const QRegularExpression &re, int from = -1) const; > > > > > using QList<QString>::indexOf; > using QList<QString>::lastIndexOf; > > > > > > >}; > >template<> class QTypeInfo<QStringList > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QStringList)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QStringList) }; static inline const char *name() { return "QStringList"; } }; > >namespace QtPrivate { > void __attribute__((visibility("default"))) QStringList_sort(QStringList *that, Qt::CaseSensitivity cs); > int __attribute__((visibility("default"))) QStringList_removeDuplicates(QStringList *that); > QString __attribute__((visibility("default"))) QStringList_join(const QStringList *that, const QString &sep); > QStringList __attribute__((visibility("default"))) QStringList_filter(const QStringList *that, const QString &str, > Qt::CaseSensitivity cs); > > bool __attribute__((visibility("default"))) QStringList_contains(const QStringList *that, const QString &str, Qt::CaseSensitivity cs); > void __attribute__((visibility("default"))) QStringList_replaceInStrings(QStringList *that, const QString &before, const QString &after, > Qt::CaseSensitivity cs); > > > void __attribute__((visibility("default"))) QStringList_replaceInStrings(QStringList *that, const QRegExp &rx, const QString &after); > QStringList __attribute__((visibility("default"))) QStringList_filter(const QStringList *that, const QRegExp &re); > int __attribute__((visibility("default"))) QStringList_indexOf(const QStringList *that, const QRegExp &rx, int from); > int __attribute__((visibility("default"))) QStringList_lastIndexOf(const QStringList *that, const QRegExp &rx, int from); > int __attribute__((visibility("default"))) QStringList_indexOf(const QStringList *that, QRegExp &rx, int from); > int __attribute__((visibility("default"))) QStringList_lastIndexOf(const QStringList *that, QRegExp &rx, int from); > > > > > void __attribute__((visibility("default"))) QStringList_replaceInStrings(QStringList *that, const QRegularExpression &rx, const QString &after); > QStringList __attribute__((visibility("default"))) QStringList_filter(const QStringList *that, const QRegularExpression &re); > int __attribute__((visibility("default"))) QStringList_indexOf(const QStringList *that, const QRegularExpression &re, int from); > int __attribute__((visibility("default"))) QStringList_lastIndexOf(const QStringList *that, const QRegularExpression &re, int from); > > >} > >inline void QStringList::sort(Qt::CaseSensitivity cs) >{ > QtPrivate::QStringList_sort(this, cs); >} > >inline int QStringList::removeDuplicates() >{ > return QtPrivate::QStringList_removeDuplicates(this); >} > >inline QString QStringList::join(const QString &sep) const >{ > return QtPrivate::QStringList_join(this, sep); >} > >inline QStringList QStringList::filter(const QString &str, Qt::CaseSensitivity cs) const >{ > return QtPrivate::QStringList_filter(this, str, cs); >} > >inline bool QStringList::contains(const QString &str, Qt::CaseSensitivity cs) const >{ > return QtPrivate::QStringList_contains(this, str, cs); >} > >inline QStringList &QStringList::replaceInStrings(const QString &before, const QString &after, Qt::CaseSensitivity cs) >{ > QtPrivate::QStringList_replaceInStrings(this, before, after, cs); > return *this; >} > > >inline QStringList &QStringList::replaceInStrings(const QRegExp &rx, const QString &after) >{ > QtPrivate::QStringList_replaceInStrings(this, rx, after); > return *this; >} > >inline QStringList QStringList::filter(const QRegExp &rx) const >{ > return QtPrivate::QStringList_filter(this, rx); >} > >inline int QStringList::indexOf(const QRegExp &rx, int from) const >{ > return QtPrivate::QStringList_indexOf(this, rx, from); >} > >inline int QStringList::lastIndexOf(const QRegExp &rx, int from) const >{ > return QtPrivate::QStringList_lastIndexOf(this, rx, from); >} > >inline int QStringList::indexOf(QRegExp &rx, int from) const >{ > return QtPrivate::QStringList_indexOf(this, rx, from); >} > >inline int QStringList::lastIndexOf(QRegExp &rx, int from) const >{ > return QtPrivate::QStringList_lastIndexOf(this, rx, from); >} > > > > >inline QStringList &QStringList::replaceInStrings(const QRegularExpression &rx, const QString &after) >{ > QtPrivate::QStringList_replaceInStrings(this, rx, after); > return *this; >} > >inline QStringList QStringList::filter(const QRegularExpression &rx) const >{ > return QtPrivate::QStringList_filter(this, rx); >} > >inline int QStringList::indexOf(const QRegularExpression &rx, int from) const >{ > return QtPrivate::QStringList_indexOf(this, rx, from); >} > >inline int QStringList::lastIndexOf(const QRegularExpression &rx, int from) const >{ > return QtPrivate::QStringList_lastIndexOf(this, rx, from); >} > > > > >inline QDataStream &operator>>(QDataStream &in, QStringList &list) >{ > return operator>>(in, static_cast<QList<QString> &>(list)); >} >inline QDataStream &operator<<(QDataStream &out, const QStringList &list) >{ > return operator<<(out, static_cast<const QList<QString> &>(list)); >} > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qstringlist.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QStringList" 2 ># 41 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QList" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qlist.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/QList" 2 ># 42 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QHash" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qhash.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qchar.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qiterator.h" 1 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qlist.h" 1 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qpair.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qpair.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qpair.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qdatastream.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qpair.h" 2 > > > > > > >template <class T1, class T2> >struct QPair >{ > typedef T1 first_type; > typedef T2 second_type; > > QPair() : first(), second() {} > QPair(const T1 &t1, const T2 &t2) : first(t1), second(t2) {} > > > T1 first; > T2 second; >}; > > > >template<class T1, class T2> >class QTypeInfo< QPair<T1, T2> > >{ >public: > enum { > isComplex = QTypeInfo<T1>::isComplex || QTypeInfo<T2>::isComplex, > isStatic = QTypeInfo<T1>::isStatic || QTypeInfo<T2>::isStatic, > isLarge = sizeof(QPair<T1, T2>) > sizeof(void*), > isPointer = false, > isDummy = false, > sizeOf = sizeof(QPair<T1, T2>) > }; >}; > >template <class T1, class T2> >inline bool operator==(const QPair<T1, T2> &p1, const QPair<T1, T2> &p2) >{ return p1.first == p2.first && p1.second == p2.second; } > >template <class T1, class T2> >inline bool operator!=(const QPair<T1, T2> &p1, const QPair<T1, T2> &p2) >{ return !(p1 == p2); } > >template <class T1, class T2> >inline bool operator<(const QPair<T1, T2> &p1, const QPair<T1, T2> &p2) >{ > return p1.first < p2.first || (!(p2.first < p1.first) && p1.second < p2.second); >} > >template <class T1, class T2> >inline bool operator>(const QPair<T1, T2> &p1, const QPair<T1, T2> &p2) >{ > return p2 < p1; >} > >template <class T1, class T2> >inline bool operator<=(const QPair<T1, T2> &p1, const QPair<T1, T2> &p2) >{ > return !(p2 < p1); >} > >template <class T1, class T2> >inline bool operator>=(const QPair<T1, T2> &p1, const QPair<T1, T2> &p2) >{ > return !(p1 < p2); >} > >template <class T1, class T2> > QPair<T1, T2> qMakePair(const T1 &x, const T2 &y) >{ > return QPair<T1, T2>(x, y); >} > > >template <class T1, class T2> >inline QDataStream& operator>>(QDataStream& s, QPair<T1, T2>& p) >{ > s >> p.first >> p.second; > return s; >} > >template <class T1, class T2> >inline QDataStream& operator<<(QDataStream& s, const QPair<T1, T2>& p) >{ > s << p.first << p.second; > return s; >} > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qpair.h" 2 ># 49 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qrefcount.h" 1 ># 50 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" 2 > > > > > > >class QBitArray; >class QByteArray; >class QString; >class QStringRef; > >inline uint qHash(char key, uint seed = 0) { return uint(key) ^ seed; } >inline uint qHash(uchar key, uint seed = 0) { return uint(key) ^ seed; } >inline uint qHash(signed char key, uint seed = 0) { return uint(key) ^ seed; } >inline uint qHash(ushort key, uint seed = 0) { return uint(key) ^ seed; } >inline uint qHash(short key, uint seed = 0) { return uint(key) ^ seed; } >inline uint qHash(uint key, uint seed = 0) { return key ^ seed; } >inline uint qHash(int key, uint seed = 0) { return uint(key) ^ seed; } >inline uint qHash(ulong key, uint seed = 0) >{ > if (sizeof(ulong) > sizeof(uint)) { > return uint(((key >> (8 * sizeof(uint) - 1)) ^ key) & (~0U)) ^ seed; > } else { > return uint(key & (~0U)) ^ seed; > } >} >inline uint qHash(long key, uint seed = 0) { return qHash(ulong(key), seed); } >inline uint qHash(quint64 key, uint seed = 0) >{ > if (sizeof(quint64) > sizeof(uint)) { > return uint(((key >> (8 * sizeof(uint) - 1)) ^ key) & (~0U)) ^ seed; > } else { > return uint(key & (~0U)) ^ seed; > } >} >inline uint qHash(qint64 key, uint seed = 0) { return qHash(quint64(key), seed); } >inline uint qHash(QChar key, uint seed = 0) { return qHash(key.unicode(), seed); } >__attribute__((visibility("default"))) uint qHash(const QByteArray &key, uint seed = 0); >__attribute__((visibility("default"))) uint qHash(const QString &key, uint seed = 0); >__attribute__((visibility("default"))) uint qHash(const QStringRef &key, uint seed = 0); >__attribute__((visibility("default"))) uint qHash(const QBitArray &key, uint seed = 0); >__attribute__((visibility("default"))) uint qHash(QLatin1String key, uint seed = 0); >__attribute__((visibility("default"))) uint qt_hash(const QString &key); > > > > > >template <class T> inline uint qHash(const T *key, uint seed = 0) >{ > return qHash(reinterpret_cast<quintptr>(key), seed); >} > > > > >template <typename T1, typename T2> inline uint qHash(const QPair<T1, T2> &key) >{ > uint h1 = qHash(key.first); > uint h2 = qHash(key.second); > return ((h1 << 16) | (h1 >> 16)) ^ h2; >} > >template<typename T> inline uint qHash(const T &t, uint seed) { return (qHash(t) ^ seed); } > >struct __attribute__((visibility("default"))) QHashData >{ > struct Node { > Node *next; > uint h; > }; > > Node *fakeNext; > Node **buckets; > QtPrivate::RefCount ref; > int size; > int nodeSize; > short userNumBits; > short numBits; > int numBuckets; > uint seed; > uint sharable : 1; > uint strictAlignment : 1; > uint reserved : 30; > > void *allocateNode(int nodeAlign); > void freeNode(void *node); > QHashData *detach_helper(void (*node_duplicate)(Node *, void *), void (*node_delete)(Node *), > int nodeSize, int nodeAlign); > bool willGrow(); > void hasShrunk(); > void rehash(int hint); > void free_helper(void (*node_delete)(Node *)); > Node *firstNode(); > > > > > static Node *nextNode(Node *node); > static Node *previousNode(Node *node); > > static const QHashData shared_null; >}; > >inline bool QHashData::willGrow() >{ > if (size >= numBuckets) { > rehash(numBits + 1); > return true; > } else { > return false; > } >} > >inline void QHashData::hasShrunk() >{ > if (size <= (numBuckets >> 3) && numBits > userNumBits) { > try { > rehash(qMax(int(numBits) - 2, int(userNumBits))); > } catch (const std::bad_alloc &) { > > } > } >} > >inline QHashData::Node *QHashData::firstNode() >{ > Node *e = reinterpret_cast<Node *>(this); > Node **bucket = buckets; > int n = numBuckets; > while (n--) { > if (*bucket != e) > return *bucket; > ++bucket; > } > return e; >} > >struct QHashDummyValue >{ >}; > >inline bool operator==(const QHashDummyValue & , const QHashDummyValue & ) >{ > return true; >} > >template<> class QTypeInfo<QHashDummyValue > { public: enum { isComplex = (((Q_MOVABLE_TYPE | Q_DUMMY_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE | Q_DUMMY_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QHashDummyValue)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE | Q_DUMMY_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QHashDummyValue) }; static inline const char *name() { return "QHashDummyValue"; } }; > >template <class Key, class T> >struct QHashNode >{ > QHashNode *next; > uint h; > Key key; > T value; > > inline QHashNode(const Key &key0, const T &value0, uint hash, QHashNode *n) > : next(n), h(hash), key(key0), value(value0) {} > inline bool same_key(uint h0, const Key &key0) { return h0 == h && key0 == key; } >}; > >template <class Key, class T> >struct QHashDummyNode >{ > QHashNode<Key, T> *next; > uint h; > Key key; > > inline QHashDummyNode(const Key &key0, uint hash, QHashNode<Key, T> *n) : next(n), h(hash), key(key0) {} >}; ># 265 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" >template <class Key, class T> >class QHash >{ > typedef QHashDummyNode<Key, T> DummyNode; > typedef QHashNode<Key, T> Node; > > union { > QHashData *d; > QHashNode<Key, T> *e; > }; > > static inline Node *concrete(QHashData::Node *node) { > return reinterpret_cast<Node *>(node); > } > > static inline int alignOfNode() { return qMax<int>(sizeof(void*), __alignof__(Node)); } > static inline int alignOfDummyNode() { return qMax<int>(sizeof(void*), __alignof__(DummyNode)); } > >public: > inline QHash() : d(const_cast<QHashData *>(&QHashData::shared_null)) { } > inline QHash(const QHash<Key, T> &other) : d(other.d) { d->ref.ref(); if (!d->sharable) detach(); } > inline ~QHash() { if (!d->ref.deref()) freeData(d); } > > QHash<Key, T> &operator=(const QHash<Key, T> &other); > > > > > > inline void swap(QHash<Key, T> &other) { qSwap(d, other.d); } > > bool operator==(const QHash<Key, T> &other) const; > inline bool operator!=(const QHash<Key, T> &other) const { return !(*this == other); } > > inline int size() const { return d->size; } > > inline bool isEmpty() const { return d->size == 0; } > > inline int capacity() const { return d->numBuckets; } > void reserve(int size); > inline void squeeze() { reserve(1); } > > inline void detach() { if (d->ref.isShared()) detach_helper(); } > inline bool isDetached() const { return !d->ref.isShared(); } > inline void setSharable(bool sharable) { if (!sharable) detach(); if (d != &QHashData::shared_null) d->sharable = sharable; } > inline bool isSharedWith(const QHash<Key, T> &other) const { return d == other.d; } > > void clear(); > > int remove(const Key &key); > T take(const Key &key); > > bool contains(const Key &key) const; > const Key key(const T &value) const; > const Key key(const T &value, const Key &defaultKey) const; > const T value(const Key &key) const; > const T value(const Key &key, const T &defaultValue) const; > T &operator[](const Key &key); > const T operator[](const Key &key) const; > > QList<Key> uniqueKeys() const; > QList<Key> keys() const; > QList<Key> keys(const T &value) const; > QList<T> values() const; > QList<T> values(const Key &key) const; > int count(const Key &key) const; > > class const_iterator; > > class iterator > { > friend class const_iterator; > friend class QHash<Key, T>; > QHashData::Node *i; > > public: > typedef std::bidirectional_iterator_tag iterator_category; > typedef qptrdiff difference_type; > typedef T value_type; > typedef T *pointer; > typedef T &reference; > > inline iterator() : i(0) { } > explicit inline iterator(void *node) : i(reinterpret_cast<QHashData::Node *>(node)) { } > > inline const Key &key() const { return concrete(i)->key; } > inline T &value() const { return concrete(i)->value; } > inline T &operator*() const { return concrete(i)->value; } > inline T *operator->() const { return &concrete(i)->value; } > inline bool operator==(const iterator &o) const { return i == o.i; } > inline bool operator!=(const iterator &o) const { return i != o.i; } > > inline iterator &operator++() { > i = QHashData::nextNode(i); > return *this; > } > inline iterator operator++(int) { > iterator r = *this; > i = QHashData::nextNode(i); > return r; > } > inline iterator &operator--() { > i = QHashData::previousNode(i); > return *this; > } > inline iterator operator--(int) { > iterator r = *this; > i = QHashData::previousNode(i); > return r; > } > inline iterator operator+(int j) const > { iterator r = *this; if (j > 0) while (j--) ++r; else while (j++) --r; return r; } > inline iterator operator-(int j) const { return operator+(-j); } > inline iterator &operator+=(int j) { return *this = *this + j; } > inline iterator &operator-=(int j) { return *this = *this - j; } > > > public: > inline bool operator==(const const_iterator &o) const > { return i == o.i; } > inline bool operator!=(const const_iterator &o) const > { return i != o.i; } > > }; > friend class iterator; > > class const_iterator > { > friend class iterator; > QHashData::Node *i; > > public: > typedef std::bidirectional_iterator_tag iterator_category; > typedef qptrdiff difference_type; > typedef T value_type; > typedef const T *pointer; > typedef const T &reference; > > inline const_iterator() : i(0) { } > explicit inline const_iterator(void *node) > : i(reinterpret_cast<QHashData::Node *>(node)) { } > > > > inline const_iterator(const iterator &o) > > { i = o.i; } > > inline const Key &key() const { return concrete(i)->key; } > inline const T &value() const { return concrete(i)->value; } > inline const T &operator*() const { return concrete(i)->value; } > inline const T *operator->() const { return &concrete(i)->value; } > inline bool operator==(const const_iterator &o) const { return i == o.i; } > inline bool operator!=(const const_iterator &o) const { return i != o.i; } > > inline const_iterator &operator++() { > i = QHashData::nextNode(i); > return *this; > } > inline const_iterator operator++(int) { > const_iterator r = *this; > i = QHashData::nextNode(i); > return r; > } > inline const_iterator &operator--() { > i = QHashData::previousNode(i); > return *this; > } > inline const_iterator operator--(int) { > const_iterator r = *this; > i = QHashData::previousNode(i); > return r; > } > inline const_iterator operator+(int j) const > { const_iterator r = *this; if (j > 0) while (j--) ++r; else while (j++) --r; return r; } > inline const_iterator operator-(int j) const { return operator+(-j); } > inline const_iterator &operator+=(int j) { return *this = *this + j; } > inline const_iterator &operator-=(int j) { return *this = *this - j; } > > > > > > > > }; > friend class const_iterator; > > > inline iterator begin() { detach(); return iterator(d->firstNode()); } > inline const_iterator begin() const { return const_iterator(d->firstNode()); } > inline const_iterator cbegin() const { return const_iterator(d->firstNode()); } > inline const_iterator constBegin() const { return const_iterator(d->firstNode()); } > inline iterator end() { detach(); return iterator(e); } > inline const_iterator end() const { return const_iterator(e); } > inline const_iterator cend() const { return const_iterator(e); } > inline const_iterator constEnd() const { return const_iterator(e); } > iterator erase(iterator it); > > > typedef iterator Iterator; > typedef const_iterator ConstIterator; > inline int count() const { return d->size; } > iterator find(const Key &key); > const_iterator find(const Key &key) const; > const_iterator constFind(const Key &key) const; > iterator insert(const Key &key, const T &value); > iterator insertMulti(const Key &key, const T &value); > QHash<Key, T> &unite(const QHash<Key, T> &other); > > > typedef T mapped_type; > typedef Key key_type; > typedef qptrdiff difference_type; > typedef int size_type; > > inline bool empty() const { return isEmpty(); } > > > > > > >private: > void detach_helper(); > void freeData(QHashData *d); > Node **findNode(const Key &key, uint *hp = 0) const; > Node *createNode(uint h, const Key &key, const T &value, Node **nextNode); > void deleteNode(Node *node); > static void deleteNode2(QHashData::Node *node); > > static void duplicateNode(QHashData::Node *originalNode, void *newNode); >}; > > >template <class Key, class T> >inline void QHash<Key, T>::deleteNode(Node *node) >{ > deleteNode2(reinterpret_cast<QHashData::Node*>(node)); > d->freeNode(node); >} > >template <class Key, class T> >inline void QHash<Key, T>::deleteNode2(QHashData::Node *node) >{ > > > > concrete(node)->~Node(); > >} > >template <class Key, class T> >inline void QHash<Key, T>::duplicateNode(QHashData::Node *node, void *newNode) >{ > Node *concreteNode = concrete(node); > if (QTypeInfo<T>::isDummy) { > (void) new (newNode) DummyNode(concreteNode->key, concreteNode->h, 0); > } else { > (void) new (newNode) Node(concreteNode->key, concreteNode->value, concreteNode->h, 0); > } >} > >template <class Key, class T> >inline typename QHash<Key, T>::Node * >QHash<Key, T>::createNode(uint ah, const Key &akey, const T &avalue, Node **anextNode) >{ > Node *node; > > if (QTypeInfo<T>::isDummy) { > node = reinterpret_cast<Node *>(new (d->allocateNode(alignOfDummyNode())) DummyNode(akey, ah, *anextNode)); > } else { > node = new (d->allocateNode(alignOfNode())) Node(akey, avalue, ah, *anextNode); > } > > *anextNode = node; > ++d->size; > return node; >} > >template <class Key, class T> >inline QHash<Key, T> &QHash<Key, T>::unite(const QHash<Key, T> &other) >{ > QHash<Key, T> copy(other); > const_iterator it = copy.constEnd(); > while (it != copy.constBegin()) { > --it; > insertMulti(it.key(), it.value()); > } > return *this; >} > >template <class Key, class T> > void QHash<Key, T>::freeData(QHashData *x) >{ > x->free_helper(deleteNode2); >} > >template <class Key, class T> >inline void QHash<Key, T>::clear() >{ > *this = QHash<Key,T>(); >} > >template <class Key, class T> > void QHash<Key, T>::detach_helper() >{ > QHashData *x = d->detach_helper(duplicateNode, deleteNode2, > QTypeInfo<T>::isDummy ? sizeof(DummyNode) : sizeof(Node), > QTypeInfo<T>::isDummy ? alignOfDummyNode() : alignOfNode()); > if (!d->ref.deref()) > freeData(d); > d = x; >} > >template <class Key, class T> >inline QHash<Key, T> &QHash<Key, T>::operator=(const QHash<Key, T> &other) >{ > if (d != other.d) { > QHashData *o = other.d; > o->ref.ref(); > if (!d->ref.deref()) > freeData(d); > d = o; > if (!d->sharable) > detach_helper(); > } > return *this; >} > >template <class Key, class T> >inline const T QHash<Key, T>::value(const Key &akey) const >{ > Node *node; > if (d->size == 0 || (node = *findNode(akey)) == e) { > return T(); > } else { > return node->value; > } >} > >template <class Key, class T> >inline const T QHash<Key, T>::value(const Key &akey, const T &adefaultValue) const >{ > Node *node; > if (d->size == 0 || (node = *findNode(akey)) == e) { > return adefaultValue; > } else { > return node->value; > } >} > >template <class Key, class T> > QList<Key> QHash<Key, T>::uniqueKeys() const >{ > QList<Key> res; > res.reserve(size()); > const_iterator i = begin(); > if (i != end()) { > for (;;) { > const Key &aKey = i.key(); > res.append(aKey); > do { > if (++i == end()) > goto break_out_of_outer_loop; > } while (aKey == i.key()); > } > } >break_out_of_outer_loop: > return res; >} > >template <class Key, class T> > QList<Key> QHash<Key, T>::keys() const >{ > QList<Key> res; > res.reserve(size()); > const_iterator i = begin(); > while (i != end()) { > res.append(i.key()); > ++i; > } > return res; >} > >template <class Key, class T> > QList<Key> QHash<Key, T>::keys(const T &avalue) const >{ > QList<Key> res; > const_iterator i = begin(); > while (i != end()) { > if (i.value() == avalue) > res.append(i.key()); > ++i; > } > return res; >} > >template <class Key, class T> > const Key QHash<Key, T>::key(const T &avalue) const >{ > return key(avalue, Key()); >} > >template <class Key, class T> > const Key QHash<Key, T>::key(const T &avalue, const Key &defaultValue) const >{ > const_iterator i = begin(); > while (i != end()) { > if (i.value() == avalue) > return i.key(); > ++i; > } > > return defaultValue; >} > >template <class Key, class T> > QList<T> QHash<Key, T>::values() const >{ > QList<T> res; > res.reserve(size()); > const_iterator i = begin(); > while (i != end()) { > res.append(i.value()); > ++i; > } > return res; >} > >template <class Key, class T> > QList<T> QHash<Key, T>::values(const Key &akey) const >{ > QList<T> res; > Node *node = *findNode(akey); > if (node != e) { > do { > res.append(node->value); > } while ((node = node->next) != e && node->key == akey); > } > return res; >} > >template <class Key, class T> > int QHash<Key, T>::count(const Key &akey) const >{ > int cnt = 0; > Node *node = *findNode(akey); > if (node != e) { > do { > ++cnt; > } while ((node = node->next) != e && node->key == akey); > } > return cnt; >} > >template <class Key, class T> >inline const T QHash<Key, T>::operator[](const Key &akey) const >{ > return value(akey); >} > >template <class Key, class T> >inline T &QHash<Key, T>::operator[](const Key &akey) >{ > detach(); > > uint h; > Node **node = findNode(akey, &h); > if (*node == e) { > if (d->willGrow()) > node = findNode(akey, &h); > return createNode(h, akey, T(), node)->value; > } > return (*node)->value; >} > >template <class Key, class T> >inline typename QHash<Key, T>::iterator QHash<Key, T>::insert(const Key &akey, > const T &avalue) >{ > detach(); > > uint h; > Node **node = findNode(akey, &h); > if (*node == e) { > if (d->willGrow()) > node = findNode(akey, &h); > return iterator(createNode(h, akey, avalue, node)); > } > > if (!QTypeInfo<T>::isDummy) > (*node)->value = avalue; > return iterator(*node); >} > >template <class Key, class T> >inline typename QHash<Key, T>::iterator QHash<Key, T>::insertMulti(const Key &akey, > const T &avalue) >{ > detach(); > d->willGrow(); > > uint h; > Node **nextNode = findNode(akey, &h); > return iterator(createNode(h, akey, avalue, nextNode)); >} > >template <class Key, class T> > int QHash<Key, T>::remove(const Key &akey) >{ > if (isEmpty()) > return 0; > detach(); > > int oldSize = d->size; > Node **node = findNode(akey); > if (*node != e) { > bool deleteNext = true; > do { > Node *next = (*node)->next; > deleteNext = (next != e && next->key == (*node)->key); > deleteNode(*node); > *node = next; > --d->size; > } while (deleteNext); > d->hasShrunk(); > } > return oldSize - d->size; >} > >template <class Key, class T> > T QHash<Key, T>::take(const Key &akey) >{ > if (isEmpty()) > return T(); > detach(); > > Node **node = findNode(akey); > if (*node != e) { > T t = (*node)->value; > Node *next = (*node)->next; > deleteNode(*node); > *node = next; > --d->size; > d->hasShrunk(); > return t; > } > return T(); >} > >template <class Key, class T> > typename QHash<Key, T>::iterator QHash<Key, T>::erase(iterator it) >{ > if (it == iterator(e)) > return it; > > iterator ret = it; > ++ret; > > Node *node = concrete(it.i); > Node **node_ptr = reinterpret_cast<Node **>(&d->buckets[node->h % d->numBuckets]); > while (*node_ptr != node) > node_ptr = &(*node_ptr)->next; > *node_ptr = node->next; > deleteNode(node); > --d->size; > return ret; >} > >template <class Key, class T> >inline void QHash<Key, T>::reserve(int asize) >{ > detach(); > d->rehash(-qMax(asize, 1)); >} > >template <class Key, class T> >inline typename QHash<Key, T>::const_iterator QHash<Key, T>::find(const Key &akey) const >{ > return const_iterator(*findNode(akey)); >} > >template <class Key, class T> >inline typename QHash<Key, T>::const_iterator QHash<Key, T>::constFind(const Key &akey) const >{ > return const_iterator(*findNode(akey)); >} > >template <class Key, class T> >inline typename QHash<Key, T>::iterator QHash<Key, T>::find(const Key &akey) >{ > detach(); > return iterator(*findNode(akey)); >} > >template <class Key, class T> >inline bool QHash<Key, T>::contains(const Key &akey) const >{ > return *findNode(akey) != e; >} > >template <class Key, class T> > typename QHash<Key, T>::Node **QHash<Key, T>::findNode(const Key &akey, > uint *ahp) const >{ > Node **node; > uint h = 0; > > if (d->numBuckets || ahp) { > h = qHash(akey, d->seed); > if (ahp) > *ahp = h; > } > if (d->numBuckets) { > node = reinterpret_cast<Node **>(&d->buckets[h % d->numBuckets]); > ((!(*node == e || (*node)->next)) ? qt_assert("*node == e || (*node)->next","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h",881) : qt_noop()); > while (*node != e && !(*node)->same_key(h, akey)) > node = &(*node)->next; > } else { > node = const_cast<Node **>(reinterpret_cast<const Node * const *>(&e)); > } > return node; >} > >template <class Key, class T> > bool QHash<Key, T>::operator==(const QHash<Key, T> &other) const >{ > if (size() != other.size()) > return false; > if (d == other.d) > return true; > > const_iterator it = begin(); > > while (it != end()) { > const Key &akey = it.key(); > > const_iterator it2 = other.find(akey); > do { > if (it2 == other.end() || !(it2.key() == akey)) > return false; > if (!QTypeInfo<T>::isDummy && !(it.value() == it2.value())) > return false; > ++it; > ++it2; > } while (it != end() && it.key() == akey); > } > return true; >} > >template <class Key, class T> >class QMultiHash : public QHash<Key, T> >{ >public: > QMultiHash() {} > QMultiHash(const QHash<Key, T> &other) : QHash<Key, T>(other) {} > inline void swap(QMultiHash<Key, T> &other) { QHash<Key, T>::swap(other); } > > inline typename QHash<Key, T>::iterator replace(const Key &key, const T &value) > { return QHash<Key, T>::insert(key, value); } > > inline typename QHash<Key, T>::iterator insert(const Key &key, const T &value) > { return QHash<Key, T>::insertMulti(key, value); } > > inline QMultiHash &operator+=(const QMultiHash &other) > { this->unite(other); return *this; } > inline QMultiHash operator+(const QMultiHash &other) const > { QMultiHash result = *this; result += other; return result; } > > > > using QHash<Key, T>::contains; > using QHash<Key, T>::remove; > using QHash<Key, T>::count; > using QHash<Key, T>::find; > using QHash<Key, T>::constFind; ># 959 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h" > bool contains(const Key &key, const T &value) const; > > int remove(const Key &key, const T &value); > > int count(const Key &key, const T &value) const; > > typename QHash<Key, T>::iterator find(const Key &key, const T &value) { > typename QHash<Key, T>::iterator i(find(key)); > typename QHash<Key, T>::iterator end(this->end()); > while (i != end && i.key() == key) { > if (i.value() == value) > return i; > ++i; > } > return end; > } > typename QHash<Key, T>::const_iterator find(const Key &key, const T &value) const { > typename QHash<Key, T>::const_iterator i(constFind(key)); > typename QHash<Key, T>::const_iterator end(QHash<Key, T>::constEnd()); > while (i != end && i.key() == key) { > if (i.value() == value) > return i; > ++i; > } > return end; > } > typename QHash<Key, T>::const_iterator constFind(const Key &key, const T &value) const > { return find(key, value); } >private: > T &operator[](const Key &key); > const T operator[](const Key &key) const; >}; > >template <class Key, class T> >inline bool QMultiHash<Key, T>::contains(const Key &key, const T &value) const >{ > return constFind(key, value) != QHash<Key, T>::constEnd(); >} > >template <class Key, class T> >inline int QMultiHash<Key, T>::remove(const Key &key, const T &value) >{ > int n = 0; > typename QHash<Key, T>::iterator i(find(key)); > typename QHash<Key, T>::iterator end(QHash<Key, T>::end()); > while (i != end && i.key() == key) { > if (i.value() == value) { > i = this->erase(i); > ++n; > } else { > ++i; > } > } > return n; >} > >template <class Key, class T> >inline int QMultiHash<Key, T>::count(const Key &key, const T &value) const >{ > int n = 0; > typename QHash<Key, T>::const_iterator i(constFind(key)); > typename QHash<Key, T>::const_iterator end(QHash<Key, T>::constEnd()); > while (i != end && i.key() == key) { > if (i.value() == value) > ++n; > ++i; > } > return n; >} > >template <class Key, class T> class QHashIterator { typedef typename QHash<Key,T>::const_iterator const_iterator; typedef const_iterator Item; QHash<Key,T> c; const_iterator i, n; inline bool item_exists() const { return n != c.constEnd(); } public: inline QHashIterator(const QHash<Key,T> &container) : c(container), i(c.constBegin()), n(c.constEnd()) {} inline QHashIterator &operator=(const QHash<Key,T> &container) { c = container; i = c.constBegin(); n = c.constEnd(); return *this; } inline void toFront() { i = c.constBegin(); n = c.constEnd(); } inline void toBack() { i = c.constEnd(); n = c.constEnd(); } inline bool hasNext() const { return i != c.constEnd(); } inline Item next() { n = i++; return n; } inline Item peekNext() const { return i; } inline bool hasPrevious() const { return i != c.constBegin(); } inline Item previous() { n = --i; return n; } inline Item peekPrevious() const { const_iterator p = i; return --p; } inline const T &value() const { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h",1029) : qt_noop()); return *n; } inline const Key &key() const { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h",1029) : qt_noop()); return n.key(); } inline bool findNext(const T &t) { while ((n = i) != c.constEnd()) if (*i++ == t) return true; return false; } inline bool findPrevious(const T &t) { while (i != c.constBegin()) if (*(n = --i) == t) return true; n = c.constEnd(); return false; } }; >template <class Key, class T> class QMutableHashIterator { typedef typename QHash<Key,T>::iterator iterator; typedef typename QHash<Key,T>::const_iterator const_iterator; typedef iterator Item; QHash<Key,T> *c; iterator i, n; inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } public: inline QMutableHashIterator(QHash<Key,T> &container) : c(&container) { c->setSharable(false); i = c->begin(); n = c->end(); } inline ~QMutableHashIterator() { c->setSharable(true); } inline QMutableHashIterator &operator=(QHash<Key,T> &container) { c->setSharable(true); c = &container; c->setSharable(false); i = c->begin(); n = c->end(); return *this; } inline void toFront() { i = c->begin(); n = c->end(); } inline void toBack() { i = c->end(); n = c->end(); } inline bool hasNext() const { return const_iterator(i) != c->constEnd(); } inline Item next() { n = i++; return n; } inline Item peekNext() const { return i; } inline bool hasPrevious() const { return const_iterator(i) != c->constBegin(); } inline Item previous() { n = --i; return n; } inline Item peekPrevious() const { iterator p = i; return --p; } inline void remove() { if (const_iterator(n) != c->constEnd()) { i = c->erase(n); n = c->end(); } } inline void setValue(const T &t) { if (const_iterator(n) != c->constEnd()) *n = t; } inline T &value() { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h",1030) : qt_noop()); return *n; } inline const T &value() const { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h",1030) : qt_noop()); return *n; } inline const Key &key() const { ((!(item_exists())) ? qt_assert("item_exists()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qhash.h",1030) : qt_noop()); return n.key(); } inline bool findNext(const T &t) { while (const_iterator(n = i) != c->constEnd()) if (*i++ == t) return true; return false; } inline bool findPrevious(const T &t) { while (const_iterator(i) != c->constBegin()) if (*(n = --i) == t) return true; n = c->end(); return false; } }; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qhash.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QHash" 2 ># 43 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QSharedPointer" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/qsharedpointer.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qshareddata.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qshareddata.h" 1 ># 45 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qshareddata.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 46 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qshareddata.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 2 ># 47 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qshareddata.h" 2 > > > > > > >template <class T> class QSharedDataPointer; > >class __attribute__((visibility("default"))) QSharedData >{ >public: > mutable QAtomicInt ref; > > inline QSharedData() : ref(0) { } > inline QSharedData(const QSharedData &) : ref(0) { } > >private: > > QSharedData &operator=(const QSharedData &); >}; > >template <class T> class QSharedDataPointer >{ >public: > typedef T Type; > typedef T *pointer; > > inline void detach() { if (d && d->ref.load() != 1) detach_helper(); } > inline T &operator*() { detach(); return *d; } > inline const T &operator*() const { return *d; } > inline T *operator->() { detach(); return d; } > inline const T *operator->() const { return d; } > inline operator T *() { detach(); return d; } > inline operator const T *() const { return d; } > inline T *data() { detach(); return d; } > inline const T *data() const { return d; } > inline const T *constData() const { return d; } > > inline bool operator==(const QSharedDataPointer<T> &other) const { return d == other.d; } > inline bool operator!=(const QSharedDataPointer<T> &other) const { return d != other.d; } > > inline QSharedDataPointer() { d = 0; } > inline ~QSharedDataPointer() { if (d && !d->ref.deref()) delete d; } > > explicit QSharedDataPointer(T *data); > inline QSharedDataPointer(const QSharedDataPointer<T> &o) : d(o.d) { if (d) d->ref.ref(); } > inline QSharedDataPointer<T> & operator=(const QSharedDataPointer<T> &o) { > if (o.d != d) { > if (o.d) > o.d->ref.ref(); > T *old = d; > d = o.d; > if (old && !old->ref.deref()) > delete old; > } > return *this; > } > inline QSharedDataPointer &operator=(T *o) { > if (o != d) { > if (o) > o->ref.ref(); > T *old = d; > d = o; > if (old && !old->ref.deref()) > delete old; > } > return *this; > } > > > > > > > inline bool operator!() const { return !d; } > > inline void swap(QSharedDataPointer &other) > { qSwap(d, other.d); } > >protected: > T *clone(); > >private: > void detach_helper(); > > T *d; >}; > >template <class T> class QExplicitlySharedDataPointer >{ >public: > typedef T Type; > typedef T *pointer; > > inline T &operator*() const { return *d; } > inline T *operator->() { return d; } > inline T *operator->() const { return d; } > inline T *data() const { return d; } > inline const T *constData() const { return d; } > > inline void detach() { if (d && d->ref.load() != 1) detach_helper(); } > > inline void reset() > { > if(d && !d->ref.deref()) > delete d; > > d = 0; > } > > inline operator bool () const { return d != 0; } > > inline bool operator==(const QExplicitlySharedDataPointer<T> &other) const { return d == other.d; } > inline bool operator!=(const QExplicitlySharedDataPointer<T> &other) const { return d != other.d; } > inline bool operator==(const T *ptr) const { return d == ptr; } > inline bool operator!=(const T *ptr) const { return d != ptr; } > > inline QExplicitlySharedDataPointer() { d = 0; } > inline ~QExplicitlySharedDataPointer() { if (d && !d->ref.deref()) delete d; } > > explicit QExplicitlySharedDataPointer(T *data); > inline QExplicitlySharedDataPointer(const QExplicitlySharedDataPointer<T> &o) : d(o.d) { if (d) d->ref.ref(); } > > template<class X> > inline QExplicitlySharedDataPointer(const QExplicitlySharedDataPointer<X> &o) : d(static_cast<T *>(o.data())) > { > if(d) > d->ref.ref(); > } > > inline QExplicitlySharedDataPointer<T> & operator=(const QExplicitlySharedDataPointer<T> &o) { > if (o.d != d) { > if (o.d) > o.d->ref.ref(); > T *old = d; > d = o.d; > if (old && !old->ref.deref()) > delete old; > } > return *this; > } > inline QExplicitlySharedDataPointer &operator=(T *o) { > if (o != d) { > if (o) > o->ref.ref(); > T *old = d; > d = o; > if (old && !old->ref.deref()) > delete old; > } > return *this; > } > > > > > > > inline bool operator!() const { return !d; } > > inline void swap(QExplicitlySharedDataPointer &other) > { qSwap(d, other.d); } > >protected: > T *clone(); > >private: > void detach_helper(); > > T *d; >}; > >template <class T> >inline QSharedDataPointer<T>::QSharedDataPointer(T *adata) : d(adata) >{ if (d) d->ref.ref(); } > >template <class T> >inline T *QSharedDataPointer<T>::clone() >{ > return new T(*d); >} > >template <class T> > void QSharedDataPointer<T>::detach_helper() >{ > T *x = clone(); > x->ref.ref(); > if (!d->ref.deref()) > delete d; > d = x; >} > >template <class T> >inline T *QExplicitlySharedDataPointer<T>::clone() >{ > return new T(*d); >} > >template <class T> > void QExplicitlySharedDataPointer<T>::detach_helper() >{ > T *x = clone(); > x->ref.ref(); > if (!d->ref.deref()) > delete d; > d = x; >} > >template <class T> >inline QExplicitlySharedDataPointer<T>::QExplicitlySharedDataPointer(T *adata) : d(adata) >{ if (d) d->ref.ref(); } > >template <class T> >inline void qSwap(QSharedDataPointer<T> &p1, QSharedDataPointer<T> &p2) >{ p1.swap(p2); } > >template <class T> >inline void qSwap(QExplicitlySharedDataPointer<T> &p1, QExplicitlySharedDataPointer<T> &p2) >{ p1.swap(p2); } > > >namespace std { > template <class T> > inline void swap(::QSharedDataPointer<T> &p1, ::QSharedDataPointer<T> &p2) > { p1.swap(p2); } > > template <class T> > inline void swap(::QExplicitlySharedDataPointer<T> &p1, ::QExplicitlySharedDataPointer<T> &p2) > { p1.swap(p2); } >} > > >template<typename T> class QTypeInfo<QSharedDataPointer<T> > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QSharedDataPointer<T>)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QSharedDataPointer<T>) }; static inline const char *name() { return "QSharedDataPointer<T>"; } }; >template<typename T> class QTypeInfo<QExplicitlySharedDataPointer<T> > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QExplicitlySharedDataPointer<T>)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QExplicitlySharedDataPointer<T>) }; static inline const char *name() { return "QExplicitlySharedDataPointer<T>"; } }; > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qshareddata.h" 2 ># 48 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer.h" 2 > > ># 1 "../../../../qt5/qtbase/include/QtCore/qsharedpointer_impl.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" 1 ># 61 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 1 ># 1 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 1 ># 42 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" ># 1 "../../../../qt5/qtbase/include/QtCore/qglobal.h" 1 ># 43 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/thread/qatomic.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qatomic.h" 2 ># 62 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qobject.h" 1 ># 63 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qhash.h" 1 ># 64 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" 2 > > > > ># 79 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" >template<typename T> inline void qt_sharedpointer_cast_check(T *) { } > > > > > > > >template <class T> class QWeakPointer; >template <class T> class QSharedPointer; > >template <class X, class T> >QSharedPointer<X> qSharedPointerCast(const QSharedPointer<T> &ptr); >template <class X, class T> >QSharedPointer<X> qSharedPointerDynamicCast(const QSharedPointer<T> &ptr); >template <class X, class T> >QSharedPointer<X> qSharedPointerConstCast(const QSharedPointer<T> &ptr); > > >template <class X, class T> >QSharedPointer<X> qSharedPointerObjectCast(const QSharedPointer<T> &ptr); > > >namespace QtSharedPointer { > template <class T> class ExternalRefCount; > > template <class X, class Y> QSharedPointer<X> copyAndSetPointer(X * ptr, const QSharedPointer<Y> &src); > > > __attribute__((visibility("default"))) void internalSafetyCheckAdd(const void *, const volatile void *); > __attribute__((visibility("default"))) void internalSafetyCheckRemove(const void *); > > template <class T, typename Klass, typename RetVal> > inline void executeDeleter(T *t, RetVal (Klass:: *memberDeleter)()) > { (t->*memberDeleter)(); } > template <class T, typename Deleter> > inline void executeDeleter(T *t, Deleter d) > { d(t); } > struct NormalDeleter {}; > > > template <class T> struct RemovePointer; > template <class T> struct RemovePointer<T *> { typedef T Type; }; > template <class T> struct RemovePointer<QSharedPointer<T> > { typedef T Type; }; > template <class T> struct RemovePointer<QWeakPointer<T> > { typedef T Type; }; ># 135 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" > struct ExternalRefCountData > { > typedef void (*DestroyerFn)(ExternalRefCountData *); > QBasicAtomicInt weakref; > QBasicAtomicInt strongref; > DestroyerFn destroyer; > > inline ExternalRefCountData(DestroyerFn d) > : destroyer(d) > { > strongref.store(1); > weakref.store(1); > } > inline ExternalRefCountData(Qt::Initialization) { } > ~ExternalRefCountData() { ((!(!weakref.load())) ? qt_assert("!weakref.load()","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h",149) : qt_noop()); ((!(strongref.load() <= 0)) ? qt_assert("strongref.load() <= 0","../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h",149) : qt_noop()); } > > void destroy() { destroyer(this); } > > > __attribute__((visibility("default"))) static ExternalRefCountData *getAndRef(const QObject *); > __attribute__((visibility("default"))) void setQObjectShared(const QObject *, bool enable); > __attribute__((visibility("default"))) void checkQObjectShared(const QObject *); > > inline void checkQObjectShared(...) { } > inline void setQObjectShared(...) { } > > inline void operator delete(void *ptr) { ::operator delete(ptr); } > inline void operator delete(void *, void *) { } > }; > > > template <class T, typename Deleter> > struct CustomDeleter > { > Deleter deleter; > T *ptr; > > CustomDeleter(T *p, Deleter d) : deleter(d), ptr(p) {} > void execute() { executeDeleter(ptr, deleter); } > }; ># 183 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" > template <class T> > struct CustomDeleter<T, NormalDeleter> > { > T *ptr; > > CustomDeleter(T *p, NormalDeleter) : ptr(p) {} > void execute() { delete ptr; } > }; > > > > > > > template <class T, typename Deleter> > struct ExternalRefCountWithCustomDeleter: public ExternalRefCountData > { > typedef ExternalRefCountWithCustomDeleter Self; > typedef ExternalRefCountData BaseClass; > CustomDeleter<T, Deleter> extra; > > static inline void deleter(ExternalRefCountData *self) > { > Self *realself = static_cast<Self *>(self); > realself->extra.execute(); > > > realself->extra.~CustomDeleter(); > } > static void safetyCheckDeleter(ExternalRefCountData *self) > { > internalSafetyCheckRemove(self); > deleter(self); > } > > static inline Self *create(T *ptr, Deleter userDeleter) > { > > > > DestroyerFn destroy = &deleter; > > Self *d = static_cast<Self *>(::operator new(sizeof(Self))); > > > new (&d->extra) CustomDeleter<T, Deleter>(ptr, userDeleter); > new (d) BaseClass(destroy); > > return d; > } > private: > > ExternalRefCountWithCustomDeleter() ; > ~ExternalRefCountWithCustomDeleter() ; > ExternalRefCountWithCustomDeleter(const ExternalRefCountWithCustomDeleter &) ; ExternalRefCountWithCustomDeleter &operator=(const ExternalRefCountWithCustomDeleter &) ; > }; > > > > > > template <class T> > struct ExternalRefCountWithContiguousData: public ExternalRefCountData > { > typedef ExternalRefCountData Parent; > T data; > > static void deleter(ExternalRefCountData *self) > { > ExternalRefCountWithContiguousData *that = > static_cast<ExternalRefCountWithContiguousData *>(self); > that->data.~T(); > } > static void safetyCheckDeleter(ExternalRefCountData *self) > { > internalSafetyCheckRemove(self); > deleter(self); > } > > static inline ExternalRefCountData *create(T **ptr) > { > > > > DestroyerFn destroy = &deleter; > > ExternalRefCountWithContiguousData *d = > static_cast<ExternalRefCountWithContiguousData *>(::operator new(sizeof(ExternalRefCountWithContiguousData))); > > > > new (d) Parent(destroy); > > *ptr = &d->data; > return d; > } > > private: > > ExternalRefCountWithContiguousData() ; > ~ExternalRefCountWithContiguousData() ; > ExternalRefCountWithContiguousData(const ExternalRefCountWithContiguousData &) ; ExternalRefCountWithContiguousData &operator=(const ExternalRefCountWithContiguousData &) ; > }; >} > >template <class T> class QSharedPointer >{ > typedef T *QSharedPointer:: *RestrictedBool; > typedef QtSharedPointer::ExternalRefCountData Data; >public: > typedef T Type; > typedef T element_type; > typedef T value_type; > typedef value_type *pointer; > typedef const value_type *const_pointer; > typedef value_type &reference; > typedef const value_type &const_reference; > typedef qptrdiff difference_type; > > inline T *data() const { return value; } > inline bool isNull() const { return !data(); } > inline operator RestrictedBool() const { return isNull() ? 0 : &QSharedPointer::value; } > inline bool operator !() const { return isNull(); } > inline T &operator*() const { return *data(); } > inline T *operator->() const { return data(); } > > QSharedPointer() : value(0), d(0) { } > ~QSharedPointer() { deref(); } > > inline explicit QSharedPointer(T *ptr) : value(ptr) > { internalConstruct(ptr, QtSharedPointer::NormalDeleter()); } > > template <typename Deleter> > inline QSharedPointer(T *ptr, Deleter deleter) : value(ptr) > { internalConstruct(ptr, deleter); } > > inline QSharedPointer(const QSharedPointer<T> &other) : value(other.value), d(other.d) > { if (d) ref(); } > inline QSharedPointer<T> &operator=(const QSharedPointer<T> &other) > { > QSharedPointer copy(other); > swap(copy); > return *this; > } ># 335 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" > template <class X> > inline QSharedPointer(const QSharedPointer<X> &other) : value(other.value), d(other.d) > { if (d) ref(); } > > template <class X> > inline QSharedPointer<T> &operator=(const QSharedPointer<X> &other) > { > qt_sharedpointer_cast_check<T>(static_cast<X *>(0)); > internalCopy(other); > return *this; > } > > template <class X> > inline QSharedPointer(const QWeakPointer<X> &other) : value(0), d(0) > { *this = other; } > > template <class X> > inline QSharedPointer<T> &operator=(const QWeakPointer<X> &other) > { internalSet(other.d, other.value); return *this; } > > inline void swap(QSharedPointer &other) > { QSharedPointer<T>::internalSwap(other); } > > inline void reset() { clear(); } > inline void reset(T *t) > { QSharedPointer copy(t); swap(copy); } > template <typename Deleter> > inline void reset(T *t, Deleter deleter) > { QSharedPointer copy(t, deleter); swap(copy); } > > template <class X> > QSharedPointer<X> staticCast() const > { > return qSharedPointerCast<X, T>(*this); > } > > template <class X> > QSharedPointer<X> dynamicCast() const > { > return qSharedPointerDynamicCast<X, T>(*this); > } > > template <class X> > QSharedPointer<X> constCast() const > { > return qSharedPointerConstCast<X, T>(*this); > } > > > template <class X> > QSharedPointer<X> objectCast() const > { > return qSharedPointerObjectCast<X, T>(*this); > } > > > inline void clear() { QSharedPointer copy; swap(copy); } > > QWeakPointer<T> toWeakRef() const; ># 408 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer_impl.h" > static inline QSharedPointer<T> create() > { > QSharedPointer<T> result(Qt::Uninitialized); > result.d = QtSharedPointer::ExternalRefCountWithContiguousData<T>::create(&result.value); > > > new (result.data()) T(); > result.internalFinishConstruction(result.data()); > return result; > } > > >private: > explicit QSharedPointer(Qt::Initialization) {} > > inline void deref() > { deref(d); } > static inline void deref(Data *d) > { > if (!d) return; > if (!d->strongref.deref()) { > d->destroy(); > } > if (!d->weakref.deref()) > delete d; > } > > template <typename Deleter> > inline void internalConstruct(T *ptr, Deleter deleter) > { > if (ptr) > d = QtSharedPointer::ExternalRefCountWithCustomDeleter<T, Deleter>::create(ptr, deleter); > else > d = 0; > internalFinishConstruction(ptr); > } > > inline void internalFinishConstruction(T *ptr) > { > d->setQObjectShared(ptr, true); > > > > } > > template <class X> > inline void internalCopy(const QSharedPointer<X> &other) > { > Data *o = other.d; > T *actual = other.value; > if (o) > other.ref(); > qSwap(d, o); > qSwap(this->value, actual); > deref(o); > } > > inline void internalSwap(QSharedPointer &other) > { > qSwap(d, other.d); > qSwap(this->value, other.value); > } > > > > > template <class X> friend class QSharedPointer; > template <class X> friend class QWeakPointer; > template <class X, class Y> friend QSharedPointer<X> QtSharedPointer::copyAndSetPointer(X * ptr, const QSharedPointer<Y> &src); > > inline void ref() const { d->weakref.ref(); d->strongref.ref(); } > > inline void internalSet(Data *o, T *actual) > { > if (o) { > > > register int tmp = o->strongref.load(); > while (tmp > 0) { > > if (o->strongref.testAndSetRelaxed(tmp, tmp + 1)) > break; > tmp = o->strongref.load(); > } > > if (tmp > 0) { > o->weakref.ref(); > } else { > o->checkQObjectShared(actual); > o = 0; > } > } > > qSwap(d, o); > qSwap(this->value, actual); > if (!d || d->strongref.load() == 0) > this->value = 0; > > > deref(o); > } > > Type *value; > Data *d; >}; > >template <class T> >class QWeakPointer >{ > typedef T *QWeakPointer:: *RestrictedBool; > typedef QtSharedPointer::ExternalRefCountData Data; > >public: > typedef T element_type; > typedef T value_type; > typedef value_type *pointer; > typedef const value_type *const_pointer; > typedef value_type &reference; > typedef const value_type &const_reference; > typedef qptrdiff difference_type; > > inline bool isNull() const { return d == 0 || d->strongref.load() == 0 || value == 0; } > inline operator RestrictedBool() const { return isNull() ? 0 : &QWeakPointer::value; } > inline bool operator !() const { return isNull(); } > inline T *data() const { return d == 0 || d->strongref.load() == 0 ? 0 : value; } > > inline QWeakPointer() : d(0), value(0) { } > inline ~QWeakPointer() { if (d && !d->weakref.deref()) delete d; } > > > > template <class X> > inline QWeakPointer(X *ptr) : d(ptr ? d->getAndRef(ptr) : 0), value(ptr) > { } > > template <class X> > inline QWeakPointer &operator=(X *ptr) > { return *this = QWeakPointer(ptr); } > > inline QWeakPointer(const QWeakPointer<T> &o) : d(o.d), value(o.value) > { if (d) d->weakref.ref(); } > inline QWeakPointer<T> &operator=(const QWeakPointer<T> &o) > { > internalSet(o.d, o.value); > return *this; > } > > inline QWeakPointer(const QSharedPointer<T> &o) : d(o.d), value(o.data()) > { if (d) d->weakref.ref();} > inline QWeakPointer<T> &operator=(const QSharedPointer<T> &o) > { > internalSet(o.d, o.value); > return *this; > } > > template <class X> > inline QWeakPointer(const QWeakPointer<X> &o) : d(0), value(0) > { *this = o; } > > template <class X> > inline QWeakPointer<T> &operator=(const QWeakPointer<X> &o) > { > > > *this = o.toStrongRef(); > return *this; > } > > template <class X> > inline bool operator==(const QWeakPointer<X> &o) const > { return d == o.d && value == static_cast<const T *>(o.value); } > > template <class X> > inline bool operator!=(const QWeakPointer<X> &o) const > { return !(*this == o); } > > template <class X> > inline QWeakPointer(const QSharedPointer<X> &o) : d(0), value(0) > { *this = o; } > > template <class X> > inline QWeakPointer<T> &operator=(const QSharedPointer<X> &o) > { > qt_sharedpointer_cast_check<T>(static_cast<X *>(0)); > internalSet(o.d, o.data()); > return *this; > } > > template <class X> > inline bool operator==(const QSharedPointer<X> &o) const > { return d == o.d; } > > template <class X> > inline bool operator!=(const QSharedPointer<X> &o) const > { return !(*this == o); } > > inline void clear() { *this = QWeakPointer<T>(); } > > inline QSharedPointer<T> toStrongRef() const { return QSharedPointer<T>(*this); } > > > > > >private: > > > > > template <class X> friend class QSharedPointer; > > > inline void internalSet(Data *o, T *actual) > { > if (d == o) return; > if (o) > o->weakref.ref(); > if (d && !d->weakref.deref()) > delete d; > d = o; > value = actual; > } > > Data *d; > T *value; >}; > > > > >template <class T, class X> >bool operator==(const QSharedPointer<T> &ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1.data() == ptr2.data(); >} >template <class T, class X> >bool operator!=(const QSharedPointer<T> &ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1.data() != ptr2.data(); >} > >template <class T, class X> >bool operator==(const QSharedPointer<T> &ptr1, const X *ptr2) >{ > return ptr1.data() == ptr2; >} >template <class T, class X> >bool operator==(const T *ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1 == ptr2.data(); >} >template <class T, class X> >bool operator!=(const QSharedPointer<T> &ptr1, const X *ptr2) >{ > return !(ptr1 == ptr2); >} >template <class T, class X> >bool operator!=(const T *ptr1, const QSharedPointer<X> &ptr2) >{ > return !(ptr2 == ptr1); >} > >template <class T, class X> >bool operator==(const QSharedPointer<T> &ptr1, const QWeakPointer<X> &ptr2) >{ > return ptr2 == ptr1; >} >template <class T, class X> >bool operator!=(const QSharedPointer<T> &ptr1, const QWeakPointer<X> &ptr2) >{ > return ptr2 != ptr1; >} > > > > >template <class T, class X> >inline typename QSharedPointer<T>::difference_type operator-(const QSharedPointer<T> &ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1.data() - ptr2.data(); >} >template <class T, class X> >inline typename QSharedPointer<T>::difference_type operator-(const QSharedPointer<T> &ptr1, X *ptr2) >{ > return ptr1.data() - ptr2; >} >template <class T, class X> >inline typename QSharedPointer<X>::difference_type operator-(T *ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1 - ptr2.data(); >} > > > > >template <class T, class X> >inline bool operator<(const QSharedPointer<T> &ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1.data() < ptr2.data(); >} >template <class T, class X> >inline bool operator<(const QSharedPointer<T> &ptr1, X *ptr2) >{ > return ptr1.data() < ptr2; >} >template <class T, class X> >inline bool operator<(T *ptr1, const QSharedPointer<X> &ptr2) >{ > return ptr1 < ptr2.data(); >} > > > > >template <class T> >inline uint qHash(const QSharedPointer<T> &ptr, uint seed = 0) >{ > return ::qHash(ptr.data(), seed); >} > > >template <class T> >inline QWeakPointer<T> QSharedPointer<T>::toWeakRef() const >{ > return QWeakPointer<T>(*this); >} > >template <class T> >inline void qSwap(QSharedPointer<T> &p1, QSharedPointer<T> &p2) >{ > p1.swap(p2); >} > > >namespace std { > template <class T> > inline void swap(::QSharedPointer<T> &p1, ::QSharedPointer<T> &p2) > { p1.swap(p2); } >} > > >namespace QtSharedPointer { > > template <class X, class T> > inline QSharedPointer<X> copyAndSetPointer(X *ptr, const QSharedPointer<T> &src) > { > QSharedPointer<X> result; > result.internalSet(src.d, ptr); > return result; > } >} > > >template <class X, class T> >inline QSharedPointer<X> qSharedPointerCast(const QSharedPointer<T> &src) >{ > register X *ptr = static_cast<X *>(src.data()); > return QtSharedPointer::copyAndSetPointer(ptr, src); >} >template <class X, class T> >inline QSharedPointer<X> qSharedPointerCast(const QWeakPointer<T> &src) >{ > return qSharedPointerCast<X, T>(src.toStrongRef()); >} > >template <class X, class T> >inline QSharedPointer<X> qSharedPointerDynamicCast(const QSharedPointer<T> &src) >{ > register X *ptr = dynamic_cast<X *>(src.data()); > return QtSharedPointer::copyAndSetPointer(ptr, src); >} >template <class X, class T> >inline QSharedPointer<X> qSharedPointerDynamicCast(const QWeakPointer<T> &src) >{ > return qSharedPointerDynamicCast<X, T>(src.toStrongRef()); >} > >template <class X, class T> >inline QSharedPointer<X> qSharedPointerConstCast(const QSharedPointer<T> &src) >{ > register X *ptr = const_cast<X *>(src.data()); > return QtSharedPointer::copyAndSetPointer(ptr, src); >} >template <class X, class T> >inline QSharedPointer<X> qSharedPointerConstCast(const QWeakPointer<T> &src) >{ > return qSharedPointerConstCast<X, T>(src.toStrongRef()); >} > >template <class X, class T> >inline >QWeakPointer<X> qWeakPointerCast(const QSharedPointer<T> &src) >{ > return qSharedPointerCast<X, T>(src).toWeakRef(); >} > > >template <class X, class T> >inline QSharedPointer<X> qSharedPointerObjectCast(const QSharedPointer<T> &src) >{ > register X *ptr = qobject_cast<X *>(src.data()); > return QtSharedPointer::copyAndSetPointer(ptr, src); >} >template <class X, class T> >inline QSharedPointer<X> qSharedPointerObjectCast(const QWeakPointer<T> &src) >{ > return qSharedPointerObjectCast<X>(src.toStrongRef()); >} > >template <class X, class T> >inline QSharedPointer<typename QtSharedPointer::RemovePointer<X>::Type> >qobject_cast(const QSharedPointer<T> &src) >{ > return qSharedPointerObjectCast<typename QtSharedPointer::RemovePointer<X>::Type, T>(src); >} >template <class X, class T> >inline QSharedPointer<typename QtSharedPointer::RemovePointer<X>::Type> >qobject_cast(const QWeakPointer<T> &src) >{ > return qSharedPointerObjectCast<typename QtSharedPointer::RemovePointer<X>::Type, T>(src); >} > > > >template<typename T> class QTypeInfo<QWeakPointer<T> > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QWeakPointer<T>)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QWeakPointer<T>) }; static inline const char *name() { return "QWeakPointer<T>"; } }; >template<typename T> class QTypeInfo<QSharedPointer<T> > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QSharedPointer<T>)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QSharedPointer<T>) }; static inline const char *name() { return "QSharedPointer<T>"; } }; > > > > > ># 1 "../../../../qt5/qtbase/include/QtCore/qsharedpointer_impl.h" 2 ># 51 "../../../../qt5/qtbase/include/QtCore/../../../../../../src/qt/qt5/qtbase/src/corelib/tools/qsharedpointer.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/qsharedpointer.h" 2 ># 1 "../../../../qt5/qtbase/include/QtCore/QSharedPointer" 2 ># 44 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.h" 2 > >namespace LanguageUtils { > >class __attribute__((visibility("protected"))) FakeMetaEnum { > QString m_name; > QStringList m_keys; > QList<int> m_values; > >public: > FakeMetaEnum(); > explicit FakeMetaEnum(const QString &name); > > bool isValid() const; > > QString name() const; > void setName(const QString &name); > > void addKey(const QString &key, int value); > QString key(int index) const; > int keyCount() const; > QStringList keys() const; > bool hasKey(const QString &key) const; >}; > >class __attribute__((visibility("protected"))) FakeMetaMethod { >public: > enum { > Signal, > Slot, > Method > }; > > enum { > Private, > Protected, > Public > }; > >public: > FakeMetaMethod(); > explicit FakeMetaMethod(const QString &name, const QString &returnType = QString()); > > QString methodName() const; > void setMethodName(const QString &name); > > void setReturnType(const QString &type); > > QStringList parameterNames() const; > QStringList parameterTypes() const; > void addParameter(const QString &name, const QString &type); > > int methodType() const; > void setMethodType(int methodType); > > int access() const; > > int revision() const; > void setRevision(int r); > >private: > QString m_name; > QString m_returnType; > QStringList m_paramNames; > QStringList m_paramTypes; > int m_methodTy; > int m_methodAccess; > int m_revision; >}; > >class __attribute__((visibility("protected"))) FakeMetaProperty { > QString m_propertyName; > QString m_type; > bool m_isList; > bool m_isWritable; > bool m_isPointer; > int m_revision; > >public: > FakeMetaProperty(const QString &name, const QString &type, bool isList, bool isWritable, bool isPointer, int revision); > > QString name() const; > QString typeName() const; > > bool isList() const; > bool isWritable() const; > bool isPointer() const; > int revision() const; >}; > >class __attribute__((visibility("protected"))) FakeMetaObject { > FakeMetaObject(const FakeMetaObject &) ; FakeMetaObject &operator=(const FakeMetaObject &) ;; > >public: > typedef QSharedPointer<FakeMetaObject> Ptr; > typedef QSharedPointer<const FakeMetaObject> ConstPtr; > > class __attribute__((visibility("protected"))) Export { > public: > Export(); > > QString package; > QString type; > ComponentVersion version; > int metaObjectRevision; > > bool isValid() const; > }; > >private: > QString m_className; > QList<Export> m_exports; > QString m_superName; > QList<FakeMetaEnum> m_enums; > QHash<QString, int> m_enumNameToIndex; > QList<FakeMetaProperty> m_props; > QHash<QString, int> m_propNameToIdx; > QList<FakeMetaMethod> m_methods; > QString m_defaultPropertyName; > QString m_attachedTypeName; > >public: > FakeMetaObject(); > > QString className() const; > void setClassName(const QString &name); > > void addExport(const QString &name, const QString &package, ComponentVersion version); > void setExportMetaObjectRevision(int exportIndex, int metaObjectRevision); > QList<Export> exports() const; > Export exportInPackage(const QString &package) const; > > void setSuperclassName(const QString &superclass); > QString superclassName() const; > > void addEnum(const FakeMetaEnum &fakeEnum); > int enumeratorCount() const; > int enumeratorOffset() const; > FakeMetaEnum enumerator(int index) const; > int enumeratorIndex(const QString &name) const; > > void addProperty(const FakeMetaProperty &property); > int propertyCount() const; > int propertyOffset() const; > FakeMetaProperty property(int index) const; > int propertyIndex(const QString &name) const; > > void addMethod(const FakeMetaMethod &method); > int methodCount() const; > int methodOffset() const; > FakeMetaMethod method(int index) const; > > QString defaultPropertyName() const; > void setDefaultPropertyName(const QString &defaultPropertyName); > > QString attachedTypeName() const; > void setAttachedTypeName(const QString &name); >}; > >} ># 34 "../../../../../../src/qt/creator/src/libs/languageutils/fakemetaobject.cpp" 2 > >using namespace LanguageUtils; > >FakeMetaEnum::FakeMetaEnum() >{} > >FakeMetaEnum::FakeMetaEnum(const QString &name) > : m_name(name) >{} > >bool FakeMetaEnum::isValid() const >{ return !m_name.isEmpty(); } > >QString FakeMetaEnum::name() const >{ return m_name; } > >void FakeMetaEnum::setName(const QString &name) >{ m_name = name; } > >void FakeMetaEnum::addKey(const QString &key, int value) >{ m_keys.append(key); m_values.append(value); } > >QString FakeMetaEnum::key(int index) const >{ return m_keys.at(index); } > >int FakeMetaEnum::keyCount() const >{ return m_keys.size(); } > >QStringList FakeMetaEnum::keys() const >{ return m_keys; } > >bool FakeMetaEnum::hasKey(const QString &key) const >{ return m_keys.contains(key); } > >FakeMetaMethod::FakeMetaMethod(const QString &name, const QString &returnType) > : m_name(name) > , m_returnType(returnType) > , m_methodTy(FakeMetaMethod::Method) > , m_methodAccess(FakeMetaMethod::Public) > , m_revision(0) >{} > >FakeMetaMethod::FakeMetaMethod() > : m_methodTy(FakeMetaMethod::Method) > , m_methodAccess(FakeMetaMethod::Public) > , m_revision(0) >{} > >QString FakeMetaMethod::methodName() const >{ return m_name; } > >void FakeMetaMethod::setMethodName(const QString &name) >{ m_name = name; } > >void FakeMetaMethod::setReturnType(const QString &type) >{ m_returnType = type; } > >QStringList FakeMetaMethod::parameterNames() const >{ return m_paramNames; } > >QStringList FakeMetaMethod::parameterTypes() const >{ return m_paramTypes; } > >void FakeMetaMethod::addParameter(const QString &name, const QString &type) >{ m_paramNames.append(name); m_paramTypes.append(type); } > >int FakeMetaMethod::methodType() const >{ return m_methodTy; } > >void FakeMetaMethod::setMethodType(int methodType) >{ m_methodTy = methodType; } > >int FakeMetaMethod::access() const >{ return m_methodAccess; } > >int FakeMetaMethod::revision() const >{ return m_revision; } > >void FakeMetaMethod::setRevision(int r) >{ m_revision = r; } > > >FakeMetaProperty::FakeMetaProperty(const QString &name, const QString &type, bool isList, > bool isWritable, bool isPointer, int revision) > : m_propertyName(name) > , m_type(type) > , m_isList(isList) > , m_isWritable(isWritable) > , m_isPointer(isPointer) > , m_revision(revision) >{} > >QString FakeMetaProperty::name() const >{ return m_propertyName; } > >QString FakeMetaProperty::typeName() const >{ return m_type; } > >bool FakeMetaProperty::isList() const >{ return m_isList; } > >bool FakeMetaProperty::isWritable() const >{ return m_isWritable; } > >bool FakeMetaProperty::isPointer() const >{ return m_isPointer; } > >int FakeMetaProperty::revision() const >{ return m_revision; } > > >FakeMetaObject::FakeMetaObject() >{ >} > >QString FakeMetaObject::className() const >{ return m_className; } >void FakeMetaObject::setClassName(const QString &name) >{ m_className = name; } > >void FakeMetaObject::addExport(const QString &name, const QString &package, ComponentVersion version) >{ > Export exp; > exp.type = name; > exp.package = package; > exp.version = version; > m_exports.append(exp); >} > >void FakeMetaObject::setExportMetaObjectRevision(int exportIndex, int metaObjectRevision) >{ > m_exports[exportIndex].metaObjectRevision = metaObjectRevision; >} > >QList<FakeMetaObject::Export> FakeMetaObject::exports() const >{ return m_exports; } >FakeMetaObject::Export FakeMetaObject::exportInPackage(const QString &package) const >{ > for (QForeachContainer<__typeof__(m_exports)> _container_(m_exports); !_container_.brk && _container_.i != _container_.e; __extension__ ({ ++_container_.brk; ++_container_.i; })) for (const Export &exp = *_container_.i;; __extension__ ({--_container_.brk; break;})) { > if (exp.package == package) > return exp; > } > return Export(); >} > >void FakeMetaObject::setSuperclassName(const QString &superclass) >{ m_superName = superclass; } >QString FakeMetaObject::superclassName() const >{ return m_superName; } > >void FakeMetaObject::addEnum(const FakeMetaEnum &fakeEnum) >{ m_enumNameToIndex.insert(fakeEnum.name(), m_enums.size()); m_enums.append(fakeEnum); } >int FakeMetaObject::enumeratorCount() const >{ return m_enums.size(); } >int FakeMetaObject::enumeratorOffset() const >{ return 0; } >FakeMetaEnum FakeMetaObject::enumerator(int index) const >{ return m_enums.at(index); } >int FakeMetaObject::enumeratorIndex(const QString &name) const >{ return m_enumNameToIndex.value(name, -1); } > >void FakeMetaObject::addProperty(const FakeMetaProperty &property) >{ m_propNameToIdx.insert(property.name(), m_props.size()); m_props.append(property); } >int FakeMetaObject::propertyCount() const >{ return m_props.size(); } >int FakeMetaObject::propertyOffset() const >{ return 0; } >FakeMetaProperty FakeMetaObject::property(int index) const >{ return m_props.at(index); } >int FakeMetaObject::propertyIndex(const QString &name) const >{ return m_propNameToIdx.value(name, -1); } > >void FakeMetaObject::addMethod(const FakeMetaMethod &method) >{ m_methods.append(method); } >int FakeMetaObject::methodCount() const >{ return m_methods.size(); } >int FakeMetaObject::methodOffset() const >{ return 0; } >FakeMetaMethod FakeMetaObject::method(int index) const >{ return m_methods.at(index); } > >QString FakeMetaObject::defaultPropertyName() const >{ return m_defaultPropertyName; } >void FakeMetaObject::setDefaultPropertyName(const QString &defaultPropertyName) >{ m_defaultPropertyName = defaultPropertyName; } > >QString FakeMetaObject::attachedTypeName() const >{ return m_attachedTypeName; } >void FakeMetaObject::setAttachedTypeName(const QString &name) >{ m_attachedTypeName = name; } > >FakeMetaObject::Export::Export() > : metaObjectRevision(0) >{} >bool FakeMetaObject::Export::isValid() const >{ return version.isValid() || !package.isEmpty() || !type.isEmpty(); }
You cannot view the attachment while viewing its details because your browser does not support IFRAMEs.
View the attachment on a separate page
.
View Attachment As Raw
Actions:
View
Attachments on
bug 829247
:
589811
| 589813