Attachment 297914 Details for Bug 437277 – Preprocessed source code

Preprocessed source code

ccqePH1p.out (text/plain), 997.31 KB, created by Vegard Nossum on 2008-03-13 11:02:32 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Vegard Nossum

Created: 2008-03-13 11:02:32 UTC

Size: 997.31 KB

patch

obsolete

>// /usr/libexec/gcc/i386-redhat-linux/4.1.2/cc1plus -quiet -I. -I../include -I/home/vegard/local/include -D_GNU_SOURCE EditorRace.cpp -quiet -dumpbase EditorRace.cpp -mtune=generic -auxbase-strip ./Debug/EditorRace.o -g -Wall -o - -frandom-seed=0
># 1 "EditorRace.cpp"
># 1 "/home/vegard/programming/git-working/ub/UnsignedByte/Core//"
># 1 "<built-in>"
># 1 "<command line>"
># 1 "EditorRace.cpp"
># 21 "EditorRace.cpp"
># 1 "CommandTable.h" 1
>       
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 1 3
># 35 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/os_defines.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/os_defines.h" 3
># 1 "/usr/include/features.h" 1 3 4
># 335 "/usr/include/features.h" 3 4
># 1 "/usr/include/sys/cdefs.h" 1 3 4
># 360 "/usr/include/sys/cdefs.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 361 "/usr/include/sys/cdefs.h" 2 3 4
># 336 "/usr/include/features.h" 2 3 4
># 359 "/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-32.h" 1 3 4
># 8 "/usr/include/gnu/stubs.h" 2 3 4
># 360 "/usr/include/features.h" 2 3 4
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/os_defines.h" 2 3
># 36 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/cpu_defines.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 2 3
>
>
>
>
>namespace __gnu_debug_def { }
>
>namespace __gnu_debug
>{
>  using namespace __gnu_debug_def;
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stringfwd.h" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stringfwd.h" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stringfwd.h" 3
>
>
>
>namespace std
>{
>  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;
>
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 152 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 3 4
>typedef int ptrdiff_t;
># 214 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 3 4
>typedef unsigned int size_t;
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 2 3
>
>namespace std
>{
>  using ::ptrdiff_t;
>  using ::size_t;
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 2 3
>
># 1 "/usr/include/string.h" 1 3 4
># 28 "/usr/include/string.h" 3 4
>extern "C" {
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 34 "/usr/include/string.h" 2 3 4
>
>
>
>
>extern void *memcpy (void *__restrict __dest,
>       __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void *memmove (void *__dest, __const void *__src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern void *memccpy (void *__restrict __dest, __const void *__restrict __src,
>        int __c, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern void *memset (void *__s, int __c, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int memcmp (__const void *__s1, __const void *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void *memchr (__const void *__s, int __c, size_t __n)
>      throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern void *rawmemchr (__const void *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memrchr (__const void *__s, int __c, size_t __n)
>      throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strcat (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncat (char *__restrict __dest, __const char *__restrict __src,
>        size_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern int strncmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcoll (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern size_t strxfrm (char *__restrict __dest,
>         __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>
># 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;
># 119 "/usr/include/string.h" 2 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)));
># 165 "/usr/include/string.h" 3 4
>
>
>extern char *strchr (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>extern char *strrchr (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strchrnul (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern size_t strcspn (__const char *__s, __const char *__reject)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern size_t strspn (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strpbrk (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strstr (__const char *__haystack, __const char *__needle)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>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 char *strcasestr (__const char *__haystack, __const char *__needle)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>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 ();
>
># 281 "/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 char *index (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern char *rindex (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>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 int strverscmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __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 char *strfry (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memfrob (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern char *basename (__const char *__filename) throw () __attribute__ ((__nonnull__ (1)));
># 432 "/usr/include/string.h" 3 4
>}
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 2 3
># 78 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 3
>namespace std
>{
>  using ::memcpy;
>  using ::memmove;
>  using ::strcpy;
>  using ::strncpy;
>  using ::strcat;
>  using ::strncat;
>  using ::memcmp;
>  using ::strcmp;
>  using ::strcoll;
>  using ::strncmp;
>  using ::strxfrm;
>  using ::strcspn;
>  using ::strspn;
>  using ::strtok;
>  using ::memset;
>  using ::strerror;
>  using ::strlen;
>
>  using ::memchr;
>
>  inline void*
>  memchr(void* __p, int __c, size_t __n)
>  { return memchr(const_cast<const void*>(__p), __c, __n); }
>
>  using ::strchr;
>
>  inline char*
>  strchr(char* __s1, int __n)
>  { return __builtin_strchr(const_cast<const char*>(__s1), __n); }
>
>  using ::strpbrk;
>
>  inline char*
>  strpbrk(char* __s1, const char* __s2)
>  { return __builtin_strpbrk(const_cast<const char*>(__s1), __s2); }
>
>  using ::strrchr;
>
>  inline char*
>  strrchr(char* __s1, int __n)
>  { return __builtin_strrchr(const_cast<const char*>(__s1), __n); }
>
>  using ::strstr;
>
>  inline char*
>  strstr(char* __s1, const char* __s2)
>  { return __builtin_strstr(const_cast<const char*>(__s1), __s2); }
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 1 3 4
># 11 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/syslimits.h" 1 3 4
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 1 3 4
># 122 "/usr/lib/gcc/i386-redhat-linux/4.1.2/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
># 153 "/usr/include/bits/posix1_lim.h" 3 4
># 1 "/usr/include/bits/local_lim.h" 1 3 4
># 36 "/usr/include/bits/local_lim.h" 3 4
># 1 "/usr/include/linux/limits.h" 1 3 4
># 37 "/usr/include/bits/local_lim.h" 2 3 4
># 154 "/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
># 123 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 2 3 4
># 8 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/syslimits.h" 2 3 4
># 12 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 2 3 4
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 2 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
># 1 "/usr/include/stdlib.h" 1 3 4
># 33 "/usr/include/stdlib.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/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
># 66 "/usr/include/bits/waitstatus.h" 2 3 4
>
>union wait
>  {
>    int w_status;
>    struct
>      {
>
> unsigned int __w_termsig:7;
> unsigned int __w_coredump:1;
> unsigned int __w_retcode:8;
> unsigned int:16;
>
>
>
>
>
>
>
>      } __wait_terminated;
>    struct
>      {
>
> unsigned int __w_stopval:8;
> unsigned int __w_stopsig:8;
> unsigned int:16;
>
>
>
>
>
>
>      } __wait_stopped;
>  };
># 44 "/usr/include/stdlib.h" 2 3 4
># 96 "/usr/include/stdlib.h" 3 4
>
>
>typedef struct
>  {
>    int quot;
>    int rem;
>  } div_t;
>
>
>
>typedef struct
>  {
>    long int quot;
>    long int rem;
>  } ldiv_t;
>
>
>
>
>
>
>
>__extension__ typedef struct
>  {
>    long long int quot;
>    long long int rem;
>  } lldiv_t;
>
>
># 140 "/usr/include/stdlib.h" 3 4
>extern size_t __ctype_get_mb_cur_max (void) throw () ;
>
>
>
>
>extern double atof (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern int atoi (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern long int atol (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__ extern long long int atoll (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern double strtod (__const char *__restrict __nptr,
>        char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern float strtof (__const char *__restrict __nptr,
>       char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern long double strtold (__const char *__restrict __nptr,
>       char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern long int strtol (__const char *__restrict __nptr,
>   char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern unsigned long int strtoul (__const char *__restrict __nptr,
>      char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>__extension__
>extern long long int strtoq (__const char *__restrict __nptr,
>        char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtouq (__const char *__restrict __nptr,
>           char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__
>extern long long int strtoll (__const char *__restrict __nptr,
>         char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtoull (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
># 240 "/usr/include/stdlib.h" 3 4
>extern long int strtol_l (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base,
>     __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern unsigned long int strtoul_l (__const char *__restrict __nptr,
>        char **__restrict __endptr,
>        int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern long long int strtoll_l (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __base,
>    __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern unsigned long long int strtoull_l (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern double strtod_l (__const char *__restrict __nptr,
>   char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern float strtof_l (__const char *__restrict __nptr,
>         char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern long double strtold_l (__const char *__restrict __nptr,
>         char **__restrict __endptr,
>         __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
># 311 "/usr/include/stdlib.h" 3 4
>extern char *l64a (long int __n) throw () ;
>
>
>extern long int a64l (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
># 1 "/usr/include/sys/types.h" 1 3 4
># 29 "/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;
>
>
>
>
>__extension__ typedef signed long long int __int64_t;
>__extension__ typedef unsigned long long int __uint64_t;
>
>
>
>
>
>
>
>__extension__ typedef long long int __quad_t;
>__extension__ typedef unsigned long 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
>
>
>__extension__ typedef __u_quad_t __dev_t;
>__extension__ typedef unsigned int __uid_t;
>__extension__ typedef unsigned int __gid_t;
>__extension__ typedef unsigned long int __ino_t;
>__extension__ typedef __u_quad_t __ino64_t;
>__extension__ typedef unsigned int __mode_t;
>__extension__ typedef unsigned int __nlink_t;
>__extension__ typedef long int __off_t;
>__extension__ typedef __quad_t __off64_t;
>__extension__ typedef int __pid_t;
>__extension__ typedef struct { int __val[2]; } __fsid_t;
>__extension__ typedef long int __clock_t;
>__extension__ typedef unsigned long int __rlim_t;
>__extension__ typedef __u_quad_t __rlim64_t;
>__extension__ typedef unsigned int __id_t;
>__extension__ typedef long int __time_t;
>__extension__ typedef unsigned int __useconds_t;
>__extension__ typedef long int __suseconds_t;
>
>__extension__ typedef int __daddr_t;
>__extension__ typedef long int __swblk_t;
>__extension__ typedef int __key_t;
>
>
>__extension__ typedef int __clockid_t;
>
>
>__extension__ typedef void * __timer_t;
>
>
>__extension__ typedef long int __blksize_t;
>
>
>
>
>__extension__ typedef long int __blkcnt_t;
>__extension__ typedef __quad_t __blkcnt64_t;
>
>
>__extension__ typedef unsigned long int __fsblkcnt_t;
>__extension__ typedef __u_quad_t __fsblkcnt64_t;
>
>
>__extension__ typedef unsigned long int __fsfilcnt_t;
>__extension__ typedef __u_quad_t __fsfilcnt64_t;
>
>__extension__ typedef int __ssize_t;
>
>
>
>typedef __off64_t __loff_t;
>typedef __quad_t *__qaddr_t;
>typedef char *__caddr_t;
>
>
>__extension__ typedef int __intptr_t;
>
>
>__extension__ typedef unsigned int __socklen_t;
># 32 "/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
># 59 "/usr/include/time.h" 3 4
>
>
>typedef __clock_t clock_t;
>
>
>
># 75 "/usr/include/time.h" 3 4
>
>
>typedef __time_t time_t;
>
>
>
># 93 "/usr/include/time.h" 3 4
>typedef __clockid_t clockid_t;
># 105 "/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/i386-redhat-linux/4.1.2/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
># 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
># 121 "/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
># 69 "/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;
># 67 "/usr/include/sys/select.h" 3 4
>typedef struct
>  {
>
>
>
>    __fd_mask fds_bits[1024 / (8 * sizeof (__fd_mask))];
>
>
>
>
>
>  } fd_set;
>
>
>
>
>
>
>typedef __fd_mask fd_mask;
># 99 "/usr/include/sys/select.h" 3 4
>extern "C" {
># 109 "/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);
># 121 "/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);
>
>
>}
># 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
>__extension__
>extern unsigned int gnu_dev_major (unsigned long long int __dev)
>     throw ();
>__extension__
>extern unsigned int gnu_dev_minor (unsigned long long int __dev)
>     throw ();
>__extension__
>extern unsigned long long int gnu_dev_makedev (unsigned int __major,
>            unsigned int __minor)
>     throw ();
># 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;
># 262 "/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
># 36 "/usr/include/bits/pthreadtypes.h" 3 4
>typedef unsigned long int pthread_t;
>
>
>typedef union
>{
>  char __size[36];
>  long int __align;
>} pthread_attr_t;
>
>
>typedef struct __pthread_internal_slist
>{
>  struct __pthread_internal_slist *__next;
>} __pthread_slist_t;
>
>
>
>
>typedef union
>{
>  struct __pthread_mutex_s
>  {
>    int __lock;
>    unsigned int __count;
>    int __owner;
>
>
>    int __kind;
>    unsigned int __nusers;
>    __extension__ union
>    {
>      int __spins;
>      __pthread_slist_t __list;
>    };
>  } __data;
>  char __size[24];
>  long int __align;
>} pthread_mutex_t;
>
>typedef union
>{
>  char __size[4];
>  long 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];
>  long 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;
>
>
>    unsigned char __flags;
>    unsigned char __shared;
>    unsigned char __pad1;
>    unsigned char __pad2;
>    int __writer;
>  } __data;
>  char __size[32];
>  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[20];
>  long int __align;
>} pthread_barrier_t;
>
>typedef union
>{
>  char __size[4];
>  int __align;
>} pthread_barrierattr_t;
># 271 "/usr/include/sys/types.h" 2 3 4
>
>
>}
># 321 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>
>
>extern long int random (void) throw ();
>
>
>extern void srandom (unsigned int __seed) throw ();
>
>
>
>
>
>extern char *initstate (unsigned int __seed, char *__statebuf,
>   size_t __statelen) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern char *setstate (char *__statebuf) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>struct random_data
>  {
>    int32_t *fptr;
>    int32_t *rptr;
>    int32_t *state;
>    int rand_type;
>    int rand_deg;
>    int rand_sep;
>    int32_t *end_ptr;
>  };
>
>extern int random_r (struct random_data *__restrict __buf,
>       int32_t *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int srandom_r (unsigned int __seed, struct random_data *__buf)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int initstate_r (unsigned int __seed, char *__restrict __statebuf,
>   size_t __statelen,
>   struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (2, 4)));
>
>extern int setstate_r (char *__restrict __statebuf,
>         struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern int rand (void) throw ();
>
>extern void srand (unsigned int __seed) throw ();
>
>
>
>
>extern int rand_r (unsigned int *__seed) throw ();
>
>
>
>
>
>
>
>extern double drand48 (void) throw ();
>extern double erand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int lrand48 (void) throw ();
>extern long int nrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int mrand48 (void) throw ();
>extern long int jrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void srand48 (long int __seedval) throw ();
>extern unsigned short int *seed48 (unsigned short int __seed16v[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>extern void lcong48 (unsigned short int __param[7]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>struct drand48_data
>  {
>    unsigned short int __x[3];
>    unsigned short int __old_x[3];
>    unsigned short int __c;
>    unsigned short int __init;
>    unsigned long long int __a;
>  };
>
>
>extern int drand48_r (struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int erand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int lrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int nrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int mrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int jrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int srand48_r (long int __seedval, struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int seed48_r (unsigned short int __seed16v[3],
>       struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int lcong48_r (unsigned short int __param[7],
>        struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>
>
>extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>extern void *calloc (size_t __nmemb, size_t __size)
>     throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>
>
>
>
>
>
>extern void *realloc (void *__ptr, size_t __size)
>     throw () __attribute__ ((__warn_unused_result__));
>
>extern void free (void *__ptr) throw ();
>
>
>
>
>extern void cfree (void *__ptr) throw ();
>
>
>
># 1 "/usr/include/alloca.h" 1 3 4
># 25 "/usr/include/alloca.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 26 "/usr/include/alloca.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>extern void *alloca (size_t __size) throw ();
>
>
>
>
>
>}
># 498 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>extern void *valloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern void abort (void) throw () __attribute__ ((__noreturn__));
>
>
>
>extern int atexit (void (*__func) (void)) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern 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 _Exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>extern char *getenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern char *__secure_getenv (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int putenv (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int setenv (__const char *__name, __const char *__value, int __replace)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int unsetenv (__const char *__name) throw ();
>
>
>
>
>
>
>extern int clearenv (void) throw ();
># 583 "/usr/include/stdlib.h" 3 4
>extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
># 594 "/usr/include/stdlib.h" 3 4
>extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 604 "/usr/include/stdlib.h" 3 4
>extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 614 "/usr/include/stdlib.h" 3 4
>extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
># 625 "/usr/include/stdlib.h" 3 4
>extern int mkostemp (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ;
># 635 "/usr/include/stdlib.h" 3 4
>extern int mkostemp64 (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>
>
>extern int system (__const char *__command) ;
>
>
>
>
>
>
>extern char *canonicalize_file_name (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 662 "/usr/include/stdlib.h" 3 4
>extern char *realpath (__const char *__restrict __name,
>         char *__restrict __resolved) throw () ;
>
>
>
>
>
>
>typedef int (*__compar_fn_t) (__const void *, __const void *);
>
>
>typedef __compar_fn_t comparison_fn_t;
>
>
>
>
>
>
>extern void *bsearch (__const void *__key, __const void *__base,
>        size_t __nmemb, size_t __size, __compar_fn_t __compar)
>     __attribute__ ((__nonnull__ (1, 2, 5))) ;
>
>
>
>extern void qsort (void *__base, size_t __nmemb, size_t __size,
>     __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4)));
>
>
>
>extern int abs (int __x) throw () __attribute__ ((__const__)) ;
>extern long int labs (long int __x) throw () __attribute__ ((__const__)) ;
>
>
>
>__extension__ extern long long int llabs (long long int __x)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>
>
>
>extern div_t div (int __numer, int __denom)
>     throw () __attribute__ ((__const__)) ;
>extern ldiv_t ldiv (long int __numer, long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>__extension__ extern lldiv_t lldiv (long long int __numer,
>        long long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
># 727 "/usr/include/stdlib.h" 3 4
>extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ;
>
>
>
>
>extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ;
>
>
>
>
>extern char *gcvt (double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) ;
>
>
>
>
>extern char *qecvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) ;
>extern char *qfcvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) ;
>extern char *qgcvt (long double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) ;
>
>
>
>
>extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign, char *__restrict __buf,
>     size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign, char *__restrict __buf,
>     size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>
>extern int qecvt_r (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>extern int qfcvt_r (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>
>
>
>
>
>
>
>extern int mblen (__const char *__s, size_t __n) throw () ;
>
>
>extern int mbtowc (wchar_t *__restrict __pwc,
>     __const char *__restrict __s, size_t __n) throw () ;
>
>
>extern int wctomb (char *__s, wchar_t __wchar) throw () ;
>
>
>
>extern size_t mbstowcs (wchar_t *__restrict __pwcs,
>   __const char *__restrict __s, size_t __n) throw ();
>
>extern size_t wcstombs (char *__restrict __s,
>   __const wchar_t *__restrict __pwcs, size_t __n)
>     throw ();
>
>
>
>
>
>
>
>
>extern int rpmatch (__const char *__response) throw () __attribute__ ((__nonnull__ (1))) ;
># 815 "/usr/include/stdlib.h" 3 4
>extern int getsubopt (char **__restrict __optionp,
>        char *__const *__restrict __tokens,
>        char **__restrict __valuep)
>     throw () __attribute__ ((__nonnull__ (1, 2, 3))) ;
>
>
>
>
>
>extern void setkey (__const char *__key) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int posix_openpt (int __oflag) ;
>
>
>
>
>
>
>
>extern int grantpt (int __fd) throw ();
>
>
>
>extern int unlockpt (int __fd) throw ();
>
>
>
>
>extern char *ptsname (int __fd) throw () ;
>
>
>
>
>
>
>extern int ptsname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int getpt (void);
>
>
>
>
>
>
>extern int getloadavg (double __loadavg[], int __nelem)
>     throw () __attribute__ ((__nonnull__ (1)));
># 883 "/usr/include/stdlib.h" 3 4
>}
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 2 3
># 103 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>namespace std
>{
>  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); }
>}
># 159 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>namespace __gnu_cxx
>{
>
>  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;
># 192 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>
>
>
>
># 1 "/usr/include/stdio.h" 1 3 4
># 30 "/usr/include/stdio.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 35 "/usr/include/stdio.h" 2 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;
># 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/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 16 "/usr/include/_G_config.h" 2 3 4
>
>
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 78 "/usr/include/wchar.h" 3 4
>typedef struct
>{
>  int __count;
>  union
>  {
>
>    unsigned int __wch;
>
>
>
>    char __wchb[4];
>  } __value;
>} __mbstate_t;
># 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
># 53 "/usr/include/libio.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 1 3 4
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 3 4
>typedef __builtin_va_list __gnuc_va_list;
># 54 "/usr/include/libio.h" 2 3 4
># 170 "/usr/include/libio.h" 3 4
>struct _IO_jump_t; struct _IO_FILE;
># 180 "/usr/include/libio.h" 3 4
>typedef void _IO_lock_t;
>
>
>
>
>
>struct _IO_marker {
>  struct _IO_marker *_next;
>  struct _IO_FILE *_sbuf;
>
>
>
>  int _pos;
># 203 "/usr/include/libio.h" 3 4
>};
>
>
>enum __codecvt_result
>{
>  __codecvt_ok,
>  __codecvt_partial,
>  __codecvt_error,
>  __codecvt_noconv
>};
># 271 "/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;
># 319 "/usr/include/libio.h" 3 4
>  __off64_t _offset;
># 328 "/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_;
># 364 "/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);
># 458 "/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 ();
># 488 "/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 ();
># 550 "/usr/include/libio.h" 3 4
>}
># 76 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>typedef __gnuc_va_list va_list;
># 89 "/usr/include/stdio.h" 3 4
>
>
>typedef _G_fpos_t fpos_t;
>
>
>
>
>
>typedef _G_fpos64_t fpos64_t;
># 141 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 142 "/usr/include/stdio.h" 2 3 4
>
>
>
>extern struct _IO_FILE *stdin;
>extern struct _IO_FILE *stdout;
>extern struct _IO_FILE *stderr;
>
>
>
>
>
>
>
>
>
>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 ();
>
>
>
>
>
>
>
>
>extern FILE *tmpfile (void) ;
># 184 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile64 (void) ;
>
>
>
>extern char *tmpnam (char *__s) throw () ;
>
>
>
>
>
>extern char *tmpnam_r (char *__s) throw () ;
># 206 "/usr/include/stdio.h" 3 4
>extern char *tempnam (__const char *__dir, __const char *__pfx)
>     throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>
>
>
>
>extern int fclose (FILE *__stream);
>
>
>
>
>extern int fflush (FILE *__stream);
>
># 231 "/usr/include/stdio.h" 3 4
>extern int fflush_unlocked (FILE *__stream);
># 241 "/usr/include/stdio.h" 3 4
>extern int fcloseall (void);
>
>
>
>
>
>
>
>
>
>extern FILE *fopen (__const char *__restrict __filename,
>      __const char *__restrict __modes) ;
>
>
>
>
>extern FILE *freopen (__const char *__restrict __filename,
>        __const char *__restrict __modes,
>        FILE *__restrict __stream) ;
># 274 "/usr/include/stdio.h" 3 4
>
>
>extern FILE *fopen64 (__const char *__restrict __filename,
>        __const char *__restrict __modes) ;
>extern FILE *freopen64 (__const char *__restrict __filename,
>   __const char *__restrict __modes,
>   FILE *__restrict __stream) ;
>
>
>
>
>extern FILE *fdopen (int __fd, __const char *__modes) throw () ;
>
>
>
>
>
>extern FILE *fopencookie (void *__restrict __magic_cookie,
>     __const char *__restrict __modes,
>     _IO_cookie_io_functions_t __io_funcs) throw () ;
>
>
>extern FILE *fmemopen (void *__s, size_t __len, __const char *__modes)
>  throw () ;
>
>
>
>
>extern FILE *open_memstream (char **__bufloc, size_t *__sizeloc) throw () ;
>
>
>
>
>
>
>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 ();
>
>
>
>
>
>
>
>
>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))) ;
>extern int __asprintf (char **__restrict __ptr,
>         __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3))) ;
>extern int asprintf (char **__restrict __ptr,
>       __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3))) ;
>
>
>
>
>
>
>
>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)));
>
>
>
>
>
>
>
>
>extern int fscanf (FILE *__restrict __stream,
>     __const char *__restrict __format, ...) ;
>
>
>
>
>extern int scanf (__const char *__restrict __format, ...) ;
>
>extern int sscanf (__const char *__restrict __s,
>     __const char *__restrict __format, ...) throw ();
># 443 "/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))) ;
>
>
>
>
>
>extern int vscanf (__const char *__restrict __format, __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 1, 0))) ;
>
>
>extern int vsscanf (__const char *__restrict __s,
>      __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__scanf__, 2, 0)));
># 502 "/usr/include/stdio.h" 3 4
>
>
>
>
>
>
>
>
>
>extern int fgetc (FILE *__stream);
>extern int getc (FILE *__stream);
>
>
>
>
>
>extern int getchar (void);
>
># 530 "/usr/include/stdio.h" 3 4
>extern int getc_unlocked (FILE *__stream);
>extern int getchar_unlocked (void);
># 541 "/usr/include/stdio.h" 3 4
>extern int fgetc_unlocked (FILE *__stream);
>
>
>
>
>
>
>
>
>
>
>
>extern int fputc (int __c, FILE *__stream);
>extern int putc (int __c, FILE *__stream);
>
>
>
>
>
>extern int putchar (int __c);
>
># 574 "/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);
>
>
>
>
>
>
>
>
>extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
>     ;
>
>
>
>
>
>
>extern char *gets (char *__s) ;
>
># 620 "/usr/include/stdio.h" 3 4
>extern char *fgets_unlocked (char *__restrict __s, int __n,
>        FILE *__restrict __stream) ;
># 636 "/usr/include/stdio.h" 3 4
>extern __ssize_t __getdelim (char **__restrict __lineptr,
>          size_t *__restrict __n, int __delimiter,
>          FILE *__restrict __stream) ;
>extern __ssize_t getdelim (char **__restrict __lineptr,
>        size_t *__restrict __n, int __delimiter,
>        FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>extern __ssize_t getline (char **__restrict __lineptr,
>       size_t *__restrict __n,
>       FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>
>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) ;
>
>
>
>
>extern size_t fwrite (__const void *__restrict __ptr, size_t __size,
>        size_t __n, FILE *__restrict __s) ;
>
># 697 "/usr/include/stdio.h" 3 4
>extern int fputs_unlocked (__const char *__restrict __s,
>      FILE *__restrict __stream);
># 708 "/usr/include/stdio.h" 3 4
>extern size_t fread_unlocked (void *__restrict __ptr, size_t __size,
>         size_t __n, FILE *__restrict __stream) ;
>extern size_t fwrite_unlocked (__const void *__restrict __ptr, size_t __size,
>          size_t __n, FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>
>extern int fseek (FILE *__stream, long int __off, int __whence);
>
>
>
>
>extern long int ftell (FILE *__stream) ;
>
>
>
>
>extern void rewind (FILE *__stream);
>
># 744 "/usr/include/stdio.h" 3 4
>extern int fseeko (FILE *__stream, __off_t __off, int __whence);
>
>
>
>
>extern __off_t ftello (FILE *__stream) ;
># 763 "/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);
># 786 "/usr/include/stdio.h" 3 4
>
>
>
>extern int fseeko64 (FILE *__stream, __off64_t __off, int __whence);
>extern __off64_t ftello64 (FILE *__stream) ;
>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 () ;
>
>extern int ferror (FILE *__stream) throw () ;
>
>
>
>
>extern void clearerr_unlocked (FILE *__stream) throw ();
>extern int feof_unlocked (FILE *__stream) throw () ;
>extern int ferror_unlocked (FILE *__stream) throw () ;
>
>
>
>
>
>
>
>
>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[];
># 825 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>extern int fileno (FILE *__stream) throw () ;
>
>
>
>
>extern int fileno_unlocked (FILE *__stream) throw () ;
># 844 "/usr/include/stdio.h" 3 4
>extern FILE *popen (__const char *__command, __const char *__modes) ;
>
>
>
>
>
>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 () ;
>
>
>extern void funlockfile (FILE *__stream) throw ();
># 914 "/usr/include/stdio.h" 3 4
>}
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 2 3
># 98 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>namespace std
>{
>  using ::FILE;
>  using ::fpos_t;
>
>  using ::clearerr;
>  using ::fclose;
>  using ::feof;
>  using ::ferror;
>  using ::fflush;
>  using ::fgetc;
>  using ::fgetpos;
>  using ::fgets;
>  using ::fopen;
>  using ::fprintf;
>  using ::fputc;
>  using ::fputs;
>  using ::fread;
>  using ::freopen;
>  using ::fscanf;
>  using ::fseek;
>  using ::fsetpos;
>  using ::ftell;
>  using ::fwrite;
>  using ::getc;
>  using ::getchar;
>  using ::gets;
>  using ::perror;
>  using ::printf;
>  using ::putc;
>  using ::putchar;
>  using ::puts;
>  using ::remove;
>  using ::rename;
>  using ::rewind;
>  using ::scanf;
>  using ::setbuf;
>  using ::setvbuf;
>  using ::sprintf;
>  using ::sscanf;
>  using ::tmpfile;
>  using ::tmpnam;
>  using ::ungetc;
>  using ::vfprintf;
>  using ::vprintf;
>  using ::vsprintf;
>}
># 154 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>namespace __gnu_cxx
>{
># 169 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>  using ::snprintf;
>  using ::vfscanf;
>  using ::vscanf;
>  using ::vsnprintf;
>  using ::vsscanf;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::snprintf;
>  using __gnu_cxx::vfscanf;
>  using __gnu_cxx::vscanf;
>  using __gnu_cxx::vsnprintf;
>  using __gnu_cxx::vsscanf;
>}
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 3
>
># 1 "/usr/include/locale.h" 1 3 4
># 29 "/usr/include/locale.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/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 ();
>
>
># 148 "/usr/include/locale.h" 3 4
>typedef __locale_t locale_t;
>
>
>
>
>
>extern __locale_t newlocale (int __category_mask, __const char *__locale,
>        __locale_t __base) throw ();
># 189 "/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 ();
>
>
>
>
>
>
>
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 2 3
>
>
>
>
>
>namespace std
>{
>  using ::lconv;
>  using ::setlocale;
>  using ::localeconv;
>}
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/langinfo.h" 1 3 4
># 24 "/usr/include/langinfo.h" 3 4
># 1 "/usr/include/nl_types.h" 1 3 4
># 31 "/usr/include/nl_types.h" 3 4
>extern "C" {
>
>
>typedef void *nl_catd;
>
>
>typedef int nl_item;
>
>
>
>
>
>extern nl_catd catopen (__const char *__cat_name, int __flag) __attribute__ ((__nonnull__ (1)));
>
>
>
>extern char *catgets (nl_catd __catalog, int __set, int __number,
>        __const char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int catclose (nl_catd __catalog) throw () __attribute__ ((__nonnull__ (1)));
>
>}
># 25 "/usr/include/langinfo.h" 2 3 4
>
># 1 "/usr/include/bits/locale.h" 1 3 4
># 27 "/usr/include/langinfo.h" 2 3 4
>
>
>extern "C" {
># 42 "/usr/include/langinfo.h" 3 4
>enum
>{
>
>
>
>  ABDAY_1 = (((__LC_TIME) << 16) | (0)),
>
>  ABDAY_2,
>
>  ABDAY_3,
>
>  ABDAY_4,
>
>  ABDAY_5,
>
>  ABDAY_6,
>
>  ABDAY_7,
>
>
>
>  DAY_1,
>
>  DAY_2,
>
>  DAY_3,
>
>  DAY_4,
>
>  DAY_5,
>
>  DAY_6,
>
>  DAY_7,
>
>
>
>  ABMON_1,
>
>  ABMON_2,
>
>  ABMON_3,
>
>  ABMON_4,
>
>  ABMON_5,
>
>  ABMON_6,
>
>  ABMON_7,
>
>  ABMON_8,
>
>  ABMON_9,
>
>  ABMON_10,
>
>  ABMON_11,
>
>  ABMON_12,
>
>
>
>  MON_1,
>
>  MON_2,
>
>  MON_3,
>
>  MON_4,
>
>  MON_5,
>
>  MON_6,
>
>  MON_7,
>
>  MON_8,
>
>  MON_9,
>
>  MON_10,
>
>  MON_11,
>
>  MON_12,
>
>
>  AM_STR,
>
>  PM_STR,
>
>
>  D_T_FMT,
>
>  D_FMT,
>
>  T_FMT,
>
>  T_FMT_AMPM,
>
>
>  ERA,
>
>  __ERA_YEAR,
>
>
>
>  ERA_D_FMT,
>
>  ALT_DIGITS,
>
>  ERA_D_T_FMT,
>
>  ERA_T_FMT,
>
>
>  _NL_TIME_ERA_NUM_ENTRIES,
>  _NL_TIME_ERA_ENTRIES,
>
>  _NL_WABDAY_1,
>  _NL_WABDAY_2,
>  _NL_WABDAY_3,
>  _NL_WABDAY_4,
>  _NL_WABDAY_5,
>  _NL_WABDAY_6,
>  _NL_WABDAY_7,
>
>
>  _NL_WDAY_1,
>  _NL_WDAY_2,
>  _NL_WDAY_3,
>  _NL_WDAY_4,
>  _NL_WDAY_5,
>  _NL_WDAY_6,
>  _NL_WDAY_7,
>
>
>  _NL_WABMON_1,
>  _NL_WABMON_2,
>  _NL_WABMON_3,
>  _NL_WABMON_4,
>  _NL_WABMON_5,
>  _NL_WABMON_6,
>  _NL_WABMON_7,
>  _NL_WABMON_8,
>  _NL_WABMON_9,
>  _NL_WABMON_10,
>  _NL_WABMON_11,
>  _NL_WABMON_12,
>
>
>  _NL_WMON_1,
>  _NL_WMON_2,
>  _NL_WMON_3,
>  _NL_WMON_4,
>  _NL_WMON_5,
>  _NL_WMON_6,
>  _NL_WMON_7,
>  _NL_WMON_8,
>  _NL_WMON_9,
>  _NL_WMON_10,
>  _NL_WMON_11,
>  _NL_WMON_12,
>
>  _NL_WAM_STR,
>  _NL_WPM_STR,
>
>  _NL_WD_T_FMT,
>  _NL_WD_FMT,
>  _NL_WT_FMT,
>  _NL_WT_FMT_AMPM,
>
>  _NL_WERA_YEAR,
>  _NL_WERA_D_FMT,
>  _NL_WALT_DIGITS,
>  _NL_WERA_D_T_FMT,
>  _NL_WERA_T_FMT,
>
>  _NL_TIME_WEEK_NDAYS,
>  _NL_TIME_WEEK_1STDAY,
>  _NL_TIME_WEEK_1STWEEK,
>  _NL_TIME_FIRST_WEEKDAY,
>  _NL_TIME_FIRST_WORKDAY,
>  _NL_TIME_CAL_DIRECTION,
>  _NL_TIME_TIMEZONE,
>
>  _DATE_FMT,
>
>  _NL_W_DATE_FMT,
>
>  _NL_TIME_CODESET,
>
>  _NL_NUM_LC_TIME,
>
>
>
>
>  _NL_COLLATE_NRULES = (((__LC_COLLATE) << 16) | (0)),
>  _NL_COLLATE_RULESETS,
>  _NL_COLLATE_TABLEMB,
>  _NL_COLLATE_WEIGHTMB,
>  _NL_COLLATE_EXTRAMB,
>  _NL_COLLATE_INDIRECTMB,
>  _NL_COLLATE_GAP1,
>  _NL_COLLATE_GAP2,
>  _NL_COLLATE_GAP3,
>  _NL_COLLATE_TABLEWC,
>  _NL_COLLATE_WEIGHTWC,
>  _NL_COLLATE_EXTRAWC,
>  _NL_COLLATE_INDIRECTWC,
>  _NL_COLLATE_SYMB_HASH_SIZEMB,
>  _NL_COLLATE_SYMB_TABLEMB,
>  _NL_COLLATE_SYMB_EXTRAMB,
>  _NL_COLLATE_COLLSEQMB,
>  _NL_COLLATE_COLLSEQWC,
>  _NL_COLLATE_CODESET,
>  _NL_NUM_LC_COLLATE,
>
>
>
>
>  _NL_CTYPE_CLASS = (((__LC_CTYPE) << 16) | (0)),
>  _NL_CTYPE_TOUPPER,
>  _NL_CTYPE_GAP1,
>  _NL_CTYPE_TOLOWER,
>  _NL_CTYPE_GAP2,
>  _NL_CTYPE_CLASS32,
>  _NL_CTYPE_GAP3,
>  _NL_CTYPE_GAP4,
>  _NL_CTYPE_GAP5,
>  _NL_CTYPE_GAP6,
>  _NL_CTYPE_CLASS_NAMES,
>  _NL_CTYPE_MAP_NAMES,
>  _NL_CTYPE_WIDTH,
>  _NL_CTYPE_MB_CUR_MAX,
>  _NL_CTYPE_CODESET_NAME,
>  CODESET = _NL_CTYPE_CODESET_NAME,
>
>  _NL_CTYPE_TOUPPER32,
>  _NL_CTYPE_TOLOWER32,
>  _NL_CTYPE_CLASS_OFFSET,
>  _NL_CTYPE_MAP_OFFSET,
>  _NL_CTYPE_INDIGITS_MB_LEN,
>  _NL_CTYPE_INDIGITS0_MB,
>  _NL_CTYPE_INDIGITS1_MB,
>  _NL_CTYPE_INDIGITS2_MB,
>  _NL_CTYPE_INDIGITS3_MB,
>  _NL_CTYPE_INDIGITS4_MB,
>  _NL_CTYPE_INDIGITS5_MB,
>  _NL_CTYPE_INDIGITS6_MB,
>  _NL_CTYPE_INDIGITS7_MB,
>  _NL_CTYPE_INDIGITS8_MB,
>  _NL_CTYPE_INDIGITS9_MB,
>  _NL_CTYPE_INDIGITS_WC_LEN,
>  _NL_CTYPE_INDIGITS0_WC,
>  _NL_CTYPE_INDIGITS1_WC,
>  _NL_CTYPE_INDIGITS2_WC,
>  _NL_CTYPE_INDIGITS3_WC,
>  _NL_CTYPE_INDIGITS4_WC,
>  _NL_CTYPE_INDIGITS5_WC,
>  _NL_CTYPE_INDIGITS6_WC,
>  _NL_CTYPE_INDIGITS7_WC,
>  _NL_CTYPE_INDIGITS8_WC,
>  _NL_CTYPE_INDIGITS9_WC,
>  _NL_CTYPE_OUTDIGIT0_MB,
>  _NL_CTYPE_OUTDIGIT1_MB,
>  _NL_CTYPE_OUTDIGIT2_MB,
>  _NL_CTYPE_OUTDIGIT3_MB,
>  _NL_CTYPE_OUTDIGIT4_MB,
>  _NL_CTYPE_OUTDIGIT5_MB,
>  _NL_CTYPE_OUTDIGIT6_MB,
>  _NL_CTYPE_OUTDIGIT7_MB,
>  _NL_CTYPE_OUTDIGIT8_MB,
>  _NL_CTYPE_OUTDIGIT9_MB,
>  _NL_CTYPE_OUTDIGIT0_WC,
>  _NL_CTYPE_OUTDIGIT1_WC,
>  _NL_CTYPE_OUTDIGIT2_WC,
>  _NL_CTYPE_OUTDIGIT3_WC,
>  _NL_CTYPE_OUTDIGIT4_WC,
>  _NL_CTYPE_OUTDIGIT5_WC,
>  _NL_CTYPE_OUTDIGIT6_WC,
>  _NL_CTYPE_OUTDIGIT7_WC,
>  _NL_CTYPE_OUTDIGIT8_WC,
>  _NL_CTYPE_OUTDIGIT9_WC,
>  _NL_CTYPE_TRANSLIT_TAB_SIZE,
>  _NL_CTYPE_TRANSLIT_FROM_IDX,
>  _NL_CTYPE_TRANSLIT_FROM_TBL,
>  _NL_CTYPE_TRANSLIT_TO_IDX,
>  _NL_CTYPE_TRANSLIT_TO_TBL,
>  _NL_CTYPE_TRANSLIT_DEFAULT_MISSING_LEN,
>  _NL_CTYPE_TRANSLIT_DEFAULT_MISSING,
>  _NL_CTYPE_TRANSLIT_IGNORE_LEN,
>  _NL_CTYPE_TRANSLIT_IGNORE,
>  _NL_CTYPE_MAP_TO_NONASCII,
>  _NL_CTYPE_EXTRA_MAP_1,
>  _NL_CTYPE_EXTRA_MAP_2,
>  _NL_CTYPE_EXTRA_MAP_3,
>  _NL_CTYPE_EXTRA_MAP_4,
>  _NL_CTYPE_EXTRA_MAP_5,
>  _NL_CTYPE_EXTRA_MAP_6,
>  _NL_CTYPE_EXTRA_MAP_7,
>  _NL_CTYPE_EXTRA_MAP_8,
>  _NL_CTYPE_EXTRA_MAP_9,
>  _NL_CTYPE_EXTRA_MAP_10,
>  _NL_CTYPE_EXTRA_MAP_11,
>  _NL_CTYPE_EXTRA_MAP_12,
>  _NL_CTYPE_EXTRA_MAP_13,
>  _NL_CTYPE_EXTRA_MAP_14,
>  _NL_NUM_LC_CTYPE,
>
>
>
>
>  __INT_CURR_SYMBOL = (((__LC_MONETARY) << 16) | (0)),
>
>
>
>  __CURRENCY_SYMBOL,
>
>
>
>  __MON_DECIMAL_POINT,
>
>
>
>  __MON_THOUSANDS_SEP,
>
>
>
>  __MON_GROUPING,
>
>
>
>  __POSITIVE_SIGN,
>
>
>
>  __NEGATIVE_SIGN,
>
>
>
>  __INT_FRAC_DIGITS,
>
>
>
>  __FRAC_DIGITS,
>
>
>
>  __P_CS_PRECEDES,
>
>
>
>  __P_SEP_BY_SPACE,
>
>
>
>  __N_CS_PRECEDES,
>
>
>
>  __N_SEP_BY_SPACE,
>
>
>
>  __P_SIGN_POSN,
>
>
>
>  __N_SIGN_POSN,
>
>
>
>  _NL_MONETARY_CRNCYSTR,
>
>  __INT_P_CS_PRECEDES,
>
>
>
>  __INT_P_SEP_BY_SPACE,
>
>
>
>  __INT_N_CS_PRECEDES,
>
>
>
>  __INT_N_SEP_BY_SPACE,
>
>
>
>  __INT_P_SIGN_POSN,
>
>
>
>  __INT_N_SIGN_POSN,
>
>
>
>  _NL_MONETARY_DUO_INT_CURR_SYMBOL,
>  _NL_MONETARY_DUO_CURRENCY_SYMBOL,
>  _NL_MONETARY_DUO_INT_FRAC_DIGITS,
>  _NL_MONETARY_DUO_FRAC_DIGITS,
>  _NL_MONETARY_DUO_P_CS_PRECEDES,
>  _NL_MONETARY_DUO_P_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_N_CS_PRECEDES,
>  _NL_MONETARY_DUO_N_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_INT_P_CS_PRECEDES,
>  _NL_MONETARY_DUO_INT_P_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_INT_N_CS_PRECEDES,
>  _NL_MONETARY_DUO_INT_N_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_P_SIGN_POSN,
>  _NL_MONETARY_DUO_N_SIGN_POSN,
>  _NL_MONETARY_DUO_INT_P_SIGN_POSN,
>  _NL_MONETARY_DUO_INT_N_SIGN_POSN,
>  _NL_MONETARY_UNO_VALID_FROM,
>  _NL_MONETARY_UNO_VALID_TO,
>  _NL_MONETARY_DUO_VALID_FROM,
>  _NL_MONETARY_DUO_VALID_TO,
>  _NL_MONETARY_CONVERSION_RATE,
>  _NL_MONETARY_DECIMAL_POINT_WC,
>  _NL_MONETARY_THOUSANDS_SEP_WC,
>  _NL_MONETARY_CODESET,
>  _NL_NUM_LC_MONETARY,
>
>
>
>  __DECIMAL_POINT = (((__LC_NUMERIC) << 16) | (0)),
>
>
>
>  RADIXCHAR = __DECIMAL_POINT,
>
>  __THOUSANDS_SEP,
>
>
>
>  THOUSEP = __THOUSANDS_SEP,
>
>  __GROUPING,
>
>
>
>  _NL_NUMERIC_DECIMAL_POINT_WC,
>  _NL_NUMERIC_THOUSANDS_SEP_WC,
>  _NL_NUMERIC_CODESET,
>  _NL_NUM_LC_NUMERIC,
>
>  __YESEXPR = (((__LC_MESSAGES) << 16) | (0)),
>
>  __NOEXPR,
>
>  __YESSTR,
>
>
>
>  __NOSTR,
>
>
>
>  _NL_MESSAGES_CODESET,
>  _NL_NUM_LC_MESSAGES,
>
>  _NL_PAPER_HEIGHT = (((__LC_PAPER) << 16) | (0)),
>  _NL_PAPER_WIDTH,
>  _NL_PAPER_CODESET,
>  _NL_NUM_LC_PAPER,
>
>  _NL_NAME_NAME_FMT = (((__LC_NAME) << 16) | (0)),
>  _NL_NAME_NAME_GEN,
>  _NL_NAME_NAME_MR,
>  _NL_NAME_NAME_MRS,
>  _NL_NAME_NAME_MISS,
>  _NL_NAME_NAME_MS,
>  _NL_NAME_CODESET,
>  _NL_NUM_LC_NAME,
>
>  _NL_ADDRESS_POSTAL_FMT = (((__LC_ADDRESS) << 16) | (0)),
>  _NL_ADDRESS_COUNTRY_NAME,
>  _NL_ADDRESS_COUNTRY_POST,
>  _NL_ADDRESS_COUNTRY_AB2,
>  _NL_ADDRESS_COUNTRY_AB3,
>  _NL_ADDRESS_COUNTRY_CAR,
>  _NL_ADDRESS_COUNTRY_NUM,
>  _NL_ADDRESS_COUNTRY_ISBN,
>  _NL_ADDRESS_LANG_NAME,
>  _NL_ADDRESS_LANG_AB,
>  _NL_ADDRESS_LANG_TERM,
>  _NL_ADDRESS_LANG_LIB,
>  _NL_ADDRESS_CODESET,
>  _NL_NUM_LC_ADDRESS,
>
>  _NL_TELEPHONE_TEL_INT_FMT = (((__LC_TELEPHONE) << 16) | (0)),
>  _NL_TELEPHONE_TEL_DOM_FMT,
>  _NL_TELEPHONE_INT_SELECT,
>  _NL_TELEPHONE_INT_PREFIX,
>  _NL_TELEPHONE_CODESET,
>  _NL_NUM_LC_TELEPHONE,
>
>  _NL_MEASUREMENT_MEASUREMENT = (((__LC_MEASUREMENT) << 16) | (0)),
>  _NL_MEASUREMENT_CODESET,
>  _NL_NUM_LC_MEASUREMENT,
>
>  _NL_IDENTIFICATION_TITLE = (((__LC_IDENTIFICATION) << 16) | (0)),
>  _NL_IDENTIFICATION_SOURCE,
>  _NL_IDENTIFICATION_ADDRESS,
>  _NL_IDENTIFICATION_CONTACT,
>  _NL_IDENTIFICATION_EMAIL,
>  _NL_IDENTIFICATION_TEL,
>  _NL_IDENTIFICATION_FAX,
>  _NL_IDENTIFICATION_LANGUAGE,
>  _NL_IDENTIFICATION_TERRITORY,
>  _NL_IDENTIFICATION_AUDIENCE,
>  _NL_IDENTIFICATION_APPLICATION,
>  _NL_IDENTIFICATION_ABBREVIATION,
>  _NL_IDENTIFICATION_REVISION,
>  _NL_IDENTIFICATION_DATE,
>  _NL_IDENTIFICATION_CATEGORY,
>  _NL_IDENTIFICATION_CODESET,
>  _NL_NUM_LC_IDENTIFICATION,
>
>
>  _NL_NUM
>};
># 582 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo (nl_item __item) throw ();
># 593 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo_l (nl_item __item, __locale_t l);
>
>
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/iconv.h" 1 3 4
># 24 "/usr/include/iconv.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 25 "/usr/include/iconv.h" 2 3 4
>
>
>extern "C" {
>
>
>typedef void *iconv_t;
>
>
>
>
>
>
>
>extern iconv_t iconv_open (__const char *__tocode, __const char *__fromcode);
>
>
>
>
>extern size_t iconv (iconv_t __cd, char **__restrict __inbuf,
>       size_t *__restrict __inbytesleft,
>       char **__restrict __outbuf,
>       size_t *__restrict __outbytesleft);
>
>
>
>
>
>extern int iconv_close (iconv_t __cd);
>
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/libintl.h" 1 3 4
># 35 "/usr/include/libintl.h" 3 4
>extern "C" {
>
>
>
>
>extern char *gettext (__const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (1)));
>
>
>
>extern char *dgettext (__const char *__domainname, __const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (2)));
>extern char *__dgettext (__const char *__domainname, __const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (2)));
>
>
>
>extern char *dcgettext (__const char *__domainname,
>   __const char *__msgid, int __category)
>     throw () __attribute__ ((__format_arg__ (2)));
>extern char *__dcgettext (__const char *__domainname,
>     __const char *__msgid, int __category)
>     throw () __attribute__ ((__format_arg__ (2)));
>
>
>
>
>extern char *ngettext (__const char *__msgid1, __const char *__msgid2,
>         unsigned long int __n)
>     throw () __attribute__ ((__format_arg__ (1))) __attribute__ ((__format_arg__ (2)));
>
>
>
>extern char *dngettext (__const char *__domainname, __const char *__msgid1,
>   __const char *__msgid2, unsigned long int __n)
>     throw () __attribute__ ((__format_arg__ (2))) __attribute__ ((__format_arg__ (3)));
>
>
>
>extern char *dcngettext (__const char *__domainname, __const char *__msgid1,
>    __const char *__msgid2, unsigned long int __n,
>    int __category)
>     throw () __attribute__ ((__format_arg__ (2))) __attribute__ ((__format_arg__ (3)));
>
>
>
>
>
>extern char *textdomain (__const char *__domainname) throw ();
>
>
>
>extern char *bindtextdomain (__const char *__domainname,
>        __const char *__dirname) throw ();
>
>
>
>extern char *bind_textdomain_codeset (__const char *__domainname,
>          __const char *__codeset) throw ();
># 122 "/usr/include/libintl.h" 3 4
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>  extern "C" __typeof(uselocale) __uselocale;
>}
>
>
>namespace std
>{
>  typedef __locale_t __c_locale;
>
>
>
>
>
>  template<typename _Tv>
>    int
>    __convert_from_v(char* __out,
>       const int __size __attribute__ ((__unused__)),
>       const char* __fmt,
>
>       _Tv __v, const __c_locale& __cloc, int __prec)
>    {
>      __c_locale __old = __gnu_cxx::__uselocale(__cloc);
># 86 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 3
>      const int __ret = std::snprintf(__out, __size, __fmt, __prec, __v);
>
>
>
>
>
>      __gnu_cxx::__uselocale(__old);
>
>
>
>
>      return __ret;
>    }
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++io.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++io.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 1 3
># 33 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 3
>#pragma GCC visibility push(default)
># 114 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-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
># 29 "/usr/include/sched.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 30 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/time.h" 1 3 4
># 33 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/bits/sched.h" 1 3 4
># 66 "/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 ();
>
>
>}
>
>
>
>
>
>
>
>struct __sched_param
>  {
>    int __sched_priority;
>  };
># 108 "/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;
># 180 "/usr/include/bits/sched.h" 3 4
>extern "C" {
>
>extern int __sched_cpucount (size_t __setsize, const cpu_set_t *__setp)
>  throw ();
>extern cpu_set_t *__sched_cpualloc (size_t __count) throw () ;
>extern void __sched_cpufree (cpu_set_t *__set) throw ();
>
>}
># 36 "/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 ();
># 110 "/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
># 31 "/usr/include/time.h" 3 4
>extern "C" {
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 40 "/usr/include/time.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/time.h" 1 3 4
># 44 "/usr/include/time.h" 2 3 4
># 132 "/usr/include/time.h" 3 4
>
>
>struct tm
>{
>  int tm_sec;
>  int tm_min;
>  int tm_hour;
>  int tm_mday;
>  int tm_mon;
>  int tm_year;
>  int tm_wday;
>  int tm_yday;
>  int tm_isdst;
>
>
>  long int tm_gmtoff;
>  __const char *tm_zone;
>
>
>
>
>};
>
>
>
>
>
>
>
>
>struct itimerspec
>  {
>    struct timespec it_interval;
>    struct timespec it_value;
>  };
>
>
>struct sigevent;
># 181 "/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 ();
># 312 "/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__));
># 327 "/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 ();
># 389 "/usr/include/time.h" 3 4
>extern int getdate_err;
># 398 "/usr/include/time.h" 3 4
>extern struct tm *getdate (__const char *__string);
># 412 "/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/signal.h" 1 3 4
># 31 "/usr/include/signal.h" 3 4
>extern "C" {
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 34 "/usr/include/signal.h" 2 3 4
># 402 "/usr/include/signal.h" 3 4
>}
># 30 "/usr/include/pthread.h" 2 3 4
>
># 1 "/usr/include/bits/setjmp.h" 1 3 4
># 29 "/usr/include/bits/setjmp.h" 3 4
>typedef int __jmp_buf[6];
># 32 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 33 "/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_NP,
>  PTHREAD_MUTEX_ROBUST_NP
>};
>
>
>
>
>
>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_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)));
># 466 "/usr/include/pthread.h" 3 4
>extern int pthread_once (pthread_once_t *__once_control,
>    void (*__init_routine) (void)) __attribute__ ((__nonnull__ (1, 2)));
># 478 "/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__));
># 512 "/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); }
>};
># 712 "/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_np (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>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_np (__const pthread_mutexattr_t *__attr,
>        int *__robustness)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_mutexattr_setrobust_np (pthread_mutexattr_t *__attr,
>        int __robustness)
>     throw () __attribute__ ((__nonnull__ (1)));
># 846 "/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)));
># 958 "/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)));
># 1002 "/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)));
># 1069 "/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)));
># 1103 "/usr/include/pthread.h" 3 4
>extern int pthread_atfork (void (*__prepare) (void),
>      void (*__parent) (void),
>      void (*__child) (void)) throw ();
># 1117 "/usr/include/pthread.h" 3 4
>}
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 2 3
># 1 "/usr/include/unistd.h" 1 3 4
># 28 "/usr/include/unistd.h" 3 4
>extern "C" {
># 173 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/bits/posix_opt.h" 1 3 4
># 174 "/usr/include/unistd.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/environments.h" 1 3 4
># 178 "/usr/include/unistd.h" 2 3 4
># 197 "/usr/include/unistd.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 198 "/usr/include/unistd.h" 2 3 4
># 238 "/usr/include/unistd.h" 3 4
>typedef __intptr_t intptr_t;
>
>
>
>
>
>
>typedef __socklen_t socklen_t;
># 258 "/usr/include/unistd.h" 3 4
>extern int access (__const char *__name, int __type) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int euidaccess (__const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int eaccess (__const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int faccessat (int __fd, __const char *__file, int __type, int __flag)
>     throw () __attribute__ ((__nonnull__ (2))) ;
># 301 "/usr/include/unistd.h" 3 4
>extern __off_t lseek (int __fd, __off_t __offset, int __whence) throw ();
># 312 "/usr/include/unistd.h" 3 4
>extern __off64_t lseek64 (int __fd, __off64_t __offset, int __whence)
>     throw ();
>
>
>
>
>
>
>extern int close (int __fd);
>
>
>
>
>
>
>extern ssize_t read (int __fd, void *__buf, size_t __nbytes) ;
>
>
>
>
>
>extern ssize_t write (int __fd, __const void *__buf, size_t __n) ;
># 343 "/usr/include/unistd.h" 3 4
>extern ssize_t pread (int __fd, void *__buf, size_t __nbytes,
>        __off_t __offset) ;
>
>
>
>
>
>
>extern ssize_t pwrite (int __fd, __const void *__buf, size_t __n,
>         __off_t __offset) ;
># 371 "/usr/include/unistd.h" 3 4
>extern ssize_t pread64 (int __fd, void *__buf, size_t __nbytes,
>   __off64_t __offset) ;
>
>
>extern ssize_t pwrite64 (int __fd, __const void *__buf, size_t __n,
>    __off64_t __offset) ;
>
>
>
>
>
>
>
>extern int pipe (int __pipedes[2]) throw () ;
># 393 "/usr/include/unistd.h" 3 4
>extern unsigned int alarm (unsigned int __seconds) throw ();
># 405 "/usr/include/unistd.h" 3 4
>extern unsigned int sleep (unsigned int __seconds);
>
>
>
>
>
>
>extern __useconds_t ualarm (__useconds_t __value, __useconds_t __interval)
>     throw ();
>
>
>
>
>
>
>extern int usleep (__useconds_t __useconds);
># 429 "/usr/include/unistd.h" 3 4
>extern int pause (void);
>
>
>
>extern int chown (__const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchown (int __fd, __uid_t __owner, __gid_t __group) throw () ;
>
>
>
>
>extern int lchown (__const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>extern int fchownat (int __fd, __const char *__file, __uid_t __owner,
>       __gid_t __group, int __flag)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int chdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchdir (int __fd) throw () ;
># 471 "/usr/include/unistd.h" 3 4
>extern char *getcwd (char *__buf, size_t __size) throw () ;
>
>
>
>
>
>extern char *get_current_dir_name (void) throw ();
>
>
>
>
>
>
>extern char *getwd (char *__buf)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__)) ;
>
>
>
>
>extern int dup (int __fd) throw () ;
>
>
>extern int dup2 (int __fd, int __fd2) throw ();
>
>
>extern char **__environ;
>
>extern char **environ;
>
>
>
>
>
>extern int execve (__const char *__path, char *__const __argv[],
>     char *__const __envp[]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int fexecve (int __fd, char *__const __argv[], char *__const __envp[])
>     throw ();
>
>
>
>
>extern int execv (__const char *__path, char *__const __argv[])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execle (__const char *__path, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execl (__const char *__path, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execvp (__const char *__file, char *__const __argv[])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int execlp (__const char *__file, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int nice (int __inc) throw () ;
>
>
>
>
>extern void _exit (int __status) __attribute__ ((__noreturn__));
>
>
>
>
>
># 1 "/usr/include/bits/confname.h" 1 3 4
># 26 "/usr/include/bits/confname.h" 3 4
>enum
>  {
>    _PC_LINK_MAX,
>
>    _PC_MAX_CANON,
>
>    _PC_MAX_INPUT,
>
>    _PC_NAME_MAX,
>
>    _PC_PATH_MAX,
>
>    _PC_PIPE_BUF,
>
>    _PC_CHOWN_RESTRICTED,
>
>    _PC_NO_TRUNC,
>
>    _PC_VDISABLE,
>
>    _PC_SYNC_IO,
>
>    _PC_ASYNC_IO,
>
>    _PC_PRIO_IO,
>
>    _PC_SOCK_MAXBUF,
>
>    _PC_FILESIZEBITS,
>
>    _PC_REC_INCR_XFER_SIZE,
>
>    _PC_REC_MAX_XFER_SIZE,
>
>    _PC_REC_MIN_XFER_SIZE,
>
>    _PC_REC_XFER_ALIGN,
>
>    _PC_ALLOC_SIZE_MIN,
>
>    _PC_SYMLINK_MAX,
>
>    _PC_2_SYMLINKS
>
>  };
>
>
>enum
>  {
>    _SC_ARG_MAX,
>
>    _SC_CHILD_MAX,
>
>    _SC_CLK_TCK,
>
>    _SC_NGROUPS_MAX,
>
>    _SC_OPEN_MAX,
>
>    _SC_STREAM_MAX,
>
>    _SC_TZNAME_MAX,
>
>    _SC_JOB_CONTROL,
>
>    _SC_SAVED_IDS,
>
>    _SC_REALTIME_SIGNALS,
>
>    _SC_PRIORITY_SCHEDULING,
>
>    _SC_TIMERS,
>
>    _SC_ASYNCHRONOUS_IO,
>
>    _SC_PRIORITIZED_IO,
>
>    _SC_SYNCHRONIZED_IO,
>
>    _SC_FSYNC,
>
>    _SC_MAPPED_FILES,
>
>    _SC_MEMLOCK,
>
>    _SC_MEMLOCK_RANGE,
>
>    _SC_MEMORY_PROTECTION,
>
>    _SC_MESSAGE_PASSING,
>
>    _SC_SEMAPHORES,
>
>    _SC_SHARED_MEMORY_OBJECTS,
>
>    _SC_AIO_LISTIO_MAX,
>
>    _SC_AIO_MAX,
>
>    _SC_AIO_PRIO_DELTA_MAX,
>
>    _SC_DELAYTIMER_MAX,
>
>    _SC_MQ_OPEN_MAX,
>
>    _SC_MQ_PRIO_MAX,
>
>    _SC_VERSION,
>
>    _SC_PAGESIZE,
>
>
>    _SC_RTSIG_MAX,
>
>    _SC_SEM_NSEMS_MAX,
>
>    _SC_SEM_VALUE_MAX,
>
>    _SC_SIGQUEUE_MAX,
>
>    _SC_TIMER_MAX,
>
>
>
>
>    _SC_BC_BASE_MAX,
>
>    _SC_BC_DIM_MAX,
>
>    _SC_BC_SCALE_MAX,
>
>    _SC_BC_STRING_MAX,
>
>    _SC_COLL_WEIGHTS_MAX,
>
>    _SC_EQUIV_CLASS_MAX,
>
>    _SC_EXPR_NEST_MAX,
>
>    _SC_LINE_MAX,
>
>    _SC_RE_DUP_MAX,
>
>    _SC_CHARCLASS_NAME_MAX,
>
>
>    _SC_2_VERSION,
>
>    _SC_2_C_BIND,
>
>    _SC_2_C_DEV,
>
>    _SC_2_FORT_DEV,
>
>    _SC_2_FORT_RUN,
>
>    _SC_2_SW_DEV,
>
>    _SC_2_LOCALEDEF,
>
>
>    _SC_PII,
>
>    _SC_PII_XTI,
>
>    _SC_PII_SOCKET,
>
>    _SC_PII_INTERNET,
>
>    _SC_PII_OSI,
>
>    _SC_POLL,
>
>    _SC_SELECT,
>
>    _SC_UIO_MAXIOV,
>
>    _SC_IOV_MAX = _SC_UIO_MAXIOV,
>
>    _SC_PII_INTERNET_STREAM,
>
>    _SC_PII_INTERNET_DGRAM,
>
>    _SC_PII_OSI_COTS,
>
>    _SC_PII_OSI_CLTS,
>
>    _SC_PII_OSI_M,
>
>    _SC_T_IOV_MAX,
>
>
>
>    _SC_THREADS,
>
>    _SC_THREAD_SAFE_FUNCTIONS,
>
>    _SC_GETGR_R_SIZE_MAX,
>
>    _SC_GETPW_R_SIZE_MAX,
>
>    _SC_LOGIN_NAME_MAX,
>
>    _SC_TTY_NAME_MAX,
>
>    _SC_THREAD_DESTRUCTOR_ITERATIONS,
>
>    _SC_THREAD_KEYS_MAX,
>
>    _SC_THREAD_STACK_MIN,
>
>    _SC_THREAD_THREADS_MAX,
>
>    _SC_THREAD_ATTR_STACKADDR,
>
>    _SC_THREAD_ATTR_STACKSIZE,
>
>    _SC_THREAD_PRIORITY_SCHEDULING,
>
>    _SC_THREAD_PRIO_INHERIT,
>
>    _SC_THREAD_PRIO_PROTECT,
>
>    _SC_THREAD_PROCESS_SHARED,
>
>
>    _SC_NPROCESSORS_CONF,
>
>    _SC_NPROCESSORS_ONLN,
>
>    _SC_PHYS_PAGES,
>
>    _SC_AVPHYS_PAGES,
>
>    _SC_ATEXIT_MAX,
>
>    _SC_PASS_MAX,
>
>
>    _SC_XOPEN_VERSION,
>
>    _SC_XOPEN_XCU_VERSION,
>
>    _SC_XOPEN_UNIX,
>
>    _SC_XOPEN_CRYPT,
>
>    _SC_XOPEN_ENH_I18N,
>
>    _SC_XOPEN_SHM,
>
>
>    _SC_2_CHAR_TERM,
>
>    _SC_2_C_VERSION,
>
>    _SC_2_UPE,
>
>
>    _SC_XOPEN_XPG2,
>
>    _SC_XOPEN_XPG3,
>
>    _SC_XOPEN_XPG4,
>
>
>    _SC_CHAR_BIT,
>
>    _SC_CHAR_MAX,
>
>    _SC_CHAR_MIN,
>
>    _SC_INT_MAX,
>
>    _SC_INT_MIN,
>
>    _SC_LONG_BIT,
>
>    _SC_WORD_BIT,
>
>    _SC_MB_LEN_MAX,
>
>    _SC_NZERO,
>
>    _SC_SSIZE_MAX,
>
>    _SC_SCHAR_MAX,
>
>    _SC_SCHAR_MIN,
>
>    _SC_SHRT_MAX,
>
>    _SC_SHRT_MIN,
>
>    _SC_UCHAR_MAX,
>
>    _SC_UINT_MAX,
>
>    _SC_ULONG_MAX,
>
>    _SC_USHRT_MAX,
>
>
>    _SC_NL_ARGMAX,
>
>    _SC_NL_LANGMAX,
>
>    _SC_NL_MSGMAX,
>
>    _SC_NL_NMAX,
>
>    _SC_NL_SETMAX,
>
>    _SC_NL_TEXTMAX,
>
>
>    _SC_XBS5_ILP32_OFF32,
>
>    _SC_XBS5_ILP32_OFFBIG,
>
>    _SC_XBS5_LP64_OFF64,
>
>    _SC_XBS5_LPBIG_OFFBIG,
>
>
>    _SC_XOPEN_LEGACY,
>
>    _SC_XOPEN_REALTIME,
>
>    _SC_XOPEN_REALTIME_THREADS,
>
>
>    _SC_ADVISORY_INFO,
>
>    _SC_BARRIERS,
>
>    _SC_BASE,
>
>    _SC_C_LANG_SUPPORT,
>
>    _SC_C_LANG_SUPPORT_R,
>
>    _SC_CLOCK_SELECTION,
>
>    _SC_CPUTIME,
>
>    _SC_THREAD_CPUTIME,
>
>    _SC_DEVICE_IO,
>
>    _SC_DEVICE_SPECIFIC,
>
>    _SC_DEVICE_SPECIFIC_R,
>
>    _SC_FD_MGMT,
>
>    _SC_FIFO,
>
>    _SC_PIPE,
>
>    _SC_FILE_ATTRIBUTES,
>
>    _SC_FILE_LOCKING,
>
>    _SC_FILE_SYSTEM,
>
>    _SC_MONOTONIC_CLOCK,
>
>    _SC_MULTI_PROCESS,
>
>    _SC_SINGLE_PROCESS,
>
>    _SC_NETWORKING,
>
>    _SC_READER_WRITER_LOCKS,
>
>    _SC_SPIN_LOCKS,
>
>    _SC_REGEXP,
>
>    _SC_REGEX_VERSION,
>
>    _SC_SHELL,
>
>    _SC_SIGNALS,
>
>    _SC_SPAWN,
>
>    _SC_SPORADIC_SERVER,
>
>    _SC_THREAD_SPORADIC_SERVER,
>
>    _SC_SYSTEM_DATABASE,
>
>    _SC_SYSTEM_DATABASE_R,
>
>    _SC_TIMEOUTS,
>
>    _SC_TYPED_MEMORY_OBJECTS,
>
>    _SC_USER_GROUPS,
>
>    _SC_USER_GROUPS_R,
>
>    _SC_2_PBS,
>
>    _SC_2_PBS_ACCOUNTING,
>
>    _SC_2_PBS_LOCATE,
>
>    _SC_2_PBS_MESSAGE,
>
>    _SC_2_PBS_TRACK,
>
>    _SC_SYMLOOP_MAX,
>
>    _SC_STREAMS,
>
>    _SC_2_PBS_CHECKPOINT,
>
>
>    _SC_V6_ILP32_OFF32,
>
>    _SC_V6_ILP32_OFFBIG,
>
>    _SC_V6_LP64_OFF64,
>
>    _SC_V6_LPBIG_OFFBIG,
>
>
>    _SC_HOST_NAME_MAX,
>
>    _SC_TRACE,
>
>    _SC_TRACE_EVENT_FILTER,
>
>    _SC_TRACE_INHERIT,
>
>    _SC_TRACE_LOG,
>
>
>    _SC_LEVEL1_ICACHE_SIZE,
>
>    _SC_LEVEL1_ICACHE_ASSOC,
>
>    _SC_LEVEL1_ICACHE_LINESIZE,
>
>    _SC_LEVEL1_DCACHE_SIZE,
>
>    _SC_LEVEL1_DCACHE_ASSOC,
>
>    _SC_LEVEL1_DCACHE_LINESIZE,
>
>    _SC_LEVEL2_CACHE_SIZE,
>
>    _SC_LEVEL2_CACHE_ASSOC,
>
>    _SC_LEVEL2_CACHE_LINESIZE,
>
>    _SC_LEVEL3_CACHE_SIZE,
>
>    _SC_LEVEL3_CACHE_ASSOC,
>
>    _SC_LEVEL3_CACHE_LINESIZE,
>
>    _SC_LEVEL4_CACHE_SIZE,
>
>    _SC_LEVEL4_CACHE_ASSOC,
>
>    _SC_LEVEL4_CACHE_LINESIZE,
>
>
>
>    _SC_IPV6 = _SC_LEVEL1_ICACHE_SIZE + 50,
>
>    _SC_RAW_SOCKETS
>
>  };
>
>
>enum
>  {
>    _CS_PATH,
>
>
>    _CS_V6_WIDTH_RESTRICTED_ENVS,
>
>
>
>    _CS_GNU_LIBC_VERSION,
>
>    _CS_GNU_LIBPTHREAD_VERSION,
>
>
>    _CS_LFS_CFLAGS = 1000,
>
>    _CS_LFS_LDFLAGS,
>
>    _CS_LFS_LIBS,
>
>    _CS_LFS_LINTFLAGS,
>
>    _CS_LFS64_CFLAGS,
>
>    _CS_LFS64_LDFLAGS,
>
>    _CS_LFS64_LIBS,
>
>    _CS_LFS64_LINTFLAGS,
>
>
>    _CS_XBS5_ILP32_OFF32_CFLAGS = 1100,
>
>    _CS_XBS5_ILP32_OFF32_LDFLAGS,
>
>    _CS_XBS5_ILP32_OFF32_LIBS,
>
>    _CS_XBS5_ILP32_OFF32_LINTFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_CFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_LIBS,
>
>    _CS_XBS5_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_XBS5_LP64_OFF64_CFLAGS,
>
>    _CS_XBS5_LP64_OFF64_LDFLAGS,
>
>    _CS_XBS5_LP64_OFF64_LIBS,
>
>    _CS_XBS5_LP64_OFF64_LINTFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LIBS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LINTFLAGS,
>
>
>    _CS_POSIX_V6_ILP32_OFF32_CFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LDFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LIBS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LINTFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LIBS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_CFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_LDFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_LIBS,
>
>    _CS_POSIX_V6_LP64_OFF64_LINTFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LIBS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LINTFLAGS
>
>  };
># 555 "/usr/include/unistd.h" 2 3 4
>
>
>extern long int pathconf (__const char *__path, int __name)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int fpathconf (int __fd, int __name) throw ();
>
>
>extern long int sysconf (int __name) throw ();
>
>
>
>extern size_t confstr (int __name, char *__buf, size_t __len) throw ();
>
>
>
>
>extern __pid_t getpid (void) throw ();
>
>
>extern __pid_t getppid (void) throw ();
>
>
>
>
>extern __pid_t getpgrp (void) throw ();
># 591 "/usr/include/unistd.h" 3 4
>extern __pid_t __getpgid (__pid_t __pid) throw ();
>
>extern __pid_t getpgid (__pid_t __pid) throw ();
>
>
>
>
>
>
>extern int setpgid (__pid_t __pid, __pid_t __pgid) throw ();
># 617 "/usr/include/unistd.h" 3 4
>extern int setpgrp (void) throw ();
># 634 "/usr/include/unistd.h" 3 4
>extern __pid_t setsid (void) throw ();
>
>
>
>extern __pid_t getsid (__pid_t __pid) throw ();
>
>
>
>extern __uid_t getuid (void) throw ();
>
>
>extern __uid_t geteuid (void) throw ();
>
>
>extern __gid_t getgid (void) throw ();
>
>
>extern __gid_t getegid (void) throw ();
>
>
>
>
>extern int getgroups (int __size, __gid_t __list[]) throw () ;
>
>
>
>extern int group_member (__gid_t __gid) throw ();
>
>
>
>
>
>
>extern int setuid (__uid_t __uid) throw ();
>
>
>
>
>extern int setreuid (__uid_t __ruid, __uid_t __euid) throw ();
>
>
>
>
>extern int seteuid (__uid_t __uid) throw ();
>
>
>
>
>
>
>extern int setgid (__gid_t __gid) throw ();
>
>
>
>
>extern int setregid (__gid_t __rgid, __gid_t __egid) throw ();
>
>
>
>
>extern int setegid (__gid_t __gid) throw ();
>
>
>
>
>
>extern int getresuid (__uid_t *__ruid, __uid_t *__euid, __uid_t *__suid)
>     throw ();
>
>
>
>extern int getresgid (__gid_t *__rgid, __gid_t *__egid, __gid_t *__sgid)
>     throw ();
>
>
>
>extern int setresuid (__uid_t __ruid, __uid_t __euid, __uid_t __suid)
>     throw ();
>
>
>
>extern int setresgid (__gid_t __rgid, __gid_t __egid, __gid_t __sgid)
>     throw ();
>
>
>
>
>
>
>extern __pid_t fork (void) throw ();
>
>
>
>
>
>
>extern __pid_t vfork (void) throw ();
>
>
>
>
>
>extern char *ttyname (int __fd) throw ();
>
>
>
>extern int ttyname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int isatty (int __fd) throw ();
>
>
>
>
>
>extern int ttyslot (void) throw ();
>
>
>
>
>extern int link (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int linkat (int __fromfd, __const char *__from, int __tofd,
>     __const char *__to, int __flags)
>     throw () __attribute__ ((__nonnull__ (2, 4))) ;
>
>
>
>
>extern int symlink (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern ssize_t readlink (__const char *__restrict __path,
>    char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int symlinkat (__const char *__from, int __tofd,
>        __const char *__to) throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>
>extern ssize_t readlinkat (int __fd, __const char *__restrict __path,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (2, 3))) ;
>
>
>
>extern int unlink (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int unlinkat (int __fd, __const char *__name, int __flag)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern int rmdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern __pid_t tcgetpgrp (int __fd) throw ();
>
>
>extern int tcsetpgrp (int __fd, __pid_t __pgrp_id) throw ();
>
>
>
>
>
>
>extern char *getlogin (void);
>
>
>
>
>
>
>
>extern int getlogin_r (char *__name, size_t __name_len) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int setlogin (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
># 837 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/getopt.h" 1 3 4
># 50 "/usr/include/getopt.h" 3 4
>extern "C" {
># 59 "/usr/include/getopt.h" 3 4
>extern char *optarg;
># 73 "/usr/include/getopt.h" 3 4
>extern int optind;
>
>
>
>
>extern int opterr;
>
>
>
>extern int optopt;
># 152 "/usr/include/getopt.h" 3 4
>extern int getopt (int ___argc, char *const *___argv, const char *__shortopts)
>       throw ();
># 171 "/usr/include/getopt.h" 3 4
>}
># 838 "/usr/include/unistd.h" 2 3 4
>
>
>
>
>
>
>
>extern int gethostname (char *__name, size_t __len) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int sethostname (__const char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int sethostid (long int __id) throw () ;
>
>
>
>
>
>extern int getdomainname (char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern int setdomainname (__const char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int vhangup (void) throw ();
>
>
>extern int revoke (__const char *__file) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>extern int profil (unsigned short int *__sample_buffer, size_t __size,
>     size_t __offset, unsigned int __scale)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int acct (__const char *__name) throw ();
>
>
>
>extern char *getusershell (void) throw ();
>extern void endusershell (void) throw ();
>extern void setusershell (void) throw ();
>
>
>
>
>
>extern int daemon (int __nochdir, int __noclose) throw () ;
>
>
>
>
>
>
>extern int chroot (__const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern char *getpass (__const char *__prompt) __attribute__ ((__nonnull__ (1)));
># 923 "/usr/include/unistd.h" 3 4
>extern int fsync (int __fd);
>
>
>
>
>
>
>extern long int gethostid (void);
>
>
>extern void sync (void) throw ();
>
>
>
>
>extern int getpagesize (void) throw () __attribute__ ((__const__));
>
>
>
>
>extern int getdtablesize (void) throw ();
>
>
>
>
>extern int truncate (__const char *__file, __off_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 960 "/usr/include/unistd.h" 3 4
>extern int truncate64 (__const char *__file, __off64_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 970 "/usr/include/unistd.h" 3 4
>extern int ftruncate (int __fd, __off_t __length) throw () ;
># 980 "/usr/include/unistd.h" 3 4
>extern int ftruncate64 (int __fd, __off64_t __length) throw () ;
># 990 "/usr/include/unistd.h" 3 4
>extern int brk (void *__addr) throw () ;
>
>
>
>
>
>extern void *sbrk (intptr_t __delta) throw ();
># 1011 "/usr/include/unistd.h" 3 4
>extern long int syscall (long int __sysno, ...) throw ();
># 1034 "/usr/include/unistd.h" 3 4
>extern int lockf (int __fd, int __cmd, __off_t __len) ;
># 1044 "/usr/include/unistd.h" 3 4
>extern int lockf64 (int __fd, int __cmd, __off64_t __len) ;
># 1065 "/usr/include/unistd.h" 3 4
>extern int fdatasync (int __fildes);
>
>
>
>
>
>
>
>extern char *crypt (__const char *__key, __const char *__salt)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern void encrypt (char *__block, int __edflag) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void swab (__const void *__restrict __from, void *__restrict __to,
>    ssize_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
># 1103 "/usr/include/unistd.h" 3 4
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 2 3
>
>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;
># 92 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
>extern __typeof(pthread_once) __gthrw_pthread_once __attribute__ ((__weakref__("pthread_once")));
>extern __typeof(pthread_getspecific) __gthrw_pthread_getspecific __attribute__ ((__weakref__("pthread_getspecific")));
>extern __typeof(pthread_setspecific) __gthrw_pthread_setspecific __attribute__ ((__weakref__("pthread_setspecific")));
>extern __typeof(pthread_create) __gthrw_pthread_create __attribute__ ((__weakref__("pthread_create")));
>extern __typeof(pthread_cancel) __gthrw_pthread_cancel __attribute__ ((__weakref__("pthread_cancel")));
>extern __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __attribute__ ((__weakref__("pthread_mutex_lock")));
>extern __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __attribute__ ((__weakref__("pthread_mutex_trylock")));
>extern __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __attribute__ ((__weakref__("pthread_mutex_unlock")));
>extern __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __attribute__ ((__weakref__("pthread_mutex_init")));
>
>
>extern __typeof(pthread_key_create) __gthrw_pthread_key_create __attribute__ ((__weakref__("pthread_key_create")));
>extern __typeof(pthread_key_delete) __gthrw_pthread_key_delete __attribute__ ((__weakref__("pthread_key_delete")));
>extern __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __attribute__ ((__weakref__("pthread_mutexattr_init")));
>extern __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __attribute__ ((__weakref__("pthread_mutexattr_settype")));
>extern __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __attribute__ ((__weakref__("pthread_mutexattr_destroy")));
># 149 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-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;
>}
># 516 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
>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);
>}
>
>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_unlock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_unlock (mutex);
>  else
>    return 0;
>}
># 598 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-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_unlock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_unlock (mutex);
>}
># 115 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 2 3
>
>
>
>
>
>
>
>#pragma GCC visibility pop
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++io.h" 2 3
>
>namespace std
>{
>  typedef __gthread_mutex_t __c_lock;
>
>
>  typedef FILE __c_file;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>     __attribute__ ((__const));
>extern __const __int32_t **__ctype_tolower_loc (void)
>     __attribute__ ((__const));
>extern __const __int32_t **__ctype_toupper_loc (void)
>     __attribute__ ((__const));
># 96 "/usr/include/ctype.h" 3 4
>
>
>
>
>
>
>extern int isalnum (int) throw ();
>extern int isalpha (int) throw ();
>extern int iscntrl (int) throw ();
>extern int isdigit (int) throw ();
>extern int islower (int) throw ();
>extern int isgraph (int) throw ();
>extern int isprint (int) throw ();
>extern int ispunct (int) throw ();
>extern int isspace (int) throw ();
>extern int isupper (int) throw ();
>extern int isxdigit (int) throw ();
>
>
>
>extern int tolower (int __c) throw ();
>
>
>extern int toupper (int __c) throw ();
>
>
>
>
>
>
>
>
>extern int isblank (int) throw ();
>
>
>
>
>
>
>extern int isctype (int __c, int __mask) throw ();
>
>
>
>
>
>
>extern int isascii (int __c) throw ();
>
>
>
>extern int toascii (int __c) throw ();
>
>
>
>extern int _toupper (int) throw ();
>extern int _tolower (int) throw ();
># 247 "/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 ();
># 323 "/usr/include/ctype.h" 3 4
>}
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 2 3
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 1 3
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>       
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 3
># 65 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 3
>namespace std
>{
>  using ::clock_t;
>  using ::time_t;
>  using ::tm;
>
>  using ::clock;
>  using ::difftime;
>  using ::mktime;
>  using ::time;
>  using ::asctime;
>  using ::ctime;
>  using ::gmtime;
>  using ::localtime;
>  using ::strftime;
>}
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 2 3
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 40 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 1 3 4
># 41 "/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/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 355 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 3 4
>typedef unsigned int wint_t;
># 53 "/usr/include/wchar.h" 2 3 4
># 99 "/usr/include/wchar.h" 3 4
>
>
>typedef __mbstate_t mbstate_t;
>
>
>
># 124 "/usr/include/wchar.h" 3 4
>extern "C" {
>
>
>
>
>struct tm;
>
>
>
>
>
>
>
>
>
>extern wchar_t *wcscpy (wchar_t *__restrict __dest,
>   __const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncpy (wchar_t *__restrict __dest,
>    __const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern wchar_t *wcscat (wchar_t *__restrict __dest,
>   __const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncat (wchar_t *__restrict __dest,
>    __const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern int wcscmp (__const wchar_t *__s1, __const wchar_t *__s2)
>     throw () __attribute__ ((__pure__));
>
>extern int wcsncmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern int wcscasecmp (__const wchar_t *__s1, __const wchar_t *__s2) throw ();
>
>
>extern int wcsncasecmp (__const wchar_t *__s1, __const wchar_t *__s2,
>   size_t __n) throw ();
>
>
>
>
>
>extern int wcscasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2,
>    __locale_t __loc) throw ();
>
>extern int wcsncasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2,
>     size_t __n, __locale_t __loc) throw ();
>
>
>
>
>
>extern int wcscoll (__const wchar_t *__s1, __const wchar_t *__s2) throw ();
>
>
>
>extern size_t wcsxfrm (wchar_t *__restrict __s1,
>         __const wchar_t *__restrict __s2, size_t __n) throw ();
>
>
>
>
>
>
>
>
>extern int wcscoll_l (__const wchar_t *__s1, __const wchar_t *__s2,
>        __locale_t __loc) throw ();
>
>
>
>
>extern size_t wcsxfrm_l (wchar_t *__s1, __const wchar_t *__s2,
>    size_t __n, __locale_t __loc) throw ();
>
>
>extern wchar_t *wcsdup (__const wchar_t *__s) throw () __attribute__ ((__malloc__));
>
>
>
>
>extern wchar_t *wcschr (__const wchar_t *__wcs, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcsrchr (__const wchar_t *__wcs, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern wchar_t *wcschrnul (__const wchar_t *__s, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern size_t wcscspn (__const wchar_t *__wcs, __const wchar_t *__reject)
>     throw () __attribute__ ((__pure__));
>
>
>extern size_t wcsspn (__const wchar_t *__wcs, __const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcspbrk (__const wchar_t *__wcs, __const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcsstr (__const wchar_t *__haystack, __const wchar_t *__needle)
>     throw () __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 wchar_t *wcswcs (__const wchar_t *__haystack, __const wchar_t *__needle)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern size_t wcsnlen (__const wchar_t *__s, size_t __maxlen)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>extern int wmemcmp (__const wchar_t *__restrict __s1,
>      __const wchar_t *__restrict __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 ();
>
># 352 "/usr/include/wchar.h" 3 4
>
>
>
>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 ();
># 477 "/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 *__dest, __const wchar_t *__src) throw ();
>
>
>
>extern wchar_t *wcpncpy (wchar_t *__dest, __const wchar_t *__src, size_t __n)
>     throw ();
># 527 "/usr/include/wchar.h" 3 4
>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 () ;
># 627 "/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 () ;
># 683 "/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);
>
># 748 "/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);
># 774 "/usr/include/wchar.h" 3 4
>extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream);
>extern wint_t putwchar_unlocked (wchar_t __wc);
># 784 "/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 ();
># 838 "/usr/include/wchar.h" 3 4
>}
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 2 3
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>namespace std
>{
>  using ::mbstate_t;
>}
># 142 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>namespace std
>{
>  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;
>
>  inline wchar_t*
>  wcschr(wchar_t* __p, wchar_t __c)
>  { return wcschr(const_cast<const wchar_t*>(__p), __c); }
>
>  using ::wcspbrk;
>
>  inline wchar_t*
>  wcspbrk(wchar_t* __s1, const wchar_t* __s2)
>  { return wcspbrk(const_cast<const wchar_t*>(__s1), __s2); }
>
>  using ::wcsrchr;
>
>  inline wchar_t*
>  wcsrchr(wchar_t* __p, wchar_t __c)
>  { return wcsrchr(const_cast<const wchar_t*>(__p), __c); }
>
>  using ::wcsstr;
>
>  inline wchar_t*
>  wcsstr(wchar_t* __s1, const wchar_t* __s2)
>  { return wcsstr(const_cast<const wchar_t*>(__s1), __s2); }
>
>  using ::wmemchr;
>
>  inline wchar_t*
>  wmemchr(wchar_t* __p, wchar_t __c, size_t __n)
>  { return wmemchr(const_cast<const wchar_t*>(__p), __c, __n); }
>}
>
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>  using ::wcstold;
># 259 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>  using ::wcstoll;
>  using ::wcstoull;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::wcstold;
>  using __gnu_cxx::wcstoll;
>  using __gnu_cxx::wcstoull;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 2 3
>
>
># 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;
>
>
>
>
>
>__extension__
>typedef unsigned long long int uint64_t;
>
>
>
>
>
>
>typedef signed char int_least8_t;
>typedef short int int_least16_t;
>typedef int int_least32_t;
>
>
>
>__extension__
>typedef long long int int_least64_t;
>
>
>
>typedef unsigned char uint_least8_t;
>typedef unsigned short int uint_least16_t;
>typedef unsigned int uint_least32_t;
>
>
>
>__extension__
>typedef unsigned long long int uint_least64_t;
>
>
>
>
>
>
>typedef signed char int_fast8_t;
>
>
>
>
>
>typedef int int_fast16_t;
>typedef int int_fast32_t;
>__extension__
>typedef long long int int_fast64_t;
>
>
>
>typedef unsigned char uint_fast8_t;
>
>
>
>
>
>typedef unsigned int uint_fast16_t;
>typedef unsigned int uint_fast32_t;
>__extension__
>typedef unsigned long long int uint_fast64_t;
># 129 "/usr/include/stdint.h" 3 4
>typedef unsigned int uintptr_t;
># 138 "/usr/include/stdint.h" 3 4
>__extension__
>typedef long long int intmax_t;
>__extension__
>typedef unsigned long long int uintmax_t;
># 50 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 2 3
>
>
>namespace std
>{
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>  typedef int64_t streamoff;
>
>
>
>
>
>  typedef ptrdiff_t streamsize;
>
>  template<typename _StateT>
>    class fpos;
># 94 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>  template<typename _StateT>
>    class fpos
>    {
>    private:
>      streamoff _M_off;
>      _StateT _M_state;
>
>    public:
>
>
>
>
>      fpos()
>      : _M_off(0), _M_state() { }
># 116 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
>
>
>
>
>
>
>      bool
>      operator==(const fpos& __other) const
>      { return _M_off == __other._M_off; }
>
>
>      bool
>      operator!=(const fpos& __other) const
>      { return _M_off != __other._M_off; }
>
>
>
>
>
>      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; }
>    };
>
>
>
>
>
>  typedef fpos<mbstate_t> streampos;
>
>  typedef fpos<mbstate_t> wstreampos;
>}
># 50 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/functexcept.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/functexcept.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception_defines.h" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/functexcept.h" 2 3
>
>namespace std
>{
>
>  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__));
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
>
>namespace std
>{
>  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;
>
>
>
>  class ios_base;
># 135 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 3
>  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;
>
>
>}
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_pair.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_pair.h" 3
>namespace std
>{
>
>  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) { }
>    };
>
>
>  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); }
># 142 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 3
># 75 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 3
>namespace __gnu_internal
>{
>  typedef char __one;
>  typedef char __two[2];
>
>  template<typename _Tp>
>  __one __test_type(int _Tp::*);
>  template<typename _Tp>
>  __two& __test_type(...);
>}
>
>
>namespace __gnu_cxx
>{
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator;
>}
>
>struct __true_type { };
>struct __false_type { };
>
>namespace std
>{
>  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, bool>
>    struct __enable_if
>    {
>    };
>
>  template<typename _Tp>
>    struct __enable_if<_Tp, true>
>    {
>      typedef _Tp __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;
>    };
>
>
>  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_pod
>    {
>      enum
> {
>   __value = (sizeof(__gnu_internal::__test_type<_Tp>(0))
>       != sizeof(__gnu_internal::__one))
> };
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_empty
>    {
>    private:
>      template<typename>
>        struct __first { };
>      template<typename _Up>
>        struct __second
>        : public _Up { };
>
>    public:
>      enum
> {
>   __value = sizeof(__first<_Tp>) == sizeof(__second<_Tp>)
> };
>    };
>
>}
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 3
>       
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 3
>
>namespace std
>{
># 80 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 {};
># 104 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    };
>
>
>
>
>
>
>
>  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(); }
>
>}
># 73 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
>       
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/concept_check.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/concept_check.h" 3
>       
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/concept_check.h" 3
># 69 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 2 3
>
>namespace std
>{
>  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/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
>  template<typename _InputIterator, typename _Distance>
>    inline void
>    advance(_InputIterator& __i, _Distance __n)
>    {
>
>      std::__advance(__i, __n, std::__iterator_category(__i));
>    }
>}
># 74 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 1 3
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>namespace std
>{
># 91 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>    public:
>      typedef _Iterator iterator_type;
>      typedef typename iterator_traits<_Iterator>::difference_type
>              difference_type;
>      typedef typename iterator_traits<_Iterator>::reference reference;
>      typedef typename iterator_traits<_Iterator>::pointer pointer;
>
>    public:
>
>
>
>
>
>
>      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; }
>
>
>
>
>
>
>      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); }
>    };
># 278 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(); }
># 382 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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) { }
># 408 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>      back_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_back(__value);
> return *this;
>      }
>
>
>      back_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      back_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      back_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 442 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline back_insert_iterator<_Container>
>    back_inserter(_Container& __x)
>    { return back_insert_iterator<_Container>(__x); }
># 457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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) { }
># 482 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>      front_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_front(__value);
> return *this;
>      }
>
>
>      front_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      front_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      front_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 516 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline front_insert_iterator<_Container>
>    front_inserter(_Container& __x)
>    { return front_insert_iterator<_Container>(__x); }
># 535 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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) {}
># 577 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>      insert_iterator&
>      operator=(const typename _Container::const_reference __value)
>      {
> iter = container->insert(iter, __value);
> ++iter;
> return *this;
>      }
>
>
>      insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++(int)
>      { return *this; }
>    };
># 612 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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
>{
>
>
>
>
>
>
>
>  using std::iterator_traits;
>  using std::iterator;
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator
>    {
>    protected:
>      _Iterator _M_current;
>
>    public:
>      typedef typename iterator_traits<_Iterator>::iterator_category
>                                                             iterator_category;
>      typedef typename iterator_traits<_Iterator>::value_type value_type;
>      typedef typename iterator_traits<_Iterator>::difference_type
>                                                             difference_type;
>      typedef typename iterator_traits<_Iterator>::reference reference;
>      typedef typename iterator_traits<_Iterator>::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 std::__enable_if<_Container,
>     (std::__are_same<_Iter,
>      typename _Container::pointer>::__value)
>     >::__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; }
>    };
># 728 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 __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); }
>}
># 75 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/debug/debug.h" 1 3
># 77 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
>
>namespace std
>{
># 90 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline void
>    swap(_Tp& __a, _Tp& __b)
>    {
>
>     
>
>      _Tp __tmp = __a;
>      __a = __b;
>      __b = __tmp;
>    }
>
>
>
>
>  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);
>        }
>    };
># 140 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    inline void
>    iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>    {
>      typedef typename iterator_traits<_ForwardIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_ForwardIterator2>::value_type
> _ValueType2;
>
>
>     
>
>     
>
>     
>
>     
>
>
>      typedef typename iterator_traits<_ForwardIterator1>::reference
> _ReferenceType1;
>      typedef typename iterator_traits<_ForwardIterator2>::reference
> _ReferenceType2;
>      std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value &&
> __are_same<_ValueType1 &, _ReferenceType1>::__value &&
> __are_same<_ValueType2 &, _ReferenceType2>::__value>::
> iter_swap(__a, __b);
>    }
># 182 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 204 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 226 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 246 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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<bool, typename>
>    struct __copy
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy(_II __first, _II __last, _OI __result)
>        {
>   for (; __first != __last; ++__result, ++__first)
>     *__result = *__first;
>   return __result;
> }
>    };
>
>  template<bool _BoolType>
>    struct __copy<_BoolType, random_access_iterator_tag>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy(_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;
> }
>    };
>
>  template<>
>    struct __copy<true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        copy(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   std::memmove(__result, __first, sizeof(_Tp) * (__last - __first));
>   return __result + (__last - __first);
> }
>    };
>
>  template<typename _II, typename _OI>
>    inline _OI
>    __copy_aux(_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_scalar<_ValueTypeI>::__value
>                      && __is_pointer<_II>::__value
>                      && __is_pointer<_OI>::__value
>        && __are_same<_ValueTypeI, _ValueTypeO>::__value);
>
>      return std::__copy<__simple, _Category>::copy(__first, __last, __result);
>    }
>
>  template<bool, bool>
>    struct __copy_normal
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return std::__copy_aux(__first, __last, __result); }
>    };
>
>  template<>
>    struct __copy_normal<true, false>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return std::__copy_aux(__first.base(), __last.base(), __result); }
>    };
>
>  template<>
>    struct __copy_normal<false, true>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return _OI(std::__copy_aux(__first, __last, __result.base())); }
>    };
>
>  template<>
>    struct __copy_normal<true, true>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return _OI(std::__copy_aux(__first.base(), __last.base(),
>         __result.base())); }
>    };
># 373 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    inline _OutputIterator
>    copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result)
>    {
>
>     
>     
>
>      ;
>
>       const bool __in = __is_normal_iterator<_InputIterator>::__value;
>       const bool __out = __is_normal_iterator<_OutputIterator>::__value;
>       return std::__copy_normal<__in, __out>::copy_n(__first, __last,
>            __result);
>    }
>
>  template<bool, typename>
>    struct __copy_backward
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   while (__first != __last)
>     *--__result = *--__last;
>   return __result;
> }
>    };
>
>  template<bool _BoolType>
>    struct __copy_backward<_BoolType, random_access_iterator_tag>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_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;
> }
>    };
>
>  template<>
>    struct __copy_backward<true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        copy_b(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   const ptrdiff_t _Num = __last - __first;
>   std::memmove(__result - _Num, __first, sizeof(_Tp) * _Num);
>   return __result - _Num;
> }
>    };
>
>  template<typename _BI1, typename _BI2>
>    inline _BI2
>    __copy_backward_aux(_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_scalar<_ValueType1>::__value
>                      && __is_pointer<_BI1>::__value
>                      && __is_pointer<_BI2>::__value
>        && __are_same<_ValueType1, _ValueType2>::__value);
>
>      return std::__copy_backward<__simple, _Category>::copy_b(__first, __last,
>              __result);
>    }
>
>  template<bool, bool>
>    struct __copy_backward_normal
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return std::__copy_backward_aux(__first, __last, __result); }
>    };
>
>  template<>
>    struct __copy_backward_normal<true, false>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return std::__copy_backward_aux(__first.base(), __last.base(),
>       __result); }
>    };
>
>  template<>
>    struct __copy_backward_normal<false, true>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return _BI2(std::__copy_backward_aux(__first, __last,
>            __result.base())); }
>    };
>
>  template<>
>    struct __copy_backward_normal<true, true>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return _BI2(std::__copy_backward_aux(__first.base(), __last.base(),
>            __result.base())); }
>    };
># 502 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template <typename _BI1, typename _BI2>
>    inline _BI2
>    copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      const bool __bi1 = __is_normal_iterator<_BI1>::__value;
>      const bool __bi2 = __is_normal_iterator<_BI2>::__value;
>      return std::__copy_backward_normal<__bi1, __bi2>::copy_b_n(__first, __last,
>         __result);
>    }
>
>  template<bool>
>    struct __fill
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        fill(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>        {
>   for (; __first != __last; ++__first)
>     *__first = __value;
> }
>    };
>
>  template<>
>    struct __fill<true>
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        fill(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>        {
>   const _Tp __tmp = __value;
>   for (; __first != __last; ++__first)
>     *__first = __tmp;
> }
>    };
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
>    {
>
>     
>
>      ;
>
>      const bool __scalar = __is_scalar<_Tp>::__value;
>      std::__fill<__scalar>::fill(__first, __last, __value);
>    }
>
>
>  inline void
>  fill(unsigned char* __first, unsigned char* __last, const unsigned char& __c)
>  {
>    ;
>    const unsigned char __tmp = __c;
>    std::memset(__first, __tmp, __last - __first);
>  }
>
>  inline void
>  fill(signed char* __first, signed char* __last, const signed char& __c)
>  {
>    ;
>    const signed char __tmp = __c;
>    std::memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
>  }
>
>  inline void
>  fill(char* __first, char* __last, const char& __c)
>  {
>    ;
>    const char __tmp = __c;
>    std::memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
>  }
>
>  template<bool>
>    struct __fill_n
>    {
>      template<typename _OutputIterator, typename _Size, typename _Tp>
>        static _OutputIterator
>        fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>        {
>   for (; __n > 0; --__n, ++__first)
>     *__first = __value;
>   return __first;
> }
>    };
>
>  template<>
>    struct __fill_n<true>
>    {
>      template<typename _OutputIterator, typename _Size, typename _Tp>
>        static _OutputIterator
>        fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>        {
>   const _Tp __tmp = __value;
>   for (; __n > 0; --__n, ++__first)
>     *__first = __tmp;
>   return __first;
> }
>    };
># 634 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _OutputIterator, typename _Size, typename _Tp>
>    _OutputIterator
>    fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>    {
>
>     
>
>      const bool __scalar = __is_scalar<_Tp>::__value;
>      return std::__fill_n<__scalar>::fill_n(__first, __n, __value);
>    }
>
>  template<typename _Size>
>    inline unsigned char*
>    fill_n(unsigned char* __first, _Size __n, const unsigned char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
>
>  template<typename _Size>
>    inline signed char*
>    fill_n(char* __first, _Size __n, const signed char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
>
>  template<typename _Size>
>    inline char*
>    fill_n(char* __first, _Size __n, const char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
># 681 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>    }
># 716 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 && __binary_pred(*__first1, *__first2))
>        {
>   ++__first1;
>   ++__first2;
>        }
>      return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
>    }
># 746 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    inline bool
>    equal(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!(*__first1 == *__first2))
>   return false;
>      return true;
>    }
># 778 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _BinaryPredicate>
>    inline bool
>    equal(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2,
>   _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!__binary_pred(*__first1, *__first2))
>   return false;
>      return true;
>    }
># 810 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    bool
>    lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>     
>
>
>      ;
>      ;
>
>      for (; __first1 != __last1 && __first2 != __last2;
>    ++__first1, ++__first2)
> {
>   if (*__first1 < *__first2)
>     return true;
>   if (*__first2 < *__first1)
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
># 850 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _Compare>
>    bool
>    lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _Compare __comp)
>    {
>
>     
>     
>      ;
>      ;
>
>      for (; __first1 != __last1 && __first2 != __last2;
>    ++__first1, ++__first2)
> {
>   if (__comp(*__first1, *__first2))
>     return true;
>   if (__comp(*__first2, *__first1))
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
>
>  inline bool
>  lexicographical_compare(const unsigned char* __first1,
>     const unsigned char* __last1,
>     const unsigned char* __first2,
>     const unsigned char* __last2)
>  {
>    ;
>    ;
>
>    const size_t __len1 = __last1 - __first1;
>    const size_t __len2 = __last2 - __first2;
>    const int __result = std::memcmp(__first1, __first2,
>         std::min(__len1, __len2));
>    return __result != 0 ? __result < 0 : __len1 < __len2;
>  }
>
>  inline bool
>  lexicographical_compare(const char* __first1, const char* __last1,
>     const char* __first2, const char* __last2)
>  {
>    ;
>    ;
>
>
>    return std::lexicographical_compare((const signed char*) __first1,
>     (const signed char*) __last1,
>     (const signed char*) __first2,
>     (const signed char*) __last2);
>
>
>
>
>
>
>  }
>
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 2 3
>
>
>namespace __gnu_cxx
>{
># 61 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>  template <class _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;
>    };
># 86 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 (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*>(std::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
>{
># 224 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 memcmp(__s1, __s2, __n); }
>
>      static size_t
>      length(const char_type* __s)
>      { return strlen(__s); }
>
>      static const char_type*
>      find(const char_type* __s, size_t __n, const char_type& __a)
>      { return static_cast<const char_type*>(memchr(__s, __a, __n)); }
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, size_t __n)
>      { return static_cast<char_type*>(memmove(__s1, __s2, __n)); }
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, size_t __n)
>      { return static_cast<char_type*>(memcpy(__s1, __s2, __n)); }
>
>      static char_type*
>      assign(char_type* __s, size_t __n, char_type __a)
>      { return static_cast<char_type*>(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; }
>  };
>
>
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 1 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>       
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/allocator.h" 1 3
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++allocator.h" 1 3
># 34 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ext/new_allocator.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ext/new_allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 1 3
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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();
>  };
>
>
>  typedef void (*terminate_handler) ();
>
>  typedef void (*unexpected_handler) ();
>
>
>  terminate_handler set_terminate(terminate_handler) throw();
>
>
>  void terminate() __attribute__ ((__noreturn__));
>
>
>  unexpected_handler set_unexpected(unexpected_handler) throw();
>
>
>  void unexpected() __attribute__ ((__noreturn__));
># 102 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>  bool uncaught_exception() throw();
>}
>
>namespace __gnu_cxx
>{
># 117 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>  void __verbose_terminate_handler ();
>}
>
>}
>
>#pragma GCC visibility pop
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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();
>  };
>
>  struct nothrow_t { };
>  extern const nothrow_t nothrow;
>
>
>  typedef void (*new_handler)();
>
>  new_handler set_new_handler(new_handler) throw();
>}
># 84 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 3
>void* operator new(std::size_t) throw (std::bad_alloc);
>void* operator new[](std::size_t) throw (std::bad_alloc);
>void operator delete(void*) throw();
>void operator delete[](void*) throw();
>void* operator new(std::size_t, const std::nothrow_t&) throw();
>void* operator new[](std::size_t, const std::nothrow_t&) throw();
>void operator delete(void*, const std::nothrow_t&) throw();
>void operator delete[](void*, const std::nothrow_t&) throw();
>
>
>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
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ext/new_allocator.h" 2 3
>
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>
>
>  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 &__x; }
>
>      const_pointer
>      address(const_reference __x) const { return &__x; }
>
>
>
>      pointer
>      allocate(size_type __n, const void* = 0)
>      {
> if (__builtin_expect(__n > this->max_size(), false))
>   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); }
>
>
>
>      void
>      construct(pointer __p, const _Tp& __val)
>      { ::new(__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/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++allocator.h" 2 3
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/allocator.h" 2 3
>
>namespace std
>{
>  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 _T1, typename _T2>
>    inline bool
>    operator!=(const allocator<_T1>&, const allocator<_T2>&)
>    { return false; }
>
>
>
>
>
>  extern template class allocator<char>;
>  extern template class allocator<wchar_t>;
>
>
>
>
>}
># 55 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>namespace std
>{
>
>
>
>
>
>
>  template<typename _T1, typename _T2>
>    inline void
>    _Construct(_T1* __p, const _T2& __value)
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1(__value);
>    }
>
>
>
>
>
>
>
>  template<typename _T1>
>    inline void
>    _Construct(_T1* __p)
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1();
>    }
>
>
>
>
>
>
>  template<typename _Tp>
>    inline void
>    _Destroy(_Tp* __pointer)
>    { __pointer->~_Tp(); }
># 116 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator __first, _ForwardIterator __last,
>    __false_type)
>    {
>      for (; __first != __last; ++__first)
> std::_Destroy(&*__first);
>    }
># 134 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type)
>    { }
># 146 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
>                       _Value_type;
>      typedef typename std::__is_scalar<_Value_type>::__type
>                _Has_trivial_destructor;
>
>      std::__destroy_aux(__first, __last, _Has_trivial_destructor());
>    }
># 166 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template <typename _Tp> class allocator;
>
>  template<typename _ForwardIterator, typename _Allocator>
>    void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      _Allocator __alloc)
>    {
>      for (; __first != __last; ++__first)
> __alloc.destroy(&*__first);
>    }
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      allocator<_Tp>)
>    {
>      _Destroy(__first, __last);
>    }
>
>
>}
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>namespace std
>{
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result,
>        __true_type)
>    { return std::copy(__first, __last, __result); }
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result,
>        __false_type)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   for (; __first != __last; ++__first, ++__cur)
>     std::_Construct(&*__cur, *__first);
>   return __cur;
> }
>      catch(...)
> {
>   std::_Destroy(__result, __cur);
>   throw;
> }
>    }
># 105 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    uninitialized_copy(_InputIterator __first, _InputIterator __last,
>         _ForwardIterator __result)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      return std::__uninitialized_copy_aux(__first, __last, __result,
>        _Is_POD());
>    }
>
>  inline char*
>  uninitialized_copy(const char* __first, const char* __last, char* __result)
>  {
>    std::memmove(__result, __first, __last - __first);
>    return __result + (__last - __first);
>  }
>
>  inline wchar_t*
>  uninitialized_copy(const wchar_t* __first, const wchar_t* __last,
>       wchar_t* __result)
>  {
>    std::memmove(__result, __first, sizeof(wchar_t) * (__last - __first));
>    return __result + (__last - __first);
>  }
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    __uninitialized_fill_aux(_ForwardIterator __first,
>        _ForwardIterator __last,
>        const _Tp& __x, __true_type)
>    { std::fill(__first, __last, __x); }
>
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last,
>        const _Tp& __x, __false_type)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __cur != __last; ++__cur)
>     std::_Construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur);
>   throw;
> }
>    }
># 167 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      std::__uninitialized_fill_aux(__first, __last, __x, _Is_POD());
>    }
>
>
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,
>          const _Tp& __x, __true_type)
>    { std::fill_n(__first, __n, __x); }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    void
>    __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,
>          const _Tp& __x, __false_type)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __n > 0; --__n, ++__cur)
>     std::_Construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur);
>   throw;
> }
>    }
># 212 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      std::__uninitialized_fill_n_aux(__first, __n, __x, _Is_POD());
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result,
>      _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   for (; __first != __last; ++__first, ++__cur)
>     __alloc.construct(&*__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 _ForwardIterator, typename _Tp, typename _Allocator>
>    void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __cur != __last; ++__cur)
>     __alloc.construct(&*__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
> {
>   for (; __n > 0; --__n, ++__cur)
>     __alloc.construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Tp2>
>    void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x,
>        allocator<_Tp2>)
>    {
>      std::uninitialized_fill_n(__first, __n, __x);
>    }
># 323 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_copy_copy(_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_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_copy(_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_copy_a(__first, __last, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp,
>    typename _Allocator>
>    inline void
>    __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1,
>         _ForwardIterator __first2,
>         _ForwardIterator __last2, const _Tp& __x,
>         _Allocator __alloc)
>    {
>      _ForwardIterator __mid2 = std::__uninitialized_copy_a(__first1, __last1,
>           __first2,
>           __alloc);
>      try
> {
>   std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__first2, __mid2, __alloc);
>   throw;
> }
>    }
>
>}
># 58 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_raw_storage_iter.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_raw_storage_iter.h" 3
>namespace std
>{
>
>
>
>
>  template <class _ForwardIterator, class _Tp>
>    class raw_storage_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _ForwardIterator _M_iter;
>
>    public:
>      explicit
>      raw_storage_iterator(_ForwardIterator __x)
>      : _M_iter(__x) {}
>
>      raw_storage_iterator&
>      operator*() { return *this; }
>
>      raw_storage_iterator&
>      operator=(const _Tp& __element)
>      {
> std::_Construct(&*_M_iter, __element);
> return *this;
>      }
>
>      raw_storage_iterator<_ForwardIterator, _Tp>&
>      operator++()
>      {
> ++_M_iter;
> return *this;
>      }
>
>      raw_storage_iterator<_ForwardIterator, _Tp>
>      operator++(int)
>      {
> raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this;
> ++_M_iter;
> return __tmp;
>      }
>    };
>}
># 59 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 1 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>       
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
># 149 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>namespace std
>{
>
>
>
>
>
>  enum float_round_style
>  {
>    round_indeterminate = -1,
>    round_toward_zero = 0,
>    round_to_nearest = 1,
>    round_toward_infinity = 2,
>    round_toward_neg_infinity = 3
>  };
>
>
>
>
>
>
>
>  enum float_denorm_style
>  {
>
>    denorm_indeterminate = -1,
>
>    denorm_absent = 0,
>
>    denorm_present = 1
>  };
># 191 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>  struct __numeric_limits_base
>  {
>
>
>    static const bool is_specialized = false;
>
>
>
>
>    static const int digits = 0;
>
>    static const int digits10 = 0;
>
>    static const bool is_signed = false;
>
>
>
>
>
>    static const bool is_integer = false;
>
>
>
>
>    static const bool is_exact = false;
>
>
>    static const int radix = 0;
>
>
>
>    static const int min_exponent = 0;
>
>
>    static const int min_exponent10 = 0;
>
>
>
>    static const int max_exponent = 0;
>
>
>    static const int max_exponent10 = 0;
>
>
>    static const bool has_infinity = false;
>
>
>    static const bool has_quiet_NaN = false;
>
>
>    static const bool has_signaling_NaN = false;
>
>    static const float_denorm_style has_denorm = denorm_absent;
>
>
>    static const bool has_denorm_loss = false;
>
>
>
>    static const bool is_iec559 = false;
>
>
>
>    static const bool is_bounded = false;
>
>
>
>
>    static const bool is_modulo = false;
>
>
>    static const bool traps = false;
>
>    static const bool tinyness_before = false;
>
>
>
>    static const float_round_style round_style = round_toward_zero;
>  };
># 284 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>  template<typename _Tp>
>    struct numeric_limits : public __numeric_limits_base
>    {
>
>
>      static _Tp min() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp max() throw() { return static_cast<_Tp>(0); }
>
>
>      static _Tp epsilon() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp round_error() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp infinity() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); }
>
>
>      static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); }
>
>
>
>      static _Tp denorm_min() throw() { return static_cast<_Tp>(0); }
>    };
>
>
>
>
>
>  template<>
>    struct numeric_limits<bool>
>    {
>      static const bool is_specialized = true;
>
>      static bool min() throw()
>      { return false; }
>      static bool max() throw()
>      { return true; }
>
>      static const int digits = 1;
>      static const int digits10 = 0;
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static bool epsilon() throw()
>      { return false; }
>      static bool round_error() throw()
>      { return false; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static bool infinity() throw()
>      { return false; }
>      static bool quiet_NaN() throw()
>      { return false; }
>      static bool signaling_NaN() throw()
>      { return false; }
>      static bool denorm_min() throw()
>      { return false; }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>
>
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<char>
>    {
>      static const bool is_specialized = true;
>
>      static char min() throw()
>      { return (((char)(-1) < 0) ? (char)1 << (sizeof(char) * 8 - ((char)(-1) < 0)) : (char)0); }
>      static char max() throw()
>      { return (((char)(-1) < 0) ? ((char)1 << (sizeof(char) * 8 - ((char)(-1) < 0))) - 1 : ~(char)0); }
>
>      static const int digits = (sizeof(char) * 8 - ((char)(-1) < 0));
>      static const int digits10 = ((sizeof(char) * 8 - ((char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = ((char)(-1) < 0);
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static char epsilon() throw()
>      { return 0; }
>      static char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static char infinity() throw()
>      { return char(); }
>      static char quiet_NaN() throw()
>      { return char(); }
>      static char signaling_NaN() throw()
>      { return char(); }
>      static char denorm_min() throw()
>      { return static_cast<char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<signed char>
>    {
>      static const bool is_specialized = true;
>
>      static signed char min() throw()
>      { return -127 - 1; }
>      static signed char max() throw()
>      { return 127; }
>
>      static const int digits = (sizeof(signed char) * 8 - ((signed char)(-1) < 0));
>      static const int digits10 = ((sizeof(signed char) * 8 - ((signed char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static signed char epsilon() throw()
>      { return 0; }
>      static signed char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static signed char infinity() throw()
>      { return static_cast<signed char>(0); }
>      static signed char quiet_NaN() throw()
>      { return static_cast<signed char>(0); }
>      static signed char signaling_NaN() throw()
>      { return static_cast<signed char>(0); }
>      static signed char denorm_min() throw()
>      { return static_cast<signed char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned char>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned char min() throw()
>      { return 0; }
>      static unsigned char max() throw()
>      { return 127 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned char epsilon() throw()
>      { return 0; }
>      static unsigned char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned char infinity() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char quiet_NaN() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char signaling_NaN() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char denorm_min() throw()
>      { return static_cast<unsigned char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<wchar_t>
>    {
>      static const bool is_specialized = true;
>
>      static wchar_t min() throw()
>      { return (((wchar_t)(-1) < 0) ? (wchar_t)1 << (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) : (wchar_t)0); }
>      static wchar_t max() throw()
>      { return (((wchar_t)(-1) < 0) ? ((wchar_t)1 << (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0))) - 1 : ~(wchar_t)0); }
>
>      static const int digits = (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0));
>      static const int digits10 = ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = ((wchar_t)(-1) < 0);
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static wchar_t epsilon() throw()
>      { return 0; }
>      static wchar_t round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static wchar_t infinity() throw()
>      { return wchar_t(); }
>      static wchar_t quiet_NaN() throw()
>      { return wchar_t(); }
>      static wchar_t signaling_NaN() throw()
>      { return wchar_t(); }
>      static wchar_t denorm_min() throw()
>      { return wchar_t(); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<short>
>    {
>      static const bool is_specialized = true;
>
>      static short min() throw()
>      { return -32767 - 1; }
>      static short max() throw()
>      { return 32767; }
>
>      static const int digits = (sizeof(short) * 8 - ((short)(-1) < 0));
>      static const int digits10 = ((sizeof(short) * 8 - ((short)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static short epsilon() throw()
>      { return 0; }
>      static short round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static short infinity() throw()
>      { return short(); }
>      static short quiet_NaN() throw()
>      { return short(); }
>      static short signaling_NaN() throw()
>      { return short(); }
>      static short denorm_min() throw()
>      { return short(); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned short>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned short min() throw()
>      { return 0; }
>      static unsigned short max() throw()
>      { return 32767 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned short epsilon() throw()
>      { return 0; }
>      static unsigned short round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned short infinity() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short quiet_NaN() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short signaling_NaN() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short denorm_min() throw()
>      { return static_cast<unsigned short>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<int>
>    {
>      static const bool is_specialized = true;
>
>      static int min() throw()
>      { return -2147483647 - 1; }
>      static int max() throw()
>      { return 2147483647; }
>
>      static const int digits = (sizeof(int) * 8 - ((int)(-1) < 0));
>      static const int digits10 = ((sizeof(int) * 8 - ((int)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static int epsilon() throw()
>      { return 0; }
>      static int round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static int infinity() throw()
>      { return static_cast<int>(0); }
>      static int quiet_NaN() throw()
>      { return static_cast<int>(0); }
>      static int signaling_NaN() throw()
>      { return static_cast<int>(0); }
>      static int denorm_min() throw()
>      { return static_cast<int>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned int>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned int min() throw()
>      { return 0; }
>      static unsigned int max() throw()
>      { return 2147483647 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned int epsilon() throw()
>      { return 0; }
>      static unsigned int round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned int infinity() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int quiet_NaN() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int signaling_NaN() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int denorm_min() throw()
>      { return static_cast<unsigned int>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<long>
>    {
>      static const bool is_specialized = true;
>
>      static long min() throw()
>      { return -2147483647L - 1; }
>      static long max() throw()
>      { return 2147483647L; }
>
>      static const int digits = (sizeof(long) * 8 - ((long)(-1) < 0));
>      static const int digits10 = ((sizeof(long) * 8 - ((long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static long epsilon() throw()
>      { return 0; }
>      static long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static long infinity() throw()
>      { return static_cast<long>(0); }
>      static long quiet_NaN() throw()
>      { return static_cast<long>(0); }
>      static long signaling_NaN() throw()
>      { return static_cast<long>(0); }
>      static long denorm_min() throw()
>      { return static_cast<long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned long>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned long min() throw()
>      { return 0; }
>      static unsigned long max() throw()
>      { return 2147483647L * 2UL + 1; }
>
>      static const int digits = (sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned long epsilon() throw()
>      { return 0; }
>      static unsigned long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned long infinity() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long quiet_NaN() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long signaling_NaN() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long denorm_min() throw()
>      { return static_cast<unsigned long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<long long>
>    {
>      static const bool is_specialized = true;
>
>      static long long min() throw()
>      { return -9223372036854775807LL - 1; }
>      static long long max() throw()
>      { return 9223372036854775807LL; }
>
>      static const int digits = (sizeof(long long) * 8 - ((long long)(-1) < 0));
>      static const int digits10 = ((sizeof(long long) * 8 - ((long long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static long long epsilon() throw()
>      { return 0; }
>      static long long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static long long infinity() throw()
>      { return static_cast<long long>(0); }
>      static long long quiet_NaN() throw()
>      { return static_cast<long long>(0); }
>      static long long signaling_NaN() throw()
>      { return static_cast<long long>(0); }
>      static long long denorm_min() throw()
>      { return static_cast<long long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned long long>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned long long min() throw()
>      { return 0; }
>      static unsigned long long max() throw()
>      { return 9223372036854775807LL * 2ULL + 1; }
>
>      static const int digits = (sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned long long epsilon() throw()
>      { return 0; }
>      static unsigned long long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned long long infinity() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long quiet_NaN() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long signaling_NaN() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long denorm_min() throw()
>      { return static_cast<unsigned long long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<float>
>    {
>      static const bool is_specialized = true;
>
>      static float min() throw()
>      { return 1.17549435e-38F; }
>      static float max() throw()
>      { return 3.40282347e+38F; }
>
>      static const int digits = 24;
>      static const int digits10 = 6;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static float epsilon() throw()
>      { return 1.19209290e-7F; }
>      static float round_error() throw()
>      { return 0.5F; }
>
>      static const int min_exponent = (-125);
>      static const int min_exponent10 = (-37);
>      static const int max_exponent = 128;
>      static const int max_exponent10 = 38;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(1.40129846e-45F) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static float infinity() throw()
>      { return __builtin_huge_valf (); }
>      static float quiet_NaN() throw()
>      { return __builtin_nanf (""); }
>      static float signaling_NaN() throw()
>      { return __builtin_nansf (""); }
>      static float denorm_min() throw()
>      { return 1.40129846e-45F; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>
>  template<>
>    struct numeric_limits<double>
>    {
>      static const bool is_specialized = true;
>
>      static double min() throw()
>      { return 2.2250738585072014e-308; }
>      static double max() throw()
>      { return 1.7976931348623157e+308; }
>
>      static const int digits = 53;
>      static const int digits10 = 15;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static double epsilon() throw()
>      { return 2.2204460492503131e-16; }
>      static double round_error() throw()
>      { return 0.5; }
>
>      static const int min_exponent = (-1021);
>      static const int min_exponent10 = (-307);
>      static const int max_exponent = 1024;
>      static const int max_exponent10 = 308;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(4.9406564584124654e-324) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static double infinity() throw()
>      { return __builtin_huge_val(); }
>      static double quiet_NaN() throw()
>      { return __builtin_nan (""); }
>      static double signaling_NaN() throw()
>      { return __builtin_nans (""); }
>      static double denorm_min() throw()
>      { return 4.9406564584124654e-324; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>
>  template<>
>    struct numeric_limits<long double>
>    {
>      static const bool is_specialized = true;
>
>      static long double min() throw()
>      { return 3.36210314311209350626e-4932L; }
>      static long double max() throw()
>      { return 1.18973149535723176502e+4932L; }
>
>      static const int digits = 64;
>      static const int digits10 = 18;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static long double epsilon() throw()
>      { return 1.08420217248550443401e-19L; }
>      static long double round_error() throw()
>      { return 0.5L; }
>
>      static const int min_exponent = (-16381);
>      static const int min_exponent10 = (-4931);
>      static const int max_exponent = 16384;
>      static const int max_exponent10 = 4932;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(3.64519953188247460253e-4951L) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss
> = false;
>
>      static long double infinity() throw()
>      { return __builtin_huge_vall (); }
>      static long double quiet_NaN() throw()
>      { return __builtin_nanl (""); }
>      static long double signaling_NaN() throw()
>      { return __builtin_nansl (""); }
>      static long double denorm_min() throw()
>      { return 3.64519953188247460253e-4951L; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>}
># 61 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
>
>namespace std
>{
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    pair<_Tp*, ptrdiff_t>
>    __get_temporary_buffer(ptrdiff_t __len, _Tp*)
>    {
>      const ptrdiff_t __max = numeric_limits<ptrdiff_t>::max() / sizeof(_Tp);
>      if (__len > __max)
> __len = __max;
>
>      while (__len > 0)
> {
>   _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp),
>       nothrow));
>   if (__tmp != 0)
>     return pair<_Tp*, ptrdiff_t>(__tmp, __len);
>   __len /= 2;
> }
>      return pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0);
>    }
># 108 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    inline pair<_Tp*, ptrdiff_t>
>    get_temporary_buffer(ptrdiff_t __len)
>    { return std::__get_temporary_buffer(__len, static_cast<_Tp*>(0)); }
># 120 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    void
>    return_temporary_buffer(_Tp* __p)
>    { ::operator delete(__p, nothrow); }
># 132 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp1>
>    struct auto_ptr_ref
>    {
>      _Tp1* _M_ptr;
>
>      explicit
>      auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }
>    };
># 173 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    class auto_ptr
>    {
>    private:
>      _Tp* _M_ptr;
>
>    public:
>
>      typedef _Tp element_type;
>
>
>
>
>
>
>
>      explicit
>      auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }
># 199 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }
># 211 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { }
># 222 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      auto_ptr&
>      operator=(auto_ptr& __a) throw()
>      {
> reset(__a.release());
> return *this;
>      }
># 239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr&
>        operator=(auto_ptr<_Tp1>& __a) throw()
>        {
>   reset(__a.release());
>   return *this;
> }
># 259 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      ~auto_ptr() { delete _M_ptr; }
># 269 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      element_type&
>      operator*() const throw()
>      {
> ;
> return *_M_ptr;
>      }
>
>
>
>
>
>
>
>      element_type*
>      operator->() const throw()
>      {
> ;
> return _M_ptr;
>      }
># 299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      element_type*
>      get() const throw() { return _M_ptr; }
># 313 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      element_type*
>      release() throw()
>      {
> element_type* __tmp = _M_ptr;
> _M_ptr = 0;
> return __tmp;
>      }
># 328 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      void
>      reset(element_type* __p = 0) throw()
>      {
> if (__p != _M_ptr)
>   {
>     delete _M_ptr;
>     _M_ptr = __p;
>   }
>      }
># 349 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      auto_ptr(auto_ptr_ref<element_type> __ref) throw()
>      : _M_ptr(__ref._M_ptr) { }
>
>      auto_ptr&
>      operator=(auto_ptr_ref<element_type> __ref) throw()
>      {
> if (__ref._M_ptr != this->get())
>   {
>     delete _M_ptr;
>     _M_ptr = __ref._M_ptr;
>   }
> return *this;
>      }
>
>      template<typename _Tp1>
>        operator auto_ptr_ref<_Tp1>() throw()
>        { return auto_ptr_ref<_Tp1>(this->release()); }
>
>      template<typename _Tp1>
>        operator auto_ptr<_Tp1>() throw()
>        { return auto_ptr<_Tp1>(this->release()); }
>  };
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>namespace std
>{
># 101 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Arg, class _Result>
>    struct unary_function
>    {
>      typedef _Arg argument_type;
>
>
>      typedef _Result result_type;
>    };
>
>
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    struct binary_function
>    {
>      typedef _Arg1 first_argument_type;
>
>
>      typedef _Arg2 second_argument_type;
>      typedef _Result result_type;
>    };
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct plus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x + __y; }
>    };
>
>
>  template <class _Tp>
>    struct minus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x - __y; }
>    };
>
>
>  template <class _Tp>
>    struct multiplies : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x * __y; }
>    };
>
>
>  template <class _Tp>
>    struct divides : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x / __y; }
>    };
>
>
>  template <class _Tp>
>    struct modulus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x % __y; }
>    };
>
>
>  template <class _Tp>
>    struct negate : public unary_function<_Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x) const
>      { return -__x; }
>    };
># 195 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x == __y; }
>    };
>
>
>  template <class _Tp>
>    struct not_equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x != __y; }
>    };
>
>
>  template <class _Tp>
>    struct greater : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x > __y; }
>    };
>
>
>  template <class _Tp>
>    struct less : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x < __y; }
>    };
>
>
>  template <class _Tp>
>    struct greater_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x >= __y; }
>    };
>
>
>  template <class _Tp>
>    struct less_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x <= __y; }
>    };
># 256 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct logical_and : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x && __y; }
>    };
>
>
>  template <class _Tp>
>    struct logical_or : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x || __y; }
>    };
>
>
>  template <class _Tp>
>    struct logical_not : public unary_function<_Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x) const
>      { return !__x; }
>    };
># 311 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _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 <class _Predicate>
>    inline unary_negate<_Predicate>
>    not1(const _Predicate& __pred)
>    { return unary_negate<_Predicate>(__pred); }
>
>
>  template <class _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 <class _Predicate>
>    inline binary_negate<_Predicate>
>    not2(const _Predicate& __pred)
>    { return binary_negate<_Predicate>(__pred); }
># 391 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _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 <class _Operation, class _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 <class _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 <class _Operation, class _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));
>    }
># 480 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Arg, class _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 <class _Arg, class _Result>
>    inline pointer_to_unary_function<_Arg, _Result>
>    ptr_fun(_Result (*__x)(_Arg))
>    { return pointer_to_unary_function<_Arg, _Result>(__x); }
>
>
>  template <class _Arg1, class _Arg2, class _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 <class _Arg1, class _Arg2, class _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 <class _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 <class _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; }
>    };
>
>  template <class _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; }
>    };
># 582 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Ret, class _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 <class _Ret, class _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 <class _Ret, class _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 <class _Ret, class _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 <class _Ret, class _Tp, class _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 <class _Ret, class _Tp, class _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 <class _Ret, class _Tp, class _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 <class _Ret, class _Tp, class _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 <class _Ret, class _Tp>
>    inline mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)())
>    { return mem_fun_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline const_mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)())
>    { return mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _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 <class _Ret, class _Tp, class _Arg>
>    inline mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _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 <class _Ret, class _Tp, class _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 <class _Ret, class _Tp, class _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); }
>
>
>
>}
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/atomicity.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/atomicity.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/atomic_word.h" 1 3
># 33 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/atomic_word.h" 3
>typedef int _Atomic_word;
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/atomicity.h" 2 3
>
>namespace __gnu_cxx
>{
>  _Atomic_word
>  __attribute__ ((__unused__))
>  __exchange_and_add(volatile _Atomic_word* __mem, int __val);
>
>  void
>  __attribute__ ((__unused__))
>  __atomic_add(volatile _Atomic_word* __mem, int __val);
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 2 3
>
>
>namespace std
>{
># 109 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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:
># 146 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 171 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
> {
>   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(&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(&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); }
>
>      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:
>
>
>
>
>
>
>
>      inline
>      basic_string();
>
>
>
>
>      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);
># 448 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
>
>
>
>
>
>
>
>      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); }
># 503 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      operator=(_CharT __c)
>      {
> this->assign(1, __c);
> return *this;
>      }
>
>
>
>
>
>
>      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()); }
>
>    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; }
># 614 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      resize(size_type __n, _CharT __c);
># 627 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      resize(size_type __n)
>      { this->resize(__n, _CharT()); }
>
>
>
>
>
>      size_type
>      capacity() const
>      { return _M_rep()->_M_capacity; }
># 656 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 684 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      const_reference
>      operator[] (size_type __pos) const
>      {
> ;
> return _M_data()[__pos];
>      }
># 701 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      reference
>      operator[](size_type __pos)
>      {
>
> ;
>
> ;
> _M_leak();
> return _M_data()[__pos];
>      }
># 722 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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];
>      }
># 741 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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];
>      }
>
>
>
>
>
>
>
>      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;
>      }
>
>
>
>
>
>
>      basic_string&
>      append(const basic_string& __str);
># 801 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 833 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      append(size_type __n, _CharT __c);
># 844 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
># 883 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)); }
># 899 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s, size_type __n);
># 911 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s)
>      {
> ;
> return this->assign(__s, traits_type::length(__s));
>      }
># 927 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(size_type __n, _CharT __c)
>      { return _M_replace_aux(size_type(0), this->size(), __n, __c); }
># 939 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        basic_string&
>        assign(_InputIterator __first, _InputIterator __last)
>        { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
># 956 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      insert(iterator __p, size_type __n, _CharT __c)
>      { this->replace(__p, __p, __n, __c); }
># 971 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        void
>        insert(iterator __p, _InputIterator __beg, _InputIterator __end)
>        { this->replace(__p, __p, __beg, __end); }
># 987 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)); }
># 1032 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s, size_type __n);
># 1050 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s)
>      {
> ;
> return this->insert(__pos, __s, traits_type::length(__s));
>      }
># 1073 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 1090 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 this->_M_ibegin() + __pos;
>      }
># 1114 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 1130 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 _M_ibegin() + __pos;
>      }
># 1150 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      iterator
>      erase(iterator __first, iterator __last)
>      {
> ;
>
>        const size_type __pos = __first - _M_ibegin();
> _M_mutate(__pos, __last - __first, size_type(0));
> _M_rep()->_M_set_leaked();
> return _M_ibegin() + __pos;
>      }
># 1177 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1199 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)); }
># 1223 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2);
># 1242 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1265 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 1283 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1301 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      }
># 1322 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1343 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      }
># 1365 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      }
>
>    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 _InIterator>
>        static _CharT*
>        _S_construct_aux(_InIterator __beg, _InIterator __end,
>    const _Alloc& __a, __true_type)
> { return _S_construct(static_cast<size_type>(__beg),
>         static_cast<value_type>(__end), __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:
># 1496 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
># 1506 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      swap(basic_string& __s);
># 1516 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 1548 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find(const _CharT* __s, size_type __pos, size_type __n) const;
># 1561 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1575 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1592 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find(_CharT __c, size_type __pos = 0) const;
># 1605 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1620 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      rfind(const _CharT* __s, size_type __pos, size_type __n) const;
># 1633 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1650 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      rfind(_CharT __c, size_type __pos = npos) const;
># 1663 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1678 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1691 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1710 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(_CharT __c, size_type __pos = 0) const
>      { return this->find(__c, __pos); }
># 1724 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1739 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1752 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1771 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(_CharT __c, size_type __pos = npos) const
>      { return this->rfind(__c, __pos); }
># 1785 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1800 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(const _CharT* __s, size_type __pos,
>   size_type __n) const;
># 1814 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1831 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(_CharT __c, size_type __pos = 0) const;
># 1844 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 1860 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(const _CharT* __s, size_type __pos,
>         size_type __n) const;
># 1873 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>      }
># 1890 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(_CharT __c, size_type __pos = npos) const;
># 1905 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 1923 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 = __size - __osize;
> return __r;
>      }
># 1953 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n, const basic_string& __str) const;
># 1977 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos1, size_type __n1, const basic_string& __str,
>       size_type __pos2, size_type __n2) const;
># 1995 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(const _CharT* __s) const;
># 2018 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s) const;
># 2043 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2) const;
>  };
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_string<_CharT, _Traits, _Alloc>::
>    basic_string()
>
>    : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }
># 2064 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 2135 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 _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; }
># 2172 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 __rhs.compare(__lhs) != 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; }
>
>
>
>
>
>
>
>  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; }
># 2209 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 2246 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 2283 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 2320 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 2357 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 2374 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
># 2392 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __os,
>        const basic_string<_CharT, _Traits, _Alloc>& __str);
># 2410 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
># 2427 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>
>  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);
>
>}
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 3
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 1 3
># 65 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 1 3
># 65 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>namespace std
>{
>
>
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    bool
>    __is_heap(_RandomAccessIterator __first, _Distance __n)
>    {
>      _Distance __parent = 0;
>      for (_Distance __child = 1; __child < __n; ++__child)
> {
>   if (__first[__parent] < __first[__child])
>     return false;
>   if ((__child & 1) == 0)
>     ++__parent;
> }
>      return true;
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance,
>           typename _StrictWeakOrdering>
>    bool
>    __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp,
>       _Distance __n)
>    {
>      _Distance __parent = 0;
>      for (_Distance __child = 1; __child < __n; ++__child)
> {
>   if (__comp(__first[__parent], __first[__child]))
>     return false;
>   if ((__child & 1) == 0)
>     ++__parent;
> }
>      return true;
>    }
>
>  template<typename _RandomAccessIterator>
>    bool
>    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    { return std::__is_heap(__first, std::distance(__first, __last)); }
>
>  template<typename _RandomAccessIterator, typename _StrictWeakOrdering>
>    bool
>    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>     _StrictWeakOrdering __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;
>    }
># 139 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>
>     
>
>     
>      ;
>
>
>      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
>         _DistanceType(0), _ValueType(*(__last - 1)));
>    }
>
>  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;
>    }
># 187 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>
>     
>
>      ;
>      ;
>
>      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
>         _DistanceType(0), _ValueType(*(__last - 1)), __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 = 2 * __holeIndex + 2;
>      while (__secondChild < __len)
> {
>   if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
>     __secondChild--;
>   *(__first + __holeIndex) = *(__first + __secondChild);
>   __holeIndex = __secondChild;
>   __secondChild = 2 * (__secondChild + 1);
> }
>      if (__secondChild == __len)
> {
>   *(__first + __holeIndex) = *(__first + (__secondChild - 1));
>   __holeIndex = __secondChild - 1;
> }
>      std::__push_heap(__first, __holeIndex, __topIndex, __value);
>    }
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    inline void
>    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>        _RandomAccessIterator __result, _Tp __value)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>      *__result = *__first;
>      std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
>    __value);
>    }
># 251 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      std::__pop_heap(__first, __last - 1, __last - 1,
>        _ValueType(*(__last - 1)));
>    }
>
>  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 = 2 * __holeIndex + 2;
>      while (__secondChild < __len)
> {
>   if (__comp(*(__first + __secondChild),
>       *(__first + (__secondChild - 1))))
>     __secondChild--;
>   *(__first + __holeIndex) = *(__first + __secondChild);
>   __holeIndex = __secondChild;
>   __secondChild = 2 * (__secondChild + 1);
> }
>      if (__secondChild == __len)
> {
>   *(__first + __holeIndex) = *(__first + (__secondChild - 1));
>   __holeIndex = __secondChild - 1;
> }
>      std::__push_heap(__first, __holeIndex, __topIndex, __value, __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
>    inline void
>    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>        _RandomAccessIterator __result, _Tp __value, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>      *__result = *__first;
>      std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
>    __value, __comp);
>    }
># 317 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    pop_heap(_RandomAccessIterator __first,
>      _RandomAccessIterator __last, _Compare __comp)
>    {
>
>     
>
>      ;
>      ;
>
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>      std::__pop_heap(__first, __last - 1, __last - 1,
>        _ValueType(*(__last - 1)), __comp);
>    }
># 342 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
> {
>   std::__adjust_heap(__first, __parent, __len,
>        _ValueType(*(__first + __parent)));
>   if (__parent == 0)
>     return;
>   __parent--;
> }
>    }
># 382 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline 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)
> {
>   std::__adjust_heap(__first, __parent, __len,
>        _ValueType(*(__first + __parent)), __comp);
>   if (__parent == 0)
>     return;
>   __parent--;
> }
>    }
># 420 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>
>     
>
>     
>
>      ;
>
>
>      while (__last - __first > 1)
> std::pop_heap(__first, __last--);
>    }
># 446 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>
>     
>
>      ;
>      ;
>
>      while (__last - __first > 1)
> std::pop_heap(__first, __last--, __comp);
>    }
>
>}
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_tempbuf.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_tempbuf.h" 3
>namespace std
>{
>
>
>
>
>
>
>
>  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;
>
>      void
>      _M_initialize_buffer(const _Tp&, __true_type) { }
>
>      void
>      _M_initialize_buffer(const _Tp& val, __false_type)
>      { std::uninitialized_fill_n(_M_buffer, _M_len, val); }
>
>    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<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)
>    {
>
>      typedef typename std::__is_scalar<_Tp>::__type _Trivial;
>
>      try
> {
>   pair<pointer, size_type> __p(get_temporary_buffer<
>           value_type>(_M_original_len));
>   _M_buffer = __p.first;
>   _M_len = __p.second;
>   if (_M_len > 0)
>     _M_initialize_buffer(*__first, _Trivial());
> }
>      catch(...)
> {
>   std::return_temporary_buffer(_M_buffer);
>   _M_buffer = 0;
>   _M_len = 0;
>   throw;
> }
>    }
>}
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 2 3
>
>
>
>
>namespace std
>{
># 85 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _Tp>
>    inline const _Tp&
>    __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)
>    {
>
>     
>      if (__a < __b)
> if (__b < __c)
>   return __b;
> else if (__a < __c)
>   return __c;
> else
>   return __a;
>      else if (__a < __c)
> return __a;
>      else if (__b < __c)
> return __c;
>      else
> return __b;
>    }
># 119 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
>    {
>
>     
>      if (__comp(__a, __b))
> if (__comp(__b, __c))
>   return __b;
> else if (__comp(__a, __c))
>   return __c;
> else
>   return __a;
>      else if (__comp(__a, __c))
> return __a;
>      else if (__comp(__b, __c))
> return __c;
>      else
> return __b;
>    }
># 151 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
>
>
>
>
>
>
>  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 && !__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;
> }
>    }
># 305 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
># 327 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
># 349 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 380 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 411 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 435 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 474 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 __tmp(__first2);
>      ++__tmp;
>      if (__tmp == __last2)
> return std::find(__first1, __last1, *__first2);
>
>
>      _ForwardIterator2 __p1, __p;
>      __p1 = __first2; ++__p1;
>      _ForwardIterator1 __current = __first1;
>
>      while (__first1 != __last1)
> {
>   __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;
>    }
># 545 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 __tmp(__first2);
>      ++__tmp;
>      if (__tmp == __last2)
> {
>   while (__first1 != __last1 && !__predicate(*__first1, *__first2))
>     ++__first1;
>   return __first1;
> }
>
>
>      _ForwardIterator2 __p1, __p;
>      __p1 = __first2; ++__p1;
>      _ForwardIterator1 __current = __first1;
>
>      while (__first1 != __last1)
> {
>   while (__first1 != __last1)
>     {
>       if (__predicate(*__first1, *__first2))
>  break;
>       ++__first1;
>     }
>   while (__first1 != __last1 && !__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;
>    }
># 617 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 651 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  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;
> }
>    }
># 709 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
># 736 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 && !__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 && __binary_pred(*__i, __val))
>     {
>       ++__i;
>       --__n;
>     }
>   if (__n == 1)
>     return __first;
>   if (__i == __last)
>     return __last;
>   __first = ++__i;
>   while (__first != __last && !__binary_pred(*__first, __val))
>     ++__first;
> }
>      return __last;
>    }
># 776 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  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 (!__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;
> }
>    }
># 837 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 && !__binary_pred(*__first, __val))
>     ++__first;
>   return __first;
> }
>      return std::__search_n(__first, __last, __count, __val, __binary_pred,
>        std::__iterator_category(__first));
>    }
># 873 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.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;
>    }
># 911 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 946 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 978 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1042 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1078 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1112 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Generator>
>    void
>    generate(_ForwardIterator __first, _ForwardIterator __last,
>      _Generator __gen)
>    {
>
>     
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first)
> *__first = __gen();
>    }
># 1138 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _OutputIterator, typename _Size, typename _Generator>
>    _OutputIterator
>    generate_n(_OutputIterator __first, _Size __n, _Generator __gen)
>    {
>
>     
>
>
>
>      for ( ; __n > 0; --__n, ++__first)
> *__first = __gen();
>      return __first;
>    }
># 1165 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1201 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 (!__pred(*__first))
>   {
>     *__result = *__first;
>     ++__result;
>   }
>      return __result;
>    }
># 1240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      _ForwardIterator __i = __first;
>      return __first == __last ? __first
>          : std::remove_copy(++__i, __last,
>        __first, __value);
>    }
># 1275 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      _ForwardIterator __i = __first;
>      return __first == __last ? __first
>          : std::remove_copy_if(++__i, __last,
>           __first, __pred);
>    }
># 1301 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    _OutputIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _OutputIterator __result,
>    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;
>    }
># 1326 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    _ForwardIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _ForwardIterator __result,
>    forward_iterator_tag)
>    {
>
>      *__result = *__first;
>      while (++__first != __last)
> if (!(*__result == *__first))
>   *++__result = *__first;
>      return ++__result;
>    }
># 1348 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _BinaryPredicate>
>    _OutputIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _OutputIterator __result,
>    _BinaryPredicate __binary_pred,
>    output_iterator_tag)
>    {
>
>     
>
>
>
>      typename iterator_traits<_InputIterator>::value_type __value = *__first;
>      *__result = __value;
>      while (++__first != __last)
> if (!__binary_pred(__value, *__first))
>   {
>     __value = *__first;
>     *++__result = __value;
>   }
>      return ++__result;
>    }
># 1380 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _BinaryPredicate>
>    _ForwardIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _ForwardIterator __result,
>    _BinaryPredicate __binary_pred,
>    forward_iterator_tag)
>    {
>
>     
>
>
>
>      *__result = *__first;
>      while (++__first != __last)
> if (!__binary_pred(*__result, *__first)) *++__result = *__first;
>      return ++__result;
>    }
># 1412 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    inline _OutputIterator
>    unique_copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      typedef typename iterator_traits<_OutputIterator>::iterator_category
> _IterType;
>
>      if (__first == __last) return __result;
>      return std::__unique_copy(__first, __last, __result, _IterType());
>    }
># 1447 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>
>      ;
>
>      typedef typename iterator_traits<_OutputIterator>::iterator_category
> _IterType;
>
>      if (__first == __last) return __result;
>      return std::__unique_copy(__first, __last, __result,
>    __binary_pred, _IterType());
>    }
># 1481 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1520 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 (!__binary_pred(*__dest, *__first))
>   *++__dest = *__first;
>      return ++__dest;
>    }
># 1554 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  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;
>   }
>    }
># 1576 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  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;
> }
>    }
># 1603 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    inline void
>    reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
>    {
>
>     
>
>      ;
>      std::__reverse(__first, __last, std::__iterator_category(__first));
>    }
># 1629 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1657 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  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
> {
>   swap(*__first, *__first2);
>   ++__first;
>   ++__first2;
>   if (__first == __middle)
>     __middle = __first2;
> }
>      while (__first2 != __last);
>
>      __first2 = __middle;
>
>      while (__first2 != __last)
> {
>   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)
> {
>   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;
>
>      const _Distance __n = __last - __first;
>      const _Distance __k = __middle - __first;
>      const _Distance __l = __n - __k;
>
>      if (__k == __l)
> {
>   std::swap_ranges(__first, __middle, __middle);
>   return;
> }
>
>      const _Distance __d = __gcd(__n, __k);
>
>      for (_Distance __i = 0; __i < __d; __i++)
> {
>   _ValueType __tmp = *__first;
>   _RandomAccessIterator __p = __first;
>
>   if (__k < __l)
>     {
>       for (_Distance __j = 0; __j < __l / __d; __j++)
>  {
>    if (__p > __first + __l)
>      {
>        *__p = *(__p - __l);
>        __p -= __l;
>      }
>
>    *__p = *(__p + __k);
>    __p += __k;
>  }
>     }
>   else
>     {
>       for (_Distance __j = 0; __j < __k / __d - 1; __j ++)
>  {
>    if (__p < __last - __k)
>      {
>        *__p = *(__p + __k);
>        __p += __k;
>      }
>    *__p = * (__p - __l);
>    __p -= __l;
>  }
>     }
>
>   *__p = __tmp;
>   ++__first;
> }
>    }
># 1836 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
>    }
># 1869 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
># 1895 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)));
>    }
># 1922 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
>
>
>
>
>
>
>
>  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))
>   {
>     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 (!__pred(*__last))
>       --__last;
>     else
>       break;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
># 2016 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
>
>
>
>
>
>
>
>  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;
> }
>    }
># 2127 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(), __buf.size());
> else
>   return
>     std::__inplace_stable_partition(__first, __last, __pred,
>      _DistanceType(__buf.requested_size()));
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    _RandomAccessIterator
>    __unguarded_partition(_RandomAccessIterator __first,
>     _RandomAccessIterator __last, _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,
>     _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;
> }
>    }
>
>
>
>
>
>
>
>  enum { _S_threshold = 16 };
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    void
>    __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)
>    {
>      _RandomAccessIterator __next = __last;
>      --__next;
>      while (__val < *__next)
> {
>   *__last = *__next;
>   __last = __next;
>   --__next;
> }
>      *__last = __val;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
>    void
>    __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,
>         _Compare __comp)
>    {
>      _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)
> {
>   typename iterator_traits<_RandomAccessIterator>::value_type
>     __val = *__i;
>   if (__val < *__first)
>     {
>       std::copy_backward(__first, __i, __i + 1);
>       *__first = __val;
>     }
>   else
>     std::__unguarded_linear_insert(__i, __val);
> }
>    }
>
>
>
>
>
>
>  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)
> {
>   typename iterator_traits<_RandomAccessIterator>::value_type
>     __val = *__i;
>   if (__comp(__val, *__first))
>     {
>       std::copy_backward(__first, __i, __i + 1);
>       *__first = __val;
>     }
>   else
>     std::__unguarded_linear_insert(__i, __val, __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, _ValueType(*__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, _ValueType(*__i), __comp);
>    }
>
>
>
>
>
>
>  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 _Size>
>    inline _Size
>    __lg(_Size __n)
>    {
>      _Size __k;
>      for (__k = 0; __n != 1; __n >>= 1)
> ++__k;
>      return __k;
>    }
># 2416 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    partial_sort(_RandomAccessIterator __first,
>   _RandomAccessIterator __middle,
>   _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      std::make_heap(__first, __middle);
>      for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
> if (*__i < *__first)
>   std::__pop_heap(__first, __middle, __i, _ValueType(*__i));
>      std::sort_heap(__first, __middle);
>    }
># 2457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    partial_sort(_RandomAccessIterator __first,
>   _RandomAccessIterator __middle,
>   _RandomAccessIterator __last,
>   _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      std::make_heap(__first, __middle, __comp);
>      for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
> if (__comp(*__i, *__first))
>   std::__pop_heap(__first, __middle, __i, _ValueType(*__i), __comp);
>      std::sort_heap(__first, __middle, __comp);
>    }
># 2499 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _RandomAccessIterator>
>    _RandomAccessIterator
>    partial_sort_copy(_InputIterator __first, _InputIterator __last,
>        _RandomAccessIterator __result_first,
>        _RandomAccessIterator __result_last)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _InputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _OutputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>     
>      ;
>      ;
>
>      if (__result_first == __result_last)
> return __result_last;
>      _RandomAccessIterator __result_real_last = __result_first;
>      while(__first != __last && __result_real_last != __result_last)
> {
>   *__result_real_last = *__first;
>   ++__result_real_last;
>   ++__first;
> }
>      std::make_heap(__result_first, __result_real_last);
>      while (__first != __last)
> {
>   if (*__first < *__result_first)
>     std::__adjust_heap(__result_first, _DistanceType(0),
>          _DistanceType(__result_real_last
>          - __result_first),
>          _InputValueType(*__first));
>   ++__first;
> }
>      std::sort_heap(__result_first, __result_real_last);
>      return __result_real_last;
>    }
># 2563 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare>
>    _RandomAccessIterator
>    partial_sort_copy(_InputIterator __first, _InputIterator __last,
>        _RandomAccessIterator __result_first,
>        _RandomAccessIterator __result_last,
>        _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _InputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _OutputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      if (__result_first == __result_last)
> return __result_last;
>      _RandomAccessIterator __result_real_last = __result_first;
>      while(__first != __last && __result_real_last != __result_last)
> {
>   *__result_real_last = *__first;
>   ++__result_real_last;
>   ++__first;
> }
>      std::make_heap(__result_first, __result_real_last, __comp);
>      while (__first != __last)
> {
>   if (__comp(*__first, *__result_first))
>     std::__adjust_heap(__result_first, _DistanceType(0),
>          _DistanceType(__result_real_last
>          - __result_first),
>          _InputValueType(*__first),
>          __comp);
>   ++__first;
> }
>      std::sort_heap(__result_first, __result_real_last, __comp);
>      return __result_real_last;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Size>
>    void
>    __introsort_loop(_RandomAccessIterator __first,
>       _RandomAccessIterator __last,
>       _Size __depth_limit)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      while (__last - __first > int(_S_threshold))
> {
>   if (__depth_limit == 0)
>     {
>       std::partial_sort(__first, __last, __last);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last
>          - 1))));
>   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)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      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(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last - 1),
>        __comp)),
>           __comp);
>   std::__introsort_loop(__cut, __last, __depth_limit, __comp);
>   __last = __cut;
> }
>    }
># 2698 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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, __lg(__last - __first) * 2);
>   std::__final_insertion_sort(__first, __last);
> }
>    }
># 2732 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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, __lg(__last - __first) * 2,
>    __comp);
>   std::__final_insertion_sort(__first, __last, __comp);
> }
>    }
># 2765 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.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);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (*__middle < __val)
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else
>     __len = __half;
> }
>      return __first;
>    }
># 2820 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__comp(*__middle, __val))
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else
>     __len = __half;
> }
>      return __first;
>    }
># 2867 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__val < *__middle)
>     __len = __half;
>   else
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
> }
>      return __first;
>    }
># 2919 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__comp(__val, *__middle))
>     __len = __half;
>   else
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
> }
>      return __first;
>    }
>
>
>
>
>
>
>  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);
>    }
>
>
>
>
>
>
>  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);
>    }
># 3117 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    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));
>    }
># 3175 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      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::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::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::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::merge(__first, __first + __step_size,
>   __first + __step_size, __last,
>   __result,
>   __comp);
>    }
>
>  enum { _S_chunk_size = 7 };
>
>  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);
>    }
>
>  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 _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _BidirectionalIterator3>
>    _BidirectionalIterator3
>    __merge_backward(_BidirectionalIterator1 __first1,
>       _BidirectionalIterator1 __last1,
>       _BidirectionalIterator2 __first2,
>       _BidirectionalIterator2 __last2,
>       _BidirectionalIterator3 __result)
>    {
>      if (__first1 == __last1)
> return std::copy_backward(__first2, __last2, __result);
>      if (__first2 == __last2)
> return std::copy_backward(__first1, __last1, __result);
>      --__last1;
>      --__last2;
>      while (true)
> {
>   if (*__last2 < *__last1)
>     {
>       *--__result = *__last1;
>       if (__first1 == __last1)
>  return std::copy_backward(__first2, ++__last2, __result);
>       --__last1;
>     }
>   else
>     {
>       *--__result = *__last2;
>       if (__first2 == __last2)
>  return std::copy_backward(__first1, ++__last1, __result);
>       --__last2;
>     }
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _BidirectionalIterator3, typename _Compare>
>    _BidirectionalIterator3
>    __merge_backward(_BidirectionalIterator1 __first1,
>       _BidirectionalIterator1 __last1,
>       _BidirectionalIterator2 __first2,
>       _BidirectionalIterator2 __last2,
>       _BidirectionalIterator3 __result,
>       _Compare __comp)
>    {
>      if (__first1 == __last1)
> return std::copy_backward(__first2, __last2, __result);
>      if (__first2 == __last2)
> return std::copy_backward(__first1, __last1, __result);
>      --__last1;
>      --__last2;
>      while (true)
> {
>   if (__comp(*__last2, *__last1))
>     {
>       *--__result = *__last1;
>       if (__first1 == __last1)
>  return std::copy_backward(__first2, ++__last2, __result);
>       --__last1;
>     }
>   else
>     {
>       *--__result = *__last2;
>       if (__first2 == __last2)
>  return std::copy_backward(__first1, ++__last1, __result);
>       --__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)
> {
>   __buffer_end = std::copy(__middle, __last, __buffer);
>   std::copy_backward(__first, __middle, __last);
>   return std::copy(__buffer, __buffer_end, __first);
> }
>      else if (__len1 <= __buffer_size)
> {
>   __buffer_end = std::copy(__first, __middle, __buffer);
>   std::copy(__middle, __last, __first);
>   return std::copy_backward(__buffer, __buffer_end, __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::merge(__buffer, __buffer_end, __middle, __last, __first);
> }
>      else if (__len2 <= __buffer_size)
> {
>   _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
>   std::__merge_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::merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
> }
>      else if (__len2 <= __buffer_size)
> {
>   _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
>   std::__merge_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);
> }
>    }
># 3595 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()));
>    }
># 3649 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 _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);
>    }
># 3758 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()));
>    }
># 3799 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>    }
># 3840 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    nth_element(_RandomAccessIterator __first,
>  _RandomAccessIterator __nth,
>  _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      while (__last - __first > 3)
> {
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last
>          - 1))));
>   if (__cut <= __nth)
>     __first = __cut;
>   else
>     __last = __cut;
> }
>      std::__insertion_sort(__first, __last);
>    }
># 3891 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    nth_element(_RandomAccessIterator __first,
>  _RandomAccessIterator __nth,
>  _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__last - __first > 3)
> {
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last - 1),
>             __comp)), __comp);
>   if (__cut <= __nth)
>     __first = __cut;
>   else
>     __last = __cut;
> }
>      std::__insertion_sort(__first, __last, __comp);
>    }
># 3944 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      _DistanceType __half;
>      _ForwardIterator __middle, __left, __right;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (*__middle < __val)
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else if (__val < *__middle)
>     __len = __half;
>   else
>     {
>       __left = std::lower_bound(__first, __middle, __val);
>       std::advance(__first, __len);
>       __right = std::upper_bound(++__middle, __first, __val);
>       return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
>     }
> }
>      return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
>    }
># 4006 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    pair<_ForwardIterator, _ForwardIterator>
>    equal_range(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val,
>  _Compare __comp)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle, __left, __right;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __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
>     {
>       __left = std::lower_bound(__first, __middle, __val, __comp);
>       std::advance(__first, __len);
>       __right = std::upper_bound(++__middle, __first, __val, __comp);
>       return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
>     }
> }
>      return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
>    }
># 4064 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    bool
>    binary_search(_ForwardIterator __first, _ForwardIterator __last,
>                  const _Tp& __val)
>    {
>
>
>     
>     
>
>     
>      ;
>
>      _ForwardIterator __i = std::lower_bound(__first, __last, __val);
>      return __i != __last && !(__val < *__i);
>    }
># 4096 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    bool
>    binary_search(_ForwardIterator __first, _ForwardIterator __last,
>                  const _Tp& __val, _Compare __comp)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp);
>      return __i != __last && !__comp(__val, *__i);
>    }
># 4134 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    bool
>    includes(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _InputIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first2 < *__first1)
>   return false;
> else if(*__first1 < *__first2)
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 4180 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _Compare>
>    bool
>    includes(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first2, *__first1))
>   return false;
> else if(__comp(*__first1, *__first2))
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 4226 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      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));
>    }
># 4288 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      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));
>    }
># 4349 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   ++__first1;
> else if (*__first2 < *__first1)
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 4403 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   ++__first1;
> else if (__comp(*__first2, *__first1))
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 4457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      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);
>    }
># 4515 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      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);
>    }
># 4569 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      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));
>    }
># 4630 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      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));
>    }
># 4683 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 4710 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
>
>
>
>
>
>
>
>  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;
>    }
># 4762 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 4797 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>     }
> }
>    }
># 4853 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 (!__comp(*__i, *--__j))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 4908 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>     }
> }
>    }
># 4964 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 (!__comp(*--__j, *__i))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 5023 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 5059 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 5089 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  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;
> }
>    }
># 5239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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));
>    }
># 5284 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>    }
>
>}
># 69 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 2 3
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 3
>       
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 3
>
>namespace std
>{
>  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 _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 (__builtin_expect(__is_null_pointer(__beg) && __beg != __end, 0))
>   __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)
>    { }
>
>  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>
>     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"));
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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
>    {
>      ;
>      size_type __ret = npos;
>      const size_type __size = this->size();
>      if (__pos + __n <= __size)
> {
>   const _CharT* __data = _M_data();
>   const _CharT* __p = std::search(__data + __pos, __data + __size,
>       __s, __s + __n, traits_type::eq);
>   if (__p != __data + __size || __n == 0)
>     __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>::
>    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 = __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 = __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 = __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 = __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 = __n1 - __n2;
>      return __r;
>    }
>
>
>
>
>
>  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&);
>
>
>}
># 57 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 4 "CommandTable.h" 2
>
># 1 "CommandObject.h" 1
># 20 "CommandObject.h"
>       
>
># 1 "../include/Types.h" 1
># 21 "../include/Types.h"
>       
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/vector" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/vector" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/vector" 3
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 1 3
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>namespace std
>{
>
>
>
>
>
>  template<typename _Tp, typename _Alloc>
>    struct _Vector_base
>    {
>      typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;
>
>      struct _Vector_impl
>      : public _Tp_alloc_type
>      {
> _Tp* _M_start;
> _Tp* _M_finish;
> _Tp* _M_end_of_storage;
> _Vector_impl(_Tp_alloc_type const& __a)
> : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)
> { }
>      };
>
>    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 _M_get_Tp_allocator(); }
>
>      _Vector_base(const allocator_type& __a)
>      : _M_impl(__a)
>      { }
>
>      _Vector_base(size_t __n, const allocator_type& __a)
>      : _M_impl(__a)
>      {
> 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;
>      }
>
>      ~_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;
>
>      _Tp*
>      _M_allocate(size_t __n)
>      { return _M_impl.allocate(__n); }
>
>      void
>      _M_deallocate(_Tp* __p, size_t __n)
>      {
> if (__p)
>   _M_impl.deallocate(__p, __n);
>      }
>    };
># 157 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 vector<_Tp, _Alloc> vector_type;
>      typedef typename _Base::_Tp_alloc_type _Tp_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 __gnu_cxx::__normal_iterator<pointer, vector_type> iterator;
>      typedef __gnu_cxx::__normal_iterator<const_pointer, vector_type>
>      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:
>
>
>
>
>
>      explicit
>      vector(const allocator_type& __a = allocator_type())
>      : _Base(__a)
>      { }
># 213 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>      {
> 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_start + __n;
>      }
># 232 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      vector(const vector& __x)
>      : _Base(__x.size(), __x.get_allocator())
>      { this->_M_impl._M_finish =
>   std::__uninitialized_copy_a(__x.begin(), __x.end(),
>          this->_M_impl._M_start,
>          _M_get_Tp_allocator());
>      }
># 255 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
>      }
># 284 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      vector&
>      operator=(const vector& __x);
># 297 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 313 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
> }
>
>
>      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()); }
>
>
>
>      size_type
>      size() const
>      { return size_type(end() - begin()); }
>
>
>      size_type
>      max_size() const
>      { return size_type(-1) / sizeof(value_type); }
># 420 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      void
>      resize(size_type __new_size, value_type __x = value_type())
>      {
> if (__new_size < size())
>   erase(begin() + __new_size, end());
> else
>   insert(end(), __new_size - size(), __x);
>      }
>
>
>
>
>
>      size_type
>      capacity() const
>      { return size_type(const_iterator(this->_M_impl._M_end_of_storage)
>    - begin()); }
>
>
>
>
>
>      bool
>      empty() const
>      { return begin() == end(); }
># 463 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      void
>      reserve(size_type __n);
># 478 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      reference
>      operator[](size_type __n)
>      { return *(begin() + __n); }
># 493 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      const_reference
>      operator[](size_type __n) const
>      { return *(begin() + __n); }
>
>    protected:
>
>      void
>      _M_range_check(size_type __n) const
>      {
> if (__n >= this->size())
>   __throw_out_of_range(("vector::_M_range_check"));
>      }
>
>    public:
># 518 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      reference
>      at(size_type __n)
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
># 536 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 582 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      pointer
>      data()
>      { return pointer(this->_M_impl._M_start); }
>
>      const_pointer
>      data() const
>      { return const_pointer(this->_M_impl._M_start); }
># 601 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)
>   {
>     this->_M_impl.construct(this->_M_impl._M_finish, __x);
>     ++this->_M_impl._M_finish;
>   }
> else
>   _M_insert_aux(end(), __x);
>      }
># 622 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      void
>      pop_back()
>      {
> --this->_M_impl._M_finish;
> this->_M_impl.destroy(this->_M_impl._M_finish);
>      }
># 640 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x);
># 656 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 674 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
> }
># 699 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      iterator
>      erase(iterator __position);
># 720 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      iterator
>      erase(iterator __first, iterator __last);
># 732 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_vector.h" 3
>      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);
>      }
>
>
>
>
>
>
>
>      void
>      clear()
>      {
> std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>        _M_get_Tp_allocator());
> this->_M_impl._M_finish = 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;
>     }
> }
>
>
>
>
>
>      template<typename _Integer>
>        void
>        _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)
>        {
>   this->_M_impl._M_start = _M_allocate(__n);
>   this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
>   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;
> }
>
>
>      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());
> }
>
>
>
>
>
>
>      template<typename _Integer>
>        void
>        _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>        {
>   _M_fill_assign(static_cast<size_type>(__n),
>    static_cast<value_type>(__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);
>
>
>
>
>
>      template<typename _Integer>
>        void
>        _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
>      __true_type)
>        {
>   _M_fill_insert(__pos, static_cast<size_type>(__n),
>    static_cast<value_type>(__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);
>
>
>      void
>      _M_insert_aux(iterator __position, const value_type& __x);
>    };
># 930 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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())); }
># 947 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/vector" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h" 3
>namespace std
>{
>  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)
> {
>   _M_offset = static_cast<unsigned int>(__n + int(_S_word_bit));
>   --_M_p;
> }
>      else
> _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; }
>
>  template<class _Alloc>
>    class _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(const _Bit_alloc_type& __a)
> : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0)
> { }
>      };
>
>    public:
>      typedef _Alloc allocator_type;
>
>      allocator_type
>      get_allocator() const
>      { return *static_cast<const _Bit_alloc_type*>(&this->_M_impl); }
>
>      _Bvector_base(const allocator_type& __a) : _M_impl(__a) { }
>
>      ~_Bvector_base()
>      { this->_M_deallocate(); }
>
>    protected:
>      _Bvector_impl _M_impl;
>
>      _Bit_type*
>      _M_allocate(size_t __n)
>      { return _M_impl.allocate((__n + int(_S_word_bit) - 1)
>    / int(_S_word_bit)); }
>
>      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);
>      }
>    };
>}
>
>
>
>
>namespace std
>{
># 425 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h" 3
>template<typename _Alloc>
>  class vector<bool, _Alloc> : public _Bvector_base<_Alloc>
>  {
>  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 typename _Bvector_base<_Alloc>::allocator_type allocator_type;
>
>    allocator_type get_allocator() const
>    { return _Bvector_base<_Alloc>::get_allocator(); }
>
>  protected:
>    using _Bvector_base<_Alloc>::_M_allocate;
>    using _Bvector_base<_Alloc>::_M_deallocate;
>
>  protected:
>    void
>    _M_initialize(size_type __n)
>    {
>      _Bit_type* __q = this->_M_allocate(__n);
>      this->_M_impl._M_end_of_storage = (__q
>      + ((__n + int(_S_word_bit) - 1)
>         / int(_S_word_bit)));
>      this->_M_impl._M_start = iterator(__q, 0);
>      this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n);
>    }
>
>    void
>    _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 = size() ? 2 * size()
>                                  : static_cast<size_type>(_S_word_bit);
>   _Bit_type * __q = this->_M_allocate(__len);
>   iterator __i = std::copy(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 + ((__len
>           + int(_S_word_bit) - 1)
>          / int(_S_word_bit)));
>   this->_M_impl._M_start = iterator(__q, 0);
> }
>    }
>
>    template<class _InputIterator>
>      void
>      _M_initialize_range(_InputIterator __first, _InputIterator __last,
>     std::input_iterator_tag)
>      {
> this->_M_impl._M_start = iterator();
> this->_M_impl._M_finish = iterator();
> this->_M_impl._M_end_of_storage = 0;
> for (; __first != __last; ++__first)
>   push_back(*__first);
>      }
>
>    template<class _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<class _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<class _ForwardIterator>
>      void
>      _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 = size() + std::max(size(), __n);
>  _Bit_type * __q = this->_M_allocate(__len);
>  iterator __i = std::copy(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
>         + ((__len
>             + int(_S_word_bit) - 1)
>            / int(_S_word_bit)));
>  this->_M_impl._M_start = iterator(__q, 0);
>       }
>   }
>      }
>
>  public:
>    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()); }
>
>    size_type
>    size() const
>    { return size_type(end() - begin()); }
>
>    size_type
>    max_size() const
>    { return size_type(-1); }
>
>    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 *(begin() + difference_type(__n)); }
>
>    const_reference
>    operator[](size_type __n) const
>    { return *(begin() + difference_type(__n)); }
>
>    void
>    _M_range_check(size_type __n) const
>    {
>      if (__n >= this->size())
>        __throw_out_of_range(("vector<bool>::_M_range_check"));
>    }
>
>    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]; }
>
>    explicit
>    vector(const allocator_type& __a = allocator_type())
>    : _Bvector_base<_Alloc>(__a) { }
>
>    vector(size_type __n, bool __value,
>    const allocator_type& __a = allocator_type())
>    : _Bvector_base<_Alloc>(__a)
>    {
>      _M_initialize(__n);
>      std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage,
>  __value ? ~0 : 0);
>    }
>
>    explicit
>    vector(size_type __n)
>    : _Bvector_base<_Alloc>(allocator_type())
>    {
>      _M_initialize(__n);
>      std::fill(this->_M_impl._M_start._M_p,
>  this->_M_impl._M_end_of_storage, 0);
>    }
>
>    vector(const vector& __x)
>    : _Bvector_base<_Alloc>(__x.get_allocator())
>    {
>      _M_initialize(__x.size());
>      std::copy(__x.begin(), __x.end(), this->_M_impl._M_start);
>    }
>
>
>    template<class _Integer>
>      void
>      _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
>      {
> _M_initialize(__n);
> std::fill(this->_M_impl._M_start._M_p,
>    this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
>      }
>
>    template<class _InputIterator>
>      void
>      _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
>        __false_type)
>      { _M_initialize_range(__first, __last,
>       std::__iterator_category(__first)); }
>
>    template<class _InputIterator>
>      vector(_InputIterator __first, _InputIterator __last,
>      const allocator_type& __a = allocator_type())
>      : _Bvector_base<_Alloc>(__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());
> }
>      std::copy(__x.begin(), __x.end(), begin());
>      this->_M_impl._M_finish = begin() + difference_type(__x.size());
>      return *this;
>    }
>
>
>
>
>
>
>    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
> {
>   erase(begin() + __n, end());
>   std::fill(this->_M_impl._M_start._M_p,
>      this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
> }
>    }
>
>    void
>    assign(size_t __n, bool __x)
>    { _M_fill_assign(__n, __x); }
>
>    template<class _InputIterator>
>      void
>      assign(_InputIterator __first, _InputIterator __last)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_assign_dispatch(__first, __last, _Integral());
>      }
>
>    template<class _Integer>
>      void
>      _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>      { _M_fill_assign((size_t) __n, (bool) __val); }
>
>    template<class _InputIterator>
>      void
>      _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
>    __false_type)
>      { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
>
>    template<class _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)
>   erase(__cur, end());
> else
>   insert(end(), __first, __last);
>      }
>
>    template<class _ForwardIterator>
>      void
>      _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>      std::forward_iterator_tag)
>      {
> const size_type __len = std::distance(__first, __last);
> if (__len < size())
>   erase(std::copy(__first, __last, begin()), end());
> else
>   {
>     _ForwardIterator __mid = __first;
>     std::advance(__mid, size());
>     std::copy(__first, __mid, begin());
>     insert(end(), __mid, __last);
>   }
>      }
>
>    void
>    reserve(size_type __n)
>    {
>      if (__n > this->max_size())
> __throw_length_error(("vector::reserve"));
>      if (this->capacity() < __n)
> {
>   _Bit_type* __q = this->_M_allocate(__n);
>   this->_M_impl._M_finish = std::copy(begin(), end(),
>           iterator(__q, 0));
>   this->_M_deallocate();
>   this->_M_impl._M_start = iterator(__q, 0);
>   this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1)
>          / int(_S_word_bit));
> }
>    }
>
>    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<bool, _Alloc>& __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);
>    }
>
>
>    static void
>    swap(reference __x, reference __y)
>    {
>      bool __tmp = __x;
>      __x = __y;
>      __y = __tmp;
>    }
>
>    iterator
>    insert(iterator __position, 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<class _Integer>
>      void
>      _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
>    __true_type)
>      { _M_fill_insert(__pos, __n, __x); }
>
>    template<class _InputIterator>
>      void
>      _M_insert_dispatch(iterator __pos,
>    _InputIterator __first, _InputIterator __last,
>    __false_type)
>      { _M_insert_range(__pos, __first, __last,
>   std::__iterator_category(__first)); }
>
>    template<class _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
>    _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 = size() + std::max(size(), __n);
>   _Bit_type * __q = this->_M_allocate(__len);
>   iterator __i = std::copy(begin(), __position, iterator(__q, 0));
>   std::fill_n(__i, __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 + ((__len
>           + int(_S_word_bit) - 1)
>          / int(_S_word_bit)));
>   this->_M_impl._M_start = iterator(__q, 0);
> }
>    }
>
>    void
>    insert(iterator __position, size_type __n, 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)
>    {
>      this->_M_impl._M_finish = std::copy(__last, end(), __first);
>      return __first;
>    }
>
>    void
>    resize(size_type __new_size, bool __x = bool())
>    {
>      if (__new_size < size())
>        erase(begin() + difference_type(__new_size), end());
>      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()
>    { erase(begin(), end()); }
>  };
>}
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/vector" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/vector.tcc" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/vector.tcc" 3
>namespace std
>{
>  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;
> }
>    }
>
>  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())
> {
>   this->_M_impl.construct(this->_M_impl._M_finish, __x);
>   ++this->_M_impl._M_finish;
> }
>      else
>        _M_insert_aux(__position, __x);
>      return begin() + __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;
>      this->_M_impl.destroy(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)
>    {
>      iterator __i(std::copy(__last, end(), __first));
>      std::_Destroy(__i, end(), _M_get_Tp_allocator());
>      this->_M_impl._M_finish = this->_M_impl._M_finish - (__last - __first);
>      return __first;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    vector<_Tp, _Alloc>&
>    vector<_Tp, _Alloc>::
>    operator=(const vector<_Tp, _Alloc>& __x)
>    {
>      if (&__x != this)
> {
>   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)
>     {
>       iterator __i(std::copy(__x.begin(), __x.end(), begin()));
>       std::_Destroy(__i, end(), _M_get_Tp_allocator());
>     }
>   else
>     {
>       std::copy(__x.begin(), __x.begin() + size(),
>   this->_M_impl._M_start);
>       std::__uninitialized_copy_a(__x.begin() + size(),
>       __x.end(), 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
>        erase(std::fill_n(begin(), __n, __val), end());
>    }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _InputIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _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)
>   erase(__cur, end());
> 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)
>   {
>     iterator __new_finish(std::copy(__first, __last,
>           this->_M_impl._M_start));
>     std::_Destroy(__new_finish, end(), _M_get_Tp_allocator());
>     this->_M_impl._M_finish = __new_finish.base();
>   }
> 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());
>   }
>      }
>
>  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)
> {
>   this->_M_impl.construct(this->_M_impl._M_finish,
>      *(this->_M_impl._M_finish - 1));
>   ++this->_M_impl._M_finish;
>   _Tp __x_copy = __x;
>   std::copy_backward(__position,
>        iterator(this->_M_impl._M_finish-2),
>        iterator(this->_M_impl._M_finish-1));
>   *__position = __x_copy;
> }
>      else
> {
>   const size_type __old_size = size();
>   if (__old_size == this->max_size())
>     __throw_length_error(("vector::_M_insert_aux"));
>
>
>
>
>   size_type __len = __old_size != 0 ? 2 * __old_size : 1;
>   if (__len < __old_size)
>     __len = this->max_size();
>
>   iterator __new_start(this->_M_allocate(__len));
>   iterator __new_finish(__new_start);
>   try
>     {
>       __new_finish =
>  std::__uninitialized_copy_a(iterator(this->_M_impl._M_start),
>         __position,
>         __new_start,
>         _M_get_Tp_allocator());
>       this->_M_impl.construct(__new_finish.base(), __x);
>       ++__new_finish;
>       __new_finish =
>  std::__uninitialized_copy_a(__position,
>         iterator(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.base(),__len);
>       throw;
>     }
>   std::_Destroy(begin(), end(), _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.base();
>   this->_M_impl._M_finish = __new_finish.base();
>   this->_M_impl._M_end_of_storage = __new_start.base() + __len;
> }
>    }
>
>  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;
>       iterator __old_finish(this->_M_impl._M_finish);
>       if (__elems_after > __n)
>  {
>    std::__uninitialized_copy_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, __old_finish - __n,
>         __old_finish);
>    std::fill(__position, __position + __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_copy_a(__position, __old_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __elems_after;
>    std::fill(__position, __old_finish, __x_copy);
>  }
>     }
>   else
>     {
>       const size_type __old_size = size();
>       if (this->max_size() - __old_size < __n)
>  __throw_length_error(("vector::_M_fill_insert"));
>
>
>       size_type __len = __old_size + std::max(__old_size, __n);
>       if (__len < __old_size)
>  __len = this->max_size();
>
>       iterator __new_start(this->_M_allocate(__len));
>       iterator __new_finish(__new_start);
>       try
>  {
>    __new_finish =
>      std::__uninitialized_copy_a(begin(), __position,
>      __new_start,
>      _M_get_Tp_allocator());
>    std::__uninitialized_fill_n_a(__new_finish, __n, __x,
>      _M_get_Tp_allocator());
>    __new_finish += __n;
>    __new_finish =
>      std::__uninitialized_copy_a(__position, end(), __new_finish,
>      _M_get_Tp_allocator());
>  }
>       catch(...)
>  {
>    std::_Destroy(__new_start, __new_finish,
>    _M_get_Tp_allocator());
>    _M_deallocate(__new_start.base(), __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.base();
>       this->_M_impl._M_finish = __new_finish.base();
>       this->_M_impl._M_end_of_storage = __new_start.base() + __len;
>     }
> }
>    }
>
>  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;
>  iterator __old_finish(this->_M_impl._M_finish);
>  if (__elems_after > __n)
>    {
>      std::__uninitialized_copy_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, __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_copy_a(__position, __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 __old_size = size();
>  if (this->max_size() - __old_size < __n)
>    __throw_length_error(("vector::_M_range_insert"));
>
>
>  size_type __len = __old_size + std::max(__old_size, __n);
>  if (__len < __old_size)
>    __len = this->max_size();
>
>  iterator __new_start(this->_M_allocate(__len));
>  iterator __new_finish(__new_start);
>  try
>    {
>      __new_finish =
>        std::__uninitialized_copy_a(iterator(this->_M_impl._M_start),
>        __position,
>        __new_start,
>        _M_get_Tp_allocator());
>      __new_finish =
>        std::__uninitialized_copy_a(__first, __last, __new_finish,
>        _M_get_Tp_allocator());
>      __new_finish =
>        std::__uninitialized_copy_a(__position,
>        iterator(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.base(), __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.base();
>  this->_M_impl._M_finish = __new_finish.base();
>  this->_M_impl._M_end_of_storage = __new_start.base() + __len;
>       }
>   }
>      }
>}
># 75 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/vector" 2 3
># 25 "../include/Types.h" 2
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/map" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/map" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/map" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_tree.h" 1 3
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_tree.h" 3
>namespace std
>{
># 90 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    };
>
>  _Rb_tree_node_base*
>  _Rb_tree_increment(_Rb_tree_node_base* __x);
>
>  const _Rb_tree_node_base*
>  _Rb_tree_increment(const _Rb_tree_node_base* __x);
>
>  _Rb_tree_node_base*
>  _Rb_tree_decrement(_Rb_tree_node_base* __x);
>
>  const _Rb_tree_node_base*
>  _Rb_tree_decrement(const _Rb_tree_node_base* __x);
>
>  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 &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) { }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return &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_rotate_left(_Rb_tree_node_base* const __x,
>                       _Rb_tree_node_base*& __root);
>
>  void
>  _Rb_tree_rotate_right(_Rb_tree_node_base* const __x,
>                        _Rb_tree_node_base*& __root);
>
>  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);
>
>  _Rb_tree_node_base*
>  _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
>          _Rb_tree_node_base& __header);
>
>
>  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;
>      typedef _Rb_tree_node<_Val> _Rb_tree_node;
>
>    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* _Link_type;
>      typedef const _Rb_tree_node* _Const_Link_type;
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Alloc allocator_type;
>
>      allocator_type
>      get_allocator() const
>      { return *static_cast<const _Node_allocator*>(&this->_M_impl); }
>
>    protected:
>      _Rb_tree_node*
>      _M_get_node()
>      { return _M_impl._Node_allocator::allocate(1); }
>
>      void
>      _M_put_node(_Rb_tree_node* __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(&__tmp->_M_value_field, __x); }
> catch(...)
>   {
>     _M_put_node(__tmp);
>     throw;
>   }
> return __tmp;
>      }
>
>      _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;
>      }
>
>      void
>      destroy_node(_Link_type __p)
>      {
> get_allocator().destroy(&__p->_M_value_field);
> _M_put_node(__p);
>      }
>
>    protected:
>      template<typename _Key_compare,
>        bool _Is_pod_comparator = std::__is_pod<_Key_compare>::__value>
>        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(const _Node_allocator& __a = _Node_allocator(),
>   const _Key_compare& __comp = _Key_compare())
>   : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
>     _M_node_count(0)
>   {
>     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;
>   }
> };
>
>
>
>      template<typename _Key_compare>
>        struct _Rb_tree_impl<_Key_compare, true> : public _Node_allocator
> {
>   _Key_compare _M_key_compare;
>   _Rb_tree_node_base _M_header;
>   size_type _M_node_count;
>
>   _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),
>   const _Key_compare& __comp = _Key_compare())
>   : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
>     _M_node_count(0)
>   {
>     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:
>      iterator
>      _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
>
>      const_iterator
>      _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y,
>  const value_type& __v);
>
>      _Link_type
>      _M_copy(_Const_Link_type __x, _Link_type __p);
>
>      void
>      _M_erase(_Link_type __x);
>
>    public:
>
>      _Rb_tree()
>      { }
>
>      _Rb_tree(const _Compare& __comp)
>      : _M_impl(allocator_type(), __comp)
>      { }
>
>      _Rb_tree(const _Compare& __comp, const allocator_type& __a)
>      : _M_impl(__a, __comp)
>      { }
>
>      _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
>      : _M_impl(__x.get_allocator(), __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;
>   }
>      }
>
>      ~_Rb_tree()
>      { _M_erase(_M_begin()); }
>
>      _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
>      operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __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 size_type(-1); }
>
>      void
>      swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t);
>
>
>      pair<iterator,bool>
>      insert_unique(const value_type& __x);
>
>      iterator
>      insert_equal(const value_type& __x);
>
>      iterator
>      insert_unique(iterator __position, const value_type& __x);
>
>      const_iterator
>      insert_unique(const_iterator __position, const value_type& __x);
>
>      iterator
>      insert_equal(iterator __position, const value_type& __x);
>
>      const_iterator
>      insert_equal(const_iterator __position, const value_type& __x);
>
>      template<typename _InputIterator>
>        void
>        insert_unique(_InputIterator __first, _InputIterator __last);
>
>      template<typename _InputIterator>
>        void
>        insert_equal(_InputIterator __first, _InputIterator __last);
>
>      void
>      erase(iterator __position);
>
>      void
>      erase(const_iterator __position);
>
>      size_type
>      erase(const key_type& __x);
>
>      void
>      erase(iterator __first, iterator __last);
>
>      void
>      erase(const_iterator __first, const_iterator __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& __x);
>
>      const_iterator
>      find(const key_type& __x) const;
>
>      size_type
>      count(const key_type& __x) const;
>
>      iterator
>      lower_bound(const key_type& __x);
>
>      const_iterator
>      lower_bound(const key_type& __x) const;
>
>      iterator
>      upper_bound(const key_type& __x);
>
>      const_iterator
>      upper_bound(const key_type& __x) const;
>
>      pair<iterator,iterator>
>      equal_range(const key_type& __x);
>
>      pair<const_iterator, const_iterator>
>      equal_range(const key_type& __x) 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); }
>
>  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(_Base_ptr __x, _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, __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>::const_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 const_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>::
>    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>
>    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);
>    }
>
>  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>::
>    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>::
>    insert_unique(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 insert_unique(__v).first;
> }
>      else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>          _S_key(__position._M_node)))
> {
>
>   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 insert_unique(__v).first;
> }
>      else if (_M_impl._M_key_compare(_S_key(__position._M_node),
>          _KeyOfValue()(__v)))
> {
>
>   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 insert_unique(__v).first;
> }
>      else
> return __position;
>    }
>
>  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>::
>    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 const_iterator(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 const_iterator(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 const_iterator(insert_unique(__v).first);
> }
>      else
> return __position;
>    }
>
>  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>::
>    insert_equal(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 insert_equal(__v);
> }
>      else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
>           _KeyOfValue()(__v)))
> {
>
>   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 insert_equal(__v);
> }
>      else
> {
>
>   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 insert_equal(__v);
> }
>    }
>
>  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>::
>    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 const_iterator(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 const_iterator(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 const_iterator(insert_equal(__v));
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      insert_equal(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   insert_equal(end(), *__first);
>      }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      insert_unique(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   insert_unique(end(), *__first);
>      }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(iterator __position)
>    {
>      _Link_type __y =
> static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
>    (__position._M_node,
>     this->_M_impl._M_header));
>      destroy_node(__y);
>      --_M_impl._M_node_count;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(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));
>      destroy_node(__y);
>      --_M_impl._M_node_count;
>    }
>
>  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);
>      size_type __n = std::distance(__p.first, __p.second);
>      erase(__p.first, __p.second);
>      return __n;
>    }
>
>  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);
>   destroy_node(__x);
>   __x = __y;
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(iterator __first, 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>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(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>
>    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)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>
>      iterator __j = iterator(__y);
>      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_Link_type __x = _M_begin();
>      _Const_Link_type __y = _M_end();
>
>     while (__x != 0)
>       {
>  if (!_M_impl._M_key_compare(_S_key(__x), __k))
>    __y = __x, __x = _S_left(__x);
>  else
>    __x = _S_right(__x);
>       }
>     const_iterator __j = const_iterator(__y);
>     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;
>    }
>
>  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>::
>    lower_bound(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))
>   __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>::
>    lower_bound(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))
>   __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>::
>    upper_bound(const _Key& __k)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>
>      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>::
>    upper_bound(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(__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>
>    inline
>    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)
>    { return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k)); }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Compare, typename _Alloc>
>    inline
>    pair<typename _Rb_tree<_Key, _Val, _KoV,
>      _Compare, _Alloc>::const_iterator,
>  typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::const_iterator>
>    _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
>    equal_range(const _Key& __k) const
>    { return pair<const_iterator, const_iterator>(lower_bound(__k),
>        upper_bound(__k)); }
>
>  unsigned int
>  _Rb_tree_black_count(const _Rb_tree_node_base* __node,
>                       const _Rb_tree_node_base* __root);
>
>  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;
>    }
>}
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/map" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>namespace std
>{
># 90 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(_Compare(), allocator_type()) { }
>
>
>
>
>
>      explicit
>      map(const _Compare& __comp, const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 174 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      map(const map& __x)
>      : _M_t(__x._M_t) { }
># 186 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      template <typename _InputIterator>
>        map(_InputIterator __first, _InputIterator __last)
> : _M_t(_Compare(), allocator_type())
>        { _M_t.insert_unique(__first, __last); }
># 202 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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, __a)
>        { _M_t.insert_unique(__first, __last); }
># 224 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      map&
>      operator=(const map& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
>
>
>      allocator_type
>      get_allocator() const
>      { return _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(); }
>
>
>
>
>
>      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(); }
># 339 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 361 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 394 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      std::pair<iterator,bool>
>      insert(const value_type& __x)
>      { return _M_t.insert_unique(__x); }
># 418 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      iterator
>      insert(iterator position, const value_type& __x)
>      { return _M_t.insert_unique(position, __x); }
># 430 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      template <typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_unique(__first, __last); }
># 444 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 459 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 474 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 489 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 532 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 547 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 559 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
># 574 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 589 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 628 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_map.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 647 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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>&);
>    };
># 672 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 689 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
>}
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/map" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>namespace std
>{
>
>
>  template <typename _Key, typename _Tp,
>            typename _Compare = std::less<_Key>,
>            typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class multimap;
>
>  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);
>
>  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);
># 106 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    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(_Compare(), allocator_type()) { }
>
>
>
>
>
>      explicit
>      multimap(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 188 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      multimap(const multimap& __x)
>      : _M_t(__x._M_t) { }
># 200 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      template <typename _InputIterator>
>        multimap(_InputIterator __first, _InputIterator __last)
> : _M_t(_Compare(), allocator_type())
>        { _M_t.insert_equal(__first, __last); }
># 216 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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, __a)
>        { _M_t.insert_equal(__first, __last); }
># 239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      multimap&
>      operator=(const multimap& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
>
>
>      allocator_type
>      get_allocator() const
>      { return _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(); }
>
>
>
>      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(); }
># 353 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      iterator
>      insert(const value_type& __x)
>      { return _M_t.insert_equal(__x); }
># 377 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t.insert_equal(__position, __x); }
># 389 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      template <typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_equal(__first, __last); }
># 404 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 419 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 434 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 449 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()); }
># 492 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 507 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 531 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 546 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 583 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multimap.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 600 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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>&);
>  };
># 625 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 642 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/map" 2 3
># 26 "../include/Types.h" 2
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stdexcept" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stdexcept" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stdexcept" 3
>
>
>
>
>namespace std
>{
>
>
>
>
>
>  class logic_error : public exception
>  {
>    string _M_msg;
>
>  public:
>
>    explicit
>    logic_error(const string& __arg);
>
>    virtual
>    ~logic_error() throw();
>
>
>
>    virtual const char*
>    what() const throw();
>  };
>
>
>
>  class domain_error : public logic_error
>  {
>  public:
>    explicit domain_error(const string& __arg);
>  };
>
>
>  class invalid_argument : public logic_error
>  {
>  public:
>    explicit invalid_argument(const string& __arg);
>  };
>
>
>
>  class length_error : public logic_error
>  {
>  public:
>    explicit length_error(const string& __arg);
>  };
>
>
>
>  class out_of_range : public logic_error
>  {
>  public:
>    explicit out_of_range(const string& __arg);
>  };
>
>
>
>
>
>
>  class runtime_error : public exception
>  {
>    string _M_msg;
>
>  public:
>
>    explicit
>    runtime_error(const string& __arg);
>
>    virtual
>    ~runtime_error() throw();
>
>
>
>    virtual const char*
>    what() const throw();
>  };
>
>
>  class range_error : public runtime_error
>  {
>  public:
>    explicit range_error(const string& __arg);
>  };
>
>
>  class overflow_error : public runtime_error
>  {
>  public:
>    explicit overflow_error(const string& __arg);
>  };
>
>
>  class underflow_error : public runtime_error
>  {
>  public:
>    explicit underflow_error(const string& __arg);
>  };
>}
># 27 "../include/Types.h" 2
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/set" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/set" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/set" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>namespace std
>{
>
>  template<class _Key, class _Compare = std::less<_Key>,
>    class _Alloc = std::allocator<_Key> >
>    class set;
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator==(const set<_Key, _Compare, _Alloc>& __x,
>        const set<_Key, _Compare, _Alloc>& __y);
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator<(const set<_Key, _Compare, _Alloc>& __x,
>       const set<_Key, _Compare, _Alloc>& __y);
># 106 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>  template<class _Key, class _Compare, class _Alloc>
>    class set
>    {
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>     
>     
>
>     
>
>    public:
>
>
>
>      typedef _Key key_type;
>      typedef _Key value_type;
>      typedef _Compare key_compare;
>      typedef _Compare value_compare;
>      typedef _Alloc allocator_type;
>
>
>    private:
>      typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;
>
>      typedef _Rb_tree<key_type, value_type, _Identity<value_type>,
>         key_compare, _Key_alloc_type> _Rep_type;
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Key_alloc_type::pointer pointer;
>      typedef typename _Key_alloc_type::const_pointer const_pointer;
>      typedef typename _Key_alloc_type::reference reference;
>      typedef typename _Key_alloc_type::const_reference const_reference;
>
>
>
>      typedef typename _Rep_type::const_iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::const_reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>
>
>
>
>      set()
>      : _M_t(_Compare(), allocator_type()) {}
>
>
>
>
>
>
>
>      explicit
>      set(const _Compare& __comp,
>   const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) {}
># 177 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      template<class _InputIterator>
>        set(_InputIterator __first, _InputIterator __last)
>        : _M_t(_Compare(), allocator_type())
>        { _M_t.insert_unique(__first, __last); }
># 193 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      template<class _InputIterator>
>        set(_InputIterator __first, _InputIterator __last,
>     const _Compare& __comp,
>     const allocator_type& __a = allocator_type())
> : _M_t(__comp, __a)
>        { _M_t.insert_unique(__first, __last); }
># 207 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      set(const set<_Key,_Compare,_Alloc>& __x)
>      : _M_t(__x._M_t) { }
># 217 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      set<_Key,_Compare,_Alloc>&
>      operator=(const set<_Key, _Compare, _Alloc>& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
>
>
>
>
>      key_compare
>      key_comp() const
>      { return _M_t.key_comp(); }
>
>      value_compare
>      value_comp() const
>      { return _M_t.key_comp(); }
>
>      allocator_type
>      get_allocator() const
>      { return _M_t.get_allocator(); }
>
>
>
>
>
>      iterator
>      begin() const
>      { return _M_t.begin(); }
>
>
>
>
>
>      iterator
>      end() const
>      { return _M_t.end(); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin() const
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      reverse_iterator
>      rend() const
>      { return _M_t.rend(); }
>
>
>      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(); }
># 299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      void
>      swap(set<_Key,_Compare,_Alloc>& __x)
>      { _M_t.swap(__x._M_t); }
># 317 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      std::pair<iterator,bool>
>      insert(const value_type& __x)
>      {
> std::pair<typename _Rep_type::iterator, bool> __p =
>   _M_t.insert_unique(__x);
> return std::pair<iterator, bool>(__p.first, __p.second);
>      }
># 344 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t.insert_unique(__position, __x); }
># 356 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      template<class _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_unique(__first, __last); }
># 370 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 385 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 400 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_t.clear(); }
># 424 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
># 442 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
>
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 463 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
>
>      const_iterator
>      lower_bound(const key_type& __x) const
>      { return _M_t.lower_bound(__x); }
># 479 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      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); }
># 504 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
>
>      std::pair<const_iterator, const_iterator>
>      equal_range(const key_type& __x) const
>      { return _M_t.equal_range(__x); }
>
>
>      template<class _K1, class _C1, class _A1>
>        friend bool
>        operator== (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
>
>      template<class _K1, class _C1, class _A1>
>        friend bool
>        operator< (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
>    };
># 533 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator==(const set<_Key, _Compare, _Alloc>& __x,
>        const set<_Key, _Compare, _Alloc>& __y)
>    { return __x._M_t == __y._M_t; }
># 550 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_set.h" 3
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator<(const set<_Key, _Compare, _Alloc>& __x,
>       const set<_Key, _Compare, _Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator!=(const set<_Key, _Compare, _Alloc>& __x,
>        const set<_Key, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator>(const set<_Key, _Compare, _Alloc>& __x,
>       const set<_Key, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator<=(const set<_Key, _Compare, _Alloc>& __x,
>        const set<_Key, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator>=(const set<_Key, _Compare, _Alloc>& __x,
>        const set<_Key, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<class _Key, class _Compare, class _Alloc>
>    inline void
>    swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>}
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/set" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>namespace std
>{
>
>
>  template <class _Key, class _Compare = std::less<_Key>,
>     class _Alloc = std::allocator<_Key> >
>    class multiset;
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator==(const multiset<_Key, _Compare, _Alloc>& __x,
>        const multiset<_Key, _Compare, _Alloc>& __y);
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator<(const multiset<_Key, _Compare, _Alloc>& __x,
>       const multiset<_Key, _Compare, _Alloc>& __y);
># 104 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>  template <class _Key, class _Compare, class _Alloc>
>    class multiset
>    {
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>     
>     
>
>     
>
>    public:
>
>      typedef _Key key_type;
>      typedef _Key value_type;
>      typedef _Compare key_compare;
>      typedef _Compare value_compare;
>      typedef _Alloc allocator_type;
>
>    private:
>
>      typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;
>
>      typedef _Rb_tree<key_type, value_type, _Identity<value_type>,
>         key_compare, _Key_alloc_type> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>      typedef typename _Key_alloc_type::pointer pointer;
>      typedef typename _Key_alloc_type::const_pointer const_pointer;
>      typedef typename _Key_alloc_type::reference reference;
>      typedef typename _Key_alloc_type::const_reference const_reference;
>
>
>
>      typedef typename _Rep_type::const_iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::const_reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>
>
>
>
>
>
>      multiset()
>      : _M_t(_Compare(), allocator_type()) { }
>
>      explicit
>      multiset(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 168 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      template <class _InputIterator>
>        multiset(_InputIterator __first, _InputIterator __last)
> : _M_t(_Compare(), allocator_type())
>        { _M_t.insert_equal(__first, __last); }
># 184 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      template <class _InputIterator>
>        multiset(_InputIterator __first, _InputIterator __last,
>   const _Compare& __comp,
>   const allocator_type& __a = allocator_type())
> : _M_t(__comp, __a)
>        { _M_t.insert_equal(__first, __last); }
># 198 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      multiset(const multiset<_Key,_Compare,_Alloc>& __x)
>      : _M_t(__x._M_t) { }
># 208 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      multiset<_Key,_Compare,_Alloc>&
>      operator=(const multiset<_Key,_Compare,_Alloc>& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
>
>
>
>
>      key_compare
>      key_comp() const
>      { return _M_t.key_comp(); }
>
>      value_compare
>      value_comp() const
>      { return _M_t.key_comp(); }
>
>      allocator_type
>      get_allocator() const
>      { return _M_t.get_allocator(); }
>
>
>
>
>
>
>      iterator
>      begin() const
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      iterator
>      end() const
>      { return _M_t.end(); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin() const
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      reverse_iterator
>      rend() const
>      { return _M_t.rend(); }
>
>
>      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(); }
># 292 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      void
>      swap(multiset<_Key, _Compare, _Alloc>& __x)
>      { _M_t.swap(__x._M_t); }
># 308 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      iterator
>      insert(const value_type& __x)
>      { return _M_t.insert_equal(__x); }
># 332 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t.insert_equal(__position, __x); }
># 344 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      template <class _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_equal(__first, __last); }
># 359 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 374 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 389 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_t.clear(); }
># 410 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.count(__x); }
># 428 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
>
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 449 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
>
>      const_iterator
>      lower_bound(const key_type& __x) const
>      { return _M_t.lower_bound(__x); }
># 465 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      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); }
># 490 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
>
>      std::pair<const_iterator, const_iterator>
>      equal_range(const key_type& __x) const
>      { return _M_t.equal_range(__x); }
>
>      template <class _K1, class _C1, class _A1>
>        friend bool
>        operator== (const multiset<_K1, _C1, _A1>&,
>      const multiset<_K1, _C1, _A1>&);
>
>      template <class _K1, class _C1, class _A1>
>        friend bool
>        operator< (const multiset<_K1, _C1, _A1>&,
>     const multiset<_K1, _C1, _A1>&);
>    };
># 520 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator==(const multiset<_Key, _Compare, _Alloc>& __x,
>        const multiset<_Key, _Compare, _Alloc>& __y)
>    { return __x._M_t == __y._M_t; }
># 537 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_multiset.h" 3
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator<(const multiset<_Key, _Compare, _Alloc>& __x,
>       const multiset<_Key, _Compare, _Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator!=(const multiset<_Key, _Compare, _Alloc>& __x,
>        const multiset<_Key, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator>(const multiset<_Key,_Compare,_Alloc>& __x,
>       const multiset<_Key,_Compare,_Alloc>& __y)
>    { return __y < __x; }
>
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator<=(const multiset<_Key, _Compare, _Alloc>& __x,
>        const multiset<_Key, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline bool
>    operator>=(const multiset<_Key, _Compare, _Alloc>& __x,
>        const multiset<_Key, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template <class _Key, class _Compare, class _Alloc>
>    inline void
>    swap(multiset<_Key, _Compare, _Alloc>& __x,
>  multiset<_Key, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/set" 2 3
># 28 "../include/Types.h" 2
>
># 1 "../include/sqlite3.h" 1
># 37 "../include/sqlite3.h"
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 1 3 4
># 38 "../include/sqlite3.h" 2
>
>
>
>
>
>extern "C" {
># 103 "../include/sqlite3.h"
>extern const char sqlite3_version[];
>const char *sqlite3_libversion(void);
>int sqlite3_libversion_number(void);
># 118 "../include/sqlite3.h"
>typedef struct sqlite3 sqlite3;
># 137 "../include/sqlite3.h"
>  typedef long long int sqlite_int64;
>  typedef unsigned long long int sqlite_uint64;
># 161 "../include/sqlite3.h"
>int sqlite3_close(sqlite3 *);
>
>
>
>
>
>
>typedef int (*sqlite3_callback)(void*,int,char**, char**);
># 214 "../include/sqlite3.h"
>int sqlite3_exec(
>  sqlite3*,
>  const char *sql,
>  int (*callback)(void*,int,char**,char**),
>  void *,
>  char **errmsg
>);
># 323 "../include/sqlite3.h"
>int sqlite3_extended_result_codes(sqlite3*, int onoff);
># 345 "../include/sqlite3.h"
>sqlite_int64 sqlite3_last_insert_rowid(sqlite3*);
># 378 "../include/sqlite3.h"
>int sqlite3_changes(sqlite3*);
># 400 "../include/sqlite3.h"
>int sqlite3_total_changes(sqlite3*);
># 419 "../include/sqlite3.h"
>void sqlite3_interrupt(sqlite3*);
># 439 "../include/sqlite3.h"
>int sqlite3_complete(const char *sql);
>int sqlite3_complete16(const void *sql);
># 506 "../include/sqlite3.h"
>int sqlite3_busy_handler(sqlite3*, int(*)(void*,int), void*);
># 525 "../include/sqlite3.h"
>int sqlite3_busy_timeout(sqlite3*, int ms);
># 574 "../include/sqlite3.h"
>int sqlite3_get_table(
>  sqlite3*,
>  const char *sql,
>  char ***resultp,
>  int *nrow,
>  int *ncolumn,
>  char **errmsg
>);
>void sqlite3_free_table(char **result);
># 673 "../include/sqlite3.h"
>char *sqlite3_mprintf(const char*,...);
>char *sqlite3_vmprintf(const char*, va_list);
>char *sqlite3_snprintf(int,char*,const char*, ...);
># 686 "../include/sqlite3.h"
>void *sqlite3_malloc(int);
>void *sqlite3_realloc(void*, int);
>void sqlite3_free(void*);
># 743 "../include/sqlite3.h"
>int sqlite3_set_authorizer(
>  sqlite3*,
>  int (*xAuth)(void*,int,const char*,const char*,const char*,const char*),
>  void *pUserData
>);
># 828 "../include/sqlite3.h"
>void *sqlite3_trace(sqlite3*, void(*xTrace)(void*,const char*), void*);
>void *sqlite3_profile(sqlite3*,
>   void(*xProfile)(void*,const char*,sqlite_uint64), void*);
># 863 "../include/sqlite3.h"
>void sqlite3_progress_handler(sqlite3*, int, int(*)(void*), void*);
># 889 "../include/sqlite3.h"
>int sqlite3_open(
>  const char *filename,
>  sqlite3 **ppDb
>);
>int sqlite3_open16(
>  const void *filename,
>  sqlite3 **ppDb
>);
># 926 "../include/sqlite3.h"
>int sqlite3_errcode(sqlite3 *db);
>const char *sqlite3_errmsg(sqlite3*);
>const void *sqlite3_errmsg16(sqlite3*);
># 953 "../include/sqlite3.h"
>typedef struct sqlite3_stmt sqlite3_stmt;
># 1019 "../include/sqlite3.h"
>int sqlite3_prepare(
>  sqlite3 *db,
>  const char *zSql,
>  int nBytes,
>  sqlite3_stmt **ppStmt,
>  const char **pzTail
>);
>int sqlite3_prepare_v2(
>  sqlite3 *db,
>  const char *zSql,
>  int nBytes,
>  sqlite3_stmt **ppStmt,
>  const char **pzTail
>);
>int sqlite3_prepare16(
>  sqlite3 *db,
>  const void *zSql,
>  int nBytes,
>  sqlite3_stmt **ppStmt,
>  const void **pzTail
>);
>int sqlite3_prepare16_v2(
>  sqlite3 *db,
>  const void *zSql,
>  int nBytes,
>  sqlite3_stmt **ppStmt,
>  const void **pzTail
>);
># 1056 "../include/sqlite3.h"
>typedef struct Mem sqlite3_value;
># 1065 "../include/sqlite3.h"
>typedef struct sqlite3_context sqlite3_context;
># 1140 "../include/sqlite3.h"
>int sqlite3_bind_blob(sqlite3_stmt*, int, const void*, int n, void(*)(void*));
>int sqlite3_bind_double(sqlite3_stmt*, int, double);
>int sqlite3_bind_int(sqlite3_stmt*, int, int);
>int sqlite3_bind_int64(sqlite3_stmt*, int, sqlite_int64);
>int sqlite3_bind_null(sqlite3_stmt*, int);
>int sqlite3_bind_text(sqlite3_stmt*, int, const char*, int n, void(*)(void*));
>int sqlite3_bind_text16(sqlite3_stmt*, int, const void*, int, void(*)(void*));
>int sqlite3_bind_value(sqlite3_stmt*, int, const sqlite3_value*);
>int sqlite3_bind_zeroblob(sqlite3_stmt*, int, int n);
># 1164 "../include/sqlite3.h"
>int sqlite3_bind_parameter_count(sqlite3_stmt*);
># 1184 "../include/sqlite3.h"
>const char *sqlite3_bind_parameter_name(sqlite3_stmt*, int);
># 1193 "../include/sqlite3.h"
>int sqlite3_bind_parameter_index(sqlite3_stmt*, const char *zName);
># 1203 "../include/sqlite3.h"
>int sqlite3_clear_bindings(sqlite3_stmt*);
># 1213 "../include/sqlite3.h"
>int sqlite3_column_count(sqlite3_stmt *pStmt);
># 1231 "../include/sqlite3.h"
>const char *sqlite3_column_name(sqlite3_stmt*, int N);
>const void *sqlite3_column_name16(sqlite3_stmt*, int N);
># 1262 "../include/sqlite3.h"
>const char *sqlite3_column_database_name(sqlite3_stmt*,int);
>const void *sqlite3_column_database_name16(sqlite3_stmt*,int);
>const char *sqlite3_column_table_name(sqlite3_stmt*,int);
>const void *sqlite3_column_table_name16(sqlite3_stmt*,int);
>const char *sqlite3_column_origin_name(sqlite3_stmt*,int);
>const void *sqlite3_column_origin_name16(sqlite3_stmt*,int);
># 1298 "../include/sqlite3.h"
>const char *sqlite3_column_decltype(sqlite3_stmt *, int i);
>const void *sqlite3_column_decltype16(sqlite3_stmt*,int);
># 1371 "../include/sqlite3.h"
>int sqlite3_step(sqlite3_stmt*);
># 1385 "../include/sqlite3.h"
>int sqlite3_data_count(sqlite3_stmt *pStmt);
># 1538 "../include/sqlite3.h"
>const void *sqlite3_column_blob(sqlite3_stmt*, int iCol);
>int sqlite3_column_bytes(sqlite3_stmt*, int iCol);
>int sqlite3_column_bytes16(sqlite3_stmt*, int iCol);
>double sqlite3_column_double(sqlite3_stmt*, int iCol);
>int sqlite3_column_int(sqlite3_stmt*, int iCol);
>sqlite_int64 sqlite3_column_int64(sqlite3_stmt*, int iCol);
>const unsigned char *sqlite3_column_text(sqlite3_stmt*, int iCol);
>const void *sqlite3_column_text16(sqlite3_stmt*, int iCol);
>int sqlite3_column_type(sqlite3_stmt*, int iCol);
>sqlite3_value *sqlite3_column_value(sqlite3_stmt*, int iCol);
># 1567 "../include/sqlite3.h"
>int sqlite3_finalize(sqlite3_stmt *pStmt);
># 1579 "../include/sqlite3.h"
>int sqlite3_reset(sqlite3_stmt *pStmt);
># 1639 "../include/sqlite3.h"
>int sqlite3_create_function(
>  sqlite3 *,
>  const char *zFunctionName,
>  int nArg,
>  int eTextRep,
>  void*,
>  void (*xFunc)(sqlite3_context*,int,sqlite3_value**),
>  void (*xStep)(sqlite3_context*,int,sqlite3_value**),
>  void (*xFinal)(sqlite3_context*)
>);
>int sqlite3_create_function16(
>  sqlite3*,
>  const void *zFunctionName,
>  int nArg,
>  int eTextRep,
>  void*,
>  void (*xFunc)(sqlite3_context*,int,sqlite3_value**),
>  void (*xStep)(sqlite3_context*,int,sqlite3_value**),
>  void (*xFinal)(sqlite3_context*)
>);
># 1682 "../include/sqlite3.h"
>int sqlite3_aggregate_count(sqlite3_context*);
>int sqlite3_expired(sqlite3_stmt*);
>int sqlite3_transfer_bindings(sqlite3_stmt*, sqlite3_stmt*);
>int sqlite3_global_recover(void);
># 1727 "../include/sqlite3.h"
>const void *sqlite3_value_blob(sqlite3_value*);
>int sqlite3_value_bytes(sqlite3_value*);
>int sqlite3_value_bytes16(sqlite3_value*);
>double sqlite3_value_double(sqlite3_value*);
>int sqlite3_value_int(sqlite3_value*);
>sqlite_int64 sqlite3_value_int64(sqlite3_value*);
>const unsigned char *sqlite3_value_text(sqlite3_value*);
>const void *sqlite3_value_text16(sqlite3_value*);
>const void *sqlite3_value_text16le(sqlite3_value*);
>const void *sqlite3_value_text16be(sqlite3_value*);
>int sqlite3_value_type(sqlite3_value*);
>int sqlite3_value_numeric_type(sqlite3_value*);
># 1758 "../include/sqlite3.h"
>void *sqlite3_aggregate_context(sqlite3_context*, int nBytes);
># 1768 "../include/sqlite3.h"
>void *sqlite3_user_data(sqlite3_context*);
># 1800 "../include/sqlite3.h"
>void *sqlite3_get_auxdata(sqlite3_context*, int);
>void sqlite3_set_auxdata(sqlite3_context*, int, void*, void (*)(void*));
># 1818 "../include/sqlite3.h"
>typedef void (*sqlite3_destructor_type)(void*);
># 1846 "../include/sqlite3.h"
>void sqlite3_result_blob(sqlite3_context*, const void*, int, void(*)(void*));
>void sqlite3_result_double(sqlite3_context*, double);
>void sqlite3_result_error(sqlite3_context*, const char*, int);
>void sqlite3_result_error16(sqlite3_context*, const void*, int);
>void sqlite3_result_error_toobig(sqlite3_context*);
>void sqlite3_result_int(sqlite3_context*, int);
>void sqlite3_result_int64(sqlite3_context*, sqlite_int64);
>void sqlite3_result_null(sqlite3_context*);
>void sqlite3_result_text(sqlite3_context*, const char*, int, void(*)(void*));
>void sqlite3_result_text16(sqlite3_context*, const void*, int, void(*)(void*));
>void sqlite3_result_text16le(sqlite3_context*, const void*, int,void(*)(void*));
>void sqlite3_result_text16be(sqlite3_context*, const void*, int,void(*)(void*));
>void sqlite3_result_value(sqlite3_context*, sqlite3_value*);
>void sqlite3_result_zeroblob(sqlite3_context*, int n);
># 1903 "../include/sqlite3.h"
>int sqlite3_create_collation(
>  sqlite3*,
>  const char *zName,
>  int eTextRep,
>  void*,
>  int(*xCompare)(void*,int,const void*,int,const void*)
>);
>int sqlite3_create_collation_v2(
>  sqlite3*,
>  const char *zName,
>  int eTextRep,
>  void*,
>  int(*xCompare)(void*,int,const void*,int,const void*),
>  void(*xDestroy)(void*)
>);
>int sqlite3_create_collation16(
>  sqlite3*,
>  const char *zName,
>  int eTextRep,
>  void*,
>  int(*xCompare)(void*,int,const void*,int,const void*)
>);
># 1952 "../include/sqlite3.h"
>int sqlite3_collation_needed(
>  sqlite3*,
>  void*,
>  void(*)(void*,sqlite3*,int eTextRep,const char*)
>);
>int sqlite3_collation_needed16(
>  sqlite3*,
>  void*,
>  void(*)(void*,sqlite3*,int eTextRep,const void*)
>);
># 1970 "../include/sqlite3.h"
>int sqlite3_key(
>  sqlite3 *db,
>  const void *pKey, int nKey
>);
># 1983 "../include/sqlite3.h"
>int sqlite3_rekey(
>  sqlite3 *db,
>  const void *pKey, int nKey
>);
># 1999 "../include/sqlite3.h"
>int sqlite3_sleep(int);
># 2015 "../include/sqlite3.h"
>extern char *sqlite3_temp_directory;
># 2025 "../include/sqlite3.h"
>int sqlite3_get_autocommit(sqlite3*);
># 2036 "../include/sqlite3.h"
>sqlite3 *sqlite3_db_handle(sqlite3_stmt*);
># 2061 "../include/sqlite3.h"
>void *sqlite3_commit_hook(sqlite3*, int(*)(void*), void*);
>void *sqlite3_rollback_hook(sqlite3*, void(*)(void *), void*);
># 2088 "../include/sqlite3.h"
>void *sqlite3_update_hook(
>  sqlite3*,
>  void(*)(void *,int ,char const *,char const *,sqlite_int64),
>  void*
>);
># 2135 "../include/sqlite3.h"
>int sqlite3_enable_shared_cache(int);
># 2147 "../include/sqlite3.h"
>int sqlite3_release_memory(int);
># 2178 "../include/sqlite3.h"
>void sqlite3_soft_heap_limit(int);
># 2193 "../include/sqlite3.h"
>void sqlite3_thread_cleanup(void);
># 2259 "../include/sqlite3.h"
>int sqlite3_table_column_metadata(
>  sqlite3 *db,
>  const char *zDbName,
>  const char *zTableName,
>  const char *zColumnName,
>  char const **pzDataType,
>  char const **pzCollSeq,
>  int *pNotNull,
>  int *pPrimaryKey,
>  int *pAutoinc
>);
># 2287 "../include/sqlite3.h"
>int sqlite3_load_extension(
>  sqlite3 *db,
>  const char *zFile,
>  const char *zProc,
>  char **pzErrMsg
>);
># 2306 "../include/sqlite3.h"
>int sqlite3_enable_load_extension(sqlite3 *db, int onoff);
># 2333 "../include/sqlite3.h"
>int sqlite3_auto_extension(void *xEntryPoint);
># 2348 "../include/sqlite3.h"
>void sqlite3_reset_auto_extension(void);
># 2365 "../include/sqlite3.h"
>typedef struct sqlite3_vtab sqlite3_vtab;
>typedef struct sqlite3_index_info sqlite3_index_info;
>typedef struct sqlite3_vtab_cursor sqlite3_vtab_cursor;
>typedef struct sqlite3_module sqlite3_module;
>
>
>
>
>
>
>struct sqlite3_module {
>  int iVersion;
>  int (*xCreate)(sqlite3*, void *pAux,
>               int argc, const char *const*argv,
>               sqlite3_vtab **ppVTab, char**);
>  int (*xConnect)(sqlite3*, void *pAux,
>               int argc, const char *const*argv,
>               sqlite3_vtab **ppVTab, char**);
>  int (*xBestIndex)(sqlite3_vtab *pVTab, sqlite3_index_info*);
>  int (*xDisconnect)(sqlite3_vtab *pVTab);
>  int (*xDestroy)(sqlite3_vtab *pVTab);
>  int (*xOpen)(sqlite3_vtab *pVTab, sqlite3_vtab_cursor **ppCursor);
>  int (*xClose)(sqlite3_vtab_cursor*);
>  int (*xFilter)(sqlite3_vtab_cursor*, int idxNum, const char *idxStr,
>                int argc, sqlite3_value **argv);
>  int (*xNext)(sqlite3_vtab_cursor*);
>  int (*xEof)(sqlite3_vtab_cursor*);
>  int (*xColumn)(sqlite3_vtab_cursor*, sqlite3_context*, int);
>  int (*xRowid)(sqlite3_vtab_cursor*, sqlite_int64 *pRowid);
>  int (*xUpdate)(sqlite3_vtab *, int, sqlite3_value **, sqlite_int64 *);
>  int (*xBegin)(sqlite3_vtab *pVTab);
>  int (*xSync)(sqlite3_vtab *pVTab);
>  int (*xCommit)(sqlite3_vtab *pVTab);
>  int (*xRollback)(sqlite3_vtab *pVTab);
>  int (*xFindFunction)(sqlite3_vtab *pVtab, int nArg, const char *zName,
>                       void (**pxFunc)(sqlite3_context*,int,sqlite3_value**),
>                       void **ppArg);
>};
># 2450 "../include/sqlite3.h"
>struct sqlite3_index_info {
>
>  const int nConstraint;
>  const struct sqlite3_index_constraint {
>     int iColumn;
>     unsigned char op;
>     unsigned char usable;
>     int iTermOffset;
>  } *const aConstraint;
>  const int nOrderBy;
>  const struct sqlite3_index_orderby {
>     int iColumn;
>     unsigned char desc;
>  } *const aOrderBy;
>
>
>  struct sqlite3_index_constraint_usage {
>    int argvIndex;
>    unsigned char omit;
>  } *const aConstraintUsage;
>  int idxNum;
>  char *idxStr;
>  int needToFreeIdxStr;
>  int orderByConsumed;
>  double estimatedCost;
>};
># 2489 "../include/sqlite3.h"
>int sqlite3_create_module(
>  sqlite3 *db,
>  const char *zName,
>  const sqlite3_module *,
>  void *
>);
># 2513 "../include/sqlite3.h"
>struct sqlite3_vtab {
>  const sqlite3_module *pModule;
>  int nRef;
>  char *zErrMsg;
>
>};
># 2529 "../include/sqlite3.h"
>struct sqlite3_vtab_cursor {
>  sqlite3_vtab *pVtab;
>
>};
>
>
>
>
>
>
>int sqlite3_declare_vtab(sqlite3*, const char *zCreateTable);
># 2557 "../include/sqlite3.h"
>int sqlite3_overload_function(sqlite3*, const char *zFuncName, int nArg);
># 2582 "../include/sqlite3.h"
>typedef struct sqlite3_blob sqlite3_blob;
># 2606 "../include/sqlite3.h"
>int sqlite3_blob_open(
>  sqlite3*,
>  const char *zDb,
>  const char *zTable,
>  const char *zColumn,
>  sqlite_int64 iRow,
>  int flags,
>  sqlite3_blob **ppBlob
>);
>
>
>
>
>
>
>int sqlite3_blob_close(sqlite3_blob *);
>
>
>
>
>
>
>
>int sqlite3_blob_bytes(sqlite3_blob *);
># 2643 "../include/sqlite3.h"
>int sqlite3_blob_read(sqlite3_blob *, void *z, int n, int iOffset);
># 2666 "../include/sqlite3.h"
>int sqlite3_blob_write(sqlite3_blob *, const void *z, int n, int iOffset);
># 2677 "../include/sqlite3.h"
>}
># 30 "../include/Types.h" 2
>
># 1 "../include/smart_ptr.h" 1
># 29 "../include/smart_ptr.h"
>class SmartPtrCount
>{
> int m_refCount;
>
>public:
>
>
>
>
> SmartPtrCount()
>  : m_refCount( 1 )
> {
>  ;
> }
>
>
>
>
> virtual ~SmartPtrCount()
> {
>  ;
> }
>
>
>
>
> void IncRef() { m_refCount ++ ; }
>
>
>
>
> void DecRef() { m_refCount -- ; }
>
>
>
>
> int GetRefCount() { return m_refCount; }
>};
># 78 "../include/smart_ptr.h"
>template <class T>
>class SmartPtr
>{
> T* m_data;
> SmartPtrCount* m_ref;
>
>public:
>
>
>
>
> SmartPtr(T* ptr)
> {
>  ;
>
>  CreateFresh( ptr );
> }
>
>
>
>
> SmartPtr()
>  : m_data(__null)
> {
>  ;
>  m_ref = new SmartPtrCount();
> }
>
>
>
>
>
> SmartPtr(const SmartPtr& rhs)
>  : m_data(__null),
>  m_ref(__null)
> {
>  ;
>  *this = rhs;
> }
>
> template<class Y>
> SmartPtr(SmartPtr<Y> const& rhs)
>  : m_data(rhs.m_data),
>  m_ref(rhs.m_ref)
> {
>  ;
>  m_ref->IncRef();
> }
>
>
>
>
>
>
> SmartPtr& operator=(const SmartPtr& rhs)
> {
>  ;
>
>
>  if( m_ref == rhs.m_ref )
>  {
>   ;
>   return *this;
>  }
>
>
>  DeleteRefCount();
>
>
>  if( !rhs.m_ref )
>  {
>   ;
>   return *this;
>  }
>
>  ;
>
>  m_data = rhs.m_data;
>  m_ref = rhs.m_ref;
>  m_ref->IncRef();
>  return *this;
> }
>
>
>
>
> virtual ~SmartPtr()
> {
>  ;
>  DeleteRefCount();
> }
>
>
>
>
>
>
> void reset(T* ptr = 0)
> {
>  DeleteRefCount();
>  CreateFresh( ptr );
> }
>
>
>
>
>
> T* get() const
> {
>  return m_data;
> }
>
>
>
>
>
> T* operator->() const
> {
>  return m_data;
> }
>
>
>
>
>
> T& operator*() const
> {
>  return *(m_data);
> }
>
>
>
>
>
> bool operator!() const
> {
>  return (!m_ref || !m_data);
> }
>
>
>
>
>
> operator bool() const
> {
>  return m_ref && m_data;
> }
>
> void print() const
> {
>  printf("%d: %p (%p)\n", m_ref->GetRefCount(), m_data, this);
> }
>
>private:
> void DeleteRefCount()
> {
>  ;
>
>  if( m_ref )
>  {
>   ;
>   if( m_ref->GetRefCount() <= 1 )
>   {
>    ;
>    delete m_ref;
>    m_ref = __null;
>    delete m_data;
>    m_data = __null;
>   }
>   else
>   {
>    ;
>    m_ref->DecRef();
>   }
>  }
>  else
>  {
>   ;
>  }
> };
>
> void CreateFresh(T* ptr)
> {
>  m_ref = new SmartPtrCount();
>  m_data = ptr;
> }
>
> template<class Y> friend class SmartPtr;
>};
># 32 "../include/Types.h" 2
># 1 "../include/singleton.h" 1
># 9 "../include/singleton.h"
>template <class T> class Singleton
>{
> static T* ms_instance;
>public:
>
>
>
>
> static T* Get();
>
>
>
>
> static void Free();
>
>protected:
>
>
>
> Singleton();
>
>
>
>
> virtual ~Singleton();
>};
>template <class T> T* Singleton<T>::ms_instance = 0;
>
>template <class T> Singleton<T>::Singleton()
>{
>}
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 3
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/localefwd.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/localefwd.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/localefwd.h" 3
>
>
>
>
>
>
>namespace std
>{
>
>  class locale;
>
>
>  template<typename _CharT>
>    inline bool
>    isspace(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isprint(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    iscntrl(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isupper(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    islower(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isalpha(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isdigit(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    ispunct(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isxdigit(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isalnum(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isgraph(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline _CharT
>    toupper(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline _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;
>  class __enc_traits;
>  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;
>
>  template<typename _Facet>
>    bool
>    has_facet(const locale& __loc) throw();
>
>  template<typename _Facet>
>    const _Facet&
>    use_facet(const locale& __loc);
>
>  template<typename _Facet>
>    inline const _Facet&
>    __check_facet(const _Facet* __f)
>    {
>      if (!__f)
> __throw_bad_cast();
>      return *__f;
>    }
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>
>
>
>
>
>
>
>namespace std
>{
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 105 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
># 124 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale() throw();
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale(const locale& __other) throw();
># 143 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    explicit
>    locale(const char* __s);
># 158 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale(const locale& __base, const char* __s, category __cat);
># 171 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale(const locale& __base, const locale& __add, category __cat);
># 183 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    template<typename _Facet>
>      locale(const locale& __other, _Facet* __f);
>
>
>    ~locale() throw();
># 197 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    const locale&
>    operator=(const locale& __other) throw();
># 212 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    template<typename _Facet>
>      locale
>      combine(const locale& __other) const;
>
>
>
>
>
>
>    string
>    name() const;
># 231 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    bool
>    operator==(const locale& __other) const throw ();
>
>
>
>
>
>
>
>    inline bool
>    operator!=(const locale& __other) const throw ()
>    { return !(this->operator==(__other)); }
># 259 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 275 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    static locale
>    global(const locale&);
>
>
>
>
>    static const locale&
>    classic();
>
>  private:
>
>    _Impl* _M_impl;
>
>
>    static _Impl* _S_classic;
>
>
>    static _Impl* _S_global;
>
>
>
>
>
>    static const char* const* const _S_categories;
># 310 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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();
>
>    static category
>    _S_normalize_category(category);
>
>    void
>    _M_coalesce(const locale& __base, const locale& __add, category __cat);
>  };
># 343 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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:
># 374 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>
>    static void
>    _S_destroy_c_locale(__c_locale& __cloc);
>
>
>
>    static __c_locale
>    _S_get_c_locale();
>
>    static const char*
>    _S_get_c_name();
>
>  private:
>    inline void
>    _M_add_reference() const throw()
>    { __gnu_cxx::__atomic_add(&_M_refcount, 1); }
>
>    inline void
>    _M_remove_reference() const throw()
>    {
>      if (__gnu_cxx::__exchange_and_add(&_M_refcount, -1) == 1)
> {
>   try
>     { delete this; }
>   catch (...)
>     { }
> }
>    }
>
>    facet(const facet&);
>
>    facet&
>    operator=(const facet&);
>  };
># 434 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>  };
>
>
>
>  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[];
>
>    inline void
>    _M_add_reference() throw()
>    { __gnu_cxx::__atomic_add(&_M_refcount, 1); }
>
>    inline void
>    _M_remove_reference() throw()
>    {
>      if (__gnu_cxx::__exchange_and_add(&_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&);
>
>    inline 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 = std::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>
>      inline void
>      _M_init_facet(_Facet* __facet)
>      { _M_install_facet(&_Facet::id, __facet); }
>
>    void
>    _M_install_cache(const facet*, size_t);
>  };
>
>  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;
>    }
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 2 3
>
>namespace std
>{
>
>
>
>
>  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, _Ios_Fmtflags __b)
>  { return __a = __a | __b; }
>
>  inline _Ios_Fmtflags&
>  operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
>  { return __a = __a & __b; }
>
>  inline _Ios_Fmtflags&
>  operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
>  { return __a = __a ^ __b; }
>
>  inline _Ios_Fmtflags
>  operator~(_Ios_Fmtflags __a)
>  { return _Ios_Fmtflags(~static_cast<int>(__a)); }
>
>
>  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, _Ios_Openmode __b)
>  { return __a = __a | __b; }
>
>  inline _Ios_Openmode&
>  operator&=(_Ios_Openmode& __a, _Ios_Openmode __b)
>  { return __a = __a & __b; }
>
>  inline _Ios_Openmode&
>  operator^=(_Ios_Openmode& __a, _Ios_Openmode __b)
>  { return __a = __a ^ __b; }
>
>  inline _Ios_Openmode
>  operator~(_Ios_Openmode __a)
>  { return _Ios_Openmode(~static_cast<int>(__a)); }
>
>
>  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, _Ios_Iostate __b)
>  { return __a = __a | __b; }
>
>  inline _Ios_Iostate&
>  operator&=(_Ios_Iostate& __a, _Ios_Iostate __b)
>  { return __a = __a & __b; }
>
>  inline _Ios_Iostate&
>  operator^=(_Ios_Iostate& __a, _Ios_Iostate __b)
>  { return __a = __a ^ __b; }
>
>  inline _Ios_Iostate
>  operator~(_Ios_Iostate __a)
>  { return _Ios_Iostate(~static_cast<int>(__a)); }
>
>  enum _Ios_Seekdir
>    {
>      _S_beg = 0,
>      _S_cur = 1,
>      _S_end = 2,
>      _S_ios_seekdir_end = 1L << 16
>    };
># 201 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    };
># 253 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 328 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 359 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 392 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 418 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    enum event
>    {
>      erase_event,
>      imbue_event,
>      copyfmt_event
>    };
># 435 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    typedef void (*event_callback) (event, ios_base&, int);
># 447 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(&_M_refcount, 1); }
>
>
>      int
>      _M_remove_reference()
>      { return __gnu_cxx::__exchange_and_add(&_M_refcount, -1); }
>    };
>
>     _Callback_list* _M_callbacks;
>
>    void
>    _M_call_callbacks(event __ev) throw();
>
>    void
>    _M_dispose_callbacks(void);
>
>
>    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();
>
>  public:
>
>
>
>
>
>    class Init
>    {
>      friend class ios_base;
>    public:
>      Init();
>      ~Init();
>
>    private:
>      static _Atomic_word _S_refcount;
>      static bool _S_synced_with_stdio;
>    };
>
>
>
>
>
>
>    inline fmtflags
>    flags() const { return _M_flags; }
># 557 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline fmtflags
>    flags(fmtflags __fmtfl)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags = __fmtfl;
>      return __old;
>    }
># 573 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline fmtflags
>    setf(fmtflags __fmtfl)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags |= __fmtfl;
>      return __old;
>    }
># 590 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline fmtflags
>    setf(fmtflags __fmtfl, fmtflags __mask)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags &= ~__mask;
>      _M_flags |= (__fmtfl & __mask);
>      return __old;
>    }
>
>
>
>
>
>
>
>    inline void
>    unsetf(fmtflags __mask) { _M_flags &= ~__mask; }
># 617 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline streamsize
>    precision() const { return _M_precision; }
>
>
>
>
>
>
>    inline streamsize
>    precision(streamsize __prec)
>    {
>      streamsize __old = _M_precision;
>      _M_precision = __prec;
>      return __old;
>    }
>
>
>
>
>
>
>
>    inline streamsize
>    width() const { return _M_width; }
>
>
>
>
>
>
>    inline streamsize
>    width(streamsize __wide)
>    {
>      streamsize __old = _M_width;
>      _M_width = __wide;
>      return __old;
>    }
># 666 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    static bool
>    sync_with_stdio(bool __sync = true);
># 678 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    locale
>    imbue(const locale& __loc);
># 689 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline locale
>    getloc() const { return _M_ios_locale; }
># 699 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline const locale&
>    _M_getloc() const { return _M_ios_locale; }
># 717 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    static int
>    xalloc() throw();
># 733 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline long&
>    iword(int __ix)
>    {
>      _Words& __word = (__ix < _M_word_size)
>   ? _M_word[__ix] : _M_grow_words(__ix, true);
>      return __word._M_iword;
>    }
># 754 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline void*&
>    pword(int __ix)
>    {
>      _Words& __word = (__ix < _M_word_size)
>   ? _M_word[__ix] : _M_grow_words(__ix, false);
>      return __word._M_pword;
>    }
># 771 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    virtual ~ios_base();
>
>  protected:
>    ios_base();
>
>
>
>  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;
>  }
>}
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>
>
>
>
>
>
>namespace std
>{
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin,
>        basic_streambuf<_CharT, _Traits>* __sbout);
># 121 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 144 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      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<>(__streambuf_type* __sbin,
>     __streambuf_type* __sbout);
>
>      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/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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()
>      { }
># 210 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      locale
>      pubimbue(const locale &__loc)
>      {
> locale __tmp(this->getloc());
> this->imbue(__loc);
> _M_buf_locale = __loc;
> return __tmp;
>      }
># 227 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      locale
>      getloc() const
>      { return _M_buf_locale; }
># 240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      __streambuf_type*
>      pubsetbuf(char_type* __s, streamsize __n)
>      { return this->setbuf(__s, __n); }
>
>      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); }
>
>      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(); }
># 267 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      streamsize
>      in_avail()
>      {
> const streamsize __ret = this->egptr() - this->gptr();
> return __ret ? __ret : this->showmanyc();
>      }
># 281 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 321 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 340 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      streamsize
>      sgetn(char_type* __s, streamsize __n)
>      { return this->xsgetn(__s, __n); }
># 354 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 379 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 406 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 432 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      streamsize
>      sputn(const char_type* __s, streamsize __n)
>      { return this->xsputn(__s, __n); }
>
>    protected:
># 446 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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())
>      { }
># 464 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 480 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      gbump(int __n) { _M_in_cur += __n; }
># 491 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 511 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 527 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      pbump(int __n) { _M_out_cur += __n; }
># 537 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      setp(char_type* __pbeg, char_type* __pend)
>      {
> _M_out_beg = _M_out_cur = __pbeg;
> _M_out_end = __pend;
>      }
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual void
>      imbue(const locale&)
>      { }
># 573 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual basic_streambuf<char_type,_Traits>*
>      setbuf(char_type*, streamsize)
>      { return this; }
># 584 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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)); }
># 596 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual pos_type
>      seekpos(pos_type,
>       ios_base::openmode = ios_base::in | ios_base::out)
>      { return pos_type(off_type(-1)); }
># 609 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int
>      sync() { return 0; }
># 631 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual streamsize
>      showmanyc() { return 0; }
># 647 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual streamsize
>      xsgetn(char_type* __s, streamsize __n);
># 669 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      underflow()
>      { return traits_type::eof(); }
># 682 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 706 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      pbackfail(int_type = traits_type::eof())
>      { return traits_type::eof(); }
># 724 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual streamsize
>      xsputn(const char_type* __s, streamsize __n);
># 749 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      overflow(int_type = traits_type::eof())
>      { return traits_type::eof(); }
># 778 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>    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(basic_streambuf<char>* __sbin,
>        basic_streambuf<char>* __sbout);
>
>  template<>
>    streamsize
>    __copy_streambufs(basic_streambuf<wchar_t>* __sbin,
>        basic_streambuf<wchar_t>* __sbout);
>
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf.tcc" 3
>
>namespace std
>{
>  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->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->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(basic_streambuf<_CharT, _Traits>* __sbin,
>        basic_streambuf<_CharT, _Traits>* __sbout)
>    {
>      streamsize __ret = 0;
>      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()))
>     break;
>   ++__ret;
>   __c = __sbin->snextc();
> }
>      return __ret;
>    }
>
>
>
>
>
>  extern template class basic_streambuf<char>;
>  extern template
>    streamsize
>    __copy_streambufs(basic_streambuf<char>*, basic_streambuf<char>*);
>
>
>  extern template class basic_streambuf<wchar_t>;
>  extern template
>    streamsize
>    __copy_streambufs(basic_streambuf<wchar_t>*, basic_streambuf<wchar_t>*);
>
>
>}
># 807 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 2 3
># 50 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf_iterator.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf_iterator.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf_iterator.h" 3
>
>
>
>
>
>
>namespace std
>{
>
>
>  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;
>
>
>    private:
>
>
>
>
>
>
>
>      mutable streambuf_type* _M_sbuf;
>      mutable int_type _M_c;
>
>    public:
>
>      istreambuf_iterator() throw()
>      : _M_sbuf(0), _M_c(traits_type::eof()) { }
>
>
>      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
>      {
> const bool __thiseof = _M_at_eof();
> const bool __beof = __b._M_at_eof();
> return (__thiseof && __beof || (!__thiseof && !__beof));
>      }
>
>    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;
>
>
>    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;
>      }
>    };
>}
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 3
>
>
>
>
># 1 "/usr/include/wctype.h" 1 3 4
># 50 "/usr/include/wctype.h" 3 4
>
>
>
>typedef unsigned long int wctype_t;
>
># 72 "/usr/include/wctype.h" 3 4
>enum
>{
>  __ISwupper = 0,
>  __ISwlower = 1,
>  __ISwalpha = 2,
>  __ISwdigit = 3,
>  __ISwxdigit = 4,
>  __ISwspace = 5,
>  __ISwprint = 6,
>  __ISwgraph = 7,
>  __ISwblank = 8,
>  __ISwcntrl = 9,
>  __ISwpunct = 10,
>  __ISwalnum = 11,
>
>  _ISwupper = ((__ISwupper) < 8 ? (int) ((1UL << (__ISwupper)) << 24) : ((__ISwupper) < 16 ? (int) ((1UL << (__ISwupper)) << 8) : ((__ISwupper) < 24 ? (int) ((1UL << (__ISwupper)) >> 8) : (int) ((1UL << (__ISwupper)) >> 24)))),
>  _ISwlower = ((__ISwlower) < 8 ? (int) ((1UL << (__ISwlower)) << 24) : ((__ISwlower) < 16 ? (int) ((1UL << (__ISwlower)) << 8) : ((__ISwlower) < 24 ? (int) ((1UL << (__ISwlower)) >> 8) : (int) ((1UL << (__ISwlower)) >> 24)))),
>  _ISwalpha = ((__ISwalpha) < 8 ? (int) ((1UL << (__ISwalpha)) << 24) : ((__ISwalpha) < 16 ? (int) ((1UL << (__ISwalpha)) << 8) : ((__ISwalpha) < 24 ? (int) ((1UL << (__ISwalpha)) >> 8) : (int) ((1UL << (__ISwalpha)) >> 24)))),
>  _ISwdigit = ((__ISwdigit) < 8 ? (int) ((1UL << (__ISwdigit)) << 24) : ((__ISwdigit) < 16 ? (int) ((1UL << (__ISwdigit)) << 8) : ((__ISwdigit) < 24 ? (int) ((1UL << (__ISwdigit)) >> 8) : (int) ((1UL << (__ISwdigit)) >> 24)))),
>  _ISwxdigit = ((__ISwxdigit) < 8 ? (int) ((1UL << (__ISwxdigit)) << 24) : ((__ISwxdigit) < 16 ? (int) ((1UL << (__ISwxdigit)) << 8) : ((__ISwxdigit) < 24 ? (int) ((1UL << (__ISwxdigit)) >> 8) : (int) ((1UL << (__ISwxdigit)) >> 24)))),
>  _ISwspace = ((__ISwspace) < 8 ? (int) ((1UL << (__ISwspace)) << 24) : ((__ISwspace) < 16 ? (int) ((1UL << (__ISwspace)) << 8) : ((__ISwspace) < 24 ? (int) ((1UL << (__ISwspace)) >> 8) : (int) ((1UL << (__ISwspace)) >> 24)))),
>  _ISwprint = ((__ISwprint) < 8 ? (int) ((1UL << (__ISwprint)) << 24) : ((__ISwprint) < 16 ? (int) ((1UL << (__ISwprint)) << 8) : ((__ISwprint) < 24 ? (int) ((1UL << (__ISwprint)) >> 8) : (int) ((1UL << (__ISwprint)) >> 24)))),
>  _ISwgraph = ((__ISwgraph) < 8 ? (int) ((1UL << (__ISwgraph)) << 24) : ((__ISwgraph) < 16 ? (int) ((1UL << (__ISwgraph)) << 8) : ((__ISwgraph) < 24 ? (int) ((1UL << (__ISwgraph)) >> 8) : (int) ((1UL << (__ISwgraph)) >> 24)))),
>  _ISwblank = ((__ISwblank) < 8 ? (int) ((1UL << (__ISwblank)) << 24) : ((__ISwblank) < 16 ? (int) ((1UL << (__ISwblank)) << 8) : ((__ISwblank) < 24 ? (int) ((1UL << (__ISwblank)) >> 8) : (int) ((1UL << (__ISwblank)) >> 24)))),
>  _ISwcntrl = ((__ISwcntrl) < 8 ? (int) ((1UL << (__ISwcntrl)) << 24) : ((__ISwcntrl) < 16 ? (int) ((1UL << (__ISwcntrl)) << 8) : ((__ISwcntrl) < 24 ? (int) ((1UL << (__ISwcntrl)) >> 8) : (int) ((1UL << (__ISwcntrl)) >> 24)))),
>  _ISwpunct = ((__ISwpunct) < 8 ? (int) ((1UL << (__ISwpunct)) << 24) : ((__ISwpunct) < 16 ? (int) ((1UL << (__ISwpunct)) << 8) : ((__ISwpunct) < 24 ? (int) ((1UL << (__ISwpunct)) >> 8) : (int) ((1UL << (__ISwpunct)) >> 24)))),
>  _ISwalnum = ((__ISwalnum) < 8 ? (int) ((1UL << (__ISwalnum)) << 24) : ((__ISwalnum) < 16 ? (int) ((1UL << (__ISwalnum)) << 8) : ((__ISwalnum) < 24 ? (int) ((1UL << (__ISwalnum)) >> 8) : (int) ((1UL << (__ISwalnum)) >> 24))))
>};
>
>
>
>extern "C" {
>
>
>
>
>
>
>
>
>extern int iswalnum (wint_t __wc) throw ();
>
>
>
>
>
>extern int iswalpha (wint_t __wc) throw ();
>
>
>extern int iswcntrl (wint_t __wc) throw ();
>
>
>
>extern int iswdigit (wint_t __wc) throw ();
>
>
>
>extern int iswgraph (wint_t __wc) throw ();
>
>
>
>
>extern int iswlower (wint_t __wc) throw ();
>
>
>extern int iswprint (wint_t __wc) throw ();
>
>
>
>
>extern int iswpunct (wint_t __wc) throw ();
>
>
>
>
>extern int iswspace (wint_t __wc) throw ();
>
>
>
>
>extern int iswupper (wint_t __wc) throw ();
>
>
>
>
>extern int iswxdigit (wint_t __wc) throw ();
>
>
>
>
>
>extern int iswblank (wint_t __wc) throw ();
># 172 "/usr/include/wctype.h" 3 4
>extern wctype_t wctype (__const char *__property) throw ();
>
>
>
>extern int iswctype (wint_t __wc, wctype_t __desc) throw ();
>
>
>
>
>
>
>
>
>
>
>typedef __const __int32_t *wctrans_t;
>
>
>
>
>
>
>
>extern wint_t towlower (wint_t __wc) throw ();
>
>
>extern wint_t towupper (wint_t __wc) throw ();
>
>
>}
># 214 "/usr/include/wctype.h" 3 4
>extern "C" {
>
>
>
>
>extern wctrans_t wctrans (__const char *__property) throw ();
>
>
>extern wint_t towctrans (wint_t __wc, wctrans_t __desc) throw ();
>
>
>
>
>
>
>
>
>extern int iswalnum_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>
>extern int iswalpha_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>extern int iswcntrl_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern int iswdigit_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern int iswgraph_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswlower_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>extern int iswprint_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswpunct_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswspace_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswupper_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswxdigit_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswblank_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern wctype_t wctype_l (__const char *__property, __locale_t __locale)
>     throw ();
>
>
>
>extern int iswctype_l (wint_t __wc, wctype_t __desc, __locale_t __locale)
>     throw ();
>
>
>
>
>
>
>
>extern wint_t towlower_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>extern wint_t towupper_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern wctrans_t wctrans_l (__const char *__property, __locale_t __locale)
>     throw ();
>
>
>extern wint_t towctrans_l (wint_t __wc, wctrans_t __desc,
>      __locale_t __locale) throw ();
>
>
>
>}
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 2 3
># 79 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 3
>namespace std
>{
>  using ::wint_t;
>
>  using ::wctype_t;
>  using ::wctrans_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;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
>
>
>
>
>namespace std
>{
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _Tv>
>    void
>    __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err,
>     const __c_locale& __cloc);
>
>
>  template<>
>    void
>    __convert_to_v(const char*, float&, ios_base::iostate&,
>     const __c_locale&);
>
>  template<>
>    void
>    __convert_to_v(const char*, double&, ios_base::iostate&,
>     const __c_locale&);
>
>  template<>
>    void
>    __convert_to_v(const char*, long double&, ios_base::iostate&,
>     const __c_locale&);
>
>
>
>  template<typename _CharT, typename _Traits>
>    struct __pad
>    {
>      static void
>      _S_pad(ios_base& __io, _CharT __fill, _CharT* __news,
>      const _CharT* __olds, const streamsize __newlen,
>      const streamsize __oldlen, const bool __num);
>    };
>
>
>
>
>
>
>  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;
>    }
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_base.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_base.h" 3
>  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;
>  };
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
># 144 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class __ctype_abstract_base : public locale::facet, public ctype_base
>    {
>    public:
>
>
>      typedef _CharT char_type;
># 162 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      bool
>      is(mask __m, char_type __c) const
>      { return this->do_is(__m, __c); }
># 179 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 195 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 211 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 225 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      toupper(char_type __c) const
>      { return this->do_toupper(__c); }
># 240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      toupper(char_type *__lo, const char_type* __hi) const
>      { return this->do_toupper(__lo, __hi); }
># 254 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      tolower(char_type __c) const
>      { return this->do_tolower(__c); }
># 269 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      tolower(char_type* __lo, const char_type* __hi) const
>      { return this->do_tolower(__lo, __hi); }
># 286 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      widen(char __c) const
>      { return this->do_widen(__c); }
># 305 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 324 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char
>      narrow(char_type __c, char __dfault) const
>      { return this->do_narrow(__c, __dfault); }
># 346 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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() { }
># 371 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual bool
>      do_is(mask __m, char_type __c) const = 0;
># 390 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_is(const char_type* __lo, const char_type* __hi,
>     mask* __vec) const = 0;
># 409 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_is(mask __m, const char_type* __lo,
>   const char_type* __hi) const = 0;
># 428 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_not(mask __m, const char_type* __lo,
>    const char_type* __hi) const = 0;
># 446 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const = 0;
># 463 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const = 0;
># 479 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const = 0;
># 496 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const = 0;
># 515 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char) const = 0;
># 536 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi,
>        char_type* __dest) const = 0;
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type, char __dfault) const = 0;
># 582 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char __dfault, char* __dest) const = 0;
>    };
># 605 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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* __dest) const;
>    };
>
>  template<typename _CharT>
>    locale::id ctype<_CharT>::id;
># 674 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
># 711 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);
># 724 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false,
>     size_t __refs = 0);
># 737 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline bool
>      is(mask __m, char __c) const;
># 752 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline const char*
>      is(const char* __lo, const char* __hi, mask* __vec) const;
># 766 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline const char*
>      scan_is(mask __m, const char* __lo, const char* __hi) const;
># 780 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline const char*
>      scan_not(mask __m, const char* __lo, const char* __hi) const;
># 795 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      toupper(char_type __c) const
>      { return this->do_toupper(__c); }
># 812 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      toupper(char_type *__lo, const char_type* __hi) const
>      { return this->do_toupper(__lo, __hi); }
># 828 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      tolower(char_type __c) const
>      { return this->do_tolower(__c); }
># 845 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      tolower(char_type* __lo, const char_type* __hi) const
>      { return this->do_tolower(__lo, __hi); }
># 865 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>      }
># 892 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char*
>      widen(const char* __lo, const char* __hi, char_type* __to) const
>      {
> if (_M_widen_ok == 1)
>   {
>     memcpy(__to, __lo, __hi - __lo);
>     return __hi;
>   }
> if (!_M_widen_ok)
>   _M_widen_init();
> return this->do_widen(__lo, __hi, __to);
>      }
># 923 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 956 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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))
>   {
>     memcpy(__to, __lo, __hi - __lo);
>     return __hi;
>   }
> if (!_M_narrow_ok)
>   _M_narrow_init();
> return this->do_narrow(__lo, __hi, __dfault, __to);
>      }
>
>    protected:
>
>
>      const mask*
>      table() const throw()
>      { return _M_table; }
>
>
>      static const mask*
>      classic_table() throw();
>
>
>
>
>
>
>
>      virtual
>      ~ctype();
># 1003 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const;
># 1020 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
># 1036 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const;
># 1053 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
># 1073 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char __c) const
>      { return __c; }
># 1096 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi, char_type* __dest) const
>      {
> memcpy(__dest, __lo, __hi - __lo);
> return __hi;
>      }
># 1122 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type __c, char) const
>      { return __c; }
># 1148 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char, char* __dest) const
>      {
> memcpy(__dest, __lo, __hi - __lo);
> return __hi;
>      }
>
>    private:
>
>      void _M_widen_init() const
>      {
> char __tmp[sizeof(_M_widen)];
> for (size_t __i = 0; __i < sizeof(_M_widen); ++__i)
>   __tmp[__i] = __i;
> do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen);
>
> _M_widen_ok = 1;
>
> if (memcmp(__tmp, _M_widen, sizeof(_M_widen)))
>   _M_widen_ok = 2;
>      }
>
>
>
>
>      void _M_narrow_init() const
>      {
> char __tmp[sizeof(_M_narrow)];
> for (size_t __i = 0; __i < sizeof(_M_narrow); ++__i)
>   __tmp[__i] = __i;
> do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow);
>
> _M_narrow_ok = 1;
> if (memcmp(__tmp, _M_narrow, sizeof(_M_narrow)))
>   _M_narrow_ok = 2;
> else
>   {
>
>
>     char __c;
>     do_narrow(__tmp, __tmp + 1, 1, &__c);
>     if (__c == 1)
>       _M_narrow_ok = 2;
>   }
>      }
>    };
>
>  template<>
>    const ctype<char>&
>    use_facet<ctype<char> >(const locale& __loc);
># 1212 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 1245 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(size_t __refs = 0);
># 1256 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>
>      virtual
>      ~ctype();
># 1280 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual bool
>      do_is(mask __m, char_type __c) const;
># 1299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;
># 1317 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;
># 1335 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_not(mask __m, const char_type* __lo,
>    const char_type* __hi) const;
># 1352 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const;
># 1369 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
># 1385 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const;
># 1402 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
># 1422 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char) const;
># 1444 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi, char_type* __dest) const;
># 1467 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type, char __dfault) const;
># 1493 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char __dfault, char* __dest) const;
>
>
>      void
>      _M_initialize_ctype();
>    };
>
>  template<>
>    const ctype<wchar_t>&
>    use_facet<ctype<wchar_t> >(const locale& __loc);
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_inline.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_inline.h" 3
>  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;
>  }
># 1509 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
>
>
>  template<typename _CharT>
>    class ctype_byname : public ctype<_CharT>
>    {
>    public:
>      typedef _CharT char_type;
>
>      explicit
>      ctype_byname(const char* __s, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~ctype_byname() { };
>    };
>
>
>  template<>
>    ctype_byname<char>::ctype_byname(const char*, size_t refs);
>
>  template<>
>    ctype_byname<wchar_t>::ctype_byname(const char*, size_t refs);
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 1 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>       
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>
>
>  class codecvt_base
>  {
>  public:
>    enum result
>    {
>      ok,
>      partial,
>      error,
>      noconv
>    };
>  };
># 69 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class __codecvt_abstract_base
>    : public locale::facet, public codecvt_base
>    {
>    public:
>
>      typedef codecvt_base::result result;
>      typedef _InternT intern_type;
>      typedef _ExternT extern_type;
>      typedef _StateT state_type;
># 117 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      result
>      out(state_type& __state, const intern_type* __from,
>   const intern_type* __from_end, const intern_type*& __from_next,
>   extern_type* __to, extern_type* __to_end,
>   extern_type*& __to_next) const
>      {
> return this->do_out(__state, __from, __from_end, __from_next,
>       __to, __to_end, __to_next);
>      }
># 156 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      result
>      unshift(state_type& __state, extern_type* __to, extern_type* __to_end,
>       extern_type*& __to_next) const
>      { return this->do_unshift(__state, __to,__to_end,__to_next); }
># 197 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      result
>      in(state_type& __state, const extern_type* __from,
>  const extern_type* __from_end, const extern_type*& __from_next,
>  intern_type* __to, intern_type* __to_end,
>  intern_type*& __to_next) const
>      {
> return this->do_in(__state, __from, __from_end, __from_next,
>      __to, __to_end, __to_next);
>      }
>
>      int
>      encoding() const throw()
>      { return this->do_encoding(); }
>
>      bool
>      always_noconv() const throw()
>      { return this->do_always_noconv(); }
>
>      int
>      length(state_type& __state, const extern_type* __from,
>      const extern_type* __end, size_t __max) const
>      { return this->do_length(__state, __from, __end, __max); }
>
>      int
>      max_length() const throw()
>      { return this->do_max_length(); }
>
>    protected:
>      explicit
>      __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { }
>
>      virtual
>      ~__codecvt_abstract_base() { }
># 238 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const = 0;
>
>      virtual result
>      do_unshift(state_type& __state, extern_type* __to,
>   extern_type* __to_end, extern_type*& __to_next) const = 0;
>
>      virtual result
>      do_in(state_type& __state, const extern_type* __from,
>     const extern_type* __from_end, const extern_type*& __from_next,
>     intern_type* __to, intern_type* __to_end,
>     intern_type*& __to_next) const = 0;
>
>      virtual int
>      do_encoding() const throw() = 0;
>
>      virtual bool
>      do_always_noconv() const throw() = 0;
>
>      virtual int
>      do_length(state_type&, const extern_type* __from,
>  const extern_type* __end, size_t __max) const = 0;
>
>      virtual int
>      do_max_length() const throw() = 0;
>    };
>
>
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt
>    : public __codecvt_abstract_base<_InternT, _ExternT, _StateT>
>    {
>    public:
>
>      typedef codecvt_base::result result;
>      typedef _InternT intern_type;
>      typedef _ExternT extern_type;
>      typedef _StateT state_type;
>
>    protected:
>      __c_locale _M_c_locale_codecvt;
>
>    public:
>      static locale::id id;
>
>      explicit
>      codecvt(size_t __refs = 0)
>      : __codecvt_abstract_base<_InternT, _ExternT, _StateT> (__refs) { }
>
>      explicit
>      codecvt(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~codecvt() { }
>
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const;
>
>      virtual result
>      do_unshift(state_type& __state, extern_type* __to,
>   extern_type* __to_end, extern_type*& __to_next) const;
>
>      virtual result
>      do_in(state_type& __state, const extern_type* __from,
>     const extern_type* __from_end, const extern_type*& __from_next,
>     intern_type* __to, intern_type* __to_end,
>     intern_type*& __to_next) const;
>
>      virtual int
>      do_encoding() const throw();
>
>      virtual bool
>      do_always_noconv() const throw();
>
>      virtual int
>      do_length(state_type&, const extern_type* __from,
>  const extern_type* __end, size_t __max) const;
>
>      virtual int
>      do_max_length() const throw();
>    };
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    locale::id codecvt<_InternT, _ExternT, _StateT>::id;
>
>
>  template<>
>    class codecvt<char, char, mbstate_t>
>    : public __codecvt_abstract_base<char, char, mbstate_t>
>    {
>    public:
>
>      typedef char intern_type;
>      typedef char extern_type;
>      typedef mbstate_t state_type;
>
>    protected:
>      __c_locale _M_c_locale_codecvt;
>
>    public:
>      static locale::id id;
>
>      explicit
>      codecvt(size_t __refs = 0);
>
>      explicit
>      codecvt(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~codecvt();
>
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const;
>
>      virtual result
>      do_unshift(state_type& __state, extern_type* __to,
>   extern_type* __to_end, extern_type*& __to_next) const;
>
>      virtual result
>      do_in(state_type& __state, const extern_type* __from,
>     const extern_type* __from_end, const extern_type*& __from_next,
>     intern_type* __to, intern_type* __to_end,
>     intern_type*& __to_next) const;
>
>      virtual int
>      do_encoding() const throw();
>
>      virtual bool
>      do_always_noconv() const throw();
>
>      virtual int
>      do_length(state_type&, const extern_type* __from,
>  const extern_type* __end, size_t __max) const;
>
>      virtual int
>      do_max_length() const throw();
>  };
>
>
>
>  template<>
>    class codecvt<wchar_t, char, mbstate_t>
>    : public __codecvt_abstract_base<wchar_t, char, mbstate_t>
>    {
>    public:
>
>      typedef wchar_t intern_type;
>      typedef char extern_type;
>      typedef mbstate_t state_type;
>
>    protected:
>      __c_locale _M_c_locale_codecvt;
>
>    public:
>      static locale::id id;
>
>      explicit
>      codecvt(size_t __refs = 0);
>
>      explicit
>      codecvt(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~codecvt();
>
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const;
>
>      virtual result
>      do_unshift(state_type& __state,
>   extern_type* __to, extern_type* __to_end,
>   extern_type*& __to_next) const;
>
>      virtual result
>      do_in(state_type& __state,
>      const extern_type* __from, const extern_type* __from_end,
>      const extern_type*& __from_next,
>      intern_type* __to, intern_type* __to_end,
>      intern_type*& __to_next) const;
>
>      virtual
>      int do_encoding() const throw();
>
>      virtual
>      bool do_always_noconv() const throw();
>
>      virtual
>      int do_length(state_type&, const extern_type* __from,
>      const extern_type* __end, size_t __max) const;
>
>      virtual int
>      do_max_length() const throw();
>    };
>
>
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>
>    {
>    public:
>      explicit
>      codecvt_byname(const char* __s, size_t __refs = 0)
>      : codecvt<_InternT, _ExternT, _StateT>(__refs)
>      {
> if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>   {
>     this->_S_destroy_c_locale(this->_M_c_locale_codecvt);
>     this->_S_create_c_locale(this->_M_c_locale_codecvt, __s);
>   }
>      }
>
>    protected:
>      virtual
>      ~codecvt_byname() { }
>    };
># 1534 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
>
>
>  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);
>  };
>
>  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(__null), _M_grouping_size(0), _M_use_grouping(false),
>      _M_truename(__null), _M_truename_size(0), _M_falsename(__null),
>      _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;
> }
>    }
># 1656 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(__null)
>      { _M_initialize_numpunct(); }
># 1693 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      numpunct(__cache_type* __cache, size_t __refs = 0)
>      : facet(__refs), _M_data(__cache)
>      { _M_initialize_numpunct(); }
># 1707 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      numpunct(__c_locale __cloc, size_t __refs = 0)
>      : facet(__refs), _M_data(__null)
>      { _M_initialize_numpunct(__cloc); }
># 1721 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      decimal_point() const
>      { return this->do_decimal_point(); }
># 1734 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      thousands_sep() const
>      { return this->do_thousands_sep(); }
># 1765 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string
>      grouping() const
>      { return this->do_grouping(); }
># 1778 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      truename() const
>      { return this->do_truename(); }
># 1791 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      falsename() const
>      { return this->do_falsename(); }
>
>    protected:
>
>      virtual
>      ~numpunct();
># 1808 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_decimal_point() const
>      { return _M_data->_M_decimal_point; }
># 1820 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_thousands_sep() const
>      { return _M_data->_M_thousands_sep; }
># 1833 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string
>      do_grouping() const
>      { return _M_data->_M_grouping; }
># 1846 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_truename() const
>      { return _M_data->_M_truename; }
># 1859 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_falsename() const
>      { return _M_data->_M_falsename; }
>
>
>      void
>      _M_initialize_numpunct(__c_locale __cloc = __null);
>    };
>
>  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 (std::strcmp(__s, "C") != 0 && std::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() { }
>    };
>
>
># 1926 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 1947 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      num_get(size_t __refs = 0) : facet(__refs) { }
># 1973 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 2009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 2068 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
># 2110 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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& __xtrc) const;
>
>      template<typename _ValueT>
>        iter_type
>        _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&,
>         _ValueT& __v) const;
># 2143 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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, iter_type, ios_base&, ios_base::iostate&, long&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>       unsigned short&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      unsigned int&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      unsigned long&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      long long&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      unsigned long long&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      float&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      double&) const;
>
>
>
>
>
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      long double&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      void*&) const;
># 2202 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id num_get<_CharT, _InIter>::id;
># 2219 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
># 2240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      num_put(size_t __refs = 0) : facet(__refs) { }
># 2258 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
># 2300 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   unsigned long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   unsigned long long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
># 2363 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, double __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   long double __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
># 2388 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   const void* __v) const
>      { return this->do_put(__s, __f, __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() { };
># 2436 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, bool __v) const;
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, long __v) const;
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, unsigned long) const;
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, long long __v) const;
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, unsigned long long) const;
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, double __v) const;
>
>
>
>
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, long double __v) const;
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, const void* __v) const;
>
>
>
>
>
>
>
>    };
>
>  template <typename _CharT, typename _OutIter>
>    locale::id num_put<_CharT, _OutIter>::id;
>
>
># 2493 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.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;
># 2520 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      collate(size_t __refs = 0)
>      : facet(__refs), _M_c_locale_collate(_S_get_c_locale())
>      { }
># 2534 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      collate(__c_locale __cloc, size_t __refs = 0)
>      : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc))
>      { }
># 2551 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.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); }
># 2570 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      transform(const _CharT* __lo, const _CharT* __hi) const
>      { return this->do_transform(__lo, __hi); }
># 2584 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.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;
>
>      size_t
>      _M_transform(_CharT*, const _CharT*, size_t) const;
>
>  protected:
>
>      virtual
>      ~collate()
>      { _S_destroy_c_locale(_M_c_locale_collate); }
># 2613 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual int
>      do_compare(const _CharT* __lo1, const _CharT* __hi1,
>   const _CharT* __lo2, const _CharT* __hi2) const;
># 2629 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_transform(const _CharT* __lo, const _CharT* __hi) const;
># 2642 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.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;
>
>  template<>
>    size_t
>    collate<char>::_M_transform(char*, const char*, size_t) const;
>
>
>  template<>
>    int
>    collate<wchar_t>::_M_compare(const wchar_t*, const wchar_t*) const;
>
>  template<>
>    size_t
>    collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const;
>
>
>
>  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 (std::strcmp(__s, "C") != 0 && std::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() { }
>    };
># 2702 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  class time_base
>  {
>  public:
>    enum dateorder { no_order, dmy, mdy, ymd, ydm };
>  };
>
>  template<typename _CharT>
>    struct __timepunct_cache : public locale::facet
>    {
>
>      static const _CharT* _S_timezones[14];
>
>      const _CharT* _M_date_format;
>      const _CharT* _M_date_era_format;
>      const _CharT* _M_time_format;
>      const _CharT* _M_time_era_format;
>      const _CharT* _M_date_time_format;
>      const _CharT* _M_date_time_era_format;
>      const _CharT* _M_am;
>      const _CharT* _M_pm;
>      const _CharT* _M_am_pm_format;
>
>
>      const _CharT* _M_day1;
>      const _CharT* _M_day2;
>      const _CharT* _M_day3;
>      const _CharT* _M_day4;
>      const _CharT* _M_day5;
>      const _CharT* _M_day6;
>      const _CharT* _M_day7;
>
>
>      const _CharT* _M_aday1;
>      const _CharT* _M_aday2;
>      const _CharT* _M_aday3;
>      const _CharT* _M_aday4;
>      const _CharT* _M_aday5;
>      const _CharT* _M_aday6;
>      const _CharT* _M_aday7;
>
>
>      const _CharT* _M_month01;
>      const _CharT* _M_month02;
>      const _CharT* _M_month03;
>      const _CharT* _M_month04;
>      const _CharT* _M_month05;
>      const _CharT* _M_month06;
>      const _CharT* _M_month07;
>      const _CharT* _M_month08;
>      const _CharT* _M_month09;
>      const _CharT* _M_month10;
>      const _CharT* _M_month11;
>      const _CharT* _M_month12;
>
>
>      const _CharT* _M_amonth01;
>      const _CharT* _M_amonth02;
>      const _CharT* _M_amonth03;
>      const _CharT* _M_amonth04;
>      const _CharT* _M_amonth05;
>      const _CharT* _M_amonth06;
>      const _CharT* _M_amonth07;
>      const _CharT* _M_amonth08;
>      const _CharT* _M_amonth09;
>      const _CharT* _M_amonth10;
>      const _CharT* _M_amonth11;
>      const _CharT* _M_amonth12;
>
>      bool _M_allocated;
>
>      __timepunct_cache(size_t __refs = 0) : facet(__refs),
>      _M_date_format(__null), _M_date_era_format(__null), _M_time_format(__null),
>      _M_time_era_format(__null), _M_date_time_format(__null),
>      _M_date_time_era_format(__null), _M_am(__null), _M_pm(__null),
>      _M_am_pm_format(__null), _M_day1(__null), _M_day2(__null), _M_day3(__null),
>      _M_day4(__null), _M_day5(__null), _M_day6(__null), _M_day7(__null),
>      _M_aday1(__null), _M_aday2(__null), _M_aday3(__null), _M_aday4(__null),
>      _M_aday5(__null), _M_aday6(__null), _M_aday7(__null), _M_month01(__null),
>      _M_month02(__null), _M_month03(__null), _M_month04(__null), _M_month05(__null),
>      _M_month06(__null), _M_month07(__null), _M_month08(__null), _M_month09(__null),
>      _M_month10(__null), _M_month11(__null), _M_month12(__null), _M_amonth01(__null),
>      _M_amonth02(__null), _M_amonth03(__null), _M_amonth04(__null),
>      _M_amonth05(__null), _M_amonth06(__null), _M_amonth07(__null),
>      _M_amonth08(__null), _M_amonth09(__null), _M_amonth10(__null),
>      _M_amonth11(__null), _M_amonth12(__null), _M_allocated(false)
>      { }
>
>      ~__timepunct_cache();
>
>      void
>      _M_cache(const locale& __loc);
>
>    private:
>      __timepunct_cache&
>      operator=(const __timepunct_cache&);
>
>      explicit
>      __timepunct_cache(const __timepunct_cache&);
>    };
>
>  template<typename _CharT>
>    __timepunct_cache<_CharT>::~__timepunct_cache()
>    {
>      if (_M_allocated)
> {
>
> }
>    }
>
>
>  template<>
>    const char*
>    __timepunct_cache<char>::_S_timezones[14];
>
>
>  template<>
>    const wchar_t*
>    __timepunct_cache<wchar_t>::_S_timezones[14];
>
>
>
>  template<typename _CharT>
>    const _CharT* __timepunct_cache<_CharT>::_S_timezones[14];
>
>  template<typename _CharT>
>    class __timepunct : public locale::facet
>    {
>    public:
>
>      typedef _CharT __char_type;
>      typedef basic_string<_CharT> __string_type;
>      typedef __timepunct_cache<_CharT> __cache_type;
>
>    protected:
>      __cache_type* _M_data;
>      __c_locale _M_c_locale_timepunct;
>      const char* _M_name_timepunct;
>
>    public:
>
>      static locale::id id;
>
>      explicit
>      __timepunct(size_t __refs = 0);
>
>      explicit
>      __timepunct(__cache_type* __cache, size_t __refs = 0);
># 2860 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0);
>
>
>
>      void
>      _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format,
>      const tm* __tm) const;
>
>      void
>      _M_date_formats(const _CharT** __date) const
>      {
>
> __date[0] = _M_data->_M_date_format;
> __date[1] = _M_data->_M_date_era_format;
>      }
>
>      void
>      _M_time_formats(const _CharT** __time) const
>      {
>
> __time[0] = _M_data->_M_time_format;
> __time[1] = _M_data->_M_time_era_format;
>      }
>
>      void
>      _M_date_time_formats(const _CharT** __dt) const
>      {
>
> __dt[0] = _M_data->_M_date_time_format;
> __dt[1] = _M_data->_M_date_time_era_format;
>      }
>
>      void
>      _M_am_pm_format(const _CharT* __ampm) const
>      { __ampm = _M_data->_M_am_pm_format; }
>
>      void
>      _M_am_pm(const _CharT** __ampm) const
>      {
> __ampm[0] = _M_data->_M_am;
> __ampm[1] = _M_data->_M_pm;
>      }
>
>      void
>      _M_days(const _CharT** __days) const
>      {
> __days[0] = _M_data->_M_day1;
> __days[1] = _M_data->_M_day2;
> __days[2] = _M_data->_M_day3;
> __days[3] = _M_data->_M_day4;
> __days[4] = _M_data->_M_day5;
> __days[5] = _M_data->_M_day6;
> __days[6] = _M_data->_M_day7;
>      }
>
>      void
>      _M_days_abbreviated(const _CharT** __days) const
>      {
> __days[0] = _M_data->_M_aday1;
> __days[1] = _M_data->_M_aday2;
> __days[2] = _M_data->_M_aday3;
> __days[3] = _M_data->_M_aday4;
> __days[4] = _M_data->_M_aday5;
> __days[5] = _M_data->_M_aday6;
> __days[6] = _M_data->_M_aday7;
>      }
>
>      void
>      _M_months(const _CharT** __months) const
>      {
> __months[0] = _M_data->_M_month01;
> __months[1] = _M_data->_M_month02;
> __months[2] = _M_data->_M_month03;
> __months[3] = _M_data->_M_month04;
> __months[4] = _M_data->_M_month05;
> __months[5] = _M_data->_M_month06;
> __months[6] = _M_data->_M_month07;
> __months[7] = _M_data->_M_month08;
> __months[8] = _M_data->_M_month09;
> __months[9] = _M_data->_M_month10;
> __months[10] = _M_data->_M_month11;
> __months[11] = _M_data->_M_month12;
>      }
>
>      void
>      _M_months_abbreviated(const _CharT** __months) const
>      {
> __months[0] = _M_data->_M_amonth01;
> __months[1] = _M_data->_M_amonth02;
> __months[2] = _M_data->_M_amonth03;
> __months[3] = _M_data->_M_amonth04;
> __months[4] = _M_data->_M_amonth05;
> __months[5] = _M_data->_M_amonth06;
> __months[6] = _M_data->_M_amonth07;
> __months[7] = _M_data->_M_amonth08;
> __months[8] = _M_data->_M_amonth09;
> __months[9] = _M_data->_M_amonth10;
> __months[10] = _M_data->_M_amonth11;
> __months[11] = _M_data->_M_amonth12;
>      }
>
>    protected:
>      virtual
>      ~__timepunct();
>
>
>      void
>      _M_initialize_timepunct(__c_locale __cloc = __null);
>    };
>
>  template<typename _CharT>
>    locale::id __timepunct<_CharT>::id;
>
>
>  template<>
>    void
>    __timepunct<char>::_M_initialize_timepunct(__c_locale __cloc);
>
>  template<>
>    void
>    __timepunct<char>::_M_put(char*, size_t, const char*, const tm*) const;
>
>
>  template<>
>    void
>    __timepunct<wchar_t>::_M_initialize_timepunct(__c_locale __cloc);
>
>  template<>
>    void
>    __timepunct<wchar_t>::_M_put(wchar_t*, size_t, const wchar_t*,
>     const tm*) const;
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/time_members.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/time_members.h" 3
>  template<typename _CharT>
>    __timepunct<_CharT>::__timepunct(size_t __refs)
>    : facet(__refs), _M_data(__null), _M_c_locale_timepunct(__null),
>      _M_name_timepunct(_S_get_c_name())
>    { _M_initialize_timepunct(); }
>
>  template<typename _CharT>
>    __timepunct<_CharT>::__timepunct(__cache_type* __cache, size_t __refs)
>    : facet(__refs), _M_data(__cache), _M_c_locale_timepunct(__null),
>      _M_name_timepunct(_S_get_c_name())
>    { _M_initialize_timepunct(); }
>
>  template<typename _CharT>
>    __timepunct<_CharT>::__timepunct(__c_locale __cloc, const char* __s,
>         size_t __refs)
>    : facet(__refs), _M_data(__null), _M_c_locale_timepunct(__null),
>      _M_name_timepunct(__null)
>    {
>      const size_t __len = std::strlen(__s) + 1;
>      char* __tmp = new char[__len];
>      std::memcpy(__tmp, __s, __len);
>      _M_name_timepunct = __tmp;
>
>      try
> { _M_initialize_timepunct(__cloc); }
>      catch(...)
> {
>   delete [] _M_name_timepunct;
>   throw;
> }
>    }
>
>  template<typename _CharT>
>    __timepunct<_CharT>::~__timepunct()
>    {
>      if (_M_name_timepunct != _S_get_c_name())
> delete [] _M_name_timepunct;
>      delete _M_data;
>      _S_destroy_c_locale(_M_c_locale_timepunct);
>    }
># 2996 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
># 3009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _InIter>
>    class time_get : public locale::facet, public time_base
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>
>      typedef basic_string<_CharT> __string_type;
>
>
>      static locale::id id;
># 3031 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      time_get(size_t __refs = 0)
>      : facet (__refs) { }
># 3048 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      dateorder
>      date_order() const
>      { return this->do_date_order(); }
># 3072 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_time(iter_type __beg, iter_type __end, ios_base& __io,
>        ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_time(__beg, __end, __io, __err, __tm); }
># 3097 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_date(iter_type __beg, iter_type __end, ios_base& __io,
>        ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_date(__beg, __end, __io, __err, __tm); }
># 3125 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_weekday(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_weekday(__beg, __end, __io, __err, __tm); }
># 3154 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_monthname(iter_type __beg, iter_type __end, ios_base& __io,
>      ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_monthname(__beg, __end, __io, __err, __tm); }
># 3180 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_year(iter_type __beg, iter_type __end, ios_base& __io,
>        ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_year(__beg, __end, __io, __err, __tm); }
>
>    protected:
>
>      virtual
>      ~time_get() { }
># 3200 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual dateorder
>      do_date_order() const;
># 3218 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_time(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const;
># 3237 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_date(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const;
># 3256 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_weekday(iter_type __beg, iter_type __end, ios_base&,
>       ios_base::iostate& __err, tm* __tm) const;
># 3275 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_monthname(iter_type __beg, iter_type __end, ios_base&,
>         ios_base::iostate& __err, tm* __tm) const;
># 3294 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_year(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const;
>
>
>      iter_type
>      _M_extract_num(iter_type __beg, iter_type __end, int& __member,
>       int __min, int __max, size_t __len,
>       ios_base& __io, ios_base::iostate& __err) const;
>
>
>
>      iter_type
>      _M_extract_name(iter_type __beg, iter_type __end, int& __member,
>        const _CharT** __names, size_t __indexlen,
>        ios_base& __io, ios_base::iostate& __err) const;
>
>
>      iter_type
>      _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,
>       ios_base::iostate& __err, tm* __tm,
>       const _CharT* __format) const;
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id time_get<_CharT, _InIter>::id;
>
>
>  template<typename _CharT, typename _InIter>
>    class time_get_byname : public time_get<_CharT, _InIter>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>
>      explicit
>      time_get_byname(const char*, size_t __refs = 0)
>      : time_get<_CharT, _InIter>(__refs) { }
>
>    protected:
>      virtual
>      ~time_get_byname() { }
>    };
># 3350 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _OutIter>
>    class time_put : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>
>
>
>      static locale::id id;
># 3371 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      time_put(size_t __refs = 0)
>      : facet(__refs) { }
># 3390 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,
>   const _CharT* __beg, const _CharT* __end) const;
># 3410 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __io, char_type __fill,
>   const tm* __tm, char __format, char __mod = 0) const
>      { return this->do_put(__s, __io, __fill, __tm, __format, __mod); }
>
>    protected:
>
>      virtual
>      ~time_put()
>      { }
># 3437 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,
>      char __format, char __mod) const;
>    };
>
>  template<typename _CharT, typename _OutIter>
>    locale::id time_put<_CharT, _OutIter>::id;
>
>
>  template<typename _CharT, typename _OutIter>
>    class time_put_byname : public time_put<_CharT, _OutIter>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>
>      explicit
>      time_put_byname(const char*, size_t __refs = 0)
>      : time_put<_CharT, _OutIter>(__refs)
>      { };
>
>    protected:
>      virtual
>      ~time_put_byname() { }
>    };
># 3475 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  class money_base
>  {
>  public:
>    enum part { none, space, symbol, sign, value };
>    struct pattern { char field[4]; };
>
>    static const pattern _S_default_pattern;
>
>    enum
>    {
>      _S_minus,
>      _S_zero,
>      _S_end = 11
>    };
>
>
>
>    static const char* _S_atoms;
>
>
>
>    static pattern
>    _S_construct_pattern(char __precedes, char __space, char __posn);
>  };
>
>  template<typename _CharT, bool _Intl>
>    struct __moneypunct_cache : public locale::facet
>    {
>      const char* _M_grouping;
>      size_t _M_grouping_size;
>      bool _M_use_grouping;
>      _CharT _M_decimal_point;
>      _CharT _M_thousands_sep;
>      const _CharT* _M_curr_symbol;
>      size_t _M_curr_symbol_size;
>      const _CharT* _M_positive_sign;
>      size_t _M_positive_sign_size;
>      const _CharT* _M_negative_sign;
>      size_t _M_negative_sign_size;
>      int _M_frac_digits;
>      money_base::pattern _M_pos_format;
>      money_base::pattern _M_neg_format;
>
>
>
>
>      _CharT _M_atoms[money_base::_S_end];
>
>      bool _M_allocated;
>
>      __moneypunct_cache(size_t __refs = 0) : facet(__refs),
>      _M_grouping(__null), _M_grouping_size(0), _M_use_grouping(false),
>      _M_decimal_point(_CharT()), _M_thousands_sep(_CharT()),
>      _M_curr_symbol(__null), _M_curr_symbol_size(0),
>      _M_positive_sign(__null), _M_positive_sign_size(0),
>      _M_negative_sign(__null), _M_negative_sign_size(0),
>      _M_frac_digits(0),
>      _M_pos_format(money_base::pattern()),
>      _M_neg_format(money_base::pattern()), _M_allocated(false)
>      { }
>
>      ~__moneypunct_cache();
>
>      void
>      _M_cache(const locale& __loc);
>
>    private:
>      __moneypunct_cache&
>      operator=(const __moneypunct_cache&);
>
>      explicit
>      __moneypunct_cache(const __moneypunct_cache&);
>    };
>
>  template<typename _CharT, bool _Intl>
>    __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache()
>    {
>      if (_M_allocated)
> {
>   delete [] _M_grouping;
>   delete [] _M_curr_symbol;
>   delete [] _M_positive_sign;
>   delete [] _M_negative_sign;
> }
>    }
>
>
>
>
>
>
>
>  template<typename _CharT, bool _Intl>
>    class moneypunct : public locale::facet, public money_base
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      typedef __moneypunct_cache<_CharT, _Intl> __cache_type;
>
>    private:
>      __cache_type* _M_data;
>
>    public:
>
>
>      static const bool intl = _Intl;
>
>      static locale::id id;
># 3596 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(size_t __refs = 0) : facet(__refs), _M_data(__null)
>      { _M_initialize_moneypunct(); }
># 3608 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(__cache_type* __cache, size_t __refs = 0)
>      : facet(__refs), _M_data(__cache)
>      { _M_initialize_moneypunct(); }
># 3623 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0)
>      : facet(__refs), _M_data(__null)
>      { _M_initialize_moneypunct(__cloc, __s); }
># 3637 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      decimal_point() const
>      { return this->do_decimal_point(); }
># 3650 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      thousands_sep() const
>      { return this->do_thousands_sep(); }
># 3679 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string
>      grouping() const
>      { return this->do_grouping(); }
># 3692 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      curr_symbol() const
>      { return this->do_curr_symbol(); }
># 3709 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      positive_sign() const
>      { return this->do_positive_sign(); }
># 3726 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      negative_sign() const
>      { return this->do_negative_sign(); }
># 3742 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      int
>      frac_digits() const
>      { return this->do_frac_digits(); }
># 3777 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      pattern
>      pos_format() const
>      { return this->do_pos_format(); }
>
>      pattern
>      neg_format() const
>      { return this->do_neg_format(); }
>
>
>    protected:
>
>      virtual
>      ~moneypunct();
># 3799 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_decimal_point() const
>      { return _M_data->_M_decimal_point; }
># 3811 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_thousands_sep() const
>      { return _M_data->_M_thousands_sep; }
># 3824 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string
>      do_grouping() const
>      { return _M_data->_M_grouping; }
># 3837 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_curr_symbol() const
>      { return _M_data->_M_curr_symbol; }
># 3850 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_positive_sign() const
>      { return _M_data->_M_positive_sign; }
># 3863 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_negative_sign() const
>      { return _M_data->_M_negative_sign; }
># 3877 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual int
>      do_frac_digits() const
>      { return _M_data->_M_frac_digits; }
># 3891 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual pattern
>      do_pos_format() const
>      { return _M_data->_M_pos_format; }
># 3905 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual pattern
>      do_neg_format() const
>      { return _M_data->_M_neg_format; }
>
>
>       void
>       _M_initialize_moneypunct(__c_locale __cloc = __null,
>    const char* __name = __null);
>    };
>
>  template<typename _CharT, bool _Intl>
>    locale::id moneypunct<_CharT, _Intl>::id;
>
>  template<typename _CharT, bool _Intl>
>    const bool moneypunct<_CharT, _Intl>::intl;
>
>  template<>
>    moneypunct<char, true>::~moneypunct();
>
>  template<>
>    moneypunct<char, false>::~moneypunct();
>
>  template<>
>    void
>    moneypunct<char, true>::_M_initialize_moneypunct(__c_locale, const char*);
>
>  template<>
>    void
>    moneypunct<char, false>::_M_initialize_moneypunct(__c_locale, const char*);
>
>
>  template<>
>    moneypunct<wchar_t, true>::~moneypunct();
>
>  template<>
>    moneypunct<wchar_t, false>::~moneypunct();
>
>  template<>
>    void
>    moneypunct<wchar_t, true>::_M_initialize_moneypunct(__c_locale,
>       const char*);
>
>  template<>
>    void
>    moneypunct<wchar_t, false>::_M_initialize_moneypunct(__c_locale,
>        const char*);
>
>
>
>  template<typename _CharT, bool _Intl>
>    class moneypunct_byname : public moneypunct<_CharT, _Intl>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      static const bool intl = _Intl;
>
>      explicit
>      moneypunct_byname(const char* __s, size_t __refs = 0)
>      : moneypunct<_CharT, _Intl>(__refs)
>      {
> if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>   {
>     __c_locale __tmp;
>     this->_S_create_c_locale(__tmp, __s);
>     this->_M_initialize_moneypunct(__tmp);
>     this->_S_destroy_c_locale(__tmp);
>   }
>      }
>
>    protected:
>      virtual
>      ~moneypunct_byname() { }
>    };
>
>  template<typename _CharT, bool _Intl>
>    const bool moneypunct_byname<_CharT, _Intl>::intl;
>
>
># 3997 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _InIter>
>    class money_get : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>      typedef basic_string<_CharT> string_type;
>
>
>
>      static locale::id id;
># 4019 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      money_get(size_t __refs = 0) : facet(__refs) { }
># 4049 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>   ios_base::iostate& __err, long double& __units) const
>      { return this->do_get(__s, __end, __intl, __io, __err, __units); }
># 4079 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>   ios_base::iostate& __err, string_type& __digits) const
>      { return this->do_get(__s, __end, __intl, __io, __err, __digits); }
>
>    protected:
>
>      virtual
>      ~money_get() { }
># 4102 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>      ios_base::iostate& __err, long double& __units) const;
># 4114 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>      ios_base::iostate& __err, string_type& __digits) const;
># 4125 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      template<bool _Intl>
>        iter_type
>        _M_extract(iter_type __s, iter_type __end, ios_base& __io,
>     ios_base::iostate& __err, string& __digits) const;
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id money_get<_CharT, _InIter>::id;
># 4146 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _OutIter>
>    class money_put : public locale::facet
>    {
>    public:
>
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>      typedef basic_string<_CharT> string_type;
>
>
>
>      static locale::id id;
># 4167 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      money_put(size_t __refs = 0) : facet(__refs) { }
># 4187 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, bool __intl, ios_base& __io,
>   char_type __fill, long double __units) const
>      { return this->do_put(__s, __intl, __io, __fill, __units); }
># 4209 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, bool __intl, ios_base& __io,
>   char_type __fill, const string_type& __digits) const
>      { return this->do_put(__s, __intl, __io, __fill, __digits); }
>
>    protected:
>
>      virtual
>      ~money_put() { }
># 4243 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>      long double __units) const;
># 4266 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>      const string_type& __digits) const;
># 4277 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      template<bool _Intl>
>        iter_type
>        _M_insert(iter_type __s, ios_base& __io, char_type __fill,
>    const string_type& __digits) const;
>    };
>
>  template<typename _CharT, typename _OutIter>
>    locale::id money_put<_CharT, _OutIter>::id;
>
>
>
>
>
>
>  struct messages_base
>  {
>    typedef int catalog;
>  };
># 4316 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class messages : public locale::facet, public messages_base
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>
>    protected:
>
>
>      __c_locale _M_c_locale_messages;
>      const char* _M_name_messages;
>
>    public:
>
>      static locale::id id;
># 4344 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      messages(size_t __refs = 0);
># 4358 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      messages(__c_locale __cloc, const char* __s, size_t __refs = 0);
># 4371 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      catalog
>      open(const basic_string<char>& __s, const locale& __loc) const
>      { return this->do_open(__s, __loc); }
># 4389 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      catalog
>      open(const basic_string<char>&, const locale&, const char*) const;
># 4407 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      get(catalog __c, int __set, int __msgid, const string_type& __s) const
>      { return this->do_get(__c, __set, __msgid, __s); }
># 4418 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      void
>      close(catalog __c) const
>      { return this->do_close(__c); }
>
>    protected:
>
>      virtual
>      ~messages();
># 4438 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual catalog
>      do_open(const basic_string<char>&, const locale&) const;
># 4457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_get(catalog, int, int, const string_type& __dfault) const;
>
>
>
>
>
>
>      virtual void
>      do_close(catalog) const;
>
>
>      char*
>      _M_convert_to_char(const string_type& __msg) const
>      {
>
> return reinterpret_cast<char*>(const_cast<_CharT*>(__msg.c_str()));
>      }
>
>
>      string_type
>      _M_convert_from_char(char*) const
>      {
># 4514 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
> return string_type();
>      }
>     };
>
>  template<typename _CharT>
>    locale::id messages<_CharT>::id;
>
>
>  template<>
>    string
>    messages<char>::do_get(catalog, int, int, const string&) const;
>
>
>  template<>
>    wstring
>    messages<wchar_t>::do_get(catalog, int, int, const wstring&) const;
>
>
>
>   template<typename _CharT>
>    class messages_byname : public messages<_CharT>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      explicit
>      messages_byname(const char* __s, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~messages_byname()
>      { }
>    };
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/messages_members.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/messages_members.h" 3
>  template<typename _CharT>
>     messages<_CharT>::messages(size_t __refs)
>     : facet(__refs), _M_c_locale_messages(_S_get_c_locale()),
>       _M_name_messages(_S_get_c_name())
>     { }
>
>  template<typename _CharT>
>     messages<_CharT>::messages(__c_locale __cloc, const char* __s,
>    size_t __refs)
>     : facet(__refs), _M_c_locale_messages(__null), _M_name_messages(__null)
>     {
>       const size_t __len = std::strlen(__s) + 1;
>       char* __tmp = new char[__len];
>       std::memcpy(__tmp, __s, __len);
>       _M_name_messages = __tmp;
>
>
>       _M_c_locale_messages = _S_clone_c_locale(__cloc);
>     }
>
>  template<typename _CharT>
>    typename messages<_CharT>::catalog
>    messages<_CharT>::open(const basic_string<char>& __s, const locale& __loc,
>      const char* __dir) const
>    {
>      bindtextdomain(__s.c_str(), __dir);
>      return this->do_open(__s, __loc);
>    }
>
>
>  template<typename _CharT>
>    messages<_CharT>::~messages()
>    {
>      if (_M_name_messages != _S_get_c_name())
> delete [] _M_name_messages;
>      _S_destroy_c_locale(_M_c_locale_messages);
>    }
>
>  template<typename _CharT>
>    typename messages<_CharT>::catalog
>    messages<_CharT>::do_open(const basic_string<char>& __s,
>         const locale&) const
>    {
>
>
>      textdomain(__s.c_str());
>      return 0;
>    }
>
>  template<typename _CharT>
>    void
>    messages<_CharT>::do_close(catalog) const
>    { }
>
>
>   template<typename _CharT>
>     messages_byname<_CharT>::messages_byname(const char* __s, size_t __refs)
>     : messages<_CharT>(__refs)
>     {
>       if (this->_M_name_messages != locale::facet::_S_get_c_name())
>  delete [] this->_M_name_messages;
>       char* __tmp = new char[std::strlen(__s) + 1];
>       std::strcpy(__tmp, __s);
>       this->_M_name_messages = __tmp;
>
>       if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>  {
>    this->_S_destroy_c_locale(this->_M_c_locale_messages);
>    this->_S_create_c_locale(this->_M_c_locale_messages, __s);
>  }
>     }
># 4551 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
># 4559 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 2 3
>
>namespace std
>{
>
>
>
>
>
>
>
>  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;
># 78 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      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(); }
># 122 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      iostate
>      rdstate() const
>      { return _M_streambuf_state; }
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 186 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      bool
>      fail() const
>      { return (this->rdstate() & (badbit | failbit)) != 0; }
>
>
>
>
>
>
>
>      bool
>      bad() const
>      { return (this->rdstate() & badbit) != 0; }
># 207 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      iostate
>      exceptions() const
>      { return _M_exception; }
># 242 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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() { }
># 280 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      basic_ostream<_CharT, _Traits>*
>      tie() const
>      { return _M_tie; }
># 292 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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; }
># 332 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      basic_streambuf<_CharT, _Traits>*
>      rdbuf(basic_streambuf<_CharT, _Traits>* __sb);
># 346 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 375 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      char_type
>      fill(char_type __ch)
>      {
> char_type __old = this->fill();
> _M_fill = __ch;
> return __old;
>      }
># 395 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      locale
>      imbue(const locale& __loc);
># 415 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      char
>      narrow(char_type __c, char __dfault) const;
># 433 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      char_type
>      widen(char __c) const;
>
>    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/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 3
>       
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 3
>
>namespace std
>{
>  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>
>    char
>    basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const
>    { return __check_facet(_M_ctype).narrow(__c, __dfault); }
>
>  template<typename _CharT, typename _Traits>
>    _CharT
>    basic_ios<_CharT, _Traits>::widen(char __c) const
>    { return __check_facet(_M_ctype).widen(__c); }
>
>
>  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);
># 159 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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>;
>
>
>}
># 465 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 2 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 2 3
>
>namespace std
>{
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_ostream<_CharT2, _Traits2>&
>        operator<<(basic_ostream<_CharT2, _Traits2>&, _CharT2);
>
>      template<typename _Traits2>
>        friend basic_ostream<char, _Traits2>&
>        operator<<(basic_ostream<char, _Traits2>&, char);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_ostream<_CharT2, _Traits2>&
>        operator<<(basic_ostream<_CharT2, _Traits2>&, const _CharT2*);
>
>      template<typename _Traits2>
>        friend basic_ostream<char, _Traits2>&
>        operator<<(basic_ostream<char, _Traits2>&, const char*);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_ostream<_CharT2, _Traits2>&
>        operator<<(basic_ostream<_CharT2, _Traits2>&, const char*);
># 103 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      explicit
>      basic_ostream(__streambuf_type* __sb)
>      { this->init(__sb); }
>
>
>
>
>
>
>      virtual
>      ~basic_ostream() { }
>
>
>      class sentry;
>      friend class sentry;
># 129 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      inline __ostream_type&
>      operator<<(__ostream_type& (*__pf)(__ostream_type&));
>
>      inline __ostream_type&
>      operator<<(__ios_type& (*__pf)(__ios_type&));
>
>      inline __ostream_type&
>      operator<<(ios_base& (*__pf) (ios_base&));
># 166 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      operator<<(long __n);
>
>      __ostream_type&
>      operator<<(unsigned long __n);
>
>      __ostream_type&
>      operator<<(bool __n);
>
>      __ostream_type&
>      operator<<(short __n);
>
>      __ostream_type&
>      operator<<(unsigned short __n);
>
>      __ostream_type&
>      operator<<(int __n);
>
>      __ostream_type&
>      operator<<(unsigned int __n);
>
>
>      __ostream_type&
>      operator<<(long long __n);
>
>      __ostream_type&
>      operator<<(unsigned long long __n);
>
>
>      __ostream_type&
>      operator<<(double __f);
>
>      __ostream_type&
>      operator<<(float __f);
>
>      __ostream_type&
>      operator<<(long double __f);
>
>      __ostream_type&
>      operator<<(const void* __p);
># 228 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      operator<<(__streambuf_type* __sb);
># 261 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      put(char_type __c);
>
>
>      void
>      _M_write(const char_type* __s, streamsize __n)
>      {
> streamsize __put = this->rdbuf()->sputn(__s, __n);
> if (__put != __n)
>   this->setstate(ios_base::badbit);
>      }
># 289 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      write(const char_type* __s, streamsize __n);
># 302 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      flush();
># 313 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      pos_type
>      tellp();
># 324 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      seekp(pos_type);
># 336 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>       __ostream_type&
>      seekp(off_type, ios_base::seekdir);
>
>    protected:
>      explicit
>      basic_ostream() { }
>    };
># 354 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template <typename _CharT, typename _Traits>
>    class basic_ostream<_CharT, _Traits>::sentry
>    {
>
>      bool _M_ok;
>      basic_ostream<_CharT,_Traits>& _M_os;
>
>    public:
># 373 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      explicit
>      sentry(basic_ostream<_CharT,_Traits>& __os);
># 383 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      ~sentry()
>      {
>
> if (_M_os.flags() & ios_base::unitbuf && !uncaught_exception())
>   {
>
>     if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1)
>       _M_os.setstate(ios_base::badbit);
>   }
>      }
># 401 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      operator bool() const
>      { return _M_ok; }
>    };
># 422 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c);
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, char __c)
>    { return (__out << __out.widen(__c)); }
>
>
>  template <class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, char __c);
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, signed char __c)
>    { return (__out << static_cast<char>(__c)); }
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c)
>    { return (__out << static_cast<char>(__c)); }
># 462 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s);
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits> &
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s);
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, const char* __s);
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s)
>    { return (__out << reinterpret_cast<const char*>(__s)); }
>
>  template<class _Traits>
>    basic_ostream<char, _Traits> &
>    operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s)
>    { return (__out << reinterpret_cast<const char*>(__s)); }
># 496 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    endl(basic_ostream<_CharT, _Traits>& __os)
>    { return flush(__os.put(__os.widen('\n'))); }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    ends(basic_ostream<_CharT, _Traits>& __os)
>    { return __os.put(_CharT()); }
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    flush(basic_ostream<_CharT, _Traits>& __os)
>    { return __os.flush(); }
>
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 3
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 1 3
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace __cxxabiv1
>{
>  class __class_type_info;
>}
># 59 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 3
>namespace std
>{
>
>
>
>
>
>
>  class type_info
>  {
>  public:
>
>
>
>
>    virtual ~type_info();
>
>  private:
>
>    type_info& operator=(const type_info&);
>    type_info(const type_info&);
>
>  protected:
>    const char *__name;
>
>  protected:
>    explicit type_info(const char *__n): __name(__n) { }
>
>  public:
>
>
>
>    const char* name() const
>    { return __name; }
># 105 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 3
>    bool before(const type_info& __arg) const
>    { return __name < __arg.__name; }
>    bool operator==(const type_info& __arg) const
>    { return __name == __arg.__name; }
>
>    bool operator!=(const type_info& __arg) const
>    { return !operator==(__arg); }
>
>
>  public:
>
>    virtual bool __is_pointer_p() const;
>
>    virtual bool __is_function_p() const;
>
>
>
>
>
>
>
>    virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj,
>       unsigned __outer) const;
>
>
>    virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target,
>        void **__obj_ptr) const;
>  };
>
>
>
>
>
>
>  class bad_cast : public exception
>  {
>  public:
>    bad_cast() throw() { }
>
>
>    virtual ~bad_cast() throw();
>  };
>
>
>  class bad_typeid : public exception
>  {
>  public:
>    bad_typeid () throw() { }
>
>
>    virtual ~bad_typeid() throw();
>  };
>}
>
>#pragma GCC visibility pop
>
>}
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 2 3
>
>
>namespace std
>{
>  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);
>    }
># 86 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _Facet>
>    inline 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 && __facets[__i]);
>    }
># 108 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _Facet>
>    inline 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 static_cast<const _Facet&>(*__facets[__i]);
>    }
>
>
>
>  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 = __null;
>     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, bool _Intl>
>    struct __use_cache<__moneypunct_cache<_CharT, _Intl> >
>    {
>      const __moneypunct_cache<_CharT, _Intl>*
>      operator() (const locale& __loc) const
>      {
> const size_t __i = moneypunct<_CharT, _Intl>::id._M_id();
> const locale::facet** __caches = __loc._M_impl->_M_caches;
> if (!__caches[__i])
>   {
>     __moneypunct_cache<_CharT, _Intl>* __tmp = __null;
>     try
>       {
>  __tmp = new __moneypunct_cache<_CharT, _Intl>;
>  __tmp->_M_cache(__loc);
>       }
>     catch(...)
>       {
>  delete __tmp;
>  throw;
>       }
>     __loc._M_impl->_M_install_cache(__tmp, __i);
>   }
> return static_cast<
>   const __moneypunct_cache<_CharT, _Intl>*>(__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);
>
>      _M_grouping_size = __np.grouping().size();
>      char* __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>(__np.grouping()[0]) > 0);
>
>      _M_truename_size = __np.truename().size();
>      _CharT* __truename = new _CharT[_M_truename_size];
>      __np.truename().copy(__truename, _M_truename_size);
>      _M_truename = __truename;
>
>      _M_falsename_size = __np.falsename().size();
>      _CharT* __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);
>    }
>
>  template<typename _CharT, bool _Intl>
>    void
>    __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc)
>    {
>      _M_allocated = true;
>
>      const moneypunct<_CharT, _Intl>& __mp =
> use_facet<moneypunct<_CharT, _Intl> >(__loc);
>
>      _M_grouping_size = __mp.grouping().size();
>      char* __grouping = new char[_M_grouping_size];
>      __mp.grouping().copy(__grouping, _M_grouping_size);
>      _M_grouping = __grouping;
>      _M_use_grouping = (_M_grouping_size
>    && static_cast<signed char>(__mp.grouping()[0]) > 0);
>
>      _M_decimal_point = __mp.decimal_point();
>      _M_thousands_sep = __mp.thousands_sep();
>      _M_frac_digits = __mp.frac_digits();
>
>      _M_curr_symbol_size = __mp.curr_symbol().size();
>      _CharT* __curr_symbol = new _CharT[_M_curr_symbol_size];
>      __mp.curr_symbol().copy(__curr_symbol, _M_curr_symbol_size);
>      _M_curr_symbol = __curr_symbol;
>
>      _M_positive_sign_size = __mp.positive_sign().size();
>      _CharT* __positive_sign = new _CharT[_M_positive_sign_size];
>      __mp.positive_sign().copy(__positive_sign, _M_positive_sign_size);
>      _M_positive_sign = __positive_sign;
>
>      _M_negative_sign_size = __mp.negative_sign().size();
>      _CharT* __negative_sign = new _CharT[_M_negative_sign_size];
>      __mp.negative_sign().copy(__negative_sign, _M_negative_sign_size);
>      _M_negative_sign = __negative_sign;
>
>      _M_pos_format = __mp.pos_format();
>      _M_neg_format = __mp.neg_format();
>
>      const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc);
>      __ct.widen(money_base::_S_atoms,
>   money_base::_S_atoms + money_base::_S_end, _M_atoms);
>    }
># 271 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  static bool
>  __verify_grouping(const char* __grouping, size_t __grouping_size,
>      const string& __grouping_tmp);
>
>
>
>  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* __q;
>      const char_type* __lit_zero = __lit + __num_base::_S_izero;
>      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 if ((__q = __traits_type::find(__lit_zero, 10, __c)))
>     {
>       __xtrc += __num_base::_S_atoms_in[__q - __lit];
>       __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;
>        }
>
>
>      if (__testeof)
>        __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>
>
>  template<typename _ValueT>
>    struct __to_unsigned_type
>    { typedef _ValueT __type; };
>
>  template<>
>    struct __to_unsigned_type<long>
>    { typedef unsigned long __type; };
>
>
>  template<>
>    struct __to_unsigned_type<long long>
>    { typedef unsigned long long __type; };
>
>
>
>
>  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;
> typedef typename __to_unsigned_type<_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;
>     if (numeric_limits<_ValueT>::is_signed)
>       __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;
> const __unsigned_type __max = __negative ?
>   -numeric_limits<_ValueT>::min() : numeric_limits<_ValueT>::max();
> const __unsigned_type __smax = __max / __base;
> __unsigned_type __result = 0;
> const char_type* __q;
> const char_type* __lit_zero = __lit + __num_base::_S_izero;
> 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 if ((__q = __traits_type::find(__lit_zero, __len, __c)))
>       {
>  int __digit = __q - __lit_zero;
>  if (__digit > 15)
>    __digit -= 6;
>  if (__result > __smax)
>    __testfail = true;
>  else
>    {
>      __result *= __base;
>      __testfail |= __result > __max - __digit;
>      __result += __digit;
>      ++__sep_pos;
>    }
>       }
>     else
>
>       break;
>
>     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 (!__testfail && (__sep_pos || __found_zero
>       || __found_grouping.size()))
>   __v = __negative ? -__result : __result;
> else
>   __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, 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 = __l;
>   else
>            __err |= ios_base::failbit;
>        }
>      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;
>   size_t __n;
>   bool __testeof = __beg == __end;
>          for (__n = 0; !__testeof; ++__n)
>            {
>       const char_type __c = *__beg;
>
>       if (__testf)
>  if (__n < __lc->_M_falsename_size)
>    __testf = __c == __lc->_M_falsename[__n];
>  else
>    break;
>
>       if (__testt)
>  if (__n < __lc->_M_truename_size)
>    __testt = __c == __lc->_M_truename[__n];
>  else
>    break;
>
>       if (!__testf && !__testt)
>  break;
>
>       if (++__beg == __end)
>  __testeof = true;
>            }
>   if (__testf && __n == __lc->_M_falsename_size)
>     __v = 0;
>   else if (__testt && __n == __lc->_M_truename_size)
>     __v = 1;
>   else
>     __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, long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  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, unsigned short& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  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, unsigned int& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  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, unsigned long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>
>  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 long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  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, unsigned long long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>
>  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());
>      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());
>      return __beg;
>    }
># 796 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
>      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);
>
>      unsigned long __ul;
>      __beg = _M_extract_int(__beg, __end, __io, __err, __ul);
>
>
>      __io.flags(__fmt);
>
>      if (!(__err & ios_base::failbit))
> __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, true);
>      __len = static_cast<int>(__w);
>    }
>
>
>
>
>
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, long __v, const _CharT* __lit,
>    ios_base::fmtflags __flags)
>    {
>      unsigned long __ul = __v;
>      const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
>      if (__builtin_expect(__basefield != ios_base::oct
>      && __basefield != ios_base::hex, true))
> __ul = __v < 0 ? -__v : __ul;
>      return __int_to_char(__bufend, __ul, __lit, __flags, false);
>    }
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, unsigned long __v, const _CharT* __lit,
>    ios_base::fmtflags __flags)
>    { return __int_to_char(__bufend, __v, __lit, __flags, false); }
>
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, long long __v, const _CharT* __lit,
>    ios_base::fmtflags __flags)
>    {
>      unsigned long long __ull = __v;
>      const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
>      if (__builtin_expect(__basefield != ios_base::oct
>      && __basefield != ios_base::hex, true))
> __ull = __v < 0 ? -__v : __ull;
>      return __int_to_char(__bufend, __ull, __lit, __flags, false);
>    }
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, unsigned long long __v,
>    const _CharT* __lit, ios_base::fmtflags __flags)
>    { return __int_to_char(__bufend, __v, __lit, __flags, false); }
>
>
>
>  template<typename _CharT, typename _ValueT>
>    int
>    __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit,
>    ios_base::fmtflags __flags, bool)
>    {
>      const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
>      _CharT* __buf = __bufend;
>
>      if (__builtin_expect(__basefield != ios_base::oct
>      && __basefield != ios_base::hex, true))
> {
>
>   do
>     {
>       *--__buf = __lit[(__v % 10) + __num_base::_S_odigits];
>       __v /= 10;
>     }
>   while (__v != 0);
> }
>      else if (__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
>      {
> 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));
>
>
>
> int __len = __int_to_char(__cs + __ilen, __v, __lit, __flags);
> __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;
>   }
>
>
> const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
> if (__builtin_expect(__basefield != ios_base::oct
>        && __basefield != ios_base::hex, true))
>   {
>
>     if (__v > 0)
>       {
>  if (__flags & ios_base::showpos
>      && numeric_limits<_ValueT>::is_signed)
>    *--__cs = __lit[__num_base::_S_oplus], ++__len;
>       }
>     else if (__v)
>       *--__cs = __lit[__num_base::_S_ominus], ++__len;
>   }
> else if (__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;
>    }
># 1068 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>
>
> streamsize __prec = __io.precision();
> if (__prec < static_cast<streamsize>(0))
>   __prec = static_cast<streamsize>(6);
>
> const int __max_digits = numeric_limits<_ValueT>::digits10;
>
>
> int __len;
>
> char __fbuf[16];
>
>
>
>
> int __cs_size = __max_digits * 3;
> char* __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>
> __num_base::_S_format_float(__io, __fbuf, __mod);
> __len = std::__convert_from_v(__cs, __cs_size, __fbuf, __v,
>          _S_get_c_locale(), __prec);
>
>
> if (__len >= __cs_size)
>   {
>     __cs_size = __len + 1;
>     __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>     __len = std::__convert_from_v(__cs, __cs_size, __fbuf, __v,
>       _S_get_c_locale(), __prec);
>   }
># 1132 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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);
>
>
> const _CharT __cdec = __ctype.widen('.');
> const _CharT __dec = __lc->_M_decimal_point;
> const _CharT* __p = char_traits<_CharT>::find(__ws, __len, __cdec);
> if (__p)
>   __ws[__p - __ws] = __dec;
>
>
>
>
> if (__lc->_M_use_grouping
>     && (__p || __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, __p, __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))
>     {
>       _CharT* __cs
>  = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>       * __w));
>       _M_pad(__fill, __w, __io, __cs, __name, __len);
>       __name = __cs;
>     }
>   __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, long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill,
>           unsigned long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill,
>           unsigned long long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>
>  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); }
># 1269 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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
>      | ios_base::internal);
>      __io.flags(__flags & __fmt | (ios_base::hex | ios_base::showbase));
>
>      __s = _M_insert_int(__s, __io, __fill,
>     reinterpret_cast<unsigned long>(__v));
>      __io.flags(__flags);
>      return __s;
>    }
>
>  template<typename _CharT, typename _InIter>
>    template<bool _Intl>
>      _InIter
>      money_get<_CharT, _InIter>::
>      _M_extract(iter_type __beg, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, string& __units) const
>      {
> typedef char_traits<_CharT> __traits_type;
> typedef typename string_type::size_type size_type;
> typedef money_base::part part;
> typedef __moneypunct_cache<_CharT, _Intl> __cache_type;
>
> const locale& __loc = __io._M_getloc();
> const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
> __use_cache<__cache_type> __uc;
> const __cache_type* __lc = __uc(__loc);
> const char_type* __lit = __lc->_M_atoms;
>
>
> bool __negative = false;
>
> size_type __sign_size = 0;
>
> const bool __mandatory_sign = (__lc->_M_positive_sign_size
>           && __lc->_M_negative_sign_size);
>
> string __grouping_tmp;
> if (__lc->_M_use_grouping)
>   __grouping_tmp.reserve(32);
>
> int __last_pos = 0;
>
> int __n = 0;
>
> bool __testvalid = true;
>
> bool __testdecfound = false;
>
>
> string __res;
> __res.reserve(32);
>
> const char_type* __lit_zero = __lit + money_base::_S_zero;
> const money_base::pattern __p = __lc->_M_neg_format;
> for (int __i = 0; __i < 4 && __testvalid; ++__i)
>   {
>     const part __which = static_cast<part>(__p.field[__i]);
>     switch (__which)
>       {
>       case money_base::symbol:
>
>
>
>
>  if (__io.flags() & ios_base::showbase || __sign_size > 1
>      || __i == 0
>      || (__i == 1 && (__mandatory_sign
>         || (static_cast<part>(__p.field[0])
>      == money_base::sign)
>         || (static_cast<part>(__p.field[2])
>      == money_base::space)))
>      || (__i == 2 && ((static_cast<part>(__p.field[3])
>          == money_base::value)
>         || __mandatory_sign
>         && (static_cast<part>(__p.field[3])
>      == money_base::sign))))
>    {
>      const size_type __len = __lc->_M_curr_symbol_size;
>      size_type __j = 0;
>      for (; __beg != __end && __j < __len
>      && *__beg == __lc->_M_curr_symbol[__j];
>    ++__beg, ++__j);
>      if (__j != __len
>   && (__j || __io.flags() & ios_base::showbase))
>        __testvalid = false;
>    }
>  break;
>       case money_base::sign:
>
>  if (__lc->_M_positive_sign_size && __beg != __end
>      && *__beg == __lc->_M_positive_sign[0])
>    {
>      __sign_size = __lc->_M_positive_sign_size;
>      ++__beg;
>    }
>  else if (__lc->_M_negative_sign_size && __beg != __end
>    && *__beg == __lc->_M_negative_sign[0])
>    {
>      __negative = true;
>      __sign_size = __lc->_M_negative_sign_size;
>      ++__beg;
>    }
>  else if (__lc->_M_positive_sign_size
>    && !__lc->_M_negative_sign_size)
>
>
>    __negative = true;
>  else if (__mandatory_sign)
>    __testvalid = false;
>  break;
>       case money_base::value:
>
>
>  for (; __beg != __end; ++__beg)
>    {
>      const char_type __c = *__beg;
>      const char_type* __q = __traits_type::find(__lit_zero,
>              10, __c);
>      if (__q != 0)
>        {
>   __res += money_base::_S_atoms[__q - __lit];
>   ++__n;
>        }
>      else if (__c == __lc->_M_decimal_point
>        && !__testdecfound)
>        {
>   __last_pos = __n;
>   __n = 0;
>   __testdecfound = true;
>        }
>      else if (__lc->_M_use_grouping
>        && __c == __lc->_M_thousands_sep
>        && !__testdecfound)
>        {
>   if (__n)
>     {
>
>       __grouping_tmp += static_cast<char>(__n);
>       __n = 0;
>     }
>   else
>     {
>       __testvalid = false;
>       break;
>     }
>        }
>      else
>        break;
>    }
>  if (__res.empty())
>    __testvalid = false;
>  break;
>       case money_base::space:
>
>  if (__beg != __end && __ctype.is(ctype_base::space, *__beg))
>    ++__beg;
>  else
>    __testvalid = false;
>       case money_base::none:
>
>  if (__i != 3)
>    for (; __beg != __end
>    && __ctype.is(ctype_base::space, *__beg); ++__beg);
>  break;
>       }
>   }
>
>
> if (__sign_size > 1 && __testvalid)
>   {
>     const char_type* __sign = __negative ? __lc->_M_negative_sign
>                                          : __lc->_M_positive_sign;
>     size_type __i = 1;
>     for (; __beg != __end && __i < __sign_size
>     && *__beg == __sign[__i]; ++__beg, ++__i);
>
>     if (__i != __sign_size)
>       __testvalid = false;
>   }
>
> if (__testvalid)
>   {
>
>     if (__res.size() > 1)
>       {
>  const size_type __first = __res.find_first_not_of('0');
>  const bool __only_zeros = __first == string::npos;
>  if (__first)
>    __res.erase(0, __only_zeros ? __res.size() - 1 : __first);
>       }
>
>
>     if (__negative && __res[0] != '0')
>       __res.insert(__res.begin(), '-');
>
>
>     if (__grouping_tmp.size())
>       {
>
>  __grouping_tmp += static_cast<char>(__testdecfound ? __last_pos
>                         : __n);
>  if (!std::__verify_grouping(__lc->_M_grouping,
>         __lc->_M_grouping_size,
>         __grouping_tmp))
>    __err |= ios_base::failbit;
>       }
>
>
>     if (__testdecfound && __lc->_M_frac_digits > 0
>  && __n != __lc->_M_frac_digits)
>       __testvalid = false;
>   }
>
>
> if (!__testvalid)
>   __err |= ios_base::failbit;
> else
>   __units.swap(__res);
>
>
> if (__beg == __end)
>   __err |= ios_base::eofbit;
> return __beg;
>      }
># 1527 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _InIter>
>    _InIter
>    money_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,
>    ios_base::iostate& __err, long double& __units) const
>    {
>      string __str;
>      if (__intl)
> __beg = _M_extract<true>(__beg, __end, __io, __err, __str);
>      else
> __beg = _M_extract<false>(__beg, __end, __io, __err, __str);
>      std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale());
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    money_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,
>    ios_base::iostate& __err, string_type& __units) const
>    {
>      typedef typename string::size_type size_type;
>
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>      string __str;
>      const iter_type __ret = __intl ? _M_extract<true>(__beg, __end, __io,
>       __err, __str)
>                              : _M_extract<false>(__beg, __end, __io,
>        __err, __str);
>      const size_type __len = __str.size();
>      if (__len)
> {
>   _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>              * __len));
>   __ctype.widen(__str.data(), __str.data() + __len, __ws);
>   __units.assign(__ws, __len);
> }
>
>      return __ret;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    template<bool _Intl>
>      _OutIter
>      money_put<_CharT, _OutIter>::
>      _M_insert(iter_type __s, ios_base& __io, char_type __fill,
>  const string_type& __digits) const
>      {
> typedef typename string_type::size_type size_type;
> typedef money_base::part part;
> typedef __moneypunct_cache<_CharT, _Intl> __cache_type;
>
> const locale& __loc = __io._M_getloc();
> const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
> __use_cache<__cache_type> __uc;
> const __cache_type* __lc = __uc(__loc);
> const char_type* __lit = __lc->_M_atoms;
>
>
>
> const char_type* __beg = __digits.data();
>
> money_base::pattern __p;
> const char_type* __sign;
> size_type __sign_size;
> if (!(*__beg == __lit[money_base::_S_minus]))
>   {
>     __p = __lc->_M_pos_format;
>     __sign = __lc->_M_positive_sign;
>     __sign_size = __lc->_M_positive_sign_size;
>   }
> else
>   {
>     __p = __lc->_M_neg_format;
>     __sign = __lc->_M_negative_sign;
>     __sign_size = __lc->_M_negative_sign_size;
>     if (__digits.size())
>       ++__beg;
>   }
>
>
> size_type __len = __ctype.scan_not(ctype_base::digit, __beg,
>        __beg + __digits.size()) - __beg;
> if (__len)
>   {
>
>
>
>     string_type __value;
>     __value.reserve(2 * __len);
>
>
>
>     int __paddec = __len - __lc->_M_frac_digits;
>     if (__paddec > 0)
>         {
>  if (__lc->_M_frac_digits < 0)
>    __paddec = __len;
>    if (__lc->_M_grouping_size)
>      {
>      _CharT* __ws =
>          static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>             * 2 * __len));
>        _CharT* __ws_end =
>        std::__add_grouping(__ws, __lc->_M_thousands_sep,
>       __lc->_M_grouping,
>       __lc->_M_grouping_size,
>       __beg, __beg + __paddec);
>      __value.assign(__ws, __ws_end - __ws);
>      }
>    else
>    __value.assign(__beg, __paddec);
>       }
>
>
>     if (__lc->_M_frac_digits > 0)
>       {
>  __value += __lc->_M_decimal_point;
>  if (__paddec >= 0)
>    __value.append(__beg + __paddec, __lc->_M_frac_digits);
>  else
>    {
>
>      __value.append(-__paddec, __lit[money_base::_S_zero]);
>      __value.append(__beg, __len);
>    }
>         }
>
>
>     const ios_base::fmtflags __f = __io.flags()
>                                    & ios_base::adjustfield;
>     __len = __value.size() + __sign_size;
>     __len += ((__io.flags() & ios_base::showbase)
>        ? __lc->_M_curr_symbol_size : 0);
>
>     string_type __res;
>     __res.reserve(2 * __len);
>
>     const size_type __width = static_cast<size_type>(__io.width());
>     const bool __testipad = (__f == ios_base::internal
>         && __len < __width);
>
>     for (int __i = 0; __i < 4; ++__i)
>       {
>  const part __which = static_cast<part>(__p.field[__i]);
>  switch (__which)
>    {
>    case money_base::symbol:
>      if (__io.flags() & ios_base::showbase)
>        __res.append(__lc->_M_curr_symbol,
>       __lc->_M_curr_symbol_size);
>      break;
>    case money_base::sign:
>
>
>
>      if (__sign_size)
>        __res += __sign[0];
>      break;
>    case money_base::value:
>      __res += __value;
>      break;
>    case money_base::space:
>
>
>
>      if (__testipad)
>        __res.append(__width - __len, __fill);
>      else
>        __res += __fill;
>      break;
>    case money_base::none:
>      if (__testipad)
>        __res.append(__width - __len, __fill);
>      break;
>    }
>       }
>
>
>     if (__sign_size > 1)
>       __res.append(__sign + 1, __sign_size - 1);
>
>
>     __len = __res.size();
>     if (__width > __len)
>       {
>  if (__f == ios_base::left)
>
>    __res.append(__width - __len, __fill);
>  else
>
>    __res.insert(0, __width - __len, __fill);
>  __len = __width;
>       }
>
>
>     __s = std::__write(__s, __res.data(), __len);
>   }
> __io.width(0);
> return __s;
>      }
># 1743 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    money_put<_CharT, _OutIter>::
>    do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>    long double __units) const
>    {
>      const locale __loc = __io.getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>
>      int __cs_size = 64;
>      char* __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>
>
>      int __len = std::__convert_from_v(__cs, __cs_size, "%.*Lf", __units,
>     _S_get_c_locale(), 0);
>
>      if (__len >= __cs_size)
> {
>   __cs_size = __len + 1;
>   __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>   __len = std::__convert_from_v(__cs, __cs_size, "%.*Lf", __units,
>     _S_get_c_locale(), 0);
> }
>
>
>
>
>
>
>
>      _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>          * __cs_size));
>      __ctype.widen(__cs, __cs + __len, __ws);
>      const string_type __digits(__ws, __len);
>      return __intl ? _M_insert<true>(__s, __io, __fill, __digits)
>             : _M_insert<false>(__s, __io, __fill, __digits);
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    money_put<_CharT, _OutIter>::
>    do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>    const string_type& __digits) const
>    { return __intl ? _M_insert<true>(__s, __io, __fill, __digits)
>             : _M_insert<false>(__s, __io, __fill, __digits); }
>
>
>
>
>
>
>  template<typename _CharT, typename _InIter>
>    time_base::dateorder
>    time_get<_CharT, _InIter>::do_date_order() const
>    { return time_base::no_order; }
>
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,
>     ios_base::iostate& __err, tm* __tm,
>     const _CharT* __format) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>      const size_t __len = char_traits<_CharT>::length(__format);
>
>      for (size_t __i = 0; __beg != __end && __i < __len && !__err; ++__i)
> {
>   if (__ctype.narrow(__format[__i], 0) == '%')
>     {
>
>       char __c = __ctype.narrow(__format[++__i], 0);
>       int __mem = 0;
>       if (__c == 'E' || __c == 'O')
>  __c = __ctype.narrow(__format[++__i], 0);
>       switch (__c)
>  {
>    const char* __cs;
>    _CharT __wcs[10];
>  case 'a':
>
>    const char_type* __days1[7];
>    __tp._M_days_abbreviated(__days1);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days1,
>       7, __io, __err);
>    break;
>  case 'A':
>
>    const char_type* __days2[7];
>    __tp._M_days(__days2);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days2,
>       7, __io, __err);
>    break;
>  case 'h':
>  case 'b':
>
>    const char_type* __months1[12];
>    __tp._M_months_abbreviated(__months1);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_mon,
>       __months1, 12, __io, __err);
>    break;
>  case 'B':
>
>    const char_type* __months2[12];
>    __tp._M_months(__months2);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_mon,
>       __months2, 12, __io, __err);
>    break;
>  case 'c':
>
>    const char_type* __dt[2];
>    __tp._M_date_time_formats(__dt);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __dt[0]);
>    break;
>  case 'd':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 1, 31, 2,
>      __io, __err);
>    break;
>  case 'e':
>
>
>    if (__ctype.is(ctype_base::space, *__beg))
>      __beg = _M_extract_num(++__beg, __end, __tm->tm_mday, 1, 9,
>        1, __io, __err);
>    else
>      __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 10, 31,
>        2, __io, __err);
>    break;
>  case 'D':
>
>    __cs = "%m/%d/%y";
>    __ctype.widen(__cs, __cs + 9, __wcs);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __wcs);
>    break;
>  case 'H':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 0, 23, 2,
>      __io, __err);
>    break;
>  case 'I':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 1, 12, 2,
>      __io, __err);
>    break;
>  case 'm':
>
>    __beg = _M_extract_num(__beg, __end, __mem, 1, 12, 2,
>      __io, __err);
>    if (!__err)
>      __tm->tm_mon = __mem - 1;
>    break;
>  case 'M':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_min, 0, 59, 2,
>      __io, __err);
>    break;
>  case 'n':
>    if (__ctype.narrow(*__beg, 0) == '\n')
>      ++__beg;
>    else
>      __err |= ios_base::failbit;
>    break;
>  case 'R':
>
>    __cs = "%H:%M";
>    __ctype.widen(__cs, __cs + 6, __wcs);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __wcs);
>    break;
>  case 'S':
>
>
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_sec, 0, 60, 2,
>
>
>
>      __io, __err);
>    break;
>  case 't':
>    if (__ctype.narrow(*__beg, 0) == '\t')
>      ++__beg;
>    else
>      __err |= ios_base::failbit;
>    break;
>  case 'T':
>
>    __cs = "%H:%M:%S";
>    __ctype.widen(__cs, __cs + 9, __wcs);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __wcs);
>    break;
>  case 'x':
>
>    const char_type* __dates[2];
>    __tp._M_date_formats(__dates);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __dates[0]);
>    break;
>  case 'X':
>
>    const char_type* __times[2];
>    __tp._M_time_formats(__times);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __times[0]);
>    break;
>  case 'y':
>  case 'C':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_year, 0, 99, 2,
>      __io, __err);
>    break;
>  case 'Y':
>
>    __beg = _M_extract_num(__beg, __end, __mem, 0, 9999, 4,
>      __io, __err);
>    if (!__err)
>      __tm->tm_year = __mem - 1900;
>    break;
>  case 'Z':
>
>    if (__ctype.is(ctype_base::upper, *__beg))
>      {
>        int __tmp;
>        __beg = _M_extract_name(__beg, __end, __tmp,
>           __timepunct_cache<_CharT>::_S_timezones,
>           14, __io, __err);
>
>
>        if (__beg != __end && !__err && __tmp == 0
>     && (*__beg == __ctype.widen('-')
>         || *__beg == __ctype.widen('+')))
>   {
>     __beg = _M_extract_num(__beg, __end, __tmp, 0, 23, 2,
>       __io, __err);
>     __beg = _M_extract_num(__beg, __end, __tmp, 0, 59, 2,
>       __io, __err);
>   }
>      }
>    else
>      __err |= ios_base::failbit;
>    break;
>  default:
>
>    __err |= ios_base::failbit;
>  }
>     }
>   else
>     {
>
>       if (__format[__i] == *__beg)
>  ++__beg;
>       else
>  __err |= ios_base::failbit;
>     }
> }
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    _M_extract_num(iter_type __beg, iter_type __end, int& __member,
>     int __min, int __max, size_t __len,
>     ios_base& __io, ios_base::iostate& __err) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>
>      int __mult = __len == 2 ? 10 : (__len == 4 ? 1000 : 1);
>
>      ++__min;
>      size_t __i = 0;
>      int __value = 0;
>      for (; __beg != __end && __i < __len; ++__beg, ++__i)
> {
>   const char __c = __ctype.narrow(*__beg, '*');
>   if (__c >= '0' && __c <= '9')
>     {
>       __value = __value * 10 + (__c - '0');
>       const int __valuec = __value * __mult;
>       if (__valuec > __max || __valuec + __mult < __min)
>  break;
>       __mult /= 10;
>     }
>   else
>     break;
> }
>      if (__i == __len)
> __member = __value;
>      else
> __err |= ios_base::failbit;
>      return __beg;
>    }
>
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    _M_extract_name(iter_type __beg, iter_type __end, int& __member,
>      const _CharT** __names, size_t __indexlen,
>      ios_base& __io, ios_base::iostate& __err) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>      int* __matches = static_cast<int*>(__builtin_alloca(sizeof(int)
>         * __indexlen));
>      size_t __nmatches = 0;
>      size_t __pos = 0;
>      bool __testvalid = true;
>      const char_type* __name;
>
>
>
>
>
>      if (__beg != __end)
> {
>   const char_type __c = *__beg;
>   for (size_t __i1 = 0; __i1 < __indexlen; ++__i1)
>     if (__c == __names[__i1][0]
>  || __c == __ctype.toupper(__names[__i1][0]))
>       __matches[__nmatches++] = __i1;
> }
>
>      while (__nmatches > 1)
> {
>
>   size_t __minlen = __traits_type::length(__names[__matches[0]]);
>   for (size_t __i2 = 1; __i2 < __nmatches; ++__i2)
>     __minlen = std::min(__minlen,
>         __traits_type::length(__names[__matches[__i2]]));
>   ++__beg, ++__pos;
>   if (__pos < __minlen && __beg != __end)
>     for (size_t __i3 = 0; __i3 < __nmatches;)
>       {
>  __name = __names[__matches[__i3]];
>  if (!(__name[__pos] == *__beg))
>    __matches[__i3] = __matches[--__nmatches];
>  else
>    ++__i3;
>       }
>   else
>     break;
> }
>
>      if (__nmatches == 1)
> {
>
>   ++__beg, ++__pos;
>   __name = __names[__matches[0]];
>   const size_t __len = __traits_type::length(__name);
>   while (__pos < __len && __beg != __end && __name[__pos] == *__beg)
>     ++__beg, ++__pos;
>
>   if (__len == __pos)
>     __member = __matches[0];
>   else
>     __testvalid = false;
> }
>      else
> __testvalid = false;
>      if (!__testvalid)
> __err |= ios_base::failbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_time(iter_type __beg, iter_type __end, ios_base& __io,
>  ios_base::iostate& __err, tm* __tm) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const char_type* __times[2];
>      __tp._M_time_formats(__times);
>      __beg = _M_extract_via_format(__beg, __end, __io, __err,
>        __tm, __times[0]);
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_date(iter_type __beg, iter_type __end, ios_base& __io,
>  ios_base::iostate& __err, tm* __tm) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const char_type* __dates[2];
>      __tp._M_date_formats(__dates);
>      __beg = _M_extract_via_format(__beg, __end, __io, __err,
>        __tm, __dates[0]);
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_weekday(iter_type __beg, iter_type __end, ios_base& __io,
>     ios_base::iostate& __err, tm* __tm) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>      const char_type* __days[7];
>      __tp._M_days_abbreviated(__days);
>      int __tmpwday;
>      __beg = _M_extract_name(__beg, __end, __tmpwday, __days, 7, __io, __err);
>
>
>
>
>
>
>
>      if (!__err && __beg != __end)
> {
>   size_t __pos = __traits_type::length(__days[__tmpwday]);
>   __tp._M_days(__days);
>   const char_type* __name = __days[__tmpwday];
>   if (__name[__pos] == *__beg)
>     {
>
>       const size_t __len = __traits_type::length(__name);
>       while (__pos < __len && __beg != __end
>       && __name[__pos] == *__beg)
>  ++__beg, ++__pos;
>       if (__len != __pos)
>  __err |= ios_base::failbit;
>     }
> }
>      if (!__err)
> __tm->tm_wday = __tmpwday;
>
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>     }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_monthname(iter_type __beg, iter_type __end,
>                     ios_base& __io, ios_base::iostate& __err, tm* __tm) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>      const char_type* __months[12];
>      __tp._M_months_abbreviated(__months);
>      int __tmpmon;
>      __beg = _M_extract_name(__beg, __end, __tmpmon, __months, 12,
>         __io, __err);
>
>
>
>
>
>
>
>      if (!__err && __beg != __end)
> {
>   size_t __pos = __traits_type::length(__months[__tmpmon]);
>   __tp._M_months(__months);
>   const char_type* __name = __months[__tmpmon];
>   if (__name[__pos] == *__beg)
>     {
>
>       const size_t __len = __traits_type::length(__name);
>       while (__pos < __len && __beg != __end
>       && __name[__pos] == *__beg)
>  ++__beg, ++__pos;
>       if (__len != __pos)
>  __err |= ios_base::failbit;
>     }
> }
>      if (!__err)
> __tm->tm_mon = __tmpmon;
>
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_year(iter_type __beg, iter_type __end, ios_base& __io,
>  ios_base::iostate& __err, tm* __tm) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>      size_t __i = 0;
>      int __value = 0;
>      for (; __beg != __end && __i < 4; ++__beg, ++__i)
> {
>   const char __c = __ctype.narrow(*__beg, '*');
>   if (__c >= '0' && __c <= '9')
>     __value = __value * 10 + (__c - '0');
>   else
>     break;
> }
>      if (__i == 2 || __i == 4)
> __tm->tm_year = __i == 2 ? __value : __value - 1900;
>      else
> __err |= ios_base::failbit;
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    time_put<_CharT, _OutIter>::
>    put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,
> const _CharT* __beg, const _CharT* __end) const
>    {
>      const locale& __loc = __io._M_getloc();
>      ctype<_CharT> const& __ctype = use_facet<ctype<_CharT> >(__loc);
>      for (; __beg != __end; ++__beg)
> if (__ctype.narrow(*__beg, 0) != '%')
>   {
>     *__s = *__beg;
>     ++__s;
>   }
> else if (++__beg != __end)
>   {
>     char __format;
>     char __mod = 0;
>     const char __c = __ctype.narrow(*__beg, 0);
>     if (__c != 'E' && __c != 'O')
>       __format = __c;
>     else if (++__beg != __end)
>       {
>  __mod = __c;
>  __format = __ctype.narrow(*__beg, 0);
>       }
>     else
>       break;
>     __s = this->do_put(__s, __io, __fill, __tm, __format, __mod);
>   }
> else
>   break;
>      return __s;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    time_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type, const tm* __tm,
>    char __format, char __mod) const
>    {
>      const locale& __loc = __io._M_getloc();
>      ctype<_CharT> const& __ctype = use_facet<ctype<_CharT> >(__loc);
>      __timepunct<_CharT> const& __tp = use_facet<__timepunct<_CharT> >(__loc);
>
>
>
>      const size_t __maxlen = 128;
>      char_type* __res =
>       static_cast<char_type*>(__builtin_alloca(sizeof(char_type) * __maxlen));
>
>
>
>
>
>
>      char_type __fmt[4];
>      __fmt[0] = __ctype.widen('%');
>      if (!__mod)
> {
>   __fmt[1] = __format;
>   __fmt[2] = char_type();
> }
>      else
> {
>   __fmt[1] = __mod;
>   __fmt[2] = __format;
>   __fmt[3] = char_type();
> }
>
>      __tp._M_put(__res, __maxlen, __fmt, __tm);
>
>
>      return std::__write(__s, __res, char_traits<char_type>::length(__res));
>    }
>
>
>  template<typename _CharT>
>    int
>    collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const
>    { return 0; }
>
>
>  template<typename _CharT>
>    size_t
>    collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const
>    { 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 __str(__lo, __hi);
>
>      const _CharT* __p = __str.c_str();
>      const _CharT* __pend = __str.data() + __str.length();
>
>      size_t __len = (__hi - __lo) * 2;
>
>      string_type __ret;
>
>
>
>
>      for (;;)
> {
>
>   _CharT* __c =
>     static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __len));
>   size_t __res = _M_transform(__c, __p, __len);
>
>
>   if (__res >= __len)
>     {
>       __len = __res + 1;
>       __c = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>         * __len));
>       __res = _M_transform(__c, __p, __len);
>     }
>
>   __ret.append(__c, __res);
>   __p += char_traits<_CharT>::length(__p);
>   if (__p == __pend)
>     return __ret;
>
>   __p++;
>   __ret.push_back(_CharT());
> }
>    }
>
>  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 >> (numeric_limits<unsigned long>::digits - 7)));
>      return static_cast<long>(__val);
>    }
># 2469 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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,
>       const streamsize __newlen,
>       const streamsize __oldlen, const bool __num)
>    {
>      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, const_cast<_CharT*>(__olds), __oldlen);
>   _Traits::assign(__news + __oldlen, __plen, __fill);
>   return;
> }
>
>      size_t __mod = 0;
>      if (__adjust == ios_base::internal && __num)
> {
>
>
>
>          const locale& __loc = __io._M_getloc();
>   const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>   const bool __testsign = (__ctype.widen('-') == __olds[0]
>       || __ctype.widen('+') == __olds[0]);
>   const bool __testhex = (__ctype.widen('0') == __olds[0]
>      && __oldlen > 1
>      && (__ctype.widen('x') == __olds[1]
>          || __ctype.widen('X') == __olds[1]));
>   if (__testhex)
>     {
>       __news[0] = __olds[0];
>       __news[1] = __olds[1];
>       __mod = 2;
>       __news += 2;
>     }
>   else if (__testsign)
>     {
>       __news[0] = __olds[0];
>       __mod = 1;
>       ++__news;
>     }
>
> }
>      _Traits::assign(__news, __plen, __fill);
>      _Traits::copy(__news + __plen, const_cast<_CharT*>(__olds + __mod),
>      __oldlen - __mod);
>    }
>
>  bool
>  __verify_grouping(const char* __grouping, size_t __grouping_size,
>      const string& __grouping_tmp)
>  {
>    const size_t __n = __grouping_tmp.size() - 1;
>    const size_t __min = std::min(__n, size_t(__grouping_size - 1));
>    size_t __i = __n;
>    bool __test = true;
>
>
>
>
>    for (size_t __j = 0; __j < __min && __test; --__i, ++__j)
>      __test = __grouping_tmp[__i] == __grouping[__j];
>    for (; __i && __test; --__i)
>      __test = __grouping_tmp[__i] == __grouping[__min];
>
>
>
>    if (static_cast<signed char>(__grouping[__min]) > 0)
>      __test &= __grouping_tmp[0] <= __grouping[__min];
>    return __test;
>  }
>
>  template<typename _CharT>
>    _CharT*
>    __add_grouping(_CharT* __s, _CharT __sep,
>     const char* __gbeg, size_t __gsize,
>     const _CharT* __first, const _CharT* __last)
>    {
>      if (__last - __first > *__gbeg
>   && static_cast<signed char>(*__gbeg) > 0)
> {
>   const bool __bump = __gsize != 1;
>   __s = std::__add_grouping(__s, __sep, __gbeg + __bump,
>        __gsize - __bump, __first,
>        __last - *__gbeg);
>   __first = __last - *__gbeg;
>   *__s++ = __sep;
> }
>      do
> *__s++ = *__first++;
>      while (__first != __last);
>      return __s;
>    }
>
>
>
>
>
>  extern template class moneypunct<char, false>;
>  extern template class moneypunct<char, true>;
>  extern template class moneypunct_byname<char, false>;
>  extern template class moneypunct_byname<char, true>;
>  extern template class money_get<char>;
>  extern template class money_put<char>;
>  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 __timepunct<char>;
>  extern template class time_put<char>;
>  extern template class time_put_byname<char>;
>  extern template class time_get<char>;
>  extern template class time_get_byname<char>;
>  extern template class messages<char>;
>  extern template class messages_byname<char>;
>  extern template class ctype_byname<char>;
>  extern template class codecvt_byname<char, char, mbstate_t>;
>  extern template class collate<char>;
>  extern template class collate_byname<char>;
>
>  extern template
>    const codecvt<char, char, mbstate_t>&
>    use_facet<codecvt<char, char, mbstate_t> >(const locale&);
>
>  extern template
>    const collate<char>&
>    use_facet<collate<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
>    const moneypunct<char, true>&
>    use_facet<moneypunct<char, true> >(const locale&);
>
>  extern template
>    const moneypunct<char, false>&
>    use_facet<moneypunct<char, false> >(const locale&);
>
>  extern template
>    const money_put<char>&
>    use_facet<money_put<char> >(const locale&);
>
>  extern template
>    const money_get<char>&
>    use_facet<money_get<char> >(const locale&);
>
>  extern template
>    const __timepunct<char>&
>    use_facet<__timepunct<char> >(const locale&);
>
>  extern template
>    const time_put<char>&
>    use_facet<time_put<char> >(const locale&);
>
>  extern template
>    const time_get<char>&
>    use_facet<time_get<char> >(const locale&);
>
>  extern template
>    const messages<char>&
>    use_facet<messages<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<ctype<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<codecvt<char, char, mbstate_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<collate<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
>    bool
>    has_facet<moneypunct<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_put<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_get<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<__timepunct<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_put<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_get<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<messages<char> >(const locale&);
>
>
>  extern template class moneypunct<wchar_t, false>;
>  extern template class moneypunct<wchar_t, true>;
>  extern template class moneypunct_byname<wchar_t, false>;
>  extern template class moneypunct_byname<wchar_t, true>;
>  extern template class money_get<wchar_t>;
>  extern template class money_put<wchar_t>;
>  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 __timepunct<wchar_t>;
>  extern template class time_put<wchar_t>;
>  extern template class time_put_byname<wchar_t>;
>  extern template class time_get<wchar_t>;
>  extern template class time_get_byname<wchar_t>;
>  extern template class messages<wchar_t>;
>  extern template class messages_byname<wchar_t>;
>  extern template class ctype_byname<wchar_t>;
>  extern template class codecvt_byname<wchar_t, char, mbstate_t>;
>  extern template class collate<wchar_t>;
>  extern template class collate_byname<wchar_t>;
>
>  extern template
>    const codecvt<wchar_t, char, mbstate_t>&
>    use_facet<codecvt<wchar_t, char, mbstate_t> >(locale const&);
>
>  extern template
>    const collate<wchar_t>&
>    use_facet<collate<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
>    const moneypunct<wchar_t, true>&
>    use_facet<moneypunct<wchar_t, true> >(const locale&);
>
>  extern template
>    const moneypunct<wchar_t, false>&
>    use_facet<moneypunct<wchar_t, false> >(const locale&);
>
>  extern template
>    const money_put<wchar_t>&
>    use_facet<money_put<wchar_t> >(const locale&);
>
>  extern template
>    const money_get<wchar_t>&
>    use_facet<money_get<wchar_t> >(const locale&);
>
>  extern template
>    const __timepunct<wchar_t>&
>    use_facet<__timepunct<wchar_t> >(const locale&);
>
>  extern template
>    const time_put<wchar_t>&
>    use_facet<time_put<wchar_t> >(const locale&);
>
>  extern template
>    const time_get<wchar_t>&
>    use_facet<time_get<wchar_t> >(const locale&);
>
>  extern template
>    const messages<wchar_t>&
>    use_facet<messages<wchar_t> >(const locale&);
>
> extern template
>    bool
>    has_facet<ctype<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<codecvt<wchar_t, char, mbstate_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<collate<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&);
>
>  extern template
>    bool
>    has_facet<moneypunct<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_put<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_get<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<__timepunct<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_put<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_get<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<messages<wchar_t> >(const locale&);
>
>
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 2 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 2 3
>
>namespace std
>{
>  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>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(__ostream_type& (*__pf)(__ostream_type&))
>    {
>
>
>
>      return __pf(*this);
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(__ios_type& (*__pf)(__ios_type&))
>    {
>
>
>
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(ios_base& (*__pf)(ios_base&))
>    {
>
>
>
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(bool __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       long __l;
>       const ios_base::fmtflags __fmt = (this->flags()
>      & ios_base::basefield);
>       if (__fmt == ios_base::oct || __fmt == ios_base::hex)
>  __l = static_cast<long>(static_cast<unsigned short>(__n));
>       else
>  __l = static_cast<long>(__n);
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __l).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(unsigned short __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(),
>      static_cast<unsigned long>(__n)).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(int __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       long __l;
>       const ios_base::fmtflags __fmt = (this->flags()
>      & ios_base::basefield);
>       if (__fmt == ios_base::oct || __fmt == ios_base::hex)
>  __l = static_cast<long>(static_cast<unsigned int>(__n));
>       else
>  __l = static_cast<long>(__n);
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __l).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(unsigned int __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(),
>      static_cast<unsigned long>(__n)).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(unsigned long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(long long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(unsigned long long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(float __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(),
>      static_cast<double>(__n)).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(double __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(long double __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(const void* __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   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<<(__streambuf_type* __sbin)
>    {
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this);
>      if (__cerb && __sbin)
> {
>   try
>     {
>       if (!__copy_streambufs(__sbin, this->rdbuf()))
>  __err |= ios_base::failbit;
>     }
>   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::iostate(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 (...)
>     { 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 (...)
>     { 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::iostate(ios_base::goodbit);
>      try
> {
>   if (this->rdbuf() && this->rdbuf()->pubsync() == -1)
>     __err |= ios_base::badbit;
> }
>      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(...)
> { 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::iostate(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(...)
> { 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::iostate(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(...)
> { 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, _CharT __c)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = 1;
>       _CharT* __cs = &__c;
>       if (__w > __len)
>  {
>    __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>              * __w));
>    __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       &__c, __w, __len, false);
>    __len = __w;
>  }
>       __out._M_write(__cs, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      return __out;
>    }
>
>
>  template <class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, char __c)
>    {
>      typedef basic_ostream<char, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = 1;
>       char* __cs = &__c;
>       if (__w > __len)
>  {
>    __cs = static_cast<char*>(__builtin_alloca(__w));
>    __pad<char, _Traits>::_S_pad(__out, __out.fill(), __cs,
>            &__c, __w, __len, false);
>    __len = __w;
>  }
>       __out._M_write(__cs, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      return __out;
>     }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb && __s)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = static_cast<streamsize>(_Traits::length(__s));
>       if (__w > __len)
>  {
>    _CharT* __cs = (static_cast<
>      _CharT*>(__builtin_alloca(sizeof(_CharT)
>           * __w)));
>    __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       __s, __w, __len, false);
>    __s = __cs;
>    __len = __w;
>  }
>       __out._M_write(__s, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      else if (!__s)
> __out.setstate(ios_base::badbit);
>      return __out;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>
>
>
>      typedef char_traits<char> __traits_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb && __s)
> {
>   size_t __clen = __traits_type::length(__s);
>   _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>              * __clen));
>   for (size_t __i = 0; __i < __clen; ++__i)
>     __ws[__i] = __out.widen(__s[__i]);
>   _CharT* __str = __ws;
>
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = static_cast<streamsize>(__clen);
>       if (__w > __len)
>  {
>    _CharT* __cs = (static_cast<
>      _CharT*>(__builtin_alloca(sizeof(_CharT)
>           * __w)));
>    __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       __ws, __w, __len, false);
>    __str = __cs;
>    __len = __w;
>  }
>       __out._M_write(__str, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      else if (!__s)
> __out.setstate(ios_base::badbit);
>      return __out;
>    }
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, const char* __s)
>    {
>      typedef basic_ostream<char, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb && __s)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = static_cast<streamsize>(_Traits::length(__s));
>       if (__w > __len)
>  {
>    char* __cs = static_cast<char*>(__builtin_alloca(__w));
>    __pad<char, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       __s, __w, __len, false);
>    __s = __cs;
>    __len = __w;
>  }
>       __out._M_write(__s, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      else if (!__s)
> __out.setstate(ios_base::badbit);
>      return __out;
>    }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out,
>        const basic_string<_CharT, _Traits, _Alloc>& __str)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   const streamsize __w = __out.width();
>   streamsize __len = static_cast<streamsize>(__str.size());
>   const _CharT* __s = __str.data();
>
>
>
>   if (__w > __len)
>     {
>       _CharT* __cs = (static_cast<
>         _CharT*>(__builtin_alloca(sizeof(_CharT) * __w)));
>       __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs, __s,
>          __w, __len, false);
>       __s = __cs;
>       __len = __w;
>     }
>   __out._M_write(__s, __len);
>   __out.width(0);
> }
>      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 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*);
>
>
>}
># 526 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 2 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>
>
>
>
>namespace std
>{
># 57 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_istream<_CharT2, _Traits2>&
>        operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2&);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_istream<_CharT2, _Traits2>&
>        operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);
>
>    protected:
>
>
>
>
>
>
>
>      streamsize _M_gcount;
>
>    public:
># 103 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      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;
># 130 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      operator>>(__istream_type& (*__pf)(__istream_type&));
>
>      inline __istream_type&
>      operator>>(__ios_type& (*__pf)(__ios_type&));
>
>      inline __istream_type&
>      operator>>(ios_base& (*__pf)(ios_base&));
># 168 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      operator>>(bool& __n);
>
>      __istream_type&
>      operator>>(short& __n);
>
>      __istream_type&
>      operator>>(unsigned short& __n);
>
>      __istream_type&
>      operator>>(int& __n);
>
>      __istream_type&
>      operator>>(unsigned int& __n);
>
>      __istream_type&
>      operator>>(long& __n);
>
>      __istream_type&
>      operator>>(unsigned long& __n);
>
>
>      __istream_type&
>      operator>>(long long& __n);
>
>      __istream_type&
>      operator>>(unsigned long long& __n);
>
>
>      __istream_type&
>      operator>>(float& __f);
>
>      __istream_type&
>      operator>>(double& __f);
>
>      __istream_type&
>      operator>>(long double& __f);
>
>      __istream_type&
>      operator>>(void*& __p);
># 229 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      operator>>(__streambuf_type* __sb);
># 239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline streamsize
>      gcount() const
>      { return _M_gcount; }
># 271 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      int_type
>      get();
># 285 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      get(char_type& __c);
># 312 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      get(char_type* __s, streamsize __n, char_type __delim);
># 323 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      get(char_type* __s, streamsize __n)
>      { return this->get(__s, __n, this->widen('\n')); }
># 346 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      get(__streambuf_type& __sb, char_type __delim);
># 356 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      get(__streambuf_type& __sb)
>      { return this->get(__sb, this->widen('\n')); }
># 385 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      getline(char_type* __s, streamsize __n, char_type __delim);
># 396 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      getline(char_type* __s, streamsize __n)
>      { return this->getline(__s, __n, this->widen('\n')); }
># 420 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      ignore();
>
>      __istream_type&
>      ignore(streamsize __n);
>
>      __istream_type&
>      ignore(streamsize __n, int_type __delim);
># 437 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      int_type
>      peek();
># 455 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      read(char_type* __s, streamsize __n);
># 474 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      streamsize
>      readsome(char_type* __s, streamsize __n);
># 490 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      putback(char_type __c);
># 505 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      unget();
># 523 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      int
>      sync();
># 537 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      pos_type
>      tellg();
># 552 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      seekg(pos_type);
># 568 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      seekg(off_type, ios_base::seekdir);
>
>
>    protected:
>      explicit
>      basic_istream(): _M_gcount(streamsize(0)) { }
>    };
>
>
>  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);
># 621 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_istream<_CharT, _Traits>::sentry
>    {
>    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;
># 653 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      explicit
>      sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);
># 663 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      operator bool() const { return _M_ok; }
>
>    private:
>      bool _M_ok;
>    };
># 682 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c);
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
>    { return (__in >> reinterpret_cast<char&>(__c)); }
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
>    { return (__in >> reinterpret_cast<char&>(__c)); }
># 723 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
>    { return (__in >> reinterpret_cast<char*>(__s)); }
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
>    { return (__in >> reinterpret_cast<char*>(__s)); }
># 750 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(), __ostream_type()
>      { this->init(__sb); }
>
>
>
>
>      virtual
>      ~basic_iostream() { }
>
>    protected:
>      explicit
>      basic_iostream() : __istream_type(), __ostream_type()
>      { }
>    };
># 813 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    ws(basic_istream<_CharT, _Traits>& __is);
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 3
>
>
>
>
>namespace std
>{
>  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::iostate(ios_base::goodbit);
>      if (__in.good())
> {
>   if (__in.tie())
>     __in.tie()->flush();
>   if (!__noskip && (__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>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(__istream_type& (*__pf)(__istream_type&))
>    { return __pf(*this); }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(__ios_type& (*__pf)(__ios_type&))
>    {
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(ios_base& (*__pf)(ios_base&))
>    {
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(bool& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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::iostate(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 (!(__err & ios_base::failbit)
>    && (numeric_limits<short>::min() <= __l
>        && __l <= numeric_limits<short>::max()))
>  __n = __l;
>       else
>                __err |= ios_base::failbit;
>     }
>   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>>(unsigned short& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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::iostate(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 (!(__err & ios_base::failbit)
>    && (numeric_limits<int>::min() <= __l
>        && __l <= numeric_limits<int>::max()))
>  __n = __l;
>       else
>                __err |= ios_base::failbit;
>     }
>   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>>(unsigned int& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(unsigned long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(long long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(unsigned long long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(float& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(double& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(long double& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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>>(void*& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   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::iostate(ios_base::goodbit);
>      sentry __cerb(*this, false);
>      if (__cerb && __sbout)
> {
>   try
>     {
>       if (!__copy_streambufs(this->rdbuf(), __sbout))
>  __err |= ios_base::failbit;
>     }
>   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::iostate(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(...)
>     { 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::iostate(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(...)
>     { 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::iostate(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(...)
>     { 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::iostate(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(...)
>     { 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::iostate(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(...)
>            { 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::iostate(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(...)
>     { 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::iostate(ios_base::goodbit);
>          try
>            {
>              const int_type __eof = traits_type::eof();
>              __streambuf_type* __sb = this->rdbuf();
>              int_type __c = __sb->sgetc();
># 692 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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 == numeric_limits<streamsize>::max()
>        && !traits_type::eq_int_type(__c, __eof))
>      {
>        _M_gcount = numeric_limits<streamsize>::min();
>        __large_ignore = true;
>      }
>    else
>      break;
>  }
>
>       if (__large_ignore)
>  _M_gcount = numeric_limits<streamsize>::max();
>
>       if (traits_type::eq_int_type(__c, __eof))
>                __err |= ios_base::eofbit;
>            }
>          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::iostate(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 == numeric_limits<streamsize>::max()
>        && !traits_type::eq_int_type(__c, __eof)
>        && !traits_type::eq_int_type(__c, __delim))
>      {
>        _M_gcount = numeric_limits<streamsize>::min();
>        __large_ignore = true;
>      }
>    else
>      break;
>  }
>
>       if (__large_ignore)
>  _M_gcount = numeric_limits<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 < numeric_limits<streamsize>::max())
>      ++_M_gcount;
>    __sb->sbumpc();
>  }
>            }
>          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::iostate(ios_base::goodbit);
>   try
>     {
>       __c = this->rdbuf()->sgetc();
>       if (traits_type::eq_int_type(__c, traits_type::eof()))
>  __err |= ios_base::eofbit;
>     }
>   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::iostate(ios_base::goodbit);
>   try
>     {
>       _M_gcount = this->rdbuf()->sgetn(__s, __n);
>       if (_M_gcount != __n)
>  __err |= (ios_base::eofbit | ios_base::failbit);
>     }
>   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::iostate(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(...)
>     { 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;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(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(...)
>     { 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;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(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(...)
>     { 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::iostate(ios_base::goodbit);
>   try
>     {
>       __streambuf_type* __sb = this->rdbuf();
>       if (__sb)
>  {
>    if (__sb->pubsync() == -1)
>      __err |= ios_base::badbit;
>    else
>      __ret = 0;
>  }
>     }
>   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);
>      try
> {
>   if (!this->fail())
>     __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::in);
> }
>      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)
>    {
>
>
>      ios_base::iostate __err = ios_base::iostate(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(...)
> { 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)
>    {
>
>
>      ios_base::iostate __err = ios_base::iostate(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(...)
> { 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::iostate(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(...)
>     { __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 typename __istream_type::__streambuf_type __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::iostate(ios_base::goodbit);
>      typename __istream_type::sentry __cerb(__in, false);
>      if (__cerb)
> {
>   try
>     {
>
>       streamsize __num = __in.width();
>       if (__num <= 0)
>  __num = numeric_limits<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(...)
>     { __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 typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef typename __istream_type::int_type __int_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;
>    }
>
>
>  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 typename __istream_type::int_type __int_type;
>      typedef typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>
>      __size_type __extracted = 0;
>      ios_base::iostate __err = ios_base::iostate(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();
>       __streambuf_type* __sb = __in.rdbuf();
>       __int_type __c = __sb->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 = __sb->snextc();
>  }
>       __str.append(__buf, __len);
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>       __in.width(0);
>     }
>   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 typename __istream_type::int_type __int_type;
>      typedef typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>
>      __size_type __extracted = 0;
>      const __size_type __n = __str.max_size();
>      ios_base::iostate __err = ios_base::iostate(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();
>       __streambuf_type* __sb = __in.rdbuf();
>       __int_type __c = __sb->sgetc();
>
>       while (__extracted < __n
>       && !_Traits::eq_int_type(__c, __eof)
>       && !_Traits::eq_int_type(__c, __idelim))
>  {
>    __str += _Traits::to_char_type(__c);
>    ++__extracted;
>    __c = __sb->snextc();
>  }
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>       else if (_Traits::eq_int_type(__c, __idelim))
>  {
>    ++__extracted;
>    __sb->sbumpc();
>  }
>       else
>  __err |= ios_base::failbit;
>     }
>   catch(...)
>     {
>
>
>
>       __in._M_setstate(ios_base::badbit);
>     }
> }
>      if (!__extracted)
> __err |= ios_base::failbit;
>      if (__err)
> __in.setstate(__err);
>      return __in;
>    }
>
>  template<class _CharT, class _Traits, class _Alloc>
>    inline basic_istream<_CharT,_Traits>&
>    getline(basic_istream<_CharT, _Traits>& __in,
>     basic_string<_CharT,_Traits,_Alloc>& __str)
>    { return getline(__in, __str, __in.widen('\n')); }
>
>
>
>
>
>  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 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 class basic_iostream<wchar_t>;
>
>
>}
># 820 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 2 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 2 3
>
>namespace std
>{
># 62 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 3
>  extern istream cin;
>  extern ostream cout;
>  extern ostream cerr;
>  extern ostream clog;
>
>
>  extern wistream wcin;
>  extern wostream wcout;
>  extern wostream wcerr;
>  extern wostream wclog;
>
>
>
>
>  static ios_base::Init __ioinit;
>}
># 42 "../include/singleton.h" 2
>
>template <class T> Singleton<T>::~Singleton()
>{
> std::cout << "~Singleton()" << std::endl;
>}
>
>template <class T> T* Singleton<T>::Get()
>{
> if(!ms_instance)
>  ms_instance = new T();
> return ms_instance;
>}
>
>template <class T> void Singleton<T>::Free()
>{
> if( ms_instance )
> {
>  delete ms_instance;
>  ms_instance = 0;
> }
>}
># 33 "../include/Types.h" 2
># 1 "../include/Assert.h" 1
># 21 "../include/Assert.h"
>       
>
>
>
>
>class Assertion : public std::exception
>{
> public:
>  Assertion(const char* expr,
>   const char* file, unsigned int line,
>   const char* func, const char* pretty_func);
>  ~Assertion() throw();
>
> public:
>  const char *what() const throw();
>
> private:
>  std::string m_msg;
>};
># 34 "../include/Types.h" 2
>
>typedef unsigned long value_type;
>typedef std::set<value_type> value_types;
>typedef const std::string& cstring;
>
>typedef std::vector<std::string> Strings;
>
>class UBSocket;
>
>class Actor;
>typedef SmartPtr<Actor> ActorPtr;
>
>class Table;
>typedef SmartPtr<Table> TablePtr;
>typedef std::vector<TablePtr> TableVector;
>typedef std::map<std::string, TablePtr> TableMap;
>
>class TableDef;
>typedef SmartPtr<TableDef> TableDefPtr;
>typedef std::vector<TableDefPtr> TableDefVector;
>
>class TableImpl;
>typedef SmartPtr<TableImpl> TableImplPtr;
>typedef std::vector<TableImplPtr> TableImplVector;
>
>class KeyDef;
>typedef SmartPtr<KeyDef> KeyDefPtr;
>typedef std::vector<KeyDefPtr> KeyDefs;
>
>class Key;
>typedef SmartPtr<Key> KeyPtr;
>
>class Keys;
>typedef std::map<KeyDef*, KeyPtr> KeyMap;
>typedef SmartPtr<Keys> KeysPtr;
>
>class Value;
>typedef SmartPtr<Value> ValuePtr;
>
>class FieldDef;
>typedef SmartPtr<FieldDef> FieldDefPtr;
>typedef std::vector<FieldDefPtr> FieldDefVector;
>
>class FieldImpl;
>typedef SmartPtr<FieldImpl> FieldImplPtr;
>typedef std::vector<FieldImplPtr> FieldImplVector;
>typedef std::map<FieldImpl*, ValuePtr> Fields;
>
>class Field;
>typedef SmartPtr<Field> FieldPtr;
>
>typedef std::vector<FieldPtr> FieldVector;
>
>class SavableManager;
>typedef SmartPtr<SavableManager> SavableManagerPtr;
>
>class Relation;
>typedef SmartPtr<Relation> RelationPtr;
># 23 "CommandObject.h" 2
>
>template <class T>
>class CommandObject
>{
>public:
> typedef void (T::*CommandFunction)(const std::string& argument);
>
> CommandObject(const char* name, CommandFunction command, bool fullname = false);
> ~CommandObject();
>        void Run(T* owner, const std::string& argument) const;
> const std::string& getName() const;
> bool fullName() const;
>
>protected:
> std::string m_name;
> CommandFunction m_command;
> bool m_fullName;
>};
>
>template <class T>
>const std::string& CommandObject<T>::getName() const
>{
> return m_name;
>}
>
>template <class T>
>bool CommandObject<T>::fullName() const
>{
> return m_fullName;
>}
>
>template <class T>
>CommandObject<T>::CommandObject(const char* name, CommandFunction command, bool fullname) :
>m_name(name),
>m_command(command),
>m_fullName(fullname)
>{
>
>}
>
>template <class T>
>CommandObject<T>::~CommandObject()
>{
>
>}
>
>template <class T>
>void CommandObject<T>::Run(T* owner, const std::string& argument) const
>{
> (owner->*m_command)(argument);
>}
># 6 "CommandTable.h" 2
>
>template<typename T>
>class CommandTable
>{
> typedef CommandObject<T> Command;
>
>public:
> CommandTable();
> virtual ~CommandTable();
>
>public:
> const Command* translate(const std::string& action);
>
>protected:
> static const Command m_commands[];
>};
>
>template<typename T>
>CommandTable<T>::CommandTable()
>{
>}
>
>template<typename T>
>CommandTable<T>::~CommandTable()
>{
>}
>
>
>
>template<typename T>
>const CommandObject<T>*
>CommandTable<T>::translate(const std::string& action)
>{
> std::cout << "CommandTable::translate()" << std::endl;
>}
># 22 "EditorRace.cpp" 2
># 1 "EditorRace.h" 1
># 20 "EditorRace.h"
>       
>
>
>
># 1 "OLCEditor.h" 1
># 20 "OLCEditor.h"
>       
>
># 1 "../include/SavableHeaders.h" 1
># 20 "../include/SavableHeaders.h"
>       
>
>
># 1 "../include/Table.h" 1
># 20 "../include/Table.h"
>       
>
>
>
>class Table
>{
>public:
> const std::string& tableName() const;
>
> virtual FieldDefVector::const_iterator lookupbegin() const = 0;
> virtual FieldDefVector::const_iterator lookupend() const = 0;
> virtual size_t lookupsize() const = 0;
>
> virtual FieldDefVector::const_iterator defbegin() const = 0;
> virtual FieldDefVector::const_iterator defend() const = 0;
> virtual size_t defsize() const = 0;
>
> virtual std::string firstKey() const = 0;
> virtual TableMap::const_iterator keybegin() const = 0;
> virtual TableMap::const_iterator keyend() const = 0;
> virtual size_t keysize() const = 0;
>
> virtual bool hasSingularPrimaryKey() const = 0;
>
>protected:
> Table(std::string name);
> virtual ~Table();
> friend class SmartPtr<Table>;
>
> std::string m_name;
>};
># 24 "../include/SavableHeaders.h" 2
># 1 "../include/Tables.h" 1
># 20 "../include/Tables.h"
>       
>
>
>
>class Tables : public Singleton<Tables>
>{
>public:
> TableDefPtr ACCOUNTS;
> TableDefPtr AREAS;
> TableDefPtr BRANCHES;
> TableDefPtr CHARACTERACCOUNT;
> TableDefPtr CHARACTERBRANCH;
> TableDefPtr CHARACTERCLUSTER;
> TableDefPtr CHARACTERSKILL;
> TableDefPtr CHARACTERSTAT;
> TableDefPtr CHARACTERTREE;
> TableDefPtr CHUNKS;
> TableDefPtr CLUSTERS;
> TableDefPtr COLOURS;
> TableDefPtr COMMANDS;
> TableDefPtr DETAILS;
> TableDefPtr DETAILROOM;
> TableDefPtr DETAILCHUNK;
> TableDefPtr DETAILCHARACTER;
> TableDefPtr DETAILDETAIL;
> TableDefPtr ENTITIES;
> TableDefPtr EXITROOM;
> TableDefPtr EXITS;
> TableDefPtr GRANTGROUPS;
> TableDefPtr PERMISSIONS;
> TableDefPtr RACES;
> TableDefPtr ROOMS;
> TableDefPtr SECTORS;
> TableDefPtr SKILLS;
> TableDefPtr STATS;
> TableDefPtr TRACES;
> TableDefPtr TRACECHUNK;
> TableDefPtr TRACEDETAIL;
> TableDefPtr TRACEENTITY;
> TableDefPtr TRACEROOM;
> TableDefPtr TREES;
> TableDefPtr VERSION;
>
> TableDefVector::const_iterator begin() const { return m_tables.begin(); }
> TableDefVector::const_iterator end() const { return m_tables.end(); }
>
>private:
> friend class Singleton<Tables>;
> Tables();
> ~Tables();
>
> TableDefVector m_tables;
>};
># 25 "../include/SavableHeaders.h" 2
># 1 "../include/Key.h" 1
># 20 "../include/Key.h"
>       
>
>
>
>class Key
>{
>public:
> Key(KeyDefPtr key, value_type value);
> ~Key();
>
> KeyDefPtr getKeyDef() const;
> value_type getValue() const;
> TableImplPtr getTable() const;
>
>private:
> KeyDefPtr m_key;
> value_type m_value;
>};
># 26 "../include/SavableHeaders.h" 2
># 1 "../include/KeyDef.h" 1
># 20 "../include/KeyDef.h"
>       
>
>
>
>class KeyDef
>{
>public:
> KeyDef(TableImplPtr table, cstring name) : m_table(table), m_name(name) { if(!(table)) { throw Assertion("" "table", "../include/KeyDef.h", 27, __FUNCTION__, __PRETTY_FUNCTION__); }; }
> ~KeyDef() { }
> TableImplPtr getTable() const { return m_table; }
> cstring getName() const { return m_name; }
>
>private:
> friend class SmartPtr<KeyDef>;
>
> TableImplPtr m_table;
> std::string m_name;
>};
># 27 "../include/SavableHeaders.h" 2
># 1 "../include/Keys.h" 1
># 20 "../include/Keys.h"
>       
>
>
>
>class Keys
>{
>public:
> Keys(TableImplPtr table);
> Keys(TableImplPtr table, cstring initstring);
> ~Keys();
>
> TableImplPtr getTable() const;
> void addKey(KeyPtr key);
>
> std::string toString() const;
>
> size_t size() const;
> KeyPtr first() const;
> KeyMap::const_iterator begin() const;
> KeyMap::const_iterator end() const;
> KeyMap::const_iterator find(KeyDefPtr key) const;
> KeyPtr getKey(KeyDefPtr key) const;
>
>private:
> TableImplPtr m_table;
> KeyMap m_keys;
>};
># 28 "../include/SavableHeaders.h" 2
># 1 "../include/TableImpl.h" 1
># 20 "../include/TableImpl.h"
>       
>
>
># 1 "../include/TableDef.h" 1
># 20 "../include/TableDef.h"
>       
>
>
>
>
>class TableDef : public Table
>{
>public:
> TableDef(std::string name);
> ~TableDef();
>
>
> void addPK(const std::string& name);
> void addFPK(TableDefPtr table);
> void addFPK(TableDefPtr table, const std::string& suffix);
>
>
> void addValue(const std::string& name);
> void addValue(const std::string& name, value_type defaultvalue);
> void addTextField(const std::string& name);
> void addLookupTextField(const std::string& name);
> void addTextField(const std::string& name, const std::string& defaulttext);
>
>
> void addFK(TableDefPtr table);
> void addFK(TableDefPtr table, const std::string& suffix);
>
> const std::string& tableForeignName() const;
>
>
> FieldDefVector::const_iterator lookupbegin() const { return m_lookupfields.begin(); }
> FieldDefVector::const_iterator lookupend() const { return m_lookupfields.end(); }
> size_t lookupsize() const { return m_lookupfields.size(); }
>
> FieldDefVector::const_iterator defbegin() const { return m_deffields.begin(); }
> FieldDefVector::const_iterator defend() const { return m_deffields.end(); }
> size_t defsize() const { return m_deffields.size(); }
>
> std::string firstKey() const { return m_primarykeys.begin()->first; }
> TableMap::const_iterator keybegin() const { return m_primarykeys.begin(); }
> TableMap::const_iterator keyend() const { return m_primarykeys.end(); }
> size_t keysize() const { return m_primarykeys.size(); }
>
> bool hasSingularPrimaryKey() const { return m_spkey; }
>
>private:
> void addField(const std::string& name, bool text, const std::string& defaulttext, bool providelookup);
>
> std::string m_foreignname;
> FieldDefVector m_lookupfields;
> FieldDefVector m_deffields;
> TableMap m_primarykeys;
> bool m_spkey;
>};
># 24 "../include/TableImpl.h" 2
>
>class TableImpl : public Table
>{
>public:
> TableImpl(TableDefPtr table);
> ~TableImpl() { }
>
> void modify();
> const Strings& tableList();
>
> void addKey(KeyDefPtr key);
> void addField(FieldImplPtr field);
>
>
> FieldDefVector::const_iterator lookupbegin() const { return m_table->lookupbegin(); }
> FieldDefVector::const_iterator lookupend() const { return m_table->lookupend(); }
> size_t lookupsize() const { return m_table->lookupsize(); }
>
> FieldDefVector::const_iterator defbegin() const { return m_table->defbegin(); }
> FieldDefVector::const_iterator defend() const { return m_table->defend(); }
> size_t defsize() const { return m_table->defsize(); }
>
> FieldImplVector::const_iterator implbegin() const { return m_implfields.begin(); }
> FieldImplVector::const_iterator implend() const { return m_implfields.end(); }
> size_t implsize() const { return m_implfields.size(); }
> bool hasfield(FieldImplPtr field) const;
>
> KeyDefPtr firstImplKey() const { return *(m_keys.begin()); }
> KeyDefs::const_iterator keyimplbegin() const { return m_keys.begin(); }
> KeyDefs::const_iterator keyimplend() const { return m_keys.end(); }
> size_t keyimplsize() const { return m_keys.size(); }
>
> std::string firstKey() const { return m_table->firstKey(); }
> TableMap::const_iterator keybegin() const { return m_table->keybegin(); }
> TableMap::const_iterator keyend() const { return m_table->keyend(); }
> size_t keysize() const { return m_table->keysize(); }
>
> bool hasSingularPrimaryKey() const { return m_table->hasSingularPrimaryKey(); }
>
>private:
> TableDefPtr m_table;
> FieldImplVector m_implfields;
> KeyDefs m_keys;
>
> time_t m_lastchange;
> std::vector<std::string> m_list;
> time_t m_listcache;
>};
># 29 "../include/SavableHeaders.h" 2
># 1 "../include/FieldImpl.h" 1
># 20 "../include/FieldImpl.h"
>       
>
>
># 1 "../include/Field.h" 1
># 20 "../include/Field.h"
>       
>
>
>
>class Field
>{
>public:
> Field(cstring name, bool text = false);
> ~Field();
>
> const std::string& getName() const { return m_name; };
> bool isText() const { return m_text; };
>
>protected:
> std::string m_name;
> bool m_text;
>};
># 24 "../include/FieldImpl.h" 2
>
>class FieldImpl : public Field
>{
>public:
> FieldImpl(TableImplPtr table, cstring name, bool text = false);
> ~FieldImpl();
>
> TableImplPtr getTable() { return m_table; }
>
>private:
> TableImplPtr m_table;
>};
># 30 "../include/SavableHeaders.h" 2
># 1 "../include/FieldDef.h" 1
># 20 "../include/FieldDef.h"
>       
>
>
>
>
>class FieldDef : public Field
>{
>public:
> FieldDef(const std::string& name, bool text = false, const std::string& defaultvalue = "");
> ~FieldDef();
>
> std::string creationString() const;
>
> const std::string& getDefaultValue() const { return m_defaultvalue; };
>
>private:
> std::string m_defaultvalue;
>};
># 31 "../include/SavableHeaders.h" 2
># 1 "../include/Value.h" 1
># 20 "../include/Value.h"
>       
>
>
>
>class Value
>{
>public:
> Value(FieldImplPtr field);
> Value(FieldImplPtr field, cstring value);
> Value(FieldImplPtr field, value_type value);
> ~Value();
>
> FieldImplPtr getField() const { return m_field; }
> TableImplPtr getTable() const;
>
> const std::string& getStringValue() const { return m_textvalue; }
> value_type getIntegerValue() const { return m_integervalue; }
> bool getBoolValue() const { return m_integervalue == 1 ? true : false; }
>
> void setTextValue(const std::string& value) { m_textvalue = value; }
> void setIntegerValue(value_type value) { m_integervalue = value; }
> void setBoolValue(bool value) { m_integervalue = (value ? 1 : 0); }
>
>private:
> FieldImplPtr m_field;
> std::string m_textvalue;
> value_type m_integervalue;
>};
># 32 "../include/SavableHeaders.h" 2
># 1 "../include/Savable.h" 1
># 20 "../include/Savable.h"
>       
>
>
>
>class Savable
>{
>public:
> Savable(void) { };
> virtual ~Savable(void) { };
>
> virtual void Delete() = 0;
> virtual void Save() = 0;
> virtual void Delete(value_type accountid, const std::string& description) { this->Delete(); }
> virtual void Save(value_type accountid, const std::string& description) { this->Save(); }
> virtual bool Exists() = 0;
>
> virtual std::vector<std::string> Show() = 0;
> virtual std::string ShowShort() = 0;
>
> virtual TableImplPtr getTable() const = 0;
>private:
> Savable(const Savable& rhs) {};
>};
>
>typedef SmartPtr<Savable> SavablePtr;
># 33 "../include/SavableHeaders.h" 2
># 1 "../include/SavableManager.h" 1
># 20 "../include/SavableManager.h"
>       
>
>
>
>typedef std::map<Keys*, SavableManagerPtr> ByKeyCache;
>typedef std::map<Value*, SavableManagerPtr> ByValueCache;
>
>class SavableManager
>{
> public:
>
>  static SavableManagerPtr getnew(TableImplPtr table);
>  static SavableManagerPtr bykeys(KeyPtr keys);
>  static SavableManagerPtr bykeys(KeysPtr keys);
>  static SavableManagerPtr byvalue(ValuePtr value);
>  static KeysPtr lookupvalue(ValuePtr value);
>
>
>  void erase();
>  void save();
>  bool exists();
>
>
>  void bindKeys(sqlite3* db, sqlite3_stmt* stmt, int startpos = 1) const;
>  void bindFields(sqlite3* db, sqlite3_stmt* stmt, int startpos = 1) const;
>  void bindUpdate(sqlite3* db, sqlite3_stmt* stmt) const;
>  void bindLookup(sqlite3* db, sqlite3_stmt* stmt) const;
>
>  void parseInsert(sqlite3* db);
>  void parseSelect(sqlite3_stmt* stmt);
>  void parseLookup(sqlite3_stmt* stmt);
>
>
>  TableImplPtr getTable() const;
>  KeysPtr getkeys() const;
>
>  ValuePtr getfield(FieldImplPtr field) const;
>  KeyPtr getkey(KeyDefPtr keydef) const;
>
>  std::string getDiff() const;
>
>
>  void setkeys(KeysPtr keys);
>  void setvalue(ValuePtr value);
>
> private:
>  SavableManager(TableImplPtr table);
>  ~SavableManager();
>
>  friend class SmartPtr<SavableManager>;
>
>  static ByKeyCache ms_byKeyCache;
>  static ByValueCache ms_byValueCache;
>
>  TableImplPtr m_table;
>  ValuePtr m_lookupvalue;
>
>  KeysPtr m_keys;
>  Fields m_fields;
>
>
>  bool m_newentry;
>  bool m_dirty;
>};
># 34 "../include/SavableHeaders.h" 2
># 1 "../include/Relation.h" 1
># 20 "../include/Relation.h"
>       
>
>
>
>class Relation
>{
>public:
> Relation(TableImplPtr table);
> ~Relation();
>
> void addKey(KeyDefPtr key, value_type value);
> void save();
>
>private:
> TableImplPtr m_table;
> KeysPtr m_keys;
> SavableManagerPtr m_manager;
>};
># 34 "../include/SavableHeaders.h" 2
># 23 "OLCEditor.h" 2
>
># 1 "../include/Global.h" 1
># 20 "../include/Global.h"
>       
>
>
>
>
>class Global : public Singleton<Global>
>{
>public:
> static const int MAXSIZE = (1<<16);
>
> std::string EmptyString;
> long EmptyLong;
>
> char OOCIdentifier;
>
> std::string sprintf(const char* format, ...);
> std::string sprint(va_list& args, const char* format);
>
> void bug(const char* msg);
> void bugf(const char* format, ...);
>
> void log(const char* msg);
> void logf(const char* format, ...);
>
> friend class Singleton<Global>;
>
>private:
> Global(void);
> ~Global(void);
>
>private:
> char m_workspace[MAXSIZE];
>};
># 25 "OLCEditor.h" 2
># 1 "Editor.h" 1
># 20 "Editor.h"
>       
>
>
>
>class Editor
>{
>public:
> Editor(UBSocket* sock);
> virtual ~Editor(void);
>
> virtual void OnLine(const std::string& line);
> virtual void OnFocus() { }
>
> virtual std::string name() = 0;
> virtual std::string prompt();
>
> virtual std::string lookup(const std::string& action);
> virtual void dispatch(const std::string& action, const std::string& argument) { return; };
>
> void Send(const std::string& msg);
> void Sendf(const char* format, ...);
> void Disconnect();
>
>protected:
> UBSocket* m_sock;
>
>private:
> Editor(const Editor& rhs) : m_sock(rhs.m_sock) {};
>};
># 26 "OLCEditor.h" 2
># 1 "Interpreter.h" 1
># 20 "Interpreter.h"
>       
>
>
># 1 "../include/StringUtilities.h" 1
># 20 "../include/StringUtilities.h"
>       
>
>
>
>
>class String : public Singleton<String>
>{
>private:
> String(void) {};
> ~String(void) {};
>
> friend class Singleton<String>;
>
>public:
> Strings lines(const std::string& input, const char* separator);
> std::string unlines(const Strings& input, const char* filler, int newlineat = 1);
> Strings unlines(const Strings& input);
>
> size_t maxlength(const Strings& content);
> std::string box(const Strings& content, const std::string& header = Global::Get()->EmptyString);
>
> std::string toupper(const std::string& convertToUpper);
> std::string tolower(const std::string& convertToLower);
>};
># 24 "Interpreter.h" 2
>
>template <class T>
>class Interpreter
>{
>public:
> Interpreter();
> ~Interpreter();
>
> void addWord(const std::string& name, T* cmd);
> T* translate(const std::string& name);
>
> Strings getWords();
>
>protected:
> std::map<std::string, T*> m_fullwords;
> std::map<std::string, T*> m_words;
>
>private:
> Interpreter(const Interpreter& rhs);
> Interpreter operator=(const Interpreter& rhs);
>};
>
>template <class T>
>Interpreter<T>::Interpreter()
>{
>
>}
>
>template <class T>
>Interpreter<T>::~Interpreter()
>{
> m_words.clear();
> m_fullwords.clear();
>}
>
>template <class T>
>void Interpreter<T>::addWord(const std::string& rawname, T* word)
>{
> std::string name = String::Get()->tolower(rawname);
> m_fullwords[name] = word;
>
> if(word->fullName())
>  return;
>
>    for(size_t i = 1; i <= name.length(); i++)
>    {
>        if(m_words.find(name.substr(0, i)) == m_words.end())
>        {
>            m_words[name.substr(0,i)] = word;
>        }
>    }
>
> return;
>}
>
>template <class T>
>T* Interpreter<T>::translate(const std::string& name)
>{
> typename std::map<std::string, T*>::iterator word = m_fullwords.find(name);
> if(word == m_fullwords.end())
> {
>  word = m_words.find(name);
>  if(word == m_words.end())
>   return __null;
> }
>
> return word->second;
>}
>
>template <class T>
>Strings Interpreter<T>::getWords()
>{
> Strings words;
>
> for(typename std::map<std::string, T*>::iterator it = m_fullwords.begin(); it != m_fullwords.end(); it++)
> {
>  words.push_back(it->first);
> }
>
> return words;
>}
># 27 "OLCEditor.h" 2
>
>
>class OLCEditor : public Editor
>{
>public:
> typedef CommandObject<OLCEditor> SavableCommand;
>
> OLCEditor(UBSocket* sock) : Editor(sock) {};
> virtual ~OLCEditor(void) {};
>
> virtual std::string lookup(const std::string& action);
> virtual void dispatch(const std::string& action, const std::string& argument);
>
> virtual SavablePtr getEditing() = 0;
> virtual TableImplPtr getTable() = 0;
> virtual KeysPtr addNew() = 0;
>
> virtual std::vector<std::string> getList() = 0;
> virtual std::vector<std::string> getCommands() = 0;
>
> virtual void setEditing(KeysPtr keys) = 0;
>
> void listCommands(const std::string& argument);
> void newSavable(const std::string& argument);
> void deleteSavable(const std::string& argument);
> void editSavable(const std::string& argument);
> void quitEditor(const std::string& argument);
> void doneEditing(const std::string& argument);
> void listSavable(const std::string& argument);
>
>private:
> OLCEditor(const OLCEditor& rhs) : Editor(rhs.m_sock) {};
>
>protected:
> class GeneralInterpreter : public Interpreter<SavableCommand>, public Singleton<GeneralInterpreter> {
> private:
>  GeneralInterpreter(void);
>  ~GeneralInterpreter(void);
>  friend class Singleton<GeneralInterpreter>;
> };
>
> static SavableCommand m_listCommands;
> static SavableCommand m_newSavable;
> static SavableCommand m_deleteSavable;
> static SavableCommand m_editSavable;
> static SavableCommand m_quitEditor;
> static SavableCommand m_doneEditing;
> static SavableCommand m_listSavable;
>};
># 25 "EditorRace.h" 2
>
>
>
>
>namespace mud
>{
> class Race;
> typedef SmartPtr<mud::Race> RacePtr;
>};
>
>class EditorRace : public OLCEditor, public CommandTable<EditorRace>
>{
>public:
> typedef CommandObject<EditorRace> RaceCommand;
>
> EditorRace(UBSocket* sock);
> ~EditorRace(void);
>
> std::string name() { return "Race"; };
> std::string prompt() { return "Race> "; };
>
> std::string lookup(const std::string& action);
> void dispatch(const std::string& action, const std::string& argument);
>
> SavablePtr getEditing();
> TableImplPtr getTable();
> KeysPtr addNew();
> std::vector<std::string> getList();
> std::vector<std::string> getCommands();
> void setEditing(KeysPtr keys);
>
> void editName(const std::string& argument);
> void editDescription(const std::string& argument);
> void editHeight(const std::string& argument);
> void editWidth(const std::string& argument);
> void showRace(const std::string& argument);
> void saveRace(const std::string& argument);
>
>private:
> mud::RacePtr m_race;
>
> EditorRace(const EditorRace& rhs);
> EditorRace operator=(const EditorRace& rhs);
>
>
>
>
>};
># 23 "EditorRace.cpp" 2
># 1 "EditorOLC.h" 1
># 20 "EditorOLC.h"
>       
>
>
>
>
>
>
>
>class EditorOLC : public Editor
>{
>public:
> typedef CommandObject<EditorOLC> OLCCommand;
>
> EditorOLC(UBSocket* sock);
> ~EditorOLC(void);
>
> std::string name() { return "OLC"; };
> std::string prompt() { return "OLC> "; };
>
> std::string lookup(const std::string& action);
> void dispatch(const std::string& action, const std::string& argument);
>
> void startAreas(const std::string& argument);
> void startRooms(const std::string& argument);
> void startScripts(const std::string& argument);
> void startMobiles(const std::string& argument);
> void startSectors(const std::string& argument);
> void startColours(const std::string& argument);
> void startCommands(const std::string& argument);
> void startChunks(const std::string& argument);
> void startRaces(const std::string& argument);
> void listCommands(const std::string& argument);
> void quitEditor(const std::string& argument);
>
>private:
> EditorOLC(const EditorOLC& rhs);
> EditorOLC operator=(const EditorOLC& rhs);
>
> class OLCInterpreter : public Interpreter<OLCCommand>, public Singleton<OLCInterpreter> {
> private:
>  OLCInterpreter(void);
>  ~OLCInterpreter(void);
>  friend class Singleton<OLCInterpreter>;
> };
>
> static OLCCommand m_startAreas;
> static OLCCommand m_startRooms;
> static OLCCommand m_startScripts;
> static OLCCommand m_startMobiles;
> static OLCCommand m_startSectors;
> static OLCCommand m_startColours;
> static OLCCommand m_startCommands;
> static OLCCommand m_startChunks;
> static OLCCommand m_startRaces;
> static OLCCommand m_listCommands;
> static OLCCommand m_quitEditor;
>};
># 24 "EditorRace.cpp" 2
>
># 1 "UBSocket.h" 1
># 20 "UBSocket.h"
>       
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stack" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stack" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stack" 3
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/deque" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/deque" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/deque" 3
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 1 3
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>namespace std
>{
># 82 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  inline size_t
>  __deque_buf_size(size_t __size)
>  { return __size < 512 ? size_t(512 / __size) : size_t(1); }
># 100 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    struct _Deque_iterator
>    {
>      typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;
>      typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;
>
>      static size_t _S_buffer_size()
>      { return __deque_buf_size(sizeof(_Tp)); }
>
>      typedef std::random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef _Ptr pointer;
>      typedef _Ref reference;
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp** _Map_pointer;
>      typedef _Deque_iterator _Self;
>
>      _Tp* _M_cur;
>      _Tp* _M_first;
>      _Tp* _M_last;
>      _Map_pointer _M_node;
>
>      _Deque_iterator(_Tp* __x, _Map_pointer __y)
>      : _M_cur(__x), _M_first(*__y),
>        _M_last(*__y + _S_buffer_size()), _M_node(__y) {}
>
>      _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
>
>      _Deque_iterator(const iterator& __x)
>      : _M_cur(__x._M_cur), _M_first(__x._M_first),
>        _M_last(__x._M_last), _M_node(__x._M_node) {}
>
>      reference
>      operator*() const
>      { return *_M_cur; }
>
>      pointer
>      operator->() const
>      { return _M_cur; }
>
>      _Self&
>      operator++()
>      {
> ++_M_cur;
> if (_M_cur == _M_last)
>   {
>     _M_set_node(_M_node + 1);
>     _M_cur = _M_first;
>   }
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> ++*this;
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> if (_M_cur == _M_first)
>   {
>     _M_set_node(_M_node - 1);
>     _M_cur = _M_last;
>   }
> --_M_cur;
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> --*this;
> return __tmp;
>      }
>
>      _Self&
>      operator+=(difference_type __n)
>      {
> const difference_type __offset = __n + (_M_cur - _M_first);
> if (__offset >= 0 && __offset < difference_type(_S_buffer_size()))
>   _M_cur += __n;
> else
>   {
>     const difference_type __node_offset =
>       __offset > 0 ? __offset / difference_type(_S_buffer_size())
>                    : -difference_type((-__offset - 1)
>           / _S_buffer_size()) - 1;
>     _M_set_node(_M_node + __node_offset);
>     _M_cur = _M_first + (__offset - __node_offset
>     * difference_type(_S_buffer_size()));
>   }
> return *this;
>      }
>
>      _Self
>      operator+(difference_type __n) const
>      {
> _Self __tmp = *this;
> return __tmp += __n;
>      }
>
>      _Self&
>      operator-=(difference_type __n)
>      { return *this += -__n; }
>
>      _Self
>      operator-(difference_type __n) const
>      {
> _Self __tmp = *this;
> return __tmp -= __n;
>      }
>
>      reference
>      operator[](difference_type __n) const
>      { return *(*this + __n); }
>
>
>
>
>
>
>
>      void
>      _M_set_node(_Map_pointer __new_node)
>      {
> _M_node = __new_node;
> _M_first = *__new_node;
> _M_last = _M_first + difference_type(_S_buffer_size());
>      }
>    };
>
>
>
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline bool
>    operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
>        const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
>    { return __x._M_cur == __y._M_cur; }
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline bool
>    operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>        const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    { return __x._M_cur == __y._M_cur; }
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline bool
>    operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
>        const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline bool
>    operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>        const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline bool
>    operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
>       const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
>    { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)
>                                          : (__x._M_node < __y._M_node); }
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline bool
>    operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>       const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)
>                                   : (__x._M_node < __y._M_node); }
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline bool
>    operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
>       const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
>    { return __y < __x; }
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline bool
>    operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>       const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    { return __y < __x; }
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline bool
>    operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
>        const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline bool
>    operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>        const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline bool
>    operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
>        const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline bool
>    operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>        const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    { return !(__x < __y); }
>
>
>
>
>
>  template<typename _Tp, typename _RefL, typename _PtrL,
>    typename _RefR, typename _PtrR>
>    inline typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type
>    operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
>       const _Deque_iterator<_Tp, _RefR, _PtrR>& __y)
>    {
>      return typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type
> (_Deque_iterator<_Tp, _RefL, _PtrL>::_S_buffer_size())
> * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
> + (__y._M_last - __y._M_cur);
>    }
>
>  template<typename _Tp, typename _Ref, typename _Ptr>
>    inline _Deque_iterator<_Tp, _Ref, _Ptr>
>    operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x)
>    { return __x + __n; }
># 353 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Alloc>
>    class _Deque_base
>    {
>    public:
>      typedef _Alloc allocator_type;
>
>      allocator_type
>      get_allocator() const
>      { return _M_get_Tp_allocator(); }
>
>      typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;
>      typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;
>
>      _Deque_base(const allocator_type& __a, size_t __num_elements)
>      : _M_impl(__a)
>      { _M_initialize_map(__num_elements); }
>
>      _Deque_base(const allocator_type& __a)
>      : _M_impl(__a)
>      { }
>
>      ~_Deque_base();
>
>    protected:
>
>
>
>      typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type;
>
>      typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;
>
>      struct _Deque_impl
>      : public _Tp_alloc_type
>      {
> _Tp** _M_map;
> size_t _M_map_size;
> iterator _M_start;
> iterator _M_finish;
>
> _Deque_impl(const _Tp_alloc_type& __a)
> : _Tp_alloc_type(__a), _M_map(0), _M_map_size(0),
>   _M_start(), _M_finish()
> { }
>      };
>
>      _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); }
>
>      _Map_alloc_type
>      _M_get_map_allocator() const
>      { return _M_get_Tp_allocator(); }
>
>      _Tp*
>      _M_allocate_node()
>      {
> return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));
>      }
>
>      void
>      _M_deallocate_node(_Tp* __p)
>      {
> _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
>      }
>
>      _Tp**
>      _M_allocate_map(size_t __n)
>      { return _M_get_map_allocator().allocate(__n); }
>
>      void
>      _M_deallocate_map(_Tp** __p, size_t __n)
>      { _M_get_map_allocator().deallocate(__p, __n); }
>
>    protected:
>      void _M_initialize_map(size_t);
>      void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish);
>      void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish);
>      enum { _S_initial_map_size = 8 };
>
>      _Deque_impl _M_impl;
>    };
>
>  template<typename _Tp, typename _Alloc>
>    _Deque_base<_Tp, _Alloc>::
>    ~_Deque_base()
>    {
>      if (this->_M_impl._M_map)
> {
>   _M_destroy_nodes(this->_M_impl._M_start._M_node,
>      this->_M_impl._M_finish._M_node + 1);
>   _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
> }
>    }
># 461 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Alloc>
>    void
>    _Deque_base<_Tp, _Alloc>::
>    _M_initialize_map(size_t __num_elements)
>    {
>      const size_t __num_nodes = (__num_elements/ __deque_buf_size(sizeof(_Tp))
>      + 1);
>
>      this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,
>        size_t(__num_nodes + 2));
>      this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);
>
>
>
>
>
>
>      _Tp** __nstart = (this->_M_impl._M_map
>   + (this->_M_impl._M_map_size - __num_nodes) / 2);
>      _Tp** __nfinish = __nstart + __num_nodes;
>
>      try
> { _M_create_nodes(__nstart, __nfinish); }
>      catch(...)
> {
>   _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
>   this->_M_impl._M_map = 0;
>   this->_M_impl._M_map_size = 0;
>   throw;
> }
>
>      this->_M_impl._M_start._M_set_node(__nstart);
>      this->_M_impl._M_finish._M_set_node(__nfinish - 1);
>      this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
>      this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first
>     + __num_elements
>     % __deque_buf_size(sizeof(_Tp)));
>    }
>
>  template<typename _Tp, typename _Alloc>
>    void
>    _Deque_base<_Tp, _Alloc>::
>    _M_create_nodes(_Tp** __nstart, _Tp** __nfinish)
>    {
>      _Tp** __cur;
>      try
> {
>   for (__cur = __nstart; __cur < __nfinish; ++__cur)
>     *__cur = this->_M_allocate_node();
> }
>      catch(...)
> {
>   _M_destroy_nodes(__nstart, __cur);
>   throw;
> }
>    }
>
>  template<typename _Tp, typename _Alloc>
>    void
>    _Deque_base<_Tp, _Alloc>::
>    _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish)
>    {
>      for (_Tp** __n = __nstart; __n < __nfinish; ++__n)
> _M_deallocate_node(*__n);
>    }
># 611 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
>    class deque : protected _Deque_base<_Tp, _Alloc>
>    {
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>     
>     
>
>      typedef _Deque_base<_Tp, _Alloc> _Base;
>      typedef typename _Base::_Tp_alloc_type _Tp_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 typename _Base::iterator iterator;
>      typedef typename _Base::const_iterator 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 pointer* _Map_pointer;
>
>      static size_t _S_buffer_size()
>      { return __deque_buf_size(sizeof(_Tp)); }
>
>
>      using _Base::_M_initialize_map;
>      using _Base::_M_create_nodes;
>      using _Base::_M_destroy_nodes;
>      using _Base::_M_allocate_node;
>      using _Base::_M_deallocate_node;
>      using _Base::_M_allocate_map;
>      using _Base::_M_deallocate_map;
>      using _Base::_M_get_Tp_allocator;
>
>
>
>
>
>
>      using _Base::_M_impl;
>
>    public:
>
>
>
>
>
>      explicit
>      deque(const allocator_type& __a = allocator_type())
>      : _Base(__a, 0) {}
># 676 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      explicit
>      deque(size_type __n, const value_type& __value = value_type(),
>     const allocator_type& __a = allocator_type())
>      : _Base(__a, __n)
>      { _M_fill_initialize(__value); }
># 689 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      deque(const deque& __x)
>      : _Base(__x.get_allocator(), __x.size())
>      { std::__uninitialized_copy_a(__x.begin(), __x.end(),
>        this->_M_impl._M_start,
>        _M_get_Tp_allocator()); }
># 709 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      template<typename _InputIterator>
>        deque(_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());
> }
>
>
>
>
>
>
>      ~deque()
>      { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>        _M_get_Tp_allocator()); }
># 735 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      deque&
>      operator=(const deque& __x);
># 748 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 764 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.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());
> }
>
>
>      allocator_type
>      get_allocator() const
>      { return _Base::get_allocator(); }
>
>
>
>
>
>
>      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(this->_M_impl._M_finish); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return const_reverse_iterator(this->_M_impl._M_finish); }
>
>
>
>
>
>
>      reverse_iterator
>      rend() { return reverse_iterator(this->_M_impl._M_start); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return const_reverse_iterator(this->_M_impl._M_start); }
>
>
>
>      size_type
>      size() const
>      { return this->_M_impl._M_finish - this->_M_impl._M_start; }
>
>
>      size_type
>      max_size() const
>      { return size_type(-1); }
># 869 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      resize(size_type __new_size, value_type __x = value_type())
>      {
> const size_type __len = size();
> if (__new_size < __len)
>   erase(this->_M_impl._M_start + __new_size, this->_M_impl._M_finish);
> else
>   insert(this->_M_impl._M_finish, __new_size - __len, __x);
>      }
>
>
>
>
>
>      bool
>      empty() const
>      { return this->_M_impl._M_finish == this->_M_impl._M_start; }
># 899 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      reference
>      operator[](size_type __n)
>      { return this->_M_impl._M_start[difference_type(__n)]; }
># 914 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      const_reference
>      operator[](size_type __n) const
>      { return this->_M_impl._M_start[difference_type(__n)]; }
>
>    protected:
>
>      void
>      _M_range_check(size_type __n) const
>      {
> if (__n >= this->size())
>   __throw_out_of_range(("deque::_M_range_check"));
>      }
>
>    public:
># 939 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      reference
>      at(size_type __n)
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
># 957 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.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()
>      {
> iterator __tmp = end();
> --__tmp;
> return *__tmp;
>      }
>
>
>
>
>
>      const_reference
>      back() const
>      {
> const_iterator __tmp = end();
> --__tmp;
> return *__tmp;
>      }
># 1014 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      push_front(const value_type& __x)
>      {
> if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)
>   {
>     this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
>     --this->_M_impl._M_start._M_cur;
>   }
> else
>   _M_push_front_aux(__x);
>      }
># 1035 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      push_back(const value_type& __x)
>      {
> if (this->_M_impl._M_finish._M_cur
>     != this->_M_impl._M_finish._M_last - 1)
>   {
>     this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);
>     ++this->_M_impl._M_finish._M_cur;
>   }
> else
>   _M_push_back_aux(__x);
>      }
># 1056 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      pop_front()
>      {
> if (this->_M_impl._M_start._M_cur
>     != this->_M_impl._M_start._M_last - 1)
>   {
>     this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
>     ++this->_M_impl._M_start._M_cur;
>   }
> else
>   _M_pop_front_aux();
>      }
># 1077 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      pop_back()
>      {
> if (this->_M_impl._M_finish._M_cur
>     != this->_M_impl._M_finish._M_first)
>   {
>     --this->_M_impl._M_finish._M_cur;
>     this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);
>   }
> else
>   _M_pop_back_aux();
>      }
># 1099 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      iterator
>      insert(iterator position, const value_type& __x);
># 1111 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 1125 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.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());
> }
># 1148 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      iterator
>      erase(iterator __position);
># 1167 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      iterator
>      erase(iterator __first, iterator __last);
># 1179 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      swap(deque& __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_map, __x._M_impl._M_map);
> std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
>      }
>
>
>
>
>
>
>
>      void clear();
>
>    protected:
>
>
>
>      template<typename _Integer>
>        void
>        _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
>        {
>   _M_initialize_map(__n);
>   _M_fill_initialize(__x);
> }
>
>
>      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());
> }
># 1233 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      template<typename _InputIterator>
>        void
>        _M_range_initialize(_InputIterator __first, _InputIterator __last,
>       std::input_iterator_tag);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,
>       std::forward_iterator_tag);
># 1257 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      _M_fill_initialize(const value_type& __value);
>
>
>
>
>
>      template<typename _Integer>
>        void
>        _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>        {
>   _M_fill_assign(static_cast<size_type>(__n),
>    static_cast<value_type>(__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)
>        {
>   const size_type __len = std::distance(__first, __last);
>   if (__len > size())
>     {
>       _ForwardIterator __mid = __first;
>       std::advance(__mid, size());
>       std::copy(__first, __mid, begin());
>       insert(end(), __mid, __last);
>     }
>   else
>     erase(std::copy(__first, __last, begin()), end());
> }
>
>
>
>      void
>      _M_fill_assign(size_type __n, const value_type& __val)
>      {
> if (__n > size())
>   {
>     std::fill(begin(), end(), __val);
>     insert(end(), __n - size(), __val);
>   }
> else
>   {
>     erase(begin() + __n, end());
>     std::fill(begin(), end(), __val);
>   }
>      }
>
>
>
>
>
>
>
>      void _M_push_back_aux(const value_type&);
>      void _M_push_front_aux(const value_type&);
>      void _M_pop_back_aux();
>      void _M_pop_front_aux();
>
>
>
>
>
>
>      template<typename _Integer>
>        void
>        _M_insert_dispatch(iterator __pos,
>      _Integer __n, _Integer __x, __true_type)
>        {
>   _M_fill_insert(__pos, static_cast<size_type>(__n),
>    static_cast<value_type>(__x));
> }
>
>
>      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_aux(__pos, __first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_range_insert_aux(iterator __pos, _InputIterator __first,
>       _InputIterator __last, std::input_iterator_tag);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_range_insert_aux(iterator __pos, _ForwardIterator __first,
>       _ForwardIterator __last, std::forward_iterator_tag);
>
>
>
>
>      void
>      _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
>
>
>      iterator
>      _M_insert_aux(iterator __pos, const value_type& __x);
>
>
>      void
>      _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_insert_aux(iterator __pos,
>        _ForwardIterator __first, _ForwardIterator __last,
>        size_type __n);
># 1401 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      iterator
>      _M_reserve_elements_at_front(size_type __n)
>      {
> const size_type __vacancies = this->_M_impl._M_start._M_cur
>                               - this->_M_impl._M_start._M_first;
> if (__n > __vacancies)
>   _M_new_elements_at_front(__n - __vacancies);
> return this->_M_impl._M_start - difference_type(__n);
>      }
>
>      iterator
>      _M_reserve_elements_at_back(size_type __n)
>      {
> const size_type __vacancies = (this->_M_impl._M_finish._M_last
>           - this->_M_impl._M_finish._M_cur) - 1;
> if (__n > __vacancies)
>   _M_new_elements_at_back(__n - __vacancies);
> return this->_M_impl._M_finish + difference_type(__n);
>      }
>
>      void
>      _M_new_elements_at_front(size_type __new_elements);
>
>      void
>      _M_new_elements_at_back(size_type __new_elements);
># 1439 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>      void
>      _M_reserve_map_at_back (size_type __nodes_to_add = 1)
>      {
> if (__nodes_to_add + 1 > this->_M_impl._M_map_size
>     - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map))
>   _M_reallocate_map(__nodes_to_add, false);
>      }
>
>      void
>      _M_reserve_map_at_front (size_type __nodes_to_add = 1)
>      {
> if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node
>           - this->_M_impl._M_map))
>   _M_reallocate_map(__nodes_to_add, true);
>      }
>
>      void
>      _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);
>
>    };
># 1471 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator==(const deque<_Tp, _Alloc>& __x,
>                         const deque<_Tp, _Alloc>& __y)
>    { return __x.size() == __y.size()
>             && std::equal(__x.begin(), __x.end(), __y.begin()); }
># 1489 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator<(const deque<_Tp, _Alloc>& __x,
>       const deque<_Tp, _Alloc>& __y)
>    { return lexicographical_compare(__x.begin(), __x.end(),
>         __y.begin(), __y.end()); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator!=(const deque<_Tp, _Alloc>& __x,
>        const deque<_Tp, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator>(const deque<_Tp, _Alloc>& __x,
>       const deque<_Tp, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator<=(const deque<_Tp, _Alloc>& __x,
>        const deque<_Tp, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator>=(const deque<_Tp, _Alloc>& __x,
>        const deque<_Tp, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline void
>    swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y)
>    { __x.swap(__y); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/deque" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/deque.tcc" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/deque.tcc" 3
>namespace std
>{
>  template <typename _Tp, typename _Alloc>
>    deque<_Tp, _Alloc>&
>    deque<_Tp, _Alloc>::
>    operator=(const deque& __x)
>    {
>      const size_type __len = size();
>      if (&__x != this)
> {
>   if (__len >= __x.size())
>     erase(std::copy(__x.begin(), __x.end(), this->_M_impl._M_start),
>    this->_M_impl._M_finish);
>   else
>     {
>       const_iterator __mid = __x.begin() + difference_type(__len);
>       std::copy(__x.begin(), __mid, this->_M_impl._M_start);
>       insert(this->_M_impl._M_finish, __mid, __x.end());
>     }
> }
>      return *this;
>    }
>
>  template <typename _Tp, typename _Alloc>
>    typename deque<_Tp, _Alloc>::iterator
>    deque<_Tp, _Alloc>::
>    insert(iterator position, const value_type& __x)
>    {
>      if (position._M_cur == this->_M_impl._M_start._M_cur)
> {
>   push_front(__x);
>   return this->_M_impl._M_start;
> }
>      else if (position._M_cur == this->_M_impl._M_finish._M_cur)
> {
>   push_back(__x);
>   iterator __tmp = this->_M_impl._M_finish;
>   --__tmp;
>   return __tmp;
> }
>      else
>        return _M_insert_aux(position, __x);
>    }
>
>  template <typename _Tp, typename _Alloc>
>    typename deque<_Tp, _Alloc>::iterator
>    deque<_Tp, _Alloc>::
>    erase(iterator __position)
>    {
>      iterator __next = __position;
>      ++__next;
>      const size_type __index = __position - this->_M_impl._M_start;
>      if (__index < (size() >> 1))
> {
>   std::copy_backward(this->_M_impl._M_start, __position, __next);
>   pop_front();
> }
>      else
> {
>   std::copy(__next, this->_M_impl._M_finish, __position);
>   pop_back();
> }
>      return this->_M_impl._M_start + __index;
>    }
>
>  template <typename _Tp, typename _Alloc>
>    typename deque<_Tp, _Alloc>::iterator
>    deque<_Tp, _Alloc>::
>    erase(iterator __first, iterator __last)
>    {
>      if (__first == this->_M_impl._M_start
>   && __last == this->_M_impl._M_finish)
> {
>   clear();
>   return this->_M_impl._M_finish;
> }
>      else
> {
>   const difference_type __n = __last - __first;
>   const difference_type __elems_before = (__first
>        - this->_M_impl._M_start);
>   if (static_cast<size_type>(__elems_before) <= (size() - __n) / 2)
>     {
>       std::copy_backward(this->_M_impl._M_start, __first, __last);
>       iterator __new_start = this->_M_impl._M_start + __n;
>       std::_Destroy(this->_M_impl._M_start, __new_start,
>       _M_get_Tp_allocator());
>       _M_destroy_nodes(this->_M_impl._M_start._M_node,
>          __new_start._M_node);
>       this->_M_impl._M_start = __new_start;
>     }
>   else
>     {
>       std::copy(__last, this->_M_impl._M_finish, __first);
>       iterator __new_finish = this->_M_impl._M_finish - __n;
>       std::_Destroy(__new_finish, this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>       _M_destroy_nodes(__new_finish._M_node + 1,
>          this->_M_impl._M_finish._M_node + 1);
>       this->_M_impl._M_finish = __new_finish;
>     }
>   return this->_M_impl._M_start + __elems_before;
> }
>    }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    clear()
>    {
>      for (_Map_pointer __node = this->_M_impl._M_start._M_node + 1;
>           __node < this->_M_impl._M_finish._M_node;
>           ++__node)
> {
>   std::_Destroy(*__node, *__node + _S_buffer_size(),
>   _M_get_Tp_allocator());
>   _M_deallocate_node(*__node);
> }
>
>      if (this->_M_impl._M_start._M_node != this->_M_impl._M_finish._M_node)
> {
>   std::_Destroy(this->_M_impl._M_start._M_cur,
>   this->_M_impl._M_start._M_last,
>   _M_get_Tp_allocator());
>   std::_Destroy(this->_M_impl._M_finish._M_first,
>   this->_M_impl._M_finish._M_cur,
>   _M_get_Tp_allocator());
>   _M_deallocate_node(this->_M_impl._M_finish._M_first);
> }
>      else
>        std::_Destroy(this->_M_impl._M_start._M_cur,
>        this->_M_impl._M_finish._M_cur,
>        _M_get_Tp_allocator());
>
>      this->_M_impl._M_finish = this->_M_impl._M_start;
>    }
>
>  template <typename _Tp, class _Alloc>
>    template <typename _InputIterator>
>      void
>      deque<_Tp, _Alloc>::
>      _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)
>          erase(__cur, end());
>        else
>          insert(end(), __first, __last);
>      }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_fill_insert(iterator __pos, size_type __n, const value_type& __x)
>    {
>      if (__pos._M_cur == this->_M_impl._M_start._M_cur)
> {
>   iterator __new_start = _M_reserve_elements_at_front(__n);
>   try
>     {
>       std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start,
>       __x,
>       _M_get_Tp_allocator());
>       this->_M_impl._M_start = __new_start;
>     }
>   catch(...)
>     {
>       _M_destroy_nodes(__new_start._M_node,
>          this->_M_impl._M_start._M_node);
>       throw;
>     }
> }
>      else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)
> {
>   iterator __new_finish = _M_reserve_elements_at_back(__n);
>   try
>     {
>       std::__uninitialized_fill_a(this->_M_impl._M_finish,
>       __new_finish, __x,
>       _M_get_Tp_allocator());
>       this->_M_impl._M_finish = __new_finish;
>     }
>   catch(...)
>     {
>       _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,
>          __new_finish._M_node + 1);
>       throw;
>     }
> }
>      else
>        _M_insert_aux(__pos, __n, __x);
>    }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_fill_initialize(const value_type& __value)
>    {
>      _Map_pointer __cur;
>      try
>        {
>          for (__cur = this->_M_impl._M_start._M_node;
>        __cur < this->_M_impl._M_finish._M_node;
>        ++__cur)
>            std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(),
>     __value, _M_get_Tp_allocator());
>          std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first,
>          this->_M_impl._M_finish._M_cur,
>          __value, _M_get_Tp_allocator());
>        }
>      catch(...)
>        {
>          std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur),
>   _M_get_Tp_allocator());
>          throw;
>        }
>    }
>
>  template <typename _Tp, typename _Alloc>
>    template <typename _InputIterator>
>      void
>      deque<_Tp, _Alloc>::
>      _M_range_initialize(_InputIterator __first, _InputIterator __last,
>                          std::input_iterator_tag)
>      {
>        this->_M_initialize_map(0);
>        try
>          {
>            for (; __first != __last; ++__first)
>              push_back(*__first);
>          }
>        catch(...)
>          {
>            clear();
>            throw;
>          }
>      }
>
>  template <typename _Tp, typename _Alloc>
>    template <typename _ForwardIterator>
>      void
>      deque<_Tp, _Alloc>::
>      _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,
>                          std::forward_iterator_tag)
>      {
>        const size_type __n = std::distance(__first, __last);
>        this->_M_initialize_map(__n);
>
>        _Map_pointer __cur_node;
>        try
>          {
>            for (__cur_node = this->_M_impl._M_start._M_node;
>                 __cur_node < this->_M_impl._M_finish._M_node;
>                 ++__cur_node)
>            {
>              _ForwardIterator __mid = __first;
>              std::advance(__mid, _S_buffer_size());
>              std::__uninitialized_copy_a(__first, __mid, *__cur_node,
>       _M_get_Tp_allocator());
>              __first = __mid;
>            }
>            std::__uninitialized_copy_a(__first, __last,
>     this->_M_impl._M_finish._M_first,
>     _M_get_Tp_allocator());
>          }
>        catch(...)
>          {
>            std::_Destroy(this->_M_impl._M_start,
>     iterator(*__cur_node, __cur_node),
>     _M_get_Tp_allocator());
>            throw;
>          }
>      }
>
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_push_back_aux(const value_type& __t)
>    {
>      value_type __t_copy = __t;
>      _M_reserve_map_at_back();
>      *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node();
>      try
>        {
>          this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t_copy);
>          this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node
>           + 1);
>          this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first;
>        }
>      catch(...)
>        {
>          _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1));
>          throw;
>        }
>    }
>
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_push_front_aux(const value_type& __t)
>    {
>      value_type __t_copy = __t;
>      _M_reserve_map_at_front();
>      *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node();
>      try
>        {
>          this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node
>          - 1);
>          this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1;
>          this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t_copy);
>        }
>      catch(...)
>        {
>          ++this->_M_impl._M_start;
>          _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1));
>          throw;
>        }
>    }
>
>
>  template <typename _Tp, typename _Alloc>
>    void deque<_Tp, _Alloc>::
>    _M_pop_back_aux()
>    {
>      _M_deallocate_node(this->_M_impl._M_finish._M_first);
>      this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1);
>      this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1;
>      this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);
>    }
>
>
>
>
>
>
>  template <typename _Tp, typename _Alloc>
>    void deque<_Tp, _Alloc>::
>    _M_pop_front_aux()
>    {
>      this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
>      _M_deallocate_node(this->_M_impl._M_start._M_first);
>      this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1);
>      this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first;
>    }
>
>  template <typename _Tp, typename _Alloc>
>    template <typename _InputIterator>
>      void
>      deque<_Tp, _Alloc>::
>      _M_range_insert_aux(iterator __pos,
>                          _InputIterator __first, _InputIterator __last,
>                          std::input_iterator_tag)
>      { std::copy(__first, __last, std::inserter(*this, __pos)); }
>
>  template <typename _Tp, typename _Alloc>
>    template <typename _ForwardIterator>
>      void
>      deque<_Tp, _Alloc>::
>      _M_range_insert_aux(iterator __pos,
>                          _ForwardIterator __first, _ForwardIterator __last,
>                          std::forward_iterator_tag)
>      {
>        const size_type __n = std::distance(__first, __last);
>        if (__pos._M_cur == this->_M_impl._M_start._M_cur)
>   {
>     iterator __new_start = _M_reserve_elements_at_front(__n);
>     try
>       {
>  std::__uninitialized_copy_a(__first, __last, __new_start,
>         _M_get_Tp_allocator());
>  this->_M_impl._M_start = __new_start;
>       }
>     catch(...)
>       {
>  _M_destroy_nodes(__new_start._M_node,
>     this->_M_impl._M_start._M_node);
>  throw;
>       }
>   }
>        else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)
>   {
>     iterator __new_finish = _M_reserve_elements_at_back(__n);
>     try
>       {
>  std::__uninitialized_copy_a(__first, __last,
>         this->_M_impl._M_finish,
>         _M_get_Tp_allocator());
>  this->_M_impl._M_finish = __new_finish;
>       }
>     catch(...)
>       {
>  _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,
>     __new_finish._M_node + 1);
>  throw;
>       }
>   }
>        else
>          _M_insert_aux(__pos, __first, __last, __n);
>      }
>
>  template <typename _Tp, typename _Alloc>
>    typename deque<_Tp, _Alloc>::iterator
>    deque<_Tp, _Alloc>::
>    _M_insert_aux(iterator __pos, const value_type& __x)
>    {
>      difference_type __index = __pos - this->_M_impl._M_start;
>      value_type __x_copy = __x;
>      if (static_cast<size_type>(__index) < size() / 2)
> {
>   push_front(front());
>   iterator __front1 = this->_M_impl._M_start;
>   ++__front1;
>   iterator __front2 = __front1;
>   ++__front2;
>   __pos = this->_M_impl._M_start + __index;
>   iterator __pos1 = __pos;
>   ++__pos1;
>   std::copy(__front2, __pos1, __front1);
> }
>      else
> {
>   push_back(back());
>   iterator __back1 = this->_M_impl._M_finish;
>   --__back1;
>   iterator __back2 = __back1;
>   --__back2;
>   __pos = this->_M_impl._M_start + __index;
>   std::copy_backward(__pos, __back2, __back1);
> }
>      *__pos = __x_copy;
>      return __pos;
>    }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_insert_aux(iterator __pos, size_type __n, const value_type& __x)
>    {
>      const difference_type __elems_before = __pos - this->_M_impl._M_start;
>      const size_type __length = this->size();
>      value_type __x_copy = __x;
>      if (__elems_before < difference_type(__length / 2))
> {
>   iterator __new_start = _M_reserve_elements_at_front(__n);
>   iterator __old_start = this->_M_impl._M_start;
>   __pos = this->_M_impl._M_start + __elems_before;
>   try
>     {
>       if (__elems_before >= difference_type(__n))
>  {
>    iterator __start_n = (this->_M_impl._M_start
>     + difference_type(__n));
>    std::__uninitialized_copy_a(this->_M_impl._M_start,
>           __start_n, __new_start,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_start = __new_start;
>    std::copy(__start_n, __pos, __old_start);
>    fill(__pos - difference_type(__n), __pos, __x_copy);
>  }
>       else
>  {
>    std::__uninitialized_copy_fill(this->_M_impl._M_start,
>       __pos, __new_start,
>       this->_M_impl._M_start,
>       __x_copy,
>       _M_get_Tp_allocator());
>    this->_M_impl._M_start = __new_start;
>    std::fill(__old_start, __pos, __x_copy);
>  }
>     }
>   catch(...)
>     {
>       _M_destroy_nodes(__new_start._M_node,
>          this->_M_impl._M_start._M_node);
>       throw;
>     }
> }
>      else
> {
>   iterator __new_finish = _M_reserve_elements_at_back(__n);
>   iterator __old_finish = this->_M_impl._M_finish;
>   const difference_type __elems_after =
>     difference_type(__length) - __elems_before;
>   __pos = this->_M_impl._M_finish - __elems_after;
>   try
>     {
>       if (__elems_after > difference_type(__n))
>  {
>    iterator __finish_n = (this->_M_impl._M_finish
>      - difference_type(__n));
>    std::__uninitialized_copy_a(__finish_n,
>           this->_M_impl._M_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish = __new_finish;
>    std::copy_backward(__pos, __finish_n, __old_finish);
>    std::fill(__pos, __pos + difference_type(__n), __x_copy);
>  }
>       else
>  {
>    std::__uninitialized_fill_copy(this->_M_impl._M_finish,
>       __pos + difference_type(__n),
>       __x_copy, __pos,
>       this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>    this->_M_impl._M_finish = __new_finish;
>    std::fill(__pos, __old_finish, __x_copy);
>  }
>     }
>   catch(...)
>     {
>       _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,
>          __new_finish._M_node + 1);
>       throw;
>     }
> }
>    }
>
>  template <typename _Tp, typename _Alloc>
>    template <typename _ForwardIterator>
>      void
>      deque<_Tp, _Alloc>::
>      _M_insert_aux(iterator __pos,
>                    _ForwardIterator __first, _ForwardIterator __last,
>                    size_type __n)
>      {
>        const difference_type __elemsbefore = __pos - this->_M_impl._M_start;
>        const size_type __length = size();
>        if (static_cast<size_type>(__elemsbefore) < __length / 2)
>   {
>     iterator __new_start = _M_reserve_elements_at_front(__n);
>     iterator __old_start = this->_M_impl._M_start;
>     __pos = this->_M_impl._M_start + __elemsbefore;
>     try
>       {
>  if (__elemsbefore >= difference_type(__n))
>    {
>      iterator __start_n = (this->_M_impl._M_start
>       + difference_type(__n));
>      std::__uninitialized_copy_a(this->_M_impl._M_start,
>      __start_n, __new_start,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_start = __new_start;
>      std::copy(__start_n, __pos, __old_start);
>      std::copy(__first, __last, __pos - difference_type(__n));
>    }
>  else
>    {
>      _ForwardIterator __mid = __first;
>      std::advance(__mid, difference_type(__n) - __elemsbefore);
>      std::__uninitialized_copy_copy(this->_M_impl._M_start,
>         __pos, __first, __mid,
>         __new_start,
>         _M_get_Tp_allocator());
>      this->_M_impl._M_start = __new_start;
>      std::copy(__mid, __last, __old_start);
>    }
>       }
>     catch(...)
>       {
>  _M_destroy_nodes(__new_start._M_node,
>     this->_M_impl._M_start._M_node);
>  throw;
>       }
>   }
>        else
>        {
>          iterator __new_finish = _M_reserve_elements_at_back(__n);
>          iterator __old_finish = this->_M_impl._M_finish;
>          const difference_type __elemsafter =
>            difference_type(__length) - __elemsbefore;
>          __pos = this->_M_impl._M_finish - __elemsafter;
>          try
>            {
>              if (__elemsafter > difference_type(__n))
>  {
>    iterator __finish_n = (this->_M_impl._M_finish
>      - difference_type(__n));
>    std::__uninitialized_copy_a(__finish_n,
>           this->_M_impl._M_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish = __new_finish;
>    std::copy_backward(__pos, __finish_n, __old_finish);
>    std::copy(__first, __last, __pos);
>  }
>              else
>  {
>    _ForwardIterator __mid = __first;
>    std::advance(__mid, __elemsafter);
>    std::__uninitialized_copy_copy(__mid, __last, __pos,
>       this->_M_impl._M_finish,
>       this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>    this->_M_impl._M_finish = __new_finish;
>    std::copy(__first, __mid, __pos);
>  }
>            }
>          catch(...)
>            {
>              _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,
>          __new_finish._M_node + 1);
>              throw;
>            }
>        }
>      }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_new_elements_at_front(size_type __new_elems)
>    {
>      const size_type __new_nodes
> = (__new_elems + _S_buffer_size() - 1) / _S_buffer_size();
>      _M_reserve_map_at_front(__new_nodes);
>      size_type __i;
>      try
>        {
>          for (__i = 1; __i <= __new_nodes; ++__i)
>            *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node();
>        }
>      catch(...)
>        {
>          for (size_type __j = 1; __j < __i; ++__j)
>            _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j));
>          throw;
>        }
>    }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_new_elements_at_back(size_type __new_elems)
>    {
>      const size_type __new_nodes
> = (__new_elems + _S_buffer_size() - 1) / _S_buffer_size();
>      _M_reserve_map_at_back(__new_nodes);
>      size_type __i;
>      try
>        {
>          for (__i = 1; __i <= __new_nodes; ++__i)
>            *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node();
>        }
>      catch(...)
>        {
>          for (size_type __j = 1; __j < __i; ++__j)
>            _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j));
>          throw;
>        }
>    }
>
>  template <typename _Tp, typename _Alloc>
>    void
>    deque<_Tp, _Alloc>::
>    _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)
>    {
>      const size_type __old_num_nodes
> = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1;
>      const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;
>
>      _Map_pointer __new_nstart;
>      if (this->_M_impl._M_map_size > 2 * __new_num_nodes)
> {
>   __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size
>      - __new_num_nodes) / 2
>                  + (__add_at_front ? __nodes_to_add : 0);
>   if (__new_nstart < this->_M_impl._M_start._M_node)
>     std::copy(this->_M_impl._M_start._M_node,
>      this->_M_impl._M_finish._M_node + 1,
>      __new_nstart);
>   else
>     std::copy_backward(this->_M_impl._M_start._M_node,
>          this->_M_impl._M_finish._M_node + 1,
>          __new_nstart + __old_num_nodes);
> }
>      else
> {
>   size_type __new_map_size = this->_M_impl._M_map_size
>                              + std::max(this->_M_impl._M_map_size,
>      __nodes_to_add) + 2;
>
>   _Map_pointer __new_map = this->_M_allocate_map(__new_map_size);
>   __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2
>                  + (__add_at_front ? __nodes_to_add : 0);
>   std::copy(this->_M_impl._M_start._M_node,
>      this->_M_impl._M_finish._M_node + 1,
>      __new_nstart);
>   _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
>
>   this->_M_impl._M_map = __new_map;
>   this->_M_impl._M_map_size = __new_map_size;
> }
>
>      this->_M_impl._M_start._M_set_node(__new_nstart);
>      this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);
>    }
>}
># 74 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/deque" 2 3
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stack" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 3
>namespace std
>{
>
>
>  template<typename _Tp, typename _Sequence = deque<_Tp> >
>    class stack;
>
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y);
>
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y);
># 109 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 3
>  template<typename _Tp, typename _Sequence>
>    class stack
>    {
>
>      typedef typename _Sequence::value_type _Sequence_value_type;
>     
>     
>     
>
>      template<typename _Tp1, typename _Seq1>
>        friend bool
>        operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
>
>      template<typename _Tp1, typename _Seq1>
>        friend bool
>        operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
>
>    public:
>      typedef typename _Sequence::value_type value_type;
>      typedef typename _Sequence::reference reference;
>      typedef typename _Sequence::const_reference const_reference;
>      typedef typename _Sequence::size_type size_type;
>      typedef _Sequence container_type;
>
>    protected:
>
>      _Sequence c;
>
>    public:
>
>
>
>
>      explicit
>      stack(const _Sequence& __c = _Sequence())
>      : c(__c) {}
>
>
>
>
>      bool
>      empty() const
>      { return c.empty(); }
>
>
>      size_type
>      size() const
>      { return c.size(); }
>
>
>
>
>
>      reference
>      top()
>      {
> ;
> return c.back();
>      }
>
>
>
>
>
>      const_reference
>      top() const
>      {
> ;
> return c.back();
>      }
># 189 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 3
>      void
>      push(const value_type& __x)
>      { c.push_back(__x); }
># 204 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 3
>      void
>      pop()
>      {
> ;
> c.pop_back();
>      }
>    };
># 224 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 3
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
>    { return __x.c == __y.c; }
># 242 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_stack.h" 3
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
>    { return __x.c < __y.c; }
>
>
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Tp, typename _Seq>
>    inline bool
>    operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
>    { return !(__x < __y); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/stack" 2 3
># 25 "UBSocket.h" 2
>
># 1 "../include/TcpSocket.h" 1
># 32 "../include/TcpSocket.h"
># 1 "../include/sockets-config.h" 1
># 33 "../include/TcpSocket.h" 2
># 1 "../include/StreamSocket.h" 1
>
>
>
># 1 "../include/Socket.h" 1
># 36 "../include/Socket.h"
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/list" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/list" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/list" 3
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>namespace std
>{
>
>
>
>
>
>
>  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);
>
>    void
>    transfer(_List_node_base * const __first,
>      _List_node_base * const __last);
>
>    void
>    reverse();
>
>    void
>    hook(_List_node_base * const __position);
>
>    void
>    unhook();
>  };
>
>
>  template<typename _Tp>
>    struct _List_node : public _List_node_base
>    {
>      _Tp _M_data;
>    };
># 110 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>  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(_List_node_base* __x)
>      : _M_node(__x) { }
>
>
>      reference
>      operator*() const
>      { return static_cast<_Node*>(_M_node)->_M_data; }
>
>      pointer
>      operator->() const
>      { return &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; }
>
>
>      _List_node_base* _M_node;
>    };
># 187 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>  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 _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 &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 _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:
># 297 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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
>      {
> _List_node_base _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()
>      { return _M_impl._Node_alloc_type::allocate(1); }
>
>      void
>      _M_put_node(_List_node<_Tp>* __p)
>      { _M_impl._Node_alloc_type::deallocate(__p, 1); }
>
>  public:
>      typedef _Alloc allocator_type;
>
>      _Tp_alloc_type
>      _M_get_Tp_allocator() const
>      { return *static_cast<const _Node_alloc_type*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return _M_get_Tp_allocator(); }
>
>      _List_base(const allocator_type& __a)
>      : _M_impl(__a)
>      { _M_init(); }
>
>
>      ~_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;
>      }
>    };
># 397 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>
>    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;
># 445 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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(&__p->_M_data, __x);
>   }
> catch(...)
>   {
>     _M_put_node(__p);
>     throw;
>   }
> return __p;
>      }
>
>    public:
>
>
>
>
>
>      explicit
>      list(const allocator_type& __a = allocator_type())
>      : _Base(__a) { }
># 478 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      explicit
>      list(size_type __n, const value_type& __value = value_type(),
>    const allocator_type& __a = allocator_type())
>      : _Base(__a)
>      { this->insert(begin(), __n, __value); }
># 491 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      list(const list& __x)
>      : _Base(__x.get_allocator())
>      { this->insert(begin(), __x.begin(), __x.end()); }
># 509 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      template<typename _InputIterator>
>        list(_InputIterator __first, _InputIterator __last,
>      const allocator_type& __a = allocator_type())
>        : _Base(__a)
>        { this->insert(begin(), __first, __last); }
># 530 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      list&
>      operator=(const list& __x);
># 543 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 559 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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());
> }
>
>
>      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()); }
>
>
>
>
>
>
>      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 size_type(-1); }
># 674 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>      }
># 729 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      push_front(const value_type& __x)
>      { this->_M_insert(begin(), __x); }
># 745 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      pop_front()
>      { this->_M_erase(begin()); }
># 759 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      push_back(const value_type& __x)
>      { this->_M_insert(end(), __x); }
># 774 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      pop_back()
>      { this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); }
># 789 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x);
># 805 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 823 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.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());
> }
># 848 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      iterator
>      erase(iterator __position);
># 870 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      iterator
>      erase(iterator __first, iterator __last)
>      {
> while (__first != __last)
>   __first = erase(__first);
> return __last;
>      }
># 887 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      swap(list& __x)
>      { _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node); }
>
>
>
>
>
>
>
>      void
>      clear()
>      {
>        _Base::_M_clear();
>        _Base::_M_init();
>      }
># 914 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      splice(iterator __position, list& __x)
>      {
> if (!__x.empty())
>   this->_M_transfer(__position, __x.begin(), __x.end());
>      }
># 930 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      splice(iterator __position, list&, iterator __i)
>      {
> iterator __j = __i;
> ++__j;
> if (__position == __i || __position == __j)
>   return;
> this->_M_transfer(__position, __i, __j);
>      }
># 952 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      splice(iterator __position, list&, iterator __first, iterator __last)
>      {
> if (__first != __last)
>   this->_M_transfer(__position, __first, __last);
>      }
># 970 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      remove(const _Tp& __value);
># 984 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      template<typename _Predicate>
>      void
>      remove_if(_Predicate);
># 998 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      unique();
># 1013 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      template<typename _BinaryPredicate>
>        void
>        unique(_BinaryPredicate);
># 1026 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      void
>      merge(list& __x);
># 1041 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_list.h" 3
>      template<typename _StrictWeakOrdering>
>        void
>        merge(list&, _StrictWeakOrdering);
>
>
>
>
>
>
>      void
>      reverse()
>      { this->_M_impl._M_node.reverse(); }
>
>
>
>
>
>
>
>      void
>      sort();
>
>
>
>
>
>
>
>      template<typename _StrictWeakOrdering>
>        void
>        sort(_StrictWeakOrdering);
>
>    protected:
>
>
>
>      template<typename _Integer>
>        void
>        _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>        {
>   _M_fill_assign(static_cast<size_type>(__n),
>    static_cast<value_type>(__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);
>
>
>
>
>
>      template<typename _Integer>
>        void
>        _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
>      __true_type)
>        {
>   _M_fill_insert(__pos, static_cast<size_type>(__n),
>    static_cast<value_type>(__x));
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_insert_dispatch(iterator __pos,
>      _InputIterator __first, _InputIterator __last,
>      __false_type)
>        {
>   for (; __first != __last; ++__first)
>     _M_insert(__pos, *__first);
> }
>
>
>
>      void
>      _M_fill_insert(iterator __pos, size_type __n, const value_type& __x)
>      {
> for (; __n > 0; --__n)
>   _M_insert(__pos, __x);
>      }
>
>
>
>      void
>      _M_transfer(iterator __position, iterator __first, iterator __last)
>      { __position._M_node->transfer(__first._M_node, __last._M_node); }
>
>
>      void
>      _M_insert(iterator __position, const value_type& __x)
>      {
>        _Node* __tmp = _M_create_node(__x);
>        __tmp->hook(__position._M_node);
>      }
>
>
>      void
>      _M_erase(iterator __position)
>      {
>        __position._M_node->unhook();
>        _Node* __n = static_cast<_Node*>(__position._M_node);
>        _M_get_Tp_allocator().destroy(&__n->_M_data);
>        _M_put_node(__n);
>      }
>    };
># 1164 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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;
>    }
># 1193 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/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); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/list" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/list.tcc" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/list.tcc" 3
>namespace std
>{
>  template<typename _Tp, typename _Alloc>
>    void
>    _List_base<_Tp, _Alloc>::
>    _M_clear()
>    {
>      typedef _List_node<_Tp> _Node;
>      _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next);
>      while (__cur != &this->_M_impl._M_node)
> {
>   _Node* __tmp = __cur;
>   __cur = static_cast<_Node*>(__cur->_M_next);
>   _M_get_Tp_allocator().destroy(&__tmp->_M_data);
>   _M_put_node(__tmp);
> }
>    }
>
>  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->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;
>    }
>
>  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();
>      while (__first != __last)
> {
>   iterator __next = __first;
>   ++__next;
>   if (*__first == __value)
>     _M_erase(__first);
>   __first = __next;
> }
>    }
>
>  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)
> {
>   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>
>    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>::
>      merge(list& __x, _StrictWeakOrdering __comp)
>      {
>
>
> if (this != &__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>
>    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));
>   }
>      }
>}
># 74 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/list" 2 3
># 37 "../include/Socket.h" 2
>
>
>
>
># 1 "../include/socket_include.h" 1
># 49 "../include/socket_include.h"
># 1 "/usr/include/sys/param.h" 1 3 4
># 22 "/usr/include/sys/param.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 1 3 4
># 23 "/usr/include/sys/param.h" 2 3 4
>
># 1 "/usr/include/linux/param.h" 1 3 4
>
>
>
># 1 "/usr/include/asm/param.h" 1 3 4
># 5 "/usr/include/linux/param.h" 2 3 4
># 25 "/usr/include/sys/param.h" 2 3 4
># 50 "../include/socket_include.h" 2
>
>
>
>
>
>
>
># 1 "/usr/include/sys/time.h" 1 3 4
># 29 "/usr/include/sys/time.h" 3 4
># 1 "/usr/include/bits/time.h" 1 3 4
># 30 "/usr/include/sys/time.h" 2 3 4
># 39 "/usr/include/sys/time.h" 3 4
>extern "C" {
># 57 "/usr/include/sys/time.h" 3 4
>struct timezone
>  {
>    int tz_minuteswest;
>    int tz_dsttime;
>  };
>
>typedef struct timezone *__restrict __timezone_ptr_t;
># 73 "/usr/include/sys/time.h" 3 4
>extern int gettimeofday (struct timeval *__restrict __tv,
>    __timezone_ptr_t __tz) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int settimeofday (__const struct timeval *__tv,
>    __const struct timezone *__tz)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int adjtime (__const struct timeval *__delta,
>      struct timeval *__olddelta) throw ();
>
>
>
>
>enum __itimer_which
>  {
>
>    ITIMER_REAL = 0,
>
>
>    ITIMER_VIRTUAL = 1,
>
>
>
>    ITIMER_PROF = 2
>
>  };
>
>
>
>struct itimerval
>  {
>
>    struct timeval it_interval;
>
>    struct timeval it_value;
>  };
>
>
>
>
>
>
>typedef int __itimer_which_t;
>
>
>
>
>extern int getitimer (__itimer_which_t __which,
>        struct itimerval *__value) throw ();
>
>
>
>
>extern int setitimer (__itimer_which_t __which,
>        __const struct itimerval *__restrict __new,
>        struct itimerval *__restrict __old) throw ();
>
>
>
>
>extern int utimes (__const char *__file, __const struct timeval __tvp[2])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int lutimes (__const char *__file, __const struct timeval __tvp[2])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int futimes (int __fd, __const struct timeval __tvp[2]) throw ();
>
>
>
>
>
>
>extern int futimesat (int __fd, __const char *__file,
>        __const struct timeval __tvp[2]) throw ();
># 191 "/usr/include/sys/time.h" 3 4
>}
># 58 "../include/socket_include.h" 2
>
># 1 "/usr/include/sys/socket.h" 1 3 4
># 26 "/usr/include/sys/socket.h" 3 4
>extern "C" {
>
># 1 "/usr/include/sys/uio.h" 1 3 4
># 26 "/usr/include/sys/uio.h" 3 4
>extern "C" {
>
>
># 1 "/usr/include/bits/uio.h" 1 3 4
># 44 "/usr/include/bits/uio.h" 3 4
>struct iovec
>  {
>    void *iov_base;
>    size_t iov_len;
>  };
># 30 "/usr/include/sys/uio.h" 2 3 4
># 40 "/usr/include/sys/uio.h" 3 4
>extern ssize_t readv (int __fd, __const struct iovec *__iovec, int __count);
># 50 "/usr/include/sys/uio.h" 3 4
>extern ssize_t writev (int __fd, __const struct iovec *__iovec, int __count);
>
>}
># 29 "/usr/include/sys/socket.h" 2 3 4
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 31 "/usr/include/sys/socket.h" 2 3 4
>
>
>
>
>
># 1 "/usr/include/bits/socket.h" 1 3 4
># 30 "/usr/include/bits/socket.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 31 "/usr/include/bits/socket.h" 2 3 4
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 1 3 4
># 33 "/usr/include/bits/socket.h" 2 3 4
># 42 "/usr/include/bits/socket.h" 3 4
>enum __socket_type
>{
>  SOCK_STREAM = 1,
>
>
>  SOCK_DGRAM = 2,
>
>
>  SOCK_RAW = 3,
>
>  SOCK_RDM = 4,
>
>  SOCK_SEQPACKET = 5,
>
>
>  SOCK_PACKET = 10
>
>
>
>};
># 147 "/usr/include/bits/socket.h" 3 4
># 1 "/usr/include/bits/sockaddr.h" 1 3 4
># 29 "/usr/include/bits/sockaddr.h" 3 4
>typedef unsigned short int sa_family_t;
># 148 "/usr/include/bits/socket.h" 2 3 4
>
>
>struct sockaddr
>  {
>    sa_family_t sa_family;
>    char sa_data[14];
>  };
># 167 "/usr/include/bits/socket.h" 3 4
>struct sockaddr_storage
>  {
>    sa_family_t ss_family;
>    __uint32_t __ss_align;
>    char __ss_padding[(128 - (2 * sizeof (__uint32_t)))];
>  };
>
>
>
>enum
>  {
>    MSG_OOB = 0x01,
>
>    MSG_PEEK = 0x02,
>
>    MSG_DONTROUTE = 0x04,
>
>
>
>    MSG_TRYHARD = MSG_DONTROUTE,
>
>
>    MSG_CTRUNC = 0x08,
>
>    MSG_PROXY = 0x10,
>
>    MSG_TRUNC = 0x20,
>
>    MSG_DONTWAIT = 0x40,
>
>    MSG_EOR = 0x80,
>
>    MSG_WAITALL = 0x100,
>
>    MSG_FIN = 0x200,
>
>    MSG_SYN = 0x400,
>
>    MSG_CONFIRM = 0x800,
>
>    MSG_RST = 0x1000,
>
>    MSG_ERRQUEUE = 0x2000,
>
>    MSG_NOSIGNAL = 0x4000,
>
>    MSG_MORE = 0x8000,
>
>
>    MSG_CMSG_CLOEXEC = 0x40000000
>
>
>
>  };
>
>
>
>
>struct msghdr
>  {
>    void *msg_name;
>    socklen_t msg_namelen;
>
>    struct iovec *msg_iov;
>    size_t msg_iovlen;
>
>    void *msg_control;
>    size_t msg_controllen;
>
>
>
>
>    int msg_flags;
>  };
>
>
>struct cmsghdr
>  {
>    size_t cmsg_len;
>
>
>
>
>    int cmsg_level;
>    int cmsg_type;
>
>    __extension__ unsigned char __cmsg_data [];
>
>  };
># 273 "/usr/include/bits/socket.h" 3 4
>extern struct cmsghdr *__cmsg_nxthdr (struct msghdr *__mhdr,
>          struct cmsghdr *__cmsg) throw ();
># 300 "/usr/include/bits/socket.h" 3 4
>enum
>  {
>    SCM_RIGHTS = 0x01
>
>
>    , SCM_CREDENTIALS = 0x02
>
>
>  };
>
>
>
>struct ucred
>{
>  pid_t pid;
>  uid_t uid;
>  gid_t gid;
>};
>
>
># 1 "/usr/include/asm/socket.h" 1 3 4
>
>
>
># 1 "/usr/include/asm/sockios.h" 1 3 4
># 5 "/usr/include/asm/socket.h" 2 3 4
># 321 "/usr/include/bits/socket.h" 2 3 4
>
>
>
>struct linger
>  {
>    int l_onoff;
>    int l_linger;
>  };
># 37 "/usr/include/sys/socket.h" 2 3 4
>
>
>
>
>struct osockaddr
>  {
>    unsigned short int sa_family;
>    unsigned char sa_data[14];
>  };
>
>
>
>
>enum
>{
>  SHUT_RD = 0,
>
>  SHUT_WR,
>
>  SHUT_RDWR
>
>};
># 101 "/usr/include/sys/socket.h" 3 4
>extern int socket (int __domain, int __type, int __protocol) throw ();
>
>
>
>
>
>extern int socketpair (int __domain, int __type, int __protocol,
>         int __fds[2]) throw ();
>
>
>extern int bind (int __fd, __const struct sockaddr * __addr, socklen_t __len)
>     throw ();
>
>
>extern int getsockname (int __fd, struct sockaddr *__restrict __addr,
>   socklen_t *__restrict __len) throw ();
># 125 "/usr/include/sys/socket.h" 3 4
>extern int connect (int __fd, __const struct sockaddr * __addr, socklen_t __len);
>
>
>
>extern int getpeername (int __fd, struct sockaddr *__restrict __addr,
>   socklen_t *__restrict __len) throw ();
>
>
>
>
>
>
>extern ssize_t send (int __fd, __const void *__buf, size_t __n, int __flags);
>
>
>
>
>
>
>extern ssize_t recv (int __fd, void *__buf, size_t __n, int __flags);
>
>
>
>
>
>
>extern ssize_t sendto (int __fd, __const void *__buf, size_t __n,
>         int __flags, __const struct sockaddr * __addr,
>         socklen_t __addr_len);
># 162 "/usr/include/sys/socket.h" 3 4
>extern ssize_t recvfrom (int __fd, void *__restrict __buf, size_t __n,
>    int __flags, struct sockaddr *__restrict __addr,
>    socklen_t *__restrict __addr_len);
>
>
>
>
>
>
>
>extern ssize_t sendmsg (int __fd, __const struct msghdr *__message,
>   int __flags);
>
>
>
>
>
>
>extern ssize_t recvmsg (int __fd, struct msghdr *__message, int __flags);
>
>
>
>
>
>extern int getsockopt (int __fd, int __level, int __optname,
>         void *__restrict __optval,
>         socklen_t *__restrict __optlen) throw ();
>
>
>
>
>extern int setsockopt (int __fd, int __level, int __optname,
>         __const void *__optval, socklen_t __optlen) throw ();
>
>
>
>
>
>extern int listen (int __fd, int __n) throw ();
># 210 "/usr/include/sys/socket.h" 3 4
>extern int accept (int __fd, struct sockaddr *__restrict __addr,
>     socklen_t *__restrict __addr_len);
>
>
>
>
>
>
>
>extern int shutdown (int __fd, int __how) throw ();
>
>
>
>
>extern int sockatmark (int __fd) throw ();
>
>
>
>
>
>
>
>extern int isfdtype (int __fd, int __fdtype) throw ();
># 241 "/usr/include/sys/socket.h" 3 4
>}
># 60 "../include/socket_include.h" 2
># 1 "/usr/include/netinet/in.h" 1 3 4
># 29 "/usr/include/netinet/in.h" 3 4
>extern "C" {
>
>
>enum
>  {
>    IPPROTO_IP = 0,
>
>    IPPROTO_HOPOPTS = 0,
>
>    IPPROTO_ICMP = 1,
>
>    IPPROTO_IGMP = 2,
>
>    IPPROTO_IPIP = 4,
>
>    IPPROTO_TCP = 6,
>
>    IPPROTO_EGP = 8,
>
>    IPPROTO_PUP = 12,
>
>    IPPROTO_UDP = 17,
>
>    IPPROTO_IDP = 22,
>
>    IPPROTO_TP = 29,
>
>    IPPROTO_IPV6 = 41,
>
>    IPPROTO_ROUTING = 43,
>
>    IPPROTO_FRAGMENT = 44,
>
>    IPPROTO_RSVP = 46,
>
>    IPPROTO_GRE = 47,
>
>    IPPROTO_ESP = 50,
>
>    IPPROTO_AH = 51,
>
>    IPPROTO_ICMPV6 = 58,
>
>    IPPROTO_NONE = 59,
>
>    IPPROTO_DSTOPTS = 60,
>
>    IPPROTO_MTP = 92,
>
>    IPPROTO_ENCAP = 98,
>
>    IPPROTO_PIM = 103,
>
>    IPPROTO_COMP = 108,
>
>    IPPROTO_SCTP = 132,
>
>    IPPROTO_RAW = 255,
>
>    IPPROTO_MAX
>  };
>
>
>
>typedef uint16_t in_port_t;
>
>
>enum
>  {
>    IPPORT_ECHO = 7,
>    IPPORT_DISCARD = 9,
>    IPPORT_SYSTAT = 11,
>    IPPORT_DAYTIME = 13,
>    IPPORT_NETSTAT = 15,
>    IPPORT_FTP = 21,
>    IPPORT_TELNET = 23,
>    IPPORT_SMTP = 25,
>    IPPORT_TIMESERVER = 37,
>    IPPORT_NAMESERVER = 42,
>    IPPORT_WHOIS = 43,
>    IPPORT_MTP = 57,
>
>    IPPORT_TFTP = 69,
>    IPPORT_RJE = 77,
>    IPPORT_FINGER = 79,
>    IPPORT_TTYLINK = 87,
>    IPPORT_SUPDUP = 95,
>
>
>    IPPORT_EXECSERVER = 512,
>    IPPORT_LOGINSERVER = 513,
>    IPPORT_CMDSERVER = 514,
>    IPPORT_EFSSERVER = 520,
>
>
>    IPPORT_BIFFUDP = 512,
>    IPPORT_WHOSERVER = 513,
>    IPPORT_ROUTESERVER = 520,
>
>
>    IPPORT_RESERVED = 1024,
>
>
>    IPPORT_USERRESERVED = 5000
>  };
>
>
>
>typedef uint32_t in_addr_t;
>struct in_addr
>  {
>    in_addr_t s_addr;
>  };
># 194 "/usr/include/netinet/in.h" 3 4
>struct in6_addr
>  {
>    union
>      {
> uint8_t u6_addr8[16];
> uint16_t u6_addr16[8];
> uint32_t u6_addr32[4];
>      } in6_u;
>
>
>
>  };
>
>extern const struct in6_addr in6addr_any;
>extern const struct in6_addr in6addr_loopback;
># 217 "/usr/include/netinet/in.h" 3 4
>struct sockaddr_in
>  {
>    sa_family_t sin_family;
>    in_port_t sin_port;
>    struct in_addr sin_addr;
>
>
>    unsigned char sin_zero[sizeof (struct sockaddr) -
>      (sizeof (unsigned short int)) -
>      sizeof (in_port_t) -
>      sizeof (struct in_addr)];
>  };
>
>
>struct sockaddr_in6
>  {
>    sa_family_t sin6_family;
>    in_port_t sin6_port;
>    uint32_t sin6_flowinfo;
>    struct in6_addr sin6_addr;
>    uint32_t sin6_scope_id;
>  };
>
>
>
>struct ip_mreq
>  {
>
>    struct in_addr imr_multiaddr;
>
>
>    struct in_addr imr_interface;
>  };
>
>struct ip_mreq_source
>  {
>
>    struct in_addr imr_multiaddr;
>
>
>    struct in_addr imr_interface;
>
>
>    struct in_addr imr_sourceaddr;
>  };
>
>
>struct ipv6_mreq
>  {
>
>    struct in6_addr ipv6mr_multiaddr;
>
>
>    unsigned int ipv6mr_interface;
>  };
>
>
>
>struct group_req
>  {
>
>    uint32_t gr_interface;
>
>
>    struct sockaddr_storage gr_group;
>  };
>
>struct group_source_req
>  {
>
>    uint32_t gsr_interface;
>
>
>    struct sockaddr_storage gsr_group;
>
>
>    struct sockaddr_storage gsr_source;
>  };
>
>
>
>struct ip_msfilter
>  {
>
>    struct in_addr imsf_multiaddr;
>
>
>    struct in_addr imsf_interface;
>
>
>    uint32_t imsf_fmode;
>
>
>    uint32_t imsf_numsrc;
>
>    struct in_addr imsf_slist[1];
>  };
>
>
>
>
>
>struct group_filter
>  {
>
>    uint32_t gf_interface;
>
>
>    struct sockaddr_storage gf_group;
>
>
>    uint32_t gf_fmode;
>
>
>    uint32_t gf_numsrc;
>
>    struct sockaddr_storage gf_slist[1];
>};
># 343 "/usr/include/netinet/in.h" 3 4
># 1 "/usr/include/bits/in.h" 1 3 4
># 82 "/usr/include/bits/in.h" 3 4
>struct ip_opts
>  {
>    struct in_addr ip_dst;
>    char ip_opts[40];
>  };
>
>
>struct ip_mreqn
>  {
>    struct in_addr imr_multiaddr;
>    struct in_addr imr_address;
>    int imr_ifindex;
>  };
>
>
>struct in_pktinfo
>  {
>    int ipi_ifindex;
>    struct in_addr ipi_spec_dst;
>    struct in_addr ipi_addr;
>  };
># 344 "/usr/include/netinet/in.h" 2 3 4
># 352 "/usr/include/netinet/in.h" 3 4
>extern uint32_t ntohl (uint32_t __netlong) throw () __attribute__ ((__const__));
>extern uint16_t ntohs (uint16_t __netshort)
>     throw () __attribute__ ((__const__));
>extern uint32_t htonl (uint32_t __hostlong)
>     throw () __attribute__ ((__const__));
>extern uint16_t htons (uint16_t __hostshort)
>     throw () __attribute__ ((__const__));
>
>
>
>
># 1 "/usr/include/bits/byteswap.h" 1 3 4
># 364 "/usr/include/netinet/in.h" 2 3 4
># 426 "/usr/include/netinet/in.h" 3 4
>extern int bindresvport (int __sockfd, struct sockaddr_in *__sock_in) throw ();
>
>
>extern int bindresvport6 (int __sockfd, struct sockaddr_in6 *__sock_in)
>     throw ();
># 454 "/usr/include/netinet/in.h" 3 4
>struct in6_pktinfo
>  {
>    struct in6_addr ipi6_addr;
>    unsigned int ipi6_ifindex;
>  };
>
>
>struct ip6_mtuinfo
>  {
>    struct sockaddr_in6 ip6m_addr;
>    uint32_t ip6m_mtu;
>  };
>
>
>
>
>extern int inet6_option_space (int __nbytes)
>     throw () __attribute__ ((__deprecated__));
>extern int inet6_option_init (void *__bp, struct cmsghdr **__cmsgp,
>         int __type) throw () __attribute__ ((__deprecated__));
>extern int inet6_option_append (struct cmsghdr *__cmsg,
>    __const uint8_t *__typep, int __multx,
>    int __plusy) throw () __attribute__ ((__deprecated__));
>extern uint8_t *inet6_option_alloc (struct cmsghdr *__cmsg, int __datalen,
>        int __multx, int __plusy)
>     throw () __attribute__ ((__deprecated__));
>extern int inet6_option_next (__const struct cmsghdr *__cmsg,
>         uint8_t **__tptrp)
>     throw () __attribute__ ((__deprecated__));
>extern int inet6_option_find (__const struct cmsghdr *__cmsg,
>         uint8_t **__tptrp, int __type)
>     throw () __attribute__ ((__deprecated__));
>
>
>
>extern int inet6_opt_init (void *__extbuf, socklen_t __extlen) throw ();
>extern int inet6_opt_append (void *__extbuf, socklen_t __extlen, int __offset,
>        uint8_t __type, socklen_t __len, uint8_t __align,
>        void **__databufp) throw ();
>extern int inet6_opt_finish (void *__extbuf, socklen_t __extlen, int __offset)
>     throw ();
>extern int inet6_opt_set_val (void *__databuf, int __offset, void *__val,
>         socklen_t __vallen) throw ();
>extern int inet6_opt_next (void *__extbuf, socklen_t __extlen, int __offset,
>      uint8_t *__typep, socklen_t *__lenp,
>      void **__databufp) throw ();
>extern int inet6_opt_find (void *__extbuf, socklen_t __extlen, int __offset,
>      uint8_t __type, socklen_t *__lenp,
>      void **__databufp) throw ();
>extern int inet6_opt_get_val (void *__databuf, int __offset, void *__val,
>         socklen_t __vallen) throw ();
>
>
>
>extern socklen_t inet6_rth_space (int __type, int __segments) throw ();
>extern void *inet6_rth_init (void *__bp, socklen_t __bp_len, int __type,
>        int __segments) throw ();
>extern int inet6_rth_add (void *__bp, __const struct in6_addr *__addr) throw ();
>extern int inet6_rth_reverse (__const void *__in, void *__out) throw ();
>extern int inet6_rth_segments (__const void *__bp) throw ();
>extern struct in6_addr *inet6_rth_getaddr (__const void *__bp, int __index)
>     throw ();
>
>
>
>
>
>extern int getipv4sourcefilter (int __s, struct in_addr __interface_addr,
>    struct in_addr __group, uint32_t *__fmode,
>    uint32_t *__numsrc, struct in_addr *__slist)
>     throw ();
>
>
>extern int setipv4sourcefilter (int __s, struct in_addr __interface_addr,
>    struct in_addr __group, uint32_t __fmode,
>    uint32_t __numsrc,
>    __const struct in_addr *__slist)
>     throw ();
>
>
>
>extern int getsourcefilter (int __s, uint32_t __interface_addr,
>       __const struct sockaddr *__group,
>       socklen_t __grouplen, uint32_t *__fmode,
>       uint32_t *__numsrc,
>       struct sockaddr_storage *__slist) throw ();
>
>
>extern int setsourcefilter (int __s, uint32_t __interface_addr,
>       __const struct sockaddr *__group,
>       socklen_t __grouplen, uint32_t __fmode,
>       uint32_t __numsrc,
>       __const struct sockaddr_storage *__slist) throw ();
>
>
>}
># 61 "../include/socket_include.h" 2
># 1 "/usr/include/arpa/inet.h" 1 3 4
># 31 "/usr/include/arpa/inet.h" 3 4
>extern "C" {
>
>
>
>extern in_addr_t inet_addr (__const char *__cp) throw ();
>
>
>extern in_addr_t inet_lnaof (struct in_addr __in) throw ();
>
>
>
>extern struct in_addr inet_makeaddr (in_addr_t __net, in_addr_t __host)
>     throw ();
>
>
>extern in_addr_t inet_netof (struct in_addr __in) throw ();
>
>
>
>extern in_addr_t inet_network (__const char *__cp) throw ();
>
>
>
>extern char *inet_ntoa (struct in_addr __in) throw ();
>
>
>
>
>extern int inet_pton (int __af, __const char *__restrict __cp,
>        void *__restrict __buf) throw ();
>
>
>
>
>extern __const char *inet_ntop (int __af, __const void *__restrict __cp,
>    char *__restrict __buf, socklen_t __len)
>     throw ();
>
>
>
>
>
>
>extern int inet_aton (__const char *__cp, struct in_addr *__inp) throw ();
>
>
>
>extern char *inet_neta (in_addr_t __net, char *__buf, size_t __len) throw ();
>
>
>
>
>extern char *inet_net_ntop (int __af, __const void *__cp, int __bits,
>       char *__buf, size_t __len) throw ();
>
>
>
>
>extern int inet_net_pton (int __af, __const char *__cp,
>     void *__buf, size_t __len) throw ();
>
>
>
>
>extern unsigned int inet_nsap_addr (__const char *__cp,
>        unsigned char *__buf, int __len) throw ();
>
>
>
>extern char *inet_nsap_ntoa (int __len, __const unsigned char *__cp,
>        char *__buf) throw ();
>
>
>}
># 62 "../include/socket_include.h" 2
>
>
>
>
>typedef int SOCKET;
># 240 "../include/socket_include.h"
>typedef unsigned long ipaddr_t;
>typedef unsigned short port_t;
># 258 "../include/socket_include.h"
> typedef std::list<SOCKET> socket_v;
># 42 "../include/Socket.h" 2
>
># 1 "../include/Utility.h" 1
># 46 "../include/Utility.h"
># 1 "../include/Base64.h" 1
># 50 "../include/Base64.h"
>class Base64
>{
>public:
> Base64();
>
> void encode(FILE *, std::string& , bool add_crlf = true);
> void encode(const std::string&, std::string& , bool add_crlf = true);
> void encode(const char *, size_t, std::string& , bool add_crlf = true);
> void encode(const unsigned char *, size_t, std::string& , bool add_crlf = true);
>
> void decode(const std::string&, std::string& );
> void decode(const std::string&, unsigned char *, size_t&);
>
> size_t decode_length(const std::string& );
>
>private:
> Base64(const Base64& ) {}
> Base64& operator=(const Base64& ) { return *this; }
>static const char *bstr;
>static const char rstr[128];
>};
># 47 "../include/Utility.h" 2
>
>
>
>
>
>
>class SocketAddress;
>
>
>
>class Utility
>{
>public:
> static std::string base64(const std::string& str_in);
> static std::string base64d(const std::string& str_in);
> static std::string l2string(long l);
> static std::string bigint2string(uint64_t l);
> static uint64_t atoi64(const std::string& str);
> static unsigned int hex2unsigned(const std::string& str);
> static std::string rfc1738_encode(const std::string& src);
> static std::string rfc1738_decode(const std::string& src);
>
>
> static bool isipv4(const std::string&);
>
> static bool isipv6(const std::string&);
>
>
> static bool u2ip(const std::string&, ipaddr_t&);
> static bool u2ip(const std::string&, struct sockaddr_in& sa, int ai_flags = 0);
># 87 "../include/Utility.h"
> static bool reverse(struct sockaddr *sa, socklen_t sa_len, std::string&, int flags = 0);
> static bool reverse(struct sockaddr *sa, socklen_t sa_len, std::string& hostname, std::string& service, int flags = 0);
>
> static bool u2service(const std::string& name, int& service, int ai_flags = 0);
>
>
> static void l2ip(const ipaddr_t,std::string& );
> static void l2ip(const in_addr&,std::string& );
># 105 "../include/Utility.h"
> static void ResolveLocal();
>
>
> static const std::string& GetLocalHostname();
>
>
> static ipaddr_t GetLocalIP();
>
>
> static const std::string& GetLocalAddress();
># 128 "../include/Utility.h"
> static void SetEnv(const std::string& var,const std::string& value);
>
>
> static std::string Sa2String(struct sockaddr *sa);
>
>
> static void GetTime(struct timeval *);
>
> static std::auto_ptr<SocketAddress> CreateAddress(struct sockaddr *,socklen_t);
>
> static unsigned long ThreadID();
>
> static std::string ToLower(const std::string& str);
> static std::string ToUpper(const std::string& str);
>
> static std::string ToString(double d);
>
>private:
> static std::string m_host;
> static ipaddr_t m_ip;
> static std::string m_addr;
>
>
>
>
>
>
> static bool m_local_resolved;
>};
># 44 "../include/Socket.h" 2
># 1 "../include/SocketAddress.h" 1
># 47 "../include/SocketAddress.h"
>class SocketAddress
>{
>public:
> virtual ~SocketAddress() {}
>
>
> virtual operator struct sockaddr *() = 0;
>
>
> virtual operator socklen_t() = 0;
>
>
> virtual bool operator==(SocketAddress&) = 0;
>
>
>
> virtual void SetPort(port_t port) = 0;
>
>
>
> virtual port_t GetPort() = 0;
>
>
>
> virtual void SetAddress(struct sockaddr *sa) = 0;
>
>
> virtual std::string Convert(bool include_port) = 0;
>
>
> virtual std::string Reverse() = 0;
>
>
> virtual int GetFamily() = 0;
>
>
> virtual bool IsValid() = 0;
>
>
> virtual std::auto_ptr<SocketAddress> GetCopy() = 0;
>};
># 45 "../include/Socket.h" 2
># 1 "../include/Thread.h" 1
># 49 "../include/Thread.h"
>typedef void * threadfunc_t;
>typedef void * threadparam_t;
># 61 "../include/Thread.h"
>class Thread
>{
>public:
> Thread(bool release = true);
> virtual ~Thread();
>
> static threadfunc_t StartThread(threadparam_t);
>
> virtual void Run() = 0;
>
> bool IsRunning();
> void SetRunning(bool x);
> bool IsReleased();
> void SetRelease(bool x);
> bool DeleteOnExit();
> void SetDeleteOnExit(bool x = true);
> bool IsDestructor();
>
>private:
> Thread(const Thread& ) {}
> Thread& operator=(const Thread& ) { return *this; }
>
>
>
>
> pthread_t m_thread;
>
> bool m_running;
> bool m_release;
> bool m_b_delete_on_exit;
> bool m_b_destructor;
>};
># 46 "../include/Socket.h" 2
>
>
>
>
>
>
>
>class ISocketHandler;
>class SocketAddress;
>class IFile;
>
>
>
>
>
>class Socket
>{
> friend class ISocketHandler;
># 138 "../include/Socket.h"
>public:
>
> Socket(ISocketHandler&);
>
> virtual ~Socket();
>
>
>
>
>
> virtual Socket *Create() { return __null; }
>
>
>
>
> ISocketHandler& Handler() const;
>
>
>
>
>
> ISocketHandler& MasterHandler() const;
># 168 "../include/Socket.h"
> virtual void Init();
>
>
>
>
>
> SOCKET CreateSocket(int af,int type,const std::string& protocol = "");
>
>
>
> void Attach(SOCKET s);
>
>
> SOCKET GetSocket();
>
>
>
> virtual int Close();
>
>
> void Set(bool bRead,bool bWrite,bool bException = true);
>
>
>
> virtual bool Ready();
>
>
>
> Socket *GetParent();
>
>
>
> void SetParent(Socket *);
>
>
> virtual port_t GetPort();
>
>
> bool SetNonblocking(bool);
>
>
> bool SetNonblocking(bool, SOCKET);
>
>
> time_t Uptime();
>
>
> void SetClientRemoteAddress(SocketAddress&);
>
>
> std::auto_ptr<SocketAddress> GetClientRemoteAddress();
>
>
> virtual void SendBuf(const char *,size_t,int = 0);
>
>
> virtual void Send(const std::string&,int = 0);
>
>
> virtual uint64_t GetBytesSent(bool clear = false);
>
>
> virtual uint64_t GetBytesReceived(bool clear = false);
>
>
>
>
> void SetTimeout(time_t secs);
>
>
> bool Timeout(time_t tnow);
>
>
> void SetRemoteAddress(SocketAddress&);
>
>
>
>
>
> virtual void OnRead();
>
> virtual void OnWrite();
>
> virtual void OnException();
>
> virtual void OnDelete();
>
> virtual void OnConnect();
>
> virtual void OnAccept();
>
>
> virtual void OnLine(const std::string& );
>
> virtual void OnConnectFailed();
>
>
>
>
>
>
> virtual void OnOptions(int family,int type,int protocol,SOCKET s) = 0;
>
> virtual bool OnConnectRetry();
>
>
> virtual void OnReconnect();
>
> virtual void OnDisconnect();
>
>
> virtual void OnTimeout();
>
> virtual void OnConnectTimeout();
>
>
>
>
>
>
> void SetDeleteByHandler(bool = true);
>
>
> bool DeleteByHandler();
>
>
>
>
> void SetCloseAndDelete(bool = true);
>
>
> bool CloseAndDelete();
>
>
> time_t TimeSinceClose();
>
>
> void DisableRead(bool x = true);
>
>
> bool IsDisableRead();
>
>
> void SetConnected(bool = true);
>
>
> bool IsConnected();
>
>
> void SetErasedByHandler(bool x = true);
>
> bool ErasedByHandler();
>
>
>
>
>
>
> std::auto_ptr<SocketAddress> GetRemoteSocketAddress();
>
> ipaddr_t GetRemoteIP4();
>
>
>
>
>
>
>
> port_t GetRemotePort();
>
> std::string GetRemoteAddress();
>
> std::string GetRemoteHostname();
># 354 "../include/Socket.h"
> bool SetIpOptions(const void *p, socklen_t len);
> bool SetIpTOS(unsigned char tos);
> unsigned char IpTOS();
> bool SetIpTTL(int ttl);
> int IpTTL();
> bool SetIpHdrincl(bool x = true);
> bool SetIpMulticastTTL(int);
> int IpMulticastTTL();
> bool SetMulticastLoop(bool x = true);
> bool IpAddMembership(struct ip_mreq&);
> bool IpDropMembership(struct ip_mreq&);
>
>
> bool SetIpPktinfo(bool x = true);
>
>
> bool SetIpRecvTOS(bool x = true);
>
>
> bool SetIpRecvTTL(bool x = true);
>
>
> bool SetIpRecvopts(bool x = true);
>
>
> bool SetIpRetopts(bool x = true);
>
>
> bool SetIpRecverr(bool x = true);
>
>
> bool SetIpMtudiscover(bool x = true);
>
>
>
>
>
> bool SetIpRouterAlert(bool x = true);
># 405 "../include/Socket.h"
> bool SoAcceptconn();
> bool SetSoBroadcast(bool x = true);
> bool SetSoDebug(bool x = true);
> int SoError();
> bool SetSoDontroute(bool x = true);
> bool SetSoLinger(int onoff, int linger);
> bool SetSoOobinline(bool x = true);
> bool SetSoRcvlowat(int);
> bool SetSoSndlowat(int);
> bool SetSoRcvtimeo(struct timeval&);
> bool SetSoSndtimeo(struct timeval&);
> bool SetSoRcvbuf(int);
> int SoRcvbuf();
> bool SetSoSndbuf(int);
> int SoSndbuf();
> int SoType();
> bool SetSoReuseaddr(bool x = true);
> bool SetSoKeepalive(bool x = true);
>
>
> bool SetSoBsdcompat(bool x = true);
>
>
> bool SetSoBindtodevice(const std::string& intf);
>
>
> bool SetSoPasscred(bool x = true);
>
>
> bool SoPeercred(struct ucred& );
>
>
> bool SetSoPriority(int);
>
>
> bool SetSoRcvbufforce(int);
>
>
> bool SetSoSndbufforce(int);
>
>
> bool SetSoTimestamp(bool x = true);
># 635 "../include/Socket.h"
> void SetTrafficMonitor(IFile *p) { m_traffic_monitor = p; }
># 651 "../include/Socket.h"
>protected:
>
> Socket() : m_handler(m_handler) {}
>
> Socket(const Socket& s) : m_handler(s.m_handler) {}
>
>
> Socket& operator=(const Socket& ) { return *this; }
>
>
> IFile *GetTrafficMonitor() { return m_traffic_monitor; }
>
>
>
>private:
> ISocketHandler& m_handler;
> SOCKET m_socket;
> bool m_bDel;
> bool m_bClose;
> time_t m_tCreate;
> Socket *m_parent;
> bool m_b_disable_read;
> bool m_connected;
> bool m_b_erased_by_handler;
> time_t m_tClose;
> std::auto_ptr<SocketAddress> m_client_remote_address;
> std::auto_ptr<SocketAddress> m_remote_address;
> IFile *m_traffic_monitor;
> time_t m_timeout_start;
> time_t m_timeout_limit;
># 717 "../include/Socket.h"
>};
># 5 "../include/StreamSocket.h" 2
># 14 "../include/StreamSocket.h"
>class StreamSocket : public Socket
>{
>public:
> StreamSocket(ISocketHandler& );
> ~StreamSocket();
>
>
> void SetConnecting(bool = true);
>
>
>
> bool Connecting();
>
>
>
>
> bool Ready();
>
>
>
> void SetConnectTimeout(int x);
>
>
>
> int GetConnectTimeout();
>
>
>
> void SetFlushBeforeClose(bool = true);
>
>
>
> bool GetFlushBeforeClose();
>
>
>
>
>
> void SetConnectionRetry(int n);
>
>
> int GetConnectionRetry();
>
>
> void IncreaseConnectionRetries();
>
>
> int GetConnectionRetries();
>
>
> void ResetConnectionRetries();
>
>
>
>
> void SetCallOnConnect(bool x = true);
>
>
>
> bool CallOnConnect();
>
>
>
>
> void SetRetryClientConnect(bool x = true);
>
>
>
> bool RetryClientConnect();
>
>
>
>
>
> virtual void SetLineProtocol(bool = true);
>
>
>
> bool LineProtocol();
>
>
> void SetShutdown(int);
>
>
> int GetShutdown();
>
>
> virtual int Protocol() = 0;
>
>protected:
> StreamSocket(const StreamSocket& ) {}
>
>private:
> StreamSocket& operator=(const StreamSocket& ) { return *this; }
>
> bool m_bConnecting;
> int m_connect_timeout;
> bool m_flush_before_close;
> int m_connection_retry;
> int m_retries;
> bool m_call_on_connect;
> bool m_b_retry_connect;
> bool m_line_protocol;
> int m_shutdown;
>};
># 34 "../include/TcpSocket.h" 2
># 48 "../include/TcpSocket.h"
>class SocketAddress;
>
>
>
>
>class TcpSocket : public StreamSocket
>{
>
>protected:
>
>
> class CircularBuffer
> {
> public:
>  CircularBuffer(size_t size);
>  ~CircularBuffer();
>
>
>  bool Write(const char *p,size_t l);
>
>  bool Read(char *dest,size_t l);
>
>  bool Remove(size_t l);
>
>  std::string ReadString(size_t l);
>
>
>  size_t GetLength();
>
>  const char *GetStart();
>
>  size_t GetL();
>
>  size_t Space();
>
>
>  unsigned long ByteCounter(bool clear = false);
>
> private:
>  CircularBuffer(const CircularBuffer& s) {}
>  CircularBuffer& operator=(const CircularBuffer& ) { return *this; }
>  char *buf;
>  size_t m_max;
>  size_t m_q;
>  size_t m_b;
>  size_t m_t;
>  unsigned long m_count;
> };
>
>
> struct OUTPUT {
>  OUTPUT() : _b(0), _t(0), _q(0) {}
>  OUTPUT(const char *buf, size_t len) : _b(0), _t(len), _q(len) {
>   memcpy(_buf, buf, len);
>  }
>  size_t Space() {
>   return 1024000 - _t;
>  }
>  void Add(const char *buf, size_t len) {
>   memcpy(_buf + _t, buf, len);
>   _t += len;
>   _q += len;
>  }
>  size_t Remove(size_t len) {
>   _b += len;
>   _q -= len;
>   return _q;
>  }
>  const char *Buf() {
>   return _buf + _b;
>  }
>  size_t Len() {
>   return _q;
>  }
>  size_t _b;
>  size_t _t;
>  size_t _q;
>  char _buf[1024000];
> };
> typedef std::list<OUTPUT *> output_l;
>
>public:
>
> TcpSocket(ISocketHandler& );
>
>
>
>
> TcpSocket(ISocketHandler& h,size_t isize,size_t osize);
> ~TcpSocket();
># 147 "../include/TcpSocket.h"
> bool Open(ipaddr_t ip,port_t port,bool skip_socks = false);
># 157 "../include/TcpSocket.h"
> bool Open(SocketAddress&,bool skip_socks = false);
> bool Open(SocketAddress&,SocketAddress& bind_address,bool skip_socks = false);
>
>
>
> bool Open(const std::string &host,port_t port);
>
>
> void OnConnectTimeout();
>
>
>
>
>
>
>
> int Close();
>
>
>
>
> void Send(const std::string &s,int f = 0);
>
> void Sendf(const char *format, ...);
>
>
>
>
> void SendBuf(const char *buf,size_t len,int f = 0);
>
>
>
> virtual void OnRawData(const char *buf,size_t len);
>
>
> virtual void OnWriteComplete();
>
> size_t GetInputLength();
>
> size_t GetOutputLength();
>
>
>
> void OnLine(const std::string& line);
>
> uint64_t GetBytesReceived(bool clear = false);
>
> uint64_t GetBytesSent(bool clear = false);
>
>
> void OnSocks4Connect();
>
> void OnSocks4ConnectFailed();
>
>
> bool OnSocks4Read();
># 236 "../include/TcpSocket.h"
> void SetReconnect(bool = true);
>
> bool Reconnect();
>
> void SetIsReconnect(bool x = true);
>
> bool IsReconnect();
>
>
> void DisableInputBuffer(bool = true);
>
> void OnOptions(int,int,int,SOCKET);
>
> void SetLineProtocol(bool = true);
>
>
> bool SetTcpNodelay(bool = true);
>
> virtual int Protocol();
>
>protected:
> TcpSocket(const TcpSocket& );
> void OnRead();
> void OnWrite();
># 281 "../include/TcpSocket.h"
> CircularBuffer ibuf;
>
>private:
> TcpSocket& operator=(const TcpSocket& ) { return *this; }
>
>
> int TryWrite(const char *buf, size_t len);
>
> void Buffer(const char *buf, size_t len);
>
>
> bool m_b_input_buffer_disabled;
> uint64_t m_bytes_sent;
> uint64_t m_bytes_received;
> bool m_skip_c;
> char m_c;
>protected: std::string m_line;
>private:
>
> char *m_buf;
>
> output_l m_obuf;
> OUTPUT *m_obuf_top;
># 326 "../include/TcpSocket.h"
> bool m_b_reconnect;
> bool m_b_is_reconnect;
>
>
>};
># 27 "UBSocket.h" 2
># 1 "../include/ISocketHandler.h" 1
># 38 "../include/ISocketHandler.h"
># 1 "../include/StdLog.h" 1
># 41 "../include/StdLog.h"
>typedef enum
>{
> LOG_LEVEL_WARNING = 0,
> LOG_LEVEL_ERROR,
> LOG_LEVEL_FATAL,
> LOG_LEVEL_INFO
>} loglevel_t;
>
>
>class ISocketHandler;
>class Socket;
>
>
>
>
>class StdLog
>{
>public:
> virtual ~StdLog() {}
> virtual void error(ISocketHandler *,Socket *,
>  const std::string& user_text,
>  int err,
>  const std::string& sys_err,
>  loglevel_t = LOG_LEVEL_WARNING) = 0;
>};
># 39 "../include/ISocketHandler.h" 2
># 1 "../include/Mutex.h" 1
># 46 "../include/Mutex.h"
>class Mutex
>{
> friend class Lock;
>public:
> Mutex();
> ~Mutex();
>
> void Lock();
> void Unlock();
>private:
>
>
>
> pthread_mutex_t m_mutex;
>
>};
># 40 "../include/ISocketHandler.h" 2
>
>
>
>
>
>
>typedef enum {
> LIST_CALLONCONNECT = 0,
>
>
>
> LIST_TIMEOUT,
> LIST_RETRY,
> LIST_CLOSE
>} list_t;
>
>class SocketAddress;
>
>
>
>
>class ISocketHandler
>{
> friend class Socket;
>
>public:
># 86 "../include/ISocketHandler.h"
>public:
> virtual ~ISocketHandler() {}
>
>
> virtual Mutex& GetMutex() const = 0;
>
>
>
> virtual void RegStdLog(StdLog *log) = 0;
>
>
> virtual void LogError(Socket *p,const std::string& user_text,int err,const std::string& sys_err,loglevel_t t = LOG_LEVEL_WARNING) = 0;
>
>
>
>
>
> virtual void Add(Socket *) = 0;
>private:
>
> virtual void Remove(Socket *) = 0;
>public:
>
> virtual void Get(SOCKET s,bool& r,bool& w,bool& e) = 0;
>
> virtual void Set(SOCKET s,bool bRead,bool bWrite,bool bException = true) = 0;
>
>
> virtual int Select(long sec,long usec) = 0;
>
> virtual int Select() = 0;
>
> virtual int Select(struct timeval *tsel) = 0;
>
>
> virtual bool Valid(Socket *) = 0;
>
> virtual size_t GetCount() = 0;
>
>
>
> virtual bool OkToAccept(Socket *p) = 0;
>
>
> virtual void AddList(SOCKET s,list_t which_one,bool add) = 0;
># 223 "../include/ISocketHandler.h"
>};
># 28 "UBSocket.h" 2
>
>namespace mud {
> class Account;
> typedef SmartPtr<mud::Account> AccountPtr;
>};
>
>class Editor;
>
>class UBSocket : public TcpSocket
>{
>public:
>
>
>
> UBSocket(ISocketHandler&);
> ~UBSocket(void);
>
>
>
>
> void OnLine(const std::string& line);
> void OnAccept();
>
>
>
>
> void Send(const std::string& msg);
> void Sendf(const char* format, ...);
>
>
>
>
> void SetPrompt(const std::string& prompt = "");
> void SendPrompt();
>
>
>
>
> mud::Account* GetAccount() const;
> UBSocket* GetForcer() const;
> bool hasAccount() const;
> bool isHighForced() const { return m_highforced; };
> bool isForced() const { return m_forced; };
> bool isLowForced() const { return m_lowforced; };
>
>
>
>
> void SetAccount(mud::AccountPtr account) { m_account = account; };
> void SetEditor(Editor* cmd, bool popLast = false);
> void PopEditor();
> void SetForcer(UBSocket* forcer, bool weakForce = true, bool forced = false, bool highforced = false);
> void EndForce();
>
>
>
>
> void SwitchEditors();
>
>
>
>
> static UBSocket* Cast(Socket* sock, bool Error = true);
>
>private:
>
>
>
> UBSocket(const UBSocket& rhs);
> UBSocket operator=(const UBSocket& rhs);
>
>
>
>
> std::string m_prompt;
> mud::AccountPtr m_account;
> bool m_popeditor;
> bool m_popLast;
> std::stack<Editor*> m_editors;
> Editor* m_nexteditor;
> UBSocket* m_forcer;
> bool m_lowforced;
> bool m_forced;
> bool m_highforced;
> bool m_hascolor;
> char m_colorcode;
>};
># 26 "EditorRace.cpp" 2
>
>
># 1 "../include/TableImpls.h" 1
># 23 "../include/TableImpls.h"
>       
>
>
>
>namespace db
>{
> class TableImpls : public Singleton<TableImpls>
> {
> public:
>  static TableImpls* Get();
>  static void Free();
>
>  TableImplPtr ACCOUNTS;
>  TableImplPtr AREAS;
>  TableImplPtr BRANCHES;
>  TableImplPtr CHARACTERACCOUNT;
>  TableImplPtr CHARACTERBRANCH;
>  TableImplPtr CHARACTERCLUSTER;
>  TableImplPtr CHARACTERSKILL;
>  TableImplPtr CHARACTERSTAT;
>  TableImplPtr CHARACTERTREE;
>  TableImplPtr CLUSTERS;
>  TableImplPtr CHUNKS;
>  TableImplPtr COLOURS;
>  TableImplPtr COMMANDS;
>  TableImplPtr DETAILS;
>  TableImplPtr DETAILROOM;
>  TableImplPtr DETAILCHUNK;
>  TableImplPtr DETAILCHARACTER;
>  TableImplPtr DETAILDETAIL;
>  TableImplPtr ENTITIES;
>  TableImplPtr EXITROOM;
>  TableImplPtr EXITS;
>  TableImplPtr GRANTGROUPS;
>  TableImplPtr PERMISSIONS;
>  TableImplPtr RACES;
>  TableImplPtr ROOMS;
>  TableImplPtr SECTORS;
>  TableImplPtr SKILLS;
>  TableImplPtr STATS;
>  TableImplPtr TRACES;
>  TableImplPtr TRACECHUNK;
>  TableImplPtr TRACEDETAIL;
>  TableImplPtr TRACEENTITY;
>  TableImplPtr TRACEROOM;
>  TableImplPtr TREES;
>  TableImplPtr VERSION;
>
>  TableImplVector::const_iterator begin() const { return m_tables.begin(); }
>  TableImplVector::const_iterator end() const { return m_tables.end(); }
>
> private:
>  TableImpls();
>  ~TableImpls() { }
>  TableImpls(const TableImpls& rhs);
>  TableImpls operator=(const TableImpls& rhs);
>  friend class Singleton<TableImpls>;
>
>  TableImplVector m_tables;
>  static TableImpls* ms_instance;
> };
>}
># 29 "EditorRace.cpp" 2
>
># 1 "Account.h" 1
># 20 "Account.h"
>       
>
>
>
>namespace mud
>{
> class Account;
> typedef SmartPtr<Account> AccountPtr;
> class Account : public Savable
> {
> public:
>
>
>
>  value_type getID() const;
>  const std::string& getName() const;
>  const std::string& getPassword() const;
>
>
>
>
>  void setName(const std::string& name);
>  void setPassword(const std::string& password);
>
>
>
>
>  std::vector<std::string> Show();
>  std::string ShowShort();
>  TableImplPtr getTable() const;
>
>
>
>
>  void Delete();
>  void Save();
>  bool Exists();
>
> private:
>  SavableManagerPtr m_account;
>
>
>
>
>  Account(SavableManagerPtr account);
>  Account(const Account& rhs);
>  Account operator=(const Account& rhs);
>  ~Account(void);
>
>  friend class AccountManager;
>  friend class SmartPtr<mud::Account>;
> };
>}
># 31 "EditorRace.cpp" 2
># 1 "Race.h" 1
># 20 "Race.h"
>       
>
>
>
>namespace mud
>{
> class RaceManager;
> class Race : public Savable
> {
> public:
>  const std::string& getName() const;
>  void setName(const std::string& name);
>
>
>
>
>  std::vector<std::string> Show();
>  std::string ShowShort();
>  TableImplPtr getTable() const;
>
>
>
>
>  void Delete();
>  void Save();
>  bool Exists();
>
> private:
>  SavableManagerPtr m_race;
>
>
>
>
>  Race(SavableManagerPtr race);
>  Race(const Race& rhs);
>  Race operator=(const Race& rhs);
>  ~Race(void);
>
>  friend class RaceManager;
>  friend class SmartPtr<mud::Race>;
> };
>}
># 32 "EditorRace.cpp" 2
># 1 "RaceManager.h" 1
># 20 "RaceManager.h"
>       
>
>
>
>namespace mud
>{
> class Race;
> typedef SmartPtr<mud::Race> RacePtr;
>}
>
>namespace mud
>{
> class RaceManager : public Singleton<mud::RaceManager>
> {
> public:
>  TableImplPtr GetTable();
>  std::vector<std::string> List();
>
>  KeysPtr Add();
>  mud::RacePtr GetByKey(value_type id);
>  mud::RacePtr GetByName(cstring name);
>
>  value_type lookupByName(cstring value);
>
> private:
>  RaceManager(void) {};
>  RaceManager(const RaceManager& rhs);
>  RaceManager operator=(const RaceManager& rhs);
>  ~RaceManager(void) {};
>
>  friend class Singleton<mud::RaceManager>;
> };
>}
># 33 "EditorRace.cpp" 2
>
>typedef EditorRace E;
>typedef E::RaceCommand C;
>typedef CommandTable<EditorRace> RaceCommandTable;
>
>template<typename T>
>const C
>RaceCommandTable::m_commands[] = {
># 49 "EditorRace.cpp"
>};
>
>EditorRace::EditorRace(UBSocket* sock) :
>OLCEditor(sock),
>m_race()
>{
> listCommands(Global::Get()->EmptyString);
>}
>
>EditorRace::~EditorRace(void)
>{
>}
># 76 "EditorRace.cpp"
>std::string EditorRace::lookup(const std::string& action)
>{
> std::string name = OLCEditor::lookup(action);
> if(name.size() != 0)
>  return name;
>
> const RaceCommand* act = translate(action);
> if(act)
>  return act->getName();
>
> return Global::Get()->EmptyString;
>}
>
>void EditorRace::dispatch(const std::string& action, const std::string& argument)
>{
> const RaceCommand* act = translate(action);
>
> if(act && !m_race)
> {
>  m_sock->Send("You need to be editing an race first.\n");
>  m_sock->Send("(Use the 'edit' command.)\n");
>  return;
> }
>
> if(act)
>  act->Run(this, argument);
> else
>  OLCEditor::dispatch(action, argument);
>
> return;
>}
>
>SavablePtr EditorRace::getEditing()
>{
> return m_race;
>}
>
>TableImplPtr EditorRace::getTable()
>{
> return db::TableImpls::Get()->RACES;
>}
>
>KeysPtr EditorRace::addNew()
>{
> return mud::RaceManager::Get()->Add();
>}
>
>std::vector<std::string> EditorRace::getList()
>{
> return mud::RaceManager::Get()->List();
>}
>
>void EditorRace::setEditing(KeysPtr keys)
>{
> if(!keys->size())
> {
>  m_race.reset();
>  return;
> }
>
> m_race = mud::RaceManager::Get()->GetByKey(keys->first()->getValue());
> return;
>}
># 153 "EditorRace.cpp"
>void EditorRace::editName(const std::string& argument)
>{
> if(argument.size() == 0)
> {
>  m_sock->Send("Race name can't be zero length!\n");
>  return;
> }
>
> m_sock->Sendf("Race name changed from '%s' to '%s'.\n", m_race->getName().c_str(), argument.c_str());
> m_race->setName(argument);
> return;
>}
>
>void EditorRace::showRace(const std::string& argument)
>{
> m_sock->Send(String::Get()->box(m_race->Show(), "Race"));
>}
>
>void EditorRace::saveRace(const std::string& argument)
>{
> m_sock->Sendf("Saving race '%s'.\n", m_race->getName().c_str());
> m_race->Save();
> m_sock->Send("Saved.\n");
> return;
>}

Actions: View

Attachments on bug 437277: 297914