Attachment 576479 Details for Bug 811237 – /tmp/ccOFQh1s.out

/tmp/ccOFQh1s.out

ccOFQh1s.out (text/x-csrc), 1.41 MB, created by Karel Volný on 2012-04-10 14:03:15 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Karel Volný

Created: 2012-04-10 14:03:15 UTC

Size: 1.41 MB

patch

obsolete

>// /usr/libexec/gcc/x86_64-redhat-linux/4.7.0/cc1plus -fpreprocessed /tmp/ccache/tmp/decoder_ff.tmp.kvolny.usersys.redhat.com.30026.ii -quiet -dumpbase decoder_ff.tmp.kvolny.usersys.redhat.com.30026.ii -m64 -mtune=generic -march=x86-64 -auxbase-strip /tmp/ccache/9/e/b7154411ac91d60d333b43ce4d1bcc-1481616.o.tmp.kvolny.usersys.redhat.com.30026 -g -O2 -Wall -fexceptions -fstack-protector -fPIC --param ssp-buffer-size=4 -o - -frandom-seed=0
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp"
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg//"
># 1 "<command-line>"
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp"
># 21 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp"
># 1 "/usr/include/QtCore/QObject" 1
># 1 "/usr/include/QtCore/qobject.h" 1
># 47 "/usr/include/QtCore/qobject.h"
># 1 "/usr/include/QtCore/qobjectdefs.h" 1 3 4
># 45 "/usr/include/QtCore/qobjectdefs.h" 3 4
># 1 "/usr/include/QtCore/qnamespace.h" 1 3 4
># 45 "/usr/include/QtCore/qnamespace.h" 3 4
># 1 "/usr/include/QtCore/qglobal.h" 1 3 4
># 45 "/usr/include/QtCore/qglobal.h" 3 4
># 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 "/usr/include/QtCore/qglobal.h" 2 3 4
># 62 "/usr/include/QtCore/qglobal.h" 3 4
># 1 "/usr/include/QtCore/qconfig.h" 1 3 4
>
>
>
>
>
>
>
># 1 "/usr/include/QtCore/qconfig-x86_64.h" 1 3 4
># 9 "/usr/include/QtCore/qconfig.h" 2 3 4
># 63 "/usr/include/QtCore/qglobal.h" 2 3 4
>
>
>
>
>
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 1 3 4
># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/algorithm" 3 4
># 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
># 363 "/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
># 364 "/usr/include/features.h" 2 3 4
># 387 "/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
># 388 "/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;
># 135 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h" 3
>      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 long
>  __lg(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); }
># 1009 "/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));
>    }
># 1041 "/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;
>    }
># 1072 "/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));
>    }
># 1106 "/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;
>    }
># 1146 "/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);
>    }
># 1183 "/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 () __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern double atof (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern int atoi (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern long int atol (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>__extension__ extern long long int atoll (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern double strtod (__const char *__restrict __nptr,
>        char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern float strtof (__const char *__restrict __nptr,
>       char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern long double strtold (__const char *__restrict __nptr,
>       char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern long int strtol (__const char *__restrict __nptr,
>   char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern unsigned long int strtoul (__const char *__restrict __nptr,
>      char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>__extension__
>extern long long int strtoq (__const char *__restrict __nptr,
>        char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>__extension__
>extern unsigned long long int strtouq (__const char *__restrict __nptr,
>           char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>__extension__
>extern long long int strtoll (__const char *__restrict __nptr,
>         char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>__extension__
>extern unsigned long long int strtoull (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 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))) __attribute__ ((__warn_unused_result__));
>
>extern unsigned long int strtoul_l (__const char *__restrict __nptr,
>        char **__restrict __endptr,
>        int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) __attribute__ ((__warn_unused_result__));
>
>__extension__
>extern long long int strtoll_l (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __base,
>    __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) __attribute__ ((__warn_unused_result__));
>
>__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))) __attribute__ ((__warn_unused_result__));
>
>extern double strtod_l (__const char *__restrict __nptr,
>   char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) __attribute__ ((__warn_unused_result__));
>
>extern float strtof_l (__const char *__restrict __nptr,
>         char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) __attribute__ ((__warn_unused_result__));
>
>extern long double strtold_l (__const char *__restrict __nptr,
>         char **__restrict __endptr,
>         __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>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 () __attribute__ ((__warn_unused_result__));
>
>
>extern long int a64l (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
># 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);
>
>
>
>
>
># 1 "/usr/include/bits/select2.h" 1 3 4
># 25 "/usr/include/bits/select2.h" 3 4
>extern unsigned long int __fdelt_chk (unsigned long int __d);
>extern unsigned long int __fdelt_warn (unsigned long int __d)
>  __attribute__((__warning__ ("bit outside of fd_set selected")));
># 130 "/usr/include/sys/select.h" 2 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)));
># 471 "/usr/include/stdlib.h" 3 4
>extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) __attribute__ ((__warn_unused_result__));
>
>extern void *calloc (size_t __nmemb, size_t __size)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__warn_unused_result__));
># 485 "/usr/include/stdlib.h" 3 4
>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__)) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>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)));
># 536 "/usr/include/stdlib.h" 3 4
>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))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern char *__secure_getenv (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>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))) __attribute__ ((__warn_unused_result__));
># 620 "/usr/include/stdlib.h" 3 4
>extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 630 "/usr/include/stdlib.h" 3 4
>extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 642 "/usr/include/stdlib.h" 3 4
>extern int mkstemps (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 652 "/usr/include/stdlib.h" 3 4
>extern int mkstemps64 (char *__template, int __suffixlen)
>     __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 663 "/usr/include/stdlib.h" 3 4
>extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 674 "/usr/include/stdlib.h" 3 4
>extern int mkostemp (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 684 "/usr/include/stdlib.h" 3 4
>extern int mkostemp64 (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 694 "/usr/include/stdlib.h" 3 4
>extern int mkostemps (char *__template, int __suffixlen, int __flags)
>     __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 706 "/usr/include/stdlib.h" 3 4
>extern int mkostemps64 (char *__template, int __suffixlen, int __flags)
>     __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 717 "/usr/include/stdlib.h" 3 4
>extern int system (__const char *__command) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>extern char *canonicalize_file_name (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 734 "/usr/include/stdlib.h" 3 4
>extern char *realpath (__const char *__restrict __name,
>         char *__restrict __resolved) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>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))) __attribute__ ((__warn_unused_result__));
>
>
>
>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__)) __attribute__ ((__warn_unused_result__));
>extern long int labs (long int __x) throw () __attribute__ ((__const__)) __attribute__ ((__warn_unused_result__));
>
>
>
>__extension__ extern long long int llabs (long long int __x)
>     throw () __attribute__ ((__const__)) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>
>extern div_t div (int __numer, int __denom)
>     throw () __attribute__ ((__const__)) __attribute__ ((__warn_unused_result__));
>extern ldiv_t ldiv (long int __numer, long int __denom)
>     throw () __attribute__ ((__const__)) __attribute__ ((__warn_unused_result__));
>
>
>
>
>__extension__ extern lldiv_t lldiv (long long int __numer,
>        long long int __denom)
>     throw () __attribute__ ((__const__)) __attribute__ ((__warn_unused_result__));
># 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))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern char *gcvt (double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern char *qecvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) __attribute__ ((__warn_unused_result__));
>extern char *qfcvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) __attribute__ ((__warn_unused_result__));
>extern char *qgcvt (long double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>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 () __attribute__ ((__warn_unused_result__));
>
>
>extern int mbtowc (wchar_t *__restrict __pwc,
>     __const char *__restrict __s, size_t __n) throw () __attribute__ ((__warn_unused_result__));
>
>
>extern int wctomb (char *__s, wchar_t __wchar) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>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 ();
># 885 "/usr/include/stdlib.h" 3 4
>extern int rpmatch (__const char *__response) throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
># 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))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern void setkey (__const char *__key) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int posix_openpt (int __oflag) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>
>extern int grantpt (int __fd) throw ();
>
>
>
>extern int unlockpt (int __fd) throw ();
>
>
>
>
>extern char *ptsname (int __fd) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>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)));
>
>
>
>
>
># 1 "/usr/include/bits/stdlib.h" 1 3 4
># 24 "/usr/include/bits/stdlib.h" 3 4
>extern char *__realpath_chk (__const char *__restrict __name,
>        char *__restrict __resolved,
>        size_t __resolvedlen) throw () __attribute__ ((__warn_unused_result__));
>extern char *__realpath_alias (__const char *__restrict __name, char *__restrict __resolved) throw () __asm__ ("" "realpath")
>
>                                                 __attribute__ ((__warn_unused_result__));
>extern char *__realpath_chk_warn (__const char *__restrict __name, char *__restrict __resolved, size_t __resolvedlen) throw () __asm__ ("" "__realpath_chk")
>
>
>                                                __attribute__ ((__warn_unused_result__))
>     __attribute__((__warning__ ("second argument of realpath must be either NULL or at " "least PATH_MAX bytes long buffer")))
>                                      ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) char *
>__attribute__ ((__leaf__)) realpath (__const char *__restrict __name, char *__restrict __resolved) throw ()
>{
>  if (__builtin_object_size (__resolved, 2 > 1) != (size_t) -1)
>    {
>
>
>
>
>      return __realpath_chk (__name, __resolved, __builtin_object_size (__resolved, 2 > 1));
>    }
>
>  return __realpath_alias (__name, __resolved);
>}
>
>
>extern int __ptsname_r_chk (int __fd, char *__buf, size_t __buflen,
>       size_t __nreal) throw () __attribute__ ((__nonnull__ (2)));
>extern int __ptsname_r_alias (int __fd, char *__buf, size_t __buflen) throw () __asm__ ("" "ptsname_r")
>
>     __attribute__ ((__nonnull__ (2)));
>extern int __ptsname_r_chk_warn (int __fd, char *__buf, size_t __buflen, size_t __nreal) throw () __asm__ ("" "__ptsname_r_chk")
>
>
>     __attribute__ ((__nonnull__ (2))) __attribute__((__warning__ ("ptsname_r called with buflen bigger than " "size of buf")))
>                   ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) ptsname_r (int __fd, char *__buf, size_t __buflen) throw ()
>{
>  if (__builtin_object_size (__buf, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__buflen))
> return __ptsname_r_chk (__fd, __buf, __buflen, __builtin_object_size (__buf, 2 > 1));
>      if (__buflen > __builtin_object_size (__buf, 2 > 1))
> return __ptsname_r_chk_warn (__fd, __buf, __buflen, __builtin_object_size (__buf, 2 > 1));
>    }
>  return __ptsname_r_alias (__fd, __buf, __buflen);
>}
>
>
>extern int __wctomb_chk (char *__s, wchar_t __wchar, size_t __buflen)
>  throw () __attribute__ ((__warn_unused_result__));
>extern int __wctomb_alias (char *__s, wchar_t __wchar) throw () __asm__ ("" "wctomb")
>              __attribute__ ((__warn_unused_result__));
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) int
>__attribute__ ((__leaf__)) wctomb (char *__s, wchar_t __wchar) throw ()
>{
>
>
>
>
>
>
>
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1 && 16 > __builtin_object_size (__s, 2 > 1))
>    return __wctomb_chk (__s, __wchar, __builtin_object_size (__s, 2 > 1));
>  return __wctomb_alias (__s, __wchar);
>}
>
>
>extern size_t __mbstowcs_chk (wchar_t *__restrict __dst,
>         __const char *__restrict __src,
>         size_t __len, size_t __dstlen) throw ();
>extern size_t __mbstowcs_alias (wchar_t *__restrict __dst, __const char *__restrict __src, size_t __len) throw () __asm__ ("" "mbstowcs")
>
>
>                                  ;
>extern size_t __mbstowcs_chk_warn (wchar_t *__restrict __dst, __const char *__restrict __src, size_t __len, size_t __dstlen) throw () __asm__ ("" "__mbstowcs_chk")
>
>
>
>     __attribute__((__warning__ ("mbstowcs called with dst buffer smaller than len " "* sizeof (wchar_t)")))
>                        ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) size_t
>__attribute__ ((__leaf__)) mbstowcs (wchar_t *__restrict __dst, __const char *__restrict __src, size_t __len) throw ()
>
>{
>  if (__builtin_object_size (__dst, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__len))
> return __mbstowcs_chk (__dst, __src, __len,
>          __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t));
>
>      if (__len > __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t))
> return __mbstowcs_chk_warn (__dst, __src, __len,
>         __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t));
>    }
>  return __mbstowcs_alias (__dst, __src, __len);
>}
>
>
>extern size_t __wcstombs_chk (char *__restrict __dst,
>         __const wchar_t *__restrict __src,
>         size_t __len, size_t __dstlen) throw ();
>extern size_t __wcstombs_alias (char *__restrict __dst, __const wchar_t *__restrict __src, size_t __len) throw () __asm__ ("" "wcstombs")
>
>
>                                  ;
>extern size_t __wcstombs_chk_warn (char *__restrict __dst, __const wchar_t *__restrict __src, size_t __len, size_t __dstlen) throw () __asm__ ("" "__wcstombs_chk")
>
>
>
>     __attribute__((__warning__ ("wcstombs called with dst buffer smaller than len")));
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) size_t
>__attribute__ ((__leaf__)) wcstombs (char *__restrict __dst, __const wchar_t *__restrict __src, size_t __len) throw ()
>
>{
>  if (__builtin_object_size (__dst, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__len))
> return __wcstombs_chk (__dst, __src, __len, __builtin_object_size (__dst, 2 > 1));
>      if (__len > __builtin_object_size (__dst, 2 > 1))
> return __wcstombs_chk_warn (__dst, __src, __len, __builtin_object_size (__dst, 2 > 1));
>    }
>  return __wcstombs_alias (__dst, __src, __len);
>}
># 956 "/usr/include/stdlib.h" 2 3 4
># 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;
> }
>    }
># 326 "/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;
> }
>    }
># 411 "/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;
> }
>    }
># 650 "/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));
>    }
># 697 "/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);
>    }
># 877 "/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;
>    }
># 914 "/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;
>    }
># 1095 "/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;
>    }
># 1138 "/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;
>    }
># 1178 "/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;
>    }
># 1218 "/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;
> }
>    }
># 1446 "/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));
>    }
># 1473 "/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);
>     }
> }
>    }
># 1679 "/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());
>    }
># 1715 "/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,
>          _ForwardIterator __last,
>          _Predicate __pred, _Distance __len)
>    {
>      if (__len == 1)
> return __pred(*__first) ? __last : __first;
>      _ForwardIterator __middle = __first;
>      std::advance(__middle, __len / 2);
>      _ForwardIterator __begin = std::__inplace_stable_partition(__first,
>         __middle,
>         __pred,
>         __len / 2);
>      _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last,
>              __pred,
>              __len
>              - __len / 2);
>      std::rotate(__begin, __middle, __end);
>      std::advance(__begin, std::distance(__middle, __end));
>      return __begin;
>    }
>
>
>  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;
>   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 __begin =
>     std::__stable_partition_adaptive(__first, __middle, __pred,
>          __len / 2, __buffer,
>          __buffer_size);
>   _ForwardIterator __end =
>     std::__stable_partition_adaptive(__middle, __last, __pred,
>          __len - __len / 2,
>          __buffer, __buffer_size);
>   std::rotate(__begin, __middle, __end);
>   std::advance(__begin, std::distance(__middle, __end));
>   return __begin;
> }
>    }
># 1873 "/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)
>    {
>
>
>
>
>
>      ;
>
>      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, __last, __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);
>    }
># 1955 "/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;
># 1975 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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;
>    }
># 2021 "/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;
># 2045 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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);
>    }
># 2405 "/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;
>    }
># 2452 "/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;
>    }
># 2501 "/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;
>    }
># 2554 "/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);
>    }
># 2616 "/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;
># 2633 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>                    ;
>
>                    ;
>
>      _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);
>    }
># 2677 "/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);
>    }
># 2710 "/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);
>    }
># 3134 "/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()));
>    }
># 3189 "/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);
>    }
># 3529 "/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;
>    }
># 3579 "/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;
># 3598 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first2, *__first1))
>   return false;
> else if(__comp(*__first1, *__first2))
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 3634 "/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;
>     }
> }
>    }
># 3691 "/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;
>     }
> }
>    }
># 3747 "/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;
>     }
> }
>    }
># 3804 "/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;
>     }
> }
>    }
># 3864 "/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;
>    }
># 3901 "/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;
>    }
># 4375 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
># 4391 "/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);
>    }
># 4412 "/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));
>    }
># 4436 "/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));
>    }
># 4466 "/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;
>    }
># 4506 "/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;
>    }
># 4538 "/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;
>    }
># 4570 "/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;
>    }
># 4602 "/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;
>    }
># 4627 "/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;
>    }
># 4669 "/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;
>    }
># 4740 "/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;
>    }
># 4815 "/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));
>    }
># 4852 "/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));
>    }
># 4894 "/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;
>    }
># 4931 "/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;
>    }
># 4964 "/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;
>    }
># 4996 "/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;
>    }
># 5028 "/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();
>    }
># 5059 "/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;
>    }
># 5096 "/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));
>    }
># 5135 "/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));
>    }
># 5167 "/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)));
>    }
># 5195 "/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));
>    }
># 5231 "/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));
>    }
># 5265 "/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);
>    }
># 5304 "/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);
>    }
># 5341 "/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);
>    }
># 5380 "/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);
>    }
># 5418 "/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);
> }
>    }
># 5454 "/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);
> }
>    }
># 5496 "/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;
># 5516 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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));
>    }
># 5560 "/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;
># 5581 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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));
>    }
># 5620 "/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()));
>    }
># 5662 "/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);
>    }
># 5708 "/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;
># 5729 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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));
>    }
># 5775 "/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;
># 5798 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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));
>    }
># 5842 "/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;
># 5861 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   ++__first1;
> else if (*__first2 < *__first1)
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 5899 "/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;
># 5920 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   ++__first1;
> else if (__comp(*__first2, *__first1))
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 5957 "/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;
># 5976 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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);
>    }
># 6018 "/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;
># 6039 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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);
>    }
># 6076 "/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;
># 6097 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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));
>    }
># 6142 "/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;
># 6166 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_algo.h" 3
>      ;
>      ;
>
>      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));
>    }
># 6199 "/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;
>    }
># 6227 "/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;
>    }
># 6255 "/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;
>    }
># 6283 "/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
># 69 "/usr/include/QtCore/qglobal.h" 2 3 4
># 903 "/usr/include/QtCore/qglobal.h" 3 4
># 912 "/usr/include/QtCore/qglobal.h" 3 4
>typedef signed char qint8;
>typedef unsigned char quint8;
>typedef short qint16;
>typedef unsigned short quint16;
>typedef int qint32;
>typedef unsigned int quint32;
># 926 "/usr/include/QtCore/qglobal.h" 3 4
>typedef long long qint64;
>typedef unsigned long long quint64;
>
>
>typedef qint64 qlonglong;
>typedef quint64 qulonglong;
># 959 "/usr/include/QtCore/qglobal.h" 3 4
>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 unsigned char uchar;
>typedef unsigned short ushort;
>typedef unsigned int uint;
>typedef unsigned long ulong;
># 1160 "/usr/include/QtCore/qglobal.h" 3 4
>typedef int QNoImplicitBoolCast;
># 1172 "/usr/include/QtCore/qglobal.h" 3 4
>typedef double qreal;
>
>
>
>
>
>
>template <typename T>
> inline T qAbs(const T &t) { return t >= 0 ? t : -t; }
>
> inline int qRound(qreal d)
>{ return d >= qreal(0.0) ? int(d + qreal(0.5)) : int(d - int(d-1) + qreal(0.5)) + int(d-1); }
>
>
>
>
>
> inline qint64 qRound64(qreal d)
>{ return d >= qreal(0.0) ? qint64(d + qreal(0.5)) : qint64(d - qreal(qint64(d-1)) + qreal(0.5)) + 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)); }
># 1230 "/usr/include/QtCore/qglobal.h" 3 4
>class QDataStream;
># 1255 "/usr/include/QtCore/qglobal.h" 3 4
># 1 "/usr/include/QtCore/qfeatures.h" 1 3 4
># 1256 "/usr/include/QtCore/qglobal.h" 2 3 4
># 1492 "/usr/include/QtCore/qglobal.h" 3 4
>inline void qt_noop(void) {}
># 1525 "/usr/include/QtCore/qglobal.h" 3 4
>class QString;
>class __attribute__((visibility("default"))) QSysInfo {
>public:
>    enum Sizes {
>        WordSize = (sizeof(void *)<<3)
>    };
># 1540 "/usr/include/QtCore/qglobal.h" 3 4
>    enum Endian {
>        BigEndian,
>        LittleEndian
>
>
>
>
>
>
>        , ByteOrder = LittleEndian
>
>
>
>    };
># 1648 "/usr/include/QtCore/qglobal.h" 3 4
>};
>
>__attribute__((visibility("default"))) const char *qVersion();
>__attribute__((visibility("default"))) bool qSharedBuild();
># 1722 "/usr/include/QtCore/qglobal.h" 3 4
>__attribute__((visibility("default"))) void qDebug(const char *, ...)
>
>    __attribute__ ((format (printf, 1, 2)))
>
>;
>
>__attribute__((visibility("default"))) void qWarning(const char *, ...)
>
>    __attribute__ ((format (printf, 1, 2)))
>
>;
>
>class QString;
>__attribute__((visibility("default"))) QString qt_error_string(int errorCode = -1);
>__attribute__((visibility("default"))) void qCritical(const char *, ...)
>
>    __attribute__ ((format (printf, 1, 2)))
>
>;
>__attribute__((visibility("default"))) void qFatal(const char *, ...)
>
>    __attribute__ ((format (printf, 1, 2)))
>
>;
>
>
>
>
>__attribute__((visibility("default"))) void qErrnoWarning(int code, const char *msg, ...);
>__attribute__((visibility("default"))) void qErrnoWarning(const char *msg, ...);
># 1762 "/usr/include/QtCore/qglobal.h" 3 4
>class QDebug;
>class QNoDebug;
>
>__attribute__((visibility("default"))) inline QDebug qDebug();
>__attribute__((visibility("default"))) inline QDebug qWarning();
>__attribute__((visibility("default"))) inline QDebug qCritical();
># 1782 "/usr/include/QtCore/qglobal.h" 3 4
>__attribute__((visibility("default"))) void qt_assert(const char *assertion, const char *file, int line);
># 1796 "/usr/include/QtCore/qglobal.h" 3 4
>__attribute__((visibility("default"))) void qt_assert_x(const char *where, const char *what, const char *file, int line);
># 1806 "/usr/include/QtCore/qglobal.h" 3 4
>__attribute__((visibility("default"))) void qt_check_pointer(const char *, int);
>__attribute__((visibility("default"))) void qBadAlloc();
># 1819 "/usr/include/QtCore/qglobal.h" 3 4
>template <typename T>
>inline T *q_check_ptr(T *p) { do { if (!(p)) qBadAlloc(); } while (0); return p; }
># 1844 "/usr/include/QtCore/qglobal.h" 3 4
>enum QtMsgType { QtDebugMsg, QtWarningMsg, QtCriticalMsg, QtFatalMsg, QtSystemMsg = QtCriticalMsg };
>
>__attribute__((visibility("default"))) void qt_message_output(QtMsgType, const char *buf);
>
>typedef void (*QtMsgHandler)(QtMsgType, const char *);
>__attribute__((visibility("default"))) QtMsgHandler qInstallMsgHandler(QtMsgHandler);
># 1898 "/usr/include/QtCore/qglobal.h" 3 4
>template <typename T> class QBasicAtomicPointer;
>
>
>template <typename T>
>class QGlobalStatic
>{
>public:
>    QBasicAtomicPointer<T> pointer;
>    bool destroyed;
>};
>
>
>template <typename T>
>class QGlobalStaticDeleter
>{
>public:
>    QGlobalStatic<T> &globalStatic;
>    QGlobalStaticDeleter(QGlobalStatic<T> &_globalStatic)
>        : globalStatic(_globalStatic)
>    { }
>
>    inline ~QGlobalStaticDeleter()
>    {
>        delete globalStatic.pointer;
>        globalStatic.pointer = 0;
>        globalStatic.destroyed = true;
>    }
>};
># 1976 "/usr/include/QtCore/qglobal.h" 3 4
>class QBool
>{
>    bool b;
>
>public:
>    inline explicit QBool(bool B) : b(B) {}
>    inline operator const void *() const
>    { return b ? static_cast<const void *>(this) : static_cast<const void *>(0); }
>};
>
>inline bool operator==(QBool b1, bool b2) { return !b1 == !b2; }
>inline bool operator==(bool b1, QBool b2) { return !b1 == !b2; }
>inline bool operator==(QBool b1, QBool b2) { return !b1 == !b2; }
>inline bool operator!=(QBool b1, bool b2) { return !b1 != !b2; }
>inline bool operator!=(bool b1, QBool b2) { return !b1 != !b2; }
>inline bool operator!=(QBool b1, QBool b2) { return !b1 != !b2; }
>
> 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;
>}
># 2080 "/usr/include/QtCore/qglobal.h" 3 4
>template <typename T> inline bool qIsDetached(T &) { return true; }
>
>template <typename T>
>class QTypeInfo
>{
>public:
>    enum {
>        isPointer = false,
>        isComplex = true,
>        isStatic = true,
>        isLarge = (sizeof(T)>sizeof(void*)),
>        isDummy = false
>    };
>};
>
>template <typename T>
>class QTypeInfo<T*>
>{
>public:
>    enum {
>        isPointer = true,
>        isComplex = false,
>        isStatic = false,
>        isLarge = false,
>        isDummy = false
>    };
>};
># 2116 "/usr/include/QtCore/qglobal.h" 3 4
>enum {
>    Q_COMPLEX_TYPE = 0,
>    Q_PRIMITIVE_TYPE = 0x1,
>    Q_STATIC_TYPE = 0,
>    Q_MOVABLE_TYPE = 0x2,
>    Q_DUMMY_TYPE = 0x4
>};
># 2143 "/usr/include/QtCore/qglobal.h" 3 4
>template <typename T>
>inline void qSwap(T &value1, T &value2)
>{
>
>
>
>
>
>    using std::swap;
>    swap(value1, value2);
>
>}
># 2186 "/usr/include/QtCore/qglobal.h" 3 4
>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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; 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) }; static inline const char *name() { return "long double"; } };
>
>
>
>
>
>
>__attribute__((visibility("default"))) void *qMalloc(size_t size);
>__attribute__((visibility("default"))) void qFree(void *ptr);
>__attribute__((visibility("default"))) void *qRealloc(void *ptr, size_t size);
>__attribute__((visibility("default"))) void *qMallocAligned(size_t size, size_t alignment);
>__attribute__((visibility("default"))) void *qReallocAligned(void *ptr, size_t size, size_t oldsize, size_t alignment);
>__attribute__((visibility("default"))) void qFreeAligned(void *ptr);
>__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);
># 2252 "/usr/include/QtCore/qglobal.h" 3 4
>class __attribute__((visibility("default"))) QFlag
>{
>    int i;
>public:
>    inline QFlag(int i);
>    inline operator int() const { return i; }
>};
>
>inline QFlag::QFlag(int ai) : i(ai) {}
>
>class __attribute__((visibility("default"))) 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(const QFlags &f) : i(f.i) {}
>    inline QFlags(Enum f) : i(f) {}
>    inline QFlags(Zero = 0) : i(0) {}
>    inline QFlags(QFlag f) : i(f) {}
>
>    inline QFlags &operator=(const QFlags &f) { i = f.i; return *this; }
>    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) ); }
>};
># 2335 "/usr/include/QtCore/qglobal.h" 3 4
>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;
>};
># 2427 "/usr/include/QtCore/qglobal.h" 3 4
>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(); }
># 2460 "/usr/include/QtCore/qglobal.h" 3 4
>__attribute__((visibility("default"))) QString qtTrId(const char *id, int n = -1);
># 2490 "/usr/include/QtCore/qglobal.h" 3 4
>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();
># 2689 "/usr/include/QtCore/qglobal.h" 3 4
>enum QtValidLicenseForCoreModule { LicensedCore = true };
>
>
>enum QtValidLicenseForGuiModule { LicensedGui = true };
>
>
>enum QtValidLicenseForNetworkModule { LicensedNetwork = true };
>
>
>enum QtValidLicenseForOpenGLModule { LicensedOpenGL = true };
>
>
>enum QtValidLicenseForOpenVGModule { LicensedOpenVG = true };
>
>
>enum QtValidLicenseForSqlModule { LicensedSql = true };
>
>
>enum QtValidLicenseForMultimediaModule { LicensedMultimedia = true };
>
>
>enum QtValidLicenseForXmlModule { LicensedXml = true };
>
>
>enum QtValidLicenseForXmlPatternsModule { LicensedXmlPatterns = true };
>
>
>enum QtValidLicenseForHelpModule { LicensedHelp = true };
>
>
>enum QtValidLicenseForScriptModule { LicensedScript = true };
>
>
>enum QtValidLicenseForScriptToolsModule { LicensedScriptTools = true };
>
>
>enum QtValidLicenseForQt3SupportLightModule { LicensedQt3SupportLight = true };
>
>
>enum QtValidLicenseForQt3SupportModule { LicensedQt3Support = true };
>
>
>enum QtValidLicenseForSvgModule { LicensedSvg = true };
>
>
>enum QtValidLicenseForDeclarativeModule { LicensedDeclarative = true };
>
>
>enum QtValidLicenseForActiveQtModule { LicensedActiveQt = true };
>
>
>enum QtValidLicenseForTestModule { LicensedTest = true };
>
>
>enum QtValidLicenseForDBusModule { LicensedDBus = true };
># 2773 "/usr/include/QtCore/qglobal.h" 3 4
>namespace QtPrivate {
>
>template <bool B, typename T = void> struct QEnableIf;
>template <typename T> struct QEnableIf<true, T> { typedef T Type; };
>}
># 46 "/usr/include/QtCore/qnamespace.h" 2 3 4
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>namespace
>
>
>
>Qt {
># 104 "/usr/include/QtCore/qnamespace.h" 3 4
>    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,
>        XButton1 = 0x00000008,
>        XButton2 = 0x00000010,
>        MouseButtonMask = 0x000000ff
>    };
>    typedef QFlags<MouseButton> MouseButtons;
># 174 "/usr/include/QtCore/qnamespace.h" 3 4
>    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
># 258 "/usr/include/QtCore/qnamespace.h" 3 4
>    };
>
>
>
>
>    enum TextElideMode {
>        ElideLeft,
>        ElideRight,
>        ElideMiddle,
>        ElideNone
>    };
>
>    enum WindowType {
>        Widget = 0x00000000,
>        Window = 0x00000001,
>        Dialog = 0x00000002 | Window,
>        Sheet = 0x00000004 | Window,
>        Drawer = 0x00000006 | Window,
>        Popup = 0x00000008 | Window,
>        Tool = 0x0000000a | Window,
>        ToolTip = 0x0000000c | Window,
>        SplashScreen = 0x0000000e | Window,
>        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,
>
>
>
>
>
>
>
>        CustomizeWindowHint = 0x02000000,
>        WindowStaysOnBottomHint = 0x04000000,
>        WindowCloseButtonHint = 0x08000000,
>        MacWindowToolBarButtonHint = 0x10000000,
>        BypassGraphicsProxyWidget = 0x20000000,
>        WindowOkButtonHint = 0x00080000,
>        WindowCancelButtonHint = 0x00100000,
>        WindowSoftkeysVisibleHint = 0x40000000,
>        WindowSoftkeysRespondHint = 0x80000000
># 362 "/usr/include/QtCore/qnamespace.h" 3 4
>    };
>
>    typedef QFlags<WindowType> WindowFlags;
>
>    enum WindowState {
>        WindowNoState = 0x00000000,
>        WindowMinimized = 0x00000001,
>        WindowMaximized = 0x00000002,
>        WindowFullScreen = 0x00000004,
>        WindowActive = 0x00000008
>    };
>
>    typedef QFlags<WindowState> WindowStates;
>
>    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_PaintOutsidePaintEvent = 13,
>        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_LockPortraitOrientation = 128,
>        WA_LockLandscapeOrientation = 129,
>        WA_AutoOrientation = 130,
># 528 "/usr/include/QtCore/qnamespace.h" 3 4
>        WA_X11DoNotAcceptFocus = 132,
>        WA_SymbianNoSystemRotation = 133,
>        WA_MacNoShadow = 134,
>
>
>        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_S60DontConstructApplicationPanes = 8,
>        AA_S60DisablePartialScreenInputMode = 9,
>        AA_X11InitThreads = 10,
>        AA_CaptureMultimediaKeys = 11,
>
>
>        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
>    };
># 612 "/usr/include/QtCore/qnamespace.h" 3 4
>    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,
># 855 "/usr/include/QtCore/qnamespace.h" 3 4
>        Key_division = 0x0f7,
># 865 "/usr/include/QtCore/qnamespace.h" 3 4
>        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,
># 910 "/usr/include/QtCore/qnamespace.h" 3 4
>        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_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
>    };
># 1252 "/usr/include/QtCore/qnamespace.h" 3 4
>    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
># 1308 "/usr/include/QtCore/qnamespace.h" 3 4
>    };
>
>    enum TextFormat {
>        PlainText,
>        RichText,
>        AutoText,
>        LogText
>    };
>
>    enum AspectRatioMode {
>        IgnoreAspectRatio,
>        KeepAspectRatio,
>        KeepAspectRatioByExpanding
>
>
>
>
>
>    };
>
>
>
>
>
>    enum AnchorAttribute {
>        AnchorName,
>        AnchorHref
>    };
>
>    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;
># 1392 "/usr/include/QtCore/qnamespace.h" 3 4
>    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
>    };
># 1451 "/usr/include/QtCore/qnamespace.h" 3 4
>    enum CaseSensitivity {
>        CaseInsensitive,
>        CaseSensitive
>    };
>
>    enum Corner {
>        TopLeftCorner = 0x00000,
>        TopRightCorner = 0x00001,
>        BottomLeftCorner = 0x00002,
>        BottomRightCorner = 0x00003
>
>
>
>
>
>
>    };
>
>    enum ConnectionType {
>        AutoConnection,
>        DirectConnection,
>        QueuedConnection,
>        AutoCompatConnection,
>        BlockingQueuedConnection,
>        UniqueConnection = 0x80
>    };
>
>    enum ShortcutContext {
>        WidgetShortcut,
>        WindowShortcut,
>        ApplicationShortcut,
>        WidgetWithChildrenShortcut
>    };
>
>    enum FillRule {
>        OddEvenFill,
>        WindingFill
>    };
>
>    enum MaskMode {
>        MaskInColor,
>        MaskOutColor
>    };
>
>    enum ClipOperation {
>        NoClip,
>        ReplaceClip,
>        IntersectClip,
>        UniteClip
>    };
>
>
>    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 {
>        ImMicroFocus,
>        ImFont,
>        ImCursorPosition,
>        ImSurroundingText,
>        ImCurrentSelection,
>        ImMaximumTextLength,
>        ImAnchorPosition
>    };
>
>    enum InputMethodHint {
>        ImhNone = 0x0,
>        ImhHiddenText = 0x1,
>        ImhNoAutoUppercase = 0x2,
>        ImhPreferNumbers = 0x4,
>        ImhPreferUppercase = 0x8,
>        ImhPreferLowercase = 0x10,
>        ImhNoPredictiveText = 0x20,
>
>        ImhDigitsOnly = 0x10000,
>        ImhFormattedNumbersOnly = 0x20000,
>        ImhUppercaseOnly = 0x40000,
>        ImhLowercaseOnly = 0x80000,
>        ImhDialableCharactersOnly = 0x100000,
>        ImhEmailCharactersOnly = 0x200000,
>        ImhUrlCharactersOnly = 0x400000,
>
>        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 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 = 32
>    };
>
>    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 unsigned long 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,
>        TouchPointStateMask = 0x0f,
>
>        TouchPointPrimary = 0x10
>    };
>    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
>    };
>}
>
>
>
>
> 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::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::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 Callback {
>        ConnectCallback,
>        DisconnectCallback,
>        AdoptCurrentThread,
>        EventNotifyCallback,
>        LastCallback
>    };
>
>    enum InternalFunction {
>        CreateThreadForAdoption,
>        RefAdoptedThread,
>        DerefAdoptedThread,
>        SetCurrentThreadToMainThread,
>        SetQObjectSender,
>        GetQObjectSender,
>        ResetQObjectSender,
>        LastInternalFunction
>    };
>
>    enum DockPosition {
>        LeftDock,
>        RightDock,
>        TopDock,
>        BottomDock,
>        DockCount
>    };
>
>    static bool registerCallback(Callback, qInternalCallback);
>    static bool unregisterCallback(Callback, qInternalCallback);
>
>    static bool activateCallbacks(Callback, void **);
>    static bool callFunction(InternalFunction func, void **);
>};
># 1885 "/usr/include/QtCore/qnamespace.h" 3 4
># 46 "/usr/include/QtCore/qobjectdefs.h" 2 3 4
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QByteArray;
>
>class QString;
># 143 "/usr/include/QtCore/qobjectdefs.h" 3 4
>template <typename T>
>inline int qYouForgotTheQ_OBJECT_Macro(T, T) { return 0; }
>
>template <typename T1, typename T2>
>inline void qYouForgotTheQ_OBJECT_Macro(T1, T2) {}
># 217 "/usr/include/QtCore/qobjectdefs.h" 3 4
>__attribute__((visibility("default"))) const char *qFlagLocation(const char *method);
># 249 "/usr/include/QtCore/qobjectdefs.h" 3 4
>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
>{
>    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) const;
>    QString trUtf8(const char *s, const char *c) const;
>    QString tr(const char *s, const char *c, int n) const;
>    QString trUtf8(const char *s, const char *c, int n) 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 QByteArray normalizedSignature(const char *method);
>    static QByteArray normalizedType(const char *type);
>
>
>    static bool 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, int from_signal_index, int to_signal_index, void **argv);
>    static void activate(QObject *sender, const QMetaObject *, int local_signal_index, void **argv);
>    static void activate(QObject *sender, const QMetaObject *, int from_local_signal_index, int to_local_signal_index, void **argv);
>
>
>    static void addGuard(QObject **ptr);
>    static void removeGuard(QObject **ptr);
>    static void changeGuard(QObject **ptr, QObject *o);
>
>    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
>    };
>
>    int static_metacall(Call, int, void **) const;
>    static int metacall(QObject *, Call, int, void **);
>
>
>
>
>
>    struct {
>        const QMetaObject *superdata;
>        const char *stringdata;
>        const uint *data;
>        const void *extradata;
>    } d;
>};
>
>typedef const QMetaObject& (*QMetaObjectAccessor)();
>
>struct QMetaObjectExtraData
>{
>
>
>
>    const QMetaObject **objects;
>
>
>    typedef void (*StaticMetacallFunction)(QObject *, QMetaObject::Call, int, void **);
>
>    StaticMetacallFunction static_metacall;
>};
>
>inline const char *QMetaObject::className() const
>{ return d.stringdata; }
>
>inline const QMetaObject *QMetaObject::superClass() const
>{ return d.superdata; }
># 48 "/usr/include/QtCore/qobject.h" 2
># 1 "/usr/include/QtCore/qstring.h" 1 3 4
># 45 "/usr/include/QtCore/qstring.h" 3 4
># 1 "/usr/include/QtCore/qchar.h" 1 3 4
># 47 "/usr/include/QtCore/qchar.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>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:
>    QChar();
>
>    QChar(char c);
>    QChar(uchar c);
>
>    QChar(QLatin1Char ch);
>    QChar(uchar c, uchar r);
>    inline QChar(ushort rc) : ucs(rc){}
>    QChar(short rc);
>    QChar(uint rc);
>    QChar(int rc);
>    enum SpecialCharacter {
>        Null = 0x0000,
>        Nbsp = 0x00a0,
>        ReplacementCharacter = 0xfffd,
>        ObjectReplacementCharacter = 0xfffc,
>        ByteOrderMark = 0xfeff,
>        ByteOrderSwapped = 0xfffe,
>
>
>
>
>
>
>
>        ParagraphSeparator = 0x2029,
>        LineSeparator = 0x2028
>    };
>    QChar(SpecialCharacter sc);
>
>
>
>    enum Category
>    {
>        NoCategory,
>
>        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,
>
>        Punctuation_Dask = Punctuation_Dash
>    };
>
>    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
>    };
>
>
>    Category category() const;
>    Direction direction() const;
>    Joining joining() const;
>    bool hasMirrored() const;
>    unsigned char combiningClass() const;
>
>    QChar mirroredChar() const;
>    QString decomposition() const;
>    Decomposition decompositionTag() const;
>
>    int digitValue() const;
>    QChar toLower() const;
>    QChar toUpper() const;
>    QChar toTitleCase() const;
>    QChar toCaseFolded() const;
>
>    UnicodeVersion unicodeVersion() const;
>
>
>
>
>
>
>    char toAscii() const;
>    inline char toLatin1() const;
>    inline ushort unicode() const { return ucs; }
>
>
>    inline ushort &unicode() { return const_cast<ushort&>(ucs); }
>
>
>
>
>    static QChar fromAscii(char c);
>    static QChar fromLatin1(char c);
>
>    inline bool isNull() const { return ucs == 0; }
>    bool isPrint() const;
>    bool isPunct() const;
>    bool isSpace() const;
>    bool isMark() const;
>    bool isLetter() const;
>    bool isNumber() const;
>    bool isLetterOrNumber() const;
>    bool isDigit() const;
>    bool isSymbol() const;
>    inline bool isLower() const { return category() == Letter_Lowercase; }
>    inline bool isUpper() const { return category() == Letter_Uppercase; }
>    inline bool isTitleCase() const { return category() == Letter_Titlecase; }
>
>    inline bool isHighSurrogate() const {
>        return ((ucs & 0xfc00) == 0xd800);
>    }
>    inline bool isLowSurrogate() const {
>        return ((ucs & 0xfc00) == 0xdc00);
>    }
>
>    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 isHighSurrogate(uint ucs4) {
>        return ((ucs4 & 0xfffffc00) == 0xd800);
>    }
>    static inline bool isLowSurrogate(uint ucs4) {
>        return ((ucs4 & 0xfffffc00) == 0xdc00);
>    }
>    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 (uint(high.ucs)<<10) + low.ucs - 0x35fdc00;
>    }
>    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 Category category(ushort ucs2);
>    static Direction direction(uint ucs4);
>    static Direction direction(ushort ucs2);
>    static Joining joining(uint ucs4);
>    static Joining joining(ushort ucs2);
>    static unsigned char combiningClass(uint ucs4);
>    static unsigned char combiningClass(ushort ucs2);
>
>    static uint mirroredChar(uint ucs4);
>    static ushort mirroredChar(ushort ucs2);
>    static Decomposition decompositionTag(uint ucs4);
>
>    static int digitValue(uint ucs4);
>    static int digitValue(ushort ucs2);
>    static uint toLower(uint ucs4);
>    static ushort toLower(ushort ucs2);
>    static uint toUpper(uint ucs4);
>    static ushort toUpper(ushort ucs2);
>    static uint toTitleCase(uint ucs4);
>    static ushort toTitleCase(ushort ucs2);
>    static uint toCaseFolded(uint ucs4);
>    static ushort toCaseFolded(ushort ucs2);
>
>    static UnicodeVersion unicodeVersion(uint ucs4);
>    static UnicodeVersion unicodeVersion(ushort ucs2);
>
>    static UnicodeVersion currentUnicodeVersion();
>
>    static QString decomposition(uint ucs4);
># 357 "/usr/include/QtCore/qchar.h" 3 4
>private:
>
>
>
>
>    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) }; static inline const char *name() { return "QChar"; } };
>
>inline QChar::QChar() : ucs(0) {}
>
>
>
>
>inline char QChar::toLatin1() const { return ucs > 0xff ? '\0' : char(ucs); }
>
>inline QChar QChar::fromLatin1(char c) { return QChar(ushort(uchar(c))); }
>
>inline QChar::QChar(uchar c, uchar r) : ucs(ushort((r << 8) | c)){}
>inline QChar::QChar(short rc) : ucs(ushort(rc)){}
>inline QChar::QChar(uint rc) : ucs(ushort(rc & 0xffff)){}
>inline QChar::QChar(int rc) : ucs(ushort(rc & 0xffff)){}
>inline QChar::QChar(SpecialCharacter s) : ucs(ushort(s)) {}
>inline QChar::QChar(QLatin1Char ch) : ucs(ch.unicode()) {}
>
>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 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 &, const QChar &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QChar &);
># 46 "/usr/include/QtCore/qstring.h" 2 3 4
># 1 "/usr/include/QtCore/qbytearray.h" 1 3 4
># 45 "/usr/include/QtCore/qbytearray.h" 3 4
># 1 "/usr/include/QtCore/qatomic.h" 1 3 4
># 46 "/usr/include/QtCore/qatomic.h" 3 4
># 1 "/usr/include/QtCore/qbasicatomic.h" 1 3 4
># 47 "/usr/include/QtCore/qbasicatomic.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class __attribute__((visibility("default"))) QBasicAtomicInt
>{
>public:
># 64 "/usr/include/QtCore/qbasicatomic.h" 3 4
>    volatile int _q_value;
>
>
>
>    inline bool operator==(int value) const
>    {
>        return _q_value == value;
>    }
>
>    inline bool operator!=(int value) const
>    {
>        return _q_value != value;
>    }
>
>    inline bool operator!() const
>    {
>        return _q_value == 0;
>    }
>
>    inline operator int() const
>    {
>        return _q_value;
>    }
>
>    inline QBasicAtomicInt &operator=(int value)
>    {
>
>
>
>        _q_value = value;
>        return *this;
>    }
>
>
>
>    static bool isReferenceCountingNative();
>    static bool isReferenceCountingWaitFree();
>
>    bool ref();
>    bool deref();
>
>    static bool isTestAndSetNative();
>    static bool isTestAndSetWaitFree();
>
>    bool testAndSetRelaxed(int expectedValue, int newValue);
>    bool testAndSetAcquire(int expectedValue, int newValue);
>    bool testAndSetRelease(int expectedValue, int newValue);
>    bool testAndSetOrdered(int expectedValue, int newValue);
>
>    static bool isFetchAndStoreNative();
>    static bool isFetchAndStoreWaitFree();
>
>    int fetchAndStoreRelaxed(int newValue);
>    int fetchAndStoreAcquire(int newValue);
>    int fetchAndStoreRelease(int newValue);
>    int fetchAndStoreOrdered(int newValue);
>
>    static bool isFetchAndAddNative();
>    static bool isFetchAndAddWaitFree();
>
>    int fetchAndAddRelaxed(int valueToAdd);
>    int fetchAndAddAcquire(int valueToAdd);
>    int fetchAndAddRelease(int valueToAdd);
>    int fetchAndAddOrdered(int valueToAdd);
>};
>
>template <typename T>
>class QBasicAtomicPointer
>{
>public:
># 148 "/usr/include/QtCore/qbasicatomic.h" 3 4
>    T * volatile _q_value;
>
>
>
>    inline bool operator==(T *value) const
>    {
>        return _q_value == value;
>    }
>
>    inline bool operator!=(T *value) const
>    {
>        return !operator==(value);
>    }
>
>    inline bool operator!() const
>    {
>        return operator==(0);
>    }
>
>    inline operator T *() const
>    {
>        return _q_value;
>    }
>
>    inline T *operator->() const
>    {
>        return _q_value;
>    }
>
>    inline QBasicAtomicPointer<T> &operator=(T *value)
>    {
>
>
>
>        _q_value = value;
>        return *this;
>    }
>
>
>
>    static bool isTestAndSetNative();
>    static bool isTestAndSetWaitFree();
>
>    bool testAndSetRelaxed(T *expectedValue, T *newValue);
>    bool testAndSetAcquire(T *expectedValue, T *newValue);
>    bool testAndSetRelease(T *expectedValue, T *newValue);
>    bool testAndSetOrdered(T *expectedValue, T *newValue);
>
>    static bool isFetchAndStoreNative();
>    static bool isFetchAndStoreWaitFree();
>
>    T *fetchAndStoreRelaxed(T *newValue);
>    T *fetchAndStoreAcquire(T *newValue);
>    T *fetchAndStoreRelease(T *newValue);
>    T *fetchAndStoreOrdered(T *newValue);
>
>    static bool isFetchAndAddNative();
>    static bool isFetchAndAddWaitFree();
>
>    T *fetchAndAddRelaxed(qptrdiff valueToAdd);
>    T *fetchAndAddAcquire(qptrdiff valueToAdd);
>    T *fetchAndAddRelease(qptrdiff valueToAdd);
>    T *fetchAndAddOrdered(qptrdiff valueToAdd);
>};
># 221 "/usr/include/QtCore/qbasicatomic.h" 3 4
>
>
>
>
>
>
># 1 "/usr/include/QtCore/qatomic_arch.h" 1 3 4
># 45 "/usr/include/QtCore/qatomic_arch.h" 3 4
># 86 "/usr/include/QtCore/qatomic_arch.h" 3 4
># 1 "/usr/include/QtCore/qatomic_x86_64.h" 1 3 4
># 45 "/usr/include/QtCore/qatomic_x86_64.h" 3 4
>
>
>
>
>
>
>
>inline bool QBasicAtomicInt::isReferenceCountingNative()
>{ return true; }
>inline bool QBasicAtomicInt::isReferenceCountingWaitFree()
>{ return true; }
>
>
>
>
>inline bool QBasicAtomicInt::isTestAndSetNative()
>{ return true; }
>inline bool QBasicAtomicInt::isTestAndSetWaitFree()
>{ return true; }
>
>
>
>
>inline bool QBasicAtomicInt::isFetchAndStoreNative()
>{ return true; }
>inline bool QBasicAtomicInt::isFetchAndStoreWaitFree()
>{ return true; }
>
>
>
>
>inline bool QBasicAtomicInt::isFetchAndAddNative()
>{ return true; }
>inline bool QBasicAtomicInt::isFetchAndAddWaitFree()
>{ return true; }
>
>
>
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::isTestAndSetNative()
>{ return true; }
>template <typename T>
>inline bool QBasicAtomicPointer<T>::isTestAndSetWaitFree()
>{ return true; }
>
>
>
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::isFetchAndStoreNative()
>{ return true; }
>template <typename T>
>inline bool QBasicAtomicPointer<T>::isFetchAndStoreWaitFree()
>{ return true; }
>
>
>
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::isFetchAndAddNative()
>{ return true; }
>template <typename T>
>inline bool QBasicAtomicPointer<T>::isFetchAndAddWaitFree()
>{ return true; }
>
>
>
>inline bool QBasicAtomicInt::ref()
>{
>    unsigned char ret;
>    asm volatile("lock\n"
>                 "incl %0\n"
>                 "setne %1"
>                 : "+m" (_q_value), "=qm" (ret)
>                 :
>                 : "memory");
>    return ret != 0;
>}
>
>inline bool QBasicAtomicInt::deref()
>{
>    unsigned char ret;
>    asm volatile("lock\n"
>                 "decl %0\n"
>                 "setne %1"
>                 : "+m" (_q_value), "=qm" (ret)
>                 :
>                 : "memory");
>    return ret != 0;
>}
>
>inline bool QBasicAtomicInt::testAndSetOrdered(int expectedValue, int newValue)
>{
>    unsigned char ret;
>    asm volatile("lock\n"
>                 "cmpxchgl %3,%2\n"
>                 "sete %1\n"
>                 : "=a" (newValue), "=qm" (ret), "+m" (_q_value)
>                 : "r" (newValue), "0" (expectedValue)
>                 : "memory");
>    return ret != 0;
>}
>
>inline int QBasicAtomicInt::fetchAndStoreOrdered(int newValue)
>{
>    asm volatile("xchgl %0,%1"
>                 : "=r" (newValue), "+m" (_q_value)
>                 : "0" (newValue)
>                 : "memory");
>    return newValue;
>}
>
>inline int QBasicAtomicInt::fetchAndAddOrdered(int valueToAdd)
>{
>    asm volatile("lock\n"
>                 "xaddl %0,%1"
>                 : "=r" (valueToAdd), "+m" (_q_value)
>                 : "0" (valueToAdd)
>                 : "memory");
>    return valueToAdd;
>}
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::testAndSetOrdered(T *expectedValue, T *newValue)
>{
>    unsigned char ret;
>    asm volatile("lock\n"
>                 "cmpxchgq %3,%2\n"
>                 "sete %1\n"
>                 : "=a" (newValue), "=qm" (ret), "+m" (_q_value)
>                 : "r" (newValue), "0" (expectedValue)
>                 : "memory");
>    return ret != 0;
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndStoreOrdered(T *newValue)
>{
>    asm volatile("xchgq %0,%1"
>                 : "=r" (newValue), "+m" (_q_value)
>                 : "0" (newValue)
>                 : "memory");
>    return newValue;
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndAddOrdered(qptrdiff valueToAdd)
>{
>    asm volatile("lock\n"
>                 "xaddq %0,%1"
>                 : "=r" (valueToAdd), "+m" (_q_value)
>                 : "0" (valueToAdd * sizeof(T))
>                 : "memory");
>    return reinterpret_cast<T *>(valueToAdd);
>}
># 260 "/usr/include/QtCore/qatomic_x86_64.h" 3 4
>inline bool QBasicAtomicInt::testAndSetRelaxed(int expectedValue, int newValue)
>{
>    return testAndSetOrdered(expectedValue, newValue);
>}
>
>inline bool QBasicAtomicInt::testAndSetAcquire(int expectedValue, int newValue)
>{
>    return testAndSetOrdered(expectedValue, newValue);
>}
>
>inline bool QBasicAtomicInt::testAndSetRelease(int expectedValue, int newValue)
>{
>    return testAndSetOrdered(expectedValue, newValue);
>}
>
>inline int QBasicAtomicInt::fetchAndStoreRelaxed(int newValue)
>{
>    return fetchAndStoreOrdered(newValue);
>}
>
>inline int QBasicAtomicInt::fetchAndStoreAcquire(int newValue)
>{
>    return fetchAndStoreOrdered(newValue);
>}
>
>inline int QBasicAtomicInt::fetchAndStoreRelease(int newValue)
>{
>    return fetchAndStoreOrdered(newValue);
>}
>
>inline int QBasicAtomicInt::fetchAndAddRelaxed(int valueToAdd)
>{
>    return fetchAndAddOrdered(valueToAdd);
>}
>
>inline int QBasicAtomicInt::fetchAndAddAcquire(int valueToAdd)
>{
>    return fetchAndAddOrdered(valueToAdd);
>}
>
>inline int QBasicAtomicInt::fetchAndAddRelease(int valueToAdd)
>{
>    return fetchAndAddOrdered(valueToAdd);
>}
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::testAndSetRelaxed(T *expectedValue, T *newValue)
>{
>    return testAndSetOrdered(expectedValue, newValue);
>}
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::testAndSetAcquire(T *expectedValue, T *newValue)
>{
>    return testAndSetOrdered(expectedValue, newValue);
>}
>
>template <typename T>
>inline bool QBasicAtomicPointer<T>::testAndSetRelease(T *expectedValue, T *newValue)
>{
>    return testAndSetOrdered(expectedValue, newValue);
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndStoreRelaxed(T *newValue)
>{
>    return fetchAndStoreOrdered(newValue);
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndStoreAcquire(T *newValue)
>{
>    return fetchAndStoreOrdered(newValue);
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndStoreRelease(T *newValue)
>{
>    return fetchAndStoreOrdered(newValue);
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndAddRelaxed(qptrdiff valueToAdd)
>{
>    return fetchAndAddOrdered(valueToAdd);
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndAddAcquire(qptrdiff valueToAdd)
>{
>    return fetchAndAddOrdered(valueToAdd);
>}
>
>template <typename T>
>inline T *QBasicAtomicPointer<T>::fetchAndAddRelease(qptrdiff valueToAdd)
>{
>    return fetchAndAddOrdered(valueToAdd);
>}
># 87 "/usr/include/QtCore/qatomic_arch.h" 2 3 4
># 99 "/usr/include/QtCore/qatomic_arch.h" 3 4
># 228 "/usr/include/QtCore/qbasicatomic.h" 2 3 4
># 47 "/usr/include/QtCore/qatomic.h" 2 3 4
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>class __attribute__((visibility("default"))) QAtomicInt : public QBasicAtomicInt
>{
>public:
>    inline QAtomicInt(int value = 0)
>    {
>
>
>
>        _q_value = value;
>    }
>    inline QAtomicInt(const QAtomicInt &other)
>    {
>
>
>
>        _q_value = other._q_value;
>    }
>
>    inline QAtomicInt &operator=(int value)
>    {
>        (void) QBasicAtomicInt::operator=(value);
>        return *this;
>    }
>
>    inline QAtomicInt &operator=(const QAtomicInt &other)
>    {
>        (void) QBasicAtomicInt::operator=(other);
>        return *this;
>    }
># 121 "/usr/include/QtCore/qatomic.h" 3 4
>};
>
>
>template <typename T>
>class QAtomicPointer : public QBasicAtomicPointer<T>
>{
>public:
>    inline QAtomicPointer(T *value = 0)
>    {
>
>
>
>        QBasicAtomicPointer<T>::_q_value = value;
>    }
>    inline QAtomicPointer(const QAtomicPointer<T> &other)
>    {
>
>
>
>        QBasicAtomicPointer<T>::_q_value = other._q_value;
>    }
>
>    inline QAtomicPointer<T> &operator=(T *value)
>    {
>        (void) QBasicAtomicPointer<T>::operator=(value);
>        return *this;
>    }
>
>    inline QAtomicPointer<T> &operator=(const QAtomicPointer<T> &other)
>    {
>        (void) QBasicAtomicPointer<T>::operator=(other);
>        return *this;
>    }
># 186 "/usr/include/QtCore/qatomic.h" 3 4
>};
>
>
>
>
>
>
>
>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;
>}
># 213 "/usr/include/QtCore/qatomic.h" 3 4
>template <typename T>
>inline void qAtomicDetach(T *&d)
>{
>    if (d->ref == 1)
>        return;
>    T *x = d;
>    d = new T(*d);
>    if (!x->ref.deref())
>        delete x;
>}
># 46 "/usr/include/QtCore/qbytearray.h" 2 3 4
>
>
># 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
># 44 "/usr/include/string.h" 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);
>}
>
>}
># 104 "/usr/include/string.h" 3 4
>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)));
># 128 "/usr/include/string.h" 3 4
>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);
>}
>
>}
># 271 "/usr/include/string.h" 3 4
>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)));
># 284 "/usr/include/string.h" 3 4
>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)));
># 642 "/usr/include/string.h" 3 4
># 1 "/usr/include/bits/string3.h" 1 3 4
># 23 "/usr/include/bits/string3.h" 3 4
>extern void __warn_memset_zero_len (void) __attribute__((__warning__ ("memset used with constant zero length parameter; this could be due to transposed parameters")))
>                                                                                                   ;
># 48 "/usr/include/bits/string3.h" 3 4
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void *
>__attribute__ ((__leaf__)) memcpy (void *__restrict __dest, __const void *__restrict __src, size_t __len) throw ()
>
>{
>  return __builtin___memcpy_chk (__dest, __src, __len, __builtin_object_size (__dest, 0));
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void *
>__attribute__ ((__leaf__)) memmove (void *__dest, __const void *__src, size_t __len) throw ()
>{
>  return __builtin___memmove_chk (__dest, __src, __len, __builtin_object_size (__dest, 0));
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void *
>__attribute__ ((__leaf__)) mempcpy (void *__restrict __dest, __const void *__restrict __src, size_t __len) throw ()
>
>{
>  return __builtin___mempcpy_chk (__dest, __src, __len, __builtin_object_size (__dest, 0));
>}
># 76 "/usr/include/bits/string3.h" 3 4
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void *
>__attribute__ ((__leaf__)) memset (void *__dest, int __ch, size_t __len) throw ()
>{
>  if (__builtin_constant_p (__len) && __len == 0
>      && (!__builtin_constant_p (__ch) || __ch != 0))
>    {
>      __warn_memset_zero_len ();
>      return __dest;
>    }
>  return __builtin___memset_chk (__dest, __ch, __len, __builtin_object_size (__dest, 0));
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void
>__attribute__ ((__leaf__)) bcopy (__const void *__src, void *__dest, size_t __len) throw ()
>{
>  (void) __builtin___memmove_chk (__dest, __src, __len, __builtin_object_size (__dest, 0));
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void
>__attribute__ ((__leaf__)) bzero (void *__dest, size_t __len) throw ()
>{
>  (void) __builtin___memset_chk (__dest, '\0', __len, __builtin_object_size (__dest, 0));
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>__attribute__ ((__leaf__)) strcpy (char *__restrict __dest, __const char *__restrict __src) throw ()
>{
>  return __builtin___strcpy_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1));
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>__attribute__ ((__leaf__)) stpcpy (char *__restrict __dest, __const char *__restrict __src) throw ()
>{
>  return __builtin___stpcpy_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1));
>}
>
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>__attribute__ ((__leaf__)) strncpy (char *__restrict __dest, __const char *__restrict __src, size_t __len) throw ()
>
>{
>  return __builtin___strncpy_chk (__dest, __src, __len, __builtin_object_size (__dest, 2 > 1));
>}
>
>
>extern char *__stpncpy_chk (char *__dest, __const char *__src, size_t __n,
>       size_t __destlen) throw ();
>extern char *__stpncpy_alias (char *__dest, __const char *__src, size_t __n) throw () __asm__ ("" "stpncpy")
>
>                                 ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>__attribute__ ((__leaf__)) stpncpy (char *__dest, __const char *__src, size_t __n) throw ()
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1
>      && (!__builtin_constant_p (__n) || __n <= __builtin_object_size (__dest, 2 > 1)))
>    return __stpncpy_chk (__dest, __src, __n, __builtin_object_size (__dest, 2 > 1));
>  return __stpncpy_alias (__dest, __src, __n);
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>__attribute__ ((__leaf__)) strcat (char *__restrict __dest, __const char *__restrict __src) throw ()
>{
>  return __builtin___strcat_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1));
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>__attribute__ ((__leaf__)) strncat (char *__restrict __dest, __const char *__restrict __src, size_t __len) throw ()
>
>{
>  return __builtin___strncat_chk (__dest, __src, __len, __builtin_object_size (__dest, 2 > 1));
>}
># 643 "/usr/include/string.h" 2 3 4
>
>
>
>}
># 49 "/usr/include/QtCore/qbytearray.h" 2 3 4
># 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;
># 50 "/usr/include/QtCore/qbytearray.h" 2 3 4
># 67 "/usr/include/QtCore/qbytearray.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>
>
>
>__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, ...);
># 128 "/usr/include/QtCore/qbytearray.h" 3 4
>__attribute__((visibility("default"))) quint16 qChecksum(const char *s, uint len);
>
>class QByteRef;
>class QString;
>class QDataStream;
>template <typename T> class QList;
>
>class __attribute__((visibility("default"))) QByteArray
>{
>private:
>    struct Data {
>        QBasicAtomicInt ref;
>        int alloc, size;
>
>
>
>        char *data;
>        char array[1];
>    };
>
>public:
>    inline QByteArray();
>    QByteArray(const char *);
>    QByteArray(const char *, int size);
>    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;
>
>    QBool contains(char c) const;
>    QBool contains(const char *a) const;
>    QBool 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;
># 244 "/usr/include/QtCore/qbytearray.h" 3 4
>    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;
>
>
>    QByteArray &append(const QString &s);
>    QByteArray &insert(int i, const QString &s);
>    QByteArray &replace(const QString &before, const char *after);
>    QByteArray &replace(char c, const QString &after);
>    QByteArray &replace(const QString &before, const QByteArray &after);
>
>    QByteArray &operator+=(const QString &s);
>    int indexOf(const QString &s, int from = 0) const;
>    int lastIndexOf(const QString &s, int from = -1) 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;
>    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 constBegin() const;
>    iterator end();
>    const_iterator end() 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;
># 382 "/usr/include/QtCore/qbytearray.h" 3 4
>private:
>    operator QNoImplicitBoolCast() const;
>    static Data shared_null;
>    static Data shared_empty;
>    Data *d;
>    QByteArray(Data *dd, int , int ) : d(dd) {}
>    void realloc(int alloc);
>    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(&shared_null) { d->ref.ref(); }
>inline QByteArray::~QByteArray() { if (!d->ref.deref()) qFree(d); }
>inline int QByteArray::size() const
>{ return d->size; }
># 413 "/usr/include/QtCore/qbytearray.h" 3 4
>inline char QByteArray::at(int i) const
>{ qt_noop(); return d->data[i]; }
>inline char QByteArray::operator[](int i) const
>{ qt_noop(); return d->data[i]; }
>inline char QByteArray::operator[](uint i) const
>{ 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 != 1 || d->data != d->array) realloc(d->size); }
>inline bool QByteArray::isDetached() const
>{ return d->ref == 1; }
>inline QByteArray::QByteArray(const QByteArray &a) : d(a.d)
>{ d->ref.ref(); }
>
>
>
>
>
>inline int QByteArray::capacity() const
>{ return d->alloc; }
>
>inline void QByteArray::reserve(int asize)
>{ if (d->ref != 1 || asize > d->alloc) realloc(asize); }
>
>inline void QByteArray::squeeze()
>{ if (d->size < d->alloc) realloc(d->size); }
>
>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)
>{ 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::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::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 QBool QByteArray::contains(const QByteArray &a) const
>{ return QBool(indexOf(a) != -1); }
>inline QBool QByteArray::contains(char c) const
>{ return QBool(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 QBool QByteArray::contains(const char *c) const
>{ return QBool(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) }; static inline const char *name() { return "QByteArray"; } };
>template <> inline bool qIsDetached<QByteArray>(QByteArray &t) { return t.isDetached(); } 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()); } }
># 47 "/usr/include/QtCore/qstring.h" 2 3 4
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 1 3 4
># 38 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/string" 3 4
># 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;
># 144 "/usr/include/wchar.h" 3 4
>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 ();
># 203 "/usr/include/wchar.h" 3 4
>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__));
># 242 "/usr/include/wchar.h" 3 4
>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 ();
># 383 "/usr/include/wchar.h" 3 4
>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
># 686 "/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
># 742 "/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 ();
># 881 "/usr/include/wchar.h" 3 4
># 1 "/usr/include/bits/wchar2.h" 1 3 4
># 25 "/usr/include/bits/wchar2.h" 3 4
>extern wchar_t *__wmemcpy_chk (wchar_t *__restrict __s1,
>          __const wchar_t *__restrict __s2, size_t __n,
>          size_t __ns1) throw ();
>extern wchar_t *__wmemcpy_alias (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw () __asm__ ("" "wmemcpy")
>
>
>            ;
>extern wchar_t *__wmemcpy_chk_warn (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n, size_t __ns1) throw () __asm__ ("" "__wmemcpy_chk")
>
>
>
>     __attribute__((__warning__ ("wmemcpy called with length bigger than size of destination " "buffer")))
>            ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wmemcpy (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw ()
>
>{
>  if (__builtin_object_size (__s1, 0) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n))
> return __wmemcpy_chk (__s1, __s2, __n,
>         __builtin_object_size (__s1, 0) / sizeof (wchar_t));
>
>      if (__n > __builtin_object_size (__s1, 0) / sizeof (wchar_t))
> return __wmemcpy_chk_warn (__s1, __s2, __n,
>       __builtin_object_size (__s1, 0) / sizeof (wchar_t));
>    }
>  return __wmemcpy_alias (__s1, __s2, __n);
>}
>
>
>extern wchar_t *__wmemmove_chk (wchar_t *__s1, __const wchar_t *__s2,
>    size_t __n, size_t __ns1) throw ();
>extern wchar_t *__wmemmove_alias (wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw () __asm__ ("" "wmemmove")
>
>                               ;
>extern wchar_t *__wmemmove_chk_warn (wchar_t *__s1, __const wchar_t *__s2, size_t __n, size_t __ns1) throw () __asm__ ("" "__wmemmove_chk")
>
>
>     __attribute__((__warning__ ("wmemmove called with length bigger than size of destination " "buffer")))
>            ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wmemmove (wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw ()
>{
>  if (__builtin_object_size (__s1, 0) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n))
> return __wmemmove_chk (__s1, __s2, __n,
>          __builtin_object_size (__s1, 0) / sizeof (wchar_t));
>
>      if (__n > __builtin_object_size (__s1, 0) / sizeof (wchar_t))
> return __wmemmove_chk_warn (__s1, __s2, __n,
>        __builtin_object_size (__s1, 0) / sizeof (wchar_t));
>    }
>  return __wmemmove_alias (__s1, __s2, __n);
>}
>
>
>
>extern wchar_t *__wmempcpy_chk (wchar_t *__restrict __s1,
>    __const wchar_t *__restrict __s2, size_t __n,
>    size_t __ns1) throw ();
>extern wchar_t *__wmempcpy_alias (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw () __asm__ ("" "wmempcpy")
>
>
>                           ;
>extern wchar_t *__wmempcpy_chk_warn (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n, size_t __ns1) throw () __asm__ ("" "__wmempcpy_chk")
>
>
>
>     __attribute__((__warning__ ("wmempcpy called with length bigger than size of destination " "buffer")))
>            ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wmempcpy (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw ()
>
>{
>  if (__builtin_object_size (__s1, 0) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n))
> return __wmempcpy_chk (__s1, __s2, __n,
>          __builtin_object_size (__s1, 0) / sizeof (wchar_t));
>
>      if (__n > __builtin_object_size (__s1, 0) / sizeof (wchar_t))
> return __wmempcpy_chk_warn (__s1, __s2, __n,
>        __builtin_object_size (__s1, 0) / sizeof (wchar_t));
>    }
>  return __wmempcpy_alias (__s1, __s2, __n);
>}
>
>
>
>extern wchar_t *__wmemset_chk (wchar_t *__s, wchar_t __c, size_t __n,
>          size_t __ns) throw ();
>extern wchar_t *__wmemset_alias (wchar_t *__s, wchar_t __c, size_t __n) throw () __asm__ ("" "wmemset")
>                             ;
>extern wchar_t *__wmemset_chk_warn (wchar_t *__s, wchar_t __c, size_t __n, size_t __ns) throw () __asm__ ("" "__wmemset_chk")
>
>
>     __attribute__((__warning__ ("wmemset called with length bigger than size of destination " "buffer")))
>            ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wmemset (wchar_t *__s, wchar_t __c, size_t __n) throw ()
>{
>  if (__builtin_object_size (__s, 0) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n))
> return __wmemset_chk (__s, __c, __n, __builtin_object_size (__s, 0) / sizeof (wchar_t));
>
>      if (__n > __builtin_object_size (__s, 0) / sizeof (wchar_t))
> return __wmemset_chk_warn (__s, __c, __n,
>       __builtin_object_size (__s, 0) / sizeof (wchar_t));
>    }
>  return __wmemset_alias (__s, __c, __n);
>}
>
>
>extern wchar_t *__wcscpy_chk (wchar_t *__restrict __dest,
>         __const wchar_t *__restrict __src,
>         size_t __n) throw ();
>extern wchar_t *__wcscpy_alias (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw () __asm__ ("" "wcscpy")
>
>                                                ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wcscpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw ()
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1)
>    return __wcscpy_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>  return __wcscpy_alias (__dest, __src);
>}
>
>
>extern wchar_t *__wcpcpy_chk (wchar_t *__restrict __dest,
>         __const wchar_t *__restrict __src,
>         size_t __destlen) throw ();
>extern wchar_t *__wcpcpy_alias (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw () __asm__ ("" "wcpcpy")
>
>                                                ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wcpcpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw ()
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1)
>    return __wcpcpy_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>  return __wcpcpy_alias (__dest, __src);
>}
>
>
>extern wchar_t *__wcsncpy_chk (wchar_t *__restrict __dest,
>          __const wchar_t *__restrict __src, size_t __n,
>          size_t __destlen) throw ();
>extern wchar_t *__wcsncpy_alias (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw () __asm__ ("" "wcsncpy")
>
>
>                          ;
>extern wchar_t *__wcsncpy_chk_warn (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n, size_t __destlen) throw () __asm__ ("" "__wcsncpy_chk")
>
>
>
>     __attribute__((__warning__ ("wcsncpy called with length bigger than size of destination " "buffer")))
>            ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wcsncpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw ()
>
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n))
> return __wcsncpy_chk (__dest, __src, __n,
>         __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>      if (__n > __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t))
> return __wcsncpy_chk_warn (__dest, __src, __n,
>       __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>    }
>  return __wcsncpy_alias (__dest, __src, __n);
>}
>
>
>extern wchar_t *__wcpncpy_chk (wchar_t *__restrict __dest,
>          __const wchar_t *__restrict __src, size_t __n,
>          size_t __destlen) throw ();
>extern wchar_t *__wcpncpy_alias (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw () __asm__ ("" "wcpncpy")
>
>
>                          ;
>extern wchar_t *__wcpncpy_chk_warn (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n, size_t __destlen) throw () __asm__ ("" "__wcpncpy_chk")
>
>
>
>     __attribute__((__warning__ ("wcpncpy called with length bigger than size of destination " "buffer")))
>            ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wcpncpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw ()
>
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n))
> return __wcpncpy_chk (__dest, __src, __n,
>         __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>      if (__n > __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t))
> return __wcpncpy_chk_warn (__dest, __src, __n,
>       __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>    }
>  return __wcpncpy_alias (__dest, __src, __n);
>}
>
>
>extern wchar_t *__wcscat_chk (wchar_t *__restrict __dest,
>         __const wchar_t *__restrict __src,
>         size_t __destlen) throw ();
>extern wchar_t *__wcscat_alias (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw () __asm__ ("" "wcscat")
>
>                                                ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wcscat (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw ()
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1)
>    return __wcscat_chk (__dest, __src, __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>  return __wcscat_alias (__dest, __src);
>}
>
>
>extern wchar_t *__wcsncat_chk (wchar_t *__restrict __dest,
>          __const wchar_t *__restrict __src,
>          size_t __n, size_t __destlen) throw ();
>extern wchar_t *__wcsncat_alias (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw () __asm__ ("" "wcsncat")
>
>
>                          ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) wchar_t *
>__attribute__ ((__leaf__)) wcsncat (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw ()
>
>{
>  if (__builtin_object_size (__dest, 2 > 1) != (size_t) -1)
>    return __wcsncat_chk (__dest, __src, __n,
>     __builtin_object_size (__dest, 2 > 1) / sizeof (wchar_t));
>  return __wcsncat_alias (__dest, __src, __n);
>}
>
>
>extern int __swprintf_chk (wchar_t *__restrict __s, size_t __n,
>      int __flag, size_t __s_len,
>      __const wchar_t *__restrict __format, ...)
>     throw () ;
>
>extern int __swprintf_alias (wchar_t *__restrict __s, size_t __n, __const wchar_t *__restrict __fmt, ...) throw () __asm__ ("" "swprintf")
>
>
>             ;
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) swprintf (wchar_t *__restrict __s, size_t __n, __const wchar_t *__restrict __fmt, ...) throw ()
>
>{
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1 || 2 > 1)
>    return __swprintf_chk (__s, __n, 2 - 1,
>      __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t),
>      __fmt, __builtin_va_arg_pack ());
>  return __swprintf_alias (__s, __n, __fmt, __builtin_va_arg_pack ());
>}
># 304 "/usr/include/bits/wchar2.h" 3 4
>extern int __vswprintf_chk (wchar_t *__restrict __s, size_t __n,
>       int __flag, size_t __s_len,
>       __const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>     throw () ;
>
>extern int __vswprintf_alias (wchar_t *__restrict __s, size_t __n, __const wchar_t *__restrict __fmt, __gnuc_va_list __ap) throw () __asm__ ("" "vswprintf")
>
>
>                                     ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) vswprintf (wchar_t *__restrict __s, size_t __n, __const wchar_t *__restrict __fmt, __gnuc_va_list __ap) throw ()
>
>{
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1 || 2 > 1)
>    return __vswprintf_chk (__s, __n, 2 - 1,
>       __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t), __fmt, __ap);
>  return __vswprintf_alias (__s, __n, __fmt, __ap);
>}
>
>
>
>
>extern int __fwprintf_chk (__FILE *__restrict __stream, int __flag,
>      __const wchar_t *__restrict __format, ...);
>extern int __wprintf_chk (int __flag, __const wchar_t *__restrict __format,
>     ...);
>extern int __vfwprintf_chk (__FILE *__restrict __stream, int __flag,
>       __const wchar_t *__restrict __format,
>       __gnuc_va_list __ap);
>extern int __vwprintf_chk (int __flag, __const wchar_t *__restrict __format,
>      __gnuc_va_list __ap);
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>wprintf (__const wchar_t *__restrict __fmt, ...)
>{
>  return __wprintf_chk (2 - 1, __fmt, __builtin_va_arg_pack ());
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>fwprintf (__FILE *__restrict __stream, __const wchar_t *__restrict __fmt, ...)
>{
>  return __fwprintf_chk (__stream, 2 - 1, __fmt,
>    __builtin_va_arg_pack ());
>}
>
>
>
>
>
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>vwprintf (__const wchar_t *__restrict __fmt, __gnuc_va_list __ap)
>{
>  return __vwprintf_chk (2 - 1, __fmt, __ap);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>vfwprintf (__FILE *__restrict __stream,
>    __const wchar_t *__restrict __fmt, __gnuc_va_list __ap)
>{
>  return __vfwprintf_chk (__stream, 2 - 1, __fmt, __ap);
>}
>
>
>
>extern wchar_t *__fgetws_chk (wchar_t *__restrict __s, size_t __size, int __n,
>         __FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern wchar_t *__fgetws_alias (wchar_t *__restrict __s, int __n, __FILE *__restrict __stream) __asm__ ("" "fgetws")
>
>                                              __attribute__ ((__warn_unused_result__));
>extern wchar_t *__fgetws_chk_warn (wchar_t *__restrict __s, size_t __size, int __n, __FILE *__restrict __stream) __asm__ ("" "__fgetws_chk")
>
>
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("fgetws called with bigger size than length " "of destination buffer")))
>                                 ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) wchar_t *
>fgetws (wchar_t *__restrict __s, int __n, __FILE *__restrict __stream)
>{
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n) || __n <= 0)
> return __fgetws_chk (__s, __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t),
>        __n, __stream);
>
>      if ((size_t) __n > __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t))
> return __fgetws_chk_warn (__s, __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t),
>      __n, __stream);
>    }
>  return __fgetws_alias (__s, __n, __stream);
>}
>
>
>extern wchar_t *__fgetws_unlocked_chk (wchar_t *__restrict __s, size_t __size,
>           int __n, __FILE *__restrict __stream)
>  __attribute__ ((__warn_unused_result__));
>extern wchar_t *__fgetws_unlocked_alias (wchar_t *__restrict __s, int __n, __FILE *__restrict __stream) __asm__ ("" "fgetws_unlocked")
>
>
>  __attribute__ ((__warn_unused_result__));
>extern wchar_t *__fgetws_unlocked_chk_warn (wchar_t *__restrict __s, size_t __size, int __n, __FILE *__restrict __stream) __asm__ ("" "__fgetws_unlocked_chk")
>
>
>
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("fgetws_unlocked called with bigger size than length " "of destination buffer")))
>                                 ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) wchar_t *
>fgetws_unlocked (wchar_t *__restrict __s, int __n, __FILE *__restrict __stream)
>{
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n) || __n <= 0)
> return __fgetws_unlocked_chk (__s, __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t),
>          __n, __stream);
>
>      if ((size_t) __n > __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t))
> return __fgetws_unlocked_chk_warn (__s, __builtin_object_size (__s, 2 > 1) / sizeof (wchar_t),
>        __n, __stream);
>    }
>  return __fgetws_unlocked_alias (__s, __n, __stream);
>}
>
>
>
>extern size_t __wcrtomb_chk (char *__restrict __s, wchar_t __wchar,
>        mbstate_t *__restrict __p,
>        size_t __buflen) throw () __attribute__ ((__warn_unused_result__));
>extern size_t __wcrtomb_alias (char *__restrict __s, wchar_t __wchar, mbstate_t *__restrict __ps) throw () __asm__ ("" "wcrtomb")
>
>                                                __attribute__ ((__warn_unused_result__));
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) size_t
>__attribute__ ((__leaf__)) wcrtomb (char *__restrict __s, wchar_t __wchar, mbstate_t *__restrict __ps) throw ()
>
>{
>
>
>
>
>
>
>
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1 && 16 > __builtin_object_size (__s, 2 > 1))
>    return __wcrtomb_chk (__s, __wchar, __ps, __builtin_object_size (__s, 2 > 1));
>  return __wcrtomb_alias (__s, __wchar, __ps);
>}
>
>
>extern size_t __mbsrtowcs_chk (wchar_t *__restrict __dst,
>          __const char **__restrict __src,
>          size_t __len, mbstate_t *__restrict __ps,
>          size_t __dstlen) throw ();
>extern size_t __mbsrtowcs_alias (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw () __asm__ ("" "mbsrtowcs")
>
>
>
>                   ;
>extern size_t __mbsrtowcs_chk_warn (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __len, mbstate_t *__restrict __ps, size_t __dstlen) throw () __asm__ ("" "__mbsrtowcs_chk")
>
>
>
>
>     __attribute__((__warning__ ("mbsrtowcs called with dst buffer smaller than len " "* sizeof (wchar_t)")))
>                        ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) size_t
>__attribute__ ((__leaf__)) mbsrtowcs (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw ()
>
>{
>  if (__builtin_object_size (__dst, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__len))
> return __mbsrtowcs_chk (__dst, __src, __len, __ps,
>    __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t));
>
>      if (__len > __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t))
> return __mbsrtowcs_chk_warn (__dst, __src, __len, __ps,
>         __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t));
>    }
>  return __mbsrtowcs_alias (__dst, __src, __len, __ps);
>}
>
>
>extern size_t __wcsrtombs_chk (char *__restrict __dst,
>          __const wchar_t **__restrict __src,
>          size_t __len, mbstate_t *__restrict __ps,
>          size_t __dstlen) throw ();
>extern size_t __wcsrtombs_alias (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw () __asm__ ("" "wcsrtombs")
>
>
>
>                   ;
>extern size_t __wcsrtombs_chk_warn (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __len, mbstate_t *__restrict __ps, size_t __dstlen) throw () __asm__ ("" "__wcsrtombs_chk")
>
>
>
>
>    __attribute__((__warning__ ("wcsrtombs called with dst buffer smaller than len")));
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) size_t
>__attribute__ ((__leaf__)) wcsrtombs (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw ()
>
>{
>  if (__builtin_object_size (__dst, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__len))
> return __wcsrtombs_chk (__dst, __src, __len, __ps, __builtin_object_size (__dst, 2 > 1));
>
>      if (__len > __builtin_object_size (__dst, 2 > 1))
> return __wcsrtombs_chk_warn (__dst, __src, __len, __ps, __builtin_object_size (__dst, 2 > 1));
>    }
>  return __wcsrtombs_alias (__dst, __src, __len, __ps);
>}
>
>
>
>extern size_t __mbsnrtowcs_chk (wchar_t *__restrict __dst,
>    __const char **__restrict __src, size_t __nmc,
>    size_t __len, mbstate_t *__restrict __ps,
>    size_t __dstlen) throw ();
>extern size_t __mbsnrtowcs_alias (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __nmc, size_t __len, mbstate_t *__restrict __ps) throw () __asm__ ("" "mbsnrtowcs")
>
>
>
>                    ;
>extern size_t __mbsnrtowcs_chk_warn (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __nmc, size_t __len, mbstate_t *__restrict __ps, size_t __dstlen) throw () __asm__ ("" "__mbsnrtowcs_chk")
>
>
>
>
>     __attribute__((__warning__ ("mbsnrtowcs called with dst buffer smaller than len " "* sizeof (wchar_t)")))
>                        ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) size_t
>__attribute__ ((__leaf__)) mbsnrtowcs (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __nmc, size_t __len, mbstate_t *__restrict __ps) throw ()
>
>{
>  if (__builtin_object_size (__dst, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__len))
> return __mbsnrtowcs_chk (__dst, __src, __nmc, __len, __ps,
>     __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t));
>
>      if (__len > __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t))
> return __mbsnrtowcs_chk_warn (__dst, __src, __nmc, __len, __ps,
>          __builtin_object_size (__dst, 2 > 1) / sizeof (wchar_t));
>    }
>  return __mbsnrtowcs_alias (__dst, __src, __nmc, __len, __ps);
>}
>
>
>extern size_t __wcsnrtombs_chk (char *__restrict __dst,
>    __const wchar_t **__restrict __src,
>    size_t __nwc, size_t __len,
>    mbstate_t *__restrict __ps, size_t __dstlen)
>     throw ();
>extern size_t __wcsnrtombs_alias (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __nwc, size_t __len, mbstate_t *__restrict __ps) throw () __asm__ ("" "wcsnrtombs")
>
>
>
>                                                  ;
>extern size_t __wcsnrtombs_chk_warn (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __nwc, size_t __len, mbstate_t *__restrict __ps, size_t __dstlen) throw () __asm__ ("" "__wcsnrtombs_chk")
>
>
>
>
>
>     __attribute__((__warning__ ("wcsnrtombs called with dst buffer smaller than len")));
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) size_t
>__attribute__ ((__leaf__)) wcsnrtombs (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __nwc, size_t __len, mbstate_t *__restrict __ps) throw ()
>
>{
>  if (__builtin_object_size (__dst, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__len))
> return __wcsnrtombs_chk (__dst, __src, __nwc, __len, __ps,
>     __builtin_object_size (__dst, 2 > 1));
>
>      if (__len > __builtin_object_size (__dst, 2 > 1))
> return __wcsnrtombs_chk_warn (__dst, __src, __nwc, __len, __ps,
>          __builtin_object_size (__dst, 2 > 1));
>    }
>  return __wcsnrtombs_alias (__dst, __src, __nwc, __len, __ps);
>}
># 882 "/usr/include/wchar.h" 2 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 ();
># 138 "/usr/include/ctype.h" 3 4
>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
># 60 "/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")))
>{
># 101 "/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;
>    };
># 140 "/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; }
>    };
># 204 "/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; }
>    };
># 268 "/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; }
>    };
># 351 "/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); }
># 422 "/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; }
># 508 "/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; }
>    };
># 541 "/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));
>    }
>
>
>
>}
># 732 "/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 () __attribute__ ((__warn_unused_result__));
>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;
>
>
>
>
>};
># 161 "/usr/include/time.h" 3 4
>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
># 55 "/usr/include/QtCore/qstring.h" 2 3 4
>
>
>
>typedef std::basic_string<wchar_t> QStdWString;
># 69 "/usr/include/QtCore/qstring.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QCharRef;
>class QRegExp;
>class QStringList;
>class QTextCodec;
>class QLatin1String;
>class QStringRef;
>template <typename T> class QVector;
>
>class __attribute__((visibility("default"))) QString
>{
>public:
>    inline QString();
>    QString(const QChar *unicode, int size);
>    explicit QString(const QChar *unicode);
>    QString(QChar c);
>    QString(int size, QChar c);
>    inline QString(const QLatin1String &latin1);
>    inline QString(const QString &);
>    inline ~QString();
>    QString &operator=(QChar c);
>    QString &operator=(const QString &);
>    inline QString &operator=(const QLatin1String &);
>
>
>
>
>    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() { if (d->size < d->alloc || d->ref != 1) realloc(); d->capacity = 0;}
>
>    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,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(qulonglong a, int fieldwidth=0, int base=10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(long a, int fieldwidth=0, int base=10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(ulong a, int fieldwidth=0, int base=10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(int a, int fieldWidth = 0, int base = 10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(uint a, int fieldWidth = 0, int base = 10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(short a, int fieldWidth = 0, int base = 10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(ushort a, int fieldWidth = 0, int base = 10,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(double a, int fieldWidth = 0, char fmt = 'g', int prec = -1,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(char a, int fieldWidth = 0,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(QChar a, int fieldWidth = 0,
>                const QChar &fillChar = QLatin1Char(' ')) const __attribute__ ((warn_unused_result));
>    QString arg(const QString &a, int fieldWidth = 0,
>                const 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(const 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(const 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 QBool contains(QChar c, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    inline QBool contains(const QString &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    inline QBool 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 QBool contains(const QRegExp &rx) const { return QBool(indexOf(rx) != -1); }
>    int count(const QRegExp &) const;
>
>    int indexOf(QRegExp &, int from = 0) const;
>    int lastIndexOf(QRegExp &, int from = -1) const;
>    inline QBool contains(QRegExp &rx) const { return QBool(indexOf(rx) != -1); }
>
>
>    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 &reg, 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(const QLatin1String &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    bool startsWith(const 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(const QLatin1String &s, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    bool endsWith(const 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 &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, const QLatin1String &s);
>    QString &append(QChar c);
>    QString &append(const QString &s);
>    QString &append(const QStringRef &s);
>    QString &append(const QLatin1String &s);
>    inline QString &prepend(QChar c) { return insert(0, c); }
>    inline QString &prepend(const QString &s) { return insert(0, s); }
>    inline QString &prepend(const QLatin1String &s) { return insert(0, s); }
>
>    inline QString &operator+=(QChar c) {
>        if (d->ref != 1 || d->size + 1 > d->alloc)
>            realloc(grow(d->size + 1));
>        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+=(const 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(const QLatin1String &before, const QLatin1String &after, Qt::CaseSensitivity cs = Qt::CaseSensitive);
>    QString &replace(const QLatin1String &before, const QString &after, Qt::CaseSensitivity cs = Qt::CaseSensitive);
>    QString &replace(const QString &before, const 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, const 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()); }
>
>
>    enum SplitBehavior { KeepEmptyParts, SkipEmptyParts };
>
>    QStringList split(const QString &sep, SplitBehavior behavior = KeepEmptyParts,
>                      Qt::CaseSensitivity cs = Qt::CaseSensitive) const __attribute__ ((warn_unused_result));
>    QStringList split(const 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));
>
>
>    enum NormalizationForm {
>        NormalizationForm_D,
>        NormalizationForm_C,
>        NormalizationForm_KD,
>        NormalizationForm_KC
>    };
>    QString normalized(NormalizationForm mode) const __attribute__ ((warn_unused_result));
>    QString normalized(NormalizationForm mode, QChar::UnicodeVersion version) const __attribute__ ((warn_unused_result));
>
>    QString repeated(int times) const;
>
>    const ushort *utf16() const;
>
>    QByteArray toAscii() const __attribute__ ((warn_unused_result));
>    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 QString fromAscii(const char *, int size = -1);
>    static QString fromLatin1(const char *, int size = -1);
>    static QString fromUtf8(const char *, int size = -1);
>    static QString fromLocal8Bit(const char *, int size = -1);
>    static QString fromUtf16(const ushort *, int size = -1);
>    static QString fromUcs4(const uint *, int size = -1);
>    static QString fromRawData(const QChar *, int size);
>
>    int toWCharArray(wchar_t *array) const;
>    static QString fromWCharArray(const wchar_t *, int size = -1);
>
>    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) const;
>    int compare(const QString &s, Qt::CaseSensitivity cs) const;
>
>    int compare(const QLatin1String &other, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>
>
>    static inline int compare(const QString &s1, const QString &s2)
>    { return s1.compare(s2); }
>    static inline int compare(const QString &s1, const QString &s2, Qt::CaseSensitivity cs)
>    { return s1.compare(s2, cs); }
>
>    static inline int compare(const QString& s1, const QLatin1String &s2,
>                              Qt::CaseSensitivity cs = Qt::CaseSensitive)
>    { return s1.compare(s2, cs); }
>    static inline int compare(const 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);
>
>    bool operator==(const QString &s) const;
>    bool operator<(const QString &s) const;
>    inline bool operator>(const QString &s) const { return s < *this; }
>    inline bool operator!=(const QString &s) const { return !operator==(s); }
>    inline bool operator<=(const QString &s) const { return !operator>(s); }
>    inline bool operator>=(const QString &s) const { return !operator<(s); }
>
>    bool operator==(const QLatin1String &s) const;
>    bool operator<(const QLatin1String &s) const;
>    bool operator>(const QLatin1String &s) const;
>    inline bool operator!=(const QLatin1String &s) const { return !operator==(s); }
>    inline bool operator<=(const QLatin1String &s) const { return !operator>(s); }
>    inline bool operator>=(const QLatin1String &s) const { return !operator<(s); }
>
>
>
>    inline QString(const char *ch) : d(fromAscii_helper(ch))
>    {}
>    inline QString(const QByteArray &a)
>        : d(fromAscii_helper(a.constData(), qstrnlen(a.constData(), a.size())))
>    {}
>    inline QString &operator=(const char *ch)
>    { return (*this = fromAscii(ch)); }
>    inline QString &operator=(const QByteArray &a)
>    { return (*this = fromAscii(a.constData(), qstrnlen(a.constData(), a.size()))); }
>    inline QString &operator=(char c)
>    { return (*this = QChar::fromAscii(c)); }
>
>
>    inline QString &prepend(const char *s)
>    { return prepend(QString::fromAscii(s)); }
>    inline QString &prepend(const QByteArray &s)
>    { return prepend(QString::fromAscii(s.constData(), qstrnlen(s.constData(), s.size()))); }
>    inline QString &append(const char *s)
>    { return append(QString::fromAscii(s)); }
>    inline QString &append(const QByteArray &s)
>    { return append(QString::fromAscii(s.constData(), qstrnlen(s.constData(), s.size()))); }
>    inline QString &operator+=(const char *s)
>    { return append(QString::fromAscii(s)); }
>    inline QString &operator+=(const QByteArray &s)
>    { return append(QString::fromAscii(s.constData(), qstrnlen(s.constData(), s.size()))); }
>    inline QString &operator+=(char c)
>    { return append(QChar::fromAscii(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 *s2) const;
>    inline bool operator>(const char *s2) const;
>    inline bool operator>=(const char *s2) const;
>
>    inline bool operator==(const QByteArray &s) const;
>    inline bool operator!=(const QByteArray &s) const;
>    inline bool operator<(const QByteArray &s) const
>    { return *this < QString::fromAscii(s.constData(), s.size()); }
>    inline bool operator>(const QByteArray &s) const
>    { return *this > QString::fromAscii(s.constData(), s.size()); }
>    inline bool operator<=(const QByteArray &s) const
>    { return *this <= QString::fromAscii(s.constData(), s.size()); }
>    inline bool operator>=(const QByteArray &s) const
>    { return *this >= QString::fromAscii(s.constData(), s.size()); }
>
>
>    typedef QChar *iterator;
>    typedef const QChar *const_iterator;
>    typedef iterator Iterator;
>    typedef const_iterator ConstIterator;
>    iterator begin();
>    const_iterator begin() const;
>    const_iterator constBegin() const;
>    iterator end();
>    const_iterator end() 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 QStdWString &s);
>    inline QStdWString toStdWString() const;
>
>
>
>
>
>    struct Null { };
>    static const Null null;
>    inline QString(const Null &): d(&shared_null) { d->ref.ref(); }
>    inline QString &operator=(const Null &) { *this = QString(); return *this; }
>    inline bool isNull() const { return d == &shared_null; }
># 588 "/usr/include/QtCore/qstring.h" 3 4
>    bool isSimpleText() const { if (!d->clean) updateProperties(); return d->simpletext; }
>    bool isRightToLeft() const;
>
>    QString(int size, Qt::Initialization);
>
>private:
># 603 "/usr/include/QtCore/qstring.h" 3 4
>    struct Data {
>        QBasicAtomicInt ref;
>        int alloc, size;
>        ushort *data;
>        ushort clean : 1;
>        ushort simpletext : 1;
>        ushort righttoleft : 1;
>        ushort asciiCache : 1;
>        ushort capacity : 1;
>        ushort reserved : 11;
>
>        ushort array[1];
>    };
>    static Data shared_null;
>    static Data shared_empty;
>    Data *d;
>    QString(Data *dd, int ) : d(dd) {}
>
>    static QTextCodec *codecForCStrings;
>
>    static int grow(int);
>    static void free(Data *);
>    void realloc();
>    void realloc(int alloc);
>    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,
>                              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);
>    void replace_helper(uint *indices, int nIndices, int blen, const QChar *after, int alen);
>    friend class QCharRef;
>    friend class QCFString;
>    friend class QTextCodec;
>    friend class QStringRef;
>    friend struct QAbstractConcatenable;
>    friend inline bool qStringComparisonHelper(const QString &s1, const char *s2);
>    friend inline bool qStringComparisonHelper(const QStringRef &s1, const char *s2);
>public:
>    typedef Data * DataPtr;
>    inline DataPtr &data_ptr() { return d; }
>};
>
>
>class __attribute__((visibility("default"))) QLatin1String
>{
>public:
>    inline explicit QLatin1String(const char *s) : chars(s) {}
>    inline QLatin1String &operator=(const QLatin1String &other)
>    { chars = other.chars; return *this; }
>
>    inline const char *latin1() const { return chars; }
>
>    inline bool operator==(const QString &s) const
>    { return s == *this; }
>    inline bool operator!=(const QString &s) const
>    { return s != *this; }
>    inline bool operator>(const QString &s) const
>    { return s < *this; }
>    inline bool operator<(const QString &s) const
>    { return s > *this; }
>    inline bool operator>=(const QString &s) const
>    { return s <= *this; }
>    inline bool operator<=(const QString &s) const
>    { return s >= *this; }
>
>    inline bool operator==(const char *s) const
>        { return QString::fromAscii(s) == *this; }
>    inline bool operator!=(const char *s) const
>        { return QString::fromAscii(s) != *this; }
>    inline bool operator<(const char *s) const
>        { return QString::fromAscii(s) > *this; }
>    inline bool operator>(const char *s) const
>        { return QString::fromAscii(s) < *this; }
>    inline bool operator<=(const char *s) const
>        { return QString::fromAscii(s) >= *this; }
>    inline bool operator>=(const char *s) const
>        { return QString::fromAscii(s) <= *this; }
>private:
>    const char *chars;
>};
>
>
>
>inline QString::QString(const QLatin1String &aLatin1) : d(fromLatin1_helper(aLatin1.latin1()))
>{ }
>inline int QString::length() const
>{ return d->size; }
>inline const QChar QString::at(int i) const
>{ qt_noop(); return d->data[i]; }
>inline const QChar QString::operator[](int i) const
>{ qt_noop(); return d->data[i]; }
>inline const QChar QString::operator[](uint i) const
>{ 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 != 1 || d->data != d->array) realloc(); }
>inline bool QString::isDetached() const
>{ return d->ref == 1; }
>inline QString &QString::operator=(const QLatin1String &s)
>{
>    *this = fromLatin1(s.latin1());
>    return *this;
>}
>inline void QString::clear()
>{ if (!isNull()) *this = QString(); }
>inline QString::QString(const QString &other) : d(other.d)
>{ qt_noop(); d->ref.ref(); }
>inline int QString::capacity() const
>{ return d->alloc; }
>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, const QChar &fillChar) const
>{ return arg(qlonglong(a), fieldWidth, base, fillChar); }
>inline QString QString::arg(uint a, int fieldWidth, int base, const QChar &fillChar) const
>{ return arg(qulonglong(a), fieldWidth, base, fillChar); }
>inline QString QString::arg(long a, int fieldWidth, int base, const QChar &fillChar) const
>{ return arg(qlonglong(a), fieldWidth, base, fillChar); }
>inline QString QString::arg(ulong a, int fieldWidth, int base, const QChar &fillChar) const
>{ return arg(qulonglong(a), fieldWidth, base, fillChar); }
>inline QString QString::arg(short a, int fieldWidth, int base, const QChar &fillChar) const
>{ return arg(qlonglong(a), fieldWidth, base, fillChar); }
>inline QString QString::arg(ushort a, int fieldWidth, int base, const 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); }
>
>
>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=(const 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::fromAscii(c)); }
>    inline QCharRef &operator=(uchar c)
>    { return operator=(QChar::fromAscii(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).toAscii(); }
>    char toLatin1() const { return QChar(*this).toLatin1(); }
>    ushort unicode() const { return QChar(*this).unicode(); }
>
>    ushort& unicode() { return s.data()[i].unicode(); }
># 873 "/usr/include/QtCore/qstring.h" 3 4
>};
>
>inline void QCharRef::setRow(uchar arow) { QChar(*this).setRow(arow); }
>inline void QCharRef::setCell(uchar acell) { QChar(*this).setCell(acell); }
>
>
>inline QString::QString() : d(&shared_null) { d->ref.ref(); }
>inline QString::~QString() { if (!d->ref.deref()) free(d); }
>inline void QString::reserve(int asize) { if (d->ref != 1 || asize > d->alloc) realloc(asize); d->capacity = 1;}
>inline QString &QString::setUtf16(const ushort *autf16, int asize)
>{ return setUnicode(reinterpret_cast<const QChar *>(autf16), asize); }
>inline QCharRef QString::operator[](int i)
>{ 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::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::constEnd() const
>{ return reinterpret_cast<const QChar*>(d->data + d->size); }
>inline QBool QString::contains(const QString &s, Qt::CaseSensitivity cs) const
>{ return QBool(indexOf(s, 0, cs) != -1); }
>inline QBool QString::contains(const QStringRef &s, Qt::CaseSensitivity cs) const
>{ return QBool(indexOf(s, 0, cs) != -1); }
>inline QBool QString::contains(QChar c, Qt::CaseSensitivity cs) const
>{ return QBool(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 qStringComparisonHelper(const QString &s1, const char *s2)
>{
>
>    if (QString::codecForCStrings) return (s1 == QString::fromAscii(s2));
>
>    return (s1 == QLatin1String(s2));
>}
>inline bool QString::operator==(const char *s) const
>{ return qStringComparisonHelper(*this, s); }
>inline bool QString::operator!=(const char *s) const
>{ return !qStringComparisonHelper(*this, s); }
>inline bool QString::operator<(const char *s) const
>{ return *this < QString::fromAscii(s); }
>inline bool QString::operator>(const char *s) const
>{ return *this > QString::fromAscii(s); }
>inline bool QString::operator<=(const char *s) const
>{ return *this <= QString::fromAscii(s); }
>inline bool QString::operator>=(const char *s) const
>{ return *this >= QString::fromAscii(s); }
>
>inline bool operator==(const char *s1, const QString &s2)
>{ return qStringComparisonHelper(s2, s1); }
>inline bool operator!=(const char *s1, const QString &s2)
>{ return !qStringComparisonHelper(s2, s1); }
>inline bool operator<(const char *s1, const QString &s2)
>{ return (QString::fromAscii(s1) < s2); }
>inline bool operator>(const char *s1, const QString &s2)
>{ return (QString::fromAscii(s1) > s2); }
>inline bool operator<=(const char *s1, const QString &s2)
>{ return (QString::fromAscii(s1) <= s2); }
>inline bool operator>=(const char *s1, const QString &s2)
>{ return (QString::fromAscii(s1) >= s2); }
>
>inline bool operator==(const char *s1, const QLatin1String &s2)
>{ return QString::fromAscii(s1) == s2; }
>inline bool operator!=(const char *s1, const QLatin1String &s2)
>{ return QString::fromAscii(s1) != s2; }
>inline bool operator<(const char *s1, const QLatin1String &s2)
>{ return (QString::fromAscii(s1) < s2); }
>inline bool operator>(const char *s1, const QLatin1String &s2)
>{ return (QString::fromAscii(s1) > s2); }
>inline bool operator<=(const char *s1, const QLatin1String &s2)
>{ return (QString::fromAscii(s1) <= s2); }
>inline bool operator>=(const char *s1, const QLatin1String &s2)
>{ return (QString::fromAscii(s1) >= s2); }
>
>inline bool operator==(const QLatin1String &s1, const QLatin1String &s2)
>{ return (qstrcmp(s1.latin1(), s2.latin1()) == 0); }
>inline bool operator!=(const QLatin1String &s1, const QLatin1String &s2)
>{ return (qstrcmp(s1.latin1(), s2.latin1()) != 0); }
>inline bool operator<(const QLatin1String &s1, const QLatin1String &s2)
>{ return (qstrcmp(s1.latin1(), s2.latin1()) < 0); }
>inline bool operator<=(const QLatin1String &s1, const QLatin1String &s2)
>{ return (qstrcmp(s1.latin1(), s2.latin1()) <= 0); }
>inline bool operator>(const QLatin1String &s1, const QLatin1String &s2)
>{ return (qstrcmp(s1.latin1(), s2.latin1()) > 0); }
>inline bool operator>=(const QLatin1String &s1, const QLatin1String &s2)
>{ return (qstrcmp(s1.latin1(), s2.latin1()) >= 0); }
>
>
>inline bool QString::operator==(const QByteArray &s) const
>{ return qStringComparisonHelper(*this, s.constData()); }
>inline bool QString::operator!=(const QByteArray &s) const
>{ return !qStringComparisonHelper(*this, s.constData()); }
>
>inline bool QByteArray::operator==(const QString &s) const
>{ return qStringComparisonHelper(s, constData()); }
>inline bool QByteArray::operator!=(const QString &s) const
>{ return !qStringComparisonHelper(s, constData()); }
>inline bool QByteArray::operator<(const QString &s) const
>{ return QString::fromAscii(constData(), size()) < s; }
>inline bool QByteArray::operator>(const QString &s) const
>{ return QString::fromAscii(constData(), size()) > s; }
>inline bool QByteArray::operator<=(const QString &s) const
>{ return QString::fromAscii(constData(), size()) <= s; }
>inline bool QByteArray::operator>=(const QString &s) const
>{ return QString::fromAscii(constData(), size()) >= s; }
>
>
>
>inline QByteArray &QByteArray::append(const QString &s)
>{ return append(s.toAscii()); }
>inline QByteArray &QByteArray::insert(int i, const QString &s)
>{ return insert(i, s.toAscii()); }
>inline QByteArray &QByteArray::replace(char c, const QString &after)
>{ return replace(c, after.toAscii()); }
>inline QByteArray &QByteArray::replace(const QString &before, const char *after)
>{ return replace(before.toAscii(), after); }
>inline QByteArray &QByteArray::replace(const QString &before, const QByteArray &after)
>{ return replace(before.toAscii(), after); }
>inline QByteArray &QByteArray::operator+=(const QString &s)
>{ return operator+=(s.toAscii()); }
>inline int QByteArray::indexOf(const QString &s, int from) const
>{ return indexOf(s.toAscii(), from); }
>inline int QByteArray::lastIndexOf(const QString &s, int from) const
>{ return lastIndexOf(s.toAscii(), from); }
># 1021 "/usr/include/QtCore/qstring.h" 3 4
>inline const QString operator+(const QString &s1, const QString &s2)
>{ QString t(s1); t += s2; return t; }
>inline const QString operator+(const QString &s1, QChar s2)
>{ QString t(s1); t += s2; return t; }
>inline const QString operator+(QChar s1, const QString &s2)
>{ QString t(s1); t += s2; return t; }
>
>inline const QString operator+(const QString &s1, const char *s2)
>{ QString t(s1); t += QString::fromAscii(s2); return t; }
>inline const QString operator+(const char *s1, const QString &s2)
>{ QString t = QString::fromAscii(s1); t += s2; return t; }
>inline const QString operator+(char c, const QString &s)
>{ QString t = s; t.prepend(QChar::fromAscii(c)); return t; }
>inline const QString operator+(const QString &s, char c)
>{ QString t = s; t += QChar::fromAscii(c); return t; }
>inline const QString operator+(const QByteArray &ba, const QString &s)
>{ QString t = QString::fromAscii(ba.constData(), qstrnlen(ba.constData(), ba.size())); t += s; return t; }
>inline const QString operator+(const QString &s, const QByteArray &ba)
>{ QString t(s); t += QString::fromAscii(ba.constData(), qstrnlen(ba.constData(), ba.size())); return t; }
>
>
>
>
>inline std::string QString::toStdString() const
>{ const QByteArray asc = toAscii(); return std::string(asc.constData(), asc.length()); }
>
>inline QString QString::fromStdString(const std::string &s)
>{ return fromAscii(s.data(), int(s.size())); }
>
>
>inline QStdWString QString::toStdWString() const
>{
>    QStdWString str;
>    str.resize(length());
>
>
>
>
>
>
>
>    str.resize(toWCharArray(&(*str.begin())));
>    return str;
>}
>inline QString QString::fromStdWString(const QStdWString &s)
>{ return fromWCharArray(s.data(), int(s.size())); }
># 1080 "/usr/include/QtCore/qstring.h" 3 4
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QString &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QString &);
># 1094 "/usr/include/QtCore/qstring.h" 3 4
>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) }; static inline const char *name() { return "QString"; } };
>template <> inline bool qIsDetached<QString>(QString &t) { return t.isDetached(); } 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 QBool contains(const QString &str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    inline QBool contains(QChar ch, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    inline QBool contains(QLatin1String str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    inline QBool 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::shared_null.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));
>    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
>        { qt_noop(); return m_string->at(i + m_position); }
>
>    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);
>};
>
>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==(const QLatin1String &s1, const QStringRef &s2);
>inline bool operator!=(const QLatin1String &s1,const QStringRef &s2)
>{ return !(s1 == s2); }
>inline bool operator==(const QStringRef &s1,const QLatin1String &s2)
>{ return s2 == s1; }
>inline bool operator!=(const QStringRef &s1,const 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 qStringComparisonHelper(const QStringRef &s1, const char *s2)
>{
>
>    if (QString::codecForCStrings) return (s1 == QString::fromAscii(s2));
>
>    return (s1 == QLatin1String(s2));
>}
>
>inline bool operator==(const char *s1, const QStringRef &s2)
>{ return qStringComparisonHelper(s2, s1); }
>inline bool operator==(const QStringRef &s1, const char *s2)
>{ return qStringComparisonHelper(s1, s2); }
>inline bool operator!=(const char *s1, const QStringRef &s2)
>{ return !qStringComparisonHelper(s2, s1); }
>inline bool operator!=(const QStringRef &s1, const char *s2)
>{ return !qStringComparisonHelper(s1, s2); }
>
>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 QBool QStringRef::contains(const QString &s, Qt::CaseSensitivity cs) const
>{ return QBool(indexOf(s, 0, cs) != -1); }
>inline QBool QStringRef::contains(QLatin1String s, Qt::CaseSensitivity cs) const
>{ return QBool(indexOf(s, 0, cs) != -1); }
>inline QBool QStringRef::contains(QChar c, Qt::CaseSensitivity cs) const
>{ return QBool(indexOf(c, 0, cs) != -1); }
>inline QBool QStringRef::contains(const QStringRef &s, Qt::CaseSensitivity cs) const
>{ return QBool(indexOf(s, 0, cs) != -1); }
># 49 "/usr/include/QtCore/qobject.h" 2
>
># 1 "/usr/include/QtCore/qlist.h" 1 3 4
># 45 "/usr/include/QtCore/qlist.h" 3 4
># 1 "/usr/include/QtCore/qiterator.h" 1 3 4
># 47 "/usr/include/QtCore/qiterator.h" 3 4
>
>
>namespace std {
>    struct bidirectional_iterator_tag;
>    struct random_access_iterator_tag;
>}
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
># 198 "/usr/include/QtCore/qiterator.h" 3 4
># 46 "/usr/include/QtCore/qlist.h" 2 3 4
>
># 1 "/usr/include/QtCore/qalgorithms.h" 1 3 4
># 47 "/usr/include/QtCore/qalgorithms.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>
>
>
>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);
>}
># 155 "/usr/include/QtCore/qalgorithms.h" 3 4
>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;
>}
>
>}
># 48 "/usr/include/QtCore/qlist.h" 2 3 4
>
>
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 1 3 4
># 58 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/iterator" 3 4
># 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" {
># 112 "/usr/include/wctype.h" 3 4
>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 ();
># 187 "/usr/include/wctype.h" 3 4
>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 ();
># 231 "/usr/include/wctype.h" 3 4
>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;
># 2527 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/locale_facets.h" 3
>  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")))
>{
># 47 "/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>, 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
># 51 "/usr/include/QtCore/qlist.h" 2 3 4
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 1 3 4
># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/list" 3 4
># 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
># 52 "/usr/include/QtCore/qlist.h" 2 3 4
>
>
>
>
>
>
>
># 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
># 60 "/usr/include/QtCore/qlist.h" 2 3 4
>
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>template <typename T> class QVector;
>template <typename T> class QSet;
>
>struct __attribute__((visibility("default"))) QListData {
>    struct Data {
>        QBasicAtomicInt ref;
>        int alloc, begin, end;
>        uint sharable : 1;
>        void *array[1];
>    };
>    enum { DataHeaderSize = sizeof(Data) - sizeof(void *) };
>
>    Data *detach(int alloc);
>    Data *detach_grow(int *i, int n);
>    Data *detach();
>    Data *detach2();
>    Data *detach3();
>    void realloc(int alloc);
>    static Data shared_null;
>    Data *d;
>    void **erase(void **xi);
>    void **append(int n);
>    void **append();
>    void **append(const QListData &l);
>    void **append2(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(&QListData::shared_null) { d->ref.ref(); }
>    inline QList(const QList<T> &l) : d(l.d) { d->ref.ref(); if (!d->sharable) detach_helper(); }
>    ~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 != 1) detach_helper(); }
>
>    inline void detachShared()
>    {
>
>        if (d->ref != 1 && this->d != &QListData::shared_null)
>            detach_helper();
>    }
>
>    inline bool isDetached() const { return d->ref == 1; }
>    inline void setSharable(bool sharable) { if (!sharable) detach(); d->sharable = 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;
>    QBool 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 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 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() { qt_noop(); return *begin(); }
>    inline const T& first() const { qt_noop(); return at(0); }
>    T& last() { qt_noop(); return *(--end()); }
>    const T& last() const { qt_noop(); return at(count() - 1); }
>    inline void removeFirst() { qt_noop(); erase(begin()); }
>    inline void removeLast() { 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;
># 328 "/usr/include/QtCore/qlist.h" 3 4
>    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 free(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) {
>        QListData::Data *o = l.d;
>        o->ref.ref();
>        if (!d->ref.deref())
>            free(d);
>        d = o;
>        if (!d->sharable)
>            detach_helper();
>    }
>    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
>{ qt_noop();
> return reinterpret_cast<Node *>(p.at(i))->t(); }
>template <typename T>
>inline const T &QList<T>::operator[](int i) const
>{ qt_noop();
> return reinterpret_cast<Node *>(p.at(i))->t(); }
>template <typename T>
>inline T &QList<T>::operator[](int i)
>{ 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)
>{ 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 != 1)
>            detach_helper(alloc);
>        else
>            p.realloc(alloc);
>    }
>}
>
>template <typename T>
> void QList<T>::append(const T &t)
>{
>    if (d->ref != 1) {
>        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(&copy, t);
>            try {
>                n = reinterpret_cast<Node *>(p.append());;
>            } catch (...) {
>                node_destruct(&copy);
>                throw;
>            }
>            *n = copy;
>        }
>    }
>}
>
>template <typename T>
>inline void QList<T>::prepend(const T &t)
>{
>    if (d->ref != 1) {
>        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(&copy, t);
>            try {
>                n = reinterpret_cast<Node *>(p.prepend());;
>            } catch (...) {
>                node_destruct(&copy);
>                throw;
>            }
>            *n = copy;
>        }
>    }
>}
>
>template <typename T>
>inline void QList<T>::insert(int i, const T &t)
>{
>    if (d->ref != 1) {
>        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(&copy, t);
>            try {
>                n = reinterpret_cast<Node *>(p.insert(i));;
>            } catch (...) {
>                node_destruct(&copy);
>                throw;
>            }
>            *n = copy;
>        }
>    }
>}
>
>template <typename T>
>inline void QList<T>::replace(int i, const T &t)
>{
>    qt_noop();
>    detach();
>    reinterpret_cast<Node *>(p.at(i))->t() = t;
>}
>
>template <typename T>
>inline void QList<T>::swap(int i, int j)
>{
>    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)
>{
>    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 (...) {
>        qFree(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));
>        qFree(d);
>        d = x;
>        throw;
>    }
>
>    if (!x->ref.deref())
>        free(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 (...) {
>        qFree(d);
>        d = x;
>        throw;
>    }
>
>    if (!x->ref.deref())
>        free(x);
>}
>
>template <typename T>
> void QList<T>::detach_helper()
>{
>    detach_helper(d->alloc);
>}
>
>template <typename T>
> QList<T>::~QList()
>{
>    if (!d->ref.deref())
>        free(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>::free(QListData::Data *data)
>{
>    node_destruct(reinterpret_cast<Node *>(data->array + data->begin),
>                  reinterpret_cast<Node *>(data->array + data->end));
>    qFree(data);
>}
>
>
>template <typename T>
> void QList<T>::clear()
>{
>    *this = QList<T>();
>}
>
>template <typename T>
> int QList<T>::removeAll(const T &_t)
>{
>    detachShared();
>    const T t = _t;
>    int removedCount=0, i=0;
>    Node *n;
>    while (i < p.size())
>        if ((n = reinterpret_cast<Node *>(p.at(i)))->t() == t) {
>            node_destruct(n);
>            p.remove(i);
>            ++removedCount;
>        } else {
>            ++i;
>        }
>    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 != 1)
>                      ? detach_helper_grow(2147483647, l.size())
>                      : reinterpret_cast<Node *>(p.append2(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>
> QBool 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 QBool(true);
>    return QBool(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() { qt_noop(); return *n; } inline const T &value() const { 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; } };
># 51 "/usr/include/QtCore/qobject.h" 2
>
>
>
># 1 "/usr/include/QtCore/qscopedpointer.h" 1 3 4
># 47 "/usr/include/QtCore/qscopedpointer.h" 3 4
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>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) qFree(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
>    {
>        qt_noop();
>        return *d;
>    }
>
>    inline T *operator->() const
>    {
>        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 *) {
># 239 "/usr/include/QtCore/qscopedpointer.h" 3 4
>    }
>
>    QScopedArrayPointer(const QScopedArrayPointer &); QScopedArrayPointer &operator=(const QScopedArrayPointer &);
>};
># 55 "/usr/include/QtCore/qobject.h" 2
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QEvent;
>class QTimerEvent;
>class QChildEvent;
>struct QMetaObject;
>class QVariant;
>class QObjectPrivate;
>class QObject;
>class QThread;
>class QWidget;
>
>class QRegExp;
>
>
>class QObjectUserData;
>
>
>typedef QList<QObject*> QObjectList;
>
>__attribute__((visibility("default"))) void qt_qFindChildren_helper(const QObject *parent, const QString &name, const QRegExp *re,
>                                           const QMetaObject &mo, QList<void *> *list);
>__attribute__((visibility("default"))) QObject *qt_qFindChild_helper(const QObject *parent, const QString &name, const QMetaObject &mo);
>
>class
>
>
>
>QObjectData {
>public:
>    virtual ~QObjectData() = 0;
>    QObject *q_ptr;
>    QObject *parent;
>    QObjectList children;
>
>    uint isWidget : 1;
>    uint pendTimer : 1;
>    uint blockSig : 1;
>    uint wasDeleted : 1;
>    uint ownObjectName : 1;
>    uint sendChildEvents : 1;
>    uint receiveChildEvents : 1;
>    uint inEventHandler : 1;
>    uint inThreadChangeEvent : 1;
>    uint hasGuards : 1;
>    uint unused : 22;
>    int postedEvents;
>    QMetaObject *metaObject;
>};
>
>
>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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __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 "/usr/include/QtCore/qobject.h"
>    QString objectName() const;
>    void setObjectName(const QString &name);
>
>    inline bool isWidgetType() const { return d_ptr->isWidget; }
>
>    inline bool signalsBlocked() const { return d_ptr->blockSig; }
>    bool blockSignals(bool b);
>
>    QThread *thread() const;
>    void moveToThread(QThread *thread);
>
>    int startTimer(int interval);
>    void killTimer(int id);
>
>    template<typename T>
>    inline T findChild(const QString &aName = QString()) const
>    { return static_cast<T>(qt_qFindChild_helper(this, aName, reinterpret_cast<T>(0)->staticMetaObject)); }
>
>    template<typename T>
>    inline QList<T> findChildren(const QString &aName = QString()) const
>    {
>        QList<T> list;
>        union {
>            QList<T> *typedList;
>            QList<void *> *voidList;
>        } u;
>        u.typedList = &list;
>        qt_qFindChildren_helper(this, aName, 0, reinterpret_cast<T>(0)->staticMetaObject, u.voidList);
>        return list;
>    }
>
>
>    template<typename T>
>    inline QList<T> findChildren(const QRegExp &re) const
>    {
>        QList<T> list;
>        union {
>            QList<T> *typedList;
>            QList<void *> *voidList;
>        } u;
>        u.typedList = &list;
>        qt_qFindChildren_helper(this, QString(), &re, reinterpret_cast<T>(0)->staticMetaObject, u.voidList);
>        return list;
>    }
># 197 "/usr/include/QtCore/qobject.h"
>    inline const QObjectList &children() const { return d_ptr->children; }
>
>    void setParent(QObject *);
>    void installEventFilter(QObject *);
>    void removeEventFilter(QObject *);
>
>
>    static bool connect(const QObject *sender, const char *signal,
>                        const QObject *receiver, const char *member, Qt::ConnectionType =
>
>
>
>
>
>
>                        Qt::AutoConnection
>
>
>        );
>
>    static bool connect(const QObject *sender, const QMetaMethod &signal,
>                        const QObject *receiver, const QMetaMethod &method,
>                        Qt::ConnectionType type =
>
>
>
>
>
>
>                        Qt::AutoConnection
>
>
>        );
>
>    inline bool connect(const QObject *sender, const char *signal,
>                        const char *member, Qt::ConnectionType type =
>
>
>
>
>
>
>                        Qt::AutoConnection
>
>
>        ) const;
>
>    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)
>        { return disconnect(this, signal, receiver, member); }
>    inline bool disconnect(const QObject *receiver, const char *member = 0)
>        { return disconnect(this, 0, receiver, member); }
>
>    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;
>
>
>protected:
>    void destroyed(QObject * = 0);
>
>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;
>
>    virtual void timerEvent(QTimerEvent *);
>    virtual void childEvent(QChildEvent *);
>    virtual void customEvent(QEvent *);
>
>    virtual void connectNotify(const char *signal);
>    virtual void disconnectNotify(const char *signal);
># 316 "/usr/include/QtCore/qobject.h"
>protected:
>    QObject(QObjectPrivate &dd, QObject *parent = 0);
>
>protected:
>    QScopedPointer<QObjectData> d_ptr;
>
>    static const QMetaObject staticQtMetaObject;
>
>    friend struct QMetaObject;
>    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 &);
>
>};
>
>inline bool 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();
>};
># 354 "/usr/include/QtCore/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; }
># 407 "/usr/include/QtCore/qobject.h"
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QObject *);
># 1 "/usr/include/QtCore/QObject" 2
># 22 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp" 2
># 1 "/usr/include/QtCore/QFile" 1
># 1 "/usr/include/QtCore/qfile.h" 1
># 45 "/usr/include/QtCore/qfile.h"
># 1 "/usr/include/QtCore/qiodevice.h" 1 3 4
># 46 "/usr/include/QtCore/qiodevice.h" 3 4
># 1 "/usr/include/QtCore/qobject.h" 1 3 4
># 47 "/usr/include/QtCore/qiodevice.h" 2 3 4
># 57 "/usr/include/QtCore/qiodevice.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __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;
>
>
>protected:
>    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 &);
># 204 "/usr/include/QtCore/qiodevice.h" 3 4
>};
>
> 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); }
># 246 "/usr/include/QtCore/qiodevice.h" 3 4
>class QDebug;
>__attribute__((visibility("default"))) QDebug operator<<(QDebug debug, QIODevice::OpenMode modes);
># 46 "/usr/include/QtCore/qfile.h" 2
>
># 1 "/usr/include/stdio.h" 1 3 4
># 30 "/usr/include/stdio.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/stdio.h" 2 3 4
># 75 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/libio.h" 1 3 4
># 32 "/usr/include/libio.h" 3 4
># 1 "/usr/include/_G_config.h" 1 3 4
># 15 "/usr/include/_G_config.h" 3 4
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stddef.h" 1 3 4
># 16 "/usr/include/_G_config.h" 2 3 4
>
>
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 21 "/usr/include/_G_config.h" 2 3 4
>
>typedef struct
>{
>  __off_t __pos;
>  __mbstate_t __state;
>} _G_fpos_t;
>typedef struct
>{
>  __off64_t __pos;
>  __mbstate_t __state;
>} _G_fpos64_t;
># 53 "/usr/include/_G_config.h" 3 4
>typedef int _G_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef int _G_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int _G_uint16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int _G_uint32_t __attribute__ ((__mode__ (__SI__)));
># 33 "/usr/include/libio.h" 2 3 4
># 172 "/usr/include/libio.h" 3 4
>struct _IO_jump_t; struct _IO_FILE;
># 182 "/usr/include/libio.h" 3 4
>typedef void _IO_lock_t;
>
>
>
>
>
>struct _IO_marker {
>  struct _IO_marker *_next;
>  struct _IO_FILE *_sbuf;
>
>
>
>  int _pos;
># 205 "/usr/include/libio.h" 3 4
>};
>
>
>enum __codecvt_result
>{
>  __codecvt_ok,
>  __codecvt_partial,
>  __codecvt_error,
>  __codecvt_noconv
>};
># 273 "/usr/include/libio.h" 3 4
>struct _IO_FILE {
>  int _flags;
>
>
>
>
>  char* _IO_read_ptr;
>  char* _IO_read_end;
>  char* _IO_read_base;
>  char* _IO_write_base;
>  char* _IO_write_ptr;
>  char* _IO_write_end;
>  char* _IO_buf_base;
>  char* _IO_buf_end;
>
>  char *_IO_save_base;
>  char *_IO_backup_base;
>  char *_IO_save_end;
>
>  struct _IO_marker *_markers;
>
>  struct _IO_FILE *_chain;
>
>  int _fileno;
>
>
>
>  int _flags2;
>
>  __off_t _old_offset;
>
>
>
>  unsigned short _cur_column;
>  signed char _vtable_offset;
>  char _shortbuf[1];
>
>
>
>  _IO_lock_t *_lock;
># 321 "/usr/include/libio.h" 3 4
>  __off64_t _offset;
># 330 "/usr/include/libio.h" 3 4
>  void *__pad1;
>  void *__pad2;
>  void *__pad3;
>  void *__pad4;
>  size_t __pad5;
>
>  int _mode;
>
>  char _unused2[15 * sizeof (int) - 4 * sizeof (void *) - sizeof (size_t)];
>
>};
>
>
>
>
>
>struct _IO_FILE_plus;
>
>extern struct _IO_FILE_plus _IO_2_1_stdin_;
>extern struct _IO_FILE_plus _IO_2_1_stdout_;
>extern struct _IO_FILE_plus _IO_2_1_stderr_;
># 366 "/usr/include/libio.h" 3 4
>typedef __ssize_t __io_read_fn (void *__cookie, char *__buf, size_t __nbytes);
>
>
>
>
>
>
>
>typedef __ssize_t __io_write_fn (void *__cookie, __const char *__buf,
>     size_t __n);
>
>
>
>
>
>
>
>typedef int __io_seek_fn (void *__cookie, __off64_t *__pos, int __w);
>
>
>typedef int __io_close_fn (void *__cookie);
>
>
>
>
>typedef __io_read_fn cookie_read_function_t;
>typedef __io_write_fn cookie_write_function_t;
>typedef __io_seek_fn cookie_seek_function_t;
>typedef __io_close_fn cookie_close_function_t;
>
>
>typedef struct
>{
>  __io_read_fn *read;
>  __io_write_fn *write;
>  __io_seek_fn *seek;
>  __io_close_fn *close;
>} _IO_cookie_io_functions_t;
>typedef _IO_cookie_io_functions_t cookie_io_functions_t;
>
>struct _IO_cookie_file;
>
>
>extern void _IO_cookie_init (struct _IO_cookie_file *__cfile, int __read_write,
>        void *__cookie, _IO_cookie_io_functions_t __fns);
>
>
>
>
>extern "C" {
>
>
>extern int __underflow (_IO_FILE *);
>extern int __uflow (_IO_FILE *);
>extern int __overflow (_IO_FILE *, int);
># 462 "/usr/include/libio.h" 3 4
>extern int _IO_getc (_IO_FILE *__fp);
>extern int _IO_putc (int __c, _IO_FILE *__fp);
>extern int _IO_feof (_IO_FILE *__fp) throw ();
>extern int _IO_ferror (_IO_FILE *__fp) throw ();
>
>extern int _IO_peekc_locked (_IO_FILE *__fp);
>
>
>
>
>
>extern void _IO_flockfile (_IO_FILE *) throw ();
>extern void _IO_funlockfile (_IO_FILE *) throw ();
>extern int _IO_ftrylockfile (_IO_FILE *) throw ();
># 492 "/usr/include/libio.h" 3 4
>extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict,
>   __gnuc_va_list, int *__restrict);
>extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict,
>    __gnuc_va_list);
>extern __ssize_t _IO_padn (_IO_FILE *, int, __ssize_t);
>extern size_t _IO_sgetn (_IO_FILE *, void *, size_t);
>
>extern __off64_t _IO_seekoff (_IO_FILE *, __off64_t, int, int);
>extern __off64_t _IO_seekpos (_IO_FILE *, __off64_t, int);
>
>extern void _IO_free_backup_area (_IO_FILE *) throw ();
># 554 "/usr/include/libio.h" 3 4
>}
># 76 "/usr/include/stdio.h" 2 3 4
># 109 "/usr/include/stdio.h" 3 4
>
>
>typedef _G_fpos_t fpos_t;
>
>
>
>
>
>typedef _G_fpos64_t fpos64_t;
># 165 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 166 "/usr/include/stdio.h" 2 3 4
>
>
>
>extern struct _IO_FILE *stdin;
>extern struct _IO_FILE *stdout;
>extern struct _IO_FILE *stderr;
># 181 "/usr/include/stdio.h" 3 4
>extern int remove (__const char *__filename) throw ();
>
>extern int rename (__const char *__old, __const char *__new) throw ();
>
>
>
>
>extern int renameat (int __oldfd, __const char *__old, int __newfd,
>       __const char *__new) throw ();
># 198 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile (void) __attribute__ ((__warn_unused_result__));
># 208 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile64 (void) __attribute__ ((__warn_unused_result__));
>
>
>
>extern char *tmpnam (char *__s) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern char *tmpnam_r (char *__s) throw () __attribute__ ((__warn_unused_result__));
># 230 "/usr/include/stdio.h" 3 4
>extern char *tempnam (__const char *__dir, __const char *__pfx)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__warn_unused_result__));
># 240 "/usr/include/stdio.h" 3 4
>extern int fclose (FILE *__stream);
>
>
>
>
>extern int fflush (FILE *__stream);
># 255 "/usr/include/stdio.h" 3 4
>extern int fflush_unlocked (FILE *__stream);
># 265 "/usr/include/stdio.h" 3 4
>extern int fcloseall (void);
># 275 "/usr/include/stdio.h" 3 4
>extern FILE *fopen (__const char *__restrict __filename,
>      __const char *__restrict __modes) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern FILE *freopen (__const char *__restrict __filename,
>        __const char *__restrict __modes,
>        FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
># 298 "/usr/include/stdio.h" 3 4
>
>
>extern FILE *fopen64 (__const char *__restrict __filename,
>        __const char *__restrict __modes) __attribute__ ((__warn_unused_result__));
>extern FILE *freopen64 (__const char *__restrict __filename,
>   __const char *__restrict __modes,
>   FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern FILE *fdopen (int __fd, __const char *__modes) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern FILE *fopencookie (void *__restrict __magic_cookie,
>     __const char *__restrict __modes,
>     _IO_cookie_io_functions_t __io_funcs) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern FILE *fmemopen (void *__s, size_t __len, __const char *__modes)
>  throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern FILE *open_memstream (char **__bufloc, size_t *__sizeloc) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) throw ();
>
>
>
>extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf,
>      int __modes, size_t __n) throw ();
>
>
>
>
>
>extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf,
>         size_t __size) throw ();
>
>
>extern void setlinebuf (FILE *__stream) throw ();
># 359 "/usr/include/stdio.h" 3 4
>extern int fprintf (FILE *__restrict __stream,
>      __const char *__restrict __format, ...);
>
>
>
>
>extern int printf (__const char *__restrict __format, ...);
>
>extern int sprintf (char *__restrict __s,
>      __const char *__restrict __format, ...) throw ();
>
>
>
>
>
>extern int vfprintf (FILE *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg);
>
>
>
>
>extern int vprintf (__const char *__restrict __format, __gnuc_va_list __arg);
>
>extern int vsprintf (char *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg) throw ();
>
>
>
>
>
>extern int snprintf (char *__restrict __s, size_t __maxlen,
>       __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 3, 4)));
>
>extern int vsnprintf (char *__restrict __s, size_t __maxlen,
>        __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 3, 0)));
>
>
>
>
>
>
>extern int vasprintf (char **__restrict __ptr, __const char *__restrict __f,
>        __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0))) __attribute__ ((__warn_unused_result__));
>extern int __asprintf (char **__restrict __ptr,
>         __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3))) __attribute__ ((__warn_unused_result__));
>extern int asprintf (char **__restrict __ptr,
>       __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3))) __attribute__ ((__warn_unused_result__));
># 420 "/usr/include/stdio.h" 3 4
>extern int vdprintf (int __fd, __const char *__restrict __fmt,
>       __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__printf__, 2, 0)));
>extern int dprintf (int __fd, __const char *__restrict __fmt, ...)
>     __attribute__ ((__format__ (__printf__, 2, 3)));
># 433 "/usr/include/stdio.h" 3 4
>extern int fscanf (FILE *__restrict __stream,
>     __const char *__restrict __format, ...) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern int scanf (__const char *__restrict __format, ...) __attribute__ ((__warn_unused_result__));
>
>extern int sscanf (__const char *__restrict __s,
>     __const char *__restrict __format, ...) throw ();
># 471 "/usr/include/stdio.h" 3 4
># 479 "/usr/include/stdio.h" 3 4
>extern int vfscanf (FILE *__restrict __s, __const char *__restrict __format,
>      __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 2, 0))) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern int vscanf (__const char *__restrict __format, __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 1, 0))) __attribute__ ((__warn_unused_result__));
>
>
>extern int vsscanf (__const char *__restrict __s,
>      __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__scanf__, 2, 0)));
># 530 "/usr/include/stdio.h" 3 4
># 539 "/usr/include/stdio.h" 3 4
>extern int fgetc (FILE *__stream);
>extern int getc (FILE *__stream);
>
>
>
>
>
>extern int getchar (void);
># 558 "/usr/include/stdio.h" 3 4
>extern int getc_unlocked (FILE *__stream);
>extern int getchar_unlocked (void);
># 569 "/usr/include/stdio.h" 3 4
>extern int fgetc_unlocked (FILE *__stream);
># 581 "/usr/include/stdio.h" 3 4
>extern int fputc (int __c, FILE *__stream);
>extern int putc (int __c, FILE *__stream);
>
>
>
>
>
>extern int putchar (int __c);
># 602 "/usr/include/stdio.h" 3 4
>extern int fputc_unlocked (int __c, FILE *__stream);
>
>
>
>
>
>
>
>extern int putc_unlocked (int __c, FILE *__stream);
>extern int putchar_unlocked (int __c);
>
>
>
>
>
>
>extern int getw (FILE *__stream);
>
>
>extern int putw (int __w, FILE *__stream);
># 630 "/usr/include/stdio.h" 3 4
>extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
>     __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>extern char *gets (char *__s) __attribute__ ((__warn_unused_result__));
># 648 "/usr/include/stdio.h" 3 4
>extern char *fgets_unlocked (char *__restrict __s, int __n,
>        FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
># 664 "/usr/include/stdio.h" 3 4
>extern __ssize_t __getdelim (char **__restrict __lineptr,
>          size_t *__restrict __n, int __delimiter,
>          FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern __ssize_t getdelim (char **__restrict __lineptr,
>        size_t *__restrict __n, int __delimiter,
>        FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>
>
>extern __ssize_t getline (char **__restrict __lineptr,
>       size_t *__restrict __n,
>       FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
># 688 "/usr/include/stdio.h" 3 4
>extern int fputs (__const char *__restrict __s, FILE *__restrict __stream);
>
>
>
>
>
>extern int puts (__const char *__s);
>
>
>
>
>
>
>extern int ungetc (int __c, FILE *__stream);
>
>
>
>
>
>
>extern size_t fread (void *__restrict __ptr, size_t __size,
>       size_t __n, FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern size_t fwrite (__const void *__restrict __ptr, size_t __size,
>        size_t __n, FILE *__restrict __s) __attribute__ ((__warn_unused_result__));
># 725 "/usr/include/stdio.h" 3 4
>extern int fputs_unlocked (__const char *__restrict __s,
>      FILE *__restrict __stream);
># 736 "/usr/include/stdio.h" 3 4
>extern size_t fread_unlocked (void *__restrict __ptr, size_t __size,
>         size_t __n, FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern size_t fwrite_unlocked (__const void *__restrict __ptr, size_t __size,
>          size_t __n, FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
># 748 "/usr/include/stdio.h" 3 4
>extern int fseek (FILE *__stream, long int __off, int __whence);
>
>
>
>
>extern long int ftell (FILE *__stream) __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern void rewind (FILE *__stream);
># 772 "/usr/include/stdio.h" 3 4
>extern int fseeko (FILE *__stream, __off_t __off, int __whence);
>
>
>
>
>extern __off_t ftello (FILE *__stream) __attribute__ ((__warn_unused_result__));
># 791 "/usr/include/stdio.h" 3 4
>
>
>
>
>
>
>extern int fgetpos (FILE *__restrict __stream, fpos_t *__restrict __pos);
>
>
>
>
>extern int fsetpos (FILE *__stream, __const fpos_t *__pos);
># 814 "/usr/include/stdio.h" 3 4
>
>
>
>extern int fseeko64 (FILE *__stream, __off64_t __off, int __whence);
>extern __off64_t ftello64 (FILE *__stream) __attribute__ ((__warn_unused_result__));
>extern int fgetpos64 (FILE *__restrict __stream, fpos64_t *__restrict __pos);
>extern int fsetpos64 (FILE *__stream, __const fpos64_t *__pos);
>
>
>
>
>extern void clearerr (FILE *__stream) throw ();
>
>extern int feof (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
>
>extern int ferror (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern void clearerr_unlocked (FILE *__stream) throw ();
>extern int feof_unlocked (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
>extern int ferror_unlocked (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
># 845 "/usr/include/stdio.h" 3 4
>extern void perror (__const char *__s);
>
>
>
>
>
>
># 1 "/usr/include/bits/sys_errlist.h" 1 3 4
># 27 "/usr/include/bits/sys_errlist.h" 3 4
>extern int sys_nerr;
>extern __const char *__const sys_errlist[];
>
>
>extern int _sys_nerr;
>extern __const char *__const _sys_errlist[];
># 853 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>extern int fileno (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
>
>
>
>
>extern int fileno_unlocked (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
># 872 "/usr/include/stdio.h" 3 4
>extern FILE *popen (__const char *__command, __const char *__modes) __attribute__ ((__warn_unused_result__));
>
>
>
>
>
>extern int pclose (FILE *__stream);
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
>
>
>
>
>
>extern char *cuserid (char *__s);
>
>
>
>
>struct obstack;
>
>
>extern int obstack_printf (struct obstack *__restrict __obstack,
>      __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>extern int obstack_vprintf (struct obstack *__restrict __obstack,
>       __const char *__restrict __format,
>       __gnuc_va_list __args)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0)));
>
>
>
>
>
>
>
>extern void flockfile (FILE *__stream) throw ();
>
>
>
>extern int ftrylockfile (FILE *__stream) throw () __attribute__ ((__warn_unused_result__));
>
>
>extern void funlockfile (FILE *__stream) throw ();
># 933 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio.h" 1 3 4
># 44 "/usr/include/bits/stdio.h" 3 4
>extern __inline __attribute__ ((__gnu_inline__)) int
>getchar (void)
>{
>  return _IO_getc (stdin);
>}
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>fgetc_unlocked (FILE *__fp)
>{
>  return (__builtin_expect (((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end), 0) ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>getc_unlocked (FILE *__fp)
>{
>  return (__builtin_expect (((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end), 0) ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
>}
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>getchar_unlocked (void)
>{
>  return (__builtin_expect (((stdin)->_IO_read_ptr >= (stdin)->_IO_read_end), 0) ? __uflow (stdin) : *(unsigned char *) (stdin)->_IO_read_ptr++);
>}
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>putchar (int __c)
>{
>  return _IO_putc (__c, stdout);
>}
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>fputc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end), 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>putc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end), 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>putchar_unlocked (int __c)
>{
>  return (__builtin_expect (((stdout)->_IO_write_ptr >= (stdout)->_IO_write_end), 0) ? __overflow (stdout, (unsigned char) (__c)) : (unsigned char) (*(stdout)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) __ssize_t
>getline (char **__lineptr, size_t *__n, FILE *__stream)
>{
>  return __getdelim (__lineptr, __n, '\n', __stream);
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>__attribute__ ((__leaf__)) feof_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x10) != 0);
>}
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>__attribute__ ((__leaf__)) ferror_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x20) != 0);
>}
># 934 "/usr/include/stdio.h" 2 3 4
>
>
># 1 "/usr/include/bits/stdio2.h" 1 3 4
># 24 "/usr/include/bits/stdio2.h" 3 4
>extern int __sprintf_chk (char *__restrict __s, int __flag, size_t __slen,
>     __const char *__restrict __format, ...) throw ();
>extern int __vsprintf_chk (char *__restrict __s, int __flag, size_t __slen,
>      __const char *__restrict __format,
>      __gnuc_va_list __ap) throw ();
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) sprintf (char *__restrict __s, __const char *__restrict __fmt, ...) throw ()
>{
>  return __builtin___sprintf_chk (__s, 2 - 1,
>      __builtin_object_size (__s, 2 > 1), __fmt, __builtin_va_arg_pack ());
>}
>
>
>
>
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) vsprintf (char *__restrict __s, __const char *__restrict __fmt, __gnuc_va_list __ap) throw ()
>
>{
>  return __builtin___vsprintf_chk (__s, 2 - 1,
>       __builtin_object_size (__s, 2 > 1), __fmt, __ap);
>}
>
>
>
>extern int __snprintf_chk (char *__restrict __s, size_t __n, int __flag,
>      size_t __slen, __const char *__restrict __format,
>      ...) throw ();
>extern int __vsnprintf_chk (char *__restrict __s, size_t __n, int __flag,
>       size_t __slen, __const char *__restrict __format,
>       __gnuc_va_list __ap) throw ();
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) snprintf (char *__restrict __s, size_t __n, __const char *__restrict __fmt, ...) throw ()
>
>{
>  return __builtin___snprintf_chk (__s, __n, 2 - 1,
>       __builtin_object_size (__s, 2 > 1), __fmt, __builtin_va_arg_pack ());
>}
>
>
>
>
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) vsnprintf (char *__restrict __s, size_t __n, __const char *__restrict __fmt, __gnuc_va_list __ap) throw ()
>
>{
>  return __builtin___vsnprintf_chk (__s, __n, 2 - 1,
>        __builtin_object_size (__s, 2 > 1), __fmt, __ap);
>}
>
>
>
>
>
>extern int __fprintf_chk (FILE *__restrict __stream, int __flag,
>     __const char *__restrict __format, ...);
>extern int __printf_chk (int __flag, __const char *__restrict __format, ...);
>extern int __vfprintf_chk (FILE *__restrict __stream, int __flag,
>      __const char *__restrict __format, __gnuc_va_list __ap);
>extern int __vprintf_chk (int __flag, __const char *__restrict __format,
>     __gnuc_va_list __ap);
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>fprintf (FILE *__restrict __stream, __const char *__restrict __fmt, ...)
>{
>  return __fprintf_chk (__stream, 2 - 1, __fmt,
>   __builtin_va_arg_pack ());
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>printf (__const char *__restrict __fmt, ...)
>{
>  return __printf_chk (2 - 1, __fmt, __builtin_va_arg_pack ());
>}
>
>
>
>
>
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>vprintf (__const char *__restrict __fmt, __gnuc_va_list __ap)
>{
>
>  return __vfprintf_chk (stdout, 2 - 1, __fmt, __ap);
>
>
>
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>vfprintf (FILE *__restrict __stream,
>   __const char *__restrict __fmt, __gnuc_va_list __ap)
>{
>  return __vfprintf_chk (__stream, 2 - 1, __fmt, __ap);
>}
>
>
>
>extern int __asprintf_chk (char **__restrict __ptr, int __flag,
>      __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 3, 4))) __attribute__ ((__warn_unused_result__));
>extern int __vasprintf_chk (char **__restrict __ptr, int __flag,
>       __const char *__restrict __fmt, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 3, 0))) __attribute__ ((__warn_unused_result__));
>extern int __dprintf_chk (int __fd, int __flag, __const char *__restrict __fmt,
>     ...) __attribute__ ((__format__ (__printf__, 3, 4)));
>extern int __vdprintf_chk (int __fd, int __flag,
>      __const char *__restrict __fmt, __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__printf__, 3, 0)));
>extern int __obstack_printf_chk (struct obstack *__restrict __obstack,
>     int __flag, __const char *__restrict __format,
>     ...)
>     throw () __attribute__ ((__format__ (__printf__, 3, 4)));
>extern int __obstack_vprintf_chk (struct obstack *__restrict __obstack,
>      int __flag,
>      __const char *__restrict __format,
>      __gnuc_va_list __args)
>     throw () __attribute__ ((__format__ (__printf__, 3, 0)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) asprintf (char **__restrict __ptr, __const char *__restrict __fmt, ...) throw ()
>{
>  return __asprintf_chk (__ptr, 2 - 1, __fmt,
>    __builtin_va_arg_pack ());
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) __asprintf (char **__restrict __ptr, __const char *__restrict __fmt, ...) throw ()
>
>{
>  return __asprintf_chk (__ptr, 2 - 1, __fmt,
>    __builtin_va_arg_pack ());
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>dprintf (int __fd, __const char *__restrict __fmt, ...)
>{
>  return __dprintf_chk (__fd, 2 - 1, __fmt,
>   __builtin_va_arg_pack ());
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) obstack_printf (struct obstack *__restrict __obstack, __const char *__restrict __fmt, ...) throw ()
>
>{
>  return __obstack_printf_chk (__obstack, 2 - 1, __fmt,
>          __builtin_va_arg_pack ());
>}
># 195 "/usr/include/bits/stdio2.h" 3 4
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) vasprintf (char **__restrict __ptr, __const char *__restrict __fmt, __gnuc_va_list __ap) throw ()
>
>{
>  return __vasprintf_chk (__ptr, 2 - 1, __fmt, __ap);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>vdprintf (int __fd, __const char *__restrict __fmt, __gnuc_va_list __ap)
>{
>  return __vdprintf_chk (__fd, 2 - 1, __fmt, __ap);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) obstack_vprintf (struct obstack *__restrict __obstack, __const char *__restrict __fmt, __gnuc_va_list __ap) throw ()
>
>{
>  return __obstack_vprintf_chk (__obstack, 2 - 1, __fmt,
>    __ap);
>}
>
>
>
>
>
>extern char *__gets_chk (char *__str, size_t) __attribute__ ((__warn_unused_result__));
>extern char *__gets_warn (char *__str) __asm__ ("" "gets")
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("please use fgets or getline instead, gets can't " "specify buffer size")))
>                               ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) char *
>gets (char *__str)
>{
>  if (__builtin_object_size (__str, 2 > 1) != (size_t) -1)
>    return __gets_chk (__str, __builtin_object_size (__str, 2 > 1));
>  return __gets_warn (__str);
>}
>
>extern char *__fgets_chk (char *__restrict __s, size_t __size, int __n,
>     FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern char *__fgets_alias (char *__restrict __s, int __n, FILE *__restrict __stream) __asm__ ("" "fgets")
>
>                                        __attribute__ ((__warn_unused_result__));
>extern char *__fgets_chk_warn (char *__restrict __s, size_t __size, int __n, FILE *__restrict __stream) __asm__ ("" "__fgets_chk")
>
>
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("fgets called with bigger size than length " "of destination buffer")))
>                                 ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) char *
>fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
>{
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n) || __n <= 0)
> return __fgets_chk (__s, __builtin_object_size (__s, 2 > 1), __n, __stream);
>
>      if ((size_t) __n > __builtin_object_size (__s, 2 > 1))
> return __fgets_chk_warn (__s, __builtin_object_size (__s, 2 > 1), __n, __stream);
>    }
>  return __fgets_alias (__s, __n, __stream);
>}
>
>extern size_t __fread_chk (void *__restrict __ptr, size_t __ptrlen,
>      size_t __size, size_t __n,
>      FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern size_t __fread_alias (void *__restrict __ptr, size_t __size, size_t __n, FILE *__restrict __stream) __asm__ ("" "fread")
>
>
>            __attribute__ ((__warn_unused_result__));
>extern size_t __fread_chk_warn (void *__restrict __ptr, size_t __ptrlen, size_t __size, size_t __n, FILE *__restrict __stream) __asm__ ("" "__fread_chk")
>
>
>
>
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("fread called with bigger size * nmemb than length " "of destination buffer")))
>                                 ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) size_t
>fread (void *__restrict __ptr, size_t __size, size_t __n,
>       FILE *__restrict __stream)
>{
>  if (__builtin_object_size (__ptr, 0) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__size)
>   || !__builtin_constant_p (__n)
>   || (__size | __n) >= (((size_t) 1) << (8 * sizeof (size_t) / 2)))
> return __fread_chk (__ptr, __builtin_object_size (__ptr, 0), __size, __n, __stream);
>
>      if (__size * __n > __builtin_object_size (__ptr, 0))
> return __fread_chk_warn (__ptr, __builtin_object_size (__ptr, 0), __size, __n, __stream);
>    }
>  return __fread_alias (__ptr, __size, __n, __stream);
>}
>
>
>extern char *__fgets_unlocked_chk (char *__restrict __s, size_t __size,
>       int __n, FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern char *__fgets_unlocked_alias (char *__restrict __s, int __n, FILE *__restrict __stream) __asm__ ("" "fgets_unlocked")
>
>                                                 __attribute__ ((__warn_unused_result__));
>extern char *__fgets_unlocked_chk_warn (char *__restrict __s, size_t __size, int __n, FILE *__restrict __stream) __asm__ ("" "__fgets_unlocked_chk")
>
>
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("fgets_unlocked called with bigger size than length " "of destination buffer")))
>                                 ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) char *
>fgets_unlocked (char *__restrict __s, int __n, FILE *__restrict __stream)
>{
>  if (__builtin_object_size (__s, 2 > 1) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__n) || __n <= 0)
> return __fgets_unlocked_chk (__s, __builtin_object_size (__s, 2 > 1), __n, __stream);
>
>      if ((size_t) __n > __builtin_object_size (__s, 2 > 1))
> return __fgets_unlocked_chk_warn (__s, __builtin_object_size (__s, 2 > 1), __n, __stream);
>    }
>  return __fgets_unlocked_alias (__s, __n, __stream);
>}
>
>
>
>
>extern size_t __fread_unlocked_chk (void *__restrict __ptr, size_t __ptrlen,
>        size_t __size, size_t __n,
>        FILE *__restrict __stream) __attribute__ ((__warn_unused_result__));
>extern size_t __fread_unlocked_alias (void *__restrict __ptr, size_t __size, size_t __n, FILE *__restrict __stream) __asm__ ("" "fread_unlocked")
>
>
>                     __attribute__ ((__warn_unused_result__));
>extern size_t __fread_unlocked_chk_warn (void *__restrict __ptr, size_t __ptrlen, size_t __size, size_t __n, FILE *__restrict __stream) __asm__ ("" "__fread_unlocked_chk")
>
>
>
>
>     __attribute__ ((__warn_unused_result__)) __attribute__((__warning__ ("fread_unlocked called with bigger size * nmemb than " "length of destination buffer")))
>                                        ;
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __attribute__ ((__warn_unused_result__)) size_t
>fread_unlocked (void *__restrict __ptr, size_t __size, size_t __n,
>  FILE *__restrict __stream)
>{
>  if (__builtin_object_size (__ptr, 0) != (size_t) -1)
>    {
>      if (!__builtin_constant_p (__size)
>   || !__builtin_constant_p (__n)
>   || (__size | __n) >= (((size_t) 1) << (8 * sizeof (size_t) / 2)))
> return __fread_unlocked_chk (__ptr, __builtin_object_size (__ptr, 0), __size, __n,
>         __stream);
>
>      if (__size * __n > __builtin_object_size (__ptr, 0))
> return __fread_unlocked_chk_warn (__ptr, __builtin_object_size (__ptr, 0), __size, __n,
>       __stream);
>    }
>
>
>  if (__builtin_constant_p (__size)
>      && __builtin_constant_p (__n)
>      && (__size | __n) < (((size_t) 1) << (8 * sizeof (size_t) / 2))
>      && __size * __n <= 8)
>    {
>      size_t __cnt = __size * __n;
>      char *__cptr = (char *) __ptr;
>      if (__cnt == 0)
> return 0;
>
>      for (; __cnt > 0; --__cnt)
> {
>   int __c = (__builtin_expect (((__stream)->_IO_read_ptr >= (__stream)->_IO_read_end), 0) ? __uflow (__stream) : *(unsigned char *) (__stream)->_IO_read_ptr++);
>   if (__c == (-1))
>     break;
>   *__cptr++ = __c;
> }
>      return (__cptr - (char *) __ptr) / __size;
>    }
>
>  return __fread_unlocked_alias (__ptr, __size, __n, __stream);
>}
># 937 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>
>}
># 48 "/usr/include/QtCore/qfile.h" 2
># 56 "/usr/include/QtCore/qfile.h"
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QAbstractFileEngine;
>class QFilePrivate;
>
>class __attribute__((visibility("default"))) QFile : public QIODevice
>{
>
>    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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
>
>    inline QFilePrivate* d_func() { return reinterpret_cast<QFilePrivate *>(qGetPtrHelper(d_ptr)); } inline const QFilePrivate* d_func() const { return reinterpret_cast<const QFilePrivate *>(qGetPtrHelper(d_ptr)); } friend class QFilePrivate;
>
>public:
>
>    enum FileError {
>        NoError = 0,
>        ReadError = 1,
>        WriteError = 2,
>        FatalError = 3,
>        ResourceError = 4,
>        OpenError = 5,
>        AbortError = 6,
>        TimeOutError = 7,
>        UnspecifiedError = 8,
>        RemoveError = 9,
>        RenameError = 10,
>        PositionError = 11,
>        ResizeError = 12,
>        PermissionsError = 13,
>        CopyError = 14
>
>
>
>    };
>
>    enum Permission {
>        ReadOwner = 0x4000, WriteOwner = 0x2000, ExeOwner = 0x1000,
>        ReadUser = 0x0400, WriteUser = 0x0200, ExeUser = 0x0100,
>        ReadGroup = 0x0040, WriteGroup = 0x0020, ExeGroup = 0x0010,
>        ReadOther = 0x0004, WriteOther = 0x0002, ExeOther = 0x0001
>    };
>    typedef QFlags<Permission> Permissions;
>
>    enum FileHandleFlag {
>        AutoCloseHandle = 0x0001,
>        DontCloseHandle = 0
>    };
>    typedef QFlags<FileHandleFlag> FileHandleFlags;
>
>    QFile();
>    QFile(const QString &name);
>
>    explicit QFile(QObject *parent);
>    QFile(const QString &name, QObject *parent);
>
>    ~QFile();
>
>    FileError error() const;
>    void unsetError();
>
>    QString fileName() const;
>    void setFileName(const QString &name);
>
>    typedef QByteArray (*EncoderFn)(const QString &fileName);
>    typedef QString (*DecoderFn)(const QByteArray &localfileName);
>    static QByteArray encodeName(const QString &fileName);
>    static QString decodeName(const QByteArray &localFileName);
>    inline static QString decodeName(const char *localFileName)
>        { return decodeName(QByteArray(localFileName)); }
>    static void setEncodingFunction(EncoderFn);
>    static void setDecodingFunction(DecoderFn);
>
>    bool exists() const;
>    static bool exists(const QString &fileName);
>
>    QString readLink() const;
>    static QString readLink(const QString &fileName);
>    inline QString symLinkTarget() const { return readLink(); }
>    inline static QString symLinkTarget(const QString &fileName) { return readLink(fileName); }
>
>    bool remove();
>    static bool remove(const QString &fileName);
>
>    bool rename(const QString &newName);
>    static bool rename(const QString &oldName, const QString &newName);
>
>    bool link(const QString &newName);
>    static bool link(const QString &oldname, const QString &newName);
>
>    bool copy(const QString &newName);
>    static bool copy(const QString &fileName, const QString &newName);
>
>    bool isSequential() const;
>
>    bool open(OpenMode flags);
>    bool open(FILE *f, OpenMode flags);
>    bool open(int fd, OpenMode flags);
>
>
>
>    bool open(FILE *f, OpenMode ioFlags, FileHandleFlags handleFlags);
>    bool open(int fd, OpenMode ioFlags, FileHandleFlags handleFlags);
>    virtual void close();
>
>    qint64 size() const;
>    qint64 pos() const;
>    bool seek(qint64 offset);
>    bool atEnd() const;
>    bool flush();
>
>    bool resize(qint64 sz);
>    static bool resize(const QString &filename, qint64 sz);
>
>    Permissions permissions() const;
>    static Permissions permissions(const QString &filename);
>    bool setPermissions(Permissions permissionSpec);
>    static bool setPermissions(const QString &filename, Permissions permissionSpec);
>
>    int handle() const;
>
>    enum MemoryMapFlags {
>        NoOptions = 0
>    };
>
>    uchar *map(qint64 offset, qint64 size, MemoryMapFlags flags = NoOptions);
>    bool unmap(uchar *address);
>
>    virtual QAbstractFileEngine *fileEngine() const;
># 197 "/usr/include/QtCore/qfile.h"
>protected:
>
>
>
>    QFile(QFilePrivate &dd, QObject *parent = 0);
>
>
>    qint64 readData(char *data, qint64 maxlen);
>    qint64 writeData(const char *data, qint64 len);
>    qint64 readLineData(char *data, qint64 maxlen);
>
>private:
>    QFile(const QFile &); QFile &operator=(const QFile &);
>};
>
> inline QFlags<QFile::Permissions::enum_type> operator|(QFile::Permissions::enum_type f1, QFile::Permissions::enum_type f2) { return QFlags<QFile::Permissions::enum_type>(f1) | f2; } inline QFlags<QFile::Permissions::enum_type> operator|(QFile::Permissions::enum_type f1, QFlags<QFile::Permissions::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(QFile::Permissions::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); }
># 1 "/usr/include/QtCore/QFile" 2
># 23 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h" 1
># 23 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h"
># 1 "/usr/include/QtCore/QObject" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h" 2
># 1 "/usr/include/QtCore/QMap" 1
># 1 "/usr/include/QtCore/qmap.h" 1
># 50 "/usr/include/QtCore/qmap.h"
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/map" 1 3
># 58 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/map" 3
># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/map" 3
>
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 1 3
># 68 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
># 88 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>  enum _Rb_tree_color { _S_red = false, _S_black = true };
>
>  struct _Rb_tree_node_base
>  {
>    typedef _Rb_tree_node_base* _Base_ptr;
>    typedef const _Rb_tree_node_base* _Const_Base_ptr;
>
>    _Rb_tree_color _M_color;
>    _Base_ptr _M_parent;
>    _Base_ptr _M_left;
>    _Base_ptr _M_right;
>
>    static _Base_ptr
>    _S_minimum(_Base_ptr __x)
>    {
>      while (__x->_M_left != 0) __x = __x->_M_left;
>      return __x;
>    }
>
>    static _Const_Base_ptr
>    _S_minimum(_Const_Base_ptr __x)
>    {
>      while (__x->_M_left != 0) __x = __x->_M_left;
>      return __x;
>    }
>
>    static _Base_ptr
>    _S_maximum(_Base_ptr __x)
>    {
>      while (__x->_M_right != 0) __x = __x->_M_right;
>      return __x;
>    }
>
>    static _Const_Base_ptr
>    _S_maximum(_Const_Base_ptr __x)
>    {
>      while (__x->_M_right != 0) __x = __x->_M_right;
>      return __x;
>    }
>  };
>
>  template<typename _Val>
>    struct _Rb_tree_node : public _Rb_tree_node_base
>    {
>      typedef _Rb_tree_node<_Val>* _Link_type;
>      _Val _M_value_field;
>
>
>
>
>
>
>
>    };
>
>  __attribute__ ((__pure__)) _Rb_tree_node_base*
>  _Rb_tree_increment(_Rb_tree_node_base* __x) throw ();
>
>  __attribute__ ((__pure__)) const _Rb_tree_node_base*
>  _Rb_tree_increment(const _Rb_tree_node_base* __x) throw ();
>
>  __attribute__ ((__pure__)) _Rb_tree_node_base*
>  _Rb_tree_decrement(_Rb_tree_node_base* __x) throw ();
>
>  __attribute__ ((__pure__)) const _Rb_tree_node_base*
>  _Rb_tree_decrement(const _Rb_tree_node_base* __x) throw ();
>
>  template<typename _Tp>
>    struct _Rb_tree_iterator
>    {
>      typedef _Tp value_type;
>      typedef _Tp& reference;
>      typedef _Tp* pointer;
>
>      typedef bidirectional_iterator_tag iterator_category;
>      typedef ptrdiff_t difference_type;
>
>      typedef _Rb_tree_iterator<_Tp> _Self;
>      typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
>      typedef _Rb_tree_node<_Tp>* _Link_type;
>
>      _Rb_tree_iterator()
>      : _M_node() { }
>
>      explicit
>      _Rb_tree_iterator(_Link_type __x)
>      : _M_node(__x) { }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return std::__addressof(static_cast<_Link_type>
>    (_M_node)->_M_value_field); }
>
>      _Self&
>      operator++()
>      {
> _M_node = _Rb_tree_increment(_M_node);
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_increment(_M_node);
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> _M_node = _Rb_tree_decrement(_M_node);
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_decrement(_M_node);
> 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; }
>
>      _Base_ptr _M_node;
>  };
>
>  template<typename _Tp>
>    struct _Rb_tree_const_iterator
>    {
>      typedef _Tp value_type;
>      typedef const _Tp& reference;
>      typedef const _Tp* pointer;
>
>      typedef _Rb_tree_iterator<_Tp> iterator;
>
>      typedef bidirectional_iterator_tag iterator_category;
>      typedef ptrdiff_t difference_type;
>
>      typedef _Rb_tree_const_iterator<_Tp> _Self;
>      typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
>      typedef const _Rb_tree_node<_Tp>* _Link_type;
>
>      _Rb_tree_const_iterator()
>      : _M_node() { }
>
>      explicit
>      _Rb_tree_const_iterator(_Link_type __x)
>      : _M_node(__x) { }
>
>      _Rb_tree_const_iterator(const iterator& __it)
>      : _M_node(__it._M_node) { }
>
>      iterator
>      _M_const_cast() const
>      { return iterator(static_cast<typename iterator::_Link_type>
>   (const_cast<typename iterator::_Base_ptr>(_M_node))); }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return std::__addressof(static_cast<_Link_type>
>    (_M_node)->_M_value_field); }
>
>      _Self&
>      operator++()
>      {
> _M_node = _Rb_tree_increment(_M_node);
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_increment(_M_node);
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> _M_node = _Rb_tree_decrement(_M_node);
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_decrement(_M_node);
> 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; }
>
>      _Base_ptr _M_node;
>    };
>
>  template<typename _Val>
>    inline bool
>    operator==(const _Rb_tree_iterator<_Val>& __x,
>               const _Rb_tree_const_iterator<_Val>& __y)
>    { return __x._M_node == __y._M_node; }
>
>  template<typename _Val>
>    inline bool
>    operator!=(const _Rb_tree_iterator<_Val>& __x,
>               const _Rb_tree_const_iterator<_Val>& __y)
>    { return __x._M_node != __y._M_node; }
>
>  void
>  _Rb_tree_insert_and_rebalance(const bool __insert_left,
>                                _Rb_tree_node_base* __x,
>                                _Rb_tree_node_base* __p,
>                                _Rb_tree_node_base& __header) throw ();
>
>  _Rb_tree_node_base*
>  _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
>          _Rb_tree_node_base& __header) throw ();
>
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc = allocator<_Val> >
>    class _Rb_tree
>    {
>      typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other
>              _Node_allocator;
>
>    protected:
>      typedef _Rb_tree_node_base* _Base_ptr;
>      typedef const _Rb_tree_node_base* _Const_Base_ptr;
>
>    public:
>      typedef _Key key_type;
>      typedef _Val value_type;
>      typedef value_type* pointer;
>      typedef const value_type* const_pointer;
>      typedef value_type& reference;
>      typedef const value_type& const_reference;
>      typedef _Rb_tree_node<_Val>* _Link_type;
>      typedef const _Rb_tree_node<_Val>* _Const_Link_type;
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Alloc allocator_type;
>
>      _Node_allocator&
>      _M_get_Node_allocator()
>      { return *static_cast<_Node_allocator*>(&this->_M_impl); }
>
>      const _Node_allocator&
>      _M_get_Node_allocator() const
>      { return *static_cast<const _Node_allocator*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_get_Node_allocator()); }
>
>    protected:
>      _Link_type
>      _M_get_node()
>      { return _M_impl._Node_allocator::allocate(1); }
>
>      void
>      _M_put_node(_Link_type __p)
>      { _M_impl._Node_allocator::deallocate(__p, 1); }
>
>
>      _Link_type
>      _M_create_node(const value_type& __x)
>      {
> _Link_type __tmp = _M_get_node();
> try
>   { get_allocator().construct
>       (std::__addressof(__tmp->_M_value_field), __x); }
> catch(...)
>   {
>     _M_put_node(__tmp);
>     throw;
>   }
> return __tmp;
>      }
>
>      void
>      _M_destroy_node(_Link_type __p)
>      {
> get_allocator().destroy(std::__addressof(__p->_M_value_field));
> _M_put_node(__p);
>      }
># 424 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>      _Link_type
>      _M_clone_node(_Const_Link_type __x)
>      {
> _Link_type __tmp = _M_create_node(__x->_M_value_field);
> __tmp->_M_color = __x->_M_color;
> __tmp->_M_left = 0;
> __tmp->_M_right = 0;
> return __tmp;
>      }
>
>    protected:
>      template<typename _Key_compare,
>        bool _Is_pod_comparator = __is_pod(_Key_compare)>
>        struct _Rb_tree_impl : public _Node_allocator
>        {
>   _Key_compare _M_key_compare;
>   _Rb_tree_node_base _M_header;
>   size_type _M_node_count;
>
>   _Rb_tree_impl()
>   : _Node_allocator(), _M_key_compare(), _M_header(),
>     _M_node_count(0)
>   { _M_initialize(); }
>
>   _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a)
>   : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
>     _M_node_count(0)
>   { _M_initialize(); }
># 460 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
> private:
>   void
>   _M_initialize()
>   {
>     this->_M_header._M_color = _S_red;
>     this->_M_header._M_parent = 0;
>     this->_M_header._M_left = &this->_M_header;
>     this->_M_header._M_right = &this->_M_header;
>   }
> };
>
>      _Rb_tree_impl<_Compare> _M_impl;
>
>    protected:
>      _Base_ptr&
>      _M_root()
>      { return this->_M_impl._M_header._M_parent; }
>
>      _Const_Base_ptr
>      _M_root() const
>      { return this->_M_impl._M_header._M_parent; }
>
>      _Base_ptr&
>      _M_leftmost()
>      { return this->_M_impl._M_header._M_left; }
>
>      _Const_Base_ptr
>      _M_leftmost() const
>      { return this->_M_impl._M_header._M_left; }
>
>      _Base_ptr&
>      _M_rightmost()
>      { return this->_M_impl._M_header._M_right; }
>
>      _Const_Base_ptr
>      _M_rightmost() const
>      { return this->_M_impl._M_header._M_right; }
>
>      _Link_type
>      _M_begin()
>      { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
>
>      _Const_Link_type
>      _M_begin() const
>      {
> return static_cast<_Const_Link_type>
>   (this->_M_impl._M_header._M_parent);
>      }
>
>      _Link_type
>      _M_end()
>      { return static_cast<_Link_type>(&this->_M_impl._M_header); }
>
>      _Const_Link_type
>      _M_end() const
>      { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }
>
>      static const_reference
>      _S_value(_Const_Link_type __x)
>      { return __x->_M_value_field; }
>
>      static const _Key&
>      _S_key(_Const_Link_type __x)
>      { return _KeyOfValue()(_S_value(__x)); }
>
>      static _Link_type
>      _S_left(_Base_ptr __x)
>      { return static_cast<_Link_type>(__x->_M_left); }
>
>      static _Const_Link_type
>      _S_left(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x->_M_left); }
>
>      static _Link_type
>      _S_right(_Base_ptr __x)
>      { return static_cast<_Link_type>(__x->_M_right); }
>
>      static _Const_Link_type
>      _S_right(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x->_M_right); }
>
>      static const_reference
>      _S_value(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x)->_M_value_field; }
>
>      static const _Key&
>      _S_key(_Const_Base_ptr __x)
>      { return _KeyOfValue()(_S_value(__x)); }
>
>      static _Base_ptr
>      _S_minimum(_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_minimum(__x); }
>
>      static _Const_Base_ptr
>      _S_minimum(_Const_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_minimum(__x); }
>
>      static _Base_ptr
>      _S_maximum(_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_maximum(__x); }
>
>      static _Const_Base_ptr
>      _S_maximum(_Const_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_maximum(__x); }
>
>    public:
>      typedef _Rb_tree_iterator<value_type> iterator;
>      typedef _Rb_tree_const_iterator<value_type> const_iterator;
>
>      typedef std::reverse_iterator<iterator> reverse_iterator;
>      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>
>    private:
># 586 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>      iterator
>      _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y,
>   const value_type& __v);
>
>
>
>      iterator
>      _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
>
>      iterator
>      _M_insert_equal_lower(const value_type& __x);
>
>
>      _Link_type
>      _M_copy(_Const_Link_type __x, _Link_type __p);
>
>      void
>      _M_erase(_Link_type __x);
>
>      iterator
>      _M_lower_bound(_Link_type __x, _Link_type __y,
>       const _Key& __k);
>
>      const_iterator
>      _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,
>       const _Key& __k) const;
>
>      iterator
>      _M_upper_bound(_Link_type __x, _Link_type __y,
>       const _Key& __k);
>
>      const_iterator
>      _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,
>       const _Key& __k) const;
>
>    public:
>
>      _Rb_tree() { }
>
>      _Rb_tree(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_impl(__comp, _Node_allocator(__a)) { }
>
>      _Rb_tree(const _Rb_tree& __x)
>      : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())
>      {
> if (__x._M_root() != 0)
>   {
>     _M_root() = _M_copy(__x._M_begin(), _M_end());
>     _M_leftmost() = _S_minimum(_M_root());
>     _M_rightmost() = _S_maximum(_M_root());
>     _M_impl._M_node_count = __x._M_impl._M_node_count;
>   }
>      }
>
>
>
>
>
>      ~_Rb_tree()
>      { _M_erase(_M_begin()); }
>
>      _Rb_tree&
>      operator=(const _Rb_tree& __x);
>
>
>      _Compare
>      key_comp() const
>      { return _M_impl._M_key_compare; }
>
>      iterator
>      begin()
>      {
> return iterator(static_cast<_Link_type>
>   (this->_M_impl._M_header._M_left));
>      }
>
>      const_iterator
>      begin() const
>      {
> return const_iterator(static_cast<_Const_Link_type>
>         (this->_M_impl._M_header._M_left));
>      }
>
>      iterator
>      end()
>      { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); }
>
>      const_iterator
>      end() const
>      {
> return const_iterator(static_cast<_Const_Link_type>
>         (&this->_M_impl._M_header));
>      }
>
>      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()); }
>
>      bool
>      empty() const
>      { return _M_impl._M_node_count == 0; }
>
>      size_type
>      size() const
>      { return _M_impl._M_node_count; }
>
>      size_type
>      max_size() const
>      { return _M_get_Node_allocator().max_size(); }
>
>      void
>      swap(_Rb_tree& __t);
># 730 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>      pair<iterator, bool>
>      _M_insert_unique(const value_type& __x);
>
>      iterator
>      _M_insert_equal(const value_type& __x);
>
>      iterator
>      _M_insert_unique_(const_iterator __position, const value_type& __x);
>
>      iterator
>      _M_insert_equal_(const_iterator __position, const value_type& __x);
>
>
>      template<typename _InputIterator>
>        void
>        _M_insert_unique(_InputIterator __first, _InputIterator __last);
>
>      template<typename _InputIterator>
>        void
>        _M_insert_equal(_InputIterator __first, _InputIterator __last);
>
>    private:
>      void
>      _M_erase_aux(const_iterator __position);
>
>      void
>      _M_erase_aux(const_iterator __first, const_iterator __last);
>
>    public:
># 781 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>      void
>      erase(iterator __position)
>      { _M_erase_aux(__position); }
>
>      void
>      erase(const_iterator __position)
>      { _M_erase_aux(__position); }
>
>      size_type
>      erase(const key_type& __x);
># 802 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_erase_aux(__first, __last); }
>
>      void
>      erase(const_iterator __first, const_iterator __last)
>      { _M_erase_aux(__first, __last); }
>
>      void
>      erase(const key_type* __first, const key_type* __last);
>
>      void
>      clear()
>      {
>        _M_erase(_M_begin());
>        _M_leftmost() = _M_end();
>        _M_root() = 0;
>        _M_rightmost() = _M_end();
>        _M_impl._M_node_count = 0;
>      }
>
>
>      iterator
>      find(const key_type& __k);
>
>      const_iterator
>      find(const key_type& __k) const;
>
>      size_type
>      count(const key_type& __k) const;
>
>      iterator
>      lower_bound(const key_type& __k)
>      { return _M_lower_bound(_M_begin(), _M_end(), __k); }
>
>      const_iterator
>      lower_bound(const key_type& __k) const
>      { return _M_lower_bound(_M_begin(), _M_end(), __k); }
>
>      iterator
>      upper_bound(const key_type& __k)
>      { return _M_upper_bound(_M_begin(), _M_end(), __k); }
>
>      const_iterator
>      upper_bound(const key_type& __k) const
>      { return _M_upper_bound(_M_begin(), _M_end(), __k); }
>
>      pair<iterator, iterator>
>      equal_range(const key_type& __k);
>
>      pair<const_iterator, const_iterator>
>      equal_range(const key_type& __k) const;
>
>
>      bool
>      __rb_verify() const;
>    };
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    {
>      return __x.size() == __y.size()
>      && std::equal(__x.begin(), __x.end(), __y.begin());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>       const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    {
>      return std::lexicographical_compare(__x.begin(), __x.end(),
>       __y.begin(), __y.end());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>       const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
># 940 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h" 3
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
>    {
>      if (this != &__x)
> {
>
>   clear();
>   _M_impl._M_key_compare = __x._M_impl._M_key_compare;
>   if (__x._M_root() != 0)
>     {
>       _M_root() = _M_copy(__x._M_begin(), _M_end());
>       _M_leftmost() = _S_minimum(_M_root());
>       _M_rightmost() = _S_maximum(_M_root());
>       _M_impl._M_node_count = __x._M_impl._M_node_count;
>     }
> }
>      return *this;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v)
>
>    {
>      bool __insert_left = (__x != 0 || __p == _M_end()
>       || _M_impl._M_key_compare(_KeyOfValue()(__v),
>            _S_key(__p)));
>
>      _Link_type __z = _M_create_node((__v));
>
>      _Rb_tree_insert_and_rebalance(__insert_left, __z,
>        const_cast<_Base_ptr>(__p),
>        this->_M_impl._M_header);
>      ++_M_impl._M_node_count;
>      return iterator(__z);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v)
>
>    {
>      bool __insert_left = (__x != 0 || __p == _M_end()
>       || !_M_impl._M_key_compare(_S_key(__p),
>             _KeyOfValue()(__v)));
>
>      _Link_type __z = _M_create_node((__v));
>
>      _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
>        this->_M_impl._M_header);
>      ++_M_impl._M_node_count;
>      return iterator(__z);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_equal_lower(const _Val& __v)
>
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   __y = __x;
>   __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
>         _S_left(__x) : _S_right(__x);
> }
>      return _M_insert_lower(__x, __y, (__v));
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
>    _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
>    _M_copy(_Const_Link_type __x, _Link_type __p)
>    {
>
>      _Link_type __top = _M_clone_node(__x);
>      __top->_M_parent = __p;
>
>      try
> {
>   if (__x->_M_right)
>     __top->_M_right = _M_copy(_S_right(__x), __top);
>   __p = __top;
>   __x = _S_left(__x);
>
>   while (__x != 0)
>     {
>       _Link_type __y = _M_clone_node(__x);
>       __p->_M_left = __y;
>       __y->_M_parent = __p;
>       if (__x->_M_right)
>  __y->_M_right = _M_copy(_S_right(__x), __y);
>       __p = __y;
>       __x = _S_left(__x);
>     }
> }
>      catch(...)
> {
>   _M_erase(__top);
>   throw;
> }
>      return __top;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_erase(_Link_type __x)
>    {
>
>      while (__x != 0)
> {
>   _M_erase(_S_right(__x));
>   _Link_type __y = _S_left(__x);
>   _M_destroy_node(__x);
>   __x = __y;
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_lower_bound(_Link_type __x, _Link_type __y,
>     const _Key& __k)
>    {
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,
>     const _Key& __k) const
>    {
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return const_iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_upper_bound(_Link_type __x, _Link_type __y,
>     const _Key& __k)
>    {
>      while (__x != 0)
> if (_M_impl._M_key_compare(__k, _S_key(__x)))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,
>     const _Key& __k) const
>    {
>      while (__x != 0)
> if (_M_impl._M_key_compare(__k, _S_key(__x)))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return const_iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator,
>  typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    equal_range(const _Key& __k)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   if (_M_impl._M_key_compare(_S_key(__x), __k))
>     __x = _S_right(__x);
>   else if (_M_impl._M_key_compare(__k, _S_key(__x)))
>     __y = __x, __x = _S_left(__x);
>   else
>     {
>       _Link_type __xu(__x), __yu(__y);
>       __y = __x, __x = _S_left(__x);
>       __xu = _S_right(__xu);
>       return pair<iterator,
>            iterator>(_M_lower_bound(__x, __y, __k),
>        _M_upper_bound(__xu, __yu, __k));
>     }
> }
>      return pair<iterator, iterator>(iterator(__y),
>          iterator(__y));
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::const_iterator,
>  typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::const_iterator>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    equal_range(const _Key& __k) const
>    {
>      _Const_Link_type __x = _M_begin();
>      _Const_Link_type __y = _M_end();
>      while (__x != 0)
> {
>   if (_M_impl._M_key_compare(_S_key(__x), __k))
>     __x = _S_right(__x);
>   else if (_M_impl._M_key_compare(__k, _S_key(__x)))
>     __y = __x, __x = _S_left(__x);
>   else
>     {
>       _Const_Link_type __xu(__x), __yu(__y);
>       __y = __x, __x = _S_left(__x);
>       __xu = _S_right(__xu);
>       return pair<const_iterator,
>            const_iterator>(_M_lower_bound(__x, __y, __k),
>       _M_upper_bound(__xu, __yu, __k));
>     }
> }
>      return pair<const_iterator, const_iterator>(const_iterator(__y),
>        const_iterator(__y));
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)
>    {
>      if (_M_root() == 0)
> {
>   if (__t._M_root() != 0)
>     {
>       _M_root() = __t._M_root();
>       _M_leftmost() = __t._M_leftmost();
>       _M_rightmost() = __t._M_rightmost();
>       _M_root()->_M_parent = _M_end();
>
>       __t._M_root() = 0;
>       __t._M_leftmost() = __t._M_end();
>       __t._M_rightmost() = __t._M_end();
>     }
> }
>      else if (__t._M_root() == 0)
> {
>   __t._M_root() = _M_root();
>   __t._M_leftmost() = _M_leftmost();
>   __t._M_rightmost() = _M_rightmost();
>   __t._M_root()->_M_parent = __t._M_end();
>
>   _M_root() = 0;
>   _M_leftmost() = _M_end();
>   _M_rightmost() = _M_end();
> }
>      else
> {
>   std::swap(_M_root(),__t._M_root());
>   std::swap(_M_leftmost(),__t._M_leftmost());
>   std::swap(_M_rightmost(),__t._M_rightmost());
>
>   _M_root()->_M_parent = _M_end();
>   __t._M_root()->_M_parent = __t._M_end();
> }
>
>      std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
>      std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
>
>
>
>      std::__alloc_swap<_Node_allocator>::
> _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator, bool>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_unique(const _Val& __v)
>
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      bool __comp = true;
>      while (__x != 0)
> {
>   __y = __x;
>   __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));
>   __x = __comp ? _S_left(__x) : _S_right(__x);
> }
>      iterator __j = iterator(__y);
>      if (__comp)
> {
>   if (__j == begin())
>     return pair<iterator, bool>
>       (_M_insert_(__x, __y, (__v)), true);
>   else
>     --__j;
> }
>      if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
> return pair<iterator, bool>
>   (_M_insert_(__x, __y, (__v)), true);
>      return pair<iterator, bool>(__j, false);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_equal(const _Val& __v)
>
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   __y = __x;
>   __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
>         _S_left(__x) : _S_right(__x);
> }
>      return _M_insert_(__x, __y, (__v));
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_unique_(const_iterator __position, const _Val& __v)
>
>    {
>
>      if (__position._M_node == _M_end())
> {
>   if (size() > 0
>       && _M_impl._M_key_compare(_S_key(_M_rightmost()),
>     _KeyOfValue()(__v)))
>     return _M_insert_(0, _M_rightmost(), (__v));
>   else
>     return _M_insert_unique((__v)).first;
> }
>      else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>          _S_key(__position._M_node)))
> {
>
>   const_iterator __before = __position;
>   if (__position._M_node == _M_leftmost())
>     return _M_insert_(_M_leftmost(), _M_leftmost(),
>         (__v));
>   else if (_M_impl._M_key_compare(_S_key((--__before)._M_node),
>       _KeyOfValue()(__v)))
>     {
>       if (_S_right(__before._M_node) == 0)
>  return _M_insert_(0, __before._M_node,
>      (__v));
>       else
>  return _M_insert_(__position._M_node,
>      __position._M_node,
>      (__v));
>     }
>   else
>     return _M_insert_unique((__v)).first;
> }
>      else if (_M_impl._M_key_compare(_S_key(__position._M_node),
>          _KeyOfValue()(__v)))
> {
>
>   const_iterator __after = __position;
>   if (__position._M_node == _M_rightmost())
>     return _M_insert_(0, _M_rightmost(),
>         (__v));
>   else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>       _S_key((++__after)._M_node)))
>     {
>       if (_S_right(__position._M_node) == 0)
>  return _M_insert_(0, __position._M_node,
>      (__v));
>       else
>  return _M_insert_(__after._M_node, __after._M_node,
>      (__v));
>     }
>   else
>     return _M_insert_unique((__v)).first;
> }
>      else
>
> return __position._M_const_cast();
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>
>
>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>
>
>
>    _M_insert_equal_(const_iterator __position, const _Val& __v)
>
>    {
>
>      if (__position._M_node == _M_end())
> {
>   if (size() > 0
>       && !_M_impl._M_key_compare(_KeyOfValue()(__v),
>      _S_key(_M_rightmost())))
>     return _M_insert_(0, _M_rightmost(),
>         (__v));
>   else
>     return _M_insert_equal((__v));
> }
>      else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
>           _KeyOfValue()(__v)))
> {
>
>   const_iterator __before = __position;
>   if (__position._M_node == _M_leftmost())
>     return _M_insert_(_M_leftmost(), _M_leftmost(),
>         (__v));
>   else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
>        _S_key((--__before)._M_node)))
>     {
>       if (_S_right(__before._M_node) == 0)
>  return _M_insert_(0, __before._M_node,
>      (__v));
>       else
>  return _M_insert_(__position._M_node,
>      __position._M_node,
>      (__v));
>     }
>   else
>     return _M_insert_equal((__v));
> }
>      else
> {
>
>   const_iterator __after = __position;
>   if (__position._M_node == _M_rightmost())
>     return _M_insert_(0, _M_rightmost(),
>         (__v));
>   else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
>        _KeyOfValue()(__v)))
>     {
>       if (_S_right(__position._M_node) == 0)
>  return _M_insert_(0, __position._M_node,
>      (__v));
>       else
>  return _M_insert_(__after._M_node, __after._M_node,
>      (__v));
>     }
>   else
>     return _M_insert_equal_lower((__v));
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      _M_insert_unique(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   _M_insert_unique_(end(), *__first);
>      }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      _M_insert_equal(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   _M_insert_equal_(end(), *__first);
>      }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_erase_aux(const_iterator __position)
>    {
>      _Link_type __y =
> static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
>    (const_cast<_Base_ptr>(__position._M_node),
>     this->_M_impl._M_header));
>      _M_destroy_node(__y);
>      --_M_impl._M_node_count;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_erase_aux(const_iterator __first, const_iterator __last)
>    {
>      if (__first == begin() && __last == end())
> clear();
>      else
> while (__first != __last)
>   erase(__first++);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const _Key& __x)
>    {
>      pair<iterator, iterator> __p = equal_range(__x);
>      const size_type __old_size = size();
>      erase(__p.first, __p.second);
>      return __old_size - size();
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const _Key* __first, const _Key* __last)
>    {
>      while (__first != __last)
> erase(*__first++);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    find(const _Key& __k)
>    {
>      iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
>      return (__j == end()
>       || _M_impl._M_key_compare(__k,
>     _S_key(__j._M_node))) ? end() : __j;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    find(const _Key& __k) const
>    {
>      const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
>      return (__j == end()
>       || _M_impl._M_key_compare(__k,
>     _S_key(__j._M_node))) ? end() : __j;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    count(const _Key& __k) const
>    {
>      pair<const_iterator, const_iterator> __p = equal_range(__k);
>      const size_type __n = std::distance(__p.first, __p.second);
>      return __n;
>    }
>
>  __attribute__ ((__pure__)) unsigned int
>  _Rb_tree_black_count(const _Rb_tree_node_base* __node,
>                       const _Rb_tree_node_base* __root) throw ();
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    bool
>    _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const
>    {
>      if (_M_impl._M_node_count == 0 || begin() == end())
> return _M_impl._M_node_count == 0 && begin() == end()
>        && this->_M_impl._M_header._M_left == _M_end()
>        && this->_M_impl._M_header._M_right == _M_end();
>
>      unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
>      for (const_iterator __it = begin(); __it != end(); ++__it)
> {
>   _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
>   _Const_Link_type __L = _S_left(__x);
>   _Const_Link_type __R = _S_right(__x);
>
>   if (__x->_M_color == _S_red)
>     if ((__L && __L->_M_color == _S_red)
>  || (__R && __R->_M_color == _S_red))
>       return false;
>
>   if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
>     return false;
>   if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
>     return false;
>
>   if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
>     return false;
> }
>
>      if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
> return false;
>      if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
> return false;
>      return true;
>    }
>
>
>}
># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/map" 2 3
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 1 3
># 66 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
># 88 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>  template <typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
>            typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class map
>    {
>    public:
>      typedef _Key key_type;
>      typedef _Tp mapped_type;
>      typedef std::pair<const _Key, _Tp> value_type;
>      typedef _Compare key_compare;
>      typedef _Alloc allocator_type;
>
>    private:
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>
>
>
>
>
>    public:
>      class value_compare
>      : public std::binary_function<value_type, value_type, bool>
>      {
> friend class map<_Key, _Tp, _Compare, _Alloc>;
>      protected:
> _Compare comp;
>
> value_compare(_Compare __c)
> : comp(__c) { }
>
>      public:
> bool operator()(const value_type& __x, const value_type& __y) const
> { return comp(__x.first, __y.first); }
>      };
>
>    private:
>
>      typedef typename _Alloc::template rebind<value_type>::other
>        _Pair_alloc_type;
>
>      typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
>         key_compare, _Pair_alloc_type> _Rep_type;
>
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Pair_alloc_type::pointer pointer;
>      typedef typename _Pair_alloc_type::const_pointer const_pointer;
>      typedef typename _Pair_alloc_type::reference reference;
>      typedef typename _Pair_alloc_type::const_reference const_reference;
>      typedef typename _Rep_type::iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>      typedef typename _Rep_type::reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>
>
>
>
>
>
>
>      map()
>      : _M_t() { }
>
>
>
>
>
>
>      explicit
>      map(const _Compare& __comp,
>   const allocator_type& __a = allocator_type())
>      : _M_t(__comp, _Pair_alloc_type(__a)) { }
># 174 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      map(const map& __x)
>      : _M_t(__x._M_t) { }
># 217 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      template<typename _InputIterator>
>        map(_InputIterator __first, _InputIterator __last)
> : _M_t()
>        { _M_t._M_insert_unique(__first, __last); }
># 234 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      template<typename _InputIterator>
>        map(_InputIterator __first, _InputIterator __last,
>     const _Compare& __comp,
>     const allocator_type& __a = allocator_type())
> : _M_t(__comp, _Pair_alloc_type(__a))
>        { _M_t._M_insert_unique(__first, __last); }
># 257 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      map&
>      operator=(const map& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
># 303 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_t.get_allocator()); }
>
>
>
>
>
>
>
>      iterator
>      begin()
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      iterator
>      end()
>      { return _M_t.end(); }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return _M_t.end(); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return _M_t.rend(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return _M_t.rend(); }
># 422 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      bool
>      empty() const
>      { return _M_t.empty(); }
>
>
>      size_type
>      size() const
>      { return _M_t.size(); }
>
>
>      size_type
>      max_size() const
>      { return _M_t.max_size(); }
># 449 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      mapped_type&
>      operator[](const key_type& __k)
>      {
>
>
>
> iterator __i = lower_bound(__k);
>
> if (__i == end() || key_comp()(__k, (*__i).first))
>          __i = insert(__i, value_type(__k, mapped_type()));
> return (*__i).second;
>      }
># 486 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      mapped_type&
>      at(const key_type& __k)
>      {
> iterator __i = lower_bound(__k);
> if (__i == end() || key_comp()(__k, (*__i).first))
>   __throw_out_of_range(("map::at"));
> return (*__i).second;
>      }
>
>      const mapped_type&
>      at(const key_type& __k) const
>      {
> const_iterator __i = lower_bound(__k);
> if (__i == end() || key_comp()(__k, (*__i).first))
>   __throw_out_of_range(("map::at"));
> return (*__i).second;
>      }
># 521 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      std::pair<iterator, bool>
>      insert(const value_type& __x)
>      { return _M_t._M_insert_unique(__x); }
># 570 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      iterator
>
>
>
>      insert(iterator __position, const value_type& __x)
>
>      { return _M_t._M_insert_unique_(__position, __x); }
># 596 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      template<typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t._M_insert_unique(__first, __last); }
># 636 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 652 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 688 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 704 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      void
>      swap(map& __x)
>      { _M_t.swap(__x._M_t); }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_t.clear(); }
>
>
>
>
>
>
>      key_compare
>      key_comp() const
>      { return _M_t.key_comp(); }
>
>
>
>
>
>      value_compare
>      value_comp() const
>      { return value_compare(_M_t.key_comp()); }
># 747 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 762 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 774 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
># 789 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 804 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      const_iterator
>      lower_bound(const key_type& __x) const
>      { return _M_t.lower_bound(__x); }
>
>
>
>
>
>
>
>      iterator
>      upper_bound(const key_type& __x)
>      { return _M_t.upper_bound(__x); }
>
>
>
>
>
>
>
>      const_iterator
>      upper_bound(const key_type& __x) const
>      { return _M_t.upper_bound(__x); }
># 843 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 862 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>      std::pair<const_iterator, const_iterator>
>      equal_range(const key_type& __x) const
>      { return _M_t.equal_range(__x); }
>
>      template<typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator==(const map<_K1, _T1, _C1, _A1>&,
>     const map<_K1, _T1, _C1, _A1>&);
>
>      template<typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator<(const map<_K1, _T1, _C1, _A1>&,
>    const map<_K1, _T1, _C1, _A1>&);
>    };
># 887 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __x._M_t == __y._M_t; }
># 904 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_map.h" 3
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>              const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>              const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline void
>    swap(map<_Key, _Tp, _Compare, _Alloc>& __x,
>  map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>
>}
># 62 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/map" 2 3
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 1 3
># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
># 87 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>  template <typename _Key, typename _Tp,
>     typename _Compare = std::less<_Key>,
>     typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class multimap
>    {
>    public:
>      typedef _Key key_type;
>      typedef _Tp mapped_type;
>      typedef std::pair<const _Key, _Tp> value_type;
>      typedef _Compare key_compare;
>      typedef _Alloc allocator_type;
>
>    private:
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>
>
>
>
>
>    public:
>      class value_compare
>      : public std::binary_function<value_type, value_type, bool>
>      {
> friend class multimap<_Key, _Tp, _Compare, _Alloc>;
>      protected:
> _Compare comp;
>
> value_compare(_Compare __c)
> : comp(__c) { }
>
>      public:
> bool operator()(const value_type& __x, const value_type& __y) const
> { return comp(__x.first, __y.first); }
>      };
>
>    private:
>
>      typedef typename _Alloc::template rebind<value_type>::other
>        _Pair_alloc_type;
>
>      typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
>         key_compare, _Pair_alloc_type> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Pair_alloc_type::pointer pointer;
>      typedef typename _Pair_alloc_type::const_pointer const_pointer;
>      typedef typename _Pair_alloc_type::reference reference;
>      typedef typename _Pair_alloc_type::const_reference const_reference;
>      typedef typename _Rep_type::iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>      typedef typename _Rep_type::reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>
>
>
>
>
>
>      multimap()
>      : _M_t() { }
>
>
>
>
>
>
>      explicit
>      multimap(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_t(__comp, _Pair_alloc_type(__a)) { }
># 172 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      multimap(const multimap& __x)
>      : _M_t(__x._M_t) { }
># 213 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      template<typename _InputIterator>
>        multimap(_InputIterator __first, _InputIterator __last)
> : _M_t()
>        { _M_t._M_insert_equal(__first, __last); }
># 229 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      template<typename _InputIterator>
>        multimap(_InputIterator __first, _InputIterator __last,
>   const _Compare& __comp,
>   const allocator_type& __a = allocator_type())
> : _M_t(__comp, _Pair_alloc_type(__a))
>        { _M_t._M_insert_equal(__first, __last); }
># 252 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      multimap&
>      operator=(const multimap& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
># 298 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_t.get_allocator()); }
>
>
>
>
>
>
>
>      iterator
>      begin()
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      iterator
>      end()
>      { return _M_t.end(); }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return _M_t.end(); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return _M_t.rend(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return _M_t.rend(); }
># 415 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      bool
>      empty() const
>      { return _M_t.empty(); }
>
>
>      size_type
>      size() const
>      { return _M_t.size(); }
>
>
>      size_type
>      max_size() const
>      { return _M_t.max_size(); }
># 442 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      iterator
>      insert(const value_type& __x)
>      { return _M_t._M_insert_equal(__x); }
># 475 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      iterator
>
>
>
>      insert(iterator __position, const value_type& __x)
>
>      { return _M_t._M_insert_equal_(__position, __x); }
># 502 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      template<typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t._M_insert_equal(__first, __last); }
># 555 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 571 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 611 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 627 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      void
>      swap(multimap& __x)
>      { _M_t.swap(__x._M_t); }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_t.clear(); }
>
>
>
>
>
>
>      key_compare
>      key_comp() const
>      { return _M_t.key_comp(); }
>
>
>
>
>
>      value_compare
>      value_comp() const
>      { return value_compare(_M_t.key_comp()); }
># 670 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 685 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
>
>
>
>
>
>
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.count(__x); }
># 709 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 724 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      const_iterator
>      lower_bound(const key_type& __x) const
>      { return _M_t.lower_bound(__x); }
>
>
>
>
>
>
>
>      iterator
>      upper_bound(const key_type& __x)
>      { return _M_t.upper_bound(__x); }
>
>
>
>
>
>
>
>      const_iterator
>      upper_bound(const key_type& __x) const
>      { return _M_t.upper_bound(__x); }
># 761 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 778 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>      std::pair<const_iterator, const_iterator>
>      equal_range(const key_type& __x) const
>      { return _M_t.equal_range(__x); }
>
>      template<typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator==(const multimap<_K1, _T1, _C1, _A1>&,
>     const multimap<_K1, _T1, _C1, _A1>&);
>
>      template<typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator<(const multimap<_K1, _T1, _C1, _A1>&,
>    const multimap<_K1, _T1, _C1, _A1>&);
>  };
># 803 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __x._M_t == __y._M_t; }
># 820 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_multimap.h" 3
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>              const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>              const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline void
>    swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>         multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>
>}
># 63 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/map" 2 3
># 51 "/usr/include/QtCore/qmap.h" 2
># 59 "/usr/include/QtCore/qmap.h"
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>struct __attribute__((visibility("default"))) QMapData
>{
>    struct Node {
>        Node *backward;
>        Node *forward[1];
>    };
>    enum { LastLevel = 11, Sparseness = 3 };
>
>    QMapData *backward;
>    QMapData *forward[QMapData::LastLevel + 1];
>    QBasicAtomicInt ref;
>    int topLevel;
>    int size;
>    uint randomBits;
>    uint insertInOrder : 1;
>    uint sharable : 1;
>    uint strictAlignment : 1;
>    uint reserved : 29;
>
>    static QMapData *createData();
>    static QMapData *createData(int alignment);
>    void continueFreeData(int offset);
>    Node *node_create(Node *update[], int offset);
>    Node *node_create(Node *update[], int offset, int alignment);
>    void node_delete(Node *update[], int offset, Node *node);
>
>
>
>
>
>    static QMapData shared_null;
>};
># 105 "/usr/include/QtCore/qmap.h"
>template <class Key> inline bool qMapLessThanKey(const Key &key1, const Key &key2)
>{
>    return key1 < key2;
>}
>
>template <class Ptr> inline bool qMapLessThanKey(Ptr *key1, Ptr *key2)
>{
>    qt_noop();
>    return quintptr(key1) < quintptr(key2);
>}
>
>template <class Ptr> inline bool qMapLessThanKey(const Ptr *key1, const Ptr *key2)
>{
>    qt_noop();
>    return quintptr(key1) < quintptr(key2);
>}
>
>template <class Key, class T>
>struct QMapNode {
>    Key key;
>    T value;
>
>private:
>
>
>    QMapData::Node *backward;
>    QMapData::Node *forward[1];
>};
>
>template <class Key, class T>
>struct QMapPayloadNode
>{
>    Key key;
>    T value;
>
>private:
># 155 "/usr/include/QtCore/qmap.h"
>    QMapData::Node *backward;
>};
>
>template <class Key, class T>
>class QMap
>{
>    typedef QMapNode<Key, T> Node;
>    typedef QMapPayloadNode<Key, T> PayloadNode;
>
>    union {
>        QMapData *d;
>        QMapData::Node *e;
>    };
>
>    static inline int payload() { return sizeof(PayloadNode) - sizeof(QMapData::Node *); }
>    static inline int alignment() {
>
>        return int(qMax(sizeof(void*), __alignof__(Node)));
>
>
>
>    }
>    static inline Node *concrete(QMapData::Node *node) {
>        return reinterpret_cast<Node *>(reinterpret_cast<char *>(node) - payload());
>    }
>
>public:
>    inline QMap() : d(&QMapData::shared_null) { d->ref.ref(); }
>    inline QMap(const QMap<Key, T> &other) : d(other.d)
>    { d->ref.ref(); if (!d->sharable) detach(); }
>    inline ~QMap() { if (!d) return; if (!d->ref.deref()) freeData(d); }
>
>    QMap<Key, T> &operator=(const QMap<Key, T> &other);
>
>
>
>
>    inline void swap(QMap<Key, T> &other) { qSwap(d, other.d); }
>
>    explicit QMap(const typename std::map<Key, T> &other);
>    std::map<Key, T> toStdMap() const;
>
>
>    bool operator==(const QMap<Key, T> &other) const;
>    inline bool operator!=(const QMap<Key, T> &other) const { return !(*this == other); }
>
>    inline int size() const { return d->size; }
>
>    inline bool isEmpty() const { return d->size == 0; }
>
>    inline void detach() { if (d->ref != 1) detach_helper(); }
>    inline bool isDetached() const { return d->ref == 1; }
>    inline void setSharable(bool sharable) { if (!sharable) detach(); d->sharable = sharable; }
>    inline bool isSharedWith(const QMap<Key, T> &other) const { return d == other.d; }
>    inline void setInsertInOrder(bool ordered) { d->insertInOrder = ordered; }
>
>    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;
>        QMapData::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 operator QMapData::Node *() const { return i; }
>        inline iterator() : i(0) { }
>        inline iterator(QMapData::Node *node) : i(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 = i->forward[0];
>            return *this;
>        }
>        inline iterator operator++(int) {
>            iterator r = *this;
>            i = i->forward[0];
>            return r;
>        }
>        inline iterator &operator--() {
>            i = i->backward;
>            return *this;
>        }
>        inline iterator operator--(int) {
>            iterator r = *this;
>            i = i->backward;
>            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; }
>
>    private:
>
>        inline operator bool() const { return false; }
>    };
>    friend class iterator;
>
>    class const_iterator
>    {
>        friend class iterator;
>        QMapData::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 operator QMapData::Node *() const { return i; }
>        inline const_iterator() : i(0) { }
>        inline const_iterator(QMapData::Node *node) : i(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 = i->forward[0];
>            return *this;
>        }
>        inline const_iterator operator++(int) {
>            const_iterator r = *this;
>            i = i->forward[0];
>            return r;
>        }
>        inline const_iterator &operator--() {
>            i = i->backward;
>            return *this;
>        }
>        inline const_iterator operator--(int) {
>            const_iterator r = *this;
>            i = i->backward;
>            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; }
># 365 "/usr/include/QtCore/qmap.h"
>    private:
>
>        inline operator bool() const { return false; }
>    };
>    friend class const_iterator;
>
>
>    inline iterator begin() { detach(); return iterator(e->forward[0]); }
>    inline const_iterator begin() const { return const_iterator(e->forward[0]); }
>    inline const_iterator constBegin() const { return const_iterator(e->forward[0]); }
>    inline iterator end() {
>        detach();
>        return iterator(e);
>    }
>    inline const_iterator end() 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 lowerBound(const Key &key);
>    const_iterator lowerBound(const Key &key) const;
>    iterator upperBound(const Key &key);
>    const_iterator upperBound(const Key &key) const;
>    iterator insert(const Key &key, const T &value);
>
>
>
>    iterator insertMulti(const Key &key, const T &value);
>
>
>
>    QMap<Key, T> &unite(const QMap<Key, T> &other);
>
>
>    typedef Key key_type;
>    typedef T mapped_type;
>    typedef qptrdiff difference_type;
>    typedef int size_type;
>    inline bool empty() const { return isEmpty(); }
>
>
>
>
>
>private:
>    void detach_helper();
>    void freeData(QMapData *d);
>    QMapData::Node *findNode(const Key &key) const;
>    QMapData::Node *mutableFindNode(QMapData::Node *update[], const Key &key) const;
>    QMapData::Node *node_create(QMapData *d, QMapData::Node *update[], const Key &key,
>                                const T &value);
>};
>
>template <class Key, class T>
>inline QMap<Key, T> &QMap<Key, T>::operator=(const QMap<Key, T> &other)
>{
>    if (d != other.d) {
>        QMapData* 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 void QMap<Key, T>::clear()
>{
>    *this = QMap<Key, T>();
>}
>
>template <class Key, class T>
>inline typename QMapData::Node *
>QMap<Key, T>::node_create(QMapData *adt, QMapData::Node *aupdate[], const Key &akey, const T &avalue)
>{
>    QMapData::Node *abstractNode = adt->node_create(aupdate, payload(), alignment());
>    try {
>        Node *concreteNode = concrete(abstractNode);
>        new (&concreteNode->key) Key(akey);
>        try {
>            new (&concreteNode->value) T(avalue);
>        } catch (...) {
>            concreteNode->key.~Key();
>            throw;
>        }
>    } catch (...) {
>        adt->node_delete(aupdate, payload(), abstractNode);
>        throw;
>    }
># 477 "/usr/include/QtCore/qmap.h"
>    return abstractNode;
>}
>
>template <class Key, class T>
>inline QMapData::Node *QMap<Key, T>::findNode(const Key &akey) const
>{
>    QMapData::Node *cur = e;
>    QMapData::Node *next = e;
>
>    for (int i = d->topLevel; i >= 0; i--) {
>        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
>            cur = next;
>    }
>
>    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
>        return next;
>    } else {
>        return e;
>    }
>}
>
>template <class Key, class T>
>inline const T QMap<Key, T>::value(const Key &akey) const
>{
>    QMapData::Node *node;
>    if (d->size == 0 || (node = findNode(akey)) == e) {
>        return T();
>    } else {
>        return concrete(node)->value;
>    }
>}
>
>template <class Key, class T>
>inline const T QMap<Key, T>::value(const Key &akey, const T &adefaultValue) const
>{
>    QMapData::Node *node;
>    if (d->size == 0 || (node = findNode(akey)) == e) {
>        return adefaultValue;
>    } else {
>        return concrete(node)->value;
>    }
>}
>
>template <class Key, class T>
>inline const T QMap<Key, T>::operator[](const Key &akey) const
>{
>    return value(akey);
>}
>
>template <class Key, class T>
>inline T &QMap<Key, T>::operator[](const Key &akey)
>{
>    detach();
>
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    QMapData::Node *node = mutableFindNode(update, akey);
>    if (node == e)
>        node = node_create(d, update, akey, T());
>    return concrete(node)->value;
>}
>
>template <class Key, class T>
>inline int QMap<Key, T>::count(const Key &akey) const
>{
>    int cnt = 0;
>    QMapData::Node *node = findNode(akey);
>    if (node != e) {
>        do {
>            ++cnt;
>            node = node->forward[0];
>        } while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key));
>    }
>    return cnt;
>}
>
>template <class Key, class T>
>inline bool QMap<Key, T>::contains(const Key &akey) const
>{
>    return findNode(akey) != e;
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::iterator QMap<Key, T>::insert(const Key &akey,
>                                                                       const T &avalue)
>{
>    detach();
>
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    QMapData::Node *node = mutableFindNode(update, akey);
>    if (node == e) {
>        node = node_create(d, update, akey, avalue);
>    } else {
>        concrete(node)->value = avalue;
>    }
>    return iterator(node);
>}
># 594 "/usr/include/QtCore/qmap.h"
>template <class Key, class T>
>inline typename QMap<Key, T>::iterator QMap<Key, T>::insertMulti(const Key &akey,
>                                                                            const T &avalue)
>{
>    detach();
>
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    mutableFindNode(update, akey);
>    return iterator(node_create(d, update, akey, avalue));
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::const_iterator QMap<Key, T>::find(const Key &akey) const
>{
>    return const_iterator(findNode(akey));
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::const_iterator QMap<Key, T>::constFind(const Key &akey) const
>{
>    return const_iterator(findNode(akey));
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::iterator QMap<Key, T>::find(const Key &akey)
>{
>    detach();
>    return iterator(findNode(akey));
>}
>
>template <class Key, class T>
>inline QMap<Key, T> &QMap<Key, T>::unite(const QMap<Key, T> &other)
>{
>    QMap<Key, T> copy(other);
>    const_iterator it = copy.constEnd();
>    const const_iterator b = copy.constBegin();
>    while (it != b) {
>        --it;
>        insertMulti(it.key(), it.value());
>    }
>    return *this;
>}
>
>template <class Key, class T>
> void QMap<Key, T>::freeData(QMapData *x)
>{
>    if (QTypeInfo<Key>::isComplex || QTypeInfo<T>::isComplex) {
>        QMapData *cur = x;
>        QMapData *next = cur->forward[0];
>        while (next != x) {
>            cur = next;
>            next = cur->forward[0];
>
>
>
>            Node *concreteNode = concrete(reinterpret_cast<QMapData::Node *>(cur));
>            concreteNode->key.~Key();
>            concreteNode->value.~T();
>
>
>
>        }
>    }
>    x->continueFreeData(payload());
>}
>
>template <class Key, class T>
> int QMap<Key, T>::remove(const Key &akey)
>{
>    detach();
>
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    QMapData::Node *cur = e;
>    QMapData::Node *next = e;
>    int oldSize = d->size;
>
>    for (int i = d->topLevel; i >= 0; i--) {
>        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
>            cur = next;
>        update[i] = cur;
>    }
>
>    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
>        bool deleteNext = true;
>        do {
>            cur = next;
>            next = cur->forward[0];
>            deleteNext = (next != e && !qMapLessThanKey<Key>(concrete(cur)->key, concrete(next)->key));
>            concrete(cur)->key.~Key();
>            concrete(cur)->value.~T();
>            d->node_delete(update, payload(), cur);
>        } while (deleteNext);
>    }
>    return oldSize - d->size;
>}
>
>template <class Key, class T>
> T QMap<Key, T>::take(const Key &akey)
>{
>    detach();
>
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    QMapData::Node *cur = e;
>    QMapData::Node *next = e;
>
>    for (int i = d->topLevel; i >= 0; i--) {
>        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
>            cur = next;
>        update[i] = cur;
>    }
>
>    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
>        T t = concrete(next)->value;
>        concrete(next)->key.~Key();
>        concrete(next)->value.~T();
>        d->node_delete(update, payload(), next);
>        return t;
>    }
>    return T();
>}
>
>template <class Key, class T>
> typename QMap<Key, T>::iterator QMap<Key, T>::erase(iterator it)
>{
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    QMapData::Node *cur = e;
>    QMapData::Node *next = e;
>
>    if (it == iterator(e))
>        return it;
>
>    for (int i = d->topLevel; i >= 0; i--) {
>        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, it.key()))
>            cur = next;
>        update[i] = cur;
>    }
>
>    while (next != e) {
>        cur = next;
>        next = cur->forward[0];
>        if (cur == it) {
>            concrete(cur)->key.~Key();
>            concrete(cur)->value.~T();
>            d->node_delete(update, payload(), cur);
>            return iterator(next);
>        }
>
>        for (int i = 0; i <= d->topLevel; ++i) {
>            if (update[i]->forward[i] != cur)
>                break;
>            update[i] = cur;
>        }
>    }
>    return end();
>}
>
>template <class Key, class T>
> void QMap<Key, T>::detach_helper()
>{
>    union { QMapData *d; QMapData::Node *e; } x;
>    x.d = QMapData::createData(alignment());
>    if (d->size) {
>        x.d->insertInOrder = true;
>        QMapData::Node *update[QMapData::LastLevel + 1];
>        QMapData::Node *cur = e->forward[0];
>        update[0] = x.e;
>        while (cur != e) {
>            try {
>                Node *concreteNode = concrete(cur);
>                node_create(x.d, update, concreteNode->key, concreteNode->value);
>            } catch (...) {
>                freeData(x.d);
>                throw;
>            }
>            cur = cur->forward[0];
>        }
>        x.d->insertInOrder = false;
>    }
>    if (!d->ref.deref())
>        freeData(d);
>    d = x.d;
>}
>
>template <class Key, class T>
> QMapData::Node *QMap<Key, T>::mutableFindNode(QMapData::Node *aupdate[],
>                                                                   const Key &akey) const
>{
>    QMapData::Node *cur = e;
>    QMapData::Node *next = e;
>
>    for (int i = d->topLevel; i >= 0; i--) {
>        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
>            cur = next;
>        aupdate[i] = cur;
>    }
>    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
>        return next;
>    } else {
>        return e;
>    }
>}
>
>template <class Key, class T>
> QList<Key> QMap<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> QMap<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> QMap<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 QMap<Key, T>::key(const T &avalue) const
>{
>    return key(avalue, Key());
>}
>
>template <class Key, class T>
> const Key QMap<Key, T>::key(const T &avalue, const Key &defaultKey) const
>{
>    const_iterator i = begin();
>    while (i != end()) {
>        if (i.value() == avalue)
>            return i.key();
>        ++i;
>    }
>
>    return defaultKey;
>}
>
>template <class Key, class T>
> QList<T> QMap<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> QMap<Key, T>::values(const Key &akey) const
>{
>    QList<T> res;
>    QMapData::Node *node = findNode(akey);
>    if (node != e) {
>        do {
>            res.append(concrete(node)->value);
>            node = node->forward[0];
>        } while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key));
>    }
>    return res;
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::const_iterator
>QMap<Key, T>::lowerBound(const Key &akey) const
>{
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    mutableFindNode(update, akey);
>    return const_iterator(update[0]->forward[0]);
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::iterator QMap<Key, T>::lowerBound(const Key &akey)
>{
>    detach();
>    return static_cast<QMapData::Node *>(const_cast<const QMap *>(this)->lowerBound(akey));
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::const_iterator
>QMap<Key, T>::upperBound(const Key &akey) const
>{
>    QMapData::Node *update[QMapData::LastLevel + 1];
>    mutableFindNode(update, akey);
>    QMapData::Node *node = update[0]->forward[0];
>    while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key))
>        node = node->forward[0];
>    return const_iterator(node);
>}
>
>template <class Key, class T>
>inline typename QMap<Key, T>::iterator QMap<Key, T>::upperBound(const Key &akey)
>{
>    detach();
>    return static_cast<QMapData::Node *>(const_cast<const QMap *>(this)->upperBound(akey));
>}
>
>template <class Key, class T>
> bool QMap<Key, T>::operator==(const QMap<Key, T> &other) const
>{
>    if (size() != other.size())
>        return false;
>    if (d == other.d)
>        return true;
>
>    const_iterator it1 = begin();
>    const_iterator it2 = other.begin();
>
>    while (it1 != end()) {
>        if (!(it1.value() == it2.value()) || qMapLessThanKey(it1.key(), it2.key()) || qMapLessThanKey(it2.key(), it1.key()))
>            return false;
>        ++it2;
>        ++it1;
>    }
>    return true;
>}
>
>
>template <class Key, class T>
> QMap<Key, T>::QMap(const std::map<Key, T> &other)
>{
>    d = QMapData::createData(alignment());
>    d->insertInOrder = true;
>    typename std::map<Key,T>::const_iterator it = other.end();
>    while (it != other.begin()) {
>        --it;
>        insert((*it).first, (*it).second);
>    }
>    d->insertInOrder = false;
>}
>
>template <class Key, class T>
> std::map<Key, T> QMap<Key, T>::toStdMap() const
>{
>    std::map<Key, T> map;
>    const_iterator it = end();
>    while (it != begin()) {
>        --it;
>        map.insert(std::pair<Key, T>(it.key(), it.value()));
>    }
>    return map;
>}
>
>
>
>template <class Key, class T>
>class QMultiMap : public QMap<Key, T>
>{
>public:
>    QMultiMap() {}
>    QMultiMap(const QMap<Key, T> &other) : QMap<Key, T>(other) {}
>    inline void swap(QMultiMap<Key, T> &other) { QMap<Key, T>::swap(other); }
>
>    inline typename QMap<Key, T>::iterator replace(const Key &key, const T &value)
>    { return QMap<Key, T>::insert(key, value); }
>    inline typename QMap<Key, T>::iterator insert(const Key &key, const T &value)
>    { return QMap<Key, T>::insertMulti(key, value); }
>
>    inline QMultiMap &operator+=(const QMultiMap &other)
>    { this->unite(other); return *this; }
>    inline QMultiMap operator+(const QMultiMap &other) const
>    { QMultiMap result = *this; result += other; return result; }
>
>
>
>    using QMap<Key, T>::contains;
>    using QMap<Key, T>::remove;
>    using QMap<Key, T>::count;
>    using QMap<Key, T>::find;
>    using QMap<Key, T>::constFind;
># 1013 "/usr/include/QtCore/qmap.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 QMap<Key, T>::iterator find(const Key &key, const T &value) {
>        typename QMap<Key, T>::iterator i(find(key));
>        typename QMap<Key, T>::iterator end(this->end());
>        while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
>            if (i.value() == value)
>                return i;
>            ++i;
>        }
>        return end;
>    }
>    typename QMap<Key, T>::const_iterator find(const Key &key, const T &value) const {
>        typename QMap<Key, T>::const_iterator i(constFind(key));
>        typename QMap<Key, T>::const_iterator end(QMap<Key, T>::constEnd());
>        while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
>            if (i.value() == value)
>                return i;
>            ++i;
>        }
>        return end;
>    }
>    typename QMap<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 QMultiMap<Key, T>::contains(const Key &key, const T &value) const
>{
>    return constFind(key, value) != QMap<Key, T>::constEnd();
>}
>
>template <class Key, class T>
>inline int QMultiMap<Key, T>::remove(const Key &key, const T &value)
>{
>    int n = 0;
>    typename QMap<Key, T>::iterator i(find(key));
>    typename QMap<Key, T>::iterator end(QMap<Key, T>::end());
>    while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
>        if (i.value() == value) {
>            i = this->erase(i);
>            ++n;
>        } else {
>            ++i;
>        }
>    }
>    return n;
>}
>
>template <class Key, class T>
>inline int QMultiMap<Key, T>::count(const Key &key, const T &value) const
>{
>    int n = 0;
>    typename QMap<Key, T>::const_iterator i(constFind(key));
>    typename QMap<Key, T>::const_iterator end(QMap<Key, T>::constEnd());
>    while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
>        if (i.value() == value)
>            ++n;
>        ++i;
>    }
>    return n;
>}
>
>template <class Key, class T> class QMapIterator { typedef typename QMap<Key,T>::const_iterator const_iterator; typedef const_iterator Item; QMap<Key,T> c; const_iterator i, n; inline bool item_exists() const { return n != c.constEnd(); } public: inline QMapIterator(const QMap<Key,T> &container) : c(container), i(c.constBegin()), n(c.constEnd()) {} inline QMapIterator &operator=(const QMap<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 { qt_noop(); return *n; } inline const Key &key() const { 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 QMutableMapIterator { typedef typename QMap<Key,T>::iterator iterator; typedef typename QMap<Key,T>::const_iterator const_iterator; typedef iterator Item; QMap<Key,T> *c; iterator i, n; inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } public: inline QMutableMapIterator(QMap<Key,T> &container) : c(&container) { c->setSharable(false); i = c->begin(); n = c->end(); } inline ~QMutableMapIterator() { c->setSharable(true); } inline QMutableMapIterator &operator=(QMap<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() { qt_noop(); return *n; } inline const T &value() const { qt_noop(); return *n; } inline const Key &key() const { 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 "/usr/include/QtCore/QMap" 2
># 25 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h" 2
># 1 "/usr/include/QtCore/QMutex" 1
># 1 "/usr/include/QtCore/qmutex.h" 1
># 49 "/usr/include/QtCore/qmutex.h"
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>
>class QAtomicInt;
>class QMutexData;
>
>class __attribute__((visibility("default"))) QMutex
>{
>    friend class QWaitCondition;
>    friend class QWaitConditionPrivate;
>
>public:
>    enum RecursionMode { NonRecursive, Recursive };
>
>    explicit QMutex(RecursionMode mode = NonRecursive);
>    ~QMutex();
>
>    void lock();
>    inline void lockInline();
>    bool tryLock();
>    bool tryLock(int timeout);
>    inline bool tryLockInline();
>    void unlock();
>    inline void unlockInline();
># 93 "/usr/include/QtCore/qmutex.h"
>private:
>    void lockInternal();
>    void unlockInternal();
>    QMutex(const QMutex &); QMutex &operator=(const QMutex &);
>
>    QMutexData *d;
>};
>
>class __attribute__((visibility("default"))) QMutexLocker
>{
>public:
>    inline explicit QMutexLocker(QMutex *m)
>    {
>        qt_noop()
>                                                                  ;
>        if (m) {
>            m->lockInline();
>            val = reinterpret_cast<quintptr>(m) | quintptr(1u);
>        } else {
>            val = 0;
>        }
>    }
>    inline ~QMutexLocker() { unlock(); }
>
>    inline void unlock()
>    {
>        if ((val & quintptr(1u)) == quintptr(1u)) {
>            val &= ~quintptr(1u);
>            mutex()->unlockInline();
>        }
>    }
>
>    inline void relock()
>    {
>        if (val) {
>            if ((val & quintptr(1u)) == quintptr(0u)) {
>                mutex()->lockInline();
>                val |= quintptr(1u);
>            }
>        }
>    }
>
>
>
>
>
>
>    inline QMutex *mutex() const
>    {
>        return reinterpret_cast<QMutex *>(val & ~quintptr(1u));
>    }
>
>
>
>
>
>private:
>    QMutexLocker(const QMutexLocker &); QMutexLocker &operator=(const QMutexLocker &);
>
>    quintptr val;
>};
>
>class QMutexData
>{
>    public:
>        QAtomicInt contenders;
>        const uint recursive : 1;
>        uint reserved : 31;
>    protected:
>        QMutexData(QMutex::RecursionMode mode);
>        ~QMutexData();
>};
>
>
>inline void QMutex::unlockInline()
>{
>    if (d->recursive) {
>        unlock();
>    } else if (!d->contenders.testAndSetRelease(1, 0)) {
>        unlockInternal();
>    }
>}
>
>inline bool QMutex::tryLockInline()
>{
>    if (d->recursive) {
>        return tryLock();
>    } else {
>        return d->contenders.testAndSetAcquire(0, 1);
>    }
>}
>
>inline void QMutex::lockInline()
>{
>    if (d->recursive) {
>        lock();
>    } else if(!tryLockInline()) {
>        lockInternal();
>    }
>}
># 244 "/usr/include/QtCore/qmutex.h"
># 1 "/usr/include/QtCore/QMutex" 2
># 26 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h"
># 1 "/usr/include/QtCore/QMutex" 1
># 25 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 2
># 1 "/usr/include/QtCore/QWaitCondition" 1
># 1 "/usr/include/QtCore/qwaitcondition.h" 1
># 47 "/usr/include/QtCore/qwaitcondition.h"
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 1 3 4
># 48 "/usr/include/QtCore/qwaitcondition.h" 2
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>
>class QWaitConditionPrivate;
>class QMutex;
>class QReadWriteLock;
>
>class __attribute__((visibility("default"))) QWaitCondition
>{
>public:
>    QWaitCondition();
>    ~QWaitCondition();
>
>    bool wait(QMutex *mutex, unsigned long time = (9223372036854775807L * 2UL + 1UL));
>    bool wait(QReadWriteLock *readWriteLock, unsigned long time = (9223372036854775807L * 2UL + 1UL));
>
>    void wakeOne();
>    void wakeAll();
>
>private:
>    QWaitCondition(const QWaitCondition &); QWaitCondition &operator=(const QWaitCondition &);
>
>    QWaitConditionPrivate * d;
>};
># 101 "/usr/include/QtCore/qwaitcondition.h"
># 1 "/usr/include/QtCore/QWaitCondition" 2
># 26 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 2
># 1 "/usr/include/QtCore/QThread" 1
># 1 "/usr/include/QtCore/qthread.h" 1
># 47 "/usr/include/QtCore/qthread.h"
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 1 3 4
># 48 "/usr/include/QtCore/qthread.h" 2
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QThreadData;
>class QThreadPrivate;
>
>
>class __attribute__((visibility("default"))) QThread : public QObject
>{
>public:
>    static Qt::HANDLE currentThreadId();
>    static QThread *currentThread();
>    static int idealThreadCount();
>    static void yieldCurrentThread();
>
>    explicit QThread(QObject *parent = 0);
>    ~QThread();
>
>    enum Priority {
>        IdlePriority,
>
>        LowestPriority,
>        LowPriority,
>        NormalPriority,
>        HighPriority,
>        HighestPriority,
>
>        TimeCriticalPriority,
>
>        InheritPriority
>    };
>
>    void setPriority(Priority priority);
>    Priority priority() const;
>
>    bool isFinished() const;
>    bool isRunning() const;
>
>    void setStackSize(uint stackSize);
>    uint stackSize() const;
>
>    void exit(int retcode = 0);
>
>public :
>    void start(Priority = InheritPriority);
>    void terminate();
>    void quit();
>
>public:
>
>    bool wait(unsigned long time = (9223372036854775807L * 2UL + 1UL));
>
>protected:
>    void started();
>    void finished();
>    void terminated();
>
>protected:
>    virtual void run();
>    int exec();
>
>    static void setTerminationEnabled(bool enabled = true);
>
>    static void sleep(unsigned long);
>    static void msleep(unsigned long);
>    static void usleep(unsigned long);
>
>
>
>
>
>
>
>protected:
>    QThread(QThreadPrivate &dd, QObject *parent = 0);
>
>private:
>    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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
>    inline QThreadPrivate* d_func() { return reinterpret_cast<QThreadPrivate *>(qGetPtrHelper(d_ptr)); } inline const QThreadPrivate* d_func() const { return reinterpret_cast<const QThreadPrivate *>(qGetPtrHelper(d_ptr)); } friend class QThreadPrivate;
>
>    static void initialize();
>    static void cleanup();
>
>    friend class QCoreApplication;
>    friend class QThreadData;
>};
># 162 "/usr/include/QtCore/qthread.h"
># 1 "/usr/include/QtCore/QThread" 2
># 27 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 2
># 1 "/usr/include/QtCore/QStringList" 1
># 1 "/usr/include/QtCore/qstringlist.h" 1
># 46 "/usr/include/QtCore/qstringlist.h"
># 1 "/usr/include/QtCore/qdatastream.h" 1 3 4
># 53 "/usr/include/QtCore/qdatastream.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>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
>
>
>
>
>    };
>
>    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 &);
>    virtual ~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);
># 188 "/usr/include/QtCore/qdatastream.h" 3 4
>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();
>    map.setInsertInOrder(true);
>    for (quint32 i = 0; i < n; ++i) {
>        if (in.status() != QDataStream::Ok)
>            break;
>
>        aKey key;
>        aT value;
>        in >> key >> value;
>        map.insertMulti(key, value);
>    }
>    map.setInsertInOrder(false);
>    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;
>}
># 47 "/usr/include/QtCore/qstringlist.h" 2
>
># 1 "/usr/include/QtCore/qregexp.h" 1 3 4
># 52 "/usr/include/QtCore/qregexp.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>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;
># 125 "/usr/include/QtCore/qregexp.h" 3 4
>    int matchedLength() const;
>
>
>    int numCaptures() 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);
># 152 "/usr/include/QtCore/qregexp.h" 3 4
>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) }; static inline const char *name() { return "QRegExp"; } };
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &out, const QRegExp &regExp);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &in, QRegExp &regExp);
># 49 "/usr/include/QtCore/qstringlist.h" 2
>
># 1 "/usr/include/QtCore/qstringmatcher.h" 1 3 4
># 47 "/usr/include/QtCore/qstringmatcher.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QStringMatcherPrivate;
>
>class __attribute__((visibility("default"))) QStringMatcher
>{
>public:
>    QStringMatcher();
>    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;
>    };
>
>
>
>};
># 51 "/usr/include/QtCore/qstringlist.h" 2
># 59 "/usr/include/QtCore/qstringlist.h"
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QRegExp;
>
>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();
>    inline int removeDuplicates();
>
>    inline QString join(const QString &sep) const;
>
>    inline QStringList filter(const QString &str, Qt::CaseSensitivity cs = Qt::CaseSensitive) const;
>    inline QBool 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;
>
>
>    using QList<QString>::indexOf;
>    using QList<QString>::lastIndexOf;
># 129 "/usr/include/QtCore/qstringlist.h"
>};
>
>namespace QtPrivate {
>    void __attribute__((visibility("default"))) QStringList_sort(QStringList *that);
>    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);
>
>    QBool __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);
>
>}
>
>inline void QStringList::sort()
>{
>    QtPrivate::QStringList_sort(this);
>}
>
>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 QBool 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);
>}
># 248 "/usr/include/QtCore/qstringlist.h"
>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 "/usr/include/QtCore/QStringList" 2
># 28 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/enginefactory.h" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/enginefactory.h"
>class QObject;
>class QString;
>class QIODevice;
>class QWidget;
>class QTranslator;
>class QStringList;
>class MetaDataModel;
>class FileInfo;
>class AbstractEngine;
>
>
>
>
>class EngineProperties
>{
>public:
>
>
>
>    EngineProperties()
>    {
>        hasAbout = false;
>        hasSettings = false;
>    }
>    QString name;
>    QString shortName;
>    QStringList filters;
>    QString description;
>    QStringList contentTypes;
>    QStringList protocols;
>    bool hasAbout;
>    bool hasSettings;
>};
>
>
>
>class EngineFactory
>{
>public:
>
>
>
>    virtual ~EngineFactory() {}
>
>
>
>    virtual bool supports(const QString &source) const = 0;
>
>
>
>    virtual const EngineProperties properties() const = 0;
>
>
>
>
>    virtual AbstractEngine *create(QObject *parent = 0) = 0;
>
>
>
>
>
>
>    virtual QList<FileInfo *> createPlayList(const QString &fileName, bool useMetaData) = 0;
>
>
>
>
>
>
>    virtual MetaDataModel* createMetaDataModel(const QString &path, QObject *parent = 0) = 0;
>
>
>
>
>    virtual void showSettings(QWidget *parent) = 0;
>
>
>
>
>    virtual void showAbout(QWidget *parent) = 0;
>
>
>
>
>    virtual QTranslator *createTranslator(QObject *parent) = 0;
>};
>
>template <> inline const char *qobject_interface_iid<EngineFactory *>() { return "EngineFactory/1.0"; } template <> inline EngineFactory *qobject_cast<EngineFactory *>(QObject *object) { return reinterpret_cast<EngineFactory *>((object ? object->qt_metacast("EngineFactory/1.0") : 0)); } template <> inline EngineFactory *qobject_cast<EngineFactory *>(const QObject *object) { return reinterpret_cast<EngineFactory *>((object ? const_cast<QObject *>(object)->qt_metacast("EngineFactory/1.0") : 0)); };
># 29 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h"
># 1 "/usr/include/QtCore/QObject" 1
># 25 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h" 2
># 1 "/usr/include/QtCore/QUrl" 1
># 1 "/usr/include/QtCore/qurl.h" 1
># 47 "/usr/include/QtCore/qurl.h"
># 1 "/usr/include/QtCore/qpair.h" 1 3 4
># 47 "/usr/include/QtCore/qpair.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>template <class T1, class T2>
>struct QPair
>{
>    typedef T1 first_type;
>    typedef T2 second_type;
>
>    QPair() : first(T1()), second(T2()) {}
>    QPair(const T1 &t1, const T2 &t2) : first(t1), second(t2) {}
>
>    QPair<T1, T2> &operator=(const QPair<T1, T2> &other)
>    { first = other.first; second = other.second; return *this; }
>
>    T1 first;
>    T2 second;
>};
>
>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;
>}
># 48 "/usr/include/QtCore/qurl.h" 2
>
># 1 "/usr/include/QtCore/qhash.h" 1 3 4
># 51 "/usr/include/QtCore/qhash.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QBitArray;
>class QByteArray;
>class QString;
>class QStringRef;
>
>inline uint qHash(char key) { return uint(key); }
>inline uint qHash(uchar key) { return uint(key); }
>inline uint qHash(signed char key) { return uint(key); }
>inline uint qHash(ushort key) { return uint(key); }
>inline uint qHash(short key) { return uint(key); }
>inline uint qHash(uint key) { return key; }
>inline uint qHash(int key) { return uint(key); }
>inline uint qHash(ulong key)
>{
>    if (sizeof(ulong) > sizeof(uint)) {
>        return uint(((key >> (8 * sizeof(uint) - 1)) ^ key) & (~0U));
>    } else {
>        return uint(key & (~0U));
>    }
>}
>inline uint qHash(long key) { return qHash(ulong(key)); }
>inline uint qHash(quint64 key)
>{
>    if (sizeof(quint64) > sizeof(uint)) {
>        return uint(((key >> (8 * sizeof(uint) - 1)) ^ key) & (~0U));
>    } else {
>        return uint(key & (~0U));
>    }
>}
>inline uint qHash(qint64 key) { return qHash(quint64(key)); }
>inline uint qHash(QChar key) { return qHash(key.unicode()); }
>__attribute__((visibility("default"))) uint qHash(const QByteArray &key);
>__attribute__((visibility("default"))) uint qHash(const QString &key);
>__attribute__((visibility("default"))) uint qHash(const QStringRef &key);
>__attribute__((visibility("default"))) uint qHash(const QBitArray &key);
>
>
>
>
>
>template <class T> inline uint qHash(const T *key)
>{
>    return qHash(reinterpret_cast<quintptr>(key));
>}
>
>
>
>
>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;
>}
>
>struct __attribute__((visibility("default"))) QHashData
>{
>    struct Node {
>        Node *next;
>        uint h;
>    };
>
>    Node *fakeNext;
>    Node **buckets;
>    QBasicAtomicInt ref;
>    int size;
>    int nodeSize;
>    short userNumBits;
>    short numBits;
>    int numBuckets;
>    uint sharable : 1;
>    uint strictAlignment : 1;
>    uint reserved : 30;
>
>    void *allocateNode();
>    void *allocateNode(int nodeAlign);
>    void freeNode(void *node);
>    QHashData *detach_helper(void (*node_duplicate)(Node *, void *), int nodeSize);
>    QHashData *detach_helper2(void (*node_duplicate)(Node *, void *), void (*node_delete)(Node *),
>                              int nodeSize, int nodeAlign);
>    void mightGrow();
>    bool willGrow();
>    void hasShrunk();
>    void rehash(int hint);
>    void free_helper(void (*node_delete)(Node *));
>    void destroyAndFree();
>    Node *firstNode();
>
>
>
>
>    static Node *nextNode(Node *node);
>    static Node *previousNode(Node *node);
>
>    static QHashData shared_null;
>};
>
>inline void QHashData::mightGrow()
>{
>    if (size >= numBuckets)
>        rehash(numBits + 1);
>}
>
>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) }; static inline const char *name() { return "QHashDummyValue"; } };
>
>template <class Key, class T>
>struct QHashDummyNode
>{
>    QHashDummyNode *next;
>    uint h;
>    Key key;
>
>    inline QHashDummyNode(const Key &key0) : key(key0) {}
>};
>
>template <class Key, class T>
>struct QHashNode
>{
>    QHashNode *next;
>    uint h;
>    Key key;
>    T value;
>
>    inline QHashNode(const Key &key0) : key(key0) {}
>    inline QHashNode(const Key &key0, const T &value0) : key(key0), value(value0) {}
>    inline bool same_key(uint h0, const Key &key0) { return h0 == h && key0 == key; }
>};
># 250 "/usr/include/QtCore/qhash.h" 3 4
>template <class T> struct QHashDummyNode<short, T> { QHashDummyNode *next; union { uint h; short key; }; inline QHashDummyNode(short ) {} }; template <class T> struct QHashNode<short, T> { QHashNode *next; union { uint h; short key; }; T value; inline QHashNode(short ) {} inline QHashNode(short , const T &value0) : value(value0) {} inline bool same_key(uint h0, short) { return h0 == h; } };
>template <class T> struct QHashDummyNode<ushort, T> { QHashDummyNode *next; union { uint h; ushort key; }; inline QHashDummyNode(ushort ) {} }; template <class T> struct QHashNode<ushort, T> { QHashNode *next; union { uint h; ushort key; }; T value; inline QHashNode(ushort ) {} inline QHashNode(ushort , const T &value0) : value(value0) {} inline bool same_key(uint h0, ushort) { return h0 == h; } };
>
>template <class T> struct QHashDummyNode<int, T> { QHashDummyNode *next; union { uint h; int key; }; inline QHashDummyNode(int ) {} }; template <class T> struct QHashNode<int, T> { QHashNode *next; union { uint h; int key; }; T value; inline QHashNode(int ) {} inline QHashNode(int , const T &value0) : value(value0) {} inline bool same_key(uint h0, int) { return h0 == h; } };
>template <class T> struct QHashDummyNode<uint, T> { QHashDummyNode *next; union { uint h; uint key; }; inline QHashDummyNode(uint ) {} }; template <class T> struct QHashNode<uint, T> { QHashNode *next; union { uint h; uint key; }; T value; inline QHashNode(uint ) {} inline QHashNode(uint , const T &value0) : value(value0) {} inline bool same_key(uint h0, uint) { return h0 == 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(&QHashData::shared_null) { d->ref.ref(); }
>    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 != 1) detach_helper(); }
>    inline bool isDetached() const { return d->ref == 1; }
>    inline void setSharable(bool sharable) { if (!sharable) detach(); 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;
>        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 operator Node *() const { return concrete(i); }
>        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; }
>
>    private:
>
>        inline operator bool() const { return false; }
>    };
>    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 operator Node *() const { return concrete(i); }
>        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; }
># 457 "/usr/include/QtCore/qhash.h" 3 4
>    private:
>
>        inline operator bool() const { return false; }
>    };
>    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 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 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);
>    } else {
>        (void) new (newNode) Node(concreteNode->key, concreteNode->value);
>    }
>}
>
>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));
>    } else {
>        node = new (d->allocateNode(alignOfNode())) Node(akey, avalue);
>    }
>
>    node->h = ah;
>    node->next = *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_helper2(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 = it;
>    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 = qHash(akey);
>
>    if (d->numBuckets) {
>        node = reinterpret_cast<Node **>(&d->buckets[h % d->numBuckets]);
>        qt_noop();
>        while (*node != e && !(*node)->same_key(h, akey))
>            node = &(*node)->next;
>    } else {
>        node = const_cast<Node **>(reinterpret_cast<const Node * const *>(&e));
>    }
>    if (ahp)
>        *ahp = h;
>    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;
># 966 "/usr/include/QtCore/qhash.h" 3 4
>    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 { qt_noop(); return *n; } inline const Key &key() const { 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() { qt_noop(); return *n; } inline const T &value() const { qt_noop(); return *n; } inline const Key &key() const { 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; } };
># 50 "/usr/include/QtCore/qurl.h" 2
>
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class QUrlPrivate;
>class QDataStream;
>
>class __attribute__((visibility("default"))) QUrl
>{
>public:
>    enum ParsingMode {
>        TolerantMode,
>        StrictMode
>    };
>
>
>    enum FormattingOption {
>        None = 0x0,
>        RemoveScheme = 0x1,
>        RemovePassword = 0x2,
>        RemoveUserInfo = RemovePassword | 0x4,
>        RemovePort = 0x8,
>        RemoveAuthority = RemoveUserInfo | RemovePort | 0x10,
>        RemovePath = 0x20,
>        RemoveQuery = 0x40,
>        RemoveFragment = 0x80,
>
>
>        StripTrailingSlash = 0x10000
>    };
>    typedef QFlags<FormattingOption> FormattingOptions;
>
>    QUrl();
>
>
>
>    QUrl(const QString &url);
>    QUrl(const QString &url, ParsingMode mode);
>
>    QUrl(const QUrl &copy);
>    QUrl &operator =(const QUrl &copy);
>
>    QUrl &operator =(const QString &url);
>
>
>
>
>
>    ~QUrl();
>
>    inline void swap(QUrl &other) { qSwap(d, other.d); }
>
>    void setUrl(const QString &url);
>    void setUrl(const QString &url, ParsingMode mode);
>
>    void setEncodedUrl(const QByteArray &url);
>    void setEncodedUrl(const QByteArray &url, ParsingMode mode);
>
>
>    bool isValid() const;
>
>    bool isEmpty() const;
>
>    void clear();
>
>    void setScheme(const QString &scheme);
>    QString scheme() const;
>
>    void setAuthority(const QString &authority);
>    QString authority() const;
>
>    void setUserInfo(const QString &userInfo);
>    QString userInfo() const;
>
>    void setUserName(const QString &userName);
>    QString userName() const;
>    void setEncodedUserName(const QByteArray &userName);
>    QByteArray encodedUserName() const;
>
>    void setPassword(const QString &password);
>    QString password() const;
>    void setEncodedPassword(const QByteArray &password);
>    QByteArray encodedPassword() const;
>
>    void setHost(const QString &host);
>    QString host() const;
>    void setEncodedHost(const QByteArray &host);
>    QByteArray encodedHost() const;
>
>    void setPort(int port);
>    int port() const;
>    int port(int defaultPort) const;
>
>
>    void setPath(const QString &path);
>    QString path() const;
>    void setEncodedPath(const QByteArray &path);
>    QByteArray encodedPath() const;
>
>    bool hasQuery() const;
>
>    void setEncodedQuery(const QByteArray &query);
>    QByteArray encodedQuery() const;
>
>    void setQueryDelimiters(char valueDelimiter, char pairDelimiter);
>    char queryValueDelimiter() const;
>    char queryPairDelimiter() const;
>
>    void setQueryItems(const QList<QPair<QString, QString> > &query);
>    void addQueryItem(const QString &key, const QString &value);
>    QList<QPair<QString, QString> > queryItems() const;
>    bool hasQueryItem(const QString &key) const;
>    QString queryItemValue(const QString &key) const;
>    QStringList allQueryItemValues(const QString &key) const;
>    void removeQueryItem(const QString &key);
>    void removeAllQueryItems(const QString &key);
>
>    void setEncodedQueryItems(const QList<QPair<QByteArray, QByteArray> > &query);
>    void addEncodedQueryItem(const QByteArray &key, const QByteArray &value);
>    QList<QPair<QByteArray, QByteArray> > encodedQueryItems() const;
>    bool hasEncodedQueryItem(const QByteArray &key) const;
>    QByteArray encodedQueryItemValue(const QByteArray &key) const;
>    QList<QByteArray> allEncodedQueryItemValues(const QByteArray &key) const;
>    void removeEncodedQueryItem(const QByteArray &key);
>    void removeAllEncodedQueryItems(const QByteArray &key);
>
>    void setFragment(const QString &fragment);
>    QString fragment() const;
>    void setEncodedFragment(const QByteArray &fragment);
>    QByteArray encodedFragment() const;
>    bool hasFragment() const;
>
>    QString topLevelDomain() const;
>
>
>    QUrl resolved(const QUrl &relative) const;
>
>    bool isRelative() const;
>    bool isParentOf(const QUrl &url) const;
>
>    static QUrl fromLocalFile(const QString &localfile);
>    QString toLocalFile() const;
>    bool isLocalFile() const;
>
>    QString toString(FormattingOptions options = None) const;
>
>    QByteArray toEncoded(FormattingOptions options = None) const;
>    static QUrl fromEncoded(const QByteArray &url);
>    static QUrl fromEncoded(const QByteArray &url, ParsingMode mode);
>
>
>    static QUrl fromUserInput(const QString &userInput);
>
>    void detach();
>    bool isDetached() const;
>
>    bool operator <(const QUrl &url) const;
>    bool operator ==(const QUrl &url) const;
>    bool operator !=(const QUrl &url) const;
>
>    static QString fromPercentEncoding(const QByteArray &);
>    static QByteArray toPercentEncoding(const QString &,
>                                        const QByteArray &exclude = QByteArray(),
>                                        const QByteArray &include = QByteArray());
>    static QString fromPunycode(const QByteArray &);
>    static QByteArray toPunycode(const QString &);
>    static QString fromAce(const QByteArray &);
>    static QByteArray toAce(const QString &);
>    static QStringList idnWhitelist();
>    static void setIdnWhitelist(const QStringList &);
># 269 "/usr/include/QtCore/qurl.h"
>    QString errorString() const;
>
>protected:
>
>
>
>
>private:
>    QUrlPrivate *d;
>public:
>    typedef QUrlPrivate * DataPtr;
>    inline DataPtr &data_ptr() { return d; }
>};
>
>inline uint qHash(const QUrl &url)
>{
>    return qHash(url.toEncoded(QUrl::FormattingOption(0x100)));
>}
>
>template<> class QTypeInfo<QUrl > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QUrl)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QUrl"; } };
>template <> inline bool qIsDetached<QUrl>(QUrl &t) { return t.isDetached(); } template <> inline void qSwap<QUrl>(QUrl &value1, QUrl &value2) { qSwap(value1.data_ptr(), value2.data_ptr()); } namespace std { template<> inline void swap< ::QUrl>(::QUrl &value1, ::QUrl &value2) { swap(value1.data_ptr(), value2.data_ptr()); } }
> inline QFlags<QUrl::FormattingOptions::enum_type> operator|(QUrl::FormattingOptions::enum_type f1, QUrl::FormattingOptions::enum_type f2) { return QFlags<QUrl::FormattingOptions::enum_type>(f1) | f2; } inline QFlags<QUrl::FormattingOptions::enum_type> operator|(QUrl::FormattingOptions::enum_type f1, QFlags<QUrl::FormattingOptions::enum_type> f2) { return f2 | f1; } inline QIncompatibleFlag operator|(QUrl::FormattingOptions::enum_type f1, int f2) { return QIncompatibleFlag(int(f1) | f2); }
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QUrl &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QUrl &);
>
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QUrl &);
># 1 "/usr/include/QtCore/QUrl" 2
># 26 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h" 2
># 1 "/usr/include/QtCore/QStringList" 1
># 27 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/eqsettings.h" 1
># 27 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/eqsettings.h"
>class EqSettings
>{
>public:
>
>
>
>    EqSettings();
>
>
>
>    bool isEnabled() const;
>
>
>
>    double gain(int chan) const;
>
>
>
>    double preamp() const;
>
>
>
>    void setEnabled(bool enabled = true);
>
>
>
>
>
>    void setGain(int chan, double gain);
>
>
>
>    void setPreamp(double preamp);
>
>
>
>    void operator=(const EqSettings &s);
>
>
>
>    bool operator==(const EqSettings &s) const;
>
>
>
>    bool operator!=(const EqSettings &s) const;
>
>private:
>    double m_gain[10];
>    double m_preamp;
>    bool m_is_enabled;
>};
># 28 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h" 2
>
>
>
>
>class QmmpSettings : 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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
>public:
>
>
>
>
>
>    QmmpSettings(QObject *parent = 0);
>
>
>
>    ~QmmpSettings();
>
>
>
>    enum ReplayGainMode
>    {
>        REPLAYGAIN_TRACK = 0,
>        REPLAYGAIN_ALBUM,
>        REPLAYGAIN_DISABLED
>    };
>
>
>
>    QmmpSettings::ReplayGainMode replayGainMode() const;
>
>
>
>    double replayGainPreamp() const;
>
>
>
>    double replayGainDefaultGain() const;
>
>
>
>    bool replayGainPreventClipping() const;
>
>
>
>
>
>
>
>    void setReplayGainSettings(ReplayGainMode mode, double preamp, double default_gain, bool clip);
>
>
>
>    bool useSoftVolume() const;
>
>
>
>    bool use16BitOutput() const;
>
>
>
>
>
>    void setAudioSettings(bool soft_volume, bool use_16bit);
>
>
>
>
>    QStringList coverNameFilters(bool include = true) const;
>
>
>
>    int coverSearchDepth() const;
>
>
>
>    bool useCoverFiles() const;
># 115 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmpsettings.h"
>    void setCoverSettings(QStringList inc, QStringList exc, int depth, bool use_files);
>
>
>
>    bool isProxyEnabled() const;
>
>
>
>    bool useProxyAuth() const;
>
>
>
>    QUrl proxy() const;
>
>
>
>
>
>
>    void setNetworkSettings(bool use_proxy, bool auth, const QUrl &proxy);
>
>
>
>    EqSettings eqSettings() const;
>
>
>
>    void setEqSettings(const EqSettings &settings);
>
>
>
>    int bufferSize() const;
>
>
>
>
>    void setBufferSize(int msec);
>
>
>
>    static QmmpSettings* instance();
>
>protected:
>
>
>
>    void replayGainSettingsChanged();
>
>
>
>    void audioSettingsChanged();
>
>
>
>    void coverSettingsChanged();
>
>
>
>    void networkSettingsChanged();
>
>
>
>    void eqSettingsChanged();
>
>private :
>    void sync();
>
>private:
>
>    QmmpSettings::ReplayGainMode m_rg_mode;
>    double m_rg_preamp;
>    double m_rg_defaut_gain;
>    bool m_rg_prevent_clipping;
>
>    bool m_aud_software_volume;
>    bool m_aud_16bit;
>
>    QStringList m_cover_inc;
>    QStringList m_cover_exclude;
>    int m_cover_depth;
>    bool m_cover_use_files;
>
>    bool m_proxy_enabled;
>    bool m_proxy_auth;
>    QUrl m_proxy_url;
>
>    EqSettings m_eq_settings;
>
>    int m_buffer_size;
>
>    static QmmpSettings* m_instance;
>
>};
># 30 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/abstractengine.h" 2
>
>class QIODevice;
>class InputSource;
>
>
>
>
>
>class AbstractEngine : public QThread
>{
> 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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
>public:
>
>
>
>
>    AbstractEngine(QObject *parent = 0);
>
>
>
>
>    virtual bool enqueue(InputSource *source) = 0;
>
>
>
>
>    virtual qint64 totalTime() = 0;
>
>
>
>
>    virtual bool play() = 0;
>
>
>
>    virtual void seek(qint64 time) = 0;
>
>
>
>    virtual void stop() = 0;
>
>
>
>    virtual void pause() = 0;
>
>
>
>    QMutex *mutex();
>
>
>
>    QWaitCondition *cond();
>
>
>
>
>
>
>    static AbstractEngine *create(InputSource *s, QObject *parent = 0);
>
>
>
>    static QList<EngineFactory*> *factories();
>
>
>
>    static EngineFactory *findByPath(const QString &path);
>
>
>
>
>
>    static void setEnabled(EngineFactory* factory, bool enable = true);
>
>
>
>
>    static bool isEnabled(EngineFactory* factory);
>
>
>
>    static QStringList files();
>
>
>
>
>    static QStringList protocols();
>
>protected:
>
>
>
>    void playbackFinished();
>
>private:
>    QMutex m_mutex;
>    QWaitCondition m_waitCondition;
>
>    static void checkFactories();
>    static QList<EngineFactory*> *m_factories;
>    static QList<EngineFactory*> *m_disabledFactories;
>    static QStringList m_files;
>};
># 27 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmp.h" 1
># 23 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmp.h"
># 1 "/usr/include/QtCore/QUrl" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/qmmp.h" 2
>
>
>
>
>class Qmmp
>{
>public:
>
>
>
>    enum State
>    {
>        Playing = 0,
>        Paused,
>        Stopped,
>        Buffering,
>        NormalError,
>        FatalError
>    };
>
>
>
>    enum MetaData
>    {
>        TITLE = 0,
>        ARTIST,
>        ALBUM,
>        COMMENT,
>        GENRE,
>        COMPOSER,
>        YEAR,
>        TRACK,
>        DISCNUMBER,
>        URL
>    };
>
>
>
>    enum ReplayGainKey
>    {
>        REPLAYGAIN_TRACK_GAIN = 0,
>        REPLAYGAIN_TRACK_PEAK,
>        REPLAYGAIN_ALBUM_GAIN,
>        REPLAYGAIN_ALBUM_PEAK
>    };
>
>
>
>    enum AudioFormat
>    {
>        PCM_UNKNOWM = -1,
>        PCM_S8 = 0,
>        PCM_S16LE,
>        PCM_S24LE,
>        PCM_S32LE
>    };
>
>
>
>    static const QString configFile();
>
>
>
>    static void setConfigFile(const QString &path);
>
>
>
>    static const QString strVersion();
>
>
>
>    static const QString pluginsPath();
>
>
>
>    static QString systemLanguageID();
>
>private:
>    static QString m_configFile;
>
>};
># 28 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h" 2
>
>
>
>
>class StateHandler : 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; } 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) { return staticMetaObject.tr(s, c); } static inline QString trUtf8(const char *s, const char *c = 0) { return staticMetaObject.trUtf8(s, c); } static inline QString tr(const char *s, const char *c, int n) { return staticMetaObject.tr(s, c, n); } static inline QString trUtf8(const char *s, const char *c, int n) { return staticMetaObject.trUtf8(s, c, n); } virtual int qt_metacall(QMetaObject::Call, int, void **); private: __attribute__((visibility("hidden"))) static const QMetaObjectExtraData staticMetaObjectExtraData; __attribute__((visibility("hidden"))) static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
>public:
>
>
>
>
>    StateHandler(QObject *parent = 0);
>
>
>
>    ~StateHandler();
># 53 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/statehandler.h"
>    virtual void dispatch(qint64 elapsed,
>                          int bitrate,
>                          quint32 frequency,
>                          int precision,
>                          int channels);
>
>
>
>    virtual void dispatch(const QMap<Qmmp::MetaData, QString> &metaData);
>
>
>
>    virtual void dispatch(Qmmp::State state);
>
>
>
>
>    virtual void dispatchBuffer(int percent);
>
>
>
>    void setNextEngine(AbstractEngine *engine);
>
>
>
>    void setCurrentEngine(AbstractEngine *engine);
>
>
>
>    qint64 elapsed();
>
>
>
>    int bitrate();
>
>
>
>    int frequency();
>
>
>
>    int precision();
>
>
>
>    int channels();
>
>
>
>    Qmmp::State state() const;
>
>
>
>    QMap <Qmmp::MetaData, QString> metaData();
>
>
>
>    QString metaData(Qmmp::MetaData key);
>
>
>
>    void sendNextTrackRequest();
>
>
>
>
>    AbstractEngine *nextEngine();
>
>
>
>
>    AbstractEngine *currentEngine();
>
>
>
>    static StateHandler* instance();
>
>protected:
>
>
>
>
>    void elapsedChanged(qint64 time);
>
>
>
>
>    void bitrateChanged(int bitrate);
>
>
>
>
>    void frequencyChanged(quint32 frequency);
>
>
>
>
>    void precisionChanged(int precision);
>
>
>
>
>    void channelsChanged(int channels);
>
>
>
>    void metaDataChanged();
>
>
>
>    void stateChanged(Qmmp::State newState);
>
>
>
>    void finished();
>
>
>
>    void nextTrackRequest();
>
>
>
>
>    void bufferingProgress(int progress);
>
>private:
>    qint64 m_elapsed;
>    quint32 m_frequency;
>    bool m_sendAboutToFinish;
>    int m_bitrate, m_precision, m_channels;
>    static StateHandler* m_instance;
>    QMap <Qmmp::MetaData, QString> m_metaData;
>    QMap <Qmmp::MetaData, QString> m_cachedMetaData;
>    Qmmp::State m_state;
>    QMutex m_mutex;
>    AbstractEngine *m_next_engine;
>    AbstractEngine *m_current_engine;
>};
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.h" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.h"
>extern "C"{
># 1 "/usr/include/ffmpeg/libavformat/avformat.h" 1
># 28 "/usr/include/ffmpeg/libavformat/avformat.h"
>unsigned avformat_version(void);
>
>
>
>
>const char *avformat_configuration(void);
>
>
>
>
>const char *avformat_license(void);
>
>
>
># 1 "/usr/include/ffmpeg/libavcodec/avcodec.h" 1
># 29 "/usr/include/ffmpeg/libavcodec/avcodec.h"
># 1 "/usr/include/errno.h" 1 3 4
># 32 "/usr/include/errno.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/errno.h" 1 3 4
># 25 "/usr/include/bits/errno.h" 3 4
># 1 "/usr/include/linux/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm/errno.h" 1 3 4
># 1 "/usr/include/asm-generic/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm-generic/errno-base.h" 1 3 4
># 5 "/usr/include/asm-generic/errno.h" 2 3 4
># 1 "/usr/include/asm/errno.h" 2 3 4
># 5 "/usr/include/linux/errno.h" 2 3 4
># 26 "/usr/include/bits/errno.h" 2 3 4
># 47 "/usr/include/bits/errno.h" 3 4
>extern int *__errno_location (void) throw () __attribute__ ((__const__));
># 37 "/usr/include/errno.h" 2 3 4
># 55 "/usr/include/errno.h" 3 4
>extern char *program_invocation_name, *program_invocation_short_name;
>
>
>
>}
># 69 "/usr/include/errno.h" 3 4
>typedef int error_t;
># 30 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
># 1 "/usr/include/ffmpeg/libavutil/samplefmt.h" 1
># 22 "/usr/include/ffmpeg/libavutil/samplefmt.h"
># 1 "/usr/include/ffmpeg/libavutil/avutil.h" 1
># 73 "/usr/include/ffmpeg/libavutil/avutil.h"
>unsigned avutil_version(void);
>
>
>
>
>const char *avutil_configuration(void);
>
>
>
>
>const char *avutil_license(void);
>
>enum AVMediaType {
>    AVMEDIA_TYPE_UNKNOWN = -1,
>    AVMEDIA_TYPE_VIDEO,
>    AVMEDIA_TYPE_AUDIO,
>    AVMEDIA_TYPE_DATA,
>    AVMEDIA_TYPE_SUBTITLE,
>    AVMEDIA_TYPE_ATTACHMENT,
>    AVMEDIA_TYPE_NB
>};
># 106 "/usr/include/ffmpeg/libavutil/avutil.h"
>enum AVPictureType {
>    AV_PICTURE_TYPE_NONE = 0,
>    AV_PICTURE_TYPE_I,
>    AV_PICTURE_TYPE_P,
>    AV_PICTURE_TYPE_B,
>    AV_PICTURE_TYPE_S,
>    AV_PICTURE_TYPE_SI,
>    AV_PICTURE_TYPE_SP,
>    AV_PICTURE_TYPE_BI,
>};
># 124 "/usr/include/ffmpeg/libavutil/avutil.h"
>char av_get_picture_type_char(enum AVPictureType pict_type);
>
># 1 "/usr/include/ffmpeg/libavutil/common.h" 1
># 30 "/usr/include/ffmpeg/libavutil/common.h"
># 1 "/usr/include/errno.h" 1 3 4
># 31 "/usr/include/ffmpeg/libavutil/common.h" 2
># 1 "/usr/include/inttypes.h" 1 3 4
># 28 "/usr/include/inttypes.h" 3 4
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stdint.h" 1 3 4
>
>
># 1 "/usr/include/stdint.h" 1 3 4
># 28 "/usr/include/stdint.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/stdint.h" 2 3 4
># 49 "/usr/include/stdint.h" 3 4
>typedef unsigned char uint8_t;
>typedef unsigned short int uint16_t;
>
>typedef unsigned int uint32_t;
>
>
>
>typedef unsigned long int uint64_t;
># 66 "/usr/include/stdint.h" 3 4
>typedef signed char int_least8_t;
>typedef short int int_least16_t;
>typedef int int_least32_t;
>
>typedef long int int_least64_t;
>
>
>
>
>
>
>typedef unsigned char uint_least8_t;
>typedef unsigned short int uint_least16_t;
>typedef unsigned int uint_least32_t;
>
>typedef unsigned long int uint_least64_t;
># 91 "/usr/include/stdint.h" 3 4
>typedef signed char int_fast8_t;
>
>typedef long int int_fast16_t;
>typedef long int int_fast32_t;
>typedef long int int_fast64_t;
># 104 "/usr/include/stdint.h" 3 4
>typedef unsigned char uint_fast8_t;
>
>typedef unsigned long int uint_fast16_t;
>typedef unsigned long int uint_fast32_t;
>typedef unsigned long int uint_fast64_t;
># 120 "/usr/include/stdint.h" 3 4
>typedef long int intptr_t;
>
>
>typedef unsigned long int uintptr_t;
># 135 "/usr/include/stdint.h" 3 4
>typedef long int intmax_t;
>typedef unsigned long int uintmax_t;
># 4 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/stdint.h" 2 3 4
># 29 "/usr/include/inttypes.h" 2 3 4
># 274 "/usr/include/inttypes.h" 3 4
>extern "C" {
>
>
>
>
>typedef struct
>  {
>    long int quot;
>    long int rem;
>  } imaxdiv_t;
># 298 "/usr/include/inttypes.h" 3 4
>extern intmax_t imaxabs (intmax_t __n) throw () __attribute__ ((__const__));
>
>
>extern imaxdiv_t imaxdiv (intmax_t __numer, intmax_t __denom)
>      throw () __attribute__ ((__const__));
>
>
>extern intmax_t strtoimax (__const char *__restrict __nptr,
>      char **__restrict __endptr, int __base) throw ();
>
>
>extern uintmax_t strtoumax (__const char *__restrict __nptr,
>       char ** __restrict __endptr, int __base) throw ();
>
>
>extern intmax_t wcstoimax (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>extern uintmax_t wcstoumax (__const wchar_t *__restrict __nptr,
>       wchar_t ** __restrict __endptr, int __base)
>     throw ();
>
>
>
>
>
>extern long int __strtol_internal (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern __inline __attribute__ ((__gnu_inline__)) intmax_t
>__attribute__ ((__leaf__)) strtoimax (__const char *__restrict nptr, char **__restrict endptr, int base) throw ()
>
>{
>  return __strtol_internal (nptr, endptr, base, 0);
>}
>
>extern unsigned long int __strtoul_internal (__const char *
>          __restrict __nptr,
>          char ** __restrict __endptr,
>          int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern __inline __attribute__ ((__gnu_inline__)) uintmax_t
>__attribute__ ((__leaf__)) strtoumax (__const char *__restrict nptr, char **__restrict endptr, int base) throw ()
>
>{
>  return __strtoul_internal (nptr, endptr, base, 0);
>}
>
>extern long int __wcstol_internal (__const wchar_t * __restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern __inline __attribute__ ((__gnu_inline__)) intmax_t
>__attribute__ ((__leaf__)) wcstoimax (__const wchar_t *__restrict nptr, wchar_t **__restrict endptr, int base) throw ()
>
>{
>  return __wcstol_internal (nptr, endptr, base, 0);
>}
>
>extern unsigned long int __wcstoul_internal (__const wchar_t *
>          __restrict __nptr,
>          wchar_t **
>          __restrict __endptr,
>          int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__warn_unused_result__));
>
>extern __inline __attribute__ ((__gnu_inline__)) uintmax_t
>__attribute__ ((__leaf__)) wcstoumax (__const wchar_t *__restrict nptr, wchar_t **__restrict endptr, int base) throw ()
>
>{
>  return __wcstoul_internal (nptr, endptr, base, 0);
>}
># 442 "/usr/include/inttypes.h" 3 4
>}
># 32 "/usr/include/ffmpeg/libavutil/common.h" 2
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 1 3 4
># 33 "/usr/include/ffmpeg/libavutil/common.h" 2
># 1 "/usr/include/math.h" 1 3 4
># 30 "/usr/include/math.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/huge_val.h" 1 3 4
># 35 "/usr/include/math.h" 2 3 4
>
># 1 "/usr/include/bits/huge_valf.h" 1 3 4
># 37 "/usr/include/math.h" 2 3 4
># 1 "/usr/include/bits/huge_vall.h" 1 3 4
># 38 "/usr/include/math.h" 2 3 4
>
>
># 1 "/usr/include/bits/inf.h" 1 3 4
># 41 "/usr/include/math.h" 2 3 4
>
>
># 1 "/usr/include/bits/nan.h" 1 3 4
># 44 "/usr/include/math.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/mathdef.h" 1 3 4
># 26 "/usr/include/bits/mathdef.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 27 "/usr/include/bits/mathdef.h" 2 3 4
>
>
>
>
>typedef float float_t;
>typedef double double_t;
># 48 "/usr/include/math.h" 2 3 4
># 71 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathcalls.h" 1 3 4
># 53 "/usr/include/bits/mathcalls.h" 3 4
>
>
>extern double acos (double __x) throw (); extern double __acos (double __x) throw ();
>
>extern double asin (double __x) throw (); extern double __asin (double __x) throw ();
>
>extern double atan (double __x) throw (); extern double __atan (double __x) throw ();
>
>extern double atan2 (double __y, double __x) throw (); extern double __atan2 (double __y, double __x) throw ();
>
>
>extern double cos (double __x) throw (); extern double __cos (double __x) throw ();
>
>extern double sin (double __x) throw (); extern double __sin (double __x) throw ();
>
>extern double tan (double __x) throw (); extern double __tan (double __x) throw ();
>
>
>
>
>extern double cosh (double __x) throw (); extern double __cosh (double __x) throw ();
>
>extern double sinh (double __x) throw (); extern double __sinh (double __x) throw ();
>
>extern double tanh (double __x) throw (); extern double __tanh (double __x) throw ();
>
>
>
>
>extern void sincos (double __x, double *__sinx, double *__cosx) throw (); extern void __sincos (double __x, double *__sinx, double *__cosx) throw ()
>                                                           ;
>
>
>
>
>
>extern double acosh (double __x) throw (); extern double __acosh (double __x) throw ();
>
>extern double asinh (double __x) throw (); extern double __asinh (double __x) throw ();
>
>extern double atanh (double __x) throw (); extern double __atanh (double __x) throw ();
>
>
>
>
>
>
>
>extern double exp (double __x) throw (); extern double __exp (double __x) throw ();
>
>
>extern double frexp (double __x, int *__exponent) throw (); extern double __frexp (double __x, int *__exponent) throw ();
>
>
>extern double ldexp (double __x, int __exponent) throw (); extern double __ldexp (double __x, int __exponent) throw ();
>
>
>extern double log (double __x) throw (); extern double __log (double __x) throw ();
>
>
>extern double log10 (double __x) throw (); extern double __log10 (double __x) throw ();
>
>
>extern double modf (double __x, double *__iptr) throw (); extern double __modf (double __x, double *__iptr) throw ()
>     __attribute__ ((__nonnull__ (2)));
>
>
>
>
>extern double exp10 (double __x) throw (); extern double __exp10 (double __x) throw ();
>
>extern double pow10 (double __x) throw (); extern double __pow10 (double __x) throw ();
>
>
>
>
>
>extern double expm1 (double __x) throw (); extern double __expm1 (double __x) throw ();
>
>
>extern double log1p (double __x) throw (); extern double __log1p (double __x) throw ();
>
>
>extern double logb (double __x) throw (); extern double __logb (double __x) throw ();
>
>
>
>
>
>
>extern double exp2 (double __x) throw (); extern double __exp2 (double __x) throw ();
>
>
>extern double log2 (double __x) throw (); extern double __log2 (double __x) throw ();
># 155 "/usr/include/bits/mathcalls.h" 3 4
>extern double pow (double __x, double __y) throw (); extern double __pow (double __x, double __y) throw ();
>
>
>extern double sqrt (double __x) throw (); extern double __sqrt (double __x) throw ();
>
>
>
>
>
>extern double hypot (double __x, double __y) throw (); extern double __hypot (double __x, double __y) throw ();
>
>
>
>
>
>
>extern double cbrt (double __x) throw (); extern double __cbrt (double __x) throw ();
># 180 "/usr/include/bits/mathcalls.h" 3 4
>extern double ceil (double __x) throw () __attribute__ ((__const__)); extern double __ceil (double __x) throw () __attribute__ ((__const__));
>
>
>extern double fabs (double __x) throw () __attribute__ ((__const__)); extern double __fabs (double __x) throw () __attribute__ ((__const__));
>
>
>extern double floor (double __x) throw () __attribute__ ((__const__)); extern double __floor (double __x) throw () __attribute__ ((__const__));
>
>
>extern double fmod (double __x, double __y) throw (); extern double __fmod (double __x, double __y) throw ();
>
>
>
>
>extern int __isinf (double __value) throw () __attribute__ ((__const__));
>
>
>extern int __finite (double __value) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int isinf (double __value) throw () __attribute__ ((__const__));
>
>
>extern int finite (double __value) throw () __attribute__ ((__const__));
>
>
>extern double drem (double __x, double __y) throw (); extern double __drem (double __x, double __y) throw ();
>
>
>
>extern double significand (double __x) throw (); extern double __significand (double __x) throw ();
>
>
>
>
>
>extern double copysign (double __x, double __y) throw () __attribute__ ((__const__)); extern double __copysign (double __x, double __y) throw () __attribute__ ((__const__));
>
>
>
>
>
>
>extern double nan (__const char *__tagb) throw () __attribute__ ((__const__)); extern double __nan (__const char *__tagb) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int __isnan (double __value) throw () __attribute__ ((__const__));
>
>
>
>extern int isnan (double __value) throw () __attribute__ ((__const__));
>
>
>extern double j0 (double) throw (); extern double __j0 (double) throw ();
>extern double j1 (double) throw (); extern double __j1 (double) throw ();
>extern double jn (int, double) throw (); extern double __jn (int, double) throw ();
>extern double y0 (double) throw (); extern double __y0 (double) throw ();
>extern double y1 (double) throw (); extern double __y1 (double) throw ();
>extern double yn (int, double) throw (); extern double __yn (int, double) throw ();
>
>
>
>
>
>
>extern double erf (double) throw (); extern double __erf (double) throw ();
>extern double erfc (double) throw (); extern double __erfc (double) throw ();
>extern double lgamma (double) throw (); extern double __lgamma (double) throw ();
>
>
>
>
>
>
>extern double tgamma (double) throw (); extern double __tgamma (double) throw ();
>
>
>
>
>
>extern double gamma (double) throw (); extern double __gamma (double) throw ();
>
>
>
>
>
>
>extern double lgamma_r (double, int *__signgamp) throw (); extern double __lgamma_r (double, int *__signgamp) throw ();
>
>
>
>
>
>
>
>extern double rint (double __x) throw (); extern double __rint (double __x) throw ();
>
>
>extern double nextafter (double __x, double __y) throw () __attribute__ ((__const__)); extern double __nextafter (double __x, double __y) throw () __attribute__ ((__const__));
>
>extern double nexttoward (double __x, long double __y) throw () __attribute__ ((__const__)); extern double __nexttoward (double __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>extern double remainder (double __x, double __y) throw (); extern double __remainder (double __x, double __y) throw ();
>
>
>
>extern double scalbn (double __x, int __n) throw (); extern double __scalbn (double __x, int __n) throw ();
>
>
>
>extern int ilogb (double __x) throw (); extern int __ilogb (double __x) throw ();
>
>
>
>
>extern double scalbln (double __x, long int __n) throw (); extern double __scalbln (double __x, long int __n) throw ();
>
>
>
>extern double nearbyint (double __x) throw (); extern double __nearbyint (double __x) throw ();
>
>
>
>extern double round (double __x) throw () __attribute__ ((__const__)); extern double __round (double __x) throw () __attribute__ ((__const__));
>
>
>
>extern double trunc (double __x) throw () __attribute__ ((__const__)); extern double __trunc (double __x) throw () __attribute__ ((__const__));
>
>
>
>
>extern double remquo (double __x, double __y, int *__quo) throw (); extern double __remquo (double __x, double __y, int *__quo) throw ();
>
>
>
>
>
>
>extern long int lrint (double __x) throw (); extern long int __lrint (double __x) throw ();
>extern long long int llrint (double __x) throw (); extern long long int __llrint (double __x) throw ();
>
>
>
>extern long int lround (double __x) throw (); extern long int __lround (double __x) throw ();
>extern long long int llround (double __x) throw (); extern long long int __llround (double __x) throw ();
>
>
>
>extern double fdim (double __x, double __y) throw (); extern double __fdim (double __x, double __y) throw ();
>
>
>extern double fmax (double __x, double __y) throw (); extern double __fmax (double __x, double __y) throw ();
>
>
>extern double fmin (double __x, double __y) throw (); extern double __fmin (double __x, double __y) throw ();
>
>
>
>extern int __fpclassify (double __value) throw ()
>     __attribute__ ((__const__));
>
>
>extern int __signbit (double __value) throw ()
>     __attribute__ ((__const__));
>
>
>
>extern double fma (double __x, double __y, double __z) throw (); extern double __fma (double __x, double __y, double __z) throw ();
># 365 "/usr/include/bits/mathcalls.h" 3 4
>extern double scalb (double __x, double __n) throw (); extern double __scalb (double __x, double __n) throw ();
># 72 "/usr/include/math.h" 2 3 4
># 94 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathcalls.h" 1 3 4
># 53 "/usr/include/bits/mathcalls.h" 3 4
>
>
>extern float acosf (float __x) throw (); extern float __acosf (float __x) throw ();
>
>extern float asinf (float __x) throw (); extern float __asinf (float __x) throw ();
>
>extern float atanf (float __x) throw (); extern float __atanf (float __x) throw ();
>
>extern float atan2f (float __y, float __x) throw (); extern float __atan2f (float __y, float __x) throw ();
>
>
>extern float cosf (float __x) throw (); extern float __cosf (float __x) throw ();
>
>extern float sinf (float __x) throw (); extern float __sinf (float __x) throw ();
>
>extern float tanf (float __x) throw (); extern float __tanf (float __x) throw ();
>
>
>
>
>extern float coshf (float __x) throw (); extern float __coshf (float __x) throw ();
>
>extern float sinhf (float __x) throw (); extern float __sinhf (float __x) throw ();
>
>extern float tanhf (float __x) throw (); extern float __tanhf (float __x) throw ();
>
>
>
>
>extern void
> sincosf
># 82 "/usr/include/bits/mathcalls.h" 3 4
> (float __x, float *__sinx, float *__cosx) throw (); extern void
> __sincosf
># 82 "/usr/include/bits/mathcalls.h" 3 4
> (float __x, float *__sinx, float *__cosx) throw ()
>                                                           ;
>
>
>
>
>
>extern float acoshf (float __x) throw (); extern float __acoshf (float __x) throw ();
>
>extern float asinhf (float __x) throw (); extern float __asinhf (float __x) throw ();
>
>extern float atanhf (float __x) throw (); extern float __atanhf (float __x) throw ();
>
>
>
>
>
>
>
>extern float expf (float __x) throw (); extern float __expf (float __x) throw ();
>
>
>extern float frexpf (float __x, int *__exponent) throw (); extern float __frexpf (float __x, int *__exponent) throw ();
>
>
>extern float ldexpf (float __x, int __exponent) throw (); extern float __ldexpf (float __x, int __exponent) throw ();
>
>
>extern float logf (float __x) throw (); extern float __logf (float __x) throw ();
>
>
>extern float log10f (float __x) throw (); extern float __log10f (float __x) throw ();
>
>
>extern float modff (float __x, float *__iptr) throw (); extern float __modff (float __x, float *__iptr) throw ()
>     __attribute__ ((__nonnull__ (2)));
>
>
>
>
>extern float exp10f (float __x) throw (); extern float __exp10f (float __x) throw ();
>
>extern float pow10f (float __x) throw (); extern float __pow10f (float __x) throw ();
>
>
>
>
>
>extern float expm1f (float __x) throw (); extern float __expm1f (float __x) throw ();
>
>
>extern float log1pf (float __x) throw (); extern float __log1pf (float __x) throw ();
>
>
>extern float logbf (float __x) throw (); extern float __logbf (float __x) throw ();
>
>
>
>
>
>
>extern float exp2f (float __x) throw (); extern float __exp2f (float __x) throw ();
>
>
>extern float log2f (float __x) throw (); extern float __log2f (float __x) throw ();
># 155 "/usr/include/bits/mathcalls.h" 3 4
>extern float powf (float __x, float __y) throw (); extern float __powf (float __x, float __y) throw ();
>
>
>extern float sqrtf (float __x) throw (); extern float __sqrtf (float __x) throw ();
>
>
>
>
>
>extern float hypotf (float __x, float __y) throw (); extern float __hypotf (float __x, float __y) throw ();
>
>
>
>
>
>
>extern float cbrtf (float __x) throw (); extern float __cbrtf (float __x) throw ();
># 180 "/usr/include/bits/mathcalls.h" 3 4
>extern float ceilf (float __x) throw () __attribute__ ((__const__)); extern float __ceilf (float __x) throw () __attribute__ ((__const__));
>
>
>extern float fabsf (float __x) throw () __attribute__ ((__const__)); extern float __fabsf (float __x) throw () __attribute__ ((__const__));
>
>
>extern float floorf (float __x) throw () __attribute__ ((__const__)); extern float __floorf (float __x) throw () __attribute__ ((__const__));
>
>
>extern float fmodf (float __x, float __y) throw (); extern float __fmodf (float __x, float __y) throw ();
>
>
>
>
>extern int __isinff (float __value) throw () __attribute__ ((__const__));
>
>
>extern int __finitef (float __value) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int isinff (float __value) throw () __attribute__ ((__const__));
>
>
>extern int finitef (float __value) throw () __attribute__ ((__const__));
>
>
>extern float dremf (float __x, float __y) throw (); extern float __dremf (float __x, float __y) throw ();
>
>
>
>extern float significandf (float __x) throw (); extern float __significandf (float __x) throw ();
>
>
>
>
>
>extern float copysignf (float __x, float __y) throw () __attribute__ ((__const__)); extern float __copysignf (float __x, float __y) throw () __attribute__ ((__const__));
>
>
>
>
>
>
>extern float nanf (__const char *__tagb) throw () __attribute__ ((__const__)); extern float __nanf (__const char *__tagb) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int __isnanf (float __value) throw () __attribute__ ((__const__));
>
>
>
>extern int isnanf (float __value) throw () __attribute__ ((__const__));
>
>
>extern float j0f (float) throw (); extern float __j0f (float) throw ();
>extern float j1f (float) throw (); extern float __j1f (float) throw ();
>extern float jnf (int, float) throw (); extern float __jnf (int, float) throw ();
>extern float y0f (float) throw (); extern float __y0f (float) throw ();
>extern float y1f (float) throw (); extern float __y1f (float) throw ();
>extern float ynf (int, float) throw (); extern float __ynf (int, float) throw ();
>
>
>
>
>
>
>extern float erff (float) throw (); extern float __erff (float) throw ();
>extern float erfcf (float) throw (); extern float __erfcf (float) throw ();
>extern float lgammaf (float) throw (); extern float __lgammaf (float) throw ();
>
>
>
>
>
>
>extern float tgammaf (float) throw (); extern float __tgammaf (float) throw ();
>
>
>
>
>
>extern float gammaf (float) throw (); extern float __gammaf (float) throw ();
>
>
>
>
>
>
>extern float lgammaf_r (float, int *__signgamp) throw (); extern float __lgammaf_r (float, int *__signgamp) throw ();
>
>
>
>
>
>
>
>extern float rintf (float __x) throw (); extern float __rintf (float __x) throw ();
>
>
>extern float nextafterf (float __x, float __y) throw () __attribute__ ((__const__)); extern float __nextafterf (float __x, float __y) throw () __attribute__ ((__const__));
>
>extern float nexttowardf (float __x, long double __y) throw () __attribute__ ((__const__)); extern float __nexttowardf (float __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>extern float remainderf (float __x, float __y) throw (); extern float __remainderf (float __x, float __y) throw ();
>
>
>
>extern float scalbnf (float __x, int __n) throw (); extern float __scalbnf (float __x, int __n) throw ();
>
>
>
>extern int ilogbf (float __x) throw (); extern int __ilogbf (float __x) throw ();
>
>
>
>
>extern float scalblnf (float __x, long int __n) throw (); extern float __scalblnf (float __x, long int __n) throw ();
>
>
>
>extern float nearbyintf (float __x) throw (); extern float __nearbyintf (float __x) throw ();
>
>
>
>extern float roundf (float __x) throw () __attribute__ ((__const__)); extern float __roundf (float __x) throw () __attribute__ ((__const__));
>
>
>
>extern float truncf (float __x) throw () __attribute__ ((__const__)); extern float __truncf (float __x) throw () __attribute__ ((__const__));
>
>
>
>
>extern float remquof (float __x, float __y, int *__quo) throw (); extern float __remquof (float __x, float __y, int *__quo) throw ();
>
>
>
>
>
>
>extern long int lrintf (float __x) throw (); extern long int __lrintf (float __x) throw ();
>extern long long int llrintf (float __x) throw (); extern long long int __llrintf (float __x) throw ();
>
>
>
>extern long int lroundf (float __x) throw (); extern long int __lroundf (float __x) throw ();
>extern long long int llroundf (float __x) throw (); extern long long int __llroundf (float __x) throw ();
>
>
>
>extern float fdimf (float __x, float __y) throw (); extern float __fdimf (float __x, float __y) throw ();
>
>
>extern float fmaxf (float __x, float __y) throw (); extern float __fmaxf (float __x, float __y) throw ();
>
>
>extern float fminf (float __x, float __y) throw (); extern float __fminf (float __x, float __y) throw ();
>
>
>
>extern int __fpclassifyf (float __value) throw ()
>     __attribute__ ((__const__));
>
>
>extern int __signbitf (float __value) throw ()
>     __attribute__ ((__const__));
>
>
>
>extern float fmaf (float __x, float __y, float __z) throw (); extern float __fmaf (float __x, float __y, float __z) throw ();
># 365 "/usr/include/bits/mathcalls.h" 3 4
>extern float scalbf (float __x, float __n) throw (); extern float __scalbf (float __x, float __n) throw ();
># 95 "/usr/include/math.h" 2 3 4
># 143 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathcalls.h" 1 3 4
># 53 "/usr/include/bits/mathcalls.h" 3 4
>
>
>extern long double acosl (long double __x) throw (); extern long double __acosl (long double __x) throw ();
>
>extern long double asinl (long double __x) throw (); extern long double __asinl (long double __x) throw ();
>
>extern long double atanl (long double __x) throw (); extern long double __atanl (long double __x) throw ();
>
>extern long double atan2l (long double __y, long double __x) throw (); extern long double __atan2l (long double __y, long double __x) throw ();
>
>
>extern long double cosl (long double __x) throw (); extern long double __cosl (long double __x) throw ();
>
>extern long double sinl (long double __x) throw (); extern long double __sinl (long double __x) throw ();
>
>extern long double tanl (long double __x) throw (); extern long double __tanl (long double __x) throw ();
>
>
>
>
>extern long double coshl (long double __x) throw (); extern long double __coshl (long double __x) throw ();
>
>extern long double sinhl (long double __x) throw (); extern long double __sinhl (long double __x) throw ();
>
>extern long double tanhl (long double __x) throw (); extern long double __tanhl (long double __x) throw ();
>
>
>
>
>extern void
> sincosl
># 82 "/usr/include/bits/mathcalls.h" 3 4
> (long double __x, long double *__sinx, long double *__cosx) throw (); extern void
> __sincosl
># 82 "/usr/include/bits/mathcalls.h" 3 4
> (long double __x, long double *__sinx, long double *__cosx) throw ()
>                                                           ;
>
>
>
>
>
>extern long double acoshl (long double __x) throw (); extern long double __acoshl (long double __x) throw ();
>
>extern long double asinhl (long double __x) throw (); extern long double __asinhl (long double __x) throw ();
>
>extern long double atanhl (long double __x) throw (); extern long double __atanhl (long double __x) throw ();
>
>
>
>
>
>
>
>extern long double expl (long double __x) throw (); extern long double __expl (long double __x) throw ();
>
>
>extern long double frexpl (long double __x, int *__exponent) throw (); extern long double __frexpl (long double __x, int *__exponent) throw ();
>
>
>extern long double ldexpl (long double __x, int __exponent) throw (); extern long double __ldexpl (long double __x, int __exponent) throw ();
>
>
>extern long double logl (long double __x) throw (); extern long double __logl (long double __x) throw ();
>
>
>extern long double log10l (long double __x) throw (); extern long double __log10l (long double __x) throw ();
>
>
>extern long double modfl (long double __x, long double *__iptr) throw (); extern long double __modfl (long double __x, long double *__iptr) throw ()
>     __attribute__ ((__nonnull__ (2)));
>
>
>
>
>extern long double exp10l (long double __x) throw (); extern long double __exp10l (long double __x) throw ();
>
>extern long double pow10l (long double __x) throw (); extern long double __pow10l (long double __x) throw ();
>
>
>
>
>
>extern long double expm1l (long double __x) throw (); extern long double __expm1l (long double __x) throw ();
>
>
>extern long double log1pl (long double __x) throw (); extern long double __log1pl (long double __x) throw ();
>
>
>extern long double logbl (long double __x) throw (); extern long double __logbl (long double __x) throw ();
>
>
>
>
>
>
>extern long double exp2l (long double __x) throw (); extern long double __exp2l (long double __x) throw ();
>
>
>extern long double log2l (long double __x) throw (); extern long double __log2l (long double __x) throw ();
># 155 "/usr/include/bits/mathcalls.h" 3 4
>extern long double powl (long double __x, long double __y) throw (); extern long double __powl (long double __x, long double __y) throw ();
>
>
>extern long double sqrtl (long double __x) throw (); extern long double __sqrtl (long double __x) throw ();
>
>
>
>
>
>extern long double hypotl (long double __x, long double __y) throw (); extern long double __hypotl (long double __x, long double __y) throw ();
>
>
>
>
>
>
>extern long double cbrtl (long double __x) throw (); extern long double __cbrtl (long double __x) throw ();
># 180 "/usr/include/bits/mathcalls.h" 3 4
>extern long double ceill (long double __x) throw () __attribute__ ((__const__)); extern long double __ceill (long double __x) throw () __attribute__ ((__const__));
>
>
>extern long double fabsl (long double __x) throw () __attribute__ ((__const__)); extern long double __fabsl (long double __x) throw () __attribute__ ((__const__));
>
>
>extern long double floorl (long double __x) throw () __attribute__ ((__const__)); extern long double __floorl (long double __x) throw () __attribute__ ((__const__));
>
>
>extern long double fmodl (long double __x, long double __y) throw (); extern long double __fmodl (long double __x, long double __y) throw ();
>
>
>
>
>extern int __isinfl (long double __value) throw () __attribute__ ((__const__));
>
>
>extern int __finitel (long double __value) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int isinfl (long double __value) throw () __attribute__ ((__const__));
>
>
>extern int finitel (long double __value) throw () __attribute__ ((__const__));
>
>
>extern long double dreml (long double __x, long double __y) throw (); extern long double __dreml (long double __x, long double __y) throw ();
>
>
>
>extern long double significandl (long double __x) throw (); extern long double __significandl (long double __x) throw ();
>
>
>
>
>
>extern long double copysignl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __copysignl (long double __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>
>
>
>extern long double nanl (__const char *__tagb) throw () __attribute__ ((__const__)); extern long double __nanl (__const char *__tagb) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int __isnanl (long double __value) throw () __attribute__ ((__const__));
>
>
>
>extern int isnanl (long double __value) throw () __attribute__ ((__const__));
>
>
>extern long double j0l (long double) throw (); extern long double __j0l (long double) throw ();
>extern long double j1l (long double) throw (); extern long double __j1l (long double) throw ();
>extern long double jnl (int, long double) throw (); extern long double __jnl (int, long double) throw ();
>extern long double y0l (long double) throw (); extern long double __y0l (long double) throw ();
>extern long double y1l (long double) throw (); extern long double __y1l (long double) throw ();
>extern long double ynl (int, long double) throw (); extern long double __ynl (int, long double) throw ();
>
>
>
>
>
>
>extern long double erfl (long double) throw (); extern long double __erfl (long double) throw ();
>extern long double erfcl (long double) throw (); extern long double __erfcl (long double) throw ();
>extern long double lgammal (long double) throw (); extern long double __lgammal (long double) throw ();
>
>
>
>
>
>
>extern long double tgammal (long double) throw (); extern long double __tgammal (long double) throw ();
>
>
>
>
>
>extern long double gammal (long double) throw (); extern long double __gammal (long double) throw ();
>
>
>
>
>
>
>extern long double lgammal_r (long double, int *__signgamp) throw (); extern long double __lgammal_r (long double, int *__signgamp) throw ();
>
>
>
>
>
>
>
>extern long double rintl (long double __x) throw (); extern long double __rintl (long double __x) throw ();
>
>
>extern long double nextafterl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __nextafterl (long double __x, long double __y) throw () __attribute__ ((__const__));
>
>extern long double nexttowardl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __nexttowardl (long double __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>extern long double remainderl (long double __x, long double __y) throw (); extern long double __remainderl (long double __x, long double __y) throw ();
>
>
>
>extern long double scalbnl (long double __x, int __n) throw (); extern long double __scalbnl (long double __x, int __n) throw ();
>
>
>
>extern int ilogbl (long double __x) throw (); extern int __ilogbl (long double __x) throw ();
>
>
>
>
>extern long double scalblnl (long double __x, long int __n) throw (); extern long double __scalblnl (long double __x, long int __n) throw ();
>
>
>
>extern long double nearbyintl (long double __x) throw (); extern long double __nearbyintl (long double __x) throw ();
>
>
>
>extern long double roundl (long double __x) throw () __attribute__ ((__const__)); extern long double __roundl (long double __x) throw () __attribute__ ((__const__));
>
>
>
>extern long double truncl (long double __x) throw () __attribute__ ((__const__)); extern long double __truncl (long double __x) throw () __attribute__ ((__const__));
>
>
>
>
>extern long double remquol (long double __x, long double __y, int *__quo) throw (); extern long double __remquol (long double __x, long double __y, int *__quo) throw ();
>
>
>
>
>
>
>extern long int lrintl (long double __x) throw (); extern long int __lrintl (long double __x) throw ();
>extern long long int llrintl (long double __x) throw (); extern long long int __llrintl (long double __x) throw ();
>
>
>
>extern long int lroundl (long double __x) throw (); extern long int __lroundl (long double __x) throw ();
>extern long long int llroundl (long double __x) throw (); extern long long int __llroundl (long double __x) throw ();
>
>
>
>extern long double fdiml (long double __x, long double __y) throw (); extern long double __fdiml (long double __x, long double __y) throw ();
>
>
>extern long double fmaxl (long double __x, long double __y) throw (); extern long double __fmaxl (long double __x, long double __y) throw ();
>
>
>extern long double fminl (long double __x, long double __y) throw (); extern long double __fminl (long double __x, long double __y) throw ();
>
>
>
>extern int __fpclassifyl (long double __value) throw ()
>     __attribute__ ((__const__));
>
>
>extern int __signbitl (long double __value) throw ()
>     __attribute__ ((__const__));
>
>
>
>extern long double fmal (long double __x, long double __y, long double __z) throw (); extern long double __fmal (long double __x, long double __y, long double __z) throw ();
># 365 "/usr/include/bits/mathcalls.h" 3 4
>extern long double scalbl (long double __x, long double __n) throw (); extern long double __scalbl (long double __x, long double __n) throw ();
># 144 "/usr/include/math.h" 2 3 4
># 159 "/usr/include/math.h" 3 4
>extern int signgam;
># 200 "/usr/include/math.h" 3 4
>enum
>  {
>    FP_NAN,
>
>    FP_INFINITE,
>
>    FP_ZERO,
>
>    FP_SUBNORMAL,
>
>    FP_NORMAL
>
>  };
># 293 "/usr/include/math.h" 3 4
>typedef enum
>{
>  _IEEE_ = -1,
>  _SVID_,
>  _XOPEN_,
>  _POSIX_,
>  _ISOC_
>} _LIB_VERSION_TYPE;
>
>
>
>
>extern _LIB_VERSION_TYPE _LIB_VERSION;
># 316 "/usr/include/math.h" 3 4
>struct __exception
>
>
>
>  {
>    int type;
>    char *name;
>    double arg1;
>    double arg2;
>    double retval;
>  };
>
>
>extern int matherr (struct __exception *__exc) throw ();
># 418 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathinline.h" 1 3 4
># 24 "/usr/include/bits/mathinline.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 25 "/usr/include/bits/mathinline.h" 2 3 4
># 36 "/usr/include/bits/mathinline.h" 3 4
>
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) __signbitf (float __x) throw ()
>{
>
>
>
>
>  int __m;
>  __asm ("pmovmskb %1, %0" : "=r" (__m) : "x" (__x));
>  return __m & 0x8;
>
>}
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) __signbit (double __x) throw ()
>{
>
>
>
>
>  int __m;
>  __asm ("pmovmskb %1, %0" : "=r" (__m) : "x" (__x));
>  return __m & 0x80;
>
>}
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) int
>__attribute__ ((__leaf__)) __signbitl (long double __x) throw ()
>{
>  __extension__ union { long double __l; int __i[3]; } __u = { __l: __x };
>  return (__u.__i[2] & 0x8000) != 0;
>}
># 82 "/usr/include/bits/mathinline.h" 3 4
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) long int
>__attribute__ ((__leaf__)) lrintf (float __x) throw ()
>{
>  long int __res;
>  __asm ("cvtss2si %1, %0" : "=r" (__res) : "xm" (__x));
>  return __res;
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) long int
>__attribute__ ((__leaf__)) lrint (double __x) throw ()
>{
>  long int __res;
>  __asm ("cvtsd2si %1, %0" : "=r" (__res) : "xm" (__x));
>  return __res;
>}
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) long long int
>__attribute__ ((__leaf__)) llrintf (float __x) throw ()
>{
>  long long int __res;
>  __asm ("cvtss2si %1, %0" : "=r" (__res) : "xm" (__x));
>  return __res;
>}
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) long long int
>__attribute__ ((__leaf__)) llrint (double __x) throw ()
>{
>  long long int __res;
>  __asm ("cvtsd2si %1, %0" : "=r" (__res) : "xm" (__x));
>  return __res;
>}
># 147 "/usr/include/bits/mathinline.h" 3 4
># 419 "/usr/include/math.h" 2 3 4
># 480 "/usr/include/math.h" 3 4
>}
># 34 "/usr/include/ffmpeg/libavutil/common.h" 2
>
>
>
># 1 "/usr/include/ffmpeg/libavutil/attributes.h" 1
># 38 "/usr/include/ffmpeg/libavutil/common.h" 2
># 1 "/usr/include/ffmpeg/libavutil/avconfig.h" 1
># 39 "/usr/include/ffmpeg/libavutil/common.h" 2
># 65 "/usr/include/ffmpeg/libavutil/common.h"
>extern const uint8_t ff_log2_tab[256];
>
>extern const uint8_t av_reverse[256];
>
>static __attribute__((always_inline)) inline __attribute__((const)) int av_log2_c(unsigned int v)
>{
>    int n = 0;
>    if (v & 0xffff0000) {
>        v >>= 16;
>        n += 16;
>    }
>    if (v & 0xff00) {
>        v >>= 8;
>        n += 8;
>    }
>    n += ff_log2_tab[v];
>
>    return n;
>}
>
>static __attribute__((always_inline)) inline __attribute__((const)) int av_log2_16bit_c(unsigned int v)
>{
>    int n = 0;
>    if (v & 0xff00) {
>        v >>= 8;
>        n += 8;
>    }
>    n += ff_log2_tab[v];
>
>    return n;
>}
>
>
>
>
>
>
>
># 1 "/usr/include/ffmpeg/libavutil/common.h" 1
># 104 "/usr/include/ffmpeg/libavutil/common.h" 2
># 112 "/usr/include/ffmpeg/libavutil/common.h"
>static __attribute__((always_inline)) inline __attribute__((const)) int av_clip_c(int a, int amin, int amax)
>{
>    if (a < amin) return amin;
>    else if (a > amax) return amax;
>    else return a;
>}
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) uint8_t av_clip_uint8_c(int a)
>{
>    if (a&(~0xFF)) return (-a)>>31;
>    else return a;
>}
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) int8_t av_clip_int8_c(int a)
>{
>    if ((a+0x80) & ~0xFF) return (a>>31) ^ 0x7F;
>    else return a;
>}
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) uint16_t av_clip_uint16_c(int a)
>{
>    if (a&(~0xFFFF)) return (-a)>>31;
>    else return a;
>}
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) int16_t av_clip_int16_c(int a)
>{
>    if ((a+0x8000) & ~0xFFFF) return (a>>31) ^ 0x7FFF;
>    else return a;
>}
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) int32_t av_clipl_int32_c(int64_t a)
>{
>    if ((a+0x80000000u) & ~0xFFFFFFFFUL) return (a>>63) ^ 0x7FFFFFFF;
>    else return a;
>}
>
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) unsigned av_clip_uintp2_c(int a, int p)
>{
>    if (a & ~((1<<p) - 1)) return -a >> 31 & ((1<<p) - 1);
>    else return a;
>}
># 193 "/usr/include/ffmpeg/libavutil/common.h"
>static __attribute__((always_inline)) inline __attribute__((const)) float av_clipf_c(float a, float amin, float amax)
>{
>    if (a < amin) return amin;
>    else if (a > amax) return amax;
>    else return a;
>}
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) int av_ceil_log2_c(int x)
>{
>    return av_log2_c((x - 1) << 1);
>}
>
>
>
>
>
>
>static __attribute__((always_inline)) inline __attribute__((const)) int av_popcount_c(uint32_t x)
>{
>    x -= (x >> 1) & 0x55555555;
>    x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
>    x = (x + (x >> 4)) & 0x0F0F0F0F;
>    x += x >> 8;
>    return (x + (x >> 16)) & 0x3F;
>}
># 339 "/usr/include/ffmpeg/libavutil/common.h"
># 1 "/usr/include/ffmpeg/libavutil/mem.h" 1
># 30 "/usr/include/ffmpeg/libavutil/mem.h"
># 1 "/usr/include/ffmpeg/libavutil/error.h" 1
># 27 "/usr/include/ffmpeg/libavutil/error.h"
># 1 "/usr/include/errno.h" 1 3 4
># 28 "/usr/include/ffmpeg/libavutil/error.h" 2
># 1 "/usr/include/ffmpeg/libavutil/avutil.h" 1
># 29 "/usr/include/ffmpeg/libavutil/error.h" 2
># 66 "/usr/include/ffmpeg/libavutil/error.h"
>int av_strerror(int errnum, char *errbuf, size_t errbuf_size);
># 31 "/usr/include/ffmpeg/libavutil/mem.h" 2
># 74 "/usr/include/ffmpeg/libavutil/mem.h"
>void *av_malloc(size_t size) __attribute__((__malloc__)) __attribute__((alloc_size(1)));
># 88 "/usr/include/ffmpeg/libavutil/mem.h"
>void *av_realloc(void *ptr, size_t size) __attribute__((alloc_size(2)));
># 98 "/usr/include/ffmpeg/libavutil/mem.h"
>void *av_realloc_f(void *ptr, size_t nelem, size_t elsize);
># 108 "/usr/include/ffmpeg/libavutil/mem.h"
>void av_free(void *ptr);
># 118 "/usr/include/ffmpeg/libavutil/mem.h"
>void *av_mallocz(size_t size) __attribute__((__malloc__)) __attribute__((alloc_size(1)));
># 130 "/usr/include/ffmpeg/libavutil/mem.h"
>void *av_calloc(size_t nmemb, size_t size) __attribute__((__malloc__));
>
>
>
>
>
>
>
>char *av_strdup(const char *s) __attribute__((__malloc__));
># 147 "/usr/include/ffmpeg/libavutil/mem.h"
>void av_freep(void *ptr);
># 156 "/usr/include/ffmpeg/libavutil/mem.h"
>void av_dynarray_add(void *tab_ptr, int *nb_ptr, void *elem);
>
>
>
>
>
>static inline int av_size_mult(size_t a, size_t b, size_t *r)
>{
>    size_t t = a * b;
>
>
>    if ((a | b) >= ((size_t)1 << (sizeof(size_t) * 4)) && a && t / a != b)
>        return (-(22));
>    *r = t;
>    return 0;
>}
># 340 "/usr/include/ffmpeg/libavutil/common.h" 2
># 127 "/usr/include/ffmpeg/libavutil/avutil.h" 2
>
># 1 "/usr/include/ffmpeg/libavutil/mathematics.h" 1
># 27 "/usr/include/ffmpeg/libavutil/mathematics.h"
># 1 "/usr/include/ffmpeg/libavutil/rational.h" 1
># 32 "/usr/include/ffmpeg/libavutil/rational.h"
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/include/limits.h" 1 3 4
># 33 "/usr/include/ffmpeg/libavutil/rational.h" 2
>
>
>
>
>
>typedef struct AVRational{
>    int num;
>    int den;
>} AVRational;
># 50 "/usr/include/ffmpeg/libavutil/rational.h"
>static inline int av_cmp_q(AVRational a, AVRational b){
>    const int64_t tmp= a.num * (int64_t)b.den - b.num * (int64_t)a.den;
>
>    if(tmp) return ((tmp ^ a.den ^ b.den)>>63)|1;
>    else if(b.den && a.den) return 0;
>    else if(a.num && b.num) return (a.num>>31) - (b.num>>31);
>    else return (-2147483647 - 1);
>}
>
>
>
>
>
>
>static inline double av_q2d(AVRational a){
>    return a.num / (double) a.den;
>}
># 78 "/usr/include/ffmpeg/libavutil/rational.h"
>int av_reduce(int *dst_num, int *dst_den, int64_t num, int64_t den, int64_t max);
>
>
>
>
>
>
>
>AVRational av_mul_q(AVRational b, AVRational c) __attribute__((const));
>
>
>
>
>
>
>
>AVRational av_div_q(AVRational b, AVRational c) __attribute__((const));
>
>
>
>
>
>
>
>AVRational av_add_q(AVRational b, AVRational c) __attribute__((const));
>
>
>
>
>
>
>
>AVRational av_sub_q(AVRational b, AVRational c) __attribute__((const));
># 120 "/usr/include/ffmpeg/libavutil/rational.h"
>AVRational av_d2q(double d, int max) __attribute__((const));
>
>
>
>
>
>int av_nearer_q(AVRational q, AVRational q1, AVRational q2);
>
>
>
>
>
>
>int av_find_nearest_q_idx(AVRational q, const AVRational* q_list);
># 28 "/usr/include/ffmpeg/libavutil/mathematics.h" 2
># 60 "/usr/include/ffmpeg/libavutil/mathematics.h"
>enum AVRounding {
>    AV_ROUND_ZERO = 0,
>    AV_ROUND_INF = 1,
>    AV_ROUND_DOWN = 2,
>    AV_ROUND_UP = 3,
>    AV_ROUND_NEAR_INF = 5,
>};
>
>
>
>
>
>
>int64_t __attribute__((const)) av_gcd(int64_t a, int64_t b);
>
>
>
>
>
>int64_t av_rescale(int64_t a, int64_t b, int64_t c) __attribute__((const));
>
>
>
>
>
>int64_t av_rescale_rnd(int64_t a, int64_t b, int64_t c, enum AVRounding) __attribute__((const));
>
>
>
>
>int64_t av_rescale_q(int64_t a, AVRational bq, AVRational cq) __attribute__((const));
>
>
>
>
>
>
>
>int av_compare_ts(int64_t ts_a, AVRational tb_a, int64_t ts_b, AVRational tb_b);
># 110 "/usr/include/ffmpeg/libavutil/mathematics.h"
>int64_t av_compare_mod(uint64_t a, uint64_t b, uint64_t mod);
># 129 "/usr/include/ffmpeg/libavutil/avutil.h" 2
>
># 1 "/usr/include/ffmpeg/libavutil/intfloat_readwrite.h" 1
># 28 "/usr/include/ffmpeg/libavutil/intfloat_readwrite.h"
>typedef struct AVExtFloat {
>    uint8_t exponent[2];
>    uint8_t mantissa[8];
>} AVExtFloat;
>
>double av_int2dbl(int64_t v) __attribute__((const));
>float av_int2flt(int32_t v) __attribute__((const));
>double av_ext2dbl(const AVExtFloat ext) __attribute__((const));
>int64_t av_dbl2int(double d) __attribute__((const));
>int32_t av_flt2int(float d) __attribute__((const));
>AVExtFloat av_dbl2ext(double d) __attribute__((const));
># 131 "/usr/include/ffmpeg/libavutil/avutil.h" 2
># 1 "/usr/include/ffmpeg/libavutil/log.h" 1
># 32 "/usr/include/ffmpeg/libavutil/log.h"
>typedef struct {
>
>
>
>
>    const char* class_name;
>
>
>
>
>
>    const char* (*item_name)(void* ctx);
>
>
>
>
>
>
>    const struct AVOption *option;
>
>
>
>
>
>
>
>    int version;
>
>
>
>
>
>    int log_level_offset_offset;
>
>
>
>
>
>
>
>    int parent_log_context_offset;
>
>
>
>
>
>    const struct AVOption* (*opt_find)(void *obj, const char *name, const char *unit,
>                                       int opt_flags, int search_flags);
>} AVClass;
># 133 "/usr/include/ffmpeg/libavutil/log.h"
>void av_log(void *avcl, int level, const char *fmt, ...) __attribute__ ((__format__ (__printf__, 3, 4)));
>
>
>
>
>void av_vlog(void *avcl, int level, const char *fmt, va_list);
>int av_log_get_level(void);
>void av_log_set_level(int);
>void av_log_set_callback(void (*)(void*, int, const char*, va_list));
>void av_log_default_callback(void* ptr, int level, const char* fmt, va_list vl);
>const char* av_default_item_name(void* ctx);
># 165 "/usr/include/ffmpeg/libavutil/log.h"
>void av_log_set_flags(int arg);
># 132 "/usr/include/ffmpeg/libavutil/avutil.h" 2
># 1 "/usr/include/ffmpeg/libavutil/pixfmt.h" 1
># 60 "/usr/include/ffmpeg/libavutil/pixfmt.h"
>enum PixelFormat {
>    PIX_FMT_NONE= -1,
>    PIX_FMT_YUV420P,
>    PIX_FMT_YUYV422,
>    PIX_FMT_RGB24,
>    PIX_FMT_BGR24,
>    PIX_FMT_YUV422P,
>    PIX_FMT_YUV444P,
>    PIX_FMT_YUV410P,
>    PIX_FMT_YUV411P,
>    PIX_FMT_GRAY8,
>    PIX_FMT_MONOWHITE,
>    PIX_FMT_MONOBLACK,
>    PIX_FMT_PAL8,
>    PIX_FMT_YUVJ420P,
>    PIX_FMT_YUVJ422P,
>    PIX_FMT_YUVJ444P,
>    PIX_FMT_XVMC_MPEG2_MC,
>    PIX_FMT_XVMC_MPEG2_IDCT,
>    PIX_FMT_UYVY422,
>    PIX_FMT_UYYVYY411,
>    PIX_FMT_BGR8,
>    PIX_FMT_BGR4,
>    PIX_FMT_BGR4_BYTE,
>    PIX_FMT_RGB8,
>    PIX_FMT_RGB4,
>    PIX_FMT_RGB4_BYTE,
>    PIX_FMT_NV12,
>    PIX_FMT_NV21,
>
>    PIX_FMT_ARGB,
>    PIX_FMT_RGBA,
>    PIX_FMT_ABGR,
>    PIX_FMT_BGRA,
>
>    PIX_FMT_GRAY16BE,
>    PIX_FMT_GRAY16LE,
>    PIX_FMT_YUV440P,
>    PIX_FMT_YUVJ440P,
>    PIX_FMT_YUVA420P,
>    PIX_FMT_VDPAU_H264,
>    PIX_FMT_VDPAU_MPEG1,
>    PIX_FMT_VDPAU_MPEG2,
>    PIX_FMT_VDPAU_WMV3,
>    PIX_FMT_VDPAU_VC1,
>    PIX_FMT_RGB48BE,
>    PIX_FMT_RGB48LE,
>
>    PIX_FMT_RGB565BE,
>    PIX_FMT_RGB565LE,
>    PIX_FMT_RGB555BE,
>    PIX_FMT_RGB555LE,
>
>    PIX_FMT_BGR565BE,
>    PIX_FMT_BGR565LE,
>    PIX_FMT_BGR555BE,
>    PIX_FMT_BGR555LE,
>
>    PIX_FMT_VAAPI_MOCO,
>    PIX_FMT_VAAPI_IDCT,
>    PIX_FMT_VAAPI_VLD,
>
>    PIX_FMT_YUV420P16LE,
>    PIX_FMT_YUV420P16BE,
>    PIX_FMT_YUV422P16LE,
>    PIX_FMT_YUV422P16BE,
>    PIX_FMT_YUV444P16LE,
>    PIX_FMT_YUV444P16BE,
>    PIX_FMT_VDPAU_MPEG4,
>    PIX_FMT_DXVA2_VLD,
>
>    PIX_FMT_RGB444LE,
>    PIX_FMT_RGB444BE,
>    PIX_FMT_BGR444LE,
>    PIX_FMT_BGR444BE,
>    PIX_FMT_GRAY8A,
>    PIX_FMT_BGR48BE,
>    PIX_FMT_BGR48LE,
>
>
>
>
>    PIX_FMT_YUV420P9BE,
>    PIX_FMT_YUV420P9LE,
>    PIX_FMT_YUV420P10BE,
>    PIX_FMT_YUV420P10LE,
>    PIX_FMT_YUV422P10BE,
>    PIX_FMT_YUV422P10LE,
>    PIX_FMT_YUV444P9BE,
>    PIX_FMT_YUV444P9LE,
>    PIX_FMT_YUV444P10BE,
>    PIX_FMT_YUV444P10LE,
>
>    PIX_FMT_NB,
>};
># 133 "/usr/include/ffmpeg/libavutil/avutil.h" 2
># 23 "/usr/include/ffmpeg/libavutil/samplefmt.h" 2
>
>
>
>
>enum AVSampleFormat {
>    AV_SAMPLE_FMT_NONE = -1,
>    AV_SAMPLE_FMT_U8,
>    AV_SAMPLE_FMT_S16,
>    AV_SAMPLE_FMT_S32,
>    AV_SAMPLE_FMT_FLT,
>    AV_SAMPLE_FMT_DBL,
>    AV_SAMPLE_FMT_NB
>};
>
>
>
>
>
>const char *av_get_sample_fmt_name(enum AVSampleFormat sample_fmt);
>
>
>
>
>
>enum AVSampleFormat av_get_sample_fmt(const char *name);
># 61 "/usr/include/ffmpeg/libavutil/samplefmt.h"
>char *av_get_sample_fmt_string(char *buf, int buf_size, enum AVSampleFormat sample_fmt);
>
>
>
>
>
>__attribute__((deprecated))
>int av_get_bits_per_sample_fmt(enum AVSampleFormat sample_fmt);
># 78 "/usr/include/ffmpeg/libavutil/samplefmt.h"
>int av_get_bytes_per_sample(enum AVSampleFormat sample_fmt);
># 102 "/usr/include/ffmpeg/libavutil/samplefmt.h"
>int av_samples_fill_arrays(uint8_t *pointers[8], int linesizes[8],
>                           uint8_t *buf, int nb_channels, int nb_samples,
>                           enum AVSampleFormat sample_fmt, int planar, int align);
># 120 "/usr/include/ffmpeg/libavutil/samplefmt.h"
>int av_samples_alloc(uint8_t *pointers[8], int linesizes[8],
>                     int nb_channels, int nb_samples,
>                     enum AVSampleFormat sample_fmt, int planar,
>                     int align);
># 31 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
># 1 "/usr/include/ffmpeg/libavutil/avutil.h" 1
># 32 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
># 1 "/usr/include/ffmpeg/libavutil/cpu.h" 1
># 47 "/usr/include/ffmpeg/libavutil/cpu.h"
>int av_get_cpu_flags(void);
>
>
>
>
>
>void av_force_cpu_flags(int flags);
>
>
>
>int ff_get_cpu_flags_arm(void);
>int ff_get_cpu_flags_ppc(void);
>int ff_get_cpu_flags_x86(void);
># 33 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
># 1 "/usr/include/ffmpeg/libavutil/dict.h" 1
># 36 "/usr/include/ffmpeg/libavutil/dict.h"
>typedef struct {
>    char *key;
>    char *value;
>} AVDictionaryEntry;
>
>typedef struct AVDictionary AVDictionary;
># 51 "/usr/include/ffmpeg/libavutil/dict.h"
>AVDictionaryEntry *
>av_dict_get(AVDictionary *m, const char *key, const AVDictionaryEntry *prev, int flags);
># 64 "/usr/include/ffmpeg/libavutil/dict.h"
>int av_dict_set(AVDictionary **pm, const char *key, const char *value, int flags);
># 74 "/usr/include/ffmpeg/libavutil/dict.h"
>void av_dict_copy(AVDictionary **dst, AVDictionary *src, int flags);
>
>
>
>
>void av_dict_free(AVDictionary **m);
># 34 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
>
># 1 "/usr/include/ffmpeg/libavcodec/version.h" 1
># 36 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
># 49 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>enum CodecID {
>    CODEC_ID_NONE,
>
>
>    CODEC_ID_MPEG1VIDEO,
>    CODEC_ID_MPEG2VIDEO,
>    CODEC_ID_MPEG2VIDEO_XVMC,
>    CODEC_ID_H261,
>    CODEC_ID_H263,
>    CODEC_ID_RV10,
>    CODEC_ID_RV20,
>    CODEC_ID_MJPEG,
>    CODEC_ID_MJPEGB,
>    CODEC_ID_LJPEG,
>    CODEC_ID_SP5X,
>    CODEC_ID_JPEGLS,
>    CODEC_ID_MPEG4,
>    CODEC_ID_RAWVIDEO,
>    CODEC_ID_MSMPEG4V1,
>    CODEC_ID_MSMPEG4V2,
>    CODEC_ID_MSMPEG4V3,
>    CODEC_ID_WMV1,
>    CODEC_ID_WMV2,
>    CODEC_ID_H263P,
>    CODEC_ID_H263I,
>    CODEC_ID_FLV1,
>    CODEC_ID_SVQ1,
>    CODEC_ID_SVQ3,
>    CODEC_ID_DVVIDEO,
>    CODEC_ID_HUFFYUV,
>    CODEC_ID_CYUV,
>    CODEC_ID_H264,
>    CODEC_ID_INDEO3,
>    CODEC_ID_VP3,
>    CODEC_ID_THEORA,
>    CODEC_ID_ASV1,
>    CODEC_ID_ASV2,
>    CODEC_ID_FFV1,
>    CODEC_ID_4XM,
>    CODEC_ID_VCR1,
>    CODEC_ID_CLJR,
>    CODEC_ID_MDEC,
>    CODEC_ID_ROQ,
>    CODEC_ID_INTERPLAY_VIDEO,
>    CODEC_ID_XAN_WC3,
>    CODEC_ID_XAN_WC4,
>    CODEC_ID_RPZA,
>    CODEC_ID_CINEPAK,
>    CODEC_ID_WS_VQA,
>    CODEC_ID_MSRLE,
>    CODEC_ID_MSVIDEO1,
>    CODEC_ID_IDCIN,
>    CODEC_ID_8BPS,
>    CODEC_ID_SMC,
>    CODEC_ID_FLIC,
>    CODEC_ID_TRUEMOTION1,
>    CODEC_ID_VMDVIDEO,
>    CODEC_ID_MSZH,
>    CODEC_ID_ZLIB,
>    CODEC_ID_QTRLE,
>    CODEC_ID_SNOW,
>    CODEC_ID_TSCC,
>    CODEC_ID_ULTI,
>    CODEC_ID_QDRAW,
>    CODEC_ID_VIXL,
>    CODEC_ID_QPEG,
>    CODEC_ID_PNG,
>    CODEC_ID_PPM,
>    CODEC_ID_PBM,
>    CODEC_ID_PGM,
>    CODEC_ID_PGMYUV,
>    CODEC_ID_PAM,
>    CODEC_ID_FFVHUFF,
>    CODEC_ID_RV30,
>    CODEC_ID_RV40,
>    CODEC_ID_VC1,
>    CODEC_ID_WMV3,
>    CODEC_ID_LOCO,
>    CODEC_ID_WNV1,
>    CODEC_ID_AASC,
>    CODEC_ID_INDEO2,
>    CODEC_ID_FRAPS,
>    CODEC_ID_TRUEMOTION2,
>    CODEC_ID_BMP,
>    CODEC_ID_CSCD,
>    CODEC_ID_MMVIDEO,
>    CODEC_ID_ZMBV,
>    CODEC_ID_AVS,
>    CODEC_ID_SMACKVIDEO,
>    CODEC_ID_NUV,
>    CODEC_ID_KMVC,
>    CODEC_ID_FLASHSV,
>    CODEC_ID_CAVS,
>    CODEC_ID_JPEG2000,
>    CODEC_ID_VMNC,
>    CODEC_ID_VP5,
>    CODEC_ID_VP6,
>    CODEC_ID_VP6F,
>    CODEC_ID_TARGA,
>    CODEC_ID_DSICINVIDEO,
>    CODEC_ID_TIERTEXSEQVIDEO,
>    CODEC_ID_TIFF,
>    CODEC_ID_GIF,
>    CODEC_ID_FFH264,
>    CODEC_ID_DXA,
>    CODEC_ID_DNXHD,
>    CODEC_ID_THP,
>    CODEC_ID_SGI,
>    CODEC_ID_C93,
>    CODEC_ID_BETHSOFTVID,
>    CODEC_ID_PTX,
>    CODEC_ID_TXD,
>    CODEC_ID_VP6A,
>    CODEC_ID_AMV,
>    CODEC_ID_VB,
>    CODEC_ID_PCX,
>    CODEC_ID_SUNRAST,
>    CODEC_ID_INDEO4,
>    CODEC_ID_INDEO5,
>    CODEC_ID_MIMIC,
>    CODEC_ID_RL2,
>    CODEC_ID_8SVX_EXP,
>    CODEC_ID_8SVX_FIB,
>    CODEC_ID_ESCAPE124,
>    CODEC_ID_DIRAC,
>    CODEC_ID_BFI,
>    CODEC_ID_CMV,
>    CODEC_ID_MOTIONPIXELS,
>    CODEC_ID_TGV,
>    CODEC_ID_TGQ,
>    CODEC_ID_TQI,
>    CODEC_ID_AURA,
>    CODEC_ID_AURA2,
>    CODEC_ID_V210X,
>    CODEC_ID_TMV,
>    CODEC_ID_V210,
>    CODEC_ID_DPX,
>    CODEC_ID_MAD,
>    CODEC_ID_FRWU,
>    CODEC_ID_FLASHSV2,
>    CODEC_ID_CDGRAPHICS,
>    CODEC_ID_R210,
>    CODEC_ID_ANM,
>    CODEC_ID_BINKVIDEO,
>    CODEC_ID_IFF_ILBM,
>    CODEC_ID_IFF_BYTERUN1,
>    CODEC_ID_KGV1,
>    CODEC_ID_YOP,
>    CODEC_ID_VP8,
>    CODEC_ID_PICTOR,
>    CODEC_ID_ANSI,
>    CODEC_ID_A64_MULTI,
>    CODEC_ID_A64_MULTI5,
>    CODEC_ID_R10K,
>    CODEC_ID_MXPEG,
>    CODEC_ID_LAGARITH,
>    CODEC_ID_PRORES,
>    CODEC_ID_JV,
>    CODEC_ID_DFA,
>    CODEC_ID_8SVX_RAW,
>
>
>    CODEC_ID_PCM_S16LE= 0x10000,
>    CODEC_ID_PCM_S16BE,
>    CODEC_ID_PCM_U16LE,
>    CODEC_ID_PCM_U16BE,
>    CODEC_ID_PCM_S8,
>    CODEC_ID_PCM_U8,
>    CODEC_ID_PCM_MULAW,
>    CODEC_ID_PCM_ALAW,
>    CODEC_ID_PCM_S32LE,
>    CODEC_ID_PCM_S32BE,
>    CODEC_ID_PCM_U32LE,
>    CODEC_ID_PCM_U32BE,
>    CODEC_ID_PCM_S24LE,
>    CODEC_ID_PCM_S24BE,
>    CODEC_ID_PCM_U24LE,
>    CODEC_ID_PCM_U24BE,
>    CODEC_ID_PCM_S24DAUD,
>    CODEC_ID_PCM_ZORK,
>    CODEC_ID_PCM_S16LE_PLANAR,
>    CODEC_ID_PCM_DVD,
>    CODEC_ID_PCM_F32BE,
>    CODEC_ID_PCM_F32LE,
>    CODEC_ID_PCM_F64BE,
>    CODEC_ID_PCM_F64LE,
>    CODEC_ID_PCM_BLURAY,
>    CODEC_ID_PCM_LXF,
>    CODEC_ID_S302M,
>
>
>    CODEC_ID_ADPCM_IMA_QT= 0x11000,
>    CODEC_ID_ADPCM_IMA_WAV,
>    CODEC_ID_ADPCM_IMA_DK3,
>    CODEC_ID_ADPCM_IMA_DK4,
>    CODEC_ID_ADPCM_IMA_WS,
>    CODEC_ID_ADPCM_IMA_SMJPEG,
>    CODEC_ID_ADPCM_MS,
>    CODEC_ID_ADPCM_4XM,
>    CODEC_ID_ADPCM_XA,
>    CODEC_ID_ADPCM_ADX,
>    CODEC_ID_ADPCM_EA,
>    CODEC_ID_ADPCM_G726,
>    CODEC_ID_ADPCM_CT,
>    CODEC_ID_ADPCM_SWF,
>    CODEC_ID_ADPCM_YAMAHA,
>    CODEC_ID_ADPCM_SBPRO_4,
>    CODEC_ID_ADPCM_SBPRO_3,
>    CODEC_ID_ADPCM_SBPRO_2,
>    CODEC_ID_ADPCM_THP,
>    CODEC_ID_ADPCM_IMA_AMV,
>    CODEC_ID_ADPCM_EA_R1,
>    CODEC_ID_ADPCM_EA_R3,
>    CODEC_ID_ADPCM_EA_R2,
>    CODEC_ID_ADPCM_IMA_EA_SEAD,
>    CODEC_ID_ADPCM_IMA_EA_EACS,
>    CODEC_ID_ADPCM_EA_XAS,
>    CODEC_ID_ADPCM_EA_MAXIS_XA,
>    CODEC_ID_ADPCM_IMA_ISS,
>    CODEC_ID_ADPCM_G722,
>
>
>    CODEC_ID_AMR_NB= 0x12000,
>    CODEC_ID_AMR_WB,
>
>
>    CODEC_ID_RA_144= 0x13000,
>    CODEC_ID_RA_288,
>
>
>    CODEC_ID_ROQ_DPCM= 0x14000,
>    CODEC_ID_INTERPLAY_DPCM,
>    CODEC_ID_XAN_DPCM,
>    CODEC_ID_SOL_DPCM,
>
>
>    CODEC_ID_MP2= 0x15000,
>    CODEC_ID_MP3,
>    CODEC_ID_AAC,
>    CODEC_ID_AC3,
>    CODEC_ID_DTS,
>    CODEC_ID_VORBIS,
>    CODEC_ID_DVAUDIO,
>    CODEC_ID_WMAV1,
>    CODEC_ID_WMAV2,
>    CODEC_ID_MACE3,
>    CODEC_ID_MACE6,
>    CODEC_ID_VMDAUDIO,
>    CODEC_ID_SONIC,
>    CODEC_ID_SONIC_LS,
>    CODEC_ID_FLAC,
>    CODEC_ID_MP3ADU,
>    CODEC_ID_MP3ON4,
>    CODEC_ID_SHORTEN,
>    CODEC_ID_ALAC,
>    CODEC_ID_WESTWOOD_SND1,
>    CODEC_ID_GSM,
>    CODEC_ID_QDM2,
>    CODEC_ID_COOK,
>    CODEC_ID_TRUESPEECH,
>    CODEC_ID_TTA,
>    CODEC_ID_SMACKAUDIO,
>    CODEC_ID_QCELP,
>    CODEC_ID_WAVPACK,
>    CODEC_ID_DSICINAUDIO,
>    CODEC_ID_IMC,
>    CODEC_ID_MUSEPACK7,
>    CODEC_ID_MLP,
>    CODEC_ID_GSM_MS,
>    CODEC_ID_ATRAC3,
>    CODEC_ID_VOXWARE,
>    CODEC_ID_APE,
>    CODEC_ID_NELLYMOSER,
>    CODEC_ID_MUSEPACK8,
>    CODEC_ID_SPEEX,
>    CODEC_ID_WMAVOICE,
>    CODEC_ID_WMAPRO,
>    CODEC_ID_WMALOSSLESS,
>    CODEC_ID_ATRAC3P,
>    CODEC_ID_EAC3,
>    CODEC_ID_SIPR,
>    CODEC_ID_MP1,
>    CODEC_ID_TWINVQ,
>    CODEC_ID_TRUEHD,
>    CODEC_ID_MP4ALS,
>    CODEC_ID_ATRAC1,
>    CODEC_ID_BINKAUDIO_RDFT,
>    CODEC_ID_BINKAUDIO_DCT,
>    CODEC_ID_AAC_LATM,
>    CODEC_ID_QDMC,
>    CODEC_ID_CELT,
>
>
>    CODEC_ID_DVD_SUBTITLE= 0x17000,
>    CODEC_ID_DVB_SUBTITLE,
>    CODEC_ID_TEXT,
>    CODEC_ID_XSUB,
>    CODEC_ID_SSA,
>    CODEC_ID_MOV_TEXT,
>    CODEC_ID_HDMV_PGS_SUBTITLE,
>    CODEC_ID_DVB_TELETEXT,
>    CODEC_ID_SRT,
>    CODEC_ID_MICRODVD,
>
>
>    CODEC_ID_TTF= 0x18000,
>
>    CODEC_ID_PROBE= 0x19000,
>
>    CODEC_ID_MPEG2TS= 0x20000,
>
>    CODEC_ID_FFMETADATA=0x21000,
>};
># 376 "/usr/include/ffmpeg/libavcodec/avcodec.h"
># 1 "/usr/include/ffmpeg/libavutil/audioconvert.h" 1
># 79 "/usr/include/ffmpeg/libavutil/audioconvert.h"
>int64_t av_get_channel_layout(const char *name);
># 88 "/usr/include/ffmpeg/libavutil/audioconvert.h"
>void av_get_channel_layout_string(char *buf, int buf_size, int nb_channels, int64_t channel_layout);
>
>
>
>
>int av_get_channel_layout_nb_channels(int64_t channel_layout);
># 377 "/usr/include/ffmpeg/libavcodec/avcodec.h" 2
># 445 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>enum Motion_Est_ID {
>    ME_ZERO = 1,
>    ME_FULL,
>    ME_LOG,
>    ME_PHODS,
>    ME_EPZS,
>    ME_X1,
>    ME_HEX,
>    ME_UMH,
>    ME_ITER,
>    ME_TESA,
>};
>
>enum AVDiscard{
>
>
>    AVDISCARD_NONE =-16,
>    AVDISCARD_DEFAULT= 0,
>    AVDISCARD_NONREF = 8,
>    AVDISCARD_BIDIR = 16,
>    AVDISCARD_NONKEY = 32,
>    AVDISCARD_ALL = 48,
>};
>
>enum AVColorPrimaries{
>    AVCOL_PRI_BT709 =1,
>    AVCOL_PRI_UNSPECIFIED=2,
>    AVCOL_PRI_BT470M =4,
>    AVCOL_PRI_BT470BG =5,
>    AVCOL_PRI_SMPTE170M =6,
>    AVCOL_PRI_SMPTE240M =7,
>    AVCOL_PRI_FILM =8,
>    AVCOL_PRI_NB ,
>};
>
>enum AVColorTransferCharacteristic{
>    AVCOL_TRC_BT709 =1,
>    AVCOL_TRC_UNSPECIFIED=2,
>    AVCOL_TRC_GAMMA22 =4,
>    AVCOL_TRC_GAMMA28 =5,
>    AVCOL_TRC_NB ,
>};
>
>enum AVColorSpace{
>    AVCOL_SPC_RGB =0,
>    AVCOL_SPC_BT709 =1,
>    AVCOL_SPC_UNSPECIFIED=2,
>    AVCOL_SPC_FCC =4,
>    AVCOL_SPC_BT470BG =5,
>    AVCOL_SPC_SMPTE170M =6,
>    AVCOL_SPC_SMPTE240M =7,
>    AVCOL_SPC_NB ,
>};
>
>enum AVColorRange{
>    AVCOL_RANGE_UNSPECIFIED=0,
>    AVCOL_RANGE_MPEG =1,
>    AVCOL_RANGE_JPEG =2,
>    AVCOL_RANGE_NB ,
>};
>
>
>
>
>
>
>enum AVChromaLocation{
>    AVCHROMA_LOC_UNSPECIFIED=0,
>    AVCHROMA_LOC_LEFT =1,
>    AVCHROMA_LOC_CENTER =2,
>    AVCHROMA_LOC_TOPLEFT =3,
>    AVCHROMA_LOC_TOP =4,
>    AVCHROMA_LOC_BOTTOMLEFT =5,
>    AVCHROMA_LOC_BOTTOM =6,
>    AVCHROMA_LOC_NB ,
>};
>
>
>
>
>
>__attribute__((deprecated)) enum AVLPCType {
>    AV_LPC_TYPE_DEFAULT = -1,
>    AV_LPC_TYPE_NONE = 0,
>    AV_LPC_TYPE_FIXED = 1,
>    AV_LPC_TYPE_LEVINSON = 2,
>    AV_LPC_TYPE_CHOLESKY = 3,
>    AV_LPC_TYPE_NB ,
>};
>
>
>enum AVAudioServiceType {
>    AV_AUDIO_SERVICE_TYPE_MAIN = 0,
>    AV_AUDIO_SERVICE_TYPE_EFFECTS = 1,
>    AV_AUDIO_SERVICE_TYPE_VISUALLY_IMPAIRED = 2,
>    AV_AUDIO_SERVICE_TYPE_HEARING_IMPAIRED = 3,
>    AV_AUDIO_SERVICE_TYPE_DIALOGUE = 4,
>    AV_AUDIO_SERVICE_TYPE_COMMENTARY = 5,
>    AV_AUDIO_SERVICE_TYPE_EMERGENCY = 6,
>    AV_AUDIO_SERVICE_TYPE_VOICE_OVER = 7,
>    AV_AUDIO_SERVICE_TYPE_KARAOKE = 8,
>    AV_AUDIO_SERVICE_TYPE_NB ,
>};
>
>typedef struct RcOverride{
>    int start_frame;
>    int end_frame;
>    int qscale;
>    float quality_factor;
>} RcOverride;
># 726 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>typedef struct AVPanScan{
>
>
>
>
>
>    int id;
>
>
>
>
>
>
>    int width;
>    int height;
>
>
>
>
>
>
>    int16_t position[3][2];
>}AVPanScan;
># 1074 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>enum AVPacketSideDataType {
>    AV_PKT_DATA_PALETTE,
>};
>
>typedef struct AVPacket {
># 1088 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int64_t pts;
>
>
>
>
>
>    int64_t dts;
>    uint8_t *data;
>    int size;
>    int stream_index;
>    int flags;
>
>
>
>
>    struct {
>        uint8_t *data;
>        int size;
>        enum AVPacketSideDataType type;
>    } *side_data;
>    int side_data_elems;
>
>
>
>
>
>    int duration;
>    void (*destruct)(struct AVPacket *);
>    void *priv;
>    int64_t pos;
># 1136 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int64_t convergence_duration;
>} AVPacket;
># 1149 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>typedef struct AVFrame {
>    uint8_t *data[4]; int linesize[4]; uint8_t *base[4]; int key_frame; enum AVPictureType pict_type; int64_t pts; int coded_picture_number; int display_picture_number; int quality; int age; int reference; int8_t *qscale_table; int qstride; uint8_t *mbskip_table; int16_t (*motion_val[2])[2]; uint32_t *mb_type; uint8_t motion_subsample_log2; void *opaque; uint64_t error[4]; int type; int repeat_pict; int qscale_type; int interlaced_frame; int top_field_first; AVPanScan *pan_scan; int palette_has_changed; int buffer_hints; short *dct_coeff; int8_t *ref_index[2]; int64_t reordered_opaque; void *hwaccel_picture_private; int64_t pkt_pts; int64_t pkt_dts; struct AVCodecContext *owner; void *thread_opaque; int64_t best_effort_timestamp; int64_t pkt_pos; AVRational sample_aspect_ratio; int width, height; int format;
>} AVFrame;
># 1160 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>typedef struct AVCodecContext {
>
>
>
>
>    const AVClass *av_class;
>
>
>
>
>
>    int bit_rate;
>
>
>
>
>
>
>
>    int bit_rate_tolerance;
>
>
>
>
>
>
>    int flags;
># 1196 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int sub_id;
># 1205 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int me_method;
># 1218 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    uint8_t *extradata;
>    int extradata_size;
># 1229 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    AVRational time_base;
># 1239 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int width, height;
># 1248 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int gop_size;
># 1257 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    enum PixelFormat pix_fmt;
># 1282 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    void (*draw_horiz_band)(struct AVCodecContext *s,
>                            const AVFrame *src, int offset[4],
>                            int y, int type, int height);
>
>
>    int sample_rate;
>    int channels;
>
>
>
>
>
>
>    enum AVSampleFormat sample_fmt;
>
>
>
>
>
>    int frame_size;
>    int frame_number;
>
>
>
>
>
>
>
>    int delay;
>
>
>    float qcompress;
>    float qblur;
>
>
>
>
>
>
>    int qmin;
>
>
>
>
>
>
>    int qmax;
>
>
>
>
>
>
>    int max_qdiff;
>
>
>
>
>
>
>
>    int max_b_frames;
># 1352 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    float b_quant_factor;
>
>
>    int rc_strategy;
>
>
>    int b_frame_strategy;
>
>    struct AVCodec *codec;
>
>    void *priv_data;
>
>    int rtp_payload_size;
># 1378 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    void (*rtp_callback)(struct AVCodecContext *avctx, void *data, int size, int mb_nb);
>
>
>    int mv_bits;
>    int header_bits;
>    int i_tex_bits;
>    int p_tex_bits;
>    int i_count;
>    int p_count;
>    int skip_count;
>    int misc_bits;
>
>
>
>
>
>
>    int frame_bits;
>
>
>
>
>
>
>    void *opaque;
>
>    char codec_name[32];
>    enum AVMediaType codec_type;
>    enum CodecID codec_id;
># 1421 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    unsigned int codec_tag;
>
>
>
>
>
>
>    int workaround_bugs;
># 1452 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int luma_elim_threshold;
>
>
>
>
>
>
>    int chroma_elim_threshold;
># 1473 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int strict_std_compliance;
># 1485 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    float b_quant_offset;
>
>
>
>
>
>
>
>    int error_recognition;
># 1513 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*get_buffer)(struct AVCodecContext *c, AVFrame *pic);
># 1524 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    void (*release_buffer)(struct AVCodecContext *c, AVFrame *pic);
>
>
>
>
>
>
>
>    int has_b_frames;
>
>
>
>
>
>    int block_align;
>
>    int parse_only;
># 1549 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int mpeg_quant;
>
>
>
>
>
>
>    char *stats_out;
>
>
>
>
>
>
>
>    char *stats_in;
>
>
>
>
>
>
>
>    float rc_qsquish;
>
>    float rc_qmod_amp;
>    int rc_qmod_freq;
>
>
>
>
>
>
>    RcOverride *rc_override;
>    int rc_override_count;
>
>
>
>
>
>
>    const char *rc_eq;
>
>
>
>
>
>
>    int rc_max_rate;
>
>
>
>
>
>
>    int rc_min_rate;
>
>
>
>
>
>
>    int rc_buffer_size;
>    float rc_buffer_aggressivity;
># 1621 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    float i_quant_factor;
>
>
>
>
>
>
>    float i_quant_offset;
>
>
>
>
>
>
>    float rc_initial_cplx;
>
>
>
>
>
>
>    int dct_algo;
># 1656 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    float lumi_masking;
>
>
>
>
>
>
>    float temporal_cplx_masking;
>
>
>
>
>
>
>    float spatial_cplx_masking;
>
>
>
>
>
>
>    float p_masking;
>
>
>
>
>
>
>    float dark_masking;
>
>
>
>
>
>
>    int idct_algo;
># 1723 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int slice_count;
>
>
>
>
>
>    int *slice_offset;
>
>
>
>
>
>
>    int error_concealment;
># 1748 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    unsigned dsp_mask;
>
>
>
>
>
>
>     int bits_per_coded_sample;
>
>
>
>
>
>
>     int prediction_method;
># 1774 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    AVRational sample_aspect_ratio;
>
>
>
>
>
>
>    AVFrame *coded_frame;
>
>
>
>
>
>
>    int debug;
># 1812 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int debug_mv;
># 1822 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    uint64_t error[4];
>
>
>
>
>
>
>    int me_cmp;
>
>
>
>
>
>    int me_sub_cmp;
>
>
>
>
>
>    int mb_cmp;
>
>
>
>
>
>    int ildct_cmp;
># 1870 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int dia_size;
>
>
>
>
>
>
>    int last_predictor_count;
>
>
>
>
>
>
>    int pre_me;
>
>
>
>
>
>
>    int me_pre_cmp;
>
>
>
>
>
>
>    int pre_dia_size;
>
>
>
>
>
>
>    int me_subpel_quality;
># 1916 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    enum PixelFormat (*get_format)(struct AVCodecContext *s, const enum PixelFormat * fmt);
># 1926 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int dtg_active_format;
># 1942 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int me_range;
>
>
>
>
>
>
>    int intra_quant_bias;
>
>
>
>
>
>
>
>    int inter_quant_bias;
>
>
>
>
>
>
>
>    int color_table_id;
>
>
>
>
>
>    int internal_buffer_count;
>
>
>
>
>
>    void *internal_buffer;
>
>
>
>
>
>
>
>    int global_quality;
># 1997 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int coder_type;
>
>
>
>
>
>
>    int context_model;
># 2019 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int slice_flags;
># 2029 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int xvmc_acceleration;
>
>
>
>
>
>
>    int mb_decision;
># 2046 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    uint16_t *intra_matrix;
>
>
>
>
>
>
>    uint16_t *inter_matrix;
>
>
>
>
>
>
>
>    unsigned int stream_codec_tag;
>
>
>
>
>
>
>
>    int scenechange_threshold;
>
>
>
>
>
>
>    int lmin;
>
>
>
>
>
>
>    int lmax;
>
>
>
>
>
>
>
>    struct AVPaletteControl *palctrl;
>
>
>
>
>
>
>
>    int noise_reduction;
># 2113 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*reget_buffer)(struct AVCodecContext *c, AVFrame *pic);
>
>
>
>
>
>
>    int rc_initial_buffer_occupancy;
>
>
>
>
>
>
>    int inter_threshold;
>
>
>
>
>
>
>    int flags2;
>
>
>
>
>
>
>    int error_rate;
>
>
>
>
>
>
>
>    __attribute__((deprecated)) int antialias_algo;
># 2161 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int quantizer_noise_shaping;
>
>
>
>
>
>
>
>    int thread_count;
># 2180 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*execute)(struct AVCodecContext *c, int (*func)(struct AVCodecContext *c2, void *arg), void *arg2, int *ret, int count, int size);
>
>
>
>
>
>
>
>    void *thread_opaque;
># 2197 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>     int me_threshold;
>
>
>
>
>
>
>     int mb_threshold;
>
>
>
>
>
>
>     int intra_dc_precision;
>
>
>
>
>
>
>     int nsse_weight;
>
>
>
>
>
>
>     int skip_top;
>
>
>
>
>
>
>     int skip_bottom;
>
>
>
>
>
>
>     int profile;
># 2288 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>     int level;
>
>
>
>
>
>
>
>     int lowres;
>
>
>
>
>
>
>
>    int coded_width, coded_height;
>
>
>
>
>
>
>    int frame_skip_threshold;
>
>
>
>
>
>
>    int frame_skip_factor;
>
>
>
>
>
>
>    int frame_skip_exp;
>
>
>
>
>
>
>    int frame_skip_cmp;
>
>
>
>
>
>
>
>    float border_masking;
>
>
>
>
>
>
>    int mb_lmin;
>
>
>
>
>
>
>    int mb_lmax;
>
>
>
>
>
>
>    int me_penalty_compensation;
>
>
>
>
>
>
>    enum AVDiscard skip_loop_filter;
>
>
>
>
>
>
>    enum AVDiscard skip_idct;
>
>
>
>
>
>
>    enum AVDiscard skip_frame;
>
>
>
>
>
>
>    int bidir_refine;
>
>
>
>
>
>
>    int brd_scale;
>
>
>
>
>
>
>    float crf;
>
>
>
>
>
>
>    int cqp;
>
>
>
>
>
>
>    int keyint_min;
>
>
>
>
>
>
>    int refs;
>
>
>
>
>
>
>    int chromaoffset;
>
>
>
>
>
>
>    int bframebias;
>
>
>
>
>
>
>    int trellis;
>
>
>
>
>
>
>    float complexityblur;
>
>
>
>
>
>
>
>    int deblockalpha;
>
>
>
>
>
>
>
>    int deblockbeta;
>
>
>
>
>
>
>    int partitions;
># 2487 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int directpred;
>
>
>
>
>
>
>    int cutoff;
>
>
>
>
>
>
>    int scenechange_factor;
>
>
>
>
>
>
>
>    int mv0_threshold;
>
>
>
>
>
>
>    int b_sensitivity;
>
>
>
>
>
>    int compression_level;
>
>
>
>
>
>
>    int min_prediction_order;
>
>
>
>
>
>    int max_prediction_order;
># 2549 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    __attribute__((deprecated)) int lpc_coeff_precision;
>
>
>
>
>
>
>    __attribute__((deprecated)) int prediction_order_method;
>
>
>
>
>
>    __attribute__((deprecated)) int min_partition_order;
>
>
>
>
>
>    __attribute__((deprecated)) int max_partition_order;
># 2579 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int64_t timecode_frame_start;
># 2588 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int request_channels;
># 2597 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    float drc_scale;
># 2606 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int64_t reordered_opaque;
>
>
>
>
>
>
>    int bits_per_raw_sample;
>
>
>
>
>
>
>    int64_t channel_layout;
>
>
>
>
>
>
>    int64_t request_channel_layout;
>
>
>
>
>
>
>    float rc_max_available_vbv_use;
>
>
>
>
>
>
>    float rc_min_vbv_overflow_use;
>
>
>
>
>
>
>    struct AVHWAccel *hwaccel;
># 2657 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int ticks_per_frame;
># 2669 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    void *hwaccel_context;
>
>
>
>
>
>
>    enum AVColorPrimaries color_primaries;
>
>
>
>
>
>
>    enum AVColorTransferCharacteristic color_trc;
>
>
>
>
>
>
>    enum AVColorSpace colorspace;
>
>
>
>
>
>
>    enum AVColorRange color_range;
>
>
>
>
>
>
>    enum AVChromaLocation chroma_sample_location;
># 2724 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*execute2)(struct AVCodecContext *c, int (*func)(struct AVCodecContext *c2, void *arg, int jobnr, int threadnr), void *arg2, int *ret, int count);
># 2734 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int weighted_p_pred;
># 2744 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int aq_mode;
>
>
>
>
>
>
>
>    float aq_strength;
>
>
>
>
>
>
>
>    float psy_rd;
>
>
>
>
>
>
>
>    float psy_trellis;
>
>
>
>
>
>
>
>    int rc_lookahead;
># 2785 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    float crf_max;
>
>    int log_level_offset;
>
>
>
>
>
>
>
>    __attribute__((deprecated)) enum AVLPCType lpc_type;
>
>
>
>
>
>
>    __attribute__((deprecated)) int lpc_passes;
># 2812 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int slices;
># 2822 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    uint8_t *subtitle_header;
>    int subtitle_header_size;
># 2832 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    AVPacket *pkt;
># 2841 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int is_copy;
># 2851 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int thread_type;
># 2860 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int active_thread_type;
># 2870 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int thread_safe_callbacks;
>
>
>
>
>
>
>
>    uint64_t vbv_delay;
>
>
>
>
>
>
>    enum AVAudioServiceType audio_service_type;
>
>
>
>
>
>
>
>    enum AVSampleFormat request_sample_fmt;
>
>
>
>
>
>
>    int64_t pts_correction_num_faulty_pts;
>    int64_t pts_correction_num_faulty_dts;
>    int64_t pts_correction_last_pts;
>    int64_t pts_correction_last_dts;
>
>
>} AVCodecContext;
>
>
>
>
>typedef struct AVProfile {
>    int profile;
>    const char *name;
>} AVProfile;
>
>
>
>
>typedef struct AVCodec {
>
>
>
>
>
>
>    const char *name;
>    enum AVMediaType type;
>    enum CodecID id;
>    int priv_data_size;
>    int (*init)(AVCodecContext *);
>    int (*encode)(AVCodecContext *, uint8_t *buf, int buf_size, void *data);
>    int (*close)(AVCodecContext *);
>    int (*decode)(AVCodecContext *, void *outdata, int *outdata_size, AVPacket *avpkt);
>
>
>
>
>    int capabilities;
>    struct AVCodec *next;
>
>
>
>
>    void (*flush)(AVCodecContext *);
>    const AVRational *supported_framerates;
>    const enum PixelFormat *pix_fmts;
>
>
>
>
>    const char *long_name;
>    const int *supported_samplerates;
>    const enum AVSampleFormat *sample_fmts;
>    const int64_t *channel_layouts;
>    uint8_t max_lowres;
>    const AVClass *priv_class;
>    const AVProfile *profiles;
># 2968 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*init_thread_copy)(AVCodecContext *);
>
>
>
>
>
>
>
>    int (*update_thread_context)(AVCodecContext *dst, const AVCodecContext *src);
>
>} AVCodec;
>
>
>
>
>typedef struct AVHWAccel {
>
>
>
>
>
>    const char *name;
>
>
>
>
>
>
>    enum AVMediaType type;
>
>
>
>
>
>
>    enum CodecID id;
>
>
>
>
>
>
>    enum PixelFormat pix_fmt;
>
>
>
>
>
>    int capabilities;
>
>    struct AVHWAccel *next;
># 3034 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*start_frame)(AVCodecContext *avctx, const uint8_t *buf, uint32_t buf_size);
># 3047 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*decode_slice)(AVCodecContext *avctx, const uint8_t *buf, uint32_t buf_size);
># 3058 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int (*end_frame)(AVCodecContext *avctx);
># 3067 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int priv_data_size;
>} AVHWAccel;
>
>
>
>
>
>typedef struct AVPicture {
>    uint8_t *data[4];
>    int linesize[4];
>} AVPicture;
># 3090 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>typedef struct AVPaletteControl {
>
>
>
>    int palette_changed;
>
>
>
>
>
>    unsigned int palette[256];
>
>} AVPaletteControl __attribute__((deprecated));
>
>
>enum AVSubtitleType {
>    SUBTITLE_NONE,
>
>    SUBTITLE_BITMAP,
>
>
>
>
>
>    SUBTITLE_TEXT,
>
>
>
>
>
>    SUBTITLE_ASS,
>};
>
>typedef struct AVSubtitleRect {
>    int x;
>    int y;
>    int w;
>    int h;
>    int nb_colors;
>
>
>
>
>
>    AVPicture pict;
>    enum AVSubtitleType type;
>
>    char *text;
>
>
>
>
>
>
>    char *ass;
>} AVSubtitleRect;
>
>typedef struct AVSubtitle {
>    uint16_t format;
>    uint32_t start_display_time;
>    uint32_t end_display_time;
>    unsigned num_rects;
>    AVSubtitleRect **rects;
>    int64_t pts;
>} AVSubtitle;
>
>
>
>
>
>
>__attribute__((deprecated)) void av_destruct_packet_nofree(AVPacket *pkt);
>
>
>
>
>void av_destruct_packet(AVPacket *pkt);
>
>
>
>
>
>
>void av_init_packet(AVPacket *pkt);
># 3183 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int av_new_packet(AVPacket *pkt, int size);
>
>
>
>
>
>
>
>void av_shrink_packet(AVPacket *pkt, int size);
>
>
>
>
>
>
>
>int av_grow_packet(AVPacket *pkt, int grow_by);
>
>
>
>
>
>int av_dup_packet(AVPacket *pkt);
>
>
>
>
>
>
>void av_free_packet(AVPacket *pkt);
># 3222 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>uint8_t* av_packet_new_side_data(AVPacket *pkt, enum AVPacketSideDataType type,
>                                 int size);
># 3233 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>uint8_t* av_packet_get_side_data(AVPacket *pkt, enum AVPacketSideDataType type,
>                                 int *size);
>
>int av_packet_merge_side_data(AVPacket *pkt);
>
>int av_packet_split_side_data(AVPacket *pkt);
>
>
>
>
>struct ReSampleContext;
>struct AVResampleContext;
>
>typedef struct ReSampleContext ReSampleContext;
># 3264 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>ReSampleContext *av_audio_resample_init(int output_channels, int input_channels,
>                                        int output_rate, int input_rate,
>                                        enum AVSampleFormat sample_fmt_out,
>                                        enum AVSampleFormat sample_fmt_in,
>                                        int filter_length, int log2_phase_count,
>                                        int linear, double cutoff);
>
>int audio_resample(ReSampleContext *s, short *output, short *input, int nb_samples);
>
>
>
>
>
>
>
>void audio_resample_close(ReSampleContext *s);
># 3291 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>struct AVResampleContext *av_resample_init(int out_rate, int in_rate, int filter_length, int log2_phase_count, int linear, double cutoff);
># 3302 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int av_resample(struct AVResampleContext *c, short *dst, short *src, int *consumed, int src_size, int dst_size, int update_ctx);
># 3317 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void av_resample_compensate(struct AVResampleContext *c, int sample_delta, int compensation_distance);
>void av_resample_close(struct AVResampleContext *c);
># 3331 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avpicture_alloc(AVPicture *picture, enum PixelFormat pix_fmt, int width, int height);
># 3340 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void avpicture_free(AVPicture *picture);
># 3362 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avpicture_fill(AVPicture *picture, uint8_t *ptr,
>                   enum PixelFormat pix_fmt, int width, int height);
># 3380 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avpicture_layout(const AVPicture* src, enum PixelFormat pix_fmt, int width, int height,
>                     unsigned char *dest, int dest_size);
># 3395 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avpicture_get_size(enum PixelFormat pix_fmt, int width, int height);
>void avcodec_get_chroma_sub_sample(enum PixelFormat pix_fmt, int *h_shift, int *v_shift);
># 3405 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>__attribute__((deprecated))
>const char *avcodec_get_pix_fmt_name(enum PixelFormat pix_fmt);
>
>
>void avcodec_set_dimensions(AVCodecContext *s, int width, int height);
>
>
>
>
>
>
>unsigned int avcodec_pix_fmt_to_codec_tag(enum PixelFormat pix_fmt);
># 3425 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>size_t av_get_codec_tag_string(char *buf, size_t buf_size, unsigned int codec_tag);
># 3451 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_get_pix_fmt_loss(enum PixelFormat dst_pix_fmt, enum PixelFormat src_pix_fmt,
>                             int has_alpha);
># 3476 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>enum PixelFormat avcodec_find_best_pix_fmt(int64_t pix_fmt_mask, enum PixelFormat src_pix_fmt,
>                              int has_alpha, int *loss_ptr);
># 3486 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int img_get_alpha_info(const AVPicture *src,
>                       enum PixelFormat pix_fmt, int width, int height);
>
>
>
>int avpicture_deinterlace(AVPicture *dst, const AVPicture *src,
>                          enum PixelFormat pix_fmt, int width, int height);
># 3501 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>AVCodec *av_codec_next(AVCodec *c);
>
>
>
>
>unsigned avcodec_version(void);
>
>
>
>
>const char *avcodec_configuration(void);
>
>
>
>
>const char *avcodec_license(void);
># 3527 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void avcodec_init(void);
>
>
>
>
>
>
>void avcodec_register(AVCodec *codec);
>
>
>
>
>
>
>
>AVCodec *avcodec_find_encoder(enum CodecID id);
>
>
>
>
>
>
>
>AVCodec *avcodec_find_encoder_by_name(const char *name);
>
>
>
>
>
>
>
>AVCodec *avcodec_find_decoder(enum CodecID id);
>
>
>
>
>
>
>
>AVCodec *avcodec_find_decoder_by_name(const char *name);
>void avcodec_string(char *buf, int buf_size, AVCodecContext *enc, int encode);
># 3576 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>const char *av_get_profile_name(const AVCodec *codec, int profile);
>
>
>
>
>
>
>void avcodec_get_context_defaults(AVCodecContext *s);
>
>
>
>void avcodec_get_context_defaults2(AVCodecContext *s, enum AVMediaType);
>
>
>
>int avcodec_get_context_defaults3(AVCodecContext *s, AVCodec *codec);
># 3600 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>AVCodecContext *avcodec_alloc_context(void);
>
>
>
>AVCodecContext *avcodec_alloc_context2(enum AVMediaType);
>
>
>
>AVCodecContext *avcodec_alloc_context3(AVCodec *codec);
># 3621 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_copy_context(AVCodecContext *dest, const AVCodecContext *src);
>
>
>
>
>
>
>void avcodec_get_frame_defaults(AVFrame *pic);
># 3637 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>AVFrame *avcodec_alloc_frame(void);
>
>int avcodec_default_get_buffer(AVCodecContext *s, AVFrame *pic);
>void avcodec_default_release_buffer(AVCodecContext *s, AVFrame *pic);
>int avcodec_default_reget_buffer(AVCodecContext *s, AVFrame *pic);
># 3650 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>unsigned avcodec_get_edge_width(void);
># 3660 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void avcodec_align_dimensions(AVCodecContext *s, int *width, int *height);
># 3670 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void avcodec_align_dimensions2(AVCodecContext *s, int *width, int *height,
>                               int linesize_align[4]);
>
>enum PixelFormat avcodec_default_get_format(struct AVCodecContext *s, const enum PixelFormat * fmt);
>
>
>
>
>
>__attribute__((deprecated))
>int avcodec_thread_init(AVCodecContext *s, int thread_count);
>
>
>int avcodec_default_execute(AVCodecContext *c, int (*func)(AVCodecContext *c2, void *arg2),void *arg, int *ret, int count, int size);
>int avcodec_default_execute2(AVCodecContext *c, int (*func)(AVCodecContext *c2, void *arg2, int, int),void *arg, int *ret, int count);
># 3717 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_open(AVCodecContext *avctx, AVCodec *codec);
># 3751 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_open2(AVCodecContext *avctx, AVCodec *codec, AVDictionary **options);
># 3792 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_decode_audio3(AVCodecContext *avctx, int16_t *samples,
>                         int *frame_size_ptr,
>                         AVPacket *avpkt);
># 3836 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_decode_video2(AVCodecContext *avctx, AVFrame *picture,
>                         int *got_picture_ptr,
>                         AVPacket *avpkt);
># 3856 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_decode_subtitle2(AVCodecContext *avctx, AVSubtitle *sub,
>                            int *got_sub_ptr,
>                            AVPacket *avpkt);
>
>
>
>
>
>
>void avsubtitle_free(AVSubtitle *sub);
>
>int avcodec_parse_frame(AVCodecContext *avctx, uint8_t **pdata,
>                        int *data_size_ptr,
>                        uint8_t *buf, int buf_size);
># 3890 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_encode_audio(AVCodecContext *avctx, uint8_t *buf, int buf_size,
>                         const short *samples);
># 3905 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int avcodec_encode_video(AVCodecContext *avctx, uint8_t *buf, int buf_size,
>                         const AVFrame *pict);
>int avcodec_encode_subtitle(AVCodecContext *avctx, uint8_t *buf, int buf_size,
>                            const AVSubtitle *sub);
>
>int avcodec_close(AVCodecContext *avctx);
># 3922 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void avcodec_register_all(void);
>
>
>
>
>void avcodec_flush_buffers(AVCodecContext *avctx);
>
>void avcodec_default_free_buffers(AVCodecContext *s);
># 3941 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>__attribute__((deprecated))
>char av_get_pict_type_char(int pict_type);
># 3951 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int av_get_bits_per_sample(enum CodecID codec_id);
>
>
>
>
>
>__attribute__((deprecated))
>int av_get_bits_per_sample_format(enum AVSampleFormat sample_fmt);
>
>
>
>typedef struct AVCodecParserContext {
>    void *priv_data;
>    struct AVCodecParser *parser;
>    int64_t frame_offset;
>    int64_t cur_offset;
>
>    int64_t next_frame_offset;
>
>    int pict_type;
># 3980 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int repeat_pict;
>    int64_t pts;
>    int64_t dts;
>
>
>    int64_t last_pts;
>    int64_t last_dts;
>    int fetch_timestamp;
>
>
>    int cur_frame_start_index;
>    int64_t cur_frame_offset[4];
>    int64_t cur_frame_pts[4];
>    int64_t cur_frame_dts[4];
>
>    int flags;
>
>
>
>
>
>    int64_t offset;
>    int64_t cur_frame_end[4];
>
>
>
>
>
>
>
>    int key_frame;
># 4029 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int64_t convergence_duration;
># 4041 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int dts_sync_point;
># 4056 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int dts_ref_dts_delta;
># 4070 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>    int pts_dts_delta;
>
>
>
>
>
>
>    int64_t cur_frame_pos[4];
>
>
>
>
>    int64_t pos;
>
>
>
>
>    int64_t last_pos;
>} AVCodecParserContext;
>
>typedef struct AVCodecParser {
>    int codec_ids[5];
>    int priv_data_size;
>    int (*parser_init)(AVCodecParserContext *s);
>    int (*parser_parse)(AVCodecParserContext *s,
>                        AVCodecContext *avctx,
>                        const uint8_t **poutbuf, int *poutbuf_size,
>                        const uint8_t *buf, int buf_size);
>    void (*parser_close)(AVCodecParserContext *s);
>    int (*split)(AVCodecContext *avctx, const uint8_t *buf, int buf_size);
>    struct AVCodecParser *next;
>} AVCodecParser;
>
>AVCodecParser *av_parser_next(AVCodecParser *c);
>
>void av_register_codec_parser(AVCodecParser *parser);
>AVCodecParserContext *av_parser_init(int codec_id);
># 4136 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int av_parser_parse2(AVCodecParserContext *s,
>                     AVCodecContext *avctx,
>                     uint8_t **poutbuf, int *poutbuf_size,
>                     const uint8_t *buf, int buf_size,
>                     int64_t pts, int64_t dts,
>                     int64_t pos);
>
>int av_parser_change(AVCodecParserContext *s,
>                     AVCodecContext *avctx,
>                     uint8_t **poutbuf, int *poutbuf_size,
>                     const uint8_t *buf, int buf_size, int keyframe);
>void av_parser_close(AVCodecParserContext *s);
>
>
>typedef struct AVBitStreamFilterContext {
>    void *priv_data;
>    struct AVBitStreamFilter *filter;
>    AVCodecParserContext *parser;
>    struct AVBitStreamFilterContext *next;
>} AVBitStreamFilterContext;
>
>
>typedef struct AVBitStreamFilter {
>    const char *name;
>    int priv_data_size;
>    int (*filter)(AVBitStreamFilterContext *bsfc,
>                  AVCodecContext *avctx, const char *args,
>                  uint8_t **poutbuf, int *poutbuf_size,
>                  const uint8_t *buf, int buf_size, int keyframe);
>    void (*close)(AVBitStreamFilterContext *bsfc);
>    struct AVBitStreamFilter *next;
>} AVBitStreamFilter;
>
>void av_register_bitstream_filter(AVBitStreamFilter *bsf);
>AVBitStreamFilterContext *av_bitstream_filter_init(const char *name);
>int av_bitstream_filter_filter(AVBitStreamFilterContext *bsfc,
>                               AVCodecContext *avctx, const char *args,
>                               uint8_t **poutbuf, int *poutbuf_size,
>                               const uint8_t *buf, int buf_size, int keyframe);
>void av_bitstream_filter_close(AVBitStreamFilterContext *bsf);
>
>AVBitStreamFilter *av_bitstream_filter_next(AVBitStreamFilter *f);
># 4186 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void *av_fast_realloc(void *ptr, unsigned int *size, size_t min_size);
># 4200 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void av_fast_malloc(void *ptr, unsigned int *size, size_t min_size);
>
>
>
>
>void av_picture_copy(AVPicture *dst, const AVPicture *src,
>                     enum PixelFormat pix_fmt, int width, int height);
>
>
>
>
>int av_picture_crop(AVPicture *dst, const AVPicture *src,
>                    enum PixelFormat pix_fmt, int top_band, int left_band);
>
>
>
>
>int av_picture_pad(AVPicture *dst, const AVPicture *src, int height, int width, enum PixelFormat pix_fmt,
>            int padtop, int padbottom, int padleft, int padright, int *color);
># 4227 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>unsigned int av_xiphlacing(unsigned char *s, unsigned int v);
># 4241 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void av_log_missing_feature(void *avc, const char *feature, int want_sample);
># 4251 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>void av_log_ask_for_sample(void *avc, const char *msg, ...);
>
>
>
>
>void av_register_hwaccel(AVHWAccel *hwaccel);
>
>
>
>
>
>
>AVHWAccel *av_hwaccel_next(AVHWAccel *hwaccel);
>
>
>
>
>
>enum AVLockOp {
>  AV_LOCK_CREATE,
>  AV_LOCK_OBTAIN,
>  AV_LOCK_RELEASE,
>  AV_LOCK_DESTROY,
>};
># 4289 "/usr/include/ffmpeg/libavcodec/avcodec.h"
>int av_lockmgr_register(int (*cb)(void **mutex, enum AVLockOp op));
># 43 "/usr/include/ffmpeg/libavformat/avformat.h" 2
>
>
># 1 "/usr/include/ffmpeg/libavformat/avio.h" 1
># 30 "/usr/include/ffmpeg/libavformat/avio.h"
># 1 "/usr/include/ffmpeg/libavutil/common.h" 1
># 31 "/usr/include/ffmpeg/libavformat/avio.h" 2
># 1 "/usr/include/ffmpeg/libavutil/log.h" 1
># 32 "/usr/include/ffmpeg/libavformat/avio.h" 2
>
># 1 "/usr/include/ffmpeg/libavformat/version.h" 1
># 34 "/usr/include/ffmpeg/libavformat/avio.h" 2
># 50 "/usr/include/ffmpeg/libavformat/avio.h"
>typedef struct {
>    unsigned char *buffer;
>    int buffer_size;
>    unsigned char *buf_ptr;
>    unsigned char *buf_end;
>
>
>
>    void *opaque;
>
>    int (*read_packet)(void *opaque, uint8_t *buf, int buf_size);
>    int (*write_packet)(void *opaque, uint8_t *buf, int buf_size);
>    int64_t (*seek)(void *opaque, int64_t offset, int whence);
>    int64_t pos;
>    int must_flush;
>    int eof_reached;
>    int write_flag;
>
>    __attribute__((deprecated)) int is_streamed;
>
>    int max_packet_size;
>    unsigned long checksum;
>    unsigned char *checksum_ptr;
>    unsigned long (*update_checksum)(unsigned long checksum, const uint8_t *buf, unsigned int size);
>    int error;
>
>
>
>    int (*read_pause)(void *opaque, int pause);
>
>
>
>
>
>    int64_t (*read_seek)(void *opaque, int stream_index,
>                         int64_t timestamp, int flags);
>
>
>
>    int seekable;
>} AVIOContext;
># 103 "/usr/include/ffmpeg/libavformat/avio.h"
>typedef struct URLContext {
>    const AVClass *av_class;
>    struct URLProtocol *prot;
>    int flags;
>    int is_streamed;
>    int max_packet_size;
>    void *priv_data;
>    char *filename;
>    int is_connected;
>} URLContext;
>
>
>
>
>
>
>
>typedef struct URLProtocol {
>    const char *name;
>    int (*url_open)(URLContext *h, const char *url, int flags);
>    int (*url_read)(URLContext *h, unsigned char *buf, int size);
>    int (*url_write)(URLContext *h, const unsigned char *buf, int size);
>    int64_t (*url_seek)(URLContext *h, int64_t pos, int whence);
>    int (*url_close)(URLContext *h);
>    struct URLProtocol *next;
>    int (*url_read_pause)(URLContext *h, int pause);
>    int64_t (*url_read_seek)(URLContext *h, int stream_index,
>                             int64_t timestamp, int flags);
>    int (*url_get_file_handle)(URLContext *h);
>    int priv_data_size;
>    const AVClass *priv_data_class;
>    int flags;
>    int (*url_check)(URLContext *h, int mask);
>} URLProtocol;
>
>typedef struct URLPollEntry {
>    URLContext *handle;
>    int events;
>    int revents;
>} URLPollEntry;
>
>
>__attribute__((deprecated)) int url_poll(URLPollEntry *poll_table, int n, int timeout);
># 174 "/usr/include/ffmpeg/libavformat/avio.h"
>typedef int URLInterruptCB(void);
>extern URLInterruptCB *url_interrupt_cb;
>
>
>
>
>
>
>__attribute__((deprecated)) int url_open_protocol (URLContext **puc, struct URLProtocol *up,
>                                            const char *url, int flags);
>__attribute__((deprecated)) int url_alloc(URLContext **h, const char *url, int flags);
>__attribute__((deprecated)) int url_connect(URLContext *h);
>__attribute__((deprecated)) int url_open(URLContext **h, const char *url, int flags);
>__attribute__((deprecated)) int url_read(URLContext *h, unsigned char *buf, int size);
>__attribute__((deprecated)) int url_read_complete(URLContext *h, unsigned char *buf, int size);
>__attribute__((deprecated)) int url_write(URLContext *h, const unsigned char *buf, int size);
>__attribute__((deprecated)) int64_t url_seek(URLContext *h, int64_t pos, int whence);
>__attribute__((deprecated)) int url_close(URLContext *h);
>__attribute__((deprecated)) int64_t url_filesize(URLContext *h);
>__attribute__((deprecated)) int url_get_file_handle(URLContext *h);
>__attribute__((deprecated)) int url_get_max_packet_size(URLContext *h);
>__attribute__((deprecated)) void url_get_filename(URLContext *h, char *buf, int buf_size);
>__attribute__((deprecated)) int av_url_read_pause(URLContext *h, int pause);
>__attribute__((deprecated)) int64_t av_url_read_seek(URLContext *h, int stream_index,
>                                              int64_t timestamp, int flags);
>__attribute__((deprecated)) void url_set_interrupt_cb(int (*interrupt_cb)(void));
>
>
>
>
>
>URLProtocol *av_protocol_next(URLProtocol *p);
>
>
>
>
>
>
>__attribute__((deprecated)) int av_register_protocol2(URLProtocol *protocol, int size);
>
>
>
>
>
>typedef __attribute__((deprecated)) AVIOContext ByteIOContext;
>
>__attribute__((deprecated)) int init_put_byte(AVIOContext *s,
>                  unsigned char *buffer,
>                  int buffer_size,
>                  int write_flag,
>                  void *opaque,
>                  int (*read_packet)(void *opaque, uint8_t *buf, int buf_size),
>                  int (*write_packet)(void *opaque, uint8_t *buf, int buf_size),
>                  int64_t (*seek)(void *opaque, int64_t offset, int whence));
>__attribute__((deprecated)) AVIOContext *av_alloc_put_byte(
>                  unsigned char *buffer,
>                  int buffer_size,
>                  int write_flag,
>                  void *opaque,
>                  int (*read_packet)(void *opaque, uint8_t *buf, int buf_size),
>                  int (*write_packet)(void *opaque, uint8_t *buf, int buf_size),
>                  int64_t (*seek)(void *opaque, int64_t offset, int whence));
>
>
>
>
>
>
>__attribute__((deprecated)) int get_buffer(AVIOContext *s, unsigned char *buf, int size);
>__attribute__((deprecated)) int get_partial_buffer(AVIOContext *s, unsigned char *buf, int size);
>__attribute__((deprecated)) int get_byte(AVIOContext *s);
>__attribute__((deprecated)) unsigned int get_le16(AVIOContext *s);
>__attribute__((deprecated)) unsigned int get_le24(AVIOContext *s);
>__attribute__((deprecated)) unsigned int get_le32(AVIOContext *s);
>__attribute__((deprecated)) uint64_t get_le64(AVIOContext *s);
>__attribute__((deprecated)) unsigned int get_be16(AVIOContext *s);
>__attribute__((deprecated)) unsigned int get_be24(AVIOContext *s);
>__attribute__((deprecated)) unsigned int get_be32(AVIOContext *s);
>__attribute__((deprecated)) uint64_t get_be64(AVIOContext *s);
>
>__attribute__((deprecated)) void put_byte(AVIOContext *s, int b);
>__attribute__((deprecated)) void put_nbyte(AVIOContext *s, int b, int count);
>__attribute__((deprecated)) void put_buffer(AVIOContext *s, const unsigned char *buf, int size);
>__attribute__((deprecated)) void put_le64(AVIOContext *s, uint64_t val);
>__attribute__((deprecated)) void put_be64(AVIOContext *s, uint64_t val);
>__attribute__((deprecated)) void put_le32(AVIOContext *s, unsigned int val);
>__attribute__((deprecated)) void put_be32(AVIOContext *s, unsigned int val);
>__attribute__((deprecated)) void put_le24(AVIOContext *s, unsigned int val);
>__attribute__((deprecated)) void put_be24(AVIOContext *s, unsigned int val);
>__attribute__((deprecated)) void put_le16(AVIOContext *s, unsigned int val);
>__attribute__((deprecated)) void put_be16(AVIOContext *s, unsigned int val);
>__attribute__((deprecated)) void put_tag(AVIOContext *s, const char *tag);
>
>
>
>
>__attribute__((deprecated)) int av_url_read_fpause(AVIOContext *h, int pause);
>__attribute__((deprecated)) int64_t av_url_read_fseek (AVIOContext *h, int stream_index,
>                                                int64_t timestamp, int flags);
>
>
>
>
>
>
>__attribute__((deprecated)) int url_fopen( AVIOContext **s, const char *url, int flags);
>__attribute__((deprecated)) int url_fclose(AVIOContext *s);
>__attribute__((deprecated)) int64_t url_fseek(AVIOContext *s, int64_t offset, int whence);
>__attribute__((deprecated)) int url_fskip(AVIOContext *s, int64_t offset);
>__attribute__((deprecated)) int64_t url_ftell(AVIOContext *s);
>__attribute__((deprecated)) int64_t url_fsize(AVIOContext *s);
>
>__attribute__((deprecated)) int url_fgetc(AVIOContext *s);
>__attribute__((deprecated)) int url_setbufsize(AVIOContext *s, int buf_size);
>
>__attribute__((deprecated)) int url_fprintf(AVIOContext *s, const char *fmt, ...) __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>__attribute__((deprecated)) void put_flush_packet(AVIOContext *s);
>__attribute__((deprecated)) int url_open_dyn_buf(AVIOContext **s);
>__attribute__((deprecated)) int url_open_dyn_packet_buf(AVIOContext **s, int max_packet_size);
>__attribute__((deprecated)) int url_close_dyn_buf(AVIOContext *s, uint8_t **pbuffer);
>__attribute__((deprecated)) int url_fdopen(AVIOContext **s, URLContext *h);
>
>
>
>
>__attribute__((deprecated)) int url_ferror(AVIOContext *s);
>
>__attribute__((deprecated)) int udp_set_remote_url(URLContext *h, const char *uri);
>__attribute__((deprecated)) int udp_get_local_port(URLContext *h);
>
>__attribute__((deprecated)) void init_checksum(AVIOContext *s,
>                   unsigned long (*update_checksum)(unsigned long c, const uint8_t *p, unsigned int len),
>                   unsigned long checksum);
>__attribute__((deprecated)) unsigned long get_checksum(AVIOContext *s);
>__attribute__((deprecated)) void put_strz(AVIOContext *s, const char *buf);
>
>
>__attribute__((deprecated)) char *url_fgets(AVIOContext *s, char *buf, int buf_size);
>
>
>
>__attribute__((deprecated)) char *get_strz(AVIOContext *s, char *buf, int maxlen);
>
>
>
>__attribute__((deprecated)) static inline int url_is_streamed(AVIOContext *s)
>{
>    return !s->seekable;
>}
>__attribute__((deprecated)) URLContext *url_fileno(AVIOContext *s);
>
>
>
>
>__attribute__((deprecated)) int url_fget_max_packet_size(AVIOContext *s);
>
>__attribute__((deprecated)) int url_open_buf(AVIOContext **s, uint8_t *buf, int buf_size, int flags);
>
>
>__attribute__((deprecated)) int url_close_buf(AVIOContext *s);
>
>
>
>
>
>
>__attribute__((deprecated)) int url_exist(const char *url);
># 358 "/usr/include/ffmpeg/libavformat/avio.h"
>int avio_check(const char *url, int flags);
>
>
>
>
>
>
>
>void avio_set_interrupt_cb(int (*interrupt_cb)(void));
># 385 "/usr/include/ffmpeg/libavformat/avio.h"
>AVIOContext *avio_alloc_context(
>                  unsigned char *buffer,
>                  int buffer_size,
>                  int write_flag,
>                  void *opaque,
>                  int (*read_packet)(void *opaque, uint8_t *buf, int buf_size),
>                  int (*write_packet)(void *opaque, uint8_t *buf, int buf_size),
>                  int64_t (*seek)(void *opaque, int64_t offset, int whence));
>
>void avio_w8(AVIOContext *s, int b);
>void avio_write(AVIOContext *s, const unsigned char *buf, int size);
>void avio_wl64(AVIOContext *s, uint64_t val);
>void avio_wb64(AVIOContext *s, uint64_t val);
>void avio_wl32(AVIOContext *s, unsigned int val);
>void avio_wb32(AVIOContext *s, unsigned int val);
>void avio_wl24(AVIOContext *s, unsigned int val);
>void avio_wb24(AVIOContext *s, unsigned int val);
>void avio_wl16(AVIOContext *s, unsigned int val);
>void avio_wb16(AVIOContext *s, unsigned int val);
>
>
>
>
>
>int avio_put_str(AVIOContext *s, const char *str);
>
>
>
>
>
>int avio_put_str16le(AVIOContext *s, const char *str);
># 436 "/usr/include/ffmpeg/libavformat/avio.h"
>int64_t avio_seek(AVIOContext *s, int64_t offset, int whence);
>
>
>
>
>
>int64_t avio_skip(AVIOContext *s, int64_t offset);
>
>
>
>
>
>static __attribute__((always_inline)) inline int64_t avio_tell(AVIOContext *s)
>{
>    return avio_seek(s, 0, 1);
>}
>
>
>
>
>
>int64_t avio_size(AVIOContext *s);
>
>
>
>
>
>int url_feof(AVIOContext *s);
>
>
>
>int avio_printf(AVIOContext *s, const char *fmt, ...) __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>
>void avio_flush(AVIOContext *s);
>
>
>
>
>
>
>int avio_read(AVIOContext *s, unsigned char *buf, int size);
># 488 "/usr/include/ffmpeg/libavformat/avio.h"
>int avio_r8 (AVIOContext *s);
>unsigned int avio_rl16(AVIOContext *s);
>unsigned int avio_rl24(AVIOContext *s);
>unsigned int avio_rl32(AVIOContext *s);
>uint64_t avio_rl64(AVIOContext *s);
>unsigned int avio_rb16(AVIOContext *s);
>unsigned int avio_rb24(AVIOContext *s);
>unsigned int avio_rb32(AVIOContext *s);
>uint64_t avio_rb64(AVIOContext *s);
># 513 "/usr/include/ffmpeg/libavformat/avio.h"
>int avio_get_str(AVIOContext *pb, int maxlen, char *buf, int buflen);
>
>
>
>
>
>
>
>int avio_get_str16le(AVIOContext *pb, int maxlen, char *buf, int buflen);
>int avio_get_str16be(AVIOContext *pb, int maxlen, char *buf, int buflen);
># 565 "/usr/include/ffmpeg/libavformat/avio.h"
>int avio_open(AVIOContext **s, const char *url, int flags);
>
>
>
>
>
>
>
>int avio_close(AVIOContext *s);
>
>
>
>
>
>
>
>int avio_open_dyn_buf(AVIOContext **s);
># 592 "/usr/include/ffmpeg/libavformat/avio.h"
>int avio_close_dyn_buf(AVIOContext *s, uint8_t **pbuffer);
># 606 "/usr/include/ffmpeg/libavformat/avio.h"
>const char *avio_enum_protocols(void **opaque, int output);
>
>
>
>
>
>
>int avio_pause(AVIOContext *h, int pause);
># 632 "/usr/include/ffmpeg/libavformat/avio.h"
>int64_t avio_seek_time(AVIOContext *h, int stream_index,
>                       int64_t timestamp, int flags);
># 46 "/usr/include/ffmpeg/libavformat/avformat.h" 2
>
>
>struct AVFormatContext;
># 131 "/usr/include/ffmpeg/libavformat/avformat.h"
>typedef __attribute__((deprecated)) AVDictionary AVMetadata;
>typedef __attribute__((deprecated)) AVDictionaryEntry AVMetadataTag;
>
>typedef struct AVMetadataConv AVMetadataConv;
># 144 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated)) AVDictionaryEntry *
>av_metadata_get(AVDictionary *m, const char *key, const AVDictionaryEntry *prev, int flags);
># 157 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated)) int av_metadata_set2(AVDictionary **pm, const char *key, const char *value, int flags);
>
>
>
>
>__attribute__((deprecated)) void av_metadata_conv(struct AVFormatContext *ctx, const AVMetadataConv *d_conv,
>                                                                        const AVMetadataConv *s_conv);
># 173 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated)) void av_metadata_copy(AVDictionary **dst, AVDictionary *src, int flags);
>
>
>
>
>__attribute__((deprecated)) void av_metadata_free(AVDictionary **m);
># 196 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_get_packet(AVIOContext *s, AVPacket *pkt, int size);
># 212 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_append_packet(AVIOContext *s, AVPacket *pkt, int size);
># 221 "/usr/include/ffmpeg/libavformat/avformat.h"
>typedef struct AVFrac {
>    int64_t val, num, den;
>} AVFrac;
>
>
>
>
>struct AVCodecTag;
>
>
>
>
>typedef struct AVProbeData {
>    const char *filename;
>    unsigned char *buf;
>    int buf_size;
>} AVProbeData;
>
>
>
>
>typedef struct AVFormatParameters {
>
>    __attribute__((deprecated)) AVRational time_base;
>    __attribute__((deprecated)) int sample_rate;
>    __attribute__((deprecated)) int channels;
>    __attribute__((deprecated)) int width;
>    __attribute__((deprecated)) int height;
>    __attribute__((deprecated)) enum PixelFormat pix_fmt;
>    __attribute__((deprecated)) int channel;
>    __attribute__((deprecated)) const char *standard;
>    __attribute__((deprecated)) unsigned int mpeg2ts_raw:1;
>
>    __attribute__((deprecated)) unsigned int mpeg2ts_compute_pcr:1;
>    __attribute__((deprecated)) unsigned int initial_pause:1;
>
>    __attribute__((deprecated)) unsigned int prealloced_context:1;
>
>} AVFormatParameters;
># 280 "/usr/include/ffmpeg/libavformat/avformat.h"
>typedef struct AVOutputFormat {
>    const char *name;
>
>
>
>
>
>    const char *long_name;
>    const char *mime_type;
>    const char *extensions;
>
>
>
>    int priv_data_size;
>
>    enum CodecID audio_codec;
>    enum CodecID video_codec;
>    int (*write_header)(struct AVFormatContext *);
>    int (*write_packet)(struct AVFormatContext *, AVPacket *pkt);
>    int (*write_trailer)(struct AVFormatContext *);
>
>
>
>
>
>    int flags;
>
>    void *dummy;
>
>    int (*interleave_packet)(struct AVFormatContext *, AVPacket *out,
>                             AVPacket *in, int flush);
>
>
>
>
>
>    const struct AVCodecTag * const *codec_tag;
>
>    enum CodecID subtitle_codec;
>
>
>    const AVMetadataConv *metadata_conv;
>
>
>    const AVClass *priv_class;
>
>
>    struct AVOutputFormat *next;
>} AVOutputFormat;
>
>typedef struct AVInputFormat {
>
>
>
>
>    const char *name;
>
>
>
>
>
>
>    const char *long_name;
>
>
>
>
>    int priv_data_size;
>
>
>
>
>
>
>    int (*read_probe)(AVProbeData *);
>
>
>
>
>
>
>
>    int (*read_header)(struct AVFormatContext *,
>                       AVFormatParameters *ap);
># 374 "/usr/include/ffmpeg/libavformat/avformat.h"
>    int (*read_packet)(struct AVFormatContext *, AVPacket *pkt);
>
>
>
>
>
>    int (*read_close)(struct AVFormatContext *);
># 391 "/usr/include/ffmpeg/libavformat/avformat.h"
>    __attribute__((deprecated)) int (*read_seek)(struct AVFormatContext *,
>                                          int stream_index, int64_t timestamp, int flags);
>
>
>
>
>
>    int64_t (*read_timestamp)(struct AVFormatContext *s, int stream_index,
>                              int64_t *pos, int64_t pos_limit);
>
>
>
>
>    int flags;
>
>
>
>
>
>
>    const char *extensions;
>
>
>
>
>    int value;
>
>
>
>
>
>    int (*read_play)(struct AVFormatContext *);
>
>
>
>
>
>    int (*read_pause)(struct AVFormatContext *);
>
>    const struct AVCodecTag * const *codec_tag;
>
>
>
>
>
>
>
>    int (*read_seek2)(struct AVFormatContext *s, int stream_index, int64_t min_ts, int64_t ts, int64_t max_ts, int flags);
>
>
>    const AVMetadataConv *metadata_conv;
>
>
>    const AVClass *priv_class;
>
>
>    struct AVInputFormat *next;
>} AVInputFormat;
>
>enum AVStreamParseType {
>    AVSTREAM_PARSE_NONE,
>    AVSTREAM_PARSE_FULL,
>    AVSTREAM_PARSE_HEADERS,
>    AVSTREAM_PARSE_TIMESTAMPS,
>    AVSTREAM_PARSE_FULL_ONCE,
>};
>
>typedef struct AVIndexEntry {
>    int64_t pos;
>    int64_t timestamp;
>
>    int flags:2;
>    int size:30;
>    int min_distance;
>} AVIndexEntry;
># 491 "/usr/include/ffmpeg/libavformat/avformat.h"
>typedef struct AVStream {
>    int index;
>    int id;
>    AVCodecContext *codec;
># 503 "/usr/include/ffmpeg/libavformat/avformat.h"
>    AVRational r_frame_rate;
>    void *priv_data;
>
>
>    int64_t first_dts;
>
>
>
>
>    struct AVFrac pts;
># 521 "/usr/include/ffmpeg/libavformat/avformat.h"
>    AVRational time_base;
>    int pts_wrap_bits;
>
>    int stream_copy;
>    enum AVDiscard discard;
>
>
>
>
>
>
>    float quality;
># 542 "/usr/include/ffmpeg/libavformat/avformat.h"
>    int64_t start_time;
>
>
>
>
>
>
>    int64_t duration;
>
>
>    enum AVStreamParseType need_parsing;
>    struct AVCodecParserContext *parser;
>
>    int64_t cur_dts;
>    int last_IP_duration;
>    int64_t last_IP_pts;
>
>    AVIndexEntry *index_entries;
>
>    int nb_index_entries;
>    unsigned int index_entries_allocated_size;
>
>    int64_t nb_frames;
>
>    int disposition;
>
>    AVProbeData probe_data;
>
>    int64_t pts_buffer[16 +1];
>
>
>
>
>
>
>    AVRational sample_aspect_ratio;
>
>    AVDictionary *metadata;
>
>
>
>    const uint8_t *cur_ptr;
>    int cur_len;
>    AVPacket cur_pkt;
># 595 "/usr/include/ffmpeg/libavformat/avformat.h"
>    int64_t reference_dts;
>
>
>
>
>
>
>    int probe_packets;
>
>
>
>
>
>    struct AVPacketList *last_in_packet_buffer;
>
>
>
>
>    AVRational avg_frame_rate;
>
>
>
>
>    int codec_info_nb_frames;
>
>
>
>
>
>
>    int stream_identifier;
>
>
>
>
>
>    struct {
>        int64_t last_dts;
>        int64_t duration_gcd;
>        int duration_count;
>        double duration_error[(60*12+5)];
>        int64_t codec_info_duration;
>    } *info;
>
>
>
>
>
>    int request_probe;
>} AVStream;
># 654 "/usr/include/ffmpeg/libavformat/avformat.h"
>typedef struct AVProgram {
>    int id;
>    int flags;
>    enum AVDiscard discard;
>    unsigned int *stream_index;
>    unsigned int nb_stream_indexes;
>    AVDictionary *metadata;
>
>    int program_num;
>    int pmt_pid;
>    int pcr_pid;
>} AVProgram;
>
>
>
>
>typedef struct AVChapter {
>    int id;
>    AVRational time_base;
>    int64_t start, end;
>    AVDictionary *metadata;
>} AVChapter;
># 684 "/usr/include/ffmpeg/libavformat/avformat.h"
>typedef struct AVFormatContext {
>    const AVClass *av_class;
>
>    struct AVInputFormat *iformat;
>    struct AVOutputFormat *oformat;
>    void *priv_data;
>    AVIOContext *pb;
>    unsigned int nb_streams;
>    AVStream **streams;
>    char filename[1024];
>
>    int64_t timestamp;
>
>    int ctx_flags;
>
>
>
>
>
>
>    struct AVPacketList *packet_buffer;
>
>
>
>
>
>
>    int64_t start_time;
>
>
>
>
>
>
>
>    int64_t duration;
>
>
>
>
>    int64_t file_size;
>
>
>
>
>
>
>    int bit_rate;
>
>
>    AVStream *cur_st;
>
>
>    int64_t data_offset;
>
>    int mux_rate;
>    unsigned int packet_size;
>    int preload;
>    int max_delay;
>
>
>
>
>
>
>    int loop_output;
>
>    int flags;
># 767 "/usr/include/ffmpeg/libavformat/avformat.h"
>    int loop_input;
>
>
>
>
>    unsigned int probesize;
>
>
>
>
>
>    int max_analyze_duration;
>
>    const uint8_t *key;
>    int keylen;
>
>    unsigned int nb_programs;
>    AVProgram **programs;
>
>
>
>
>
>    enum CodecID video_codec_id;
>
>
>
>
>
>    enum CodecID audio_codec_id;
>
>
>
>
>
>    enum CodecID subtitle_codec_id;
># 814 "/usr/include/ffmpeg/libavformat/avformat.h"
>    unsigned int max_index_size;
>
>
>
>
>
>    unsigned int max_picture_buffer;
>
>    unsigned int nb_chapters;
>    AVChapter **chapters;
>
>
>
>
>    int debug;
># 837 "/usr/include/ffmpeg/libavformat/avformat.h"
>    struct AVPacketList *raw_packet_buffer;
>    struct AVPacketList *raw_packet_buffer_end;
>
>    struct AVPacketList *packet_buffer_end;
>
>    AVDictionary *metadata;
>
>
>
>
>
>
>    int raw_packet_buffer_remaining_size;
># 858 "/usr/include/ffmpeg/libavformat/avformat.h"
>    int64_t start_time_realtime;
>
>
>
>
>    int fps_probe_size;
>
>
>
>
>
>    int ts_id;
>} AVFormatContext;
>
>typedef struct AVPacketList {
>    AVPacket pkt;
>    struct AVPacketList *next;
>} AVPacketList;
>
>
>
>
>
>
>AVInputFormat *av_iformat_next(AVInputFormat *f);
>
>
>
>
>
>
>AVOutputFormat *av_oformat_next(AVOutputFormat *f);
>
>
>__attribute__((deprecated)) enum CodecID av_guess_image2_codec(const char *filename);
>
>
>
>
>
>
>void av_register_input_format(AVInputFormat *format);
>void av_register_output_format(AVOutputFormat *format);
># 914 "/usr/include/ffmpeg/libavformat/avformat.h"
>AVOutputFormat *av_guess_format(const char *short_name,
>                                const char *filename,
>                                const char *mime_type);
>
>
>
>
>enum CodecID av_guess_codec(AVOutputFormat *fmt, const char *short_name,
>                            const char *filename, const char *mime_type,
>                            enum AVMediaType type);
># 934 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_hex_dump(FILE *f, uint8_t *buf, int size);
># 948 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_hex_dump_log(void *avcl, int level, uint8_t *buf, int size);
># 958 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_pkt_dump2(FILE *f, AVPacket *pkt, int dump_payload, AVStream *st);
># 972 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_pkt_dump_log2(void *avcl, int level, AVPacket *pkt, int dump_payload,
>                      AVStream *st);
>
>
>__attribute__((deprecated)) void av_pkt_dump(FILE *f, AVPacket *pkt, int dump_payload);
>__attribute__((deprecated)) void av_pkt_dump_log(void *avcl, int level, AVPacket *pkt,
>                                          int dump_payload);
># 990 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_register_all(void);
># 999 "/usr/include/ffmpeg/libavformat/avformat.h"
>enum CodecID av_codec_get_id(const struct AVCodecTag * const *tags, unsigned int tag);
># 1008 "/usr/include/ffmpeg/libavformat/avformat.h"
>unsigned int av_codec_get_tag(const struct AVCodecTag * const *tags, enum CodecID id);
>
>
>
>
>
>
>AVInputFormat *av_find_input_format(const char *short_name);
>
>
>
>
>
>
>
>AVInputFormat *av_probe_input_format(AVProbeData *pd, int is_opened);
># 1036 "/usr/include/ffmpeg/libavformat/avformat.h"
>AVInputFormat *av_probe_input_format2(AVProbeData *pd, int is_opened, int *score_max);
># 1045 "/usr/include/ffmpeg/libavformat/avformat.h"
>AVInputFormat *av_probe_input_format3(AVProbeData *pd, int is_opened, int *score_ret);
># 1062 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_probe_input_buffer(AVIOContext *pb, AVInputFormat **fmt,
>                          const char *filename, void *logctx,
>                          unsigned int offset, unsigned int max_probe_size);
>
>
>
>
>
>
>
>__attribute__((deprecated)) int av_open_input_stream(AVFormatContext **ic_ptr,
>                         AVIOContext *pb, const char *filename,
>                         AVInputFormat *fmt, AVFormatParameters *ap);
># 1090 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated)) int av_open_input_file(AVFormatContext **ic_ptr, const char *filename,
>                       AVInputFormat *fmt,
>                       int buf_size,
>                       AVFormatParameters *ap);
># 1115 "/usr/include/ffmpeg/libavformat/avformat.h"
>int avformat_open_input(AVFormatContext **ps, const char *filename, AVInputFormat *fmt, AVDictionary **options);
>
>int av_demuxer_open(AVFormatContext *ic, AVFormatParameters *ap);
>
>
>
>
>
>
>AVFormatContext *avformat_alloc_context(void);
>
>
>
>
>
>__attribute__((deprecated))
>AVFormatContext *avformat_alloc_output_context(const char *format,
>                                               AVOutputFormat *oformat,
>                                               const char *filename);
># 1152 "/usr/include/ffmpeg/libavformat/avformat.h"
>int avformat_alloc_output_context2(AVFormatContext **ctx, AVOutputFormat *oformat,
>                                   const char *format_name, const char *filename);
># 1171 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_find_stream_info(AVFormatContext *ic);
># 1195 "/usr/include/ffmpeg/libavformat/avformat.h"
>int avformat_find_stream_info(AVFormatContext *ic, AVDictionary **options);
># 1221 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_find_best_stream(AVFormatContext *ic,
>                        enum AVMediaType type,
>                        int wanted_stream_nb,
>                        int related_stream,
>                        AVCodec **decoder_ret,
>                        int flags);
># 1238 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_read_packet(AVFormatContext *s, AVPacket *pkt);
># 1264 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_read_frame(AVFormatContext *s, AVPacket *pkt);
># 1277 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_seek_frame(AVFormatContext *s, int stream_index, int64_t timestamp,
>                  int flags);
># 1306 "/usr/include/ffmpeg/libavformat/avformat.h"
>int avformat_seek_file(AVFormatContext *s, int stream_index, int64_t min_ts, int64_t ts, int64_t max_ts, int flags);
>
>
>
>
>
>int av_read_play(AVFormatContext *s);
>
>
>
>
>
>
>int av_read_pause(AVFormatContext *s);
>
>
>
>
>
>void av_close_input_stream(AVFormatContext *s);
>
>
>
>
>
>
>void av_close_input_file(AVFormatContext *s);
>
>
>
>
>
>void avformat_free_context(AVFormatContext *s);
># 1350 "/usr/include/ffmpeg/libavformat/avformat.h"
>AVStream *av_new_stream(AVFormatContext *s, int id);
>AVProgram *av_new_program(AVFormatContext *s, int id);
># 1363 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_set_pts_info(AVStream *s, int pts_wrap_bits,
>                     unsigned int pts_num, unsigned int pts_den);
>
>
>
>
>
>
>int av_find_default_stream_index(AVFormatContext *s);
># 1381 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_index_search_timestamp(AVStream *st, int64_t timestamp, int flags);
>
>
>
>
>
>
>
>int av_add_index_entry(AVStream *st, int64_t pos, int64_t timestamp,
>                       int size, int distance, int flags);
># 1400 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_seek_frame_binary(AVFormatContext *s, int stream_index,
>                         int64_t target_ts, int flags);
># 1411 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_update_cur_dts(AVFormatContext *s, AVStream *ref_st, int64_t timestamp);
># 1420 "/usr/include/ffmpeg/libavformat/avformat.h"
>int64_t av_gen_search(AVFormatContext *s, int stream_index,
>                      int64_t target_ts, int64_t pos_min,
>                      int64_t pos_max, int64_t pos_limit,
>                      int64_t ts_min, int64_t ts_max,
>                      int flags, int64_t *ts_ret,
>                      int64_t (*read_timestamp)(struct AVFormatContext *, int , int64_t *, int64_t ));
># 1434 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated)) int av_set_parameters(AVFormatContext *s, AVFormatParameters *ap);
># 1456 "/usr/include/ffmpeg/libavformat/avformat.h"
>void av_url_split(char *proto, int proto_size,
>                  char *authorization, int authorization_size,
>                  char *hostname, int hostname_size,
>                  int *port_ptr,
>                  char *path, int path_size,
>                  const char *url);
># 1478 "/usr/include/ffmpeg/libavformat/avformat.h"
>int avformat_write_header(AVFormatContext *s, AVDictionary **options);
># 1492 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated)) int av_write_header(AVFormatContext *s);
># 1507 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_write_frame(AVFormatContext *s, AVPacket *pkt);
># 1524 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_interleaved_write_frame(AVFormatContext *s, AVPacket *pkt);
># 1541 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_interleave_packet_per_dts(AVFormatContext *s, AVPacket *out,
>                                 AVPacket *pkt, int flush);
># 1553 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_write_trailer(AVFormatContext *s);
>
>
>
>
>
>__attribute__((deprecated)) void dump_format(AVFormatContext *ic,
>                                      int index,
>                                      const char *url,
>                                      int is_output);
>
>
>void av_dump_format(AVFormatContext *ic,
>                    int index,
>                    const char *url,
>                    int is_output);
># 1578 "/usr/include/ffmpeg/libavformat/avformat.h"
>__attribute__((deprecated))
>int64_t parse_date(const char *datestr, int duration);
>
>
>
>
>
>int64_t av_gettime(void);
>
>
>
>
>
>__attribute__((deprecated)) int find_info_tag(char *arg, int arg_size, const char *tag1, const char *info);
># 1606 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_get_frame_filename(char *buf, int buf_size,
>                          const char *path, int number);
>
>
>
>
>
>
>
>int av_filename_number_test(const char *filename);
># 1631 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_sdp_create(AVFormatContext *ac[], int n_files, char *buf, int size);
>
>
>__attribute__((deprecated)) int avf_sdp_create(AVFormatContext *ac[], int n_files, char *buff, int size);
># 1643 "/usr/include/ffmpeg/libavformat/avformat.h"
>int av_match_ext(const char *filename, const char *extensions);
># 26 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.h" 2
>
># 1 "/usr/include/ffmpeg/libavutil/mathematics.h" 1
># 28 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.h" 2
>
>
>
>}
>
>
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 1
># 10 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h"
># 1 "/usr/include/QtCore/QList" 1
># 1 "/usr/include/QtCore/qlist.h" 1
># 1 "/usr/include/QtCore/QList" 2
># 11 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
># 1 "/usr/include/QtCore/QStringList" 1
># 12 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
># 1 "/usr/include/QtCore/QUrl" 1
># 13 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
># 1 "/usr/include/QtCore/QList" 1
># 14 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
># 1 "/usr/include/QtGui/QPixmap" 1
># 1 "/usr/include/QtGui/qpixmap.h" 1
># 45 "/usr/include/QtGui/qpixmap.h"
># 1 "/usr/include/QtGui/qpaintdevice.h" 1 3 4
># 45 "/usr/include/QtGui/qpaintdevice.h" 3 4
># 1 "/usr/include/QtGui/qwindowdefs.h" 1 3 4
># 48 "/usr/include/QtGui/qwindowdefs.h" 3 4
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>
>
>class QPaintDevice;
>class QWidget;
>class QDialog;
>class QColor;
>class QPalette;
>
>
>
>class QCursor;
>class QPoint;
>class QSize;
>class QRect;
>class QPolygon;
>class QPainter;
>class QRegion;
>class QFont;
>class QFontMetrics;
>class QFontInfo;
>class QPen;
>class QBrush;
>class QMatrix;
>class QPixmap;
>class QBitmap;
>class QMovie;
>class QImage;
>class QPicture;
>class QPrinter;
>class QTimer;
>class QTime;
>class QClipboard;
>class QString;
>class QByteArray;
>class QApplication;
>
>template<typename T> class QList;
>typedef QList<QWidget *> QWidgetList;
># 115 "/usr/include/QtGui/qwindowdefs.h" 3 4
>typedef struct _XDisplay Display;
>typedef union _XEvent XEvent;
>typedef struct _XGC *GC;
>typedef struct _XRegion *Region;
>typedef unsigned long WId;
># 145 "/usr/include/QtGui/qwindowdefs.h" 3 4
>
>
>
>template<class K, class V> class QHash;
>typedef QHash<WId, QWidget *> QWidgetMapper;
>
>template<class V> class QSet;
>typedef QSet<QWidget *> QWidgetSet;
># 46 "/usr/include/QtGui/qpaintdevice.h" 2 3 4
># 1 "/usr/include/QtCore/qrect.h" 1 3 4
># 45 "/usr/include/QtCore/qrect.h" 3 4
># 1 "/usr/include/QtCore/qsize.h" 1 3 4
># 47 "/usr/include/QtCore/qsize.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class __attribute__((visibility("default"))) QSize
>{
>public:
>    QSize();
>    QSize(int w, int h);
>
>    bool isNull() const;
>    bool isEmpty() const;
>    bool isValid() const;
>
>    int width() const;
>    int height() const;
>    void setWidth(int w);
>    void setHeight(int h);
>    void transpose();
>
>    void scale(int w, int h, Qt::AspectRatioMode mode);
>    void scale(const QSize &s, Qt::AspectRatioMode mode);
>
>    QSize expandedTo(const QSize &) const;
>    QSize boundedTo(const QSize &) const;
>
>    int &rwidth();
>    int &rheight();
>
>    QSize &operator+=(const QSize &);
>    QSize &operator-=(const QSize &);
>    QSize &operator*=(qreal c);
>    QSize &operator/=(qreal c);
>
>    friend inline bool operator==(const QSize &, const QSize &);
>    friend inline bool operator!=(const QSize &, const QSize &);
>    friend inline const QSize operator+(const QSize &, const QSize &);
>    friend inline const QSize operator-(const QSize &, const QSize &);
>    friend inline const QSize operator*(const QSize &, qreal);
>    friend inline const QSize operator*(qreal, const QSize &);
>    friend inline const QSize operator/(const QSize &, qreal);
>
>private:
>    int wd;
>    int ht;
>};
>template<> class QTypeInfo<QSize > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QSize)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QSize"; } };
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QSize &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QSize &);
>
>
>
>
>
>
>
>inline QSize::QSize()
>{ wd = ht = -1; }
>
>inline QSize::QSize(int w, int h)
>{ wd = w; ht = h; }
>
>inline bool QSize::isNull() const
>{ return wd==0 && ht==0; }
>
>inline bool QSize::isEmpty() const
>{ return wd<1 || ht<1; }
>
>inline bool QSize::isValid() const
>{ return wd>=0 && ht>=0; }
>
>inline int QSize::width() const
>{ return wd; }
>
>inline int QSize::height() const
>{ return ht; }
>
>inline void QSize::setWidth(int w)
>{ wd = w; }
>
>inline void QSize::setHeight(int h)
>{ ht = h; }
>
>inline void QSize::scale(int w, int h, Qt::AspectRatioMode mode)
>{ scale(QSize(w, h), mode); }
>
>inline int &QSize::rwidth()
>{ return wd; }
>
>inline int &QSize::rheight()
>{ return ht; }
>
>inline QSize &QSize::operator+=(const QSize &s)
>{ wd+=s.wd; ht+=s.ht; return *this; }
>
>inline QSize &QSize::operator-=(const QSize &s)
>{ wd-=s.wd; ht-=s.ht; return *this; }
>
>inline QSize &QSize::operator*=(qreal c)
>{ wd = qRound(wd*c); ht = qRound(ht*c); return *this; }
>
>inline bool operator==(const QSize &s1, const QSize &s2)
>{ return s1.wd == s2.wd && s1.ht == s2.ht; }
>
>inline bool operator!=(const QSize &s1, const QSize &s2)
>{ return s1.wd != s2.wd || s1.ht != s2.ht; }
>
>inline const QSize operator+(const QSize & s1, const QSize & s2)
>{ return QSize(s1.wd+s2.wd, s1.ht+s2.ht); }
>
>inline const QSize operator-(const QSize &s1, const QSize &s2)
>{ return QSize(s1.wd-s2.wd, s1.ht-s2.ht); }
>
>inline const QSize operator*(const QSize &s, qreal c)
>{ return QSize(qRound(s.wd*c), qRound(s.ht*c)); }
>
>inline const QSize operator*(qreal c, const QSize &s)
>{ return QSize(qRound(s.wd*c), qRound(s.ht*c)); }
>
>inline QSize &QSize::operator/=(qreal c)
>{
>    qt_noop();
>    wd = qRound(wd/c); ht = qRound(ht/c);
>    return *this;
>}
>
>inline const QSize operator/(const QSize &s, qreal c)
>{
>    qt_noop();
>    return QSize(qRound(s.wd/c), qRound(s.ht/c));
>}
>
>inline QSize QSize::expandedTo(const QSize & otherSize) const
>{
>    return QSize(qMax(wd,otherSize.wd), qMax(ht,otherSize.ht));
>}
>
>inline QSize QSize::boundedTo(const QSize & otherSize) const
>{
>    return QSize(qMin(wd,otherSize.wd), qMin(ht,otherSize.ht));
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QSize &);
>
>
>
>class __attribute__((visibility("default"))) QSizeF
>{
>public:
>    QSizeF();
>    QSizeF(const QSize &sz);
>    QSizeF(qreal w, qreal h);
>
>    bool isNull() const;
>    bool isEmpty() const;
>    bool isValid() const;
>
>    qreal width() const;
>    qreal height() const;
>    void setWidth(qreal w);
>    void setHeight(qreal h);
>    void transpose();
>
>    void scale(qreal w, qreal h, Qt::AspectRatioMode mode);
>    void scale(const QSizeF &s, Qt::AspectRatioMode mode);
>
>    QSizeF expandedTo(const QSizeF &) const;
>    QSizeF boundedTo(const QSizeF &) const;
>
>    qreal &rwidth();
>    qreal &rheight();
>
>    QSizeF &operator+=(const QSizeF &);
>    QSizeF &operator-=(const QSizeF &);
>    QSizeF &operator*=(qreal c);
>    QSizeF &operator/=(qreal c);
>
>    friend inline bool operator==(const QSizeF &, const QSizeF &);
>    friend inline bool operator!=(const QSizeF &, const QSizeF &);
>    friend inline const QSizeF operator+(const QSizeF &, const QSizeF &);
>    friend inline const QSizeF operator-(const QSizeF &, const QSizeF &);
>    friend inline const QSizeF operator*(const QSizeF &, qreal);
>    friend inline const QSizeF operator*(qreal, const QSizeF &);
>    friend inline const QSizeF operator/(const QSizeF &, qreal);
>
>    inline QSize toSize() const;
>
>private:
>    qreal wd;
>    qreal ht;
>};
>template<> class QTypeInfo<QSizeF > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QSizeF)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QSizeF"; } };
>
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QSizeF &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QSizeF &);
>
>
>
>
>
>
>
>inline QSizeF::QSizeF()
>{ wd = ht = -1.; }
>
>inline QSizeF::QSizeF(const QSize &sz)
>    : wd(sz.width()), ht(sz.height())
>{
>}
>
>inline QSizeF::QSizeF(qreal w, qreal h)
>{ wd = w; ht = h; }
>
>inline bool QSizeF::isNull() const
>{ return qIsNull(wd) && qIsNull(ht); }
>
>inline bool QSizeF::isEmpty() const
>{ return wd <= 0. || ht <= 0.; }
>
>inline bool QSizeF::isValid() const
>{ return wd >= 0. && ht >= 0.; }
>
>inline qreal QSizeF::width() const
>{ return wd; }
>
>inline qreal QSizeF::height() const
>{ return ht; }
>
>inline void QSizeF::setWidth(qreal w)
>{ wd = w; }
>
>inline void QSizeF::setHeight(qreal h)
>{ ht = h; }
>
>inline void QSizeF::scale(qreal w, qreal h, Qt::AspectRatioMode mode)
>{ scale(QSizeF(w, h), mode); }
>
>inline qreal &QSizeF::rwidth()
>{ return wd; }
>
>inline qreal &QSizeF::rheight()
>{ return ht; }
>
>inline QSizeF &QSizeF::operator+=(const QSizeF &s)
>{ wd += s.wd; ht += s.ht; return *this; }
>
>inline QSizeF &QSizeF::operator-=(const QSizeF &s)
>{ wd -= s.wd; ht -= s.ht; return *this; }
>
>inline QSizeF &QSizeF::operator*=(qreal c)
>{ wd *= c; ht *= c; return *this; }
>
>inline bool operator==(const QSizeF &s1, const QSizeF &s2)
>{ return qFuzzyCompare(s1.wd, s2.wd) && qFuzzyCompare(s1.ht, s2.ht); }
>
>inline bool operator!=(const QSizeF &s1, const QSizeF &s2)
>{ return !qFuzzyCompare(s1.wd, s2.wd) || !qFuzzyCompare(s1.ht, s2.ht); }
>
>inline const QSizeF operator+(const QSizeF & s1, const QSizeF & s2)
>{ return QSizeF(s1.wd+s2.wd, s1.ht+s2.ht); }
>
>inline const QSizeF operator-(const QSizeF &s1, const QSizeF &s2)
>{ return QSizeF(s1.wd-s2.wd, s1.ht-s2.ht); }
>
>inline const QSizeF operator*(const QSizeF &s, qreal c)
>{ return QSizeF(s.wd*c, s.ht*c); }
>
>inline const QSizeF operator*(qreal c, const QSizeF &s)
>{ return QSizeF(s.wd*c, s.ht*c); }
>
>inline QSizeF &QSizeF::operator/=(qreal c)
>{
>    qt_noop();
>    wd = wd/c; ht = ht/c;
>    return *this;
>}
>
>inline const QSizeF operator/(const QSizeF &s, qreal c)
>{
>    qt_noop();
>    return QSizeF(s.wd/c, s.ht/c);
>}
>
>inline QSizeF QSizeF::expandedTo(const QSizeF & otherSize) const
>{
>    return QSizeF(qMax(wd,otherSize.wd), qMax(ht,otherSize.ht));
>}
>
>inline QSizeF QSizeF::boundedTo(const QSizeF & otherSize) const
>{
>    return QSizeF(qMin(wd,otherSize.wd), qMin(ht,otherSize.ht));
>}
>
>inline QSize QSizeF::toSize() const
>{
>    return QSize(qRound(wd), qRound(ht));
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QSizeF &);
># 46 "/usr/include/QtCore/qrect.h" 2 3 4
># 1 "/usr/include/QtCore/qpoint.h" 1 3 4
># 47 "/usr/include/QtCore/qpoint.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class __attribute__((visibility("default"))) QPoint
>{
>public:
>    QPoint();
>    QPoint(int xpos, int ypos);
>
>    bool isNull() const;
>
>    int x() const;
>    int y() const;
>    void setX(int x);
>    void setY(int y);
>
>    int manhattanLength() const;
>
>    int &rx();
>    int &ry();
>
>    QPoint &operator+=(const QPoint &p);
>    QPoint &operator-=(const QPoint &p);
>
>    QPoint &operator*=(float c);
>    QPoint &operator*=(double c);
>    QPoint &operator*=(int c);
>
>    QPoint &operator/=(qreal c);
>
>    friend inline bool operator==(const QPoint &, const QPoint &);
>    friend inline bool operator!=(const QPoint &, const QPoint &);
>    friend inline const QPoint operator+(const QPoint &, const QPoint &);
>    friend inline const QPoint operator-(const QPoint &, const QPoint &);
>    friend inline const QPoint operator*(const QPoint &, float);
>    friend inline const QPoint operator*(float, const QPoint &);
>    friend inline const QPoint operator*(const QPoint &, double);
>    friend inline const QPoint operator*(double, const QPoint &);
>    friend inline const QPoint operator*(const QPoint &, int);
>    friend inline const QPoint operator*(int, const QPoint &);
>    friend inline const QPoint operator-(const QPoint &);
>    friend inline const QPoint operator/(const QPoint &, qreal);
>
>private:
>    friend class QTransform;
>
>
>
>
>
>    int xp;
>    int yp;
>
>};
>
>template<> class QTypeInfo<QPoint > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QPoint)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QPoint"; } };
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QPoint &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPoint &);
>
>
>
>
>
>
>inline QPoint::QPoint()
>{ xp=0; yp=0; }
>
>inline QPoint::QPoint(int xpos, int ypos)
>{ xp = xpos; yp = ypos; }
>
>inline bool QPoint::isNull() const
>{ return xp == 0 && yp == 0; }
>
>inline int QPoint::x() const
>{ return xp; }
>
>inline int QPoint::y() const
>{ return yp; }
>
>inline void QPoint::setX(int xpos)
>{ xp = xpos; }
>
>inline void QPoint::setY(int ypos)
>{ yp = ypos; }
>
>inline int &QPoint::rx()
>{ return xp; }
>
>inline int &QPoint::ry()
>{ return yp; }
>
>inline QPoint &QPoint::operator+=(const QPoint &p)
>{ xp+=p.xp; yp+=p.yp; return *this; }
>
>inline QPoint &QPoint::operator-=(const QPoint &p)
>{ xp-=p.xp; yp-=p.yp; return *this; }
>
>inline QPoint &QPoint::operator*=(float c)
>{ xp = qRound(xp*c); yp = qRound(yp*c); return *this; }
>
>inline QPoint &QPoint::operator*=(double c)
>{ xp = qRound(xp*c); yp = qRound(yp*c); return *this; }
>
>inline QPoint &QPoint::operator*=(int c)
>{ xp = xp*c; yp = yp*c; return *this; }
>
>inline bool operator==(const QPoint &p1, const QPoint &p2)
>{ return p1.xp == p2.xp && p1.yp == p2.yp; }
>
>inline bool operator!=(const QPoint &p1, const QPoint &p2)
>{ return p1.xp != p2.xp || p1.yp != p2.yp; }
>
>inline const QPoint operator+(const QPoint &p1, const QPoint &p2)
>{ return QPoint(p1.xp+p2.xp, p1.yp+p2.yp); }
>
>inline const QPoint operator-(const QPoint &p1, const QPoint &p2)
>{ return QPoint(p1.xp-p2.xp, p1.yp-p2.yp); }
>
>inline const QPoint operator*(const QPoint &p, float c)
>{ return QPoint(qRound(p.xp*c), qRound(p.yp*c)); }
>
>inline const QPoint operator*(const QPoint &p, double c)
>{ return QPoint(qRound(p.xp*c), qRound(p.yp*c)); }
>
>inline const QPoint operator*(const QPoint &p, int c)
>{ return QPoint(p.xp*c, p.yp*c); }
>
>inline const QPoint operator*(float c, const QPoint &p)
>{ return QPoint(qRound(p.xp*c), qRound(p.yp*c)); }
>
>inline const QPoint operator*(double c, const QPoint &p)
>{ return QPoint(qRound(p.xp*c), qRound(p.yp*c)); }
>
>inline const QPoint operator*(int c, const QPoint &p)
>{ return QPoint(p.xp*c, p.yp*c); }
>
>inline const QPoint operator-(const QPoint &p)
>{ return QPoint(-p.xp, -p.yp); }
>
>inline QPoint &QPoint::operator/=(qreal c)
>{
>    xp = qRound(xp/c);
>    yp = qRound(yp/c);
>    return *this;
>}
>
>inline const QPoint operator/(const QPoint &p, qreal c)
>{
>    return QPoint(qRound(p.xp/c), qRound(p.yp/c));
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QPoint &);
>
>
>
>
>
>
>class __attribute__((visibility("default"))) QPointF
>{
>public:
>    QPointF();
>    QPointF(const QPoint &p);
>    QPointF(qreal xpos, qreal ypos);
>
>    qreal manhattanLength() const;
>
>    bool isNull() const;
>
>    qreal x() const;
>    qreal y() const;
>    void setX(qreal x);
>    void setY(qreal y);
>
>    qreal &rx();
>    qreal &ry();
>
>    QPointF &operator+=(const QPointF &p);
>    QPointF &operator-=(const QPointF &p);
>    QPointF &operator*=(qreal c);
>    QPointF &operator/=(qreal c);
>
>    friend inline bool operator==(const QPointF &, const QPointF &);
>    friend inline bool operator!=(const QPointF &, const QPointF &);
>    friend inline const QPointF operator+(const QPointF &, const QPointF &);
>    friend inline const QPointF operator-(const QPointF &, const QPointF &);
>    friend inline const QPointF operator*(qreal, const QPointF &);
>    friend inline const QPointF operator*(const QPointF &, qreal);
>    friend inline const QPointF operator-(const QPointF &);
>    friend inline const QPointF operator/(const QPointF &, qreal);
>
>    QPoint toPoint() const;
>
>private:
>    friend class QMatrix;
>    friend class QTransform;
>
>    qreal xp;
>    qreal yp;
>};
>
>template<> class QTypeInfo<QPointF > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QPointF)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QPointF"; } };
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QPointF &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPointF &);
>
>
>
>
>
>
>inline QPointF::QPointF() : xp(0), yp(0) { }
>
>inline QPointF::QPointF(qreal xpos, qreal ypos) : xp(xpos), yp(ypos) { }
>
>inline QPointF::QPointF(const QPoint &p) : xp(p.x()), yp(p.y()) { }
>
>inline bool QPointF::isNull() const
>{
>    return qIsNull(xp) && qIsNull(yp);
>}
>
>inline qreal QPointF::x() const
>{
>    return xp;
>}
>
>inline qreal QPointF::y() const
>{
>    return yp;
>}
>
>inline void QPointF::setX(qreal xpos)
>{
>    xp = xpos;
>}
>
>inline void QPointF::setY(qreal ypos)
>{
>    yp = ypos;
>}
>
>inline qreal &QPointF::rx()
>{
>    return xp;
>}
>
>inline qreal &QPointF::ry()
>{
>    return yp;
>}
>
>inline QPointF &QPointF::operator+=(const QPointF &p)
>{
>    xp+=p.xp;
>    yp+=p.yp;
>    return *this;
>}
>
>inline QPointF &QPointF::operator-=(const QPointF &p)
>{
>    xp-=p.xp; yp-=p.yp; return *this;
>}
>
>inline QPointF &QPointF::operator*=(qreal c)
>{
>    xp*=c; yp*=c; return *this;
>}
>
>inline bool operator==(const QPointF &p1, const QPointF &p2)
>{
>    return qFuzzyIsNull(p1.xp - p2.xp) && qFuzzyIsNull(p1.yp - p2.yp);
>}
>
>inline bool operator!=(const QPointF &p1, const QPointF &p2)
>{
>    return !qFuzzyIsNull(p1.xp - p2.xp) || !qFuzzyIsNull(p1.yp - p2.yp);
>}
>
>inline const QPointF operator+(const QPointF &p1, const QPointF &p2)
>{
>    return QPointF(p1.xp+p2.xp, p1.yp+p2.yp);
>}
>
>inline const QPointF operator-(const QPointF &p1, const QPointF &p2)
>{
>    return QPointF(p1.xp-p2.xp, p1.yp-p2.yp);
>}
>
>inline const QPointF operator*(const QPointF &p, qreal c)
>{
>    return QPointF(p.xp*c, p.yp*c);
>}
>
>inline const QPointF operator*(qreal c, const QPointF &p)
>{
>    return QPointF(p.xp*c, p.yp*c);
>}
>
>inline const QPointF operator-(const QPointF &p)
>{
>    return QPointF(-p.xp, -p.yp);
>}
>
>inline QPointF &QPointF::operator/=(qreal c)
>{
>    xp/=c;
>    yp/=c;
>    return *this;
>}
>
>inline const QPointF operator/(const QPointF &p, qreal c)
>{
>    return QPointF(p.xp/c, p.yp/c);
>}
>
>inline QPoint QPointF::toPoint() const
>{
>    return QPoint(qRound(xp), qRound(yp));
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug d, const QPointF &p);
># 47 "/usr/include/QtCore/qrect.h" 2 3 4
># 56 "/usr/include/QtCore/qrect.h" 3 4
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>class __attribute__((visibility("default"))) QRect
>{
>public:
>    QRect() { x1 = y1 = 0; x2 = y2 = -1; }
>    QRect(const QPoint &topleft, const QPoint &bottomright);
>    QRect(const QPoint &topleft, const QSize &size);
>    QRect(int left, int top, int width, int height);
>
>    bool isNull() const;
>    bool isEmpty() const;
>    bool isValid() const;
>
>    int left() const;
>    int top() const;
>    int right() const;
>    int bottom() const;
>    QRect normalized() const;
># 85 "/usr/include/QtCore/qrect.h" 3 4
>    int x() const;
>    int y() const;
>    void setLeft(int pos);
>    void setTop(int pos);
>    void setRight(int pos);
>    void setBottom(int pos);
>    void setX(int x);
>    void setY(int y);
>
>    void setTopLeft(const QPoint &p);
>    void setBottomRight(const QPoint &p);
>    void setTopRight(const QPoint &p);
>    void setBottomLeft(const QPoint &p);
>
>    QPoint topLeft() const;
>    QPoint bottomRight() const;
>    QPoint topRight() const;
>    QPoint bottomLeft() const;
>    QPoint center() const;
>
>    void moveLeft(int pos);
>    void moveTop(int pos);
>    void moveRight(int pos);
>    void moveBottom(int pos);
>    void moveTopLeft(const QPoint &p);
>    void moveBottomRight(const QPoint &p);
>    void moveTopRight(const QPoint &p);
>    void moveBottomLeft(const QPoint &p);
>    void moveCenter(const QPoint &p);
>
>    inline void translate(int dx, int dy);
>    inline void translate(const QPoint &p);
>    inline QRect translated(int dx, int dy) const;
>    inline QRect translated(const QPoint &p) const;
>
>    void moveTo(int x, int t);
>    void moveTo(const QPoint &p);
>
>
>
>
>
>
>    void setRect(int x, int y, int w, int h);
>    inline void getRect(int *x, int *y, int *w, int *h) const;
>
>    void setCoords(int x1, int y1, int x2, int y2);
>
>
>
>    inline void getCoords(int *x1, int *y1, int *x2, int *y2) const;
>
>    inline void adjust(int x1, int y1, int x2, int y2);
>    inline QRect adjusted(int x1, int y1, int x2, int y2) const;
>
>    QSize size() const;
>    int width() const;
>    int height() const;
>    void setWidth(int w);
>    void setHeight(int h);
>    void setSize(const QSize &s);
>
>    QRect operator|(const QRect &r) const;
>    QRect operator&(const QRect &r) const;
>    QRect& operator|=(const QRect &r);
>    QRect& operator&=(const QRect &r);
>
>    bool contains(const QPoint &p, bool proper=false) const;
>    bool contains(int x, int y) const;
>    bool contains(int x, int y, bool proper) const;
>    bool contains(const QRect &r, bool proper = false) const;
>    QRect unite(const QRect &r) const;
>    QRect united(const QRect &other) const;
>    QRect intersect(const QRect &r) const;
>    QRect intersected(const QRect &other) const;
>    bool intersects(const QRect &r) const;
>
>    friend __attribute__((visibility("default"))) inline bool operator==(const QRect &, const QRect &);
>    friend __attribute__((visibility("default"))) inline bool operator!=(const QRect &, const QRect &);
>
>
>
>
>
>
>
>private:
>
>    friend void qt_setCoords(QRect *r, int xp1, int yp1, int xp2, int yp2);
># 182 "/usr/include/QtCore/qrect.h" 3 4
>    int x1;
>    int y1;
>    int x2;
>    int y2;
>
>
>};
>template<> class QTypeInfo<QRect > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QRect)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QRect"; } };
>
>__attribute__((visibility("default"))) inline bool operator==(const QRect &, const QRect &);
>__attribute__((visibility("default"))) inline bool operator!=(const QRect &, const QRect &);
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QRect &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QRect &);
>
>
>
>
>
>
>inline QRect::QRect(int aleft, int atop, int awidth, int aheight)
>{
>    x1 = aleft;
>    y1 = atop;
>    x2 = (aleft + awidth - 1);
>    y2 = (atop + aheight - 1);
>}
>
>inline QRect::QRect(const QPoint &atopLeft, const QPoint &abottomRight)
>{
>    x1 = atopLeft.x();
>    y1 = atopLeft.y();
>    x2 = abottomRight.x();
>    y2 = abottomRight.y();
>}
>
>inline QRect::QRect(const QPoint &atopLeft, const QSize &asize)
>{
>    x1 = atopLeft.x();
>    y1 = atopLeft.y();
>    x2 = (x1+asize.width() - 1);
>    y2 = (y1+asize.height() - 1);
>}
>
>inline bool QRect::isNull() const
>{ return x2 == x1 - 1 && y2 == y1 - 1; }
>
>inline bool QRect::isEmpty() const
>{ return x1 > x2 || y1 > y2; }
>
>inline bool QRect::isValid() const
>{ return x1 <= x2 && y1 <= y2; }
>
>inline int QRect::left() const
>{ return x1; }
>
>inline int QRect::top() const
>{ return y1; }
>
>inline int QRect::right() const
>{ return x2; }
>
>inline int QRect::bottom() const
>{ return y2; }
>
>inline int QRect::x() const
>{ return x1; }
>
>inline int QRect::y() const
>{ return y1; }
>
>inline void QRect::setLeft(int pos)
>{ x1 = pos; }
>
>inline void QRect::setTop(int pos)
>{ y1 = pos; }
>
>inline void QRect::setRight(int pos)
>{ x2 = pos; }
>
>inline void QRect::setBottom(int pos)
>{ y2 = pos; }
>
>inline void QRect::setTopLeft(const QPoint &p)
>{ x1 = p.x(); y1 = p.y(); }
>
>inline void QRect::setBottomRight(const QPoint &p)
>{ x2 = p.x(); y2 = p.y(); }
>
>inline void QRect::setTopRight(const QPoint &p)
>{ x2 = p.x(); y1 = p.y(); }
>
>inline void QRect::setBottomLeft(const QPoint &p)
>{ x1 = p.x(); y2 = p.y(); }
>
>inline void QRect::setX(int ax)
>{ x1 = ax; }
>
>inline void QRect::setY(int ay)
>{ y1 = ay; }
>
>inline QPoint QRect::topLeft() const
>{ return QPoint(x1, y1); }
>
>inline QPoint QRect::bottomRight() const
>{ return QPoint(x2, y2); }
>
>inline QPoint QRect::topRight() const
>{ return QPoint(x2, y1); }
>
>inline QPoint QRect::bottomLeft() const
>{ return QPoint(x1, y2); }
>
>inline QPoint QRect::center() const
>{ return QPoint((x1+x2)/2, (y1+y2)/2); }
>
>inline int QRect::width() const
>{ return x2 - x1 + 1; }
>
>inline int QRect::height() const
>{ return y2 - y1 + 1; }
>
>inline QSize QRect::size() const
>{ return QSize(width(), height()); }
>
>inline void QRect::translate(int dx, int dy)
>{
>    x1 += dx;
>    y1 += dy;
>    x2 += dx;
>    y2 += dy;
>}
>
>inline void QRect::translate(const QPoint &p)
>{
>    x1 += p.x();
>    y1 += p.y();
>    x2 += p.x();
>    y2 += p.y();
>}
>
>inline QRect QRect::translated(int dx, int dy) const
>{ return QRect(QPoint(x1 + dx, y1 + dy), QPoint(x2 + dx, y2 + dy)); }
>
>inline QRect QRect::translated(const QPoint &p) const
>{ return QRect(QPoint(x1 + p.x(), y1 + p.y()), QPoint(x2 + p.x(), y2 + p.y())); }
>
>inline void QRect::moveTo(int ax, int ay)
>{
>    x2 += ax - x1;
>    y2 += ay - y1;
>    x1 = ax;
>    y1 = ay;
>}
>
>inline void QRect::moveTo(const QPoint &p)
>{
>    x2 += p.x() - x1;
>    y2 += p.y() - y1;
>    x1 = p.x();
>    y1 = p.y();
>}
>
>inline void QRect::moveLeft(int pos)
>{ x2 += (pos - x1); x1 = pos; }
>
>inline void QRect::moveTop(int pos)
>{ y2 += (pos - y1); y1 = pos; }
>
>inline void QRect::moveRight(int pos)
>{
>    x1 += (pos - x2);
>    x2 = pos;
>}
>
>inline void QRect::moveBottom(int pos)
>{
>    y1 += (pos - y2);
>    y2 = pos;
>}
>
>inline void QRect::moveTopLeft(const QPoint &p)
>{
>    moveLeft(p.x());
>    moveTop(p.y());
>}
>
>inline void QRect::moveBottomRight(const QPoint &p)
>{
>    moveRight(p.x());
>    moveBottom(p.y());
>}
>
>inline void QRect::moveTopRight(const QPoint &p)
>{
>    moveRight(p.x());
>    moveTop(p.y());
>}
>
>inline void QRect::moveBottomLeft(const QPoint &p)
>{
>    moveLeft(p.x());
>    moveBottom(p.y());
>}
>
>inline void QRect::getRect(int *ax, int *ay, int *aw, int *ah) const
>{
>    *ax = x1;
>    *ay = y1;
>    *aw = x2 - x1 + 1;
>    *ah = y2 - y1 + 1;
>}
>
>inline void QRect::setRect(int ax, int ay, int aw, int ah)
>{
>    x1 = ax;
>    y1 = ay;
>    x2 = (ax + aw - 1);
>    y2 = (ay + ah - 1);
>}
>
>inline void QRect::getCoords(int *xp1, int *yp1, int *xp2, int *yp2) const
>{
>    *xp1 = x1;
>    *yp1 = y1;
>    *xp2 = x2;
>    *yp2 = y2;
>}
>
>inline void QRect::setCoords(int xp1, int yp1, int xp2, int yp2)
>{
>    x1 = xp1;
>    y1 = yp1;
>    x2 = xp2;
>    y2 = yp2;
>}
># 431 "/usr/include/QtCore/qrect.h" 3 4
>inline QRect QRect::adjusted(int xp1, int yp1, int xp2, int yp2) const
>{ return QRect(QPoint(x1 + xp1, y1 + yp1), QPoint(x2 + xp2, y2 + yp2)); }
>
>inline void QRect::adjust(int dx1, int dy1, int dx2, int dy2)
>{
>    x1 += dx1;
>    y1 += dy1;
>    x2 += dx2;
>    y2 += dy2;
>}
>
>inline void QRect::setWidth(int w)
>{ x2 = (x1 + w - 1); }
>
>inline void QRect::setHeight(int h)
>{ y2 = (y1 + h - 1); }
>
>inline void QRect::setSize(const QSize &s)
>{
>    x2 = (s.width() + x1 - 1);
>    y2 = (s.height() + y1 - 1);
>}
>
>inline bool QRect::contains(int ax, int ay, bool aproper) const
>{
>    return contains(QPoint(ax, ay), aproper);
>}
>
>inline bool QRect::contains(int ax, int ay) const
>{
>    return contains(QPoint(ax, ay), false);
>}
>
>inline QRect& QRect::operator|=(const QRect &r)
>{
>    *this = *this | r;
>    return *this;
>}
>
>inline QRect& QRect::operator&=(const QRect &r)
>{
>    *this = *this & r;
>    return *this;
>}
>
>inline QRect QRect::intersect(const QRect &r) const
>{
>    return *this & r;
>}
>
>inline QRect QRect::intersected(const QRect &other) const
>{
>    return intersect(other);
>}
>
>inline QRect QRect::unite(const QRect &r) const
>{
>    return *this | r;
>}
>
>inline QRect QRect::united(const QRect &r) const
>{
>     return unite(r);
>}
>
>inline bool operator==(const QRect &r1, const QRect &r2)
>{
>    return r1.x1==r2.x1 && r1.x2==r2.x2 && r1.y1==r2.y1 && r1.y2==r2.y2;
>}
>
>inline bool operator!=(const QRect &r1, const QRect &r2)
>{
>    return r1.x1!=r2.x1 || r1.x2!=r2.x2 || r1.y1!=r2.y1 || r1.y2!=r2.y2;
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QRect &);
>
>
>
>class __attribute__((visibility("default"))) QRectF
>{
>public:
>    QRectF() { xp = yp = 0.; w = h = 0.; }
>    QRectF(const QPointF &topleft, const QSizeF &size);
>    QRectF(const QPointF &topleft, const QPointF &bottomRight);
>    QRectF(qreal left, qreal top, qreal width, qreal height);
>    QRectF(const QRect &rect);
>
>    bool isNull() const;
>    bool isEmpty() const;
>    bool isValid() const;
>    QRectF normalized() const;
>
>    inline qreal left() const { return xp; }
>    inline qreal top() const { return yp; }
>    inline qreal right() const { return xp + w; }
>    inline qreal bottom() const { return yp + h; }
>
>    inline qreal x() const;
>    inline qreal y() const;
>    inline void setLeft(qreal pos);
>    inline void setTop(qreal pos);
>    inline void setRight(qreal pos);
>    inline void setBottom(qreal pos);
>    inline void setX(qreal pos) { setLeft(pos); }
>    inline void setY(qreal pos) { setTop(pos); }
>
>    inline QPointF topLeft() const { return QPointF(xp, yp); }
>    inline QPointF bottomRight() const { return QPointF(xp+w, yp+h); }
>    inline QPointF topRight() const { return QPointF(xp+w, yp); }
>    inline QPointF bottomLeft() const { return QPointF(xp, yp+h); }
>    inline QPointF center() const;
>
>    void setTopLeft(const QPointF &p);
>    void setBottomRight(const QPointF &p);
>    void setTopRight(const QPointF &p);
>    void setBottomLeft(const QPointF &p);
>
>    void moveLeft(qreal pos);
>    void moveTop(qreal pos);
>    void moveRight(qreal pos);
>    void moveBottom(qreal pos);
>    void moveTopLeft(const QPointF &p);
>    void moveBottomRight(const QPointF &p);
>    void moveTopRight(const QPointF &p);
>    void moveBottomLeft(const QPointF &p);
>    void moveCenter(const QPointF &p);
>
>    void translate(qreal dx, qreal dy);
>    void translate(const QPointF &p);
>
>    QRectF translated(qreal dx, qreal dy) const;
>    QRectF translated(const QPointF &p) const;
>
>    void moveTo(qreal x, qreal t);
>    void moveTo(const QPointF &p);
>
>    void setRect(qreal x, qreal y, qreal w, qreal h);
>    void getRect(qreal *x, qreal *y, qreal *w, qreal *h) const;
>
>    void setCoords(qreal x1, qreal y1, qreal x2, qreal y2);
>    void getCoords(qreal *x1, qreal *y1, qreal *x2, qreal *y2) const;
>
>    inline void adjust(qreal x1, qreal y1, qreal x2, qreal y2);
>    inline QRectF adjusted(qreal x1, qreal y1, qreal x2, qreal y2) const;
>
>    QSizeF size() const;
>    qreal width() const;
>    qreal height() const;
>    void setWidth(qreal w);
>    void setHeight(qreal h);
>    void setSize(const QSizeF &s);
>
>    QRectF operator|(const QRectF &r) const;
>    QRectF operator&(const QRectF &r) const;
>    QRectF& operator|=(const QRectF &r);
>    QRectF& operator&=(const QRectF &r);
>
>    bool contains(const QPointF &p) const;
>    bool contains(qreal x, qreal y) const;
>    bool contains(const QRectF &r) const;
>    QRectF unite(const QRectF &r) const;
>    QRectF united(const QRectF &other) const;
>    QRectF intersect(const QRectF &r) const;
>    QRectF intersected(const QRectF &other) const;
>    bool intersects(const QRectF &r) const;
>
>    friend __attribute__((visibility("default"))) inline bool operator==(const QRectF &, const QRectF &);
>    friend __attribute__((visibility("default"))) inline bool operator!=(const QRectF &, const QRectF &);
>
>    QRect toRect() const;
>    QRect toAlignedRect() const;
>
>private:
>    qreal xp;
>    qreal yp;
>    qreal w;
>    qreal h;
>};
>template<> class QTypeInfo<QRectF > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QRectF)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QRectF"; } };
>
>__attribute__((visibility("default"))) inline bool operator==(const QRectF &, const QRectF &);
>__attribute__((visibility("default"))) inline bool operator!=(const QRectF &, const QRectF &);
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QRectF &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QRectF &);
>
>
>
>
>
>
>inline QRectF::QRectF(qreal aleft, qreal atop, qreal awidth, qreal aheight)
>    : xp(aleft), yp(atop), w(awidth), h(aheight)
>{
>}
>
>inline QRectF::QRectF(const QPointF &atopLeft, const QSizeF &asize)
>{
>    xp = atopLeft.x();
>    yp = atopLeft.y();
>    w = asize.width();
>    h = asize.height();
>}
>
>inline QRectF::QRectF(const QPointF &atopLeft, const QPointF &abottomRight)
>{
>    xp = atopLeft.x();
>    yp = atopLeft.y();
>    w = abottomRight.x() - xp;
>    h = abottomRight.y() - yp;
>}
>
>inline QRectF::QRectF(const QRect &r)
>    : xp(r.x()), yp(r.y()), w(r.width()), h(r.height())
>{
>}
>
>inline bool QRectF::isNull() const
>{ return w == 0. && h == 0.; }
>
>inline bool QRectF::isEmpty() const
>{ return w <= 0. || h <= 0.; }
>
>inline bool QRectF::isValid() const
>{ return w > 0. && h > 0.; }
>
>inline qreal QRectF::x() const
>{ return xp; }
>
>inline qreal QRectF::y() const
>{ return yp; }
>
>inline void QRectF::setLeft(qreal pos) { qreal diff = pos - xp; xp += diff; w -= diff; }
>
>inline void QRectF::setRight(qreal pos) { w = pos - xp; }
>
>inline void QRectF::setTop(qreal pos) { qreal diff = pos - yp; yp += diff; h -= diff; }
>
>inline void QRectF::setBottom(qreal pos) { h = pos - yp; }
>
>inline void QRectF::setTopLeft(const QPointF &p) { setLeft(p.x()); setTop(p.y()); }
>
>inline void QRectF::setTopRight(const QPointF &p) { setRight(p.x()); setTop(p.y()); }
>
>inline void QRectF::setBottomLeft(const QPointF &p) { setLeft(p.x()); setBottom(p.y()); }
>
>inline void QRectF::setBottomRight(const QPointF &p) { setRight(p.x()); setBottom(p.y()); }
>
>inline QPointF QRectF::center() const
>{ return QPointF(xp + w/2, yp + h/2); }
>
>inline void QRectF::moveLeft(qreal pos) { xp = pos; }
>
>inline void QRectF::moveTop(qreal pos) { yp = pos; }
>
>inline void QRectF::moveRight(qreal pos) { xp = pos - w; }
>
>inline void QRectF::moveBottom(qreal pos) { yp = pos - h; }
>
>inline void QRectF::moveTopLeft(const QPointF &p) { moveLeft(p.x()); moveTop(p.y()); }
>
>inline void QRectF::moveTopRight(const QPointF &p) { moveRight(p.x()); moveTop(p.y()); }
>
>inline void QRectF::moveBottomLeft(const QPointF &p) { moveLeft(p.x()); moveBottom(p.y()); }
>
>inline void QRectF::moveBottomRight(const QPointF &p) { moveRight(p.x()); moveBottom(p.y()); }
>
>inline void QRectF::moveCenter(const QPointF &p) { xp = p.x() - w/2; yp = p.y() - h/2; }
>
>inline qreal QRectF::width() const
>{ return w; }
>
>inline qreal QRectF::height() const
>{ return h; }
>
>inline QSizeF QRectF::size() const
>{ return QSizeF(w, h); }
>
>inline void QRectF::translate(qreal dx, qreal dy)
>{
>    xp += dx;
>    yp += dy;
>}
>
>inline void QRectF::translate(const QPointF &p)
>{
>    xp += p.x();
>    yp += p.y();
>}
>
>inline void QRectF::moveTo(qreal ax, qreal ay)
>{
>    xp = ax;
>    yp = ay;
>}
>
>inline void QRectF::moveTo(const QPointF &p)
>{
>    xp = p.x();
>    yp = p.y();
>}
>
>inline QRectF QRectF::translated(qreal dx, qreal dy) const
>{ return QRectF(xp + dx, yp + dy, w, h); }
>
>inline QRectF QRectF::translated(const QPointF &p) const
>{ return QRectF(xp + p.x(), yp + p.y(), w, h); }
>
>inline void QRectF::getRect(qreal *ax, qreal *ay, qreal *aaw, qreal *aah) const
>{
>    *ax = this->xp;
>    *ay = this->yp;
>    *aaw = this->w;
>    *aah = this->h;
>}
>
>inline void QRectF::setRect(qreal ax, qreal ay, qreal aaw, qreal aah)
>{
>    this->xp = ax;
>    this->yp = ay;
>    this->w = aaw;
>    this->h = aah;
>}
>
>inline void QRectF::getCoords(qreal *xp1, qreal *yp1, qreal *xp2, qreal *yp2) const
>{
>    *xp1 = xp;
>    *yp1 = yp;
>    *xp2 = xp + w;
>    *yp2 = yp + h;
>}
>
>inline void QRectF::setCoords(qreal xp1, qreal yp1, qreal xp2, qreal yp2)
>{
>    xp = xp1;
>    yp = yp1;
>    w = xp2 - xp1;
>    h = yp2 - yp1;
>}
>
>inline void QRectF::adjust(qreal xp1, qreal yp1, qreal xp2, qreal yp2)
>{ xp += xp1; yp += yp1; w += xp2 - xp1; h += yp2 - yp1; }
>
>inline QRectF QRectF::adjusted(qreal xp1, qreal yp1, qreal xp2, qreal yp2) const
>{ return QRectF(xp + xp1, yp + yp1, w + xp2 - xp1, h + yp2 - yp1); }
>
>inline void QRectF::setWidth(qreal aw)
>{ this->w = aw; }
>
>inline void QRectF::setHeight(qreal ah)
>{ this->h = ah; }
>
>inline void QRectF::setSize(const QSizeF &s)
>{
>    w = s.width();
>    h = s.height();
>}
>
>inline bool QRectF::contains(qreal ax, qreal ay) const
>{
>    return contains(QPointF(ax, ay));
>}
>
>inline QRectF& QRectF::operator|=(const QRectF &r)
>{
>    *this = *this | r;
>    return *this;
>}
>
>inline QRectF& QRectF::operator&=(const QRectF &r)
>{
>    *this = *this & r;
>    return *this;
>}
>
>inline QRectF QRectF::intersect(const QRectF &r) const
>{
>    return *this & r;
>}
>
>inline QRectF QRectF::intersected(const QRectF &r) const
>{
>    return intersect(r);
>}
>
>inline QRectF QRectF::unite(const QRectF &r) const
>{
>    return *this | r;
>}
>
>inline QRectF QRectF::united(const QRectF &r) const
>{
>    return unite(r);
>}
>
>inline bool operator==(const QRectF &r1, const QRectF &r2)
>{
>    return qFuzzyCompare(r1.xp, r2.xp) && qFuzzyCompare(r1.yp, r2.yp)
>           && qFuzzyCompare(r1.w, r2.w) && qFuzzyCompare(r1.h, r2.h);
>}
>
>inline bool operator!=(const QRectF &r1, const QRectF &r2)
>{
>    return !qFuzzyCompare(r1.xp, r2.xp) || !qFuzzyCompare(r1.yp, r2.yp)
>           || !qFuzzyCompare(r1.w, r2.w) || !qFuzzyCompare(r1.h, r2.h);
>}
>
>inline QRect QRectF::toRect() const
>{
>    return QRect(qRound(xp), qRound(yp), qRound(w), qRound(h));
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QRectF &);
># 47 "/usr/include/QtGui/qpaintdevice.h" 2 3 4
>
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>
>
>
>
>class QPaintEngine;
>
>class __attribute__((visibility("default"))) QPaintDevice
>{
>public:
>    enum PaintDeviceMetric {
>        PdmWidth = 1,
>        PdmHeight,
>        PdmWidthMM,
>        PdmHeightMM,
>        PdmNumColors,
>        PdmDepth,
>        PdmDpiX,
>        PdmDpiY,
>        PdmPhysicalDpiX,
>        PdmPhysicalDpiY
>    };
>
>    virtual ~QPaintDevice();
>
>    virtual int devType() const;
>    bool paintingActive() const;
>    virtual QPaintEngine *paintEngine() const = 0;
># 91 "/usr/include/QtGui/qpaintdevice.h" 3 4
>    int width() const { return metric(PdmWidth); }
>    int height() const { return metric(PdmHeight); }
>    int widthMM() const { return metric(PdmWidthMM); }
>    int heightMM() const { return metric(PdmHeightMM); }
>    int logicalDpiX() const { return metric(PdmDpiX); }
>    int logicalDpiY() const { return metric(PdmDpiY); }
>    int physicalDpiX() const { return metric(PdmPhysicalDpiX); }
>    int physicalDpiY() const { return metric(PdmPhysicalDpiY); }
>
>    int numColors() const { return metric(PdmNumColors); }
>
>    int colorCount() const { return metric(PdmNumColors); }
>    int depth() const { return metric(PdmDepth); }
>
>protected:
>    QPaintDevice();
>    virtual int metric(PaintDeviceMetric metric) const;
>
>    ushort painters;
>
>private:
>    QPaintDevice(const QPaintDevice &); QPaintDevice &operator=(const QPaintDevice &);
># 140 "/usr/include/QtGui/qpaintdevice.h" 3 4
>    friend class QPainter;
>    friend class QFontEngineMac;
>    friend class QX11PaintEngine;
>    friend __attribute__((visibility("default"))) int qt_paint_device_metric(const QPaintDevice *device, PaintDeviceMetric metric);
>};
># 167 "/usr/include/QtGui/qpaintdevice.h" 3 4
>inline int QPaintDevice::devType() const
>{ return QInternal::UnknownDevice; }
>
>inline bool QPaintDevice::paintingActive() const
>{ return painters != 0; }
># 46 "/usr/include/QtGui/qpixmap.h" 2
># 1 "/usr/include/QtGui/qcolor.h" 1 3 4
># 45 "/usr/include/QtGui/qcolor.h" 3 4
># 1 "/usr/include/QtGui/qrgb.h" 1 3 4
># 47 "/usr/include/QtGui/qrgb.h" 3 4
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>typedef unsigned int QRgb;
>
>const QRgb RGB_MASK = 0x00ffffff;
>
>__attribute__((visibility("default"))) inline int qRed(QRgb rgb)
>{ return ((rgb >> 16) & 0xff); }
>
>__attribute__((visibility("default"))) inline int qGreen(QRgb rgb)
>{ return ((rgb >> 8) & 0xff); }
>
>__attribute__((visibility("default"))) inline int qBlue(QRgb rgb)
>{ return (rgb & 0xff); }
>
>__attribute__((visibility("default"))) inline int qAlpha(QRgb rgb)
>{ return rgb >> 24; }
>
>__attribute__((visibility("default"))) inline QRgb qRgb(int r, int g, int b)
>{ return (0xffu << 24) | ((r & 0xff) << 16) | ((g & 0xff) << 8) | (b & 0xff); }
>
>__attribute__((visibility("default"))) inline QRgb qRgba(int r, int g, int b, int a)
>{ return ((a & 0xff) << 24) | ((r & 0xff) << 16) | ((g & 0xff) << 8) | (b & 0xff); }
>
>__attribute__((visibility("default"))) inline int qGray(int r, int g, int b)
>{ return (r*11+g*16+b*5)/32; }
>
>__attribute__((visibility("default"))) inline int qGray(QRgb rgb)
>{ return qGray(qRed(rgb), qGreen(rgb), qBlue(rgb)); }
>
>__attribute__((visibility("default"))) inline bool qIsGray(QRgb rgb)
>{ return qRed(rgb) == qGreen(rgb) && qRed(rgb) == qBlue(rgb); }
># 46 "/usr/include/QtGui/qcolor.h" 2 3 4
>
># 1 "/usr/include/QtCore/qstringlist.h" 1 3 4
># 48 "/usr/include/QtGui/qcolor.h" 2 3 4
>
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QColor;
>class QColormap;
>class QVariant;
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QColor &);
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QColor &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QColor &);
>
>
>class __attribute__((visibility("default"))) QColor
>{
>public:
>    enum Spec { Invalid, Rgb, Hsv, Cmyk, Hsl };
>
>    QColor();
>    QColor(Qt::GlobalColor color);
>    QColor(int r, int g, int b, int a = 255);
>    QColor(QRgb rgb);
>    QColor(const QString& name);
>    QColor(const char *name);
>    QColor(const QColor &color);
>    QColor(Spec spec);
>
>    bool isValid() const;
>
>    QString name() const;
>    void setNamedColor(const QString& name);
>
>    static QStringList colorNames();
>
>    inline Spec spec() const
>    { return cspec; }
>
>    int alpha() const;
>    void setAlpha(int alpha);
>
>    qreal alphaF() const;
>    void setAlphaF(qreal alpha);
>
>    int red() const;
>    int green() const;
>    int blue() const;
>    void setRed(int red);
>    void setGreen(int green);
>    void setBlue(int blue);
>
>    qreal redF() const;
>    qreal greenF() const;
>    qreal blueF() const;
>    void setRedF(qreal red);
>    void setGreenF(qreal green);
>    void setBlueF(qreal blue);
>
>    void getRgb(int *r, int *g, int *b, int *a = 0) const;
>    void setRgb(int r, int g, int b, int a = 255);
>
>    void getRgbF(qreal *r, qreal *g, qreal *b, qreal *a = 0) const;
>    void setRgbF(qreal r, qreal g, qreal b, qreal a = 1.0);
>
>    QRgb rgba() const;
>    void setRgba(QRgb rgba);
>
>    QRgb rgb() const;
>    void setRgb(QRgb rgb);
>
>    int hue() const;
>    int saturation() const;
>    int hsvHue() const;
>    int hsvSaturation() const;
>    int value() const;
>
>    qreal hueF() const;
>    qreal saturationF() const;
>    qreal hsvHueF() const;
>    qreal hsvSaturationF() const;
>    qreal valueF() const;
>
>    void getHsv(int *h, int *s, int *v, int *a = 0) const;
>    void setHsv(int h, int s, int v, int a = 255);
>
>    void getHsvF(qreal *h, qreal *s, qreal *v, qreal *a = 0) const;
>    void setHsvF(qreal h, qreal s, qreal v, qreal a = 1.0);
>
>    int cyan() const;
>    int magenta() const;
>    int yellow() const;
>    int black() const;
>
>    qreal cyanF() const;
>    qreal magentaF() const;
>    qreal yellowF() const;
>    qreal blackF() const;
>
>    void getCmyk(int *c, int *m, int *y, int *k, int *a = 0);
>    void setCmyk(int c, int m, int y, int k, int a = 255);
>
>    void getCmykF(qreal *c, qreal *m, qreal *y, qreal *k, qreal *a = 0);
>    void setCmykF(qreal c, qreal m, qreal y, qreal k, qreal a = 1.0);
>
>    int hslHue() const;
>    int hslSaturation() const;
>    int lightness() const;
>
>    qreal hslHueF() const;
>    qreal hslSaturationF() const;
>    qreal lightnessF() const;
>
>    void getHsl(int *h, int *s, int *l, int *a = 0) const;
>    void setHsl(int h, int s, int l, int a = 255);
>
>    void getHslF(qreal *h, qreal *s, qreal *l, qreal *a = 0) const;
>    void setHslF(qreal h, qreal s, qreal l, qreal a = 1.0);
>
>    QColor toRgb() const;
>    QColor toHsv() const;
>    QColor toCmyk() const;
>    QColor toHsl() const;
>
>    QColor convertTo(Spec colorSpec) const;
>
>    static QColor fromRgb(QRgb rgb);
>    static QColor fromRgba(QRgb rgba);
>
>    static QColor fromRgb(int r, int g, int b, int a = 255);
>    static QColor fromRgbF(qreal r, qreal g, qreal b, qreal a = 1.0);
>
>    static QColor fromHsv(int h, int s, int v, int a = 255);
>    static QColor fromHsvF(qreal h, qreal s, qreal v, qreal a = 1.0);
>
>    static QColor fromCmyk(int c, int m, int y, int k, int a = 255);
>    static QColor fromCmykF(qreal c, qreal m, qreal y, qreal k, qreal a = 1.0);
>
>    static QColor fromHsl(int h, int s, int l, int a = 255);
>    static QColor fromHslF(qreal h, qreal s, qreal l, qreal a = 1.0);
>
>    QColor light(int f = 150) const;
>    QColor lighter(int f = 150) const;
>    QColor dark(int f = 200) const;
>    QColor darker(int f = 200) const;
>
>    QColor &operator=(const QColor &);
>    QColor &operator=(Qt::GlobalColor color);
>
>    bool operator==(const QColor &c) const;
>    bool operator!=(const QColor &c) const;
>
>    operator QVariant() const;
>
>
>    static bool allowX11ColorNames();
>    static void setAllowX11ColorNames(bool enabled);
># 228 "/usr/include/QtGui/qcolor.h" 3 4
>    static bool isValidColor(const QString &name);
>
>private:
>
>
>    QColor(int, int, int, Spec);
>
>
>    void invalidate();
>    bool setColorFromString(const QString &name);
>
>    Spec cspec;
>    union {
>        struct {
>            ushort alpha;
>            ushort red;
>            ushort green;
>            ushort blue;
>            ushort pad;
>        } argb;
>        struct {
>            ushort alpha;
>            ushort hue;
>            ushort saturation;
>            ushort value;
>            ushort pad;
>        } ahsv;
>        struct {
>            ushort alpha;
>            ushort cyan;
>            ushort magenta;
>            ushort yellow;
>            ushort black;
>        } acmyk;
>        struct {
>            ushort alpha;
>            ushort hue;
>            ushort saturation;
>            ushort lightness;
>            ushort pad;
>        } ahsl;
>        ushort array[5];
>    } ct;
>
>    friend class QColormap;
>
>    friend __attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QColor &);
>    friend __attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QColor &);
>
>};
>
>inline QColor::QColor()
>{ invalidate(); }
>
>inline QColor::QColor(int r, int g, int b, int a)
>{ setRgb(r, g, b, a); }
>
>inline QColor::QColor(const char *aname)
>{ setNamedColor(QLatin1String(aname)); }
>
>inline QColor::QColor(const QString& aname)
>{ setNamedColor(aname); }
>
>inline QColor::QColor(const QColor &acolor)
>    : cspec(acolor.cspec)
>{ ct.argb = acolor.ct.argb; }
>
>inline bool QColor::isValid() const
>{ return cspec != Invalid; }
>
>inline QColor QColor::lighter(int f) const
>{ return light(f); }
>
>inline QColor QColor::darker(int f) const
>{ return dark(f); }
># 47 "/usr/include/QtGui/qpixmap.h" 2
>
>
># 1 "/usr/include/QtCore/qsharedpointer.h" 1 3 4
># 47 "/usr/include/QtCore/qsharedpointer.h" 3 4
># 1 "/usr/include/QtCore/qshareddata.h" 1 3 4
># 48 "/usr/include/QtCore/qshareddata.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>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 != 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 != 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); }
>}
># 48 "/usr/include/QtCore/qsharedpointer.h" 2 3 4
>
>
># 1 "/usr/include/QtCore/qsharedpointer_impl.h" 1 3 4
># 65 "/usr/include/QtCore/qsharedpointer_impl.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
># 88 "/usr/include/QtCore/qsharedpointer_impl.h" 3 4
>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 InternalRefCount;
>    template <class T> class ExternalRefCount;
>
>    template <class X, class Y> QSharedPointer<X> copyAndSetPointer(X * ptr, const QSharedPointer<Y> &src);
>
>
>    __attribute__((visibility("default"))) void internalSafetyCheckAdd2(const void *, const volatile void *);
>    __attribute__((visibility("default"))) void internalSafetyCheckRemove2(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); }
>    template <class T> inline void normalDeleter(T *t) { delete t; }
>
>
>    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; };
>
>
>
>
>    template <class T>
>    class Basic
>    {
>
>        typedef T *Basic:: *RestrictedBool;
>
>    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 : &Basic::value; }
>
>
>
>        inline bool operator !() const { return isNull(); }
>        inline T &operator*() const { return *data(); }
>        inline T *operator->() const { return data(); }
>
>    protected:
>        inline Basic(T *ptr = 0) : value(ptr) { }
>        inline Basic(Qt::Initialization) { }
>
>
>        inline void internalConstruct(T *ptr)
>        {
>            value = ptr;
>        }
>
>
>
>
>        template <class X> friend class ::QWeakPointer;
>
>
>        Type *value;
>    };
>
>
>
>
>
>
>
>    struct ExternalRefCountData
>    {
>        QBasicAtomicInt weakref;
>        QBasicAtomicInt strongref;
>
>        inline ExternalRefCountData()
>        {
>            strongref = 1;
>            weakref = 1;
>        }
>        inline ExternalRefCountData(Qt::Initialization) { }
>        virtual inline ~ExternalRefCountData() { qt_noop(); qt_noop(); }
>
>
>
>
>        virtual inline bool destroy() { return false; }
>
>
>        __attribute__((visibility("default"))) static ExternalRefCountData *getAndRef(const QObject *);
>        __attribute__((visibility("default"))) void setQObjectShared(const QObject *, bool enable);
>
>        inline void setQObjectShared(...) { }
>    };
>
>
>
>
>    struct ExternalRefCountWithDestroyFn: public ExternalRefCountData
>    {
>        typedef void (*DestroyerFn)(ExternalRefCountData *);
>        DestroyerFn destroyer;
>
>        inline ExternalRefCountWithDestroyFn(DestroyerFn d)
>            : destroyer(d)
>        { }
>
>        inline bool destroy() { destroyer(this); return true; }
>        inline void operator delete(void *ptr) { ::operator delete(ptr); }
>        inline void operator delete(void *, void *) { }
>    };
>
>
>
>
>
>    template <class T, typename Deleter>
>    struct ExternalRefCountWithCustomDeleter: public ExternalRefCountWithDestroyFn
>    {
>        typedef ExternalRefCountWithCustomDeleter Self;
>        typedef ExternalRefCountWithDestroyFn BaseClass;
>
>        struct CustomDeleter
>        {
>            Deleter deleter;
>            T *ptr;
>
>            inline CustomDeleter(T *p, Deleter d) : deleter(d), ptr(p) {}
>        };
>        CustomDeleter extra;
>
>
>
>
>        static inline void deleter(ExternalRefCountData *self)
>        {
>            Self *realself = static_cast<Self *>(self);
>            executeDeleter(realself->extra.ptr, realself->extra.deleter);
>
>
>            realself->extra.~CustomDeleter();
>        }
>        static void safetyCheckDeleter(ExternalRefCountData *self)
>        {
>            internalSafetyCheckRemove2(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(ptr, userDeleter);
>            new (d) BaseClass(destroy);
>
>            return d;
>        }
>    private:
>
>        ExternalRefCountWithCustomDeleter();
>        ~ExternalRefCountWithCustomDeleter();
>    };
>
>
>
>
>
>    template <class T>
>    struct ExternalRefCountWithContiguousData: public ExternalRefCountWithDestroyFn
>    {
>        typedef ExternalRefCountWithDestroyFn Parent;
>        T data;
>
>        static void deleter(ExternalRefCountData *self)
>        {
>            ExternalRefCountWithContiguousData *that =
>                    static_cast<ExternalRefCountWithContiguousData *>(self);
>            that->data.~T();
>        }
>        static void safetyCheckDeleter(ExternalRefCountData *self)
>        {
>            internalSafetyCheckRemove2(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();
>    };
>
>
>
>    template <class T>
>    class ExternalRefCount: public Basic<T>
>    {
>    protected:
>        typedef ExternalRefCountData Data;
>
>        inline void deref()
>        { deref(d, this->value); }
>        static inline void deref(Data *d, T *value)
>        {
>            if (!d) return;
>            if (!d->strongref.deref()) {
>                if (!d->destroy())
>                    delete value;
>            }
>            if (!d->weakref.deref())
>                delete d;
>        }
>
>        inline void internalConstruct(T *ptr)
>        {
>
>
>
>            if (ptr)
>                d = new Data;
>            else
>                d = 0;
>            internalFinishConstruction(ptr);
>
>        }
>
>        template <typename Deleter>
>        inline void internalConstruct(T *ptr, Deleter deleter)
>        {
>            if (ptr)
>                d = ExternalRefCountWithCustomDeleter<T, Deleter>::create(ptr, deleter);
>            else
>                d = 0;
>            internalFinishConstruction(ptr);
>        }
>
>        inline void internalCreate()
>        {
>            T *ptr;
>            d = ExternalRefCountWithContiguousData<T>::create(&ptr);
>            Basic<T>::internalConstruct(ptr);
>        }
>
>        inline void internalFinishConstruction(T *ptr)
>        {
>            Basic<T>::internalConstruct(ptr);
>            if (ptr) d->setQObjectShared(ptr, true);
>
>
>
>        }
>
>        inline ExternalRefCount() : d(0) { }
>        inline ExternalRefCount(Qt::Initialization i) : Basic<T>(i) { }
>
>        inline ExternalRefCount(T *ptr) : Basic<T>(Qt::Uninitialized)
>        { internalConstruct(ptr); }
>        template <typename Deleter>
>        inline ExternalRefCount(T *ptr, Deleter deleter) : Basic<T>(Qt::Uninitialized)
>        { internalConstruct(ptr, deleter); }
>
>        inline ExternalRefCount(const ExternalRefCount<T> &other) : Basic<T>(other), d(other.d)
>        { if (d) ref(); }
>        template <class X>
>        inline ExternalRefCount(const ExternalRefCount<X> &other) : Basic<T>(other.value), d(other.d)
>        { if (d) ref(); }
>        inline ~ExternalRefCount() { deref(); }
>
>        template <class X>
>        inline void internalCopy(const ExternalRefCount<X> &other)
>        {
>            Data *o = other.d;
>            T *actual = other.value;
>            if (o)
>                other.ref();
>            qSwap(d, o);
>            qSwap(this->value, actual);
>            deref(o, actual);
>        }
>
>        inline void internalSwap(ExternalRefCount &other)
>        {
>            qSwap(d, other.d);
>            qSwap(this->value, other.value);
>        }
>
>
>
>
>        template <class X> friend class ExternalRefCount;
>        template <class X> friend class ::QWeakPointer;
>        template <class X, class Y> friend QSharedPointer<X> 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;
>                while (tmp > 0) {
>
>                    if (o->strongref.testAndSetRelaxed(tmp, tmp + 1))
>                        break;
>                    tmp = o->strongref;
>                }
>
>                if (tmp > 0)
>                    o->weakref.ref();
>                else
>                    o = 0;
>            }
>
>            qSwap(d, o);
>            qSwap(this->value, actual);
>            if (!d || d->strongref == 0)
>                this->value = 0;
>
>
>            deref(o, actual);
>        }
>
>        Data *d;
>
>    private:
>        template<class X> ExternalRefCount(const InternalRefCount<X> &);
>    };
>}
>
>template <class T>
>class QSharedPointer: public QtSharedPointer::ExternalRefCount<T>
>{
>    typedef typename QtSharedPointer::ExternalRefCount<T> BaseClass;
>public:
>    inline QSharedPointer() { }
>
>
>    inline explicit QSharedPointer(T *ptr) : BaseClass(ptr)
>    { }
>
>    template <typename Deleter>
>    inline QSharedPointer(T *ptr, Deleter d) : BaseClass(ptr, d)
>    { }
>
>    inline QSharedPointer(const QSharedPointer<T> &other) : BaseClass(other) { }
>    inline QSharedPointer<T> &operator=(const QSharedPointer<T> &other)
>    {
>        BaseClass::internalCopy(other);
>        return *this;
>    }
># 494 "/usr/include/QtCore/qsharedpointer_impl.h" 3 4
>    template <class X>
>    inline QSharedPointer(const QSharedPointer<X> &other) : BaseClass(other)
>    { }
>
>    template <class X>
>    inline QSharedPointer<T> &operator=(const QSharedPointer<X> &other)
>    {
>        qt_noop();
>        BaseClass::internalCopy(other);
>        return *this;
>    }
>
>    template <class X>
>    inline QSharedPointer(const QWeakPointer<X> &other) : BaseClass(Qt::Uninitialized)
>    { this->d = 0; *this = other; }
>
>    template <class X>
>    inline QSharedPointer<T> &operator=(const QWeakPointer<X> &other)
>    { BaseClass::internalSet(other.d, other.value); return *this; }
>
>    inline void swap(QSharedPointer &other)
>    { QSharedPointer<T>::internalSwap(other); }
>
>    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() { *this = QSharedPointer<T>(); }
>
>    QWeakPointer<T> toWeakRef() const;
>
>protected:
>    inline explicit QSharedPointer(Qt::Initialization i) : BaseClass(i) {}
>
>public:
>    static inline QSharedPointer<T> create()
>    {
>        QSharedPointer<T> result(Qt::Uninitialized);
>        result.internalCreate();
>
>
>        new (result.data()) T();
>        result.internalFinishConstruction(result.data());
>        return result;
>    }
>};
>
>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 == 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 == 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_noop();
>        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 T *key);
>template <class T>
>inline uint qHash(const QSharedPointer<T> &ptr)
>{
>    return ::qHash<T>(ptr.data());
>}
>
>
>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) }; 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) }; static inline const char *name() { return "QSharedPointer<T>"; } };
># 51 "/usr/include/QtCore/qsharedpointer.h" 2 3 4
># 50 "/usr/include/QtGui/qpixmap.h" 2
># 1 "/usr/include/QtGui/qimage.h" 1 3 4
># 45 "/usr/include/QtGui/qimage.h" 3 4
># 1 "/usr/include/QtGui/qtransform.h" 1 3 4
># 44 "/usr/include/QtGui/qtransform.h" 3 4
># 1 "/usr/include/QtGui/qmatrix.h" 1 3 4
># 45 "/usr/include/QtGui/qmatrix.h" 3 4
># 1 "/usr/include/QtGui/qpolygon.h" 1 3 4
># 45 "/usr/include/QtGui/qpolygon.h" 3 4
># 1 "/usr/include/QtCore/qvector.h" 1 3 4
># 52 "/usr/include/QtCore/qvector.h" 3 4
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 1 3 4
># 59 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 3 4
># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 3
>
>
>
>
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 1 3
># 61 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
>
>
>  template<bool _TrivialValueTypes>
>    struct __uninitialized_copy
>    {
>      template<typename _InputIterator, typename _ForwardIterator>
>        static _ForwardIterator
>        __uninit_copy(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result)
>        {
>   _ForwardIterator __cur = __result;
>   try
>     {
>       for (; __first != __last; ++__first, ++__cur)
>  std::_Construct(std::__addressof(*__cur), *__first);
>       return __cur;
>     }
>   catch(...)
>     {
>       std::_Destroy(__result, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_copy<true>
>    {
>      template<typename _InputIterator, typename _ForwardIterator>
>        static _ForwardIterator
>        __uninit_copy(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result)
>        { return std::copy(__first, __last, __result); }
>    };
># 107 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    uninitialized_copy(_InputIterator __first, _InputIterator __last,
>         _ForwardIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType2;
>
>      return std::__uninitialized_copy<(__is_trivial(_ValueType1)
>     && __is_trivial(_ValueType2))>::
> __uninit_copy(__first, __last, __result);
>    }
>
>
>  template<bool _TrivialValueType>
>    struct __uninitialized_fill
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        __uninit_fill(_ForwardIterator __first, _ForwardIterator __last,
>        const _Tp& __x)
>        {
>   _ForwardIterator __cur = __first;
>   try
>     {
>       for (; __cur != __last; ++__cur)
>  std::_Construct(std::__addressof(*__cur), __x);
>     }
>   catch(...)
>     {
>       std::_Destroy(__first, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_fill<true>
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        __uninit_fill(_ForwardIterator __first, _ForwardIterator __last,
>        const _Tp& __x)
>        { std::fill(__first, __last, __x); }
>    };
># 164 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,
>         const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>      std::__uninitialized_fill<__is_trivial(_ValueType)>::
> __uninit_fill(__first, __last, __x);
>    }
>
>
>  template<bool _TrivialValueType>
>    struct __uninitialized_fill_n
>    {
>      template<typename _ForwardIterator, typename _Size, typename _Tp>
>        static void
>        __uninit_fill_n(_ForwardIterator __first, _Size __n,
>   const _Tp& __x)
>        {
>   _ForwardIterator __cur = __first;
>   try
>     {
>       for (; __n > 0; --__n, ++__cur)
>  std::_Construct(std::__addressof(*__cur), __x);
>     }
>   catch(...)
>     {
>       std::_Destroy(__first, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_fill_n<true>
>    {
>      template<typename _ForwardIterator, typename _Size, typename _Tp>
>        static void
>        __uninit_fill_n(_ForwardIterator __first, _Size __n,
>   const _Tp& __x)
>        { std::fill_n(__first, __n, __x); }
>    };
># 218 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>      std::__uninitialized_fill_n<__is_trivial(_ValueType)>::
> __uninit_fill_n(__first, __n, __x);
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result, _Allocator& __alloc)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   typedef __gnu_cxx::__alloc_traits<_Allocator> __traits;
>   for (; __first != __last; ++__first, ++__cur)
>     __traits::construct(__alloc, std::__addressof(*__cur), *__first);
>   return __cur;
> }
>      catch(...)
> {
>   std::_Destroy(__result, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp>
>    inline _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result, allocator<_Tp>&)
>    { return std::uninitialized_copy(__first, __last, __result); }
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_move_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result, _Allocator& __alloc)
>    {
>      return std::__uninitialized_copy_a((__first),
>      (__last),
>      __result, __alloc);
>    }
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_move_if_noexcept_a(_InputIterator __first,
>           _InputIterator __last,
>           _ForwardIterator __result,
>           _Allocator& __alloc)
>    {
>      return std::__uninitialized_copy_a
> ((__first),
>  (__last), __result, __alloc);
>    }
>
>  template<typename _ForwardIterator, typename _Tp, typename _Allocator>
>    void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, _Allocator& __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   typedef __gnu_cxx::__alloc_traits<_Allocator> __traits;
>   for (; __cur != __last; ++__cur)
>     __traits::construct(__alloc, std::__addressof(*__cur), __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Tp, typename _Tp2>
>    inline void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, allocator<_Tp2>&)
>    { std::uninitialized_fill(__first, __last, __x); }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Allocator>
>    void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x, _Allocator& __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   typedef __gnu_cxx::__alloc_traits<_Allocator> __traits;
>   for (; __n > 0; --__n, ++__cur)
>     __traits::construct(__alloc, std::__addressof(*__cur), __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Tp2>
>    inline void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x, allocator<_Tp2>&)
>    { std::uninitialized_fill_n(__first, __n, __x); }
># 348 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_copy_move(_InputIterator1 __first1,
>         _InputIterator1 __last1,
>         _InputIterator2 __first2,
>         _InputIterator2 __last2,
>         _ForwardIterator __result,
>         _Allocator& __alloc)
>    {
>      _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1,
>          __result,
>          __alloc);
>      try
> {
>   return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_move_copy(_InputIterator1 __first1,
>         _InputIterator1 __last1,
>         _InputIterator2 __first2,
>         _InputIterator2 __last2,
>         _ForwardIterator __result,
>         _Allocator& __alloc)
>    {
>      _ForwardIterator __mid = std::__uninitialized_move_a(__first1, __last1,
>          __result,
>          __alloc);
>      try
> {
>   return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp, typename _InputIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid,
>         const _Tp& __x, _InputIterator __first,
>         _InputIterator __last, _Allocator& __alloc)
>    {
>      std::__uninitialized_fill_a(__result, __mid, __x, __alloc);
>      try
> {
>   return std::__uninitialized_move_a(__first, __last, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp,
>    typename _Allocator>
>    inline void
>    __uninitialized_move_fill(_InputIterator __first1, _InputIterator __last1,
>         _ForwardIterator __first2,
>         _ForwardIterator __last2, const _Tp& __x,
>         _Allocator& __alloc)
>    {
>      _ForwardIterator __mid2 = std::__uninitialized_move_a(__first1, __last1,
>           __first2,
>           __alloc);
>      try
> {
>   std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__first2, __mid2, __alloc);
>   throw;
> }
>    }
># 655 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_uninitialized.h" 3
>
>}
># 65 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 2 3
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 1 3
># 67 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
>
>
>
>  template<typename _Tp, typename _Alloc>
>    struct _Vector_base
>    {
>      typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template
>        rebind<_Tp>::other _Tp_alloc_type;
>      typedef typename __gnu_cxx::__alloc_traits<_Tp_alloc_type>::pointer
>        pointer;
>
>      struct _Vector_impl
>      : public _Tp_alloc_type
>      {
> pointer _M_start;
> pointer _M_finish;
> pointer _M_end_of_storage;
>
> _Vector_impl()
> : _Tp_alloc_type(), _M_start(0), _M_finish(0), _M_end_of_storage(0)
> { }
>
> _Vector_impl(_Tp_alloc_type const& __a)
> : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)
> { }
># 102 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
> void _M_swap_data(_Vector_impl& __x)
> {
>   std::swap(_M_start, __x._M_start);
>   std::swap(_M_finish, __x._M_finish);
>   std::swap(_M_end_of_storage, __x._M_end_of_storage);
> }
>      };
>
>    public:
>      typedef _Alloc allocator_type;
>
>      _Tp_alloc_type&
>      _M_get_Tp_allocator()
>      { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
>
>      const _Tp_alloc_type&
>      _M_get_Tp_allocator() const
>      { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_get_Tp_allocator()); }
>
>      _Vector_base()
>      : _M_impl() { }
>
>      _Vector_base(const allocator_type& __a)
>      : _M_impl(__a) { }
>
>      _Vector_base(size_t __n)
>      : _M_impl()
>      { _M_create_storage(__n); }
>
>      _Vector_base(size_t __n, const allocator_type& __a)
>      : _M_impl(__a)
>      { _M_create_storage(__n); }
># 160 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      ~_Vector_base()
>      { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage
>        - this->_M_impl._M_start); }
>
>    public:
>      _Vector_impl _M_impl;
>
>      pointer
>      _M_allocate(size_t __n)
>      { return __n != 0 ? _M_impl.allocate(__n) : 0; }
>
>      void
>      _M_deallocate(pointer __p, size_t __n)
>      {
> if (__p)
>   _M_impl.deallocate(__p, __n);
>      }
>
>    private:
>      void
>      _M_create_storage(size_t __n)
>      {
> this->_M_impl._M_start = this->_M_allocate(__n);
> this->_M_impl._M_finish = this->_M_impl._M_start;
> this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
>      }
>    };
># 207 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
>    class vector : protected _Vector_base<_Tp, _Alloc>
>    {
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>
>
>
>      typedef _Vector_base<_Tp, _Alloc> _Base;
>      typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;
>      typedef __gnu_cxx::__alloc_traits<_Tp_alloc_type> _Alloc_traits;
>
>    public:
>      typedef _Tp value_type;
>      typedef typename _Base::pointer pointer;
>      typedef typename _Alloc_traits::const_pointer const_pointer;
>      typedef typename _Alloc_traits::reference reference;
>      typedef typename _Alloc_traits::const_reference const_reference;
>      typedef __gnu_cxx::__normal_iterator<pointer, vector> iterator;
>      typedef __gnu_cxx::__normal_iterator<const_pointer, vector>
>      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:
>      using _Base::_M_allocate;
>      using _Base::_M_deallocate;
>      using _Base::_M_impl;
>      using _Base::_M_get_Tp_allocator;
>
>    public:
>
>
>
>
>
>      vector()
>      : _Base() { }
>
>
>
>
>
>      explicit
>      vector(const allocator_type& __a)
>      : _Base(__a) { }
># 291 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      explicit
>      vector(size_type __n, const value_type& __value = value_type(),
>      const allocator_type& __a = allocator_type())
>      : _Base(__n, __a)
>      { _M_fill_initialize(__n, __value); }
># 307 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      vector(const vector& __x)
>      : _Base(__x.size(),
>        _Alloc_traits::_S_select_on_copy(__x._M_get_Tp_allocator()))
>      { this->_M_impl._M_finish =
>   std::__uninitialized_copy_a(__x.begin(), __x.end(),
>          this->_M_impl._M_start,
>          _M_get_Tp_allocator());
>      }
># 386 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      template<typename _InputIterator>
>        vector(_InputIterator __first, _InputIterator __last,
>        const allocator_type& __a = allocator_type())
> : _Base(__a)
>        {
>
>   typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>   _M_initialize_dispatch(__first, __last, _Integral());
> }
>
>
>
>
>
>
>
>      ~vector()
>      { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>        _M_get_Tp_allocator()); }
># 414 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      vector&
>      operator=(const vector& __x);
># 484 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 500 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.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());
> }
># 527 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      using _Base::get_allocator;
>
>
>
>
>
>
>
>      iterator
>      begin()
>      { return iterator(this->_M_impl._M_start); }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return const_iterator(this->_M_impl._M_start); }
>
>
>
>
>
>
>      iterator
>      end()
>      { return iterator(this->_M_impl._M_finish); }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return const_iterator(this->_M_impl._M_finish); }
>
>
>
>
>
>
>      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()); }
># 642 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      size_type
>      size() const
>      { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
>
>
>      size_type
>      max_size() const
>      { return _Alloc_traits::max_size(_M_get_Tp_allocator()); }
># 701 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      resize(size_type __new_size, value_type __x = value_type())
>      {
> if (__new_size > size())
>   insert(end(), __new_size - size(), __x);
> else if (__new_size < size())
>   _M_erase_at_end(this->_M_impl._M_start + __new_size);
>      }
># 722 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      size_type
>      capacity() const
>      { return size_type(this->_M_impl._M_end_of_storage
>    - this->_M_impl._M_start); }
>
>
>
>
>
>      bool
>      empty() const
>      { return begin() == end(); }
># 752 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      reserve(size_type __n);
># 767 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      reference
>      operator[](size_type __n)
>      { return *(this->_M_impl._M_start + __n); }
># 782 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      const_reference
>      operator[](size_type __n) const
>      { return *(this->_M_impl._M_start + __n); }
>
>    protected:
>
>      void
>      _M_range_check(size_type __n) const
>      {
> if (__n >= this->size())
>   __throw_out_of_range(("vector::_M_range_check"));
>      }
>
>    public:
># 807 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      reference
>      at(size_type __n)
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
># 825 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      const_reference
>      at(size_type __n) const
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
>
>
>
>
>
>      reference
>      front()
>      { return *begin(); }
>
>
>
>
>
>      const_reference
>      front() const
>      { return *begin(); }
>
>
>
>
>
>      reference
>      back()
>      { return *(end() - 1); }
>
>
>
>
>
>      const_reference
>      back() const
>      { return *(end() - 1); }
># 874 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      pointer
>
>      data()
>      { return std::__addressof(front()); }
>
>
>
>
>      const_pointer
>
>      data() const
>      { return std::__addressof(front()); }
># 898 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      push_back(const value_type& __x)
>      {
> if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
>   {
>     _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
>                              __x);
>     ++this->_M_impl._M_finish;
>   }
> else
>
>
>
>   _M_insert_aux(end(), __x);
>
>      }
># 934 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      pop_back()
>      {
> --this->_M_impl._M_finish;
> _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);
>      }
># 970 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x);
># 1020 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 1038 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      template<typename _InputIterator>
>        void
>        insert(iterator __position, _InputIterator __first,
>        _InputIterator __last)
>        {
>
>   typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>   _M_insert_dispatch(__position, __first, __last, _Integral());
> }
># 1063 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      iterator
>      erase(iterator __position);
># 1084 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      iterator
>      erase(iterator __first, iterator __last);
># 1096 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      swap(vector& __x)
>
>
>
>      {
> this->_M_impl._M_swap_data(__x._M_impl);
> _Alloc_traits::_S_on_swap(_M_get_Tp_allocator(),
>                           __x._M_get_Tp_allocator());
>      }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_erase_at_end(this->_M_impl._M_start); }
>
>    protected:
>
>
>
>
>      template<typename _ForwardIterator>
>        pointer
>        _M_allocate_and_copy(size_type __n,
>        _ForwardIterator __first, _ForwardIterator __last)
>        {
>   pointer __result = this->_M_allocate(__n);
>   try
>     {
>       std::__uninitialized_copy_a(__first, __last, __result,
>       _M_get_Tp_allocator());
>       return __result;
>     }
>   catch(...)
>     {
>       _M_deallocate(__result, __n);
>       throw;
>     }
> }
># 1148 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      template<typename _Integer>
>        void
>        _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)
>        {
>   this->_M_impl._M_start = _M_allocate(static_cast<size_type>(__n));
>   this->_M_impl._M_end_of_storage =
>     this->_M_impl._M_start + static_cast<size_type>(__n);
>   _M_fill_initialize(static_cast<size_type>(__n), __value);
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
>          __false_type)
>        {
>   typedef typename std::iterator_traits<_InputIterator>::
>     iterator_category _IterCategory;
>   _M_range_initialize(__first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_range_initialize(_InputIterator __first,
>       _InputIterator __last, std::input_iterator_tag)
>        {
>   for (; __first != __last; ++__first)
>     push_back(*__first);
> }
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_range_initialize(_ForwardIterator __first,
>       _ForwardIterator __last, std::forward_iterator_tag)
>        {
>   const size_type __n = std::distance(__first, __last);
>   this->_M_impl._M_start = this->_M_allocate(__n);
>   this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
>   this->_M_impl._M_finish =
>     std::__uninitialized_copy_a(__first, __last,
>     this->_M_impl._M_start,
>     _M_get_Tp_allocator());
> }
>
>
>
>      void
>      _M_fill_initialize(size_type __n, const value_type& __value)
>      {
> std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value,
>          _M_get_Tp_allocator());
> this->_M_impl._M_finish = this->_M_impl._M_end_of_storage;
>      }
># 1222 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.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)
>        {
>   typedef typename std::iterator_traits<_InputIterator>::
>     iterator_category _IterCategory;
>   _M_assign_aux(__first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_assign_aux(_InputIterator __first, _InputIterator __last,
>        std::input_iterator_tag);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>        std::forward_iterator_tag);
>
>
>
>      void
>      _M_fill_assign(size_type __n, const value_type& __val);
># 1262 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      template<typename _Integer>
>        void
>        _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
>      __true_type)
>        { _M_fill_insert(__pos, __n, __val); }
>
>
>      template<typename _InputIterator>
>        void
>        _M_insert_dispatch(iterator __pos, _InputIterator __first,
>      _InputIterator __last, __false_type)
>        {
>   typedef typename std::iterator_traits<_InputIterator>::
>     iterator_category _IterCategory;
>   _M_range_insert(__pos, __first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_range_insert(iterator __pos, _InputIterator __first,
>   _InputIterator __last, std::input_iterator_tag);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_range_insert(iterator __pos, _ForwardIterator __first,
>   _ForwardIterator __last, std::forward_iterator_tag);
>
>
>
>      void
>      _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
># 1307 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      void
>      _M_insert_aux(iterator __position, const value_type& __x);
># 1320 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>      size_type
>      _M_check_len(size_type __n, const char* __s) const
>      {
> if (max_size() - size() < __n)
>   __throw_length_error((__s));
>
> const size_type __len = size() + std::max(size(), __n);
> return (__len < size() || __len > max_size()) ? max_size() : __len;
>      }
>
>
>
>
>
>      void
>      _M_erase_at_end(pointer __pos)
>      {
> std::_Destroy(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator());
> this->_M_impl._M_finish = __pos;
>      }
>    };
># 1353 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return (__x.size() == __y.size()
>       && std::equal(__x.begin(), __x.end(), __y.begin())); }
># 1370 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_vector.h" 3
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return std::lexicographical_compare(__x.begin(), __x.end(),
>       __y.begin(), __y.end()); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline void
>    swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)
>    { __x.swap(__y); }
>
>
>}
># 66 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 2 3
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 1 3
># 64 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
>
>
>  typedef unsigned long _Bit_type;
>  enum { _S_word_bit = int(8 * sizeof(_Bit_type)) };
>
>  struct _Bit_reference
>  {
>    _Bit_type * _M_p;
>    _Bit_type _M_mask;
>
>    _Bit_reference(_Bit_type * __x, _Bit_type __y)
>    : _M_p(__x), _M_mask(__y) { }
>
>    _Bit_reference() : _M_p(0), _M_mask(0) { }
>
>    operator bool() const
>    { return !!(*_M_p & _M_mask); }
>
>    _Bit_reference&
>    operator=(bool __x)
>    {
>      if (__x)
> *_M_p |= _M_mask;
>      else
> *_M_p &= ~_M_mask;
>      return *this;
>    }
>
>    _Bit_reference&
>    operator=(const _Bit_reference& __x)
>    { return *this = bool(__x); }
>
>    bool
>    operator==(const _Bit_reference& __x) const
>    { return bool(*this) == bool(__x); }
>
>    bool
>    operator<(const _Bit_reference& __x) const
>    { return !bool(*this) && bool(__x); }
>
>    void
>    flip()
>    { *_M_p ^= _M_mask; }
>  };
>
>  struct _Bit_iterator_base
>  : public std::iterator<std::random_access_iterator_tag, bool>
>  {
>    _Bit_type * _M_p;
>    unsigned int _M_offset;
>
>    _Bit_iterator_base(_Bit_type * __x, unsigned int __y)
>    : _M_p(__x), _M_offset(__y) { }
>
>    void
>    _M_bump_up()
>    {
>      if (_M_offset++ == int(_S_word_bit) - 1)
> {
>   _M_offset = 0;
>   ++_M_p;
> }
>    }
>
>    void
>    _M_bump_down()
>    {
>      if (_M_offset-- == 0)
> {
>   _M_offset = int(_S_word_bit) - 1;
>   --_M_p;
> }
>    }
>
>    void
>    _M_incr(ptrdiff_t __i)
>    {
>      difference_type __n = __i + _M_offset;
>      _M_p += __n / int(_S_word_bit);
>      __n = __n % int(_S_word_bit);
>      if (__n < 0)
> {
>   __n += int(_S_word_bit);
>   --_M_p;
> }
>      _M_offset = static_cast<unsigned int>(__n);
>    }
>
>    bool
>    operator==(const _Bit_iterator_base& __i) const
>    { return _M_p == __i._M_p && _M_offset == __i._M_offset; }
>
>    bool
>    operator<(const _Bit_iterator_base& __i) const
>    {
>      return _M_p < __i._M_p
>      || (_M_p == __i._M_p && _M_offset < __i._M_offset);
>    }
>
>    bool
>    operator!=(const _Bit_iterator_base& __i) const
>    { return !(*this == __i); }
>
>    bool
>    operator>(const _Bit_iterator_base& __i) const
>    { return __i < *this; }
>
>    bool
>    operator<=(const _Bit_iterator_base& __i) const
>    { return !(__i < *this); }
>
>    bool
>    operator>=(const _Bit_iterator_base& __i) const
>    { return !(*this < __i); }
>  };
>
>  inline ptrdiff_t
>  operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
>  {
>    return (int(_S_word_bit) * (__x._M_p - __y._M_p)
>     + __x._M_offset - __y._M_offset);
>  }
>
>  struct _Bit_iterator : public _Bit_iterator_base
>  {
>    typedef _Bit_reference reference;
>    typedef _Bit_reference* pointer;
>    typedef _Bit_iterator iterator;
>
>    _Bit_iterator() : _Bit_iterator_base(0, 0) { }
>
>    _Bit_iterator(_Bit_type * __x, unsigned int __y)
>    : _Bit_iterator_base(__x, __y) { }
>
>    reference
>    operator*() const
>    { return reference(_M_p, 1UL << _M_offset); }
>
>    iterator&
>    operator++()
>    {
>      _M_bump_up();
>      return *this;
>    }
>
>    iterator
>    operator++(int)
>    {
>      iterator __tmp = *this;
>      _M_bump_up();
>      return __tmp;
>    }
>
>    iterator&
>    operator--()
>    {
>      _M_bump_down();
>      return *this;
>    }
>
>    iterator
>    operator--(int)
>    {
>      iterator __tmp = *this;
>      _M_bump_down();
>      return __tmp;
>    }
>
>    iterator&
>    operator+=(difference_type __i)
>    {
>      _M_incr(__i);
>      return *this;
>    }
>
>    iterator&
>    operator-=(difference_type __i)
>    {
>      *this += -__i;
>      return *this;
>    }
>
>    iterator
>    operator+(difference_type __i) const
>    {
>      iterator __tmp = *this;
>      return __tmp += __i;
>    }
>
>    iterator
>    operator-(difference_type __i) const
>    {
>      iterator __tmp = *this;
>      return __tmp -= __i;
>    }
>
>    reference
>    operator[](difference_type __i) const
>    { return *(*this + __i); }
>  };
>
>  inline _Bit_iterator
>  operator+(ptrdiff_t __n, const _Bit_iterator& __x)
>  { return __x + __n; }
>
>  struct _Bit_const_iterator : public _Bit_iterator_base
>  {
>    typedef bool reference;
>    typedef bool const_reference;
>    typedef const bool* pointer;
>    typedef _Bit_const_iterator const_iterator;
>
>    _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
>
>    _Bit_const_iterator(_Bit_type * __x, unsigned int __y)
>    : _Bit_iterator_base(__x, __y) { }
>
>    _Bit_const_iterator(const _Bit_iterator& __x)
>    : _Bit_iterator_base(__x._M_p, __x._M_offset) { }
>
>    const_reference
>    operator*() const
>    { return _Bit_reference(_M_p, 1UL << _M_offset); }
>
>    const_iterator&
>    operator++()
>    {
>      _M_bump_up();
>      return *this;
>    }
>
>    const_iterator
>    operator++(int)
>    {
>      const_iterator __tmp = *this;
>      _M_bump_up();
>      return __tmp;
>    }
>
>    const_iterator&
>    operator--()
>    {
>      _M_bump_down();
>      return *this;
>    }
>
>    const_iterator
>    operator--(int)
>    {
>      const_iterator __tmp = *this;
>      _M_bump_down();
>      return __tmp;
>    }
>
>    const_iterator&
>    operator+=(difference_type __i)
>    {
>      _M_incr(__i);
>      return *this;
>    }
>
>    const_iterator&
>    operator-=(difference_type __i)
>    {
>      *this += -__i;
>      return *this;
>    }
>
>    const_iterator
>    operator+(difference_type __i) const
>    {
>      const_iterator __tmp = *this;
>      return __tmp += __i;
>    }
>
>    const_iterator
>    operator-(difference_type __i) const
>    {
>      const_iterator __tmp = *this;
>      return __tmp -= __i;
>    }
>
>    const_reference
>    operator[](difference_type __i) const
>    { return *(*this + __i); }
>  };
>
>  inline _Bit_const_iterator
>  operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)
>  { return __x + __n; }
>
>  inline void
>  __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
>  {
>    for (; __first != __last; ++__first)
>      *__first = __x;
>  }
>
>  inline void
>  fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
>  {
>    if (__first._M_p != __last._M_p)
>      {
> std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
> __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
> __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x);
>      }
>    else
>      __fill_bvector(__first, __last, __x);
>  }
>
>  template<typename _Alloc>
>    struct _Bvector_base
>    {
>      typedef typename _Alloc::template rebind<_Bit_type>::other
>        _Bit_alloc_type;
>
>      struct _Bvector_impl
>      : public _Bit_alloc_type
>      {
> _Bit_iterator _M_start;
> _Bit_iterator _M_finish;
> _Bit_type* _M_end_of_storage;
>
> _Bvector_impl()
> : _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage(0)
> { }
>
> _Bvector_impl(const _Bit_alloc_type& __a)
> : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0)
> { }
>
>
>
>
>
>
>
>      };
>
>    public:
>      typedef _Alloc allocator_type;
>
>      _Bit_alloc_type&
>      _M_get_Bit_allocator()
>      { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); }
>
>      const _Bit_alloc_type&
>      _M_get_Bit_allocator() const
>      { return *static_cast<const _Bit_alloc_type*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_get_Bit_allocator()); }
>
>      _Bvector_base()
>      : _M_impl() { }
>
>      _Bvector_base(const allocator_type& __a)
>      : _M_impl(__a) { }
># 440 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>      ~_Bvector_base()
>      { this->_M_deallocate(); }
>
>    protected:
>      _Bvector_impl _M_impl;
>
>      _Bit_type*
>      _M_allocate(size_t __n)
>      { return _M_impl.allocate(_S_nword(__n)); }
>
>      void
>      _M_deallocate()
>      {
> if (_M_impl._M_start._M_p)
>   _M_impl.deallocate(_M_impl._M_start._M_p,
>        _M_impl._M_end_of_storage - _M_impl._M_start._M_p);
>      }
>
>      static size_t
>      _S_nword(size_t __n)
>      { return (__n + int(_S_word_bit) - 1) / int(_S_word_bit); }
>    };
>
>
>}
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default")))
>{
># 490 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>template<typename _Alloc>
>  class vector<bool, _Alloc> : protected _Bvector_base<_Alloc>
>  {
>    typedef _Bvector_base<_Alloc> _Base;
>
>
>
>
>
>  public:
>    typedef bool value_type;
>    typedef size_t size_type;
>    typedef ptrdiff_t difference_type;
>    typedef _Bit_reference reference;
>    typedef bool const_reference;
>    typedef _Bit_reference* pointer;
>    typedef const bool* const_pointer;
>    typedef _Bit_iterator iterator;
>    typedef _Bit_const_iterator const_iterator;
>    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>    typedef std::reverse_iterator<iterator> reverse_iterator;
>    typedef _Alloc allocator_type;
>
>    allocator_type get_allocator() const
>    { return _Base::get_allocator(); }
>
>  protected:
>    using _Base::_M_allocate;
>    using _Base::_M_deallocate;
>    using _Base::_S_nword;
>    using _Base::_M_get_Bit_allocator;
>
>  public:
>    vector()
>    : _Base() { }
>
>    explicit
>    vector(const allocator_type& __a)
>    : _Base(__a) { }
>
>    explicit
>    vector(size_type __n, const bool& __value = bool(),
>    const allocator_type& __a = allocator_type())
>    : _Base(__a)
>    {
>      _M_initialize(__n);
>      std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage,
>  __value ? ~0 : 0);
>    }
>
>    vector(const vector& __x)
>    : _Base(__x._M_get_Bit_allocator())
>    {
>      _M_initialize(__x.size());
>      _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
>    }
># 560 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>    template<typename _InputIterator>
>      vector(_InputIterator __first, _InputIterator __last,
>      const allocator_type& __a = allocator_type())
>      : _Base(__a)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_initialize_dispatch(__first, __last, _Integral());
>      }
>
>    ~vector() { }
>
>    vector&
>    operator=(const vector& __x)
>    {
>      if (&__x == this)
> return *this;
>      if (__x.size() > capacity())
> {
>   this->_M_deallocate();
>   _M_initialize(__x.size());
> }
>      this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
>      begin());
>      return *this;
>    }
># 609 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>    void
>    assign(size_type __n, const bool& __x)
>    { _M_fill_assign(__n, __x); }
>
>    template<typename _InputIterator>
>      void
>      assign(_InputIterator __first, _InputIterator __last)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_assign_dispatch(__first, __last, _Integral());
>      }
>
>
>
>
>
>
>
>    iterator
>    begin()
>    { return this->_M_impl._M_start; }
>
>    const_iterator
>    begin() const
>    { return this->_M_impl._M_start; }
>
>    iterator
>    end()
>    { return this->_M_impl._M_finish; }
>
>    const_iterator
>    end() const
>    { return this->_M_impl._M_finish; }
>
>    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()); }
># 677 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>    size_type
>    size() const
>    { return size_type(end() - begin()); }
>
>    size_type
>    max_size() const
>    {
>      const size_type __isize =
> __gnu_cxx::__numeric_traits<difference_type>::__max
> - int(_S_word_bit) + 1;
>      const size_type __asize = _M_get_Bit_allocator().max_size();
>      return (__asize <= __isize / int(_S_word_bit)
>       ? __asize * int(_S_word_bit) : __isize);
>    }
>
>    size_type
>    capacity() const
>    { return size_type(const_iterator(this->_M_impl._M_end_of_storage, 0)
>         - begin()); }
>
>    bool
>    empty() const
>    { return begin() == end(); }
>
>    reference
>    operator[](size_type __n)
>    {
>      return *iterator(this->_M_impl._M_start._M_p
>         + __n / int(_S_word_bit), __n % int(_S_word_bit));
>    }
>
>    const_reference
>    operator[](size_type __n) const
>    {
>      return *const_iterator(this->_M_impl._M_start._M_p
>        + __n / int(_S_word_bit), __n % int(_S_word_bit));
>    }
>
>  protected:
>    void
>    _M_range_check(size_type __n) const
>    {
>      if (__n >= this->size())
>        __throw_out_of_range(("vector<bool>::_M_range_check"));
>    }
>
>  public:
>    reference
>    at(size_type __n)
>    { _M_range_check(__n); return (*this)[__n]; }
>
>    const_reference
>    at(size_type __n) const
>    { _M_range_check(__n); return (*this)[__n]; }
>
>    void
>    reserve(size_type __n)
>    {
>      if (__n > max_size())
> __throw_length_error(("vector::reserve"));
>      if (capacity() < __n)
> _M_reallocate(__n);
>    }
>
>    reference
>    front()
>    { return *begin(); }
>
>    const_reference
>    front() const
>    { return *begin(); }
>
>    reference
>    back()
>    { return *(end() - 1); }
>
>    const_reference
>    back() const
>    { return *(end() - 1); }
>
>
>
>
>
>
>    void
>    data() { }
>
>    void
>    push_back(bool __x)
>    {
>      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
>        *this->_M_impl._M_finish++ = __x;
>      else
>        _M_insert_aux(end(), __x);
>    }
>
>    void
>    swap(vector& __x)
>    {
>      std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
>      std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
>      std::swap(this->_M_impl._M_end_of_storage,
>  __x._M_impl._M_end_of_storage);
>
>
>
>      std::__alloc_swap<typename _Base::_Bit_alloc_type>::
> _S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator());
>    }
>
>
>    static void
>    swap(reference __x, reference __y)
>    {
>      bool __tmp = __x;
>      __x = __y;
>      __y = __tmp;
>    }
>
>    iterator
>    insert(iterator __position, const bool& __x = bool())
>    {
>      const difference_type __n = __position - begin();
>      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage
>   && __position == end())
>        *this->_M_impl._M_finish++ = __x;
>      else
>        _M_insert_aux(__position, __x);
>      return begin() + __n;
>    }
>
>    template<typename _InputIterator>
>      void
>      insert(iterator __position,
>      _InputIterator __first, _InputIterator __last)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_insert_dispatch(__position, __first, __last, _Integral());
>      }
>
>    void
>    insert(iterator __position, size_type __n, const bool& __x)
>    { _M_fill_insert(__position, __n, __x); }
>
>
>
>
>
>
>    void
>    pop_back()
>    { --this->_M_impl._M_finish; }
>
>    iterator
>    erase(iterator __position)
>    {
>      if (__position + 1 != end())
>        std::copy(__position + 1, end(), __position);
>      --this->_M_impl._M_finish;
>      return __position;
>    }
>
>    iterator
>    erase(iterator __first, iterator __last)
>    {
>      if (__first != __last)
> _M_erase_at_end(std::copy(__last, end(), __first));
>      return __first;
>    }
>
>    void
>    resize(size_type __new_size, bool __x = bool())
>    {
>      if (__new_size < size())
>        _M_erase_at_end(begin() + difference_type(__new_size));
>      else
>        insert(end(), __new_size - size(), __x);
>    }
>
>
>
>
>
>
>
>    void
>    flip()
>    {
>      for (_Bit_type * __p = this->_M_impl._M_start._M_p;
>    __p != this->_M_impl._M_end_of_storage; ++__p)
>        *__p = ~*__p;
>    }
>
>    void
>    clear()
>    { _M_erase_at_end(begin()); }
>
>
>  protected:
>
>    iterator
>    _M_copy_aligned(const_iterator __first, const_iterator __last,
>      iterator __result)
>    {
>      _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
>      return std::copy(const_iterator(__last._M_p, 0), __last,
>         iterator(__q, 0));
>    }
>
>    void
>    _M_initialize(size_type __n)
>    {
>      _Bit_type* __q = this->_M_allocate(__n);
>      this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
>      this->_M_impl._M_start = iterator(__q, 0);
>      this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n);
>    }
>
>    void
>    _M_reallocate(size_type __n);
># 908 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/stl_bvector.h" 3
>    template<typename _Integer>
>      void
>      _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
>      {
> _M_initialize(static_cast<size_type>(__n));
> std::fill(this->_M_impl._M_start._M_p,
>    this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
>      }
>
>    template<typename _InputIterator>
>      void
>      _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
>        __false_type)
>      { _M_initialize_range(__first, __last,
>       std::__iterator_category(__first)); }
>
>    template<typename _InputIterator>
>      void
>      _M_initialize_range(_InputIterator __first, _InputIterator __last,
>     std::input_iterator_tag)
>      {
> for (; __first != __last; ++__first)
>   push_back(*__first);
>      }
>
>    template<typename _ForwardIterator>
>      void
>      _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
>     std::forward_iterator_tag)
>      {
> const size_type __n = std::distance(__first, __last);
> _M_initialize(__n);
> std::copy(__first, __last, this->_M_impl._M_start);
>      }
>
>
>
>    template<typename _Integer>
>      void
>      _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>      { _M_fill_assign(__n, __val); }
>
>    template<class _InputIterator>
>      void
>      _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
>    __false_type)
>      { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
>
>    void
>    _M_fill_assign(size_t __n, bool __x)
>    {
>      if (__n > size())
> {
>   std::fill(this->_M_impl._M_start._M_p,
>      this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
>   insert(end(), __n - size(), __x);
> }
>      else
> {
>   _M_erase_at_end(begin() + __n);
>   std::fill(this->_M_impl._M_start._M_p,
>      this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
> }
>    }
>
>    template<typename _InputIterator>
>      void
>      _M_assign_aux(_InputIterator __first, _InputIterator __last,
>      std::input_iterator_tag)
>      {
> iterator __cur = begin();
> for (; __first != __last && __cur != end(); ++__cur, ++__first)
>   *__cur = *__first;
> if (__first == __last)
>   _M_erase_at_end(__cur);
> else
>   insert(end(), __first, __last);
>      }
>
>    template<typename _ForwardIterator>
>      void
>      _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>      std::forward_iterator_tag)
>      {
> const size_type __len = std::distance(__first, __last);
> if (__len < size())
>   _M_erase_at_end(std::copy(__first, __last, begin()));
> else
>   {
>     _ForwardIterator __mid = __first;
>     std::advance(__mid, size());
>     std::copy(__first, __mid, begin());
>     insert(end(), __mid, __last);
>   }
>      }
>
>
>
>
>
>    template<typename _Integer>
>      void
>      _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
>    __true_type)
>      { _M_fill_insert(__pos, __n, __x); }
>
>    template<typename _InputIterator>
>      void
>      _M_insert_dispatch(iterator __pos,
>    _InputIterator __first, _InputIterator __last,
>    __false_type)
>      { _M_insert_range(__pos, __first, __last,
>   std::__iterator_category(__first)); }
>
>    void
>    _M_fill_insert(iterator __position, size_type __n, bool __x);
>
>    template<typename _InputIterator>
>      void
>      _M_insert_range(iterator __pos, _InputIterator __first,
>        _InputIterator __last, std::input_iterator_tag)
>      {
> for (; __first != __last; ++__first)
>   {
>     __pos = insert(__pos, *__first);
>     ++__pos;
>   }
>      }
>
>    template<typename _ForwardIterator>
>      void
>      _M_insert_range(iterator __position, _ForwardIterator __first,
>        _ForwardIterator __last, std::forward_iterator_tag);
>
>    void
>    _M_insert_aux(iterator __position, bool __x);
>
>    size_type
>    _M_check_len(size_type __n, const char* __s) const
>    {
>      if (max_size() - size() < __n)
> __throw_length_error((__s));
>
>      const size_type __len = size() + std::max(size(), __n);
>      return (__len < size() || __len > max_size()) ? max_size() : __len;
>    }
>
>    void
>    _M_erase_at_end(iterator __pos)
>    { this->_M_impl._M_finish = __pos; }
>  };
>
>
>}
># 67 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 2 3
>
>
>
># 1 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 1 3
># 60 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>namespace std __attribute__ ((__visibility__ ("default")))
>{
>
>
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    reserve(size_type __n)
>    {
>      if (__n > this->max_size())
> __throw_length_error(("vector::reserve"));
>      if (this->capacity() < __n)
> {
>   const size_type __old_size = size();
>   pointer __tmp = _M_allocate_and_copy(__n,
>     (this->_M_impl._M_start),
>     (this->_M_impl._M_finish));
>   std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>   _M_get_Tp_allocator());
>   _M_deallocate(this->_M_impl._M_start,
>   this->_M_impl._M_end_of_storage
>   - this->_M_impl._M_start);
>   this->_M_impl._M_start = __tmp;
>   this->_M_impl._M_finish = __tmp + __old_size;
>   this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
> }
>    }
># 106 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>  template<typename _Tp, typename _Alloc>
>    typename vector<_Tp, _Alloc>::iterator
>    vector<_Tp, _Alloc>::
>    insert(iterator __position, const value_type& __x)
>    {
>      const size_type __n = __position - begin();
>      if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage
>   && __position == end())
> {
>   _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish, __x);
>   ++this->_M_impl._M_finish;
> }
>      else
> {
># 128 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>     _M_insert_aux(__position, __x);
> }
>      return iterator(this->_M_impl._M_start + __n);
>    }
>
>  template<typename _Tp, typename _Alloc>
>    typename vector<_Tp, _Alloc>::iterator
>    vector<_Tp, _Alloc>::
>    erase(iterator __position)
>    {
>      if (__position + 1 != end())
> std::copy(__position + 1, end(), __position);
>      --this->_M_impl._M_finish;
>      _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);
>      return __position;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    typename vector<_Tp, _Alloc>::iterator
>    vector<_Tp, _Alloc>::
>    erase(iterator __first, iterator __last)
>    {
>      if (__first != __last)
> {
>   if (__last != end())
>     std::copy(__last, end(), __first);
>   _M_erase_at_end(__first.base() + (end() - __last));
> }
>      return __first;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    vector<_Tp, _Alloc>&
>    vector<_Tp, _Alloc>::
>    operator=(const vector<_Tp, _Alloc>& __x)
>    {
>      if (&__x != this)
> {
># 182 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>   const size_type __xlen = __x.size();
>   if (__xlen > capacity())
>     {
>       pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
>         __x.end());
>       std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>       _M_deallocate(this->_M_impl._M_start,
>       this->_M_impl._M_end_of_storage
>       - this->_M_impl._M_start);
>       this->_M_impl._M_start = __tmp;
>       this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;
>     }
>   else if (size() >= __xlen)
>     {
>       std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),
>       end(), _M_get_Tp_allocator());
>     }
>   else
>     {
>       std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),
>   this->_M_impl._M_start);
>       std::__uninitialized_copy_a(__x._M_impl._M_start + size(),
>       __x._M_impl._M_finish,
>       this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>     }
>   this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
> }
>      return *this;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    _M_fill_assign(size_t __n, const value_type& __val)
>    {
>      if (__n > capacity())
> {
>   vector __tmp(__n, __val, _M_get_Tp_allocator());
>   __tmp.swap(*this);
> }
>      else if (__n > size())
> {
>   std::fill(begin(), end(), __val);
>   std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
>     __n - size(), __val,
>     _M_get_Tp_allocator());
>   this->_M_impl._M_finish += __n - size();
> }
>      else
>        _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
>    }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _InputIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_assign_aux(_InputIterator __first, _InputIterator __last,
>      std::input_iterator_tag)
>      {
> pointer __cur(this->_M_impl._M_start);
> for (; __first != __last && __cur != this->_M_impl._M_finish;
>      ++__cur, ++__first)
>   *__cur = *__first;
> if (__first == __last)
>   _M_erase_at_end(__cur);
> else
>   insert(end(), __first, __last);
>      }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _ForwardIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>      std::forward_iterator_tag)
>      {
> const size_type __len = std::distance(__first, __last);
>
> if (__len > capacity())
>   {
>     pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
>     std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>     _M_get_Tp_allocator());
>     _M_deallocate(this->_M_impl._M_start,
>     this->_M_impl._M_end_of_storage
>     - this->_M_impl._M_start);
>     this->_M_impl._M_start = __tmp;
>     this->_M_impl._M_finish = this->_M_impl._M_start + __len;
>     this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;
>   }
> else if (size() >= __len)
>   _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
> else
>   {
>     _ForwardIterator __mid = __first;
>     std::advance(__mid, size());
>     std::copy(__first, __mid, this->_M_impl._M_start);
>     this->_M_impl._M_finish =
>       std::__uninitialized_copy_a(__mid, __last,
>       this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>   }
>      }
># 314 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    _M_insert_aux(iterator __position, const _Tp& __x)
>
>    {
>      if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
> {
>   _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
>              (*(this->_M_impl._M_finish - 1))
>                            );
>   ++this->_M_impl._M_finish;
>
>   _Tp __x_copy = __x;
>
>   std::copy_backward(__position.base(), this->_M_impl._M_finish - 2, this->_M_impl._M_finish - 1)
>
>                                  ;
>
>   *__position = __x_copy;
>
>
>
> }
>      else
> {
>   const size_type __len =
>     _M_check_len(size_type(1), "vector::_M_insert_aux");
>   const size_type __elems_before = __position - begin();
>   pointer __new_start(this->_M_allocate(__len));
>   pointer __new_finish(__new_start);
>   try
>     {
>
>
>
>
>       _Alloc_traits::construct(this->_M_impl,
>                         __new_start + __elems_before,
>
>
>
>                                __x);
>
>       __new_finish = 0;
>
>       __new_finish
>  = std::__uninitialized_move_if_noexcept_a
>  (this->_M_impl._M_start, __position.base(),
>   __new_start, _M_get_Tp_allocator());
>
>       ++__new_finish;
>
>       __new_finish
>  = std::__uninitialized_move_if_noexcept_a
>  (__position.base(), this->_M_impl._M_finish,
>   __new_finish, _M_get_Tp_allocator());
>     }
>          catch(...)
>     {
>       if (!__new_finish)
>  _Alloc_traits::destroy(this->_M_impl,
>                         __new_start + __elems_before);
>       else
>  std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());
>       _M_deallocate(__new_start, __len);
>       throw;
>     }
>   std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>   _M_get_Tp_allocator());
>   _M_deallocate(this->_M_impl._M_start,
>   this->_M_impl._M_end_of_storage
>   - this->_M_impl._M_start);
>   this->_M_impl._M_start = __new_start;
>   this->_M_impl._M_finish = __new_finish;
>   this->_M_impl._M_end_of_storage = __new_start + __len;
> }
>    }
># 437 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    _M_fill_insert(iterator __position, size_type __n, const value_type& __x)
>    {
>      if (__n != 0)
> {
>   if (size_type(this->_M_impl._M_end_of_storage
>   - this->_M_impl._M_finish) >= __n)
>     {
>       value_type __x_copy = __x;
>       const size_type __elems_after = end() - __position;
>       pointer __old_finish(this->_M_impl._M_finish);
>       if (__elems_after > __n)
>  {
>    std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
>           this->_M_impl._M_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __n;
>    std::copy_backward(__position.base(), __old_finish - __n, __old_finish)
>                                        ;
>    std::fill(__position.base(), __position.base() + __n,
>       __x_copy);
>  }
>       else
>  {
>    std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
>      __n - __elems_after,
>      __x_copy,
>      _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __n - __elems_after;
>    std::__uninitialized_move_a(__position.base(), __old_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __elems_after;
>    std::fill(__position.base(), __old_finish, __x_copy);
>  }
>     }
>   else
>     {
>       const size_type __len =
>  _M_check_len(__n, "vector::_M_fill_insert");
>       const size_type __elems_before = __position - begin();
>       pointer __new_start(this->_M_allocate(__len));
>       pointer __new_finish(__new_start);
>       try
>  {
>
>    std::__uninitialized_fill_n_a(__new_start + __elems_before,
>      __n, __x,
>      _M_get_Tp_allocator());
>    __new_finish = 0;
>
>    __new_finish
>      = std::__uninitialized_move_if_noexcept_a
>      (this->_M_impl._M_start, __position.base(),
>       __new_start, _M_get_Tp_allocator());
>
>    __new_finish += __n;
>
>    __new_finish
>      = std::__uninitialized_move_if_noexcept_a
>      (__position.base(), this->_M_impl._M_finish,
>       __new_finish, _M_get_Tp_allocator());
>  }
>       catch(...)
>  {
>    if (!__new_finish)
>      std::_Destroy(__new_start + __elems_before,
>      __new_start + __elems_before + __n,
>      _M_get_Tp_allocator());
>    else
>      std::_Destroy(__new_start, __new_finish,
>      _M_get_Tp_allocator());
>    _M_deallocate(__new_start, __len);
>    throw;
>  }
>       std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>       _M_deallocate(this->_M_impl._M_start,
>       this->_M_impl._M_end_of_storage
>       - this->_M_impl._M_start);
>       this->_M_impl._M_start = __new_start;
>       this->_M_impl._M_finish = __new_finish;
>       this->_M_impl._M_end_of_storage = __new_start + __len;
>     }
> }
>    }
># 589 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>  template<typename _Tp, typename _Alloc>
>    template<typename _InputIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_range_insert(iterator __pos, _InputIterator __first,
>        _InputIterator __last, std::input_iterator_tag)
>      {
> for (; __first != __last; ++__first)
>   {
>     __pos = insert(__pos, *__first);
>     ++__pos;
>   }
>      }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _ForwardIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_range_insert(iterator __position, _ForwardIterator __first,
>        _ForwardIterator __last, std::forward_iterator_tag)
>      {
> if (__first != __last)
>   {
>     const size_type __n = std::distance(__first, __last);
>     if (size_type(this->_M_impl._M_end_of_storage
>     - this->_M_impl._M_finish) >= __n)
>       {
>  const size_type __elems_after = end() - __position;
>  pointer __old_finish(this->_M_impl._M_finish);
>  if (__elems_after > __n)
>    {
>      std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
>      this->_M_impl._M_finish,
>      this->_M_impl._M_finish,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_finish += __n;
>      std::copy_backward(__position.base(), __old_finish - __n, __old_finish)
>                                          ;
>      std::copy(__first, __last, __position);
>    }
>  else
>    {
>      _ForwardIterator __mid = __first;
>      std::advance(__mid, __elems_after);
>      std::__uninitialized_copy_a(__mid, __last,
>      this->_M_impl._M_finish,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_finish += __n - __elems_after;
>      std::__uninitialized_move_a(__position.base(),
>      __old_finish,
>      this->_M_impl._M_finish,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_finish += __elems_after;
>      std::copy(__first, __mid, __position);
>    }
>       }
>     else
>       {
>  const size_type __len =
>    _M_check_len(__n, "vector::_M_range_insert");
>  pointer __new_start(this->_M_allocate(__len));
>  pointer __new_finish(__new_start);
>  try
>    {
>      __new_finish
>        = std::__uninitialized_move_if_noexcept_a
>        (this->_M_impl._M_start, __position.base(),
>         __new_start, _M_get_Tp_allocator());
>      __new_finish
>        = std::__uninitialized_copy_a(__first, __last,
>          __new_finish,
>          _M_get_Tp_allocator());
>      __new_finish
>        = std::__uninitialized_move_if_noexcept_a
>        (__position.base(), this->_M_impl._M_finish,
>         __new_finish, _M_get_Tp_allocator());
>    }
>  catch(...)
>    {
>      std::_Destroy(__new_start, __new_finish,
>      _M_get_Tp_allocator());
>      _M_deallocate(__new_start, __len);
>      throw;
>    }
>  std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>         _M_get_Tp_allocator());
>  _M_deallocate(this->_M_impl._M_start,
>         this->_M_impl._M_end_of_storage
>         - this->_M_impl._M_start);
>  this->_M_impl._M_start = __new_start;
>  this->_M_impl._M_finish = __new_finish;
>  this->_M_impl._M_end_of_storage = __new_start + __len;
>       }
>   }
>      }
>
>
>
>  template<typename _Alloc>
>    void
>    vector<bool, _Alloc>::
>    _M_reallocate(size_type __n)
>    {
>      _Bit_type* __q = this->_M_allocate(__n);
>      this->_M_impl._M_finish = _M_copy_aligned(begin(), end(),
>      iterator(__q, 0));
>      this->_M_deallocate();
>      this->_M_impl._M_start = iterator(__q, 0);
>      this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
>    }
>
>  template<typename _Alloc>
>    void
>    vector<bool, _Alloc>::
>    _M_fill_insert(iterator __position, size_type __n, bool __x)
>    {
>      if (__n == 0)
> return;
>      if (capacity() - size() >= __n)
> {
>   std::copy_backward(__position, end(),
>        this->_M_impl._M_finish + difference_type(__n));
>   std::fill(__position, __position + difference_type(__n), __x);
>   this->_M_impl._M_finish += difference_type(__n);
> }
>      else
> {
>   const size_type __len =
>     _M_check_len(__n, "vector<bool>::_M_fill_insert");
>   _Bit_type * __q = this->_M_allocate(__len);
>   iterator __i = _M_copy_aligned(begin(), __position,
>      iterator(__q, 0));
>   std::fill(__i, __i + difference_type(__n), __x);
>   this->_M_impl._M_finish = std::copy(__position, end(),
>           __i + difference_type(__n));
>   this->_M_deallocate();
>   this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
>   this->_M_impl._M_start = iterator(__q, 0);
> }
>    }
>
>  template<typename _Alloc>
>    template<typename _ForwardIterator>
>      void
>      vector<bool, _Alloc>::
>      _M_insert_range(iterator __position, _ForwardIterator __first,
>        _ForwardIterator __last, std::forward_iterator_tag)
>      {
> if (__first != __last)
>   {
>     size_type __n = std::distance(__first, __last);
>     if (capacity() - size() >= __n)
>       {
>  std::copy_backward(__position, end(),
>       this->_M_impl._M_finish
>       + difference_type(__n));
>  std::copy(__first, __last, __position);
>  this->_M_impl._M_finish += difference_type(__n);
>       }
>     else
>       {
>  const size_type __len =
>    _M_check_len(__n, "vector<bool>::_M_insert_range");
>  _Bit_type * __q = this->_M_allocate(__len);
>  iterator __i = _M_copy_aligned(begin(), __position,
>            iterator(__q, 0));
>  __i = std::copy(__first, __last, __i);
>  this->_M_impl._M_finish = std::copy(__position, end(), __i);
>  this->_M_deallocate();
>  this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
>  this->_M_impl._M_start = iterator(__q, 0);
>       }
>   }
>      }
>
>  template<typename _Alloc>
>    void
>    vector<bool, _Alloc>::
>    _M_insert_aux(iterator __position, bool __x)
>    {
>      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
> {
>   std::copy_backward(__position, this->_M_impl._M_finish,
>        this->_M_impl._M_finish + 1);
>   *__position = __x;
>   ++this->_M_impl._M_finish;
> }
>      else
> {
>   const size_type __len =
>     _M_check_len(size_type(1), "vector<bool>::_M_insert_aux");
>   _Bit_type * __q = this->_M_allocate(__len);
>   iterator __i = _M_copy_aligned(begin(), __position,
>      iterator(__q, 0));
>   *__i++ = __x;
>   this->_M_impl._M_finish = std::copy(__position, end(), __i);
>   this->_M_deallocate();
>   this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
>   this->_M_impl._M_start = iterator(__q, 0);
> }
>    }
># 809 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/bits/vector.tcc" 3
>
>}
># 71 "/usr/lib/gcc/x86_64-redhat-linux/4.7.0/../../../../include/c++/4.7.0/vector" 2 3
># 53 "/usr/include/QtCore/qvector.h" 2 3 4
># 64 "/usr/include/QtCore/qvector.h" 3 4
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>struct __attribute__((visibility("default"))) QVectorData
>{
>    QBasicAtomicInt ref;
>    int alloc;
>    int size;
>
>
>
>
>
>
>    uint sharable : 1;
>    uint capacity : 1;
>    uint reserved : 30;
>
>
>    static QVectorData shared_null;
>
>
>
>    static QVectorData *malloc(int sizeofTypedData, int size, int sizeofT, QVectorData *init);
>    static QVectorData *allocate(int size, int alignment);
>    static QVectorData *reallocate(QVectorData *old, int newsize, int oldsize, int alignment);
>    static void free(QVectorData *data, int alignment);
>    static int grow(int sizeofTypedData, int size, int sizeofT, bool excessive);
>};
>
>template <typename T>
>struct QVectorTypedData : private QVectorData
>{
>
>    T array[1];
>
>    static inline void free(QVectorTypedData<T> *x, int alignment) { QVectorData::free(static_cast<QVectorData *>(x), alignment); }
>};
>
>class QRegion;
>
>template <typename T>
>class QVector
>{
>    typedef QVectorTypedData<T> Data;
>    union {
>        QVectorData *d;
>
>
>
>        Data *p;
>
>    };
>
>public:
>
>
>    inline QVector() : d(&QVectorData::shared_null) { d->ref.ref(); }
>    explicit QVector(int size);
>    QVector(int size, const T &t);
>    inline QVector(const QVector<T> &v) : d(v.d) { d->ref.ref(); if (!d->sharable) detach_helper(); }
>    inline ~QVector() { if (!d) return; if (!d->ref.deref()) free(p); }
>    QVector<T> &operator=(const QVector<T> &v);
>
>
>
>
>    inline void swap(QVector<T> &other) { qSwap(d, other.d); }
>
>
>
>    bool operator==(const QVector<T> &v) const;
>    inline bool operator!=(const QVector<T> &v) const { return !(*this == v); }
>
>    inline int size() const { return d->size; }
>
>    inline bool isEmpty() const { return d->size == 0; }
>
>    void resize(int size);
>
>    inline int capacity() const { return d->alloc; }
>    void reserve(int size);
>    inline void squeeze() { realloc(d->size, d->size); d->capacity = 0; }
>
>    inline void detach() { if (d->ref != 1) detach_helper(); }
>    inline bool isDetached() const { return d->ref == 1; }
>    inline void setSharable(bool sharable) { if (!sharable) detach(); d->sharable = sharable; }
>    inline bool isSharedWith(const QVector<T> &other) const { return d == other.d; }
>
>    inline T *data() { detach(); return p->array; }
>    inline const T *data() const { return p->array; }
>    inline const T *constData() const { return p->array; }
>    void clear();
>
>    const T &at(int i) const;
>    T &operator[](int i);
>    const T &operator[](int i) const;
>    void append(const T &t);
>    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);
>
>    QVector<T> &fill(const T &t, int size = -1);
>
>    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;
># 244 "/usr/include/QtCore/qvector.h" 3 4
>    typedef T* iterator;
>    typedef const T* const_iterator;
>
>    inline iterator begin() { detach(); return p->array; }
>    inline const_iterator begin() const { return p->array; }
>    inline const_iterator constBegin() const { return p->array; }
>    inline iterator end() { detach(); return p->array + d->size; }
>    inline const_iterator end() const { return p->array + d->size; }
>    inline const_iterator constEnd() const { return p->array + d->size; }
>    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); }
>
>
>    inline int count() const { return d->size; }
>    inline T& first() { qt_noop(); return *begin(); }
>    inline const T &first() const { qt_noop(); return *begin(); }
>    inline T& last() { qt_noop(); return *(end()-1); }
>    inline const T &last() const { qt_noop(); return *(end()-1); }
>    inline bool startsWith(const T &t) const { return !isEmpty() && first() == t; }
>    inline bool endsWith(const T &t) const { return !isEmpty() && last() == t; }
>    QVector<T> mid(int pos, int length = -1) const;
>
>    T value(int i) const;
>    T value(int i, const T &defaultValue) const;
>
>
>    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 iterator Iterator;
>    typedef const_iterator ConstIterator;
>    typedef int size_type;
>    inline void push_back(const T &t) { append(t); }
>    inline void push_front(const T &t) { prepend(t); }
>    void pop_back() { qt_noop(); erase(end()-1); }
>    void pop_front() { qt_noop(); erase(begin()); }
>    inline bool empty() const
>    { return d->size == 0; }
>    inline T& front() { return first(); }
>    inline const_reference front() const { return first(); }
>    inline reference back() { return last(); }
>    inline const_reference back() const { return last(); }
>
>
>    QVector<T> &operator+=(const QVector<T> &l);
>    inline QVector<T> operator+(const QVector<T> &l) const
>    { QVector n = *this; n += l; return n; }
>    inline QVector<T> &operator+=(const T &t)
>    { append(t); return *this; }
>    inline QVector<T> &operator<< (const T &t)
>    { append(t); return *this; }
>    inline QVector<T> &operator<<(const QVector<T> &l)
>    { *this += l; return *this; }
>
>    QList<T> toList() const;
>
>    static QVector<T> fromList(const QList<T> &list);
>
>
>    static inline QVector<T> fromStdVector(const std::vector<T> &vector)
>    { QVector<T> tmp; tmp.reserve(int(vector.size())); qCopy(vector.begin(), vector.end(), std::back_inserter(tmp)); return tmp; }
>    inline std::vector<T> toStdVector() const
>    { std::vector<T> tmp; tmp.reserve(size()); qCopy(constBegin(), constEnd(), std::back_inserter(tmp)); return tmp; }
>
>private:
>    friend class QRegion;
>
>    void detach_helper();
>    QVectorData *malloc(int alloc);
>    void realloc(int size, int alloc);
>    void free(Data *d);
>    int sizeOfTypedData() {
>
>
>        return reinterpret_cast<const char *>(&(reinterpret_cast<const Data *>(this))->array[1]) - reinterpret_cast<const char *>(this);
>    }
>    inline int alignOfTypedData() const
>    {
>
>        return qMax<int>(sizeof(void*), __alignof__(Data));
>
>
>
>    }
>};
>
>template <typename T>
>void QVector<T>::detach_helper()
>{ realloc(d->size, d->alloc); }
>template <typename T>
>void QVector<T>::reserve(int asize)
>{ if (asize > d->alloc) realloc(d->size, asize); if (d->ref == 1) d->capacity = 1; }
>template <typename T>
>void QVector<T>::resize(int asize)
>{ realloc(asize, (asize > d->alloc || (!d->capacity && asize < d->size && asize < (d->alloc >> 1))) ?
>          QVectorData::grow(sizeOfTypedData(), asize, sizeof(T), QTypeInfo<T>::isStatic)
>          : d->alloc); }
>template <typename T>
>inline void QVector<T>::clear()
>{ *this = QVector<T>(); }
>template <typename T>
>inline const T &QVector<T>::at(int i) const
>{ qt_noop();
>  return p->array[i]; }
>template <typename T>
>inline const T &QVector<T>::operator[](int i) const
>{ qt_noop();
>  return p->array[i]; }
>template <typename T>
>inline T &QVector<T>::operator[](int i)
>{ qt_noop();
>  return data()[i]; }
>template <typename T>
>inline void QVector<T>::insert(int i, const T &t)
>{ qt_noop();
>  insert(begin() + i, 1, t); }
>template <typename T>
>inline void QVector<T>::insert(int i, int n, const T &t)
>{ qt_noop();
>  insert(begin() + i, n, t); }
>template <typename T>
>inline void QVector<T>::remove(int i, int n)
>{ qt_noop();
>  erase(begin() + i, begin() + i + n); }
>template <typename T>
>inline void QVector<T>::remove(int i)
>{ qt_noop();
>  erase(begin() + i, begin() + i + 1); }
>template <typename T>
>inline void QVector<T>::prepend(const T &t)
>{ insert(begin(), 1, t); }
>
>template <typename T>
>inline void QVector<T>::replace(int i, const T &t)
>{
>    qt_noop();
>    const T copy(t);
>    data()[i] = copy;
>}
>
>template <typename T>
>QVector<T> &QVector<T>::operator=(const QVector<T> &v)
>{
>    QVectorData *o = v.d;
>    o->ref.ref();
>    if (!d->ref.deref())
>        free(p);
>    d = o;
>    if (!d->sharable)
>        detach_helper();
>    return *this;
>}
>
>template <typename T>
>inline QVectorData *QVector<T>::malloc(int aalloc)
>{
>    QVectorData *vectordata = QVectorData::allocate(sizeOfTypedData() + (aalloc - 1) * sizeof(T), alignOfTypedData());
>    do { if (!(vectordata)) qBadAlloc(); } while (0);
>    return vectordata;
>}
>
>template <typename T>
>QVector<T>::QVector(int asize)
>{
>    d = malloc(asize);
>    d->ref = 1;
>    d->alloc = d->size = asize;
>    d->sharable = true;
>    d->capacity = false;
>    if (QTypeInfo<T>::isComplex) {
>        T* b = p->array;
>        T* i = p->array + d->size;
>        while (i != b)
>            new (--i) T;
>    } else {
>        qMemSet(p->array, 0, asize * sizeof(T));
>    }
>}
>
>template <typename T>
>QVector<T>::QVector(int asize, const T &t)
>{
>    d = malloc(asize);
>    d->ref = 1;
>    d->alloc = d->size = asize;
>    d->sharable = true;
>    d->capacity = false;
>    T* i = p->array + d->size;
>    while (i != p->array)
>        new (--i) T(t);
>}
># 457 "/usr/include/QtCore/qvector.h" 3 4
>template <typename T>
>void QVector<T>::free(Data *x)
>{
>    if (QTypeInfo<T>::isComplex) {
>        T* b = x->array;
>        union { QVectorData *d; Data *p; } u;
>        u.p = x;
>        T* i = b + u.d->size;
>        while (i-- != b)
>             i->~T();
>    }
>    x->free(x, alignOfTypedData());
>}
>
>template <typename T>
>void QVector<T>::realloc(int asize, int aalloc)
>{
>    qt_noop();
>    T *pOld;
>    T *pNew;
>    union { QVectorData *d; Data *p; } x;
>    x.d = d;
>
>    if (QTypeInfo<T>::isComplex && asize < d->size && d->ref == 1 ) {
>
>
>        pOld = p->array + d->size;
>        pNew = p->array + asize;
>        while (asize < d->size) {
>            (--pOld)->~T();
>            d->size--;
>        }
>    }
>
>    if (aalloc != d->alloc || d->ref != 1) {
>
>        if (QTypeInfo<T>::isStatic) {
>            x.d = malloc(aalloc);
>            do { if (!(x.p)) qBadAlloc(); } while (0);
>            x.d->size = 0;
>        } else if (d->ref != 1) {
>            x.d = malloc(aalloc);
>            do { if (!(x.p)) qBadAlloc(); } while (0);
>            if (QTypeInfo<T>::isComplex) {
>                x.d->size = 0;
>            } else {
>                ::memcpy(x.p, p, sizeOfTypedData() + (qMin(aalloc, d->alloc) - 1) * sizeof(T));
>                x.d->size = d->size;
>            }
>        } else {
>            try {
>                QVectorData *mem = QVectorData::reallocate(d, sizeOfTypedData() + (aalloc - 1) * sizeof(T),
>                                                           sizeOfTypedData() + (d->alloc - 1) * sizeof(T), alignOfTypedData());
>                do { if (!(mem)) qBadAlloc(); } while (0);
>                x.d = d = mem;
>                x.d->size = d->size;
>            } catch (const std::bad_alloc &) {
>                if (aalloc > d->alloc)
>                    throw;
>            }
>        }
>        x.d->ref = 1;
>        x.d->alloc = aalloc;
>        x.d->sharable = true;
>        x.d->capacity = d->capacity;
>        x.d->reserved = 0;
>    }
>
>    if (QTypeInfo<T>::isComplex) {
>        try {
>            pOld = p->array + x.d->size;
>            pNew = x.p->array + x.d->size;
>
>            const int toMove = qMin(asize, d->size);
>            while (x.d->size < toMove) {
>                new (pNew++) T(*pOld++);
>                x.d->size++;
>            }
>
>            while (x.d->size < asize) {
>                new (pNew++) T;
>                x.d->size++;
>            }
>        } catch (...) {
>            free(x.p);
>            throw;
>        }
>
>    } else if (asize > x.d->size) {
>
>        qMemSet(x.p->array + x.d->size, 0, (asize - x.d->size) * sizeof(T));
>    }
>    x.d->size = asize;
>
>    if (d != x.d) {
>        if (!d->ref.deref())
>            free(p);
>        d = x.d;
>    }
>}
>
>template<typename T>
> T QVector<T>::value(int i) const
>{
>    if (i < 0 || i >= d->size) {
>        return T();
>    }
>    return p->array[i];
>}
>template<typename T>
> T QVector<T>::value(int i, const T &defaultValue) const
>{
>    return ((i < 0 || i >= d->size) ? defaultValue : p->array[i]);
>}
>
>template <typename T>
>void QVector<T>::append(const T &t)
>{
>    if (d->ref != 1 || d->size + 1 > d->alloc) {
>        const T copy(t);
>        realloc(d->size, QVectorData::grow(sizeOfTypedData(), d->size + 1, sizeof(T),
>                                           QTypeInfo<T>::isStatic));
>        if (QTypeInfo<T>::isComplex)
>            new (p->array + d->size) T(copy);
>        else
>            p->array[d->size] = copy;
>    } else {
>        if (QTypeInfo<T>::isComplex)
>            new (p->array + d->size) T(t);
>        else
>            p->array[d->size] = t;
>    }
>    ++d->size;
>}
>
>template <typename T>
>typename QVector<T>::iterator QVector<T>::insert(iterator before, size_type n, const T &t)
>{
>    int offset = int(before - p->array);
>    if (n != 0) {
>        const T copy(t);
>        if (d->ref != 1 || d->size + n > d->alloc)
>            realloc(d->size, QVectorData::grow(sizeOfTypedData(), d->size + n, sizeof(T),
>                                               QTypeInfo<T>::isStatic));
>        if (QTypeInfo<T>::isStatic) {
>            T *b = p->array + d->size;
>            T *i = p->array + d->size + n;
>            while (i != b)
>                new (--i) T;
>            i = p->array + d->size;
>            T *j = i + n;
>            b = p->array + offset;
>            while (i != b)
>                *--j = *--i;
>            i = b+n;
>            while (i != b)
>                *--i = copy;
>        } else {
>            T *b = p->array + offset;
>            T *i = b + n;
>            memmove(i, b, (d->size - offset) * sizeof(T));
>            while (i != b)
>                new (--i) T(copy);
>        }
>        d->size += n;
>    }
>    return p->array + offset;
>}
>
>template <typename T>
>typename QVector<T>::iterator QVector<T>::erase(iterator abegin, iterator aend)
>{
>    int f = int(abegin - p->array);
>    int l = int(aend - p->array);
>    int n = l - f;
>    detach();
>    if (QTypeInfo<T>::isComplex) {
>        qCopy(p->array+l, p->array+d->size, p->array+f);
>        T *i = p->array+d->size;
>        T* b = p->array+d->size-n;
>        while (i != b) {
>            --i;
>            i->~T();
>        }
>    } else {
>        memmove(p->array + f, p->array + l, (d->size-l)*sizeof(T));
>    }
>    d->size -= n;
>    return p->array + f;
>}
>
>template <typename T>
>bool QVector<T>::operator==(const QVector<T> &v) const
>{
>    if (d->size != v.d->size)
>        return false;
>    if (d == v.d)
>        return true;
>    T* b = p->array;
>    T* i = b + d->size;
>    T* j = v.p->array + d->size;
>    while (i != b)
>        if (!(*--i == *--j))
>            return false;
>    return true;
>}
>
>template <typename T>
>QVector<T> &QVector<T>::fill(const T &from, int asize)
>{
>    const T copy(from);
>    resize(asize < 0 ? d->size : asize);
>    if (d->size) {
>        T *i = p->array + d->size;
>        T *b = p->array;
>        while (i != b)
>            *--i = copy;
>    }
>    return *this;
>}
>
>template <typename T>
>QVector<T> &QVector<T>::operator+=(const QVector &l)
>{
>    int newSize = d->size + l.d->size;
>    realloc(d->size, newSize);
>
>    T *w = p->array + newSize;
>    T *i = l.p->array + l.d->size;
>    T *b = l.p->array;
>    while (i != b) {
>        if (QTypeInfo<T>::isComplex)
>            new (--w) T(*--i);
>        else
>            *--w = *--i;
>    }
>    d->size = newSize;
>    return *this;
>}
>
>template <typename T>
>int QVector<T>::indexOf(const T &t, int from) const
>{
>    if (from < 0)
>        from = qMax(from + d->size, 0);
>    if (from < d->size) {
>        T* n = p->array + from - 1;
>        T* e = p->array + d->size;
>        while (++n != e)
>            if (*n == t)
>                return n - p->array;
>    }
>    return -1;
>}
>
>template <typename T>
>int QVector<T>::lastIndexOf(const T &t, int from) const
>{
>    if (from < 0)
>        from += d->size;
>    else if (from >= d->size)
>        from = d->size-1;
>    if (from >= 0) {
>        T* b = p->array;
>        T* n = p->array + from + 1;
>        while (n != b) {
>            if (*--n == t)
>                return n - b;
>        }
>    }
>    return -1;
>}
>
>template <typename T>
>bool QVector<T>::contains(const T &t) const
>{
>    T* b = p->array;
>    T* i = p->array + d->size;
>    while (i != b)
>        if (*--i == t)
>            return true;
>    return false;
>}
>
>template <typename T>
>int QVector<T>::count(const T &t) const
>{
>    int c = 0;
>    T* b = p->array;
>    T* i = p->array + d->size;
>    while (i != b)
>        if (*--i == t)
>            ++c;
>    return c;
>}
>
>template <typename T>
> QVector<T> QVector<T>::mid(int pos, int length) const
>{
>    if (length < 0)
>        length = size() - pos;
>    if (pos == 0 && length == size())
>        return *this;
>    if (pos + length > size())
>        length = size() - pos;
>    QVector<T> copy;
>    copy.reserve(length);
>    for (int i = pos; i < pos + length; ++i)
>        copy += at(i);
>    return copy;
>}
>
>template <typename T>
> QList<T> QVector<T>::toList() const
>{
>    QList<T> result;
>    result.reserve(size());
>    for (int i = 0; i < size(); ++i)
>        result.append(at(i));
>    return result;
>}
>
>template <typename T>
> QVector<T> QList<T>::toVector() const
>{
>    QVector<T> result(size());
>    for (int i = 0; i < size(); ++i)
>        result[i] = at(i);
>    return result;
>}
>
>template <typename T>
>QVector<T> QVector<T>::fromList(const QList<T> &list)
>{
>    return list.toVector();
>}
>
>template <typename T>
>QList<T> QList<T>::fromVector(const QVector<T> &vector)
>{
>    return vector.toList();
>}
>
>template <class T> class QVectorIterator { typedef typename QVector<T>::const_iterator const_iterator; QVector<T> c; const_iterator i; public: inline QVectorIterator(const QVector<T> &container) : c(container), i(c.constBegin()) {} inline QVectorIterator &operator=(const QVector<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 QMutableVectorIterator { typedef typename QVector<T>::iterator iterator; typedef typename QVector<T>::const_iterator const_iterator; QVector<T> *c; iterator i, n; inline bool item_exists() const { return const_iterator(n) != c->constEnd(); } public: inline QMutableVectorIterator(QVector<T> &container) : c(&container) { c->setSharable(false); i = c->begin(); n = c->end(); } inline ~QMutableVectorIterator() { c->setSharable(true); } inline QMutableVectorIterator &operator=(QVector<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() { qt_noop(); return *n; } inline const T &value() const { 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; } };
># 825 "/usr/include/QtCore/qvector.h" 3 4
># 46 "/usr/include/QtGui/qpolygon.h" 2 3 4
>
>
>
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QMatrix;
>class QTransform;
>class QRect;
>class QVariant;
>
>class __attribute__((visibility("default"))) QPolygon : public QVector<QPoint>
>{
>public:
>    inline QPolygon() {}
>    inline ~QPolygon() {}
>    inline QPolygon(int size);
>    inline QPolygon(const QPolygon &a) : QVector<QPoint>(a) {}
>    inline QPolygon(const QVector<QPoint> &v) : QVector<QPoint>(v) {}
>    QPolygon(const QRect &r, bool closed=false);
>    QPolygon(int nPoints, const int *points);
>    inline void swap(QPolygon &other) { QVector<QPoint>::swap(other); }
>
>    operator QVariant() const;
>
>    void translate(int dx, int dy);
>    void translate(const QPoint &offset);
>
>    QPolygon translated(int dx, int dy) const;
>    inline QPolygon translated(const QPoint &offset) const;
>
>    QRect boundingRect() const;
>
>    void point(int i, int *x, int *y) const;
>    QPoint point(int i) const;
>    void setPoint(int index, int x, int y);
>    void setPoint(int index, const QPoint &p);
>    void setPoints(int nPoints, const int *points);
>    void setPoints(int nPoints, int firstx, int firsty, ...);
>    void putPoints(int index, int nPoints, const int *points);
>    void putPoints(int index, int nPoints, int firstx, int firsty, ...);
>    void putPoints(int index, int nPoints, const QPolygon & from, int fromIndex=0);
>
>    bool containsPoint(const QPoint &pt, Qt::FillRule fillRule) const;
>
>    QPolygon united(const QPolygon &r) const;
>    QPolygon intersected(const QPolygon &r) const;
>    QPolygon subtracted(const QPolygon &r) const;
>};
>
>inline QPolygon::QPolygon(int asize) : QVector<QPoint>(asize) {}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QPolygon &);
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &stream, const QPolygon &polygon);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &stream, QPolygon &polygon);
>
>
>
>
>
>
>inline void QPolygon::setPoint(int index, const QPoint &pt)
>{ (*this)[index] = pt; }
>
>inline void QPolygon::setPoint(int index, int x, int y)
>{ (*this)[index] = QPoint(x, y); }
>
>inline QPoint QPolygon::point(int index) const
>{ return at(index); }
>
>inline void QPolygon::translate(const QPoint &offset)
>{ translate(offset.x(), offset.y()); }
>
>inline QPolygon QPolygon::translated(const QPoint &offset) const
>{ return translated(offset.x(), offset.y()); }
>
>class QRectF;
>
>class __attribute__((visibility("default"))) QPolygonF : public QVector<QPointF>
>{
>public:
>    inline QPolygonF() {}
>    inline ~QPolygonF() {}
>    inline QPolygonF(int size);
>    inline QPolygonF(const QPolygonF &a) : QVector<QPointF>(a) {}
>    inline QPolygonF(const QVector<QPointF> &v) : QVector<QPointF>(v) {}
>    QPolygonF(const QRectF &r);
>    QPolygonF(const QPolygon &a);
>    inline void swap(QPolygonF &other) { QVector<QPointF>::swap(other); }
>
>    inline void translate(qreal dx, qreal dy);
>    void translate(const QPointF &offset);
>
>    inline QPolygonF translated(qreal dx, qreal dy) const;
>    QPolygonF translated(const QPointF &offset) const;
>
>    QPolygon toPolygon() const;
>
>    bool isClosed() const { return !isEmpty() && first() == last(); }
>
>    QRectF boundingRect() const;
>
>    bool containsPoint(const QPointF &pt, Qt::FillRule fillRule) const;
>
>    QPolygonF united(const QPolygonF &r) const;
>    QPolygonF intersected(const QPolygonF &r) const;
>    QPolygonF subtracted(const QPolygonF &r) const;
>};
>
>inline QPolygonF::QPolygonF(int asize) : QVector<QPointF>(asize) {}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QPolygonF &);
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &stream, const QPolygonF &array);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &stream, QPolygonF &array);
>
>
>inline void QPolygonF::translate(qreal dx, qreal dy)
>{ translate(QPointF(dx, dy)); }
>
>inline QPolygonF QPolygonF::translated(qreal dx, qreal dy) const
>{ return translated(QPointF(dx, dy)); }
># 46 "/usr/include/QtGui/qmatrix.h" 2 3 4
># 1 "/usr/include/QtGui/qregion.h" 1 3 4
># 53 "/usr/include/QtGui/qregion.h" 3 4
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>template <class T> class QVector;
>class QVariant;
>
>
>struct QRegionPrivate;
>
>
>class QBitmap;
>
>class __attribute__((visibility("default"))) QRegion
>{
>public:
>    enum RegionType { Rectangle, Ellipse };
>
>    QRegion();
>    QRegion(int x, int y, int w, int h, RegionType t = Rectangle);
>    QRegion(const QRect &r, RegionType t = Rectangle);
>    QRegion(const QPolygon &pa, Qt::FillRule fillRule = Qt::OddEvenFill);
>
>
>
>    QRegion(const QRegion &region);
>    QRegion(const QBitmap &bitmap);
>    ~QRegion();
>    QRegion &operator=(const QRegion &);
>
>
>
>
>    inline void swap(QRegion &other) { qSwap(d, other.d); }
>
>
>
>    bool isEmpty() const;
>
>    bool contains(const QPoint &p) const;
>    bool contains(const QRect &r) const;
>
>    void translate(int dx, int dy);
>    inline void translate(const QPoint &p) { translate(p.x(), p.y()); }
>    QRegion translated(int dx, int dy) const;
>    inline QRegion translated(const QPoint &p) const { return translated(p.x(), p.y()); }
>
>
>    QRegion unite(const QRegion &r) const;
>    QRegion unite(const QRect &r) const;
>    QRegion intersect(const QRegion &r) const;
>    QRegion intersect(const QRect &r) const;
>    QRegion subtract(const QRegion &r) const;
>    QRegion eor(const QRegion &r) const;
>
>    inline QRegion united(const QRegion &r) const { return unite(r); }
>    inline QRegion united(const QRect &r) const { return unite(r); }
>    inline QRegion intersected(const QRegion &r) const { return intersect(r); }
>    inline QRegion intersected(const QRect &r) const { return intersect(r); }
>    inline QRegion subtracted(const QRegion &r) const { return subtract(r); }
>    inline QRegion xored(const QRegion &r) const { return eor(r); }
>
>    bool intersects(const QRegion &r) const;
>    bool intersects(const QRect &r) const;
>
>    QRect boundingRect() const;
>    QVector<QRect> rects() const;
>    void setRects(const QRect *rect, int num);
>
>    int numRects() const;
>
>    int rectCount() const;
>
>    const QRegion operator|(const QRegion &r) const;
>    const QRegion operator+(const QRegion &r) const;
>    const QRegion operator+(const QRect &r) const;
>    const QRegion operator&(const QRegion &r) const;
>    const QRegion operator&(const QRect &r) const;
>    const QRegion operator-(const QRegion &r) const;
>    const QRegion operator^(const QRegion &r) const;
>    QRegion& operator|=(const QRegion &r);
>    QRegion& operator+=(const QRegion &r);
>    QRegion& operator+=(const QRect &r);
>    QRegion& operator&=(const QRegion &r);
>    QRegion& operator&=(const QRect &r);
>    QRegion& operator-=(const QRegion &r);
>    QRegion& operator^=(const QRegion &r);
>
>    bool operator==(const QRegion &r) const;
>    inline bool operator!=(const QRegion &r) const { return !(operator==(r)); }
>    operator QVariant() const;
># 154 "/usr/include/QtGui/qregion.h" 3 4
>    inline Region handle() const { if(!d->rgn) updateX11Region(); return d->rgn; }
># 176 "/usr/include/QtGui/qregion.h" 3 4
>    friend __attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QRegion &);
>    friend __attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QRegion &);
>
>private:
>    QRegion copy() const;
>    void detach();
>
>
>
>
>    void updateX11Region() const;
>    void *clipRectangles(int &num) const;
>    friend void *qt_getClipRects(const QRegion &r, int &num);
>
>
>
>
>    friend bool qt_region_strictContains(const QRegion &region,
>                                         const QRect &rect);
>    friend struct QRegionPrivate;
>
>
>    void exec(const QByteArray &ba, int ver = 0, QDataStream::ByteOrder byteOrder = QDataStream::BigEndian);
>
>    struct QRegionData {
>        QBasicAtomicInt ref;
>
>
>
>        Region rgn;
>        void *xrectangles;
>
>
>
>
>        QRegionPrivate *qt_rgn;
>
>    };
>
>
>
>    struct QRegionData *d;
>    static struct QRegionData shared_empty;
>    static void cleanUp(QRegionData *x);
>};
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QRegion &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QRegion &);
>
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QRegion &);
># 47 "/usr/include/QtGui/qmatrix.h" 2 3 4
>
># 1 "/usr/include/QtCore/qline.h" 1 3 4
># 47 "/usr/include/QtCore/qline.h" 3 4
>
>
>
>
>typedef QtValidLicenseForCoreModule QtCoreModule;
>
>
>
>
>
>class __attribute__((visibility("default"))) QLine
>{
>public:
>    inline QLine();
>    inline QLine(const QPoint &pt1, const QPoint &pt2);
>    inline QLine(int x1, int y1, int x2, int y2);
>
>    inline bool isNull() const;
>
>    inline QPoint p1() const;
>    inline QPoint p2() const;
>
>    inline int x1() const;
>    inline int y1() const;
>
>    inline int x2() const;
>    inline int y2() const;
>
>    inline int dx() const;
>    inline int dy() const;
>
>    inline void translate(const QPoint &p);
>    inline void translate(int dx, int dy);
>
>    inline QLine translated(const QPoint &p) const;
>    inline QLine translated(int dx, int dy) const;
>
>    inline void setP1(const QPoint &p1);
>    inline void setP2(const QPoint &p2);
>    inline void setPoints(const QPoint &p1, const QPoint &p2);
>    inline void setLine(int x1, int y1, int x2, int y2);
>
>    inline bool operator==(const QLine &d) const;
>    inline bool operator!=(const QLine &d) const { return !(*this == d); }
>
>private:
>    QPoint pt1, pt2;
>};
>template<> class QTypeInfo<QLine > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QLine)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QLine"; } };
>
>
>
>
>
>inline QLine::QLine() { }
>
>inline QLine::QLine(const QPoint &pt1_, const QPoint &pt2_) : pt1(pt1_), pt2(pt2_) { }
>
>inline QLine::QLine(int x1pos, int y1pos, int x2pos, int y2pos) : pt1(QPoint(x1pos, y1pos)), pt2(QPoint(x2pos, y2pos)) { }
>
>inline bool QLine::isNull() const
>{
>    return pt1 == pt2;
>}
>
>inline int QLine::x1() const
>{
>    return pt1.x();
>}
>
>inline int QLine::y1() const
>{
>    return pt1.y();
>}
>
>inline int QLine::x2() const
>{
>    return pt2.x();
>}
>
>inline int QLine::y2() const
>{
>    return pt2.y();
>}
>
>inline QPoint QLine::p1() const
>{
>    return pt1;
>}
>
>inline QPoint QLine::p2() const
>{
>    return pt2;
>}
>
>inline int QLine::dx() const
>{
>    return pt2.x() - pt1.x();
>}
>
>inline int QLine::dy() const
>{
>    return pt2.y() - pt1.y();
>}
>
>inline void QLine::translate(const QPoint &point)
>{
>    pt1 += point;
>    pt2 += point;
>}
>
>inline void QLine::translate(int adx, int ady)
>{
>    this->translate(QPoint(adx, ady));
>}
>
>inline QLine QLine::translated(const QPoint &p) const
>{
>    return QLine(pt1 + p, pt2 + p);
>}
>
>inline QLine QLine::translated(int adx, int ady) const
>{
>    return translated(QPoint(adx, ady));
>}
>
>inline void QLine::setP1(const QPoint &aP1)
>{
>    pt1 = aP1;
>}
>
>inline void QLine::setP2(const QPoint &aP2)
>{
>    pt2 = aP2;
>}
>
>inline void QLine::setPoints(const QPoint &aP1, const QPoint &aP2)
>{
>    pt1 = aP1;
>    pt2 = aP2;
>}
>
>inline void QLine::setLine(int aX1, int aY1, int aX2, int aY2)
>{
>    pt1 = QPoint(aX1, aY1);
>    pt2 = QPoint(aX2, aY2);
>}
>
>inline bool QLine::operator==(const QLine &d) const
>{
>    return pt1 == d.pt1 && pt2 == d.pt2;
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug d, const QLine &p);
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QLine &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QLine &);
>
>
>
>
>
>class __attribute__((visibility("default"))) QLineF {
>public:
>
>    enum IntersectType { NoIntersection, BoundedIntersection, UnboundedIntersection };
>
>    inline QLineF();
>    inline QLineF(const QPointF &pt1, const QPointF &pt2);
>    inline QLineF(qreal x1, qreal y1, qreal x2, qreal y2);
>    inline QLineF(const QLine &line) : pt1(line.p1()), pt2(line.p2()) { }
>
>    static QLineF fromPolar(qreal length, qreal angle);
>
>    bool isNull() const;
>
>    inline QPointF p1() const;
>    inline QPointF p2() const;
>
>    inline qreal x1() const;
>    inline qreal y1() const;
>
>    inline qreal x2() const;
>    inline qreal y2() const;
>
>    inline qreal dx() const;
>    inline qreal dy() const;
>
>    qreal length() const;
>    void setLength(qreal len);
>
>    qreal angle() const;
>    void setAngle(qreal angle);
>
>    qreal angleTo(const QLineF &l) const;
>
>    QLineF unitVector() const;
>    QLineF normalVector() const;
>
>
>    IntersectType intersect(const QLineF &l, QPointF *intersectionPoint) const;
>
>    qreal angle(const QLineF &l) const;
>
>    QPointF pointAt(qreal t) const;
>    inline void translate(const QPointF &p);
>    inline void translate(qreal dx, qreal dy);
>
>    inline QLineF translated(const QPointF &p) const;
>    inline QLineF translated(qreal dx, qreal dy) const;
>
>    inline void setP1(const QPointF &p1);
>    inline void setP2(const QPointF &p2);
>    inline void setPoints(const QPointF &p1, const QPointF &p2);
>    inline void setLine(qreal x1, qreal y1, qreal x2, qreal y2);
>
>    inline bool operator==(const QLineF &d) const;
>    inline bool operator!=(const QLineF &d) const { return !(*this == d); }
>
>    QLine toLine() const;
>
>private:
>    QPointF pt1, pt2;
>};
>template<> class QTypeInfo<QLineF > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QLineF)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QLineF"; } };
>
>
>
>
>
>inline QLineF::QLineF()
>{
>}
>
>inline QLineF::QLineF(const QPointF &apt1, const QPointF &apt2)
>    : pt1(apt1), pt2(apt2)
>{
>}
>
>inline QLineF::QLineF(qreal x1pos, qreal y1pos, qreal x2pos, qreal y2pos)
>    : pt1(x1pos, y1pos), pt2(x2pos, y2pos)
>{
>}
>
>inline qreal QLineF::x1() const
>{
>    return pt1.x();
>}
>
>inline qreal QLineF::y1() const
>{
>    return pt1.y();
>}
>
>inline qreal QLineF::x2() const
>{
>    return pt2.x();
>}
>
>inline qreal QLineF::y2() const
>{
>    return pt2.y();
>}
>
>inline QPointF QLineF::p1() const
>{
>    return pt1;
>}
>
>inline QPointF QLineF::p2() const
>{
>    return pt2;
>}
>
>inline qreal QLineF::dx() const
>{
>    return pt2.x() - pt1.x();
>}
>
>inline qreal QLineF::dy() const
>{
>    return pt2.y() - pt1.y();
>}
>
>inline QLineF QLineF::normalVector() const
>{
>    return QLineF(p1(), p1() + QPointF(dy(), -dx()));
>}
>
>inline void QLineF::translate(const QPointF &point)
>{
>    pt1 += point;
>    pt2 += point;
>}
>
>inline void QLineF::translate(qreal adx, qreal ady)
>{
>    this->translate(QPointF(adx, ady));
>}
>
>inline QLineF QLineF::translated(const QPointF &p) const
>{
>    return QLineF(pt1 + p, pt2 + p);
>}
>
>inline QLineF QLineF::translated(qreal adx, qreal ady) const
>{
>    return translated(QPointF(adx, ady));
>}
>
>inline void QLineF::setLength(qreal len)
>{
>    if (isNull())
>        return;
>    QLineF v = unitVector();
>    pt2 = QPointF(pt1.x() + v.dx() * len, pt1.y() + v.dy() * len);
>}
>
>inline QPointF QLineF::pointAt(qreal t) const
>{
>    qreal vx = pt2.x() - pt1.x();
>    qreal vy = pt2.y() - pt1.y();
>    return QPointF(pt1.x() + vx * t, pt1.y() + vy * t);
>}
>
>inline QLine QLineF::toLine() const
>{
>    return QLine(pt1.toPoint(), pt2.toPoint());
>}
>
>
>inline void QLineF::setP1(const QPointF &aP1)
>{
>    pt1 = aP1;
>}
>
>inline void QLineF::setP2(const QPointF &aP2)
>{
>    pt2 = aP2;
>}
>
>inline void QLineF::setPoints(const QPointF &aP1, const QPointF &aP2)
>{
>    pt1 = aP1;
>    pt2 = aP2;
>}
>
>inline void QLineF::setLine(qreal aX1, qreal aY1, qreal aX2, qreal aY2)
>{
>    pt1 = QPointF(aX1, aY1);
>    pt2 = QPointF(aX2, aY2);
>}
>
>
>inline bool QLineF::operator==(const QLineF &d) const
>{
>    return pt1 == d.pt1 && pt2 == d.pt2;
>}
>
>
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug d, const QLineF &p);
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QLineF &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QLineF &);
># 49 "/usr/include/QtGui/qmatrix.h" 2 3 4
>
>
>
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QPainterPath;
>class QVariant;
>
>class __attribute__((visibility("default"))) QMatrix
>{
>public:
>    inline explicit QMatrix(Qt::Initialization) {}
>    QMatrix();
>    QMatrix(qreal m11, qreal m12, qreal m21, qreal m22,
>            qreal dx, qreal dy);
>    QMatrix(const QMatrix &matrix);
>
>    void setMatrix(qreal m11, qreal m12, qreal m21, qreal m22,
>                   qreal dx, qreal dy);
>
>    qreal m11() const { return _m11; }
>    qreal m12() const { return _m12; }
>    qreal m21() const { return _m21; }
>    qreal m22() const { return _m22; }
>    qreal dx() const { return _dx; }
>    qreal dy() const { return _dy; }
>
>    void map(int x, int y, int *tx, int *ty) const;
>    void map(qreal x, qreal y, qreal *tx, qreal *ty) const;
>    QRect mapRect(const QRect &) const;
>    QRectF mapRect(const QRectF &) const;
>
>    QPoint map(const QPoint &p) const;
>    QPointF map(const QPointF&p) const;
>    QLine map(const QLine &l) const;
>    QLineF map(const QLineF &l) const;
>    QPolygonF map(const QPolygonF &a) const;
>    QPolygon map(const QPolygon &a) const;
>    QRegion map(const QRegion &r) const;
>    QPainterPath map(const QPainterPath &p) const;
>    QPolygon mapToPolygon(const QRect &r) const;
>
>    void reset();
>    inline bool isIdentity() const;
>
>    QMatrix &translate(qreal dx, qreal dy);
>    QMatrix &scale(qreal sx, qreal sy);
>    QMatrix &shear(qreal sh, qreal sv);
>    QMatrix &rotate(qreal a);
>
>    bool isInvertible() const { return !qFuzzyIsNull(_m11*_m22 - _m12*_m21); }
>    qreal determinant() const { return _m11*_m22 - _m12*_m21; }
>
>    qreal det() const { return _m11*_m22 - _m12*_m21; }
>
>
>    QMatrix inverted(bool *invertible = 0) const;
>
>    bool operator==(const QMatrix &) const;
>    bool operator!=(const QMatrix &) const;
>
>    QMatrix &operator*=(const QMatrix &);
>    QMatrix operator*(const QMatrix &o) const;
>
>    QMatrix &operator=(const QMatrix &);
>
>    operator QVariant() const;
>
>
>
>
>
>
>
>private:
>    inline QMatrix(bool)
>            : _m11(1.)
>            , _m12(0.)
>            , _m21(0.)
>            , _m22(1.)
>            , _dx(0.)
>            , _dy(0.) {}
>    inline QMatrix(qreal am11, qreal am12, qreal am21, qreal am22, qreal adx, qreal ady, bool)
>            : _m11(am11)
>            , _m12(am12)
>            , _m21(am21)
>            , _m22(am22)
>            , _dx(adx)
>            , _dy(ady) {}
>    friend class QTransform;
>    qreal _m11, _m12;
>    qreal _m21, _m22;
>    qreal _dx, _dy;
>};
>template<> class QTypeInfo<QMatrix > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QMatrix)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QMatrix"; } };
>
>
>__attribute__((visibility("default"))) inline QPoint operator*(const QPoint &p, const QMatrix &m)
>{ return m.map(p); }
>__attribute__((visibility("default"))) inline QPointF operator*(const QPointF &p, const QMatrix &m)
>{ return m.map(p); }
>__attribute__((visibility("default"))) inline QLineF operator*(const QLineF &l, const QMatrix &m)
>{ return m.map(l); }
>__attribute__((visibility("default"))) inline QLine operator*(const QLine &l, const QMatrix &m)
>{ return m.map(l); }
>__attribute__((visibility("default"))) inline QPolygon operator *(const QPolygon &a, const QMatrix &m)
>{ return m.map(a); }
>__attribute__((visibility("default"))) inline QPolygonF operator *(const QPolygonF &a, const QMatrix &m)
>{ return m.map(a); }
>__attribute__((visibility("default"))) inline QRegion operator *(const QRegion &r, const QMatrix &m)
>{ return m.map(r); }
>__attribute__((visibility("default"))) QPainterPath operator *(const QPainterPath &p, const QMatrix &m);
>
>inline bool QMatrix::isIdentity() const
>{
>    return qFuzzyIsNull(_m11 - 1) && qFuzzyIsNull(_m22 - 1) && qFuzzyIsNull(_m12)
>           && qFuzzyIsNull(_m21) && qFuzzyIsNull(_dx) && qFuzzyIsNull(_dy);
>}
>
>inline bool qFuzzyCompare(const QMatrix& m1, const QMatrix& m2)
>{
>    return qFuzzyCompare(m1.m11(), m2.m11())
>        && qFuzzyCompare(m1.m12(), m2.m12())
>        && qFuzzyCompare(m1.m21(), m2.m21())
>        && qFuzzyCompare(m1.m22(), m2.m22())
>        && qFuzzyCompare(m1.dx(), m2.dx())
>        && qFuzzyCompare(m1.dy(), m2.dy());
>}
>
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QMatrix &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QMatrix &);
>
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QMatrix &);
># 202 "/usr/include/QtGui/qmatrix.h" 3 4
># 45 "/usr/include/QtGui/qtransform.h" 2 3 4
># 1 "/usr/include/QtGui/qpainterpath.h" 1 3 4
># 52 "/usr/include/QtGui/qpainterpath.h" 3 4
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QFont;
>class QPainterPathPrivate;
>struct QPainterPathPrivateDeleter;
>class QPainterPathData;
>class QPainterPathStrokerPrivate;
>class QPolygonF;
>class QRegion;
>class QVectorPath;
>
>class __attribute__((visibility("default"))) QPainterPath
>{
>public:
>    enum ElementType {
>        MoveToElement,
>        LineToElement,
>        CurveToElement,
>        CurveToDataElement
>    };
>
>    class Element {
>    public:
>        qreal x;
>        qreal y;
>        ElementType type;
>
>        bool isMoveTo() const { return type == MoveToElement; }
>        bool isLineTo() const { return type == LineToElement; }
>        bool isCurveTo() const { return type == CurveToElement; }
>
>        operator QPointF () const { return QPointF(x, y); }
>
>        bool operator==(const Element &e) const { return qFuzzyCompare(x, e.x)
>            && qFuzzyCompare(y, e.y) && type == e.type; }
>        inline bool operator!=(const Element &e) const { return !operator==(e); }
>    };
>
>    QPainterPath();
>    explicit QPainterPath(const QPointF &startPoint);
>    QPainterPath(const QPainterPath &other);
>    QPainterPath &operator=(const QPainterPath &other);
>
>
>
>
>    ~QPainterPath();
>    inline void swap(QPainterPath &other) { d_ptr.swap(other.d_ptr); }
>
>    void closeSubpath();
>
>    void moveTo(const QPointF &p);
>    inline void moveTo(qreal x, qreal y);
>
>    void lineTo(const QPointF &p);
>    inline void lineTo(qreal x, qreal y);
>
>    void arcMoveTo(const QRectF &rect, qreal angle);
>    inline void arcMoveTo(qreal x, qreal y, qreal w, qreal h, qreal angle);
>
>    void arcTo(const QRectF &rect, qreal startAngle, qreal arcLength);
>    inline void arcTo(qreal x, qreal y, qreal w, qreal h, qreal startAngle, qreal arcLength);
>
>    void cubicTo(const QPointF &ctrlPt1, const QPointF &ctrlPt2, const QPointF &endPt);
>    inline void cubicTo(qreal ctrlPt1x, qreal ctrlPt1y, qreal ctrlPt2x, qreal ctrlPt2y,
>                        qreal endPtx, qreal endPty);
>    void quadTo(const QPointF &ctrlPt, const QPointF &endPt);
>    inline void quadTo(qreal ctrlPtx, qreal ctrlPty, qreal endPtx, qreal endPty);
>
>    QPointF currentPosition() const;
>
>    void addRect(const QRectF &rect);
>    inline void addRect(qreal x, qreal y, qreal w, qreal h);
>    void addEllipse(const QRectF &rect);
>    inline void addEllipse(qreal x, qreal y, qreal w, qreal h);
>    inline void addEllipse(const QPointF &center, qreal rx, qreal ry);
>    void addPolygon(const QPolygonF &polygon);
>    void addText(const QPointF &point, const QFont &f, const QString &text);
>    inline void addText(qreal x, qreal y, const QFont &f, const QString &text);
>    void addPath(const QPainterPath &path);
>    void addRegion(const QRegion &region);
>
>    void addRoundedRect(const QRectF &rect, qreal xRadius, qreal yRadius,
>                        Qt::SizeMode mode = Qt::AbsoluteSize);
>    inline void addRoundedRect(qreal x, qreal y, qreal w, qreal h,
>                               qreal xRadius, qreal yRadius,
>                               Qt::SizeMode mode = Qt::AbsoluteSize);
>
>    void addRoundRect(const QRectF &rect, int xRnd, int yRnd);
>    inline void addRoundRect(qreal x, qreal y, qreal w, qreal h,
>                             int xRnd, int yRnd);
>    inline void addRoundRect(const QRectF &rect, int roundness);
>    inline void addRoundRect(qreal x, qreal y, qreal w, qreal h,
>                             int roundness);
>
>    void connectPath(const QPainterPath &path);
>
>    bool contains(const QPointF &pt) const;
>    bool contains(const QRectF &rect) const;
>    bool intersects(const QRectF &rect) const;
>
>    void translate(qreal dx, qreal dy);
>    inline void translate(const QPointF &offset);
>
>    QPainterPath translated(qreal dx, qreal dy) const;
>    inline QPainterPath translated(const QPointF &offset) const;
>
>    QRectF boundingRect() const;
>    QRectF controlPointRect() const;
>
>    Qt::FillRule fillRule() const;
>    void setFillRule(Qt::FillRule fillRule);
>
>    inline bool isEmpty() const;
>
>    QPainterPath toReversed() const;
>    QList<QPolygonF> toSubpathPolygons(const QMatrix &matrix = QMatrix()) const;
>    QList<QPolygonF> toFillPolygons(const QMatrix &matrix = QMatrix()) const;
>    QPolygonF toFillPolygon(const QMatrix &matrix = QMatrix()) const;
>    QList<QPolygonF> toSubpathPolygons(const QTransform &matrix) const;
>    QList<QPolygonF> toFillPolygons(const QTransform &matrix) const;
>    QPolygonF toFillPolygon(const QTransform &matrix) const;
>
>    inline int elementCount() const;
>    inline const QPainterPath::Element &elementAt(int i) const;
>    inline void setElementPositionAt(int i, qreal x, qreal y);
>
>    qreal length() const;
>    qreal percentAtLength(qreal t) const;
>    QPointF pointAtPercent(qreal t) const;
>    qreal angleAtPercent(qreal t) const;
>    qreal slopeAtPercent(qreal t) const;
>
>    bool intersects(const QPainterPath &p) const;
>    bool contains(const QPainterPath &p) const;
>    QPainterPath united(const QPainterPath &r) const;
>    QPainterPath intersected(const QPainterPath &r) const;
>    QPainterPath subtracted(const QPainterPath &r) const;
>    QPainterPath subtractedInverted(const QPainterPath &r) const;
>
>    QPainterPath simplified() const;
>
>    bool operator==(const QPainterPath &other) const;
>    bool operator!=(const QPainterPath &other) const;
>
>    QPainterPath operator&(const QPainterPath &other) const;
>    QPainterPath operator|(const QPainterPath &other) const;
>    QPainterPath operator+(const QPainterPath &other) const;
>    QPainterPath operator-(const QPainterPath &other) const;
>    QPainterPath &operator&=(const QPainterPath &other);
>    QPainterPath &operator|=(const QPainterPath &other);
>    QPainterPath &operator+=(const QPainterPath &other);
>    QPainterPath &operator-=(const QPainterPath &other);
>
>private:
>    QScopedPointer<QPainterPathPrivate, QPainterPathPrivateDeleter> d_ptr;
>
>    inline void ensureData() { if (!d_ptr) ensureData_helper(); }
>    void ensureData_helper();
>    inline void detach();
>    void detach_helper();
>    void setDirty(bool);
>    void computeBoundingRect() const;
>    void computeControlPointRect() const;
>
>    QPainterPathData *d_func() const { return reinterpret_cast<QPainterPathData *>(d_ptr.data()); }
>
>    friend class QPainterPathData;
>    friend class QPainterPathStroker;
>    friend class QPainterPathStrokerPrivate;
>    friend class QMatrix;
>    friend class QTransform;
>    friend class QVectorPath;
>    friend __attribute__((visibility("default"))) const QVectorPath &qtVectorPathForPath(const QPainterPath &);
>
>
>    friend __attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QPainterPath &);
>    friend __attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPainterPath &);
>
>};
>
>class QPainterPathPrivate
>{
>public:
>    friend class QPainterPath;
>    friend class QPainterPathData;
>    friend class QPainterPathStroker;
>    friend class QPainterPathStrokerPrivate;
>    friend class QMatrix;
>    friend class QTransform;
>    friend class QVectorPath;
>    friend struct QPainterPathPrivateDeleter;
>
>    friend __attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QPainterPath &);
>    friend __attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPainterPath &);
>
>private:
>    QAtomicInt ref;
>    QVector<QPainterPath::Element> elements;
>};
>
>template<> class QTypeInfo<QPainterPath::Element > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QPainterPath::Element)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QPainterPath::Element"; } };
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QPainterPath &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPainterPath &);
>
>
>class __attribute__((visibility("default"))) QPainterPathStroker
>{
>    inline QPainterPathStrokerPrivate* d_func() { return reinterpret_cast<QPainterPathStrokerPrivate *>(qGetPtrHelper(d_ptr)); } inline const QPainterPathStrokerPrivate* d_func() const { return reinterpret_cast<const QPainterPathStrokerPrivate *>(qGetPtrHelper(d_ptr)); } friend class QPainterPathStrokerPrivate;
>public:
>    QPainterPathStroker();
>    ~QPainterPathStroker();
>
>    void setWidth(qreal width);
>    qreal width() const;
>
>    void setCapStyle(Qt::PenCapStyle style);
>    Qt::PenCapStyle capStyle() const;
>
>    void setJoinStyle(Qt::PenJoinStyle style);
>    Qt::PenJoinStyle joinStyle() const;
>
>    void setMiterLimit(qreal length);
>    qreal miterLimit() const;
>
>    void setCurveThreshold(qreal threshold);
>    qreal curveThreshold() const;
>
>    void setDashPattern(Qt::PenStyle);
>    void setDashPattern(const QVector<qreal> &dashPattern);
>    QVector<qreal> dashPattern() const;
>
>    void setDashOffset(qreal offset);
>    qreal dashOffset() const;
>
>    QPainterPath createStroke(const QPainterPath &path) const;
>
>private:
>    QPainterPathStroker(const QPainterPathStroker &); QPainterPathStroker &operator=(const QPainterPathStroker &);
>
>    friend class QX11PaintEngine;
>
>    QScopedPointer<QPainterPathStrokerPrivate> d_ptr;
>};
>
>inline void QPainterPath::moveTo(qreal x, qreal y)
>{
>    moveTo(QPointF(x, y));
>}
>
>inline void QPainterPath::lineTo(qreal x, qreal y)
>{
>    lineTo(QPointF(x, y));
>}
>
>inline void QPainterPath::arcTo(qreal x, qreal y, qreal w, qreal h, qreal startAngle, qreal arcLength)
>{
>    arcTo(QRectF(x, y, w, h), startAngle, arcLength);
>}
>
>inline void QPainterPath::arcMoveTo(qreal x, qreal y, qreal w, qreal h, qreal angle)
>{
>    arcMoveTo(QRectF(x, y, w, h), angle);
>}
>
>inline void QPainterPath::cubicTo(qreal ctrlPt1x, qreal ctrlPt1y, qreal ctrlPt2x, qreal ctrlPt2y,
>                                   qreal endPtx, qreal endPty)
>{
>    cubicTo(QPointF(ctrlPt1x, ctrlPt1y), QPointF(ctrlPt2x, ctrlPt2y),
>            QPointF(endPtx, endPty));
>}
>
>inline void QPainterPath::quadTo(qreal ctrlPtx, qreal ctrlPty, qreal endPtx, qreal endPty)
>{
>    quadTo(QPointF(ctrlPtx, ctrlPty), QPointF(endPtx, endPty));
>}
>
>inline void QPainterPath::addEllipse(qreal x, qreal y, qreal w, qreal h)
>{
>    addEllipse(QRectF(x, y, w, h));
>}
>
>inline void QPainterPath::addEllipse(const QPointF &center, qreal rx, qreal ry)
>{
>    addEllipse(QRectF(center.x() - rx, center.y() - ry, 2 * rx, 2 * ry));
>}
>
>inline void QPainterPath::addRect(qreal x, qreal y, qreal w, qreal h)
>{
>    addRect(QRectF(x, y, w, h));
>}
>
>inline void QPainterPath::addRoundedRect(qreal x, qreal y, qreal w, qreal h,
>                                         qreal xRadius, qreal yRadius,
>                                         Qt::SizeMode mode)
>{
>    addRoundedRect(QRectF(x, y, w, h), xRadius, yRadius, mode);
>}
>
>inline void QPainterPath::addRoundRect(qreal x, qreal y, qreal w, qreal h,
>                                       int xRnd, int yRnd)
>{
>    addRoundRect(QRectF(x, y, w, h), xRnd, yRnd);
>}
>
>inline void QPainterPath::addRoundRect(const QRectF &rect,
>                                       int roundness)
>{
>    int xRnd = roundness;
>    int yRnd = roundness;
>    if (rect.width() > rect.height())
>        xRnd = int(roundness * rect.height()/rect.width());
>    else
>        yRnd = int(roundness * rect.width()/rect.height());
>    addRoundRect(rect, xRnd, yRnd);
>}
>
>inline void QPainterPath::addRoundRect(qreal x, qreal y, qreal w, qreal h,
>                                       int roundness)
>{
>    addRoundRect(QRectF(x, y, w, h), roundness);
>}
>
>inline void QPainterPath::addText(qreal x, qreal y, const QFont &f, const QString &text)
>{
>    addText(QPointF(x, y), f, text);
>}
>
>inline void QPainterPath::translate(const QPointF &offset)
>{ translate(offset.x(), offset.y()); }
>
>inline QPainterPath QPainterPath::translated(const QPointF &offset) const
>{ return translated(offset.x(), offset.y()); }
>
>inline bool QPainterPath::isEmpty() const
>{
>    return !d_ptr || (d_ptr->elements.size() == 1 && d_ptr->elements.first().type == MoveToElement);
>}
>
>inline int QPainterPath::elementCount() const
>{
>    return d_ptr ? d_ptr->elements.size() : 0;
>}
>
>inline const QPainterPath::Element &QPainterPath::elementAt(int i) const
>{
>    qt_noop();
>    qt_noop();
>    return d_ptr->elements.at(i);
>}
>
>inline void QPainterPath::setElementPositionAt(int i, qreal x, qreal y)
>{
>    qt_noop();
>    qt_noop();
>    detach();
>    QPainterPath::Element &e = d_ptr->elements[i];
>    e.x = x;
>    e.y = y;
>}
>
>
>inline void QPainterPath::detach()
>{
>    if (d_ptr->ref != 1)
>        detach_helper();
>    setDirty(true);
>}
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QPainterPath &);
># 46 "/usr/include/QtGui/qtransform.h" 2 3 4
># 57 "/usr/include/QtGui/qtransform.h" 3 4
>
>
>
>
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QVariant;
>
>class __attribute__((visibility("default"))) QTransform
>{
>public:
>    enum TransformationType {
>        TxNone = 0x00,
>        TxTranslate = 0x01,
>        TxScale = 0x02,
>        TxRotate = 0x04,
>        TxShear = 0x08,
>        TxProject = 0x10
>    };
>
>    inline explicit QTransform(Qt::Initialization) : affine(Qt::Uninitialized) {}
>    QTransform();
>    QTransform(qreal h11, qreal h12, qreal h13,
>               qreal h21, qreal h22, qreal h23,
>               qreal h31, qreal h32, qreal h33 = 1.0);
>    QTransform(qreal h11, qreal h12, qreal h21,
>               qreal h22, qreal dx, qreal dy);
>    explicit QTransform(const QMatrix &mtx);
>
>    bool isAffine() const;
>    bool isIdentity() const;
>    bool isInvertible() const;
>    bool isScaling() const;
>    bool isRotating() const;
>    bool isTranslating() const;
>
>    TransformationType type() const;
>
>    inline qreal determinant() const;
>    qreal det() const;
>
>    qreal m11() const;
>    qreal m12() const;
>    qreal m13() const;
>    qreal m21() const;
>    qreal m22() const;
>    qreal m23() const;
>    qreal m31() const;
>    qreal m32() const;
>    qreal m33() const;
>    qreal dx() const;
>    qreal dy() const;
>
>    void setMatrix(qreal m11, qreal m12, qreal m13,
>                   qreal m21, qreal m22, qreal m23,
>                   qreal m31, qreal m32, qreal m33);
>
>    QTransform inverted(bool *invertible = 0) const;
>    QTransform adjoint() const;
>    QTransform transposed() const;
>
>    QTransform &translate(qreal dx, qreal dy);
>    QTransform &scale(qreal sx, qreal sy);
>    QTransform &shear(qreal sh, qreal sv);
>    QTransform &rotate(qreal a, Qt::Axis axis = Qt::ZAxis);
>    QTransform &rotateRadians(qreal a, Qt::Axis axis = Qt::ZAxis);
>
>    static bool squareToQuad(const QPolygonF &square, QTransform &result);
>    static bool quadToSquare(const QPolygonF &quad, QTransform &result);
>    static bool quadToQuad(const QPolygonF &one,
>                           const QPolygonF &two,
>                           QTransform &result);
>
>    bool operator==(const QTransform &) const;
>    bool operator!=(const QTransform &) const;
>
>    QTransform &operator*=(const QTransform &);
>    QTransform operator*(const QTransform &o) const;
>
>    QTransform &operator=(const QTransform &);
>
>    operator QVariant() const;
>
>    void reset();
>    QPoint map(const QPoint &p) const;
>    QPointF map(const QPointF &p) const;
>    QLine map(const QLine &l) const;
>    QLineF map(const QLineF &l) const;
>    QPolygonF map(const QPolygonF &a) const;
>    QPolygon map(const QPolygon &a) const;
>    QRegion map(const QRegion &r) const;
>    QPainterPath map(const QPainterPath &p) const;
>    QPolygon mapToPolygon(const QRect &r) const;
>    QRect mapRect(const QRect &) const;
>    QRectF mapRect(const QRectF &) const;
>    void map(int x, int y, int *tx, int *ty) const;
>    void map(qreal x, qreal y, qreal *tx, qreal *ty) const;
>
>    const QMatrix &toAffine() const;
>
>    QTransform &operator*=(qreal div);
>    QTransform &operator/=(qreal div);
>    QTransform &operator+=(qreal div);
>    QTransform &operator-=(qreal div);
>
>    static QTransform fromTranslate(qreal dx, qreal dy);
>    static QTransform fromScale(qreal dx, qreal dy);
>
>private:
>    inline QTransform(qreal h11, qreal h12, qreal h13,
>                      qreal h21, qreal h22, qreal h23,
>                      qreal h31, qreal h32, qreal h33, bool)
>        : affine(h11, h12, h21, h22, h31, h32, true)
>        , m_13(h13), m_23(h23), m_33(h33)
>        , m_type(TxNone)
>        , m_dirty(TxProject) {}
>    inline QTransform(bool)
>        : affine(true)
>        , m_13(0), m_23(0), m_33(1)
>        , m_type(TxNone)
>        , m_dirty(TxNone) {}
>    inline TransformationType inline_type() const;
>    QMatrix affine;
>    qreal m_13;
>    qreal m_23;
>    qreal m_33;
>
>    mutable uint m_type : 5;
>    mutable uint m_dirty : 5;
>
>    class Private;
>    Private *d;
>};
>template<> class QTypeInfo<QTransform > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QTransform)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QTransform"; } };
>
>
>inline QTransform::TransformationType QTransform::inline_type() const
>{
>    if (m_dirty == TxNone)
>        return static_cast<TransformationType>(m_type);
>    return type();
>}
>
>inline bool QTransform::isAffine() const
>{
>    return inline_type() < TxProject;
>}
>inline bool QTransform::isIdentity() const
>{
>    return inline_type() == TxNone;
>}
>
>inline bool QTransform::isInvertible() const
>{
>    return !qFuzzyIsNull(determinant());
>}
>
>inline bool QTransform::isScaling() const
>{
>    return type() >= TxScale;
>}
>inline bool QTransform::isRotating() const
>{
>    return inline_type() >= TxRotate;
>}
>
>inline bool QTransform::isTranslating() const
>{
>    return inline_type() >= TxTranslate;
>}
>
>inline qreal QTransform::determinant() const
>{
>    return affine._m11*(m_33*affine._m22-affine._dy*m_23) -
>        affine._m21*(m_33*affine._m12-affine._dy*m_13)+affine._dx*(m_23*affine._m12-affine._m22*m_13);
>}
>inline qreal QTransform::det() const
>{
>    return determinant();
>}
>inline qreal QTransform::m11() const
>{
>    return affine._m11;
>}
>inline qreal QTransform::m12() const
>{
>    return affine._m12;
>}
>inline qreal QTransform::m13() const
>{
>    return m_13;
>}
>inline qreal QTransform::m21() const
>{
>    return affine._m21;
>}
>inline qreal QTransform::m22() const
>{
>    return affine._m22;
>}
>inline qreal QTransform::m23() const
>{
>    return m_23;
>}
>inline qreal QTransform::m31() const
>{
>    return affine._dx;
>}
>inline qreal QTransform::m32() const
>{
>    return affine._dy;
>}
>inline qreal QTransform::m33() const
>{
>    return m_33;
>}
>inline qreal QTransform::dx() const
>{
>    return affine._dx;
>}
>inline qreal QTransform::dy() const
>{
>    return affine._dy;
>}
>
>inline QTransform &QTransform::operator*=(qreal num)
>{
>    if (num == 1.)
>        return *this;
>    affine._m11 *= num;
>    affine._m12 *= num;
>    m_13 *= num;
>    affine._m21 *= num;
>    affine._m22 *= num;
>    m_23 *= num;
>    affine._dx *= num;
>    affine._dy *= num;
>    m_33 *= num;
>    if (m_dirty < TxScale)
>        m_dirty = TxScale;
>    return *this;
>}
>inline QTransform &QTransform::operator/=(qreal div)
>{
>    if (div == 0)
>        return *this;
>    div = 1/div;
>    return operator*=(div);
>}
>inline QTransform &QTransform::operator+=(qreal num)
>{
>    if (num == 0)
>        return *this;
>    affine._m11 += num;
>    affine._m12 += num;
>    m_13 += num;
>    affine._m21 += num;
>    affine._m22 += num;
>    m_23 += num;
>    affine._dx += num;
>    affine._dy += num;
>    m_33 += num;
>    m_dirty = TxProject;
>    return *this;
>}
>inline QTransform &QTransform::operator-=(qreal num)
>{
>    if (num == 0)
>        return *this;
>    affine._m11 -= num;
>    affine._m12 -= num;
>    m_13 -= num;
>    affine._m21 -= num;
>    affine._m22 -= num;
>    m_23 -= num;
>    affine._dx -= num;
>    affine._dy -= num;
>    m_33 -= num;
>    m_dirty = TxProject;
>    return *this;
>}
>
>inline bool qFuzzyCompare(const QTransform& t1, const QTransform& t2)
>{
>    return qFuzzyCompare(t1.m11(), t2.m11())
>        && qFuzzyCompare(t1.m12(), t2.m12())
>        && qFuzzyCompare(t1.m13(), t2.m13())
>        && qFuzzyCompare(t1.m21(), t2.m21())
>        && qFuzzyCompare(t1.m22(), t2.m22())
>        && qFuzzyCompare(t1.m23(), t2.m23())
>        && qFuzzyCompare(t1.m31(), t2.m31())
>        && qFuzzyCompare(t1.m32(), t2.m32())
>        && qFuzzyCompare(t1.m33(), t2.m33());
>}
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QTransform &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QTransform &);
>
>
>
>__attribute__((visibility("default"))) QDebug operator<<(QDebug, const QTransform &);
>
>
>
>
>__attribute__((visibility("default"))) inline QPoint operator*(const QPoint &p, const QTransform &m)
>{ return m.map(p); }
>__attribute__((visibility("default"))) inline QPointF operator*(const QPointF &p, const QTransform &m)
>{ return m.map(p); }
>__attribute__((visibility("default"))) inline QLineF operator*(const QLineF &l, const QTransform &m)
>{ return m.map(l); }
>__attribute__((visibility("default"))) inline QLine operator*(const QLine &l, const QTransform &m)
>{ return m.map(l); }
>__attribute__((visibility("default"))) inline QPolygon operator *(const QPolygon &a, const QTransform &m)
>{ return m.map(a); }
>__attribute__((visibility("default"))) inline QPolygonF operator *(const QPolygonF &a, const QTransform &m)
>{ return m.map(a); }
>__attribute__((visibility("default"))) inline QRegion operator *(const QRegion &r, const QTransform &m)
>{ return m.map(r); }
>__attribute__((visibility("default"))) inline QPainterPath operator *(const QPainterPath &p, const QTransform &m)
>{ return m.map(p); }
>
>__attribute__((visibility("default"))) inline QTransform operator *(const QTransform &a, qreal n)
>{ QTransform t(a); t *= n; return t; }
>__attribute__((visibility("default"))) inline QTransform operator /(const QTransform &a, qreal n)
>{ QTransform t(a); t /= n; return t; }
>__attribute__((visibility("default"))) inline QTransform operator +(const QTransform &a, qreal n)
>{ QTransform t(a); t += n; return t; }
>__attribute__((visibility("default"))) inline QTransform operator -(const QTransform &a, qreal n)
>{ QTransform t(a); t -= n; return t; }
># 46 "/usr/include/QtGui/qimage.h" 2 3 4
># 56 "/usr/include/QtGui/qimage.h" 3 4
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QIODevice;
>class QStringList;
>class QMatrix;
>class QTransform;
>class QVariant;
>template <class T> class QList;
>template <class T> class QVector;
>
>struct QImageData;
>class QImageDataMisc;
>
>class __attribute__((visibility("default"))) QImageTextKeyLang {
>public:
>    QImageTextKeyLang(const char* k, const char* l) : key(k), lang(l) { }
>    QImageTextKeyLang() { }
>
>    QByteArray key;
>    QByteArray lang;
>
>    bool operator< (const QImageTextKeyLang& other) const
>        { return key < other.key || (key==other.key && lang < other.lang); }
>    bool operator== (const QImageTextKeyLang& other) const
>        { return key==other.key && lang==other.lang; }
>    inline bool operator!= (const QImageTextKeyLang &other) const
>        { return !operator==(other); }
>};
>
>
>
>class __attribute__((visibility("default"))) QImage : public QPaintDevice
>{
>public:
>    enum InvertMode { InvertRgb, InvertRgba };
>    enum Format {
>        Format_Invalid,
>        Format_Mono,
>        Format_MonoLSB,
>        Format_Indexed8,
>        Format_RGB32,
>        Format_ARGB32,
>        Format_ARGB32_Premultiplied,
>        Format_RGB16,
>        Format_ARGB8565_Premultiplied,
>        Format_RGB666,
>        Format_ARGB6666_Premultiplied,
>        Format_RGB555,
>        Format_ARGB8555_Premultiplied,
>        Format_RGB888,
>        Format_RGB444,
>        Format_ARGB4444_Premultiplied,
># 119 "/usr/include/QtGui/qimage.h" 3 4
>        NImageFormats
>
>    };
>
>    QImage();
>    QImage(const QSize &size, Format format);
>    QImage(int width, int height, Format format);
>    QImage(uchar *data, int width, int height, Format format);
>    QImage(const uchar *data, int width, int height, Format format);
>    QImage(uchar *data, int width, int height, int bytesPerLine, Format format);
>    QImage(const uchar *data, int width, int height, int bytesPerLine, Format format);
>
>
>    explicit QImage(const char * const xpm[]);
>
>    explicit QImage(const QString &fileName, const char *format = 0);
>
>    explicit QImage(const char *fileName, const char *format = 0);
>
>
>    QImage(const QImage &);
>    ~QImage();
>
>    QImage &operator=(const QImage &);
>
>
>
>
>    inline void swap(QImage &other) { qSwap(d, other.d); }
>
>    bool isNull() const;
>
>    int devType() const;
>
>    bool operator==(const QImage &) const;
>    bool operator!=(const QImage &) const;
>    operator QVariant() const;
>    void detach();
>    bool isDetached() const;
>
>    QImage copy(const QRect &rect = QRect()) const;
>    inline QImage copy(int x, int y, int w, int h) const
>        { return copy(QRect(x, y, w, h)); }
>
>    Format format() const;
>
>    QImage convertToFormat(Format f, Qt::ImageConversionFlags flags = Qt::AutoColor) const __attribute__ ((warn_unused_result));
>    QImage convertToFormat(Format f, const QVector<QRgb> &colorTable, Qt::ImageConversionFlags flags = Qt::AutoColor) const __attribute__ ((warn_unused_result));
>
>    int width() const;
>    int height() const;
>    QSize size() const;
>    QRect rect() const;
>
>    int depth() const;
>
>    int numColors() const;
>
>    int colorCount() const;
>    int bitPlaneCount() const;
>
>    QRgb color(int i) const;
>    void setColor(int i, QRgb c);
>
>    void setNumColors(int);
>
>    void setColorCount(int);
>
>    bool allGray() const;
>    bool isGrayscale() const;
>
>    uchar *bits();
>    const uchar *bits() const;
>    const uchar *constBits() const;
>
>    int numBytes() const;
>
>    int byteCount() const;
>
>    uchar *scanLine(int);
>    const uchar *scanLine(int) const;
>    const uchar *constScanLine(int) const;
>    int bytesPerLine() const;
>
>    bool valid(int x, int y) const;
>    bool valid(const QPoint &pt) const;
>
>    int pixelIndex(int x, int y) const;
>    int pixelIndex(const QPoint &pt) const;
>
>    QRgb pixel(int x, int y) const;
>    QRgb pixel(const QPoint &pt) const;
>
>    void setPixel(int x, int y, uint index_or_rgb);
>    void setPixel(const QPoint &pt, uint index_or_rgb);
>
>    QVector<QRgb> colorTable() const;
>    void setColorTable(const QVector<QRgb> colors);
>
>    void fill(uint pixel);
>    void fill(const QColor &color);
>    void fill(Qt::GlobalColor color);
>
>
>    bool hasAlphaChannel() const;
>    void setAlphaChannel(const QImage &alphaChannel);
>    QImage alphaChannel() const;
>    QImage createAlphaMask(Qt::ImageConversionFlags flags = Qt::AutoColor) const;
>
>    QImage createHeuristicMask(bool clipTight = true) const;
>
>    QImage createMaskFromColor(QRgb color, Qt::MaskMode mode = Qt::MaskInColor) const;
>
>    inline QImage scaled(int w, int h, Qt::AspectRatioMode aspectMode = Qt::IgnoreAspectRatio,
>                        Qt::TransformationMode mode = Qt::FastTransformation) const
>        { return scaled(QSize(w, h), aspectMode, mode); }
>    QImage scaled(const QSize &s, Qt::AspectRatioMode aspectMode = Qt::IgnoreAspectRatio,
>                 Qt::TransformationMode mode = Qt::FastTransformation) const;
>    QImage scaledToWidth(int w, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    QImage scaledToHeight(int h, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    QImage transformed(const QMatrix &matrix, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    static QMatrix trueMatrix(const QMatrix &, int w, int h);
>    QImage transformed(const QTransform &matrix, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    static QTransform trueMatrix(const QTransform &, int w, int h);
>    QImage mirrored(bool horizontally = false, bool vertically = true) const;
>    QImage rgbSwapped() const;
>    void invertPixels(InvertMode = InvertRgb);
>
>
>    bool load(QIODevice *device, const char* format);
>    bool load(const QString &fileName, const char* format=0);
>    bool loadFromData(const uchar *buf, int len, const char *format = 0);
>    inline bool loadFromData(const QByteArray &data, const char* aformat=0)
>        { return loadFromData(reinterpret_cast<const uchar *>(data.constData()), data.size(), aformat); }
>
>    bool save(const QString &fileName, const char* format=0, int quality=-1) const;
>    bool save(QIODevice *device, const char* format=0, int quality=-1) const;
>
>    static QImage fromData(const uchar *data, int size, const char *format = 0);
>    inline static QImage fromData(const QByteArray &data, const char *format = 0)
>        { return fromData(reinterpret_cast<const uchar *>(data.constData()), data.size(), format); }
>
>    int serialNumber() const;
>    qint64 cacheKey() const;
>
>    QPaintEngine *paintEngine() const;
>
>
>    int dotsPerMeterX() const;
>    int dotsPerMeterY() const;
>    void setDotsPerMeterX(int);
>    void setDotsPerMeterY(int);
>    QPoint offset() const;
>    void setOffset(const QPoint&);
>
>    QStringList textKeys() const;
>    QString text(const QString &key = QString()) const;
>    void setText(const QString &key, const QString &value);
>
>
>    QString text(const char* key, const char* lang=0) const;
>    QList<QImageTextKeyLang> textList() const;
>    QStringList textLanguages() const;
>    QString text(const QImageTextKeyLang&) const;
>    void setText(const char* key, const char* lang, const QString&);
># 331 "/usr/include/QtGui/qimage.h" 3 4
>protected:
>    virtual int metric(PaintDeviceMetric metric) const;
>
>private:
>    friend class QWSOnScreenSurface;
>    QImageData *d;
>
>    friend class QRasterPixmapData;
>    friend class QBlittablePixmapData;
>    friend class QPixmapCacheEntry;
>    friend __attribute__((visibility("default"))) qint64 qt_image_id(const QImage &image);
>    friend const QVector<QRgb> *qt_image_colortable(const QImage &image);
>
>public:
>    typedef QImageData * DataPtr;
>    inline DataPtr &data_ptr() { return d; }
>};
>
>template <> inline bool qIsDetached<QImage>(QImage &t) { return t.isDetached(); } template <> inline void qSwap<QImage>(QImage &value1, QImage &value2) { qSwap(value1.data_ptr(), value2.data_ptr()); } namespace std { template<> inline void swap< ::QImage>(::QImage &value1, ::QImage &value2) { swap(value1.data_ptr(), value2.data_ptr()); } }
>template<> class QTypeInfo<QImage > { public: enum { isComplex = (((Q_MOVABLE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_MOVABLE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QImage)>sizeof(void*)), isPointer = false, isDummy = (((Q_MOVABLE_TYPE) & Q_DUMMY_TYPE) != 0) }; static inline const char *name() { return "QImage"; } };
>
>
>
>__attribute__((visibility("default"))) inline bool QImage::valid(const QPoint &pt) const { return valid(pt.x(), pt.y()); }
>__attribute__((visibility("default"))) inline int QImage::pixelIndex(const QPoint &pt) const { return pixelIndex(pt.x(), pt.y());}
>__attribute__((visibility("default"))) inline QRgb QImage::pixel(const QPoint &pt) const { return pixel(pt.x(), pt.y()); }
>__attribute__((visibility("default"))) inline void QImage::setPixel(const QPoint &pt, uint index_or_rgb) { setPixel(pt.x(), pt.y(), index_or_rgb); }
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QImage &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QImage &);
># 51 "/usr/include/QtGui/qpixmap.h" 2
># 62 "/usr/include/QtGui/qpixmap.h"
>typedef QtValidLicenseForGuiModule QtGuiModule;
>
>class QImageWriter;
>class QImageReader;
>class QColor;
>class QVariant;
>class QX11Info;
>class QPixmapData;
>
>class __attribute__((visibility("default"))) QPixmap : public QPaintDevice
>{
>public:
>    QPixmap();
>    explicit QPixmap(QPixmapData *data);
>    QPixmap(int w, int h);
>    QPixmap(const QSize &);
>    QPixmap(const QString& fileName, const char *format = 0, Qt::ImageConversionFlags flags = Qt::AutoColor);
>
>    QPixmap(const char * const xpm[]);
>
>    QPixmap(const QPixmap &);
>    ~QPixmap();
>
>    QPixmap &operator=(const QPixmap &);
>
>
>
>
>    inline void swap(QPixmap &other) { qSwap(data, other.data); }
>
>    operator QVariant() const;
>
>    bool isNull() const;
>    int devType() const;
>
>    int width() const;
>    int height() const;
>    QSize size() const;
>    QRect rect() const;
>    int depth() const;
>
>    static int defaultDepth();
>
>    void fill(const QColor &fillColor = Qt::white);
>    void fill(const QWidget *widget, const QPoint &ofs);
>    inline void fill(const QWidget *widget, int xofs, int yofs) { fill(widget, QPoint(xofs, yofs)); }
>
>    QBitmap mask() const;
>    void setMask(const QBitmap &);
>
>
>    QPixmap alphaChannel() const;
>    void setAlphaChannel(const QPixmap &);
>
>
>    bool hasAlpha() const;
>    bool hasAlphaChannel() const;
>
>
>    QBitmap createHeuristicMask(bool clipTight = true) const;
>
>    QBitmap createMaskFromColor(const QColor &maskColor) const;
>    QBitmap createMaskFromColor(const QColor &maskColor, Qt::MaskMode mode) const;
>
>    static QPixmap grabWindow(WId, int x=0, int y=0, int w=-1, int h=-1);
>    static QPixmap grabWidget(QWidget *widget, const QRect &rect);
>    static inline QPixmap grabWidget(QWidget *widget, int x=0, int y=0, int w=-1, int h=-1)
>    { return grabWidget(widget, QRect(x, y, w, h)); }
>
>
>    inline QPixmap scaled(int w, int h, Qt::AspectRatioMode aspectMode = Qt::IgnoreAspectRatio,
>                          Qt::TransformationMode mode = Qt::FastTransformation) const
>        { return scaled(QSize(w, h), aspectMode, mode); }
>    QPixmap scaled(const QSize &s, Qt::AspectRatioMode aspectMode = Qt::IgnoreAspectRatio,
>                   Qt::TransformationMode mode = Qt::FastTransformation) const;
>    QPixmap scaledToWidth(int w, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    QPixmap scaledToHeight(int h, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    QPixmap transformed(const QMatrix &, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    static QMatrix trueMatrix(const QMatrix &m, int w, int h);
>    QPixmap transformed(const QTransform &, Qt::TransformationMode mode = Qt::FastTransformation) const;
>    static QTransform trueMatrix(const QTransform &m, int w, int h);
>
>    QImage toImage() const;
>    static QPixmap fromImage(const QImage &image, Qt::ImageConversionFlags flags = Qt::AutoColor);
>    static QPixmap fromImageReader(QImageReader *imageReader, Qt::ImageConversionFlags flags = Qt::AutoColor);
>
>    bool load(const QString& fileName, const char *format = 0, Qt::ImageConversionFlags flags = Qt::AutoColor);
>    bool loadFromData(const uchar *buf, uint len, const char* format = 0, Qt::ImageConversionFlags flags = Qt::AutoColor);
>    inline bool loadFromData(const QByteArray &data, const char* format = 0, Qt::ImageConversionFlags flags = Qt::AutoColor);
>    bool save(const QString& fileName, const char* format = 0, int quality = -1) const;
>    bool save(QIODevice* device, const char* format = 0, int quality = -1) const;
>
>    bool convertFromImage(const QImage &img, Qt::ImageConversionFlags flags = Qt::AutoColor);
># 182 "/usr/include/QtGui/qpixmap.h"
>    inline QPixmap copy(int x, int y, int width, int height) const;
>    QPixmap copy(const QRect &rect = QRect()) const;
>
>    inline void scroll(int dx, int dy, int x, int y, int width, int height, QRegion *exposed = 0);
>    void scroll(int dx, int dy, const QRect &rect, QRegion *exposed = 0);
>
>
>    int serialNumber() const;
>
>    qint64 cacheKey() const;
>
>    bool isDetached() const;
>    void detach();
>
>    bool isQBitmap() const;
># 211 "/usr/include/QtGui/qpixmap.h"
>    enum ShareMode { ImplicitlyShared, ExplicitlyShared };
>
>    static QPixmap fromX11Pixmap(Qt::HANDLE pixmap, ShareMode mode = ImplicitlyShared);
>    static int x11SetDefaultScreen(int screen);
>    void x11SetScreen(int screen);
>    const QX11Info &x11Info() const;
>    Qt::HANDLE x11PictureHandle() const;
>
>
>
>    Qt::HANDLE handle() const;
>
>
>    QPaintEngine *paintEngine() const;
>
>    inline bool operator!() const { return isNull(); }
>
>protected:
>    int metric(PaintDeviceMetric) const;
># 251 "/usr/include/QtGui/qpixmap.h"
>private:
>    QExplicitlySharedDataPointer<QPixmapData> data;
>
>    bool doImageIO(QImageWriter *io, int quality) const;
>
>
>    enum Type { PixmapType, BitmapType };
>    QPixmap(const QSize &s, Type);
>    void init(int, int, Type = PixmapType);
>
>    QPixmap(const QSize &s, int type);
>    void init(int, int, int);
>    void deref();
># 275 "/usr/include/QtGui/qpixmap.h"
>    friend class QPixmapData;
>    friend class QX11PixmapData;
>    friend class QMacPixmapData;
>    friend class QSymbianRasterPixmapData;
>    friend class QBitmap;
>    friend class QPaintDevice;
>    friend class QPainter;
>    friend class QGLWidget;
>    friend class QX11PaintEngine;
>    friend class QCoreGraphicsPaintEngine;
>    friend class QWidgetPrivate;
>    friend class QRasterBuffer;
>
>    friend __attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPixmap &);
>
>    friend __attribute__((visibility("default"))) qint64 qt_pixmap_id(const QPixmap &pixmap);
>
>public:
>    QPixmapData* pixmapData() const;
>
>public:
>    typedef QExplicitlySharedDataPointer<QPixmapData> DataPtr;
>    inline DataPtr &data_ptr() { return data; }
>};
>
>template <> inline bool qIsDetached<QPixmap>(QPixmap &t) { return t.isDetached(); } template <> inline void qSwap<QPixmap>(QPixmap &value1, QPixmap &value2) { qSwap(value1.data_ptr(), value2.data_ptr()); } namespace std { template<> inline void swap< ::QPixmap>(::QPixmap &value1, ::QPixmap &value2) { swap(value1.data_ptr(), value2.data_ptr()); } }
>
>inline QPixmap QPixmap::copy(int ax, int ay, int awidth, int aheight) const
>{
>    return copy(QRect(ax, ay, awidth, aheight));
>}
>
>inline void QPixmap::scroll(int dx, int dy, int ax, int ay, int awidth, int aheight, QRegion *exposed)
>{
>    scroll(dx, dy, QRect(ax, ay, awidth, aheight), exposed);
>}
>
>inline bool QPixmap::loadFromData(const QByteArray &buf, const char *format,
>                                  Qt::ImageConversionFlags flags)
>{
>    return loadFromData(reinterpret_cast<const uchar *>(buf.constData()), buf.size(), format, flags);
>}
>
>
>
>
>
>
>__attribute__((visibility("default"))) QDataStream &operator<<(QDataStream &, const QPixmap &);
>__attribute__((visibility("default"))) QDataStream &operator>>(QDataStream &, QPixmap &);
># 335 "/usr/include/QtGui/qpixmap.h"
># 1 "/usr/include/QtGui/QPixmap" 2
># 15 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
># 1 "/usr/include/QtCore/QMap" 1
># 16 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/fileinfo.h" 1
># 23 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/fileinfo.h"
># 1 "/usr/include/QtCore/QString" 1
># 1 "/usr/include/QtCore/qstring.h" 1
># 1 "/usr/include/QtCore/QString" 2
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/fileinfo.h" 2
># 1 "/usr/include/QtCore/QMap" 1
># 25 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/fileinfo.h" 2
># 1 "/usr/include/QtCore/QUrl" 1
># 26 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/fileinfo.h" 2
>
>
>
>
>
>
>class FileInfo
>{
>public:
>
>
>
>    FileInfo(const QString &path = QString());
>
>
>
>    FileInfo(const FileInfo &info);
>
>
>
>    ~FileInfo();
>
>
>
>    void operator=(const FileInfo &info);
>
>
>
>    bool operator==(const FileInfo &info);
>
>
>
>    bool operator!=(const FileInfo &info);
>
>
>
>    qint64 length () const;
>
>
>
>    const QString metaData (Qmmp::MetaData key) const;
>
>
>
>    const QMap<Qmmp::MetaData, QString> metaData () const;
>
>
>
>    bool isEmpty() const;
>
>
>
>    const QString path() const;
>
>
>
>    void setLength(qint64 length);
>
>
>
>    void setMetaData(Qmmp::MetaData key, const QString &value);
>
>
>
>    void setMetaData(Qmmp::MetaData key, int value);
>
>
>
>    void setMetaData(const QMap <Qmmp::MetaData, QString> &metaData);
>
>
>
>    void setPath(const QString &path);
>
>private:
>    QMap <Qmmp::MetaData, QString> m_metaData;
>    qint64 m_length;
>    QString m_path;
>    QList<QMap<int, int> > map;
>};
># 17 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
>
># 1 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/audioparameters.h" 1
># 24 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/audioparameters.h"
># 1 "/usr/include/QtCore/QtGlobal" 1
># 1 "/usr/include/QtCore/qglobal.h" 1
># 1 "/usr/include/QtCore/QtGlobal" 2
># 25 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/audioparameters.h" 2
>
>
>
>
>
>class AudioParameters
>{
>public:
>
>
>
>    AudioParameters();
>
>
>
>
>
>
>    AudioParameters(quint32 srate, int chan, Qmmp::AudioFormat format);
>
>
>
>    AudioParameters(const AudioParameters &other);
>
>
>
>    void operator=(const AudioParameters &p);
>
>
>
>    bool operator==(const AudioParameters &p) const;
>
>
>
>    bool operator!=(const AudioParameters &p) const;
>
>
>
>    quint32 sampleRate() const;
>
>
>
>    int channels() const;
>
>
>
>    Qmmp::AudioFormat format() const;
>
>
>
>    int sampleSize() const;
>
>
>
>    static int sampleSize(Qmmp::AudioFormat format);
>
>private:
>    quint32 m_srate;
>    int m_chan;
>    Qmmp::AudioFormat m_format;
>};
># 19 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/../../../qmmp/decoder.h" 2
>
>class Decoder;
>class DecoderFactory;
>class QIODevice;
>
>
>
>
>
>class Decoder
>{
>public:
>
>
>
>
>    Decoder(QIODevice *input = 0);
>
>
>
>    virtual ~Decoder();
>
>
>
>
>    virtual bool initialize() = 0;
>
>
>
>
>    virtual qint64 totalTime() = 0;
>
>
>
>    virtual void seek(qint64 time) = 0;
>
>
>
>
>
>    virtual qint64 read(char *data, qint64 maxSize) = 0;
>
>
>
>
>    virtual int bitrate() = 0;
>
>
>
>
>
>
>    virtual void next();
>
>
>
>
>
>    virtual const QString nextURL();
>
>
>
>    AudioParameters audioParameters() const;
>
>
>
>    QMap<Qmmp::ReplayGainKey, double> replayGainInfo() const;
>
>
>
>    void setReplayGainInfo(const QMap<Qmmp::ReplayGainKey,double> &rg);
>
>
>
>    QIODevice *input();
>
>
>
>    static DecoderFactory *findByPath(const QString &path);
>
>
>
>    static DecoderFactory *findByMime(const QString &mime);
>
>
>
>
>    static DecoderFactory *findByContent(QIODevice *input);
>
>
>
>    static DecoderFactory *findByProtocol(const QString &p);
>
>
>
>    static QList<DecoderFactory*> *factories();
>
>
>
>    static QStringList files();
>
>
>
>
>    static QStringList protocols();
>
>
>
>
>
>    static void setEnabled(DecoderFactory* factory, bool enable = true);
>
>
>
>
>    static bool isEnabled(DecoderFactory* factory);
>
>protected:
>
>
>
>
>
>
>    void configure(quint32 srate = 44100, int chan = 2, Qmmp::AudioFormat f = Qmmp::PCM_S16LE);
>
>private:
>    static void checkFactories();
>    static QList<DecoderFactory*> *m_factories;
>    static QList<DecoderFactory*> *m_disabledFactories;
>    static DecoderFactory *m_lastFactory;
>    static QStringList m_files;
>    AudioParameters m_parameters;
>    QIODevice *m_input;
>    QMap <Qmmp::ReplayGainKey, double> m_rg;
>};
># 35 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.h" 2
>
>
>
>
>class DecoderFFmpeg : public Decoder
>{
>public:
>    DecoderFFmpeg(const QString &, QIODevice *i);
>    virtual ~DecoderFFmpeg();
>
>
>    bool initialize();
>    qint64 totalTime();
>    int bitrate();
>    qint64 read(char *audio, qint64 maxSize);
>    void seek(qint64 time);
>
>private:
>
>    void fillBuffer();
>
>    AVFormatContext *ic;
>    AVCodecContext *c;
>
>    uint wma_st_buff, wma_idx2;
>    int m_bitrate, wma_idx;
>
>    QString m_path;
>    qint64 m_totalTime;
>    AVPacket m_pkt;
>    AVPacket m_temp_pkt;
>    qint64 m_output_at;
>    uchar m_input_buf[16384 + 8];
>    int64_t m_seekTime;
>    qint64 m_skipBytes;
>
>
>
>
>
>
>
>    qint64 ffmpeg_decode(uint8_t *audio);
>    bool m_skip;
>
>
>    AVIOContext *m_stream;
>
>
>
>
>    uint8_t *m_output_buf;
>
>
>};
># 25 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp" 2
>
>
>
>static int ffmpeg_read(void *data, uint8_t *buf, int size)
>{
>    DecoderFFmpeg *d = (DecoderFFmpeg*)data;
>    return (int)d->input()->read((char*)buf, size);
>}
>
>static int64_t ffmpeg_seek(void *data, int64_t offset, int whence)
>{
>    DecoderFFmpeg *d = (DecoderFFmpeg*)data;
>    int64_t absolute_pos = 0;
>
>
>    switch( whence )
>    {
>    case 0x10000:
>        return d->input()->size();
>    case 0:
>        absolute_pos = offset;
>        break;
>    case 1:
>        absolute_pos = d->input()->pos() + offset;
>        break;
>    case 2:
>        absolute_pos = d->input()->size() - offset;
>    default:
>        return -1;
>    }
>    if(absolute_pos < 0 || absolute_pos > d->input()->size())
>        return -1;
>    return d->input()->seek(absolute_pos);
>}
># 428 "/builddir/build/BUILD/qmmp-0.5.3/src/plugins/Input/ffmpeg/decoder_ffmpeg.cpp"
>DecoderFFmpeg::DecoderFFmpeg(const QString &path, QIODevice *i)
>        : Decoder(i)
>{
>    m_bitrate = 0;
>    m_skip = false;
>    m_totalTime = 0;
>    ic = 0;
>    m_path = path;
>    m_temp_pkt.size = 0;
>    m_pkt.size = 0;
>    m_pkt.data = 0;
>    m_output_buf = 0;
>    m_output_at = 0;
>    m_skipBytes = 0;
>    m_stream = 0;
>    av_init_packet(&m_pkt);
>    av_init_packet(&m_temp_pkt);
>}
>
>
>DecoderFFmpeg::~DecoderFFmpeg()
>{
>    m_bitrate = 0;
>    m_temp_pkt.size = 0;
>    if (ic)
>        av_close_input_stream(ic);
>   if(m_pkt.data)
>        av_free_packet(&m_pkt);
>    if(m_output_buf)
>        av_free(m_output_buf);
>    if(m_stream)
>        av_free(m_stream);
>}
>
>bool DecoderFFmpeg::initialize()
>{
>    m_bitrate = 0;
>    m_skip = false;
>    m_totalTime = 0;
>    m_seekTime = -1;
>    av_register_all();
>
>    AVProbeData pd;
>    uint8_t buf[8192 + 32];
>    pd.filename = m_path.toLocal8Bit().constData();
>    pd.buf_size = input()->peek((char*)buf, sizeof(buf) - 32);
>    pd.buf = buf;
>    if(pd.buf_size < 8192)
>    {
>        qWarning("DecoderFFmpeg: too small buffer size: %d bytes", pd.buf_size);
>        return false;
>    }
>    AVInputFormat *fmt = av_probe_input_format(&pd, 1);
>    if(!fmt)
>    {
>        qWarning("DecoderFFmpeg: usupported format");
>        return false;
>    }
>    qDebug("DecoderFFmpeg: detected format: %s", fmt->long_name);
>    qDebug("=%s=", fmt->name);
>
>
>    m_stream = avio_alloc_context(m_input_buf, 16384, 0, this, ffmpeg_read, __null, ffmpeg_seek);
>    if(!m_stream)
>    {
>        qWarning("DecoderFFmpeg: unable to initialize I/O callbacks");
>        return false;
>    }
>    m_stream->seekable = !input()->isSequential();
>
>
>
>
>
>    m_stream->max_packet_size = 16384;
>
>    AVFormatParameters ap;
>    memset(&ap, 0, sizeof(ap));
>
>    if(av_open_input_stream(&ic, m_stream, m_path.toLocal8Bit(), fmt, &ap) != 0)
>    {
>        qDebug("DecoderFFmpeg: av_open_input_stream() failed");
>        return false;
>    }
>    av_find_stream_info(ic);
>    if(ic->pb)
>        ic->pb->eof_reached = 0;
>
>    if (input()->isSequential())
>    {
>        QMap<Qmmp::MetaData, QString> metaData;
>        AVMetadataTag *album = av_metadata_get(ic->metadata,"album",0,0);
>        if(!album)
>            album = av_metadata_get(ic->metadata,"WM/AlbumTitle",0,0);
>        AVMetadataTag *artist = av_metadata_get(ic->metadata,"artist",0,0);
>        if(!artist)
>            artist = av_metadata_get(ic->metadata,"author",0,0);
>        AVMetadataTag *comment = av_metadata_get(ic->metadata,"comment",0,0);
>        AVMetadataTag *genre = av_metadata_get(ic->metadata,"genre",0,0);
>        AVMetadataTag *title = av_metadata_get(ic->metadata,"title",0,0);
>        AVMetadataTag *year = av_metadata_get(ic->metadata,"WM/Year",0,0);
>        if(!year)
>            year = av_metadata_get(ic->metadata,"year",0,0);
>        if(!year)
>            year = av_metadata_get(ic->metadata,"date",0,0);
>        AVMetadataTag *track = av_metadata_get(ic->metadata,"track",0,0);
>        if(!track)
>            track = av_metadata_get(ic->metadata,"WM/Track",0,0);
>        if(!track)
>            track = av_metadata_get(ic->metadata,"WM/TrackNumber",0,0);
>
>        if(album)
>            metaData.insert(Qmmp::ALBUM, QString::fromUtf8(album->value).trimmed());
>        if(artist)
>            metaData.insert(Qmmp::ARTIST, QString::fromUtf8(artist->value).trimmed());
>        if(comment)
>            metaData.insert(Qmmp::COMMENT, QString::fromUtf8(comment->value).trimmed());
>        if(genre)
>            metaData.insert(Qmmp::GENRE, QString::fromUtf8(genre->value).trimmed());
>        if(title)
>            metaData.insert(Qmmp::TITLE, QString::fromUtf8(title->value).trimmed());
>        if(year)
>            metaData.insert(Qmmp::YEAR, year->value);
>        if(track)
>            metaData.insert(Qmmp::TRACK, track->value);
>        metaData.insert(Qmmp::URL, m_path);
>        StateHandler::instance()->dispatch(metaData);
>    }
>
>    ic->flags |= 0x0001;
>    av_read_play(ic);
>    for (wma_idx = 0; wma_idx < (int)ic->nb_streams; wma_idx++)
>    {
>        c = ic->streams[wma_idx]->codec;
>
>
>
>        if (c->codec_type == AVMEDIA_TYPE_AUDIO)
>
>            break;
>    }
>
>    if (c->channels > 0)
>         c->request_channels = qMin(2, c->channels);
>    else
>         c->request_channels = 2;
>
>
>    av_dump_format(ic,0,0,0);
>
>
>
>    AVCodec *codec = avcodec_find_decoder(c->codec_id);
>
>    if (!codec)
>    {
>        qWarning("DecoderFFmpeg: unsupported codec for output stream");
>        return false;
>    }
>
>    if (avcodec_open(c, codec) < 0)
>    {
>        qWarning("DecoderFFmpeg: error while opening codec for output stream");
>        return false;
>    }
>
>    m_totalTime = input()->isSequential() ? 0 : ic->duration * 1000 / 1000000;
>    m_output_buf = (uint8_t *)av_malloc(192000*2);
>
>
>    if(c->codec_id == CODEC_ID_SHORTEN)
>        m_totalTime = 0;
>
>
>
>    if(c->sample_fmt == AV_SAMPLE_FMT_S32)
>        configure(c->sample_rate, c->request_channels, Qmmp::PCM_S32LE);
>    else
>        configure(c->sample_rate, c->request_channels, Qmmp::PCM_S16LE);
>
>
>
>
>
>
>    if(ic->bit_rate)
>        m_bitrate = ic->bit_rate/1000;
>    if(c->bit_rate)
>        m_bitrate = c->bit_rate/1000;
>    qDebug("DecoderFFmpeg: initialize succes");
>    return true;
>}
>
>
>qint64 DecoderFFmpeg::totalTime()
>{
>    return m_totalTime;
>}
>
>int DecoderFFmpeg::bitrate()
>{
>    return m_bitrate;
>}
>
>qint64 DecoderFFmpeg::read(char *audio, qint64 maxSize)
>{
>    m_skipBytes = 0;
>    if (m_skip)
>    {
>        while(m_temp_pkt.size)
>            ffmpeg_decode(m_output_buf);
>        m_output_at = 0;
>        m_skip = false;
>    }
>    if(!m_output_at)
>        fillBuffer();
>    if(!m_output_at)
>        return 0;
>    qint64 len = qMin(m_output_at, maxSize);
>    memcpy(audio, m_output_buf, len);
>    m_output_at -= len;
>    memmove(m_output_buf, m_output_buf + len, m_output_at);
>    return len;
>}
>
>qint64 DecoderFFmpeg::ffmpeg_decode(uint8_t *audio)
>{
>    int out_size = 192000 * 2;
>    if((m_pkt.stream_index == wma_idx))
>    {
>
>        int l = avcodec_decode_audio3(c, (int16_t *)(audio), &out_size, &m_temp_pkt);
>
>
>
>        if(c->bit_rate)
>            m_bitrate = c->bit_rate/1000;
>        if(l < 0)
>            return l;
>        m_temp_pkt.data += l;
>        m_temp_pkt.size -= l;
>    }
>    if (!m_temp_pkt.size && m_pkt.data)
>        av_free_packet(&m_pkt);
>
>    return out_size;
>}
>
>void DecoderFFmpeg::seek(qint64 pos)
>{
>   int64_t timestamp = int64_t(pos)*1000000/1000;
>    if (ic->start_time != (qint64)0x8000000000000000L)
>        timestamp += ic->start_time;
>    m_seekTime = timestamp;
>    av_seek_frame(ic, -1, timestamp, 1);
>    if(m_pkt.size)
>        m_skip = true;
>}
>
>void DecoderFFmpeg::fillBuffer()
>{
>    while(!m_output_at)
>    {
>        if(!m_temp_pkt.size)
>        {
>            if (av_read_frame(ic, &m_pkt) < 0)
>            {
>                m_temp_pkt.size = 0;
>                break;
>            }
>            m_temp_pkt.size = m_pkt.size;
>            m_temp_pkt.data = m_pkt.data;
>
>            if(m_pkt.stream_index != wma_idx)
>            {
>                if(m_pkt.data)
>                    av_free_packet(&m_pkt);
>                m_temp_pkt.size = 0;
>                continue;
>            }
>            if(m_seekTime && c->codec_id == CODEC_ID_APE)
>            {
>                int64_t rescaledPts = av_rescale(m_pkt.pts,
>                                                 1000000 * (int64_t)
>                                                 ic->streams[m_pkt.stream_index]->time_base.num,
>                                                 ic->streams[m_pkt.stream_index]->time_base.den);
>                m_skipBytes = (m_seekTime - rescaledPts) * c->sample_rate * 4 / 1000000;
>            }
>            else
>                m_skipBytes = 0;
>            m_seekTime = 0;
>        }
>
>        if(m_skipBytes > 0 && c->codec_id == CODEC_ID_APE)
>        {
>            while (m_skipBytes > 0)
>            {
>                m_output_at = ffmpeg_decode(m_output_buf);
>                if(m_output_at < 0)
>                    break;
>                m_skipBytes -= m_output_at;
>            }
>
>            if(m_skipBytes < 0)
>            {
>                qint64 size = m_output_at;
>                m_output_at = - m_skipBytes;
>                m_output_at = m_output_at/4*4;
>                memmove(m_output_buf, (m_output_buf + size - m_output_at), m_output_at);
>                m_skipBytes = 0;
>            }
>        }
>        else
>            m_output_at = ffmpeg_decode(m_output_buf);
>
>        if(m_output_at < 0)
>        {
>            m_output_at = 0;
>            m_temp_pkt.size = 0;
>
>            if(c->codec_id == CODEC_ID_SHORTEN)
>            {
>                if(m_pkt.data)
>                    av_free_packet(&m_pkt);
>                m_pkt.data = 0;
>                break;
>            }
>            continue;
>        }
>        else if(m_output_at == 0)
>        {
>            if(c->codec_id == CODEC_ID_SHORTEN)
>                continue;
>
>            if(m_pkt.data)
>                av_free_packet(&m_pkt);
>            m_pkt.data = 0;
>            break;
>        }
>    }
>}

Actions: View

Attachments on bug 811237: 576477 | 576478 | 576479 | 576480 | 576481