Attachment 47556 Details for Bug 112985

preprocesseed file

Disk.ii (text/plain), 927.50 KB, created by Thomas Fehr on 2005-08-25 14:02:06 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Thomas Fehr

Created: 2005-08-25 14:02:06 UTC

Size: 927.50 KB

patch

obsolete

># 1 "Disk.cc"
># 1 "/usr/src/yast2/source/storage/libstorage/src//"
># 1 "<built-in>"
># 1 "<command line>"
># 1 "Disk.cc"
># 1 "y2storage/Disk.h" 1
>
>
>
># 1 "/usr/include/c++/4.0.2/list" 1 3
># 63 "/usr/include/c++/4.0.2/list" 3
>       
># 64 "/usr/include/c++/4.0.2/list" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/c++/4.0.2/bits/functexcept.h" 1 3
># 41 "/usr/include/c++/4.0.2/bits/functexcept.h" 3
># 1 "/usr/include/c++/4.0.2/exception_defines.h" 1 3
># 42 "/usr/include/c++/4.0.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* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_domain_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_invalid_argument(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_length_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_out_of_range(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_runtime_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_range_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_overflow_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_underflow_error(const char* __s) __attribute__((__noreturn__));
>
>
>  void
>  __throw_ios_failure(const char* __s) __attribute__((__noreturn__));
>}
># 67 "/usr/include/c++/4.0.2/list" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 1 3
># 64 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++config.h" 1 3
># 35 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++config.h" 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/os_defines.h" 1 3
># 39 "/usr/include/c++/4.0.2/i586-suse-linux/bits/os_defines.h" 3
># 1 "/usr/include/features.h" 1 3 4
># 308 "/usr/include/features.h" 3 4
># 1 "/usr/include/sys/cdefs.h" 1 3 4
># 309 "/usr/include/features.h" 2 3 4
># 331 "/usr/include/features.h" 3 4
># 1 "/usr/include/gnu/stubs.h" 1 3 4
># 332 "/usr/include/features.h" 2 3 4
># 40 "/usr/include/c++/4.0.2/i586-suse-linux/bits/os_defines.h" 2 3
># 36 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++config.h" 2 3
># 64 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++config.h" 3
>namespace __gnu_debug_def { }
>
>namespace __gnu_debug
>{
>  using namespace __gnu_debug_def;
>}
># 65 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/cstring" 1 3
># 47 "/usr/include/c++/4.0.2/cstring" 3
>       
># 48 "/usr/include/c++/4.0.2/cstring" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/c++/4.0.2/cstddef" 1 3
># 47 "/usr/include/c++/4.0.2/cstddef" 3
>       
># 48 "/usr/include/c++/4.0.2/cstddef" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 152 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 3 4
>typedef int ptrdiff_t;
># 214 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 3 4
>typedef unsigned int size_t;
># 51 "/usr/include/c++/4.0.2/cstddef" 2 3
>
>namespace std
>{
>  using ::ptrdiff_t;
>  using ::size_t;
>}
>
>#pragma GCC visibility pop
># 51 "/usr/include/c++/4.0.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/i586-suse-linux/4.0.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 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)));
># 426 "/usr/include/string.h" 3 4
>}
># 53 "/usr/include/c++/4.0.2/cstring" 2 3
># 78 "/usr/include/c++/4.0.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); }
>}
>
>#pragma GCC visibility pop
># 66 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/climits" 1 3
># 47 "/usr/include/c++/4.0.2/climits" 3
>       
># 48 "/usr/include/c++/4.0.2/climits" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/limits.h" 1 3 4
># 11 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/limits.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/syslimits.h" 1 3 4
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/limits.h" 1 3 4
># 122 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/limits.h" 3 4
># 1 "/usr/include/limits.h" 1 3 4
># 144 "/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
># 145 "/usr/include/limits.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/posix2_lim.h" 1 3 4
># 149 "/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
># 153 "/usr/include/limits.h" 2 3 4
># 123 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/limits.h" 2 3 4
># 8 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/syslimits.h" 2 3 4
># 12 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/limits.h" 2 3 4
># 51 "/usr/include/c++/4.0.2/climits" 2 3
>
>#pragma GCC visibility pop
># 67 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/cstdlib" 1 3
># 47 "/usr/include/c++/4.0.2/cstdlib" 3
>       
># 48 "/usr/include/c++/4.0.2/cstdlib" 3
>#pragma GCC visibility push(default)
># 58 "/usr/include/c++/4.0.2/cstdlib" 3
># 1 "/usr/include/stdlib.h" 1 3 4
># 33 "/usr/include/stdlib.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.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)));
>
># 239 "/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)));
>
>
>
>
>
>
>extern double __strtod_internal (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __group)
>     throw () __attribute__ ((__nonnull__ (1)));
>extern float __strtof_internal (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __group)
>     throw () __attribute__ ((__nonnull__ (1)));
>extern long double __strtold_internal (__const char *__restrict __nptr,
>           char **__restrict __endptr,
>           int __group) throw () __attribute__ ((__nonnull__ (1)));
>
>extern long int __strtol_internal (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern unsigned long int __strtoul_internal (__const char *__restrict __nptr,
>          char **__restrict __endptr,
>          int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>__extension__
>extern long long int __strtoll_internal (__const char *__restrict __nptr,
>      char **__restrict __endptr,
>      int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>__extension__
>extern unsigned long long int __strtoull_internal (__const char *
>         __restrict __nptr,
>         char **__restrict __endptr,
>         int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>
>extern __inline double
>strtod (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
>{
>  return __strtod_internal (__nptr, __endptr, 0);
>}
>extern __inline long int
>strtol (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtol_internal (__nptr, __endptr, __base, 0);
>}
>extern __inline unsigned long int
>strtoul (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoul_internal (__nptr, __endptr, __base, 0);
>}
>
>
>
>
>extern __inline float
>strtof (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
>{
>  return __strtof_internal (__nptr, __endptr, 0);
>}
>extern __inline long double
>strtold (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
>{
>  return __strtold_internal (__nptr, __endptr, 0);
>}
>
>
>
>
>__extension__ extern __inline long long int
>strtoq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoll_internal (__nptr, __endptr, __base, 0);
>}
>__extension__ extern __inline unsigned long long int
>strtouq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoull_internal (__nptr, __endptr, __base, 0);
>}
>
>
>
>
>__extension__ extern __inline long long int
>strtoll (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoll_internal (__nptr, __endptr, __base, 0);
>}
>__extension__ extern __inline unsigned long long int
>strtoull (__const char * __restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoull_internal (__nptr, __endptr, __base, 0);
>}
>
>
>
>
>extern __inline double
>atof (__const char *__nptr) throw ()
>{
>  return strtod (__nptr, (char **) __null);
>}
>extern __inline int
>atoi (__const char *__nptr) throw ()
>{
>  return (int) strtol (__nptr, (char **) __null, 10);
>}
>extern __inline long int
>atol (__const char *__nptr) throw ()
>{
>  return strtol (__nptr, (char **) __null, 10);
>}
>
>
>
>
>__extension__ extern __inline long long int
>atoll (__const char *__nptr) throw ()
>{
>  return strtoll (__nptr, (char **) __null, 10);
>}
>
># 424 "/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
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 32 "/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;
># 129 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/typesizes.h" 1 3 4
># 130 "/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 int __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
># 58 "/usr/include/time.h" 3 4
>
>
>typedef __clock_t clock_t;
>
>
>
># 74 "/usr/include/time.h" 3 4
>
>
>typedef __time_t time_t;
>
>
>
># 92 "/usr/include/time.h" 3 4
>typedef __clockid_t clockid_t;
># 104 "/usr/include/time.h" 3 4
>typedef __timer_t timer_t;
># 134 "/usr/include/sys/types.h" 2 3 4
>
>
>
>typedef __useconds_t useconds_t;
>
>
>
>typedef __suseconds_t suseconds_t;
>
>
>
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.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;
># 191 "/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__)));
># 216 "/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
># 23 "/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
># 118 "/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);
>
>
>}
># 217 "/usr/include/sys/types.h" 2 3 4
>
>
># 1 "/usr/include/sys/sysmacros.h" 1 3 4
># 29 "/usr/include/sys/sysmacros.h" 3 4
>__extension__
>extern __inline unsigned int gnu_dev_major (unsigned long long int __dev)
>     throw ();
>__extension__
>extern __inline unsigned int gnu_dev_minor (unsigned long long int __dev)
>     throw ();
>__extension__
>extern __inline unsigned long long int gnu_dev_makedev (unsigned int __major,
>       unsigned int __minor)
>     throw ();
>
>
>__extension__ extern __inline unsigned int
>gnu_dev_major (unsigned long long int __dev) throw ()
>{
>  return ((__dev >> 8) & 0xfff) | ((unsigned int) (__dev >> 32) & ~0xfff);
>}
>
>__extension__ extern __inline unsigned int
>gnu_dev_minor (unsigned long long int __dev) throw ()
>{
>  return (__dev & 0xff) | ((unsigned int) (__dev >> 12) & ~0xff);
>}
>
>__extension__ extern __inline unsigned long long int
>gnu_dev_makedev (unsigned int __major, unsigned int __minor) throw ()
>{
>  return ((__minor & 0xff) | ((__major & 0xfff) << 8)
>   | (((unsigned long long int) (__minor & ~0xff)) << 12)
>   | (((unsigned long long int) (__major & ~0xfff)) << 32));
>}
># 220 "/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;
># 258 "/usr/include/sys/types.h" 3 4
>typedef __blkcnt64_t blkcnt64_t;
>typedef __fsblkcnt64_t fsblkcnt64_t;
>typedef __fsfilcnt64_t fsfilcnt64_t;
>
>
>
>
>
># 1 "/usr/include/bits/pthreadtypes.h" 1 3 4
># 23 "/usr/include/bits/pthreadtypes.h" 3 4
># 1 "/usr/include/bits/sched.h" 1 3 4
># 83 "/usr/include/bits/sched.h" 3 4
>struct __sched_param
>  {
>    int __sched_priority;
>  };
># 24 "/usr/include/bits/pthreadtypes.h" 2 3 4
>
>
>struct _pthread_fastlock
>{
>  long int __status;
>  int __spinlock;
>
>};
>
>
>
>typedef struct _pthread_descr_struct *_pthread_descr;
>
>
>
>
>
>typedef struct __pthread_attr_s
>{
>  int __detachstate;
>  int __schedpolicy;
>  struct __sched_param __schedparam;
>  int __inheritsched;
>  int __scope;
>  size_t __guardsize;
>  int __stackaddr_set;
>  void *__stackaddr;
>  size_t __stacksize;
>} pthread_attr_t;
>
>
>
>
>
>__extension__ typedef long long __pthread_cond_align_t;
>
>
>
>
>typedef struct
>{
>  struct _pthread_fastlock __c_lock;
>  _pthread_descr __c_waiting;
>  char __padding[48 - sizeof (struct _pthread_fastlock)
>   - sizeof (_pthread_descr) - sizeof (__pthread_cond_align_t)];
>  __pthread_cond_align_t __align;
>} pthread_cond_t;
>
>
>
>typedef struct
>{
>  int __dummy;
>} pthread_condattr_t;
>
>
>typedef unsigned int pthread_key_t;
>
>
>
>
>
>typedef struct
>{
>  int __m_reserved;
>  int __m_count;
>  _pthread_descr __m_owner;
>  int __m_kind;
>  struct _pthread_fastlock __m_lock;
>} pthread_mutex_t;
>
>
>
>typedef struct
>{
>  int __mutexkind;
>} pthread_mutexattr_t;
>
>
>
>typedef int pthread_once_t;
>
>
>
>
>typedef struct _pthread_rwlock_t
>{
>  struct _pthread_fastlock __rw_lock;
>  int __rw_readers;
>  _pthread_descr __rw_writer;
>  _pthread_descr __rw_read_waiting;
>  _pthread_descr __rw_write_waiting;
>  int __rw_kind;
>  int __rw_pshared;
>} pthread_rwlock_t;
>
>
>
>typedef struct
>{
>  int __lockkind;
>  int __pshared;
>} pthread_rwlockattr_t;
>
>
>
>
>typedef volatile int pthread_spinlock_t;
>
>
>typedef struct {
>  struct _pthread_fastlock __ba_lock;
>  int __ba_required;
>  int __ba_present;
>  _pthread_descr __ba_waiting;
>} pthread_barrier_t;
>
>
>typedef struct {
>  int __pshared;
>} pthread_barrierattr_t;
>
>
>
>
>
>typedef unsigned long int pthread_t;
># 267 "/usr/include/sys/types.h" 2 3 4
>
>
>}
># 434 "/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__ ((__malloc__));
>
>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/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 26 "/usr/include/alloca.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>extern void *alloca (size_t __size) throw ();
>
>
>
>
>
>}
># 607 "/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__ ((__malloc__)) __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 ();
># 691 "/usr/include/stdlib.h" 3 4
>extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1)));
># 702 "/usr/include/stdlib.h" 3 4
>extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1)));
># 711 "/usr/include/stdlib.h" 3 4
>extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1)));
># 721 "/usr/include/stdlib.h" 3 4
>extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>
>extern int system (__const char *__command);
>
>
>
>
>
>
>
>extern char *canonicalize_file_name (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1)));
># 749 "/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__));
>
># 814 "/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)));
># 902 "/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)));
>
>
>
>
>
>}
># 59 "/usr/include/c++/4.0.2/cstdlib" 2 3
># 91 "/usr/include/c++/4.0.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); }
># 144 "/usr/include/c++/4.0.2/cstdlib" 3
>}
># 157 "/usr/include/c++/4.0.2/cstdlib" 3
>namespace __gnu_cxx
>{
>
>  using ::lldiv_t;
>
>
>
>
>
>  using ::_Exit;
>
>
>  inline long long
>  abs(long long __x) { return __x >= 0 ? __x : -__x; }
>
>  inline long long
>  llabs(long long __x) { return __x >= 0 ? __x : -__x; }
>
>
>  inline lldiv_t
>  div(long long __n, long long __d)
>  { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }
>
>  inline lldiv_t
>  lldiv(long long __n, long long __d)
>  { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }
># 193 "/usr/include/c++/4.0.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;
>}
>
>
>#pragma GCC visibility pop
># 68 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/include/c++/4.0.2/iosfwd" 1 3
># 42 "/usr/include/c++/4.0.2/iosfwd" 3
>       
># 43 "/usr/include/c++/4.0.2/iosfwd" 3
>#pragma GCC visibility push(default)
>
>
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++locale.h" 1 3
># 39 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++locale.h" 3
>       
># 40 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++locale.h" 3
>
>
># 1 "/usr/include/c++/4.0.2/cstdio" 1 3
># 47 "/usr/include/c++/4.0.2/cstdio" 3
>       
># 48 "/usr/include/c++/4.0.2/cstdio" 3
>#pragma GCC visibility push(default)
>
>
>
>
># 1 "/usr/include/stdio.h" 1 3 4
># 30 "/usr/include/stdio.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 35 "/usr/include/stdio.h" 2 3 4
># 44 "/usr/include/stdio.h" 3 4
>
>
>typedef struct _IO_FILE FILE;
>
>
>
>
>
># 62 "/usr/include/stdio.h" 3 4
>typedef struct _IO_FILE __FILE;
># 72 "/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
># 14 "/usr/include/_G_config.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 355 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 3 4
>typedef unsigned int wint_t;
># 15 "/usr/include/_G_config.h" 2 3 4
># 24 "/usr/include/_G_config.h" 3 4
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
>
># 1 "/usr/include/bits/wchar.h" 1 3 4
># 51 "/usr/include/wchar.h" 2 3 4
># 76 "/usr/include/wchar.h" 3 4
>typedef struct
>{
>  int __count;
>  union
>  {
>    wint_t __wch;
>    char __wchb[4];
>  } __value;
>} __mbstate_t;
># 25 "/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;
># 44 "/usr/include/_G_config.h" 3 4
># 1 "/usr/include/gconv.h" 1 3 4
># 28 "/usr/include/gconv.h" 3 4
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
># 29 "/usr/include/gconv.h" 2 3 4
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 32 "/usr/include/gconv.h" 2 3 4
>
>
>
>
>
>enum
>{
>  __GCONV_OK = 0,
>  __GCONV_NOCONV,
>  __GCONV_NODB,
>  __GCONV_NOMEM,
>
>  __GCONV_EMPTY_INPUT,
>  __GCONV_FULL_OUTPUT,
>  __GCONV_ILLEGAL_INPUT,
>  __GCONV_INCOMPLETE_INPUT,
>
>  __GCONV_ILLEGAL_DESCRIPTOR,
>  __GCONV_INTERNAL_ERROR
>};
>
>
>
>enum
>{
>  __GCONV_IS_LAST = 0x0001,
>  __GCONV_IGNORE_ERRORS = 0x0002
>};
>
>
>
>struct __gconv_step;
>struct __gconv_step_data;
>struct __gconv_loaded_object;
>struct __gconv_trans_data;
>
>
>
>typedef int (*__gconv_fct) (struct __gconv_step *, struct __gconv_step_data *,
>       __const unsigned char **, __const unsigned char *,
>       unsigned char **, size_t *, int, int);
>
>
>typedef wint_t (*__gconv_btowc_fct) (struct __gconv_step *, unsigned char);
>
>
>typedef int (*__gconv_init_fct) (struct __gconv_step *);
>typedef void (*__gconv_end_fct) (struct __gconv_step *);
>
>
>
>typedef int (*__gconv_trans_fct) (struct __gconv_step *,
>      struct __gconv_step_data *, void *,
>      __const unsigned char *,
>      __const unsigned char **,
>      __const unsigned char *, unsigned char **,
>      size_t *);
>
>
>typedef int (*__gconv_trans_context_fct) (void *, __const unsigned char *,
>       __const unsigned char *,
>       unsigned char *, unsigned char *);
>
>
>typedef int (*__gconv_trans_query_fct) (__const char *, __const char ***,
>     size_t *);
>
>
>typedef int (*__gconv_trans_init_fct) (void **, const char *);
>typedef void (*__gconv_trans_end_fct) (void *);
>
>struct __gconv_trans_data
>{
>
>  __gconv_trans_fct __trans_fct;
>  __gconv_trans_context_fct __trans_context_fct;
>  __gconv_trans_end_fct __trans_end_fct;
>  void *__data;
>  struct __gconv_trans_data *__next;
>};
>
>
>
>struct __gconv_step
>{
>  struct __gconv_loaded_object *__shlib_handle;
>  __const char *__modname;
>
>  int __counter;
>
>  char *__from_name;
>  char *__to_name;
>
>  __gconv_fct __fct;
>  __gconv_btowc_fct __btowc_fct;
>  __gconv_init_fct __init_fct;
>  __gconv_end_fct __end_fct;
>
>
>
>  int __min_needed_from;
>  int __max_needed_from;
>  int __min_needed_to;
>  int __max_needed_to;
>
>
>  int __stateful;
>
>  void *__data;
>};
>
>
>
>struct __gconv_step_data
>{
>  unsigned char *__outbuf;
>  unsigned char *__outbufend;
>
>
>
>  int __flags;
>
>
>
>  int __invocation_counter;
>
>
>
>  int __internal_use;
>
>  __mbstate_t *__statep;
>  __mbstate_t __state;
>
>
>
>  struct __gconv_trans_data *__trans;
>};
>
>
>
>typedef struct __gconv_info
>{
>  size_t __nsteps;
>  struct __gconv_step *__steps;
>  __extension__ struct __gconv_step_data __data [];
>} *__gconv_t;
># 45 "/usr/include/_G_config.h" 2 3 4
>typedef union
>{
>  struct __gconv_info __cd;
>  struct
>  {
>    struct __gconv_info __cd;
>    struct __gconv_step_data __data;
>  } __combined;
>} _G_iconv_t;
>
>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/i586-suse-linux/4.0.2/include/stdarg.h" 1 3 4
># 43 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stdarg.h" 3 4
>typedef __builtin_va_list __gnuc_va_list;
># 54 "/usr/include/libio.h" 2 3 4
># 166 "/usr/include/libio.h" 3 4
>struct _IO_jump_t; struct _IO_FILE;
># 176 "/usr/include/libio.h" 3 4
>typedef void _IO_lock_t;
>
>
>
>
>
>struct _IO_marker {
>  struct _IO_marker *_next;
>  struct _IO_FILE *_sbuf;
>
>
>
>  int _pos;
># 199 "/usr/include/libio.h" 3 4
>};
>
>
>enum __codecvt_result
>{
>  __codecvt_ok,
>  __codecvt_partial,
>  __codecvt_error,
>  __codecvt_noconv
>};
># 267 "/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;
># 315 "/usr/include/libio.h" 3 4
>  __off64_t _offset;
>
>
>
>
>
>  void *__pad1;
>  void *__pad2;
>
>  int _mode;
>
>  char _unused2[15 * sizeof (int) - 2 * sizeof (void *)];
>
>};
>
>
>
>
>
>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_;
># 354 "/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 *) throw ();
>extern int __uflow (_IO_FILE *) throw ();
>extern int __overflow (_IO_FILE *, int) throw ();
>extern wint_t __wunderflow (_IO_FILE *) throw ();
>extern wint_t __wuflow (_IO_FILE *) throw ();
>extern wint_t __woverflow (_IO_FILE *, wint_t) throw ();
># 444 "/usr/include/libio.h" 3 4
>extern int _IO_getc (_IO_FILE *__fp) throw ();
>extern int _IO_putc (int __c, _IO_FILE *__fp) throw ();
>extern int _IO_feof (_IO_FILE *__fp) throw ();
>extern int _IO_ferror (_IO_FILE *__fp) throw ();
>
>extern int _IO_peekc_locked (_IO_FILE *__fp) throw ();
>
>
>
>
>
>extern void _IO_flockfile (_IO_FILE *) throw ();
>extern void _IO_funlockfile (_IO_FILE *) throw ();
>extern int _IO_ftrylockfile (_IO_FILE *) throw ();
># 474 "/usr/include/libio.h" 3 4
>extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict,
>   __gnuc_va_list, int *__restrict) throw ();
>extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict,
>    __gnuc_va_list) throw ();
>extern __ssize_t _IO_padn (_IO_FILE *, int, __ssize_t) throw ();
>extern size_t _IO_sgetn (_IO_FILE *, void *, size_t) throw ();
>
>extern __off64_t _IO_seekoff (_IO_FILE *, __off64_t, int, int) throw ();
>extern __off64_t _IO_seekpos (_IO_FILE *, __off64_t, int) throw ();
>
>extern void _IO_free_backup_area (_IO_FILE *) throw ();
># 532 "/usr/include/libio.h" 3 4
>}
># 73 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>typedef __gnuc_va_list va_list;
># 86 "/usr/include/stdio.h" 3 4
>
>
>typedef _G_fpos_t fpos_t;
>
>
>
>
>
>typedef _G_fpos64_t fpos64_t;
># 138 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 139 "/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 FILE *tmpfile (void);
># 176 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile64 (void);
>
>
>
>extern char *tmpnam (char *__s) throw ();
>
>
>
>
>
>extern char *tmpnam_r (char *__s) throw ();
># 198 "/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);
>
># 223 "/usr/include/stdio.h" 3 4
>extern int fflush_unlocked (FILE *__stream);
># 233 "/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);
># 264 "/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 **__restrict __bufloc,
>        size_t *__restrict __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 ();
>
>
>
>
>
>
>
>
>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)));
>
>
>
>
>
>
>
>
>
>extern int fgetc (FILE *__stream);
>extern int getc (FILE *__stream);
>
>
>
>
>
>extern int getchar (void);
>
># 456 "/usr/include/stdio.h" 3 4
>extern int getc_unlocked (FILE *__stream);
>extern int getchar_unlocked (void);
># 467 "/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);
>
># 500 "/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);
>
># 545 "/usr/include/stdio.h" 3 4
>extern char *fgets_unlocked (char *__restrict __s, int __n,
>        FILE *__restrict __stream);
># 561 "/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);
>
># 622 "/usr/include/stdio.h" 3 4
>extern int fputs_unlocked (__const char *__restrict __s,
>      FILE *__restrict __stream);
># 633 "/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);
>
># 669 "/usr/include/stdio.h" 3 4
>extern int fseeko (FILE *__stream, __off_t __off, int __whence);
>
>
>
>
>extern __off_t ftello (FILE *__stream);
># 688 "/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);
># 711 "/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[];
># 750 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>extern int fileno (FILE *__stream) throw ();
>
>
>
>
>extern int fileno_unlocked (FILE *__stream) throw ();
># 769 "/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 ();
># 830 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio.h" 1 3 4
># 33 "/usr/include/bits/stdio.h" 3 4
>inline int
>vprintf (__const char *__restrict __fmt, __gnuc_va_list __arg)
>{
>  return vfprintf (stdout, __fmt, __arg);
>}
>
>
>inline int
>getchar (void)
>{
>  return _IO_getc (stdin);
>}
>
>
>
>
>inline int
>getc_unlocked (FILE *__fp)
>{
>  return (__builtin_expect ((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end, 0) ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
>}
>
>
>inline int
>getchar_unlocked (void)
>{
>  return (__builtin_expect ((stdin)->_IO_read_ptr >= (stdin)->_IO_read_end, 0) ? __uflow (stdin) : *(unsigned char *) (stdin)->_IO_read_ptr++);
>}
>
>
>
>
>inline int
>putchar (int __c)
>{
>  return _IO_putc (__c, stdout);
>}
>
>
>
>
>inline int
>fputc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect ((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end, 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>inline int
>putc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect ((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end, 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>inline int
>putchar_unlocked (int __c)
>{
>  return (__builtin_expect ((stdout)->_IO_write_ptr >= (stdout)->_IO_write_end, 0) ? __overflow (stdout, (unsigned char) (__c)) : (unsigned char) (*(stdout)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>inline __ssize_t
>getline (char **__lineptr, size_t *__n, FILE *__stream)
>{
>  return __getdelim (__lineptr, __n, '\n', __stream);
>}
>
>
>
>
>
>inline int
>feof_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x10) != 0);
>}
>
>
>inline int
>ferror_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x20) != 0);
>}
># 831 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>
>}
># 54 "/usr/include/c++/4.0.2/cstdio" 2 3
># 98 "/usr/include/c++/4.0.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/include/c++/4.0.2/cstdio" 3
>namespace __gnu_cxx
>{
># 168 "/usr/include/c++/4.0.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;
>}
>
>
>#pragma GCC visibility pop
># 43 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/c++/4.0.2/clocale" 1 3
># 47 "/usr/include/c++/4.0.2/clocale" 3
>       
># 48 "/usr/include/c++/4.0.2/clocale" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/locale.h" 1 3 4
># 29 "/usr/include/locale.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.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" {
># 52 "/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;
># 119 "/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/include/c++/4.0.2/clocale" 2 3
>
>
>
>
>
>namespace std
>{
>  using ::lconv;
>  using ::setlocale;
>  using ::localeconv;
>}
>
>#pragma GCC visibility pop
># 44 "/usr/include/c++/4.0.2/i586-suse-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" {
># 43 "/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
>};
># 576 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo (nl_item __item) throw ();
># 587 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo_l (nl_item __item, __locale_t l);
>
>
>}
># 45 "/usr/include/c++/4.0.2/i586-suse-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/i586-suse-linux/4.0.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/include/c++/4.0.2/i586-suse-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 ();
>
>
>
>extern char *dgettext (__const char *__domainname, __const char *__msgid)
>     throw ();
>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 ();
>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 ();
># 120 "/usr/include/libintl.h" 3 4
>}
># 47 "/usr/include/c++/4.0.2/i586-suse-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, const char* __fmt,
>
>       _Tv __v, const __c_locale& __cloc, int __prec)
>    {
>      __c_locale __old = __gnu_cxx::__uselocale(__cloc);
># 84 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++locale.h" 3
>      const int __ret = std::snprintf(__out, __size, __fmt, __prec, __v);
>
>
>
>
>
>      __gnu_cxx::__uselocale(__old);
>
>
>
>
>      return __ret;
>    }
>}
># 47 "/usr/include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++io.h" 1 3
># 37 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++io.h" 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr.h" 1 3
># 33 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr.h" 3
>#pragma GCC visibility push(default)
># 114 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr.h" 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr-default.h" 1 3
># 43 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr-default.h" 3
># 1 "/usr/include/pthread.h" 1 3 4
># 20 "/usr/include/pthread.h" 3 4
># 1 "/usr/include/sched.h" 1 3 4
># 29 "/usr/include/sched.h" 3 4
># 1 "/usr/include/time.h" 1 3 4
># 30 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/bits/sched.h" 1 3 4
># 62 "/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 ();
>
>
>}
># 98 "/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;
># 33 "/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 ();
># 76 "/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 ();
>
>
>}
># 21 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/time.h" 1 3 4
># 30 "/usr/include/time.h" 3 4
>extern "C" {
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 39 "/usr/include/time.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/time.h" 1 3 4
># 43 "/usr/include/time.h" 2 3 4
># 129 "/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;
># 178 "/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 ();
># 309 "/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__));
># 324 "/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 ();
># 386 "/usr/include/time.h" 3 4
>extern int getdate_err;
># 395 "/usr/include/time.h" 3 4
>extern struct tm *getdate (__const char *__string);
># 409 "/usr/include/time.h" 3 4
>extern int getdate_r (__const char *__restrict __string,
>        struct tm *__restrict __resbufp);
>
>
>}
># 22 "/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
># 400 "/usr/include/signal.h" 3 4
>}
># 25 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/pthreadtypes.h" 1 3 4
># 26 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/initspin.h" 1 3 4
># 27 "/usr/include/pthread.h" 2 3 4
>
>
>extern "C" {
># 59 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_CREATE_JOINABLE,
>
>  PTHREAD_CREATE_DETACHED
>
>};
>
>enum
>{
>  PTHREAD_INHERIT_SCHED,
>
>  PTHREAD_EXPLICIT_SCHED
>
>};
>
>enum
>{
>  PTHREAD_SCOPE_SYSTEM,
>
>  PTHREAD_SCOPE_PROCESS
>
>};
>
>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_ADAPTIVE_NP
>
>};
>
>enum
>{
>  PTHREAD_PROCESS_PRIVATE,
>
>  PTHREAD_PROCESS_SHARED
>
>};
>
>
>enum
>{
>  PTHREAD_RWLOCK_PREFER_READER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP,
>  PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_WRITER_NP
>};
># 131 "/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
>
>};
># 163 "/usr/include/pthread.h" 3 4
>extern int pthread_create (pthread_t *__restrict __threadp,
>      __const pthread_attr_t *__restrict __attr,
>      void *(*__start_routine) (void *),
>      void *__restrict __arg) throw ();
>
>
>extern pthread_t pthread_self (void) throw ();
>
>
>extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw ();
>
>
>extern void pthread_exit (void *__retval) __attribute__ ((__noreturn__));
>
>
>
>
>extern int pthread_join (pthread_t __th, void **__thread_return);
>
>
>
>
>
>extern int pthread_detach (pthread_t __th) throw ();
>
>
>
>
>
>
>
>extern int pthread_attr_init (pthread_attr_t *__attr) throw ();
>
>
>extern int pthread_attr_destroy (pthread_attr_t *__attr) throw ();
>
>
>extern int pthread_attr_setdetachstate (pthread_attr_t *__attr,
>     int __detachstate) throw ();
>
>
>extern int pthread_attr_getdetachstate (__const pthread_attr_t *__attr,
>     int *__detachstate) throw ();
>
>
>extern int pthread_attr_setschedparam (pthread_attr_t *__restrict __attr,
>           __const struct sched_param *__restrict
>           __param) throw ();
>
>
>extern int pthread_attr_getschedparam (__const pthread_attr_t *__restrict
>           __attr,
>           struct sched_param *__restrict __param)
>     throw ();
>
>
>extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy)
>     throw ();
>
>
>extern int pthread_attr_getschedpolicy (__const pthread_attr_t *__restrict
>     __attr, int *__restrict __policy)
>     throw ();
>
>
>extern int pthread_attr_setinheritsched (pthread_attr_t *__attr,
>      int __inherit) throw ();
>
>
>extern int pthread_attr_getinheritsched (__const pthread_attr_t *__restrict
>      __attr, int *__restrict __inherit)
>     throw ();
>
>
>extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope)
>     throw ();
>
>
>extern int pthread_attr_getscope (__const pthread_attr_t *__restrict __attr,
>      int *__restrict __scope) throw ();
>
>
>
>extern int pthread_attr_setguardsize (pthread_attr_t *__attr,
>          size_t __guardsize) throw ();
>
>
>extern int pthread_attr_getguardsize (__const pthread_attr_t *__restrict
>          __attr, size_t *__restrict __guardsize)
>     throw ();
>
>
>
>
>
>
>extern int pthread_attr_setstackaddr (pthread_attr_t *__attr,
>          void *__stackaddr) throw ();
>
>
>extern int pthread_attr_getstackaddr (__const pthread_attr_t *__restrict
>          __attr, void **__restrict __stackaddr)
>     throw ();
>
>
>
>
>
>extern int pthread_attr_setstack (pthread_attr_t *__attr, void *__stackaddr,
>      size_t __stacksize) throw ();
>
>
>extern int pthread_attr_getstack (__const pthread_attr_t *__restrict __attr,
>      void **__restrict __stackaddr,
>      size_t *__restrict __stacksize) throw ();
>
>
>
>
>
>extern int pthread_attr_setstacksize (pthread_attr_t *__attr,
>          size_t __stacksize) throw ();
>
>
>extern int pthread_attr_getstacksize (__const pthread_attr_t *__restrict
>          __attr, size_t *__restrict __stacksize)
>     throw ();
>
>
>
>
>
>extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr) throw ();
>
>
>
>
>
>
>extern int pthread_setschedparam (pthread_t __target_thread, int __policy,
>      __const struct sched_param *__param)
>     throw ();
>
>
>extern int pthread_getschedparam (pthread_t __target_thread,
>      int *__restrict __policy,
>      struct sched_param *__restrict __param)
>     throw ();
>
>
>
>extern int pthread_getconcurrency (void) throw ();
>
>
>extern int pthread_setconcurrency (int __level) throw ();
>
>
>
>
>
>
>
>extern int pthread_yield (void) throw ();
>
>
>
>
>
>
>extern int pthread_mutex_init (pthread_mutex_t *__restrict __mutex,
>          __const pthread_mutexattr_t *__restrict
>          __mutex_attr) throw ();
>
>
>extern int pthread_mutex_destroy (pthread_mutex_t *__mutex) throw ();
>
>
>extern int pthread_mutex_trylock (pthread_mutex_t *__mutex) throw ();
>
>
>extern int pthread_mutex_lock (pthread_mutex_t *__mutex) throw ();
>
>
>
>extern int pthread_mutex_timedlock (pthread_mutex_t *__restrict __mutex,
>        __const struct timespec *__restrict
>        __abstime) throw ();
>
>
>
>extern int pthread_mutex_unlock (pthread_mutex_t *__mutex) throw ();
>
>
>
>
>
>
>extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr) throw ();
>
>
>extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr) throw ();
>
>
>extern int pthread_mutexattr_getpshared (__const pthread_mutexattr_t *
>      __restrict __attr,
>      int *__restrict __pshared) throw ();
>
>
>extern int pthread_mutexattr_setpshared (pthread_mutexattr_t *__attr,
>      int __pshared) throw ();
>
>
>
>
>
>extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind)
>     throw ();
>
>
>extern int pthread_mutexattr_gettype (__const pthread_mutexattr_t *__restrict
>          __attr, int *__restrict __kind) throw ();
>
>
>
>
>
>
>
>extern int pthread_cond_init (pthread_cond_t *__restrict __cond,
>         __const pthread_condattr_t *__restrict
>         __cond_attr) throw ();
>
>
>extern int pthread_cond_destroy (pthread_cond_t *__cond) throw ();
>
>
>extern int pthread_cond_signal (pthread_cond_t *__cond) throw ();
>
>
>extern int pthread_cond_broadcast (pthread_cond_t *__cond) throw ();
>
>
>
>extern int pthread_cond_wait (pthread_cond_t *__restrict __cond,
>         pthread_mutex_t *__restrict __mutex);
>
>
>
>
>
>extern int pthread_cond_timedwait (pthread_cond_t *__restrict __cond,
>       pthread_mutex_t *__restrict __mutex,
>       __const struct timespec *__restrict
>       __abstime);
>
>
>
>
>extern int pthread_condattr_init (pthread_condattr_t *__attr) throw ();
>
>
>extern int pthread_condattr_destroy (pthread_condattr_t *__attr) throw ();
>
>
>extern int pthread_condattr_getpshared (__const pthread_condattr_t *
>     __restrict __attr,
>     int *__restrict __pshared) throw ();
>
>
>extern int pthread_condattr_setpshared (pthread_condattr_t *__attr,
>     int __pshared) throw ();
>
>
>
>
>
>
>
>extern int pthread_rwlock_init (pthread_rwlock_t *__restrict __rwlock,
>    __const pthread_rwlockattr_t *__restrict
>    __attr) throw ();
>
>
>extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock) throw ();
>
>
>extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>
>extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock,
>           __const struct timespec *__restrict
>           __abstime) throw ();
>
>
>
>extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>
>extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock,
>           __const struct timespec *__restrict
>           __abstime) throw ();
>
>
>
>extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>
>
>
>extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr) throw ();
>
>
>extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr) throw ();
>
>
>extern int pthread_rwlockattr_getpshared (__const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pshared) throw ();
>
>
>extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr,
>       int __pshared) throw ();
>
>
>extern int pthread_rwlockattr_getkind_np (__const pthread_rwlockattr_t *__attr,
>       int *__pref) throw ();
>
>
>extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr,
>       int __pref) throw ();
># 510 "/usr/include/pthread.h" 3 4
>extern int pthread_spin_init (pthread_spinlock_t *__lock, int __pshared)
>     throw ();
>
>
>extern int pthread_spin_destroy (pthread_spinlock_t *__lock) throw ();
>
>
>extern int pthread_spin_lock (pthread_spinlock_t *__lock) throw ();
>
>
>extern int pthread_spin_trylock (pthread_spinlock_t *__lock) throw ();
>
>
>extern int pthread_spin_unlock (pthread_spinlock_t *__lock) throw ();
>
>
>
>
>extern int pthread_barrier_init (pthread_barrier_t *__restrict __barrier,
>     __const pthread_barrierattr_t *__restrict
>     __attr, unsigned int __count) throw ();
>
>extern int pthread_barrier_destroy (pthread_barrier_t *__barrier) throw ();
>
>extern int pthread_barrierattr_init (pthread_barrierattr_t *__attr) throw ();
>
>extern int pthread_barrierattr_destroy (pthread_barrierattr_t *__attr) throw ();
>
>extern int pthread_barrierattr_getpshared (__const pthread_barrierattr_t *
>        __restrict __attr,
>        int *__restrict __pshared) throw ();
>
>extern int pthread_barrierattr_setpshared (pthread_barrierattr_t *__attr,
>        int __pshared) throw ();
>
>extern int pthread_barrier_wait (pthread_barrier_t *__barrier) throw ();
># 557 "/usr/include/pthread.h" 3 4
>extern int pthread_key_create (pthread_key_t *__key,
>          void (*__destr_function) (void *)) throw ();
>
>
>extern int pthread_key_delete (pthread_key_t __key) throw ();
>
>
>extern int pthread_setspecific (pthread_key_t __key,
>    __const void *__pointer) throw ();
>
>
>extern void *pthread_getspecific (pthread_key_t __key) throw ();
># 580 "/usr/include/pthread.h" 3 4
>extern int pthread_once (pthread_once_t *__once_control,
>    void (*__init_routine) (void));
>
>
>
>
>
>
>extern int pthread_setcancelstate (int __state, int *__oldstate);
>
>
>
>extern int pthread_setcanceltype (int __type, int *__oldtype);
>
>
>extern int pthread_cancel (pthread_t __cancelthread);
>
>
>
>
>extern void pthread_testcancel (void);
># 614 "/usr/include/pthread.h" 3 4
>extern void _pthread_cleanup_push (struct _pthread_cleanup_buffer *__buffer,
>       void (*__routine) (void *),
>       void *__arg) throw ();
>
>
>
>
>
>
>
>extern void _pthread_cleanup_pop (struct _pthread_cleanup_buffer *__buffer,
>      int __execute) throw ();
># 635 "/usr/include/pthread.h" 3 4
>extern void _pthread_cleanup_push_defer (struct _pthread_cleanup_buffer *__buffer,
>      void (*__routine) (void *),
>      void *__arg) throw ();
># 646 "/usr/include/pthread.h" 3 4
>extern void _pthread_cleanup_pop_restore (struct _pthread_cleanup_buffer *__buffer,
>       int __execute) throw ();
>
>
>
>
>
>extern int pthread_getcpuclockid (pthread_t __thread_id,
>      __clockid_t *__clock_id) throw ();
>
>
>
>
># 1 "/usr/include/bits/sigthread.h" 1 3 4
># 31 "/usr/include/bits/sigthread.h" 3 4
>extern int pthread_sigmask (int __how,
>       __const __sigset_t *__restrict __newmask,
>       __sigset_t *__restrict __oldmask)throw ();
>
>
>extern int pthread_kill (pthread_t __threadid, int __signo) throw ();
># 660 "/usr/include/pthread.h" 2 3 4
># 675 "/usr/include/pthread.h" 3 4
>extern int pthread_atfork (void (*__prepare) (void),
>      void (*__parent) (void),
>      void (*__child) (void)) throw ();
>
>
>
>
>extern void pthread_kill_other_threads_np (void) throw ();
>
>}
># 44 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr-default.h" 2 3
># 1 "/usr/include/unistd.h" 1 3 4
># 28 "/usr/include/unistd.h" 3 4
>extern "C" {
># 171 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/bits/posix_opt.h" 1 3 4
># 172 "/usr/include/unistd.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/environments.h" 1 3 4
># 176 "/usr/include/unistd.h" 2 3 4
># 195 "/usr/include/unistd.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 196 "/usr/include/unistd.h" 2 3 4
># 236 "/usr/include/unistd.h" 3 4
>typedef __intptr_t intptr_t;
>
>
>
>
>
>
>typedef __socklen_t socklen_t;
># 256 "/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)));
># 287 "/usr/include/unistd.h" 3 4
>extern __off_t lseek (int __fd, __off_t __offset, int __whence) throw ();
># 298 "/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);
># 328 "/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);
># 356 "/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 ();
># 378 "/usr/include/unistd.h" 3 4
>extern unsigned int alarm (unsigned int __seconds) throw ();
># 390 "/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);
># 414 "/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 chdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int fchdir (int __fd) throw ();
># 448 "/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)));
>
>
>
>
>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
>
>  };
># 531 "/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 () __attribute__ ((__const__));
>
>
>
>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 ();
># 567 "/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 ();
># 593 "/usr/include/unistd.h" 3 4
>extern int setpgrp (void) throw ();
># 610 "/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 *__euid, __uid_t *__ruid, __uid_t *__suid);
>
>
>
>extern int getresgid (__gid_t *__egid, __gid_t *__rgid, __gid_t *__sgid);
>
>
>
>extern int setresuid (__uid_t __euid, __uid_t __ruid, __uid_t __suid);
>
>
>
>extern int setresgid (__gid_t __egid, __gid_t __rgid, __gid_t __sgid);
>
>
>
>
>
>
>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 symlink (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int readlink (__const char *__restrict __path, char *__restrict __buf,
>       size_t __len) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int unlink (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
>
>
>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)));
># 783 "/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
>}
># 784 "/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)));
># 869 "/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)));
># 906 "/usr/include/unistd.h" 3 4
>extern int truncate64 (__const char *__file, __off64_t __length)
>     throw () __attribute__ ((__nonnull__ (1)));
># 916 "/usr/include/unistd.h" 3 4
>extern int ftruncate (int __fd, __off_t __length) throw ();
># 926 "/usr/include/unistd.h" 3 4
>extern int ftruncate64 (int __fd, __off64_t __length) throw ();
># 936 "/usr/include/unistd.h" 3 4
>extern int brk (void *__addr) throw ();
>
>
>
>
>
>extern void *sbrk (intptr_t __delta) throw ();
># 957 "/usr/include/unistd.h" 3 4
>extern long int syscall (long int __sysno, ...) throw ();
># 980 "/usr/include/unistd.h" 3 4
>extern int lockf (int __fd, int __cmd, __off_t __len);
># 990 "/usr/include/unistd.h" 3 4
>extern int lockf64 (int __fd, int __cmd, __off64_t __len);
># 1011 "/usr/include/unistd.h" 3 4
>extern int fdatasync (int __fildes) throw ();
>
>
>
>
>
>
>
>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 () __attribute__ ((__nonnull__ (1)));
>
>
>}
># 45 "/usr/include/c++/4.0.2/i586-suse-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;
># 63 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr-default.h" 3
>#pragma weak pthread_once
>#pragma weak pthread_key_create
>#pragma weak pthread_key_delete
>#pragma weak pthread_getspecific
>#pragma weak pthread_setspecific
>#pragma weak pthread_create
>#pragma weak pthread_cancel
>
>#pragma weak pthread_mutex_lock
>#pragma weak pthread_mutex_trylock
>#pragma weak pthread_mutex_unlock
>#pragma weak pthread_mutexattr_init
>#pragma weak pthread_mutexattr_settype
>#pragma weak pthread_mutexattr_destroy
>
>#pragma weak pthread_mutex_init
># 106 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_active_p (void)
>{
>  static void *const __gthread_active_ptr
>    = __extension__ (void *) &pthread_cancel;
>  return __gthread_active_ptr != 0;
>}
># 473 "/usr/include/c++/4.0.2/i586-suse-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_once (__gthread_once_t *once, void (*func) (void))
>{
>  if (__gthread_active_p ())
>    return pthread_once (once, func);
>  else
>    return -1;
>}
>
>static inline int
>__gthread_key_create (__gthread_key_t *key, void (*dtor) (void *))
>{
>  return pthread_key_create (key, dtor);
>}
>
>static inline int
>__gthread_key_delete (__gthread_key_t key)
>{
>  return pthread_key_delete (key);
>}
>
>static inline void *
>__gthread_getspecific (__gthread_key_t key)
>{
>  return pthread_getspecific (key);
>}
>
>static inline int
>__gthread_setspecific (__gthread_key_t key, const void *ptr)
>{
>  return pthread_setspecific (key, ptr);
>}
>
>static inline int
>__gthread_mutex_lock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return pthread_mutex_lock (mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_trylock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return pthread_mutex_trylock (mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_unlock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return pthread_mutex_unlock (mutex);
>  else
>    return 0;
>}
># 555 "/usr/include/c++/4.0.2/i586-suse-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/include/c++/4.0.2/i586-suse-linux/bits/gthr.h" 2 3
>
>
>
>
>
>
>
>#pragma GCC visibility pop
># 38 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++io.h" 2 3
>
>namespace std
>{
>  typedef __gthread_mutex_t __c_lock;
>
>
>  typedef FILE __c_file;
>
>
>
>  struct __ios_flags
>  {
>    typedef short __int_type;
>
>    static const __int_type _S_boolalpha = 0x0001;
>    static const __int_type _S_dec = 0x0002;
>    static const __int_type _S_fixed = 0x0004;
>    static const __int_type _S_hex = 0x0008;
>    static const __int_type _S_internal = 0x0010;
>    static const __int_type _S_left = 0x0020;
>    static const __int_type _S_oct = 0x0040;
>    static const __int_type _S_right = 0x0080;
>    static const __int_type _S_scientific = 0x0100;
>    static const __int_type _S_showbase = 0x0200;
>    static const __int_type _S_showpoint = 0x0400;
>    static const __int_type _S_showpos = 0x0800;
>    static const __int_type _S_skipws = 0x1000;
>    static const __int_type _S_unitbuf = 0x2000;
>    static const __int_type _S_uppercase = 0x4000;
>    static const __int_type _S_adjustfield = 0x0020 | 0x0080 | 0x0010;
>    static const __int_type _S_basefield = 0x0002 | 0x0040 | 0x0008;
>    static const __int_type _S_floatfield = 0x0100 | 0x0004;
>
>
>    static const __int_type _S_badbit = 0x01;
>    static const __int_type _S_eofbit = 0x02;
>    static const __int_type _S_failbit = 0x04;
>
>
>    static const __int_type _S_app = 0x01;
>    static const __int_type _S_ate = 0x02;
>    static const __int_type _S_bin = 0x04;
>    static const __int_type _S_in = 0x08;
>    static const __int_type _S_out = 0x10;
>    static const __int_type _S_trunc = 0x20;
>  };
>}
># 48 "/usr/include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/include/c++/4.0.2/cctype" 1 3
># 47 "/usr/include/c++/4.0.2/cctype" 3
>       
># 48 "/usr/include/c++/4.0.2/cctype" 3
>#pragma GCC visibility push(default)
>
>
># 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/include/c++/4.0.2/cctype" 2 3
># 68 "/usr/include/c++/4.0.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;
>}
>
>#pragma GCC visibility pop
># 49 "/usr/include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stringfwd.h" 1 3
># 42 "/usr/include/c++/4.0.2/bits/stringfwd.h" 3
>       
># 43 "/usr/include/c++/4.0.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;
>
>}
># 50 "/usr/include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/include/c++/4.0.2/bits/postypes.h" 1 3
># 44 "/usr/include/c++/4.0.2/bits/postypes.h" 3
>       
># 45 "/usr/include/c++/4.0.2/bits/postypes.h" 3
>
># 1 "/usr/include/c++/4.0.2/cwchar" 1 3
># 47 "/usr/include/c++/4.0.2/cwchar" 3
>       
># 48 "/usr/include/c++/4.0.2/cwchar" 3
>#pragma GCC visibility push(default)
>
>
>
># 1 "/usr/include/c++/4.0.2/ctime" 1 3
># 47 "/usr/include/c++/4.0.2/ctime" 3
>       
># 48 "/usr/include/c++/4.0.2/ctime" 3
>#pragma GCC visibility push(default)
># 65 "/usr/include/c++/4.0.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;
>}
>
>#pragma GCC visibility pop
># 53 "/usr/include/c++/4.0.2/cwchar" 2 3
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 40 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stdarg.h" 1 3 4
># 41 "/usr/include/wchar.h" 2 3 4
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
># 93 "/usr/include/wchar.h" 3 4
>
>
>typedef __mbstate_t mbstate_t;
>
>
>
># 118 "/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 ();
>
>
>
>
>extern __inline size_t
>mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw ()
>
>{ return (__ps != __null
>   ? mbrtowc (__null, __s, __n, __ps) : __mbrlen (__s, __n, __null)); }
>
>
>
>
>
>extern size_t mbsrtowcs (wchar_t *__restrict __dst,
>    __const char **__restrict __src, size_t __len,
>    mbstate_t *__restrict __ps) throw ();
>
>
>
>extern size_t wcsrtombs (char *__restrict __dst,
>    __const wchar_t **__restrict __src, size_t __len,
>    mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>extern size_t mbsnrtowcs (wchar_t *__restrict __dst,
>     __const char **__restrict __src, size_t __nmc,
>     size_t __len, mbstate_t *__restrict __ps) throw ();
>
>
>
>extern size_t wcsnrtombs (char *__restrict __dst,
>     __const wchar_t **__restrict __src,
>     size_t __nwc, size_t __len,
>     mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>extern int wcwidth (wchar_t __c) throw ();
>
>
>
>extern int wcswidth (__const wchar_t *__s, size_t __n) throw ();
>
>
>
>
>
>
>extern double wcstod (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr) throw ();
>
>
>
>extern float wcstof (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr) throw ();
>extern long double wcstold (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr) throw ();
>
>
>
>
>
>extern long int wcstol (__const wchar_t *__restrict __nptr,
>   wchar_t **__restrict __endptr, int __base) throw ();
>
>
>
>extern unsigned long int wcstoul (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>
>__extension__
>extern long long int wcstoll (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>__extension__
>extern unsigned long long int wcstoull (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr,
>     int __base) throw ();
>
>
>
>
>
>
>__extension__
>extern long long int wcstoq (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>__extension__
>extern unsigned long long int wcstouq (__const wchar_t *__restrict __nptr,
>           wchar_t **__restrict __endptr,
>           int __base) throw ();
># 449 "/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 double __wcstod_internal (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr, int __group)
>     throw ();
>extern float __wcstof_internal (__const wchar_t *__restrict __nptr,
>    wchar_t **__restrict __endptr, int __group)
>     throw ();
>extern long double __wcstold_internal (__const wchar_t *__restrict __nptr,
>           wchar_t **__restrict __endptr,
>           int __group) throw ();
>
>
>extern long int __wcstol_internal (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, int __group) throw ();
>
>
>
>extern unsigned long int __wcstoul_internal (__const wchar_t *__restrict __npt,
>          wchar_t **__restrict __endptr,
>          int __base, int __group) throw ();
>
>
>
>__extension__
>extern long long int __wcstoll_internal (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr,
>      int __base, int __group) throw ();
>
>
>
>__extension__
>extern unsigned long long int __wcstoull_internal (__const wchar_t *
>         __restrict __nptr,
>         wchar_t **
>         __restrict __endptr,
>         int __base,
>         int __group) throw ();
>
>
>
>
>
>
>
>
>extern __inline double
>wcstod (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw ()
>
>{ return __wcstod_internal (__nptr, __endptr, 0); }
>extern __inline long int
>wcstol (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstol_internal (__nptr, __endptr, __base, 0); }
>extern __inline unsigned long int
>wcstoul (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstoul_internal (__nptr, __endptr, __base, 0); }
>
>
>
>extern __inline float
>wcstof (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw ()
>
>{ return __wcstof_internal (__nptr, __endptr, 0); }
>extern __inline long double
>wcstold (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw ()
>
>{ return __wcstold_internal (__nptr, __endptr, 0); }
>
>
>__extension__
>extern __inline long long int
>wcstoq (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstoll_internal (__nptr, __endptr, __base, 0); }
>__extension__
>extern __inline unsigned long long int
>wcstouq (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstoull_internal (__nptr, __endptr, __base, 0); }
>
>
>
>
>
>
>
>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 ();
>
>
>
>
>
>
>
>
>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 () ;
>
>
>
>
>
>
>
>
>
>
>
>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 () ;
>
>
>
>
>
>
>
>
>
>
>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);
>
># 739 "/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);
># 765 "/usr/include/wchar.h" 3 4
>extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream);
>extern wint_t putwchar_unlocked (wchar_t __wc);
># 775 "/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 ();
># 820 "/usr/include/wchar.h" 3 4
>}
># 56 "/usr/include/c++/4.0.2/cwchar" 2 3
># 70 "/usr/include/c++/4.0.2/cwchar" 3
>namespace std
>{
>  using ::mbstate_t;
>}
># 142 "/usr/include/c++/4.0.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, 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/include/c++/4.0.2/cwchar" 3
>  using ::wcstoll;
>  using ::wcstoull;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::wcstold;
>  using __gnu_cxx::wcstoll;
>  using __gnu_cxx::wcstoull;
>}
>
>
>
>
>#pragma GCC visibility pop
># 47 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/postypes.h" 2 3
>
>
>namespace std
>{
># 72 "/usr/include/c++/4.0.2/bits/postypes.h" 3
>  typedef int64_t streamoff;
>
>
>
>
>
>  typedef ptrdiff_t streamsize;
>
>  template<typename _StateT>
>    class fpos;
># 94 "/usr/include/c++/4.0.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/include/c++/4.0.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;
>}
># 51 "/usr/include/c++/4.0.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;
># 136 "/usr/include/c++/4.0.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;
>
>
>}
>
>#pragma GCC visibility pop
># 70 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_pair.h" 1 3
># 64 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/bits/cpp_type_traits.h" 1 3
># 41 "/usr/include/c++/4.0.2/bits/cpp_type_traits.h" 3
>       
># 42 "/usr/include/c++/4.0.2/bits/cpp_type_traits.h" 3
># 75 "/usr/include/c++/4.0.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))
> };
>    };
>
>}
># 72 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_iterator_base_types.h" 1 3
># 67 "/usr/include/c++/4.0.2/bits/stl_iterator_base_types.h" 3
>       
># 68 "/usr/include/c++/4.0.2/bits/stl_iterator_base_types.h" 3
>
>namespace std
>{
># 80 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 1 3
># 67 "/usr/include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 3
>       
># 68 "/usr/include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 3
># 1 "/usr/include/c++/4.0.2/bits/concept_check.h" 1 3
># 38 "/usr/include/c++/4.0.2/bits/concept_check.h" 3
>       
># 39 "/usr/include/c++/4.0.2/bits/concept_check.h" 3
># 69 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_iterator.h" 1 3
># 68 "/usr/include/c++/4.0.2/bits/stl_iterator.h" 3
>namespace std
>{
># 89 "/usr/include/c++/4.0.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); }
>    };
># 275 "/usr/include/c++/4.0.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); }
># 335 "/usr/include/c++/4.0.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) { }
># 361 "/usr/include/c++/4.0.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; }
>    };
># 395 "/usr/include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline back_insert_iterator<_Container>
>    back_inserter(_Container& __x)
>    { return back_insert_iterator<_Container>(__x); }
># 410 "/usr/include/c++/4.0.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) { }
># 435 "/usr/include/c++/4.0.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; }
>    };
># 469 "/usr/include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline front_insert_iterator<_Container>
>    front_inserter(_Container& __x)
>    { return front_insert_iterator<_Container>(__x); }
># 488 "/usr/include/c++/4.0.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) {}
># 530 "/usr/include/c++/4.0.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; }
>    };
># 565 "/usr/include/c++/4.0.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>
>        inline __normal_iterator(const __normal_iterator<_Iter,
>     _Container>& __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; }
>    };
># 678 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/include/c++/4.0.2/debug/debug.h" 1 3
># 272 "/usr/include/c++/4.0.2/debug/debug.h" 3
># 1 "/usr/include/c++/4.0.2/cassert" 1 3
># 46 "/usr/include/c++/4.0.2/cassert" 3
>       
># 47 "/usr/include/c++/4.0.2/cassert" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/assert.h" 1 3 4
># 65 "/usr/include/assert.h" 3 4
>extern "C" {
>
>
>extern void __assert_fail (__const char *__assertion, __const char *__file,
>      unsigned int __line, __const char *__function)
>     throw () __attribute__ ((__noreturn__));
>
>
>extern void __assert_perror_fail (int __errnum, __const char *__file,
>      unsigned int __line,
>      __const char *__function)
>     throw () __attribute__ ((__noreturn__));
>
>
>
>
>extern void __assert (const char *__assertion, const char *__file, int __line)
>     throw () __attribute__ ((__noreturn__));
>
>
>}
># 50 "/usr/include/c++/4.0.2/cassert" 2 3
>
>#pragma GCC visibility pop
># 273 "/usr/include/c++/4.0.2/debug/debug.h" 2 3
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 275 "/usr/include/c++/4.0.2/debug/debug.h" 2 3
>
>
>
>namespace __gnu_debug
>{
>  template<typename _Iterator, typename _Sequence>
>    class _Safe_iterator;
>
>
>  inline bool
>  __check_singular_aux(const void*) { return false; }
>
>
>
>  template<typename _Iterator>
>    inline bool
>    __check_singular(_Iterator& __x)
>    { return __gnu_debug::__check_singular_aux(&__x); }
>
>
>  template<typename _Tp>
>    inline bool
>    __check_singular(const _Tp* __ptr)
>    { return __ptr == 0; }
>
>
>  template<typename _Iterator, typename _Sequence>
>    inline bool
>    __check_singular(const _Safe_iterator<_Iterator, _Sequence>& __x)
>    { return __x._M_singular(); }
>
>
>
>  template<typename _Iterator>
>    inline bool
>    __check_dereferenceable(_Iterator&)
>    { return true; }
>
>
>  template<typename _Tp>
>    inline bool
>    __check_dereferenceable(const _Tp* __ptr)
>    { return __ptr; }
>
>
>  template<typename _Iterator, typename _Sequence>
>    inline bool
>    __check_dereferenceable(const _Safe_iterator<_Iterator, _Sequence>& __x)
>    { return __x._M_dereferenceable(); }
>
>
>
>
>  template<typename _RandomAccessIterator>
>    inline bool
>    __valid_range_aux2(const _RandomAccessIterator& __first,
>         const _RandomAccessIterator& __last,
>         std::random_access_iterator_tag)
>    { return __last - __first >= 0; }
>
>
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __valid_range_aux2(const _InputIterator&, const _InputIterator&,
>         std::input_iterator_tag)
>    { return true; }
>
>
>
>
>
>  template<typename _Integral>
>    inline bool
>    __valid_range_aux(const _Integral&, const _Integral&, __true_type)
>    { return true; }
>
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __valid_range_aux(const _InputIterator& __first,
>        const _InputIterator& __last, __false_type)
>  {
>    typedef typename std::iterator_traits<_InputIterator>::iterator_category
>      _Category;
>    return __gnu_debug::__valid_range_aux2(__first, __last, _Category());
>  }
>
>
>
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __valid_range(const _InputIterator& __first, const _InputIterator& __last)
>    {
>      typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>      return __gnu_debug::__valid_range_aux(__first, __last, _Integral());
>    }
>
>
>  template<typename _Iterator, typename _Sequence>
>    inline bool
>    __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first,
>    const _Safe_iterator<_Iterator, _Sequence>& __last)
>    { return __first._M_valid_range(__last); }
>
>
>
>
>
>  template<typename _InputIterator>
>    inline _InputIterator
>    __check_valid_range(const _InputIterator& __first,
>   const _InputIterator& __last)
>    {
>      ;
>      return __first;
>    }
>
>
>  template<typename _CharT, typename _Integer>
>    inline const _CharT*
>    __check_string(const _CharT* __s, const _Integer& __n)
>    {
>
>
>
>      return __s;
>    }
>
>
>  template<typename _CharT>
>    inline const _CharT*
>    __check_string(const _CharT* __s)
>    {
>
>
>
>      return __s;
>    }
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __check_sorted_aux(const _InputIterator&, const _InputIterator&,
>                       std::input_iterator_tag)
>    { return true; }
>
>
>
>  template<typename _ForwardIterator>
>    inline bool
>    __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
>                       std::forward_iterator_tag)
>    {
>      if (__first == __last)
>        return true;
>
>      _ForwardIterator __next = __first;
>      for (++__next; __next != __last; __first = __next, ++__next) {
>        if (*__next < *__first)
>          return false;
>      }
>
>      return true;
>    }
>
>
>
>  template<typename _InputIterator, typename _Predicate>
>    inline bool
>    __check_sorted_aux(const _InputIterator&, const _InputIterator&,
>                       _Predicate, std::input_iterator_tag)
>    { return true; }
>
>
>
>  template<typename _ForwardIterator, typename _Predicate>
>    inline bool
>    __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
>                       _Predicate __pred, std::forward_iterator_tag)
>    {
>      if (__first == __last)
>        return true;
>
>      _ForwardIterator __next = __first;
>      for (++__next; __next != __last; __first = __next, ++__next) {
>        if (__pred(*__next, *__first))
>          return false;
>      }
>
>      return true;
>    }
>
>
>  template<typename _InputIterator>
>    inline bool
>    __check_sorted(const _InputIterator& __first, const _InputIterator& __last)
>    {
>      typedef typename std::iterator_traits<_InputIterator>::iterator_category
>        _Category;
>      return __gnu_debug::__check_sorted_aux(__first, __last, _Category());
>    }
>
>  template<typename _InputIterator, typename _Predicate>
>    inline bool
>    __check_sorted(const _InputIterator& __first, const _InputIterator& __last,
>                   _Predicate __pred)
>    {
>      typedef typename std::iterator_traits<_InputIterator>::iterator_category
>        _Category;
>      return __gnu_debug::__check_sorted_aux(__first, __last, __pred,
>          _Category());
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline bool
>    __check_partitioned(_ForwardIterator __first, _ForwardIterator __last,
>   const _Tp& __value)
>    {
>      while (__first != __last && *__first < __value)
> ++__first;
>      while (__first != __last && !(*__first < __value))
> ++__first;
>      return __first == __last;
>    }
>
>
>  template<typename _ForwardIterator, typename _Tp, typename _Pred>
>    inline bool
>    __check_partitioned(_ForwardIterator __first, _ForwardIterator __last,
>   const _Tp& __value, _Pred __pred)
>    {
>      while (__first != __last && __pred(*__first, __value))
> ++__first;
>      while (__first != __last && !__pred(*__first, __value))
> ++__first;
>      return __first == __last;
>    }
>}
># 77 "/usr/include/c++/4.0.2/bits/stl_algobase.h" 2 3
>
>namespace std
>{
># 90 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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);
>
>
>
>
>
>
>  }
>
>}
># 68 "/usr/include/c++/4.0.2/list" 2 3
># 1 "/usr/include/c++/4.0.2/bits/allocator.h" 1 3
># 52 "/usr/include/c++/4.0.2/bits/allocator.h" 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++allocator.h" 1 3
># 34 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++allocator.h" 3
># 1 "/usr/include/c++/4.0.2/ext/new_allocator.h" 1 3
># 37 "/usr/include/c++/4.0.2/ext/new_allocator.h" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/c++/4.0.2/new" 1 3
># 42 "/usr/include/c++/4.0.2/new" 3
># 1 "/usr/include/c++/4.0.2/exception" 1 3
># 40 "/usr/include/c++/4.0.2/exception" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
># 54 "/usr/include/c++/4.0.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/include/c++/4.0.2/exception" 3
>  bool uncaught_exception() throw();
>}
>
>namespace __gnu_cxx
>{
># 117 "/usr/include/c++/4.0.2/exception" 3
>  void __verbose_terminate_handler ();
>}
>
>}
>
>#pragma GCC visibility pop
># 43 "/usr/include/c++/4.0.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/include/c++/4.0.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
># 40 "/usr/include/c++/4.0.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; }
>}
>
>#pragma GCC visibility pop
># 35 "/usr/include/c++/4.0.2/i586-suse-linux/bits/c++allocator.h" 2 3
># 53 "/usr/include/c++/4.0.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>;
>
>
>
>
>}
># 69 "/usr/include/c++/4.0.2/list" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_construct.h" 1 3
># 67 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type)
>    { }
># 146 "/usr/include/c++/4.0.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/include/c++/4.0.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 _Allocator, typename _Tp>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      allocator<_Tp>)
>    {
>      _Destroy(__first, __last);
>    }
>
>
>}
># 70 "/usr/include/c++/4.0.2/list" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_uninitialized.h" 1 3
># 66 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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;
> }
>    }
>
>}
># 71 "/usr/include/c++/4.0.2/list" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_list.h" 1 3
># 66 "/usr/include/c++/4.0.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/include/c++/4.0.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() { }
>
>      _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;
>    };
># 186 "/usr/include/c++/4.0.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() { }
>
>      _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:
># 295 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      typedef typename _Alloc::template rebind<_List_node<_Tp> >::other
>
>      _Node_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)
> { }
>      };
>
>      _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;
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(*static_cast<
>         const _Node_Alloc_type*>(&this->_M_impl)); }
>
>      _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;
>      }
>    };
># 390 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
>    class list : protected _List_base<_Tp, _Alloc>
>    {
>
>     
>
>      typedef _List_base<_Tp, _Alloc> _Base;
>
>    public:
>      typedef _Tp value_type;
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::const_pointer const_pointer;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::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 typename _Base::allocator_type allocator_type;
>
>    protected:
>
>
>      typedef _List_node<_Tp> _Node;
>
>
>
>
>
>
>
>      using _Base::_M_impl;
>      using _Base::_M_put_node;
>      using _Base::_M_get_node;
># 434 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      _Node*
>      _M_create_node(const value_type& __x)
>      {
> _Node* __p = this->_M_get_node();
> try
>   {
>     this->get_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) { }
># 467 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      list(size_type __n, const value_type& __value,
>    const allocator_type& __a = allocator_type())
>      : _Base(__a)
>      { this->insert(begin(), __n, __value); }
># 479 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      explicit
>      list(size_type __n)
>      : _Base(allocator_type())
>      { this->insert(begin(), __n, value_type()); }
># 491 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      list(const list& __x)
>      : _Base(__x.get_allocator())
>      { this->insert(begin(), __x.begin(), __x.end()); }
># 509 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/stl_list.h" 3
>      list&
>      operator=(const list& __x);
># 543 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 559 "/usr/include/c++/4.0.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 this->_M_impl._M_node._M_next; }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return this->_M_impl._M_node._M_next; }
>
>
>
>
>
>
>      iterator
>      end() { return &this->_M_impl._M_node; }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return &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); }
># 673 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      resize(size_type __new_size, const value_type& __x);
># 685 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      resize(size_type __new_size)
>      { this->resize(__new_size, 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;
>      }
># 741 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      push_front(const value_type& __x)
>      { this->_M_insert(begin(), __x); }
># 757 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      pop_front()
>      { this->_M_erase(begin()); }
># 771 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      push_back(const value_type& __x)
>      { this->_M_insert(end(), __x); }
># 786 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      pop_back()
>      { this->_M_erase(this->_M_impl._M_node._M_prev); }
># 801 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x);
># 817 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 835 "/usr/include/c++/4.0.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());
> }
># 860 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      iterator
>      erase(iterator __position);
># 882 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      iterator
>      erase(iterator __first, iterator __last)
>      {
> while (__first != __last)
>   __first = erase(__first);
> return __last;
>      }
># 899 "/usr/include/c++/4.0.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();
>      }
># 926 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      splice(iterator __position, list& __x)
>      {
> if (!__x.empty())
>   this->_M_transfer(__position, __x.begin(), __x.end());
>      }
># 942 "/usr/include/c++/4.0.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);
>      }
># 964 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      splice(iterator __position, list&, iterator __first, iterator __last)
>      {
> if (__first != __last)
>   this->_M_transfer(__position, __first, __last);
>      }
># 982 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      remove(const _Tp& __value);
># 996 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      template<typename _Predicate>
>      void
>      remove_if(_Predicate);
># 1010 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      unique();
># 1025 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      template<typename _BinaryPredicate>
>        void
>        unique(_BinaryPredicate);
># 1038 "/usr/include/c++/4.0.2/bits/stl_list.h" 3
>      void
>      merge(list& __x);
># 1053 "/usr/include/c++/4.0.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);
>        this->get_allocator().destroy(&__n->_M_data);
>        _M_put_node(__n);
>      }
>    };
># 1176 "/usr/include/c++/4.0.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;
>    }
># 1205 "/usr/include/c++/4.0.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); }
>}
># 72 "/usr/include/c++/4.0.2/list" 2 3
>
>
># 1 "/usr/include/c++/4.0.2/bits/list.tcc" 1 3
># 64 "/usr/include/c++/4.0.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);
>   this->get_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 __tmp;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    typename list<_Tp, _Alloc>::iterator
>    list<_Tp, _Alloc>::
>    erase(iterator __position)
>    {
>      iterator __ret = __position._M_node->_M_next;
>      _M_erase(__position);
>      return __ret;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    void
>    list<_Tp, _Alloc>::
>    resize(size_type __new_size, const 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));
>   }
>      }
>}
># 75 "/usr/include/c++/4.0.2/list" 2 3
>
>
>
>
>
>
>#pragma GCC visibility pop
># 5 "y2storage/Disk.h" 2
>
># 1 "y2storage/y2storage/Container.h" 1
>
>
>
>
>
># 1 "y2storage/y2storage/y2storage/Volume.h" 1
>
>
>
># 1 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h" 1
>
>
>
>
># 1 "/usr/include/c++/4.0.2/string" 1 3
># 42 "/usr/include/c++/4.0.2/string" 3
>       
># 43 "/usr/include/c++/4.0.2/string" 3
>#pragma GCC visibility push(default)
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/char_traits.h" 1 3
># 43 "/usr/include/c++/4.0.2/bits/char_traits.h" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/char_traits.h" 3
>
>
>
>
>
>namespace __gnu_cxx
>{
># 61 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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; }
>  };
>
>
>}
># 48 "/usr/include/c++/4.0.2/string" 2 3
># 1 "/usr/include/c++/4.0.2/memory" 1 3
># 51 "/usr/include/c++/4.0.2/memory" 3
>       
># 52 "/usr/include/c++/4.0.2/memory" 3
>#pragma GCC visibility push(default)
>
>
>
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/stl_raw_storage_iter.h" 1 3
># 64 "/usr/include/c++/4.0.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;
>      }
>    };
>}
># 60 "/usr/include/c++/4.0.2/memory" 2 3
>
># 1 "/usr/include/c++/4.0.2/limits" 1 3
># 46 "/usr/include/c++/4.0.2/limits" 3
>       
># 47 "/usr/include/c++/4.0.2/limits" 3
>#pragma GCC visibility push(default)
># 151 "/usr/include/c++/4.0.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
>  };
># 193 "/usr/include/c++/4.0.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;
>  };
># 286 "/usr/include/c++/4.0.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;
>    };
>
>
>
>
>
>}
>
>
>
>
>
>
>
>#pragma GCC visibility pop
># 62 "/usr/include/c++/4.0.2/memory" 2 3
>
>namespace std
>{
># 73 "/usr/include/c++/4.0.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);
>    }
># 109 "/usr/include/c++/4.0.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)); }
># 121 "/usr/include/c++/4.0.2/memory" 3
>  template<typename _Tp>
>    void
>    return_temporary_buffer(_Tp* __p)
>    { ::operator delete(__p, nothrow); }
># 133 "/usr/include/c++/4.0.2/memory" 3
>  template<typename _Tp1>
>    struct auto_ptr_ref
>    {
>      _Tp1* _M_ptr;
>
>      explicit
>      auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }
>    };
># 174 "/usr/include/c++/4.0.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) { }
># 200 "/usr/include/c++/4.0.2/memory" 3
>      auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }
># 212 "/usr/include/c++/4.0.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { }
># 223 "/usr/include/c++/4.0.2/memory" 3
>      auto_ptr&
>      operator=(auto_ptr& __a) throw()
>      {
> reset(__a.release());
> return *this;
>      }
># 240 "/usr/include/c++/4.0.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr&
>        operator=(auto_ptr<_Tp1>& __a) throw()
>        {
>   reset(__a.release());
>   return *this;
> }
># 260 "/usr/include/c++/4.0.2/memory" 3
>      ~auto_ptr() { delete _M_ptr; }
># 270 "/usr/include/c++/4.0.2/memory" 3
>      element_type&
>      operator*() const throw()
>      {
> ;
> return *_M_ptr;
>      }
>
>
>
>
>
>
>
>      element_type*
>      operator->() const throw()
>      {
> ;
> return _M_ptr;
>      }
># 300 "/usr/include/c++/4.0.2/memory" 3
>      element_type*
>      get() const throw() { return _M_ptr; }
># 314 "/usr/include/c++/4.0.2/memory" 3
>      element_type*
>      release() throw()
>      {
> element_type* __tmp = _M_ptr;
> _M_ptr = 0;
> return __tmp;
>      }
># 329 "/usr/include/c++/4.0.2/memory" 3
>      void
>      reset(element_type* __p = 0) throw()
>      {
> if (__p != _M_ptr)
>   {
>     delete _M_ptr;
>     _M_ptr = __p;
>   }
>      }
># 350 "/usr/include/c++/4.0.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()); }
>  };
>}
>
>#pragma GCC visibility pop
># 49 "/usr/include/c++/4.0.2/string" 2 3
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/stl_function.h" 1 3
># 64 "/usr/include/c++/4.0.2/bits/stl_function.h" 3
>namespace std
>{
># 101 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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; }
>    };
># 590 "/usr/include/c++/4.0.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 _Tp>
>    class mem_fun_t<void, _Tp> : public unary_function<_Tp*, void>
>    {
>    public:
>      explicit
>      mem_fun_t(void (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp* __p) const
>      { (__p->*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)();
>    };
>
>
>  template <class _Tp>
>    class const_mem_fun_t<void, _Tp> : public unary_function<const _Tp*, void>
>    {
>    public:
>      explicit
>      const_mem_fun_t(void (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp* __p) const
>      { (__p->*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Tp>
>    class mem_fun_ref_t<void, _Tp> : public unary_function<_Tp, void>
>    {
>    public:
>      explicit
>      mem_fun_ref_t(void (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp& __r) const
>      { (__r.*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)();
>    };
>
>
>  template <class _Tp>
>    class const_mem_fun_ref_t<void, _Tp> : public unary_function<_Tp, void>
>    {
>    public:
>      explicit
>      const_mem_fun_ref_t(void (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp& __r) const
>      { (__r.*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Tp, class _Arg>
>    class mem_fun1_t<void, _Tp, _Arg> : public binary_function<_Tp*, _Arg, void>
>    {
>    public:
>      explicit
>      mem_fun1_t(void (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp* __p, _Arg __x) const
>      { (__p->*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Tp, class _Arg>
>    class const_mem_fun1_t<void, _Tp, _Arg>
>    : public binary_function<const _Tp*, _Arg, void>
>    {
>    public:
>      explicit
>      const_mem_fun1_t(void (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp* __p, _Arg __x) const
>      { (__p->*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>  template <class _Tp, class _Arg>
>    class mem_fun1_ref_t<void, _Tp, _Arg>
>    : public binary_function<_Tp, _Arg, void>
>    {
>    public:
>      explicit
>      mem_fun1_ref_t(void (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp& __r, _Arg __x) const
>      { (__r.*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Tp, class _Arg>
>    class const_mem_fun1_ref_t<void, _Tp, _Arg>
>    : public binary_function<_Tp, _Arg, void>
>    {
>    public:
>      explicit
>      const_mem_fun1_ref_t(void (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp& __r, _Arg __x) const
>      { (__r.*_M_f)(__x); }
>    private:
>      void (_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); }
>
>
>
>}
># 53 "/usr/include/c++/4.0.2/string" 2 3
># 1 "/usr/include/c++/4.0.2/bits/basic_string.h" 1 3
># 43 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>
># 1 "/usr/include/c++/4.0.2/bits/atomicity.h" 1 3
># 38 "/usr/include/c++/4.0.2/bits/atomicity.h" 3
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/atomic_word.h" 1 3
># 33 "/usr/include/c++/4.0.2/i586-suse-linux/bits/atomic_word.h" 3
>typedef int _Atomic_word;
># 39 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/basic_string.h" 2 3
>
>
>namespace std
>{
># 109 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_string
>    {
>
>    public:
>      typedef _Traits traits_type;
>      typedef typename _Traits::char_type value_type;
>      typedef _Alloc allocator_type;
>      typedef typename _Alloc::size_type size_type;
>      typedef typename _Alloc::difference_type difference_type;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::const_reference const_reference;
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::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:
># 144 "/usr/include/c++/4.0.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;
># 169 "/usr/include/c++/4.0.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()
>        { return *reinterpret_cast<_Rep*>(&_S_empty_rep_storage); }
>
>        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);
># 443 "/usr/include/c++/4.0.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); }
># 498 "/usr/include/c++/4.0.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; }
># 609 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      void
>      resize(size_type __n, _CharT __c);
># 622 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      void
>      resize(size_type __n)
>      { this->resize(__n, _CharT()); }
>
>
>
>
>
>      size_type
>      capacity() const
>      { return _M_rep()->_M_capacity; }
># 651 "/usr/include/c++/4.0.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; }
># 679 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      const_reference
>      operator[] (size_type __pos) const
>      {
> ;
> return _M_data()[__pos];
>      }
># 696 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      reference
>      operator[](size_type __pos)
>      {
>
> ;
>
> ;
> _M_leak();
> return _M_data()[__pos];
>      }
># 717 "/usr/include/c++/4.0.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];
>      }
># 736 "/usr/include/c++/4.0.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);
># 796 "/usr/include/c++/4.0.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));
>      }
># 828 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      basic_string&
>      append(size_type __n, _CharT __c);
># 839 "/usr/include/c++/4.0.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);
># 878 "/usr/include/c++/4.0.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)); }
># 894 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s, size_type __n);
># 906 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s)
>      {
> ;
> return this->assign(__s, traits_type::length(__s));
>      }
># 922 "/usr/include/c++/4.0.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); }
># 934 "/usr/include/c++/4.0.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); }
># 951 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      void
>      insert(iterator __p, size_type __n, _CharT __c)
>      { this->replace(__p, __p, __n, __c); }
># 966 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        void
>        insert(iterator __p, _InputIterator __beg, _InputIterator __end)
>        { this->replace(__p, __p, __beg, __end); }
># 982 "/usr/include/c++/4.0.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()); }
># 1004 "/usr/include/c++/4.0.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)); }
># 1027 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s, size_type __n);
># 1045 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s)
>      {
> ;
> return this->insert(__pos, __s, traits_type::length(__s));
>      }
># 1068 "/usr/include/c++/4.0.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); }
># 1085 "/usr/include/c++/4.0.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;
>      }
># 1109 "/usr/include/c++/4.0.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;
>      }
># 1125 "/usr/include/c++/4.0.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;
>      }
># 1145 "/usr/include/c++/4.0.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;
>      }
># 1172 "/usr/include/c++/4.0.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()); }
># 1194 "/usr/include/c++/4.0.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)); }
># 1218 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2);
># 1237 "/usr/include/c++/4.0.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));
>      }
># 1260 "/usr/include/c++/4.0.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); }
># 1278 "/usr/include/c++/4.0.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()); }
># 1296 "/usr/include/c++/4.0.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);
>      }
># 1317 "/usr/include/c++/4.0.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));
>      }
># 1338 "/usr/include/c++/4.0.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);
>      }
># 1360 "/usr/include/c++/4.0.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:
># 1491 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
># 1501 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      void
>      swap(basic_string& __s);
># 1511 "/usr/include/c++/4.0.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; }
># 1543 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find(const _CharT* __s, size_type __pos, size_type __n) const;
># 1556 "/usr/include/c++/4.0.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()); }
># 1570 "/usr/include/c++/4.0.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));
>      }
># 1587 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find(_CharT __c, size_type __pos = 0) const;
># 1600 "/usr/include/c++/4.0.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()); }
># 1615 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      rfind(const _CharT* __s, size_type __pos, size_type __n) const;
># 1628 "/usr/include/c++/4.0.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));
>      }
># 1645 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      rfind(_CharT __c, size_type __pos = npos) const;
># 1658 "/usr/include/c++/4.0.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()); }
># 1673 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1686 "/usr/include/c++/4.0.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));
>      }
># 1705 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(_CharT __c, size_type __pos = 0) const
>      { return this->find(__c, __pos); }
># 1719 "/usr/include/c++/4.0.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()); }
># 1734 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1747 "/usr/include/c++/4.0.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));
>      }
># 1766 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(_CharT __c, size_type __pos = npos) const
>      { return this->rfind(__c, __pos); }
># 1780 "/usr/include/c++/4.0.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()); }
># 1795 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(const _CharT* __s, size_type __pos,
>   size_type __n) const;
># 1809 "/usr/include/c++/4.0.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));
>      }
># 1826 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(_CharT __c, size_type __pos = 0) const;
># 1839 "/usr/include/c++/4.0.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()); }
># 1855 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(const _CharT* __s, size_type __pos,
>         size_type __n) const;
># 1868 "/usr/include/c++/4.0.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));
>      }
># 1885 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(_CharT __c, size_type __pos = npos) const;
># 1900 "/usr/include/c++/4.0.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); }
># 1918 "/usr/include/c++/4.0.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;
>      }
># 1948 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n, const basic_string& __str) const;
># 1972 "/usr/include/c++/4.0.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;
># 1990 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      int
>      compare(const _CharT* __s) const;
># 2013 "/usr/include/c++/4.0.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s) const;
># 2038 "/usr/include/c++/4.0.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()) { }
># 2059 "/usr/include/c++/4.0.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;
>    }
># 2130 "/usr/include/c++/4.0.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; }
># 2167 "/usr/include/c++/4.0.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; }
># 2204 "/usr/include/c++/4.0.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; }
># 2241 "/usr/include/c++/4.0.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; }
># 2278 "/usr/include/c++/4.0.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; }
># 2315 "/usr/include/c++/4.0.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; }
># 2352 "/usr/include/c++/4.0.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); }
># 2369 "/usr/include/c++/4.0.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);
># 2383 "/usr/include/c++/4.0.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);
># 2401 "/usr/include/c++/4.0.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);
># 2418 "/usr/include/c++/4.0.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);
>
>}
># 54 "/usr/include/c++/4.0.2/string" 2 3
>
>
># 1 "/usr/include/c++/4.0.2/algorithm" 1 3
># 63 "/usr/include/c++/4.0.2/algorithm" 3
>       
># 64 "/usr/include/c++/4.0.2/algorithm" 3
>#pragma GCC visibility push(default)
>
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/stl_algo.h" 1 3
># 64 "/usr/include/c++/4.0.2/bits/stl_algo.h" 3
># 1 "/usr/include/c++/4.0.2/bits/stl_heap.h" 1 3
># 65 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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);
>    }
>
>}
># 65 "/usr/include/c++/4.0.2/bits/stl_algo.h" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_tempbuf.h" 1 3
># 66 "/usr/include/c++/4.0.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;
> }
>    }
>}
># 66 "/usr/include/c++/4.0.2/bits/stl_algo.h" 2 3
>
>
>
>
>namespace std
>{
># 84 "/usr/include/c++/4.0.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;
>    }
># 118 "/usr/include/c++/4.0.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;
>    }
># 150 "/usr/include/c++/4.0.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;
> }
>    }
># 304 "/usr/include/c++/4.0.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));
>    }
># 326 "/usr/include/c++/4.0.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));
>    }
># 348 "/usr/include/c++/4.0.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;
>    }
># 379 "/usr/include/c++/4.0.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;
>    }
># 410 "/usr/include/c++/4.0.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;
>    }
># 434 "/usr/include/c++/4.0.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;
>    }
># 473 "/usr/include/c++/4.0.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;
>    }
># 544 "/usr/include/c++/4.0.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;
>    }
># 622 "/usr/include/c++/4.0.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;
>      else
> {
>   __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;
>       else
>  __first = std::find(__i, __last, __val);
>     }
>   return __last;
> }
>    }
># 673 "/usr/include/c++/4.0.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;
>      else
> {
>   while (__first != __last)
>     {
>       if (__binary_pred(*__first, __val))
>  break;
>       ++__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;
>       else
>  {
>    while (__i != __last)
>      {
>        if (__binary_pred(*__i, __val))
>   break;
>        ++__i;
>      }
>    __first = __i;
>  }
>     }
>   return __last;
> }
>    }
># 735 "/usr/include/c++/4.0.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;
>    }
># 773 "/usr/include/c++/4.0.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;
>    }
># 808 "/usr/include/c++/4.0.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;
>    }
># 840 "/usr/include/c++/4.0.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;
>    }
># 871 "/usr/include/c++/4.0.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;
>    }
># 904 "/usr/include/c++/4.0.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)
> *__result = *__first == __old_value ? __new_value : *__first;
>      return __result;
>    }
># 937 "/usr/include/c++/4.0.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)
> *__result = __pred(*__first) ? __new_value : *__first;
>      return __result;
>    }
># 968 "/usr/include/c++/4.0.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();
>    }
># 994 "/usr/include/c++/4.0.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;
>    }
># 1021 "/usr/include/c++/4.0.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;
>    }
># 1057 "/usr/include/c++/4.0.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;
>    }
># 1096 "/usr/include/c++/4.0.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);
>    }
># 1131 "/usr/include/c++/4.0.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);
>    }
># 1157 "/usr/include/c++/4.0.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;
>    }
># 1182 "/usr/include/c++/4.0.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;
>    }
># 1204 "/usr/include/c++/4.0.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;
>    }
># 1236 "/usr/include/c++/4.0.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;
>    }
># 1268 "/usr/include/c++/4.0.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());
>    }
># 1303 "/usr/include/c++/4.0.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());
>    }
># 1337 "/usr/include/c++/4.0.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;
>    }
># 1376 "/usr/include/c++/4.0.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;
>    }
># 1410 "/usr/include/c++/4.0.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;
>   }
>    }
># 1432 "/usr/include/c++/4.0.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;
> }
>    }
># 1459 "/usr/include/c++/4.0.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    inline void
>    reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
>    {
>
>     
>
>      ;
>      std::__reverse(__first, __last, std::__iterator_category(__first));
>    }
># 1485 "/usr/include/c++/4.0.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;
>    }
># 1513 "/usr/include/c++/4.0.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;
> }
>    }
># 1692 "/usr/include/c++/4.0.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());
>    }
># 1725 "/usr/include/c++/4.0.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));
>    }
># 1751 "/usr/include/c++/4.0.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)));
>    }
># 1778 "/usr/include/c++/4.0.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;
> }
>    }
># 1872 "/usr/include/c++/4.0.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;
> }
>    }
># 1983 "/usr/include/c++/4.0.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;
>    }
># 2272 "/usr/include/c++/4.0.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);
>    }
># 2313 "/usr/include/c++/4.0.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);
>    }
># 2355 "/usr/include/c++/4.0.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;
>    }
># 2419 "/usr/include/c++/4.0.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;
> }
>    }
># 2554 "/usr/include/c++/4.0.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);
> }
>    }
># 2588 "/usr/include/c++/4.0.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);
> }
>    }
># 2621 "/usr/include/c++/4.0.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;
>    }
># 2676 "/usr/include/c++/4.0.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;
>    }
># 2723 "/usr/include/c++/4.0.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;
>    }
># 2775 "/usr/include/c++/4.0.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);
>    }
># 2973 "/usr/include/c++/4.0.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));
>    }
># 3031 "/usr/include/c++/4.0.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);
> }
>    }
># 3451 "/usr/include/c++/4.0.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()));
>    }
># 3505 "/usr/include/c++/4.0.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);
>    }
># 3614 "/usr/include/c++/4.0.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()));
>    }
># 3655 "/usr/include/c++/4.0.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);
>    }
># 3696 "/usr/include/c++/4.0.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);
>    }
># 3747 "/usr/include/c++/4.0.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);
>    }
># 3800 "/usr/include/c++/4.0.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);
>    }
># 3862 "/usr/include/c++/4.0.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);
>    }
># 3920 "/usr/include/c++/4.0.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);
>    }
># 3952 "/usr/include/c++/4.0.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);
>    }
># 3990 "/usr/include/c++/4.0.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;
>    }
># 4036 "/usr/include/c++/4.0.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;
>    }
># 4082 "/usr/include/c++/4.0.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));
>    }
># 4144 "/usr/include/c++/4.0.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));
>    }
># 4205 "/usr/include/c++/4.0.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;
>    }
># 4259 "/usr/include/c++/4.0.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;
>    }
># 4313 "/usr/include/c++/4.0.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);
>    }
># 4371 "/usr/include/c++/4.0.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);
>    }
># 4425 "/usr/include/c++/4.0.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));
>    }
># 4486 "/usr/include/c++/4.0.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));
>    }
># 4539 "/usr/include/c++/4.0.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;
>    }
># 4566 "/usr/include/c++/4.0.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;
>    }
># 4618 "/usr/include/c++/4.0.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;
>    }
># 4653 "/usr/include/c++/4.0.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;
>     }
> }
>    }
># 4709 "/usr/include/c++/4.0.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;
>     }
> }
>    }
># 4764 "/usr/include/c++/4.0.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;
>     }
> }
>    }
># 4820 "/usr/include/c++/4.0.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;
>     }
> }
>    }
># 4879 "/usr/include/c++/4.0.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;
>    }
># 4915 "/usr/include/c++/4.0.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;
>    }
># 4945 "/usr/include/c++/4.0.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;
> }
>    }
># 5095 "/usr/include/c++/4.0.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));
>    }
># 5140 "/usr/include/c++/4.0.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);
>    }
>
>}
># 70 "/usr/include/c++/4.0.2/algorithm" 2 3
>
>#pragma GCC visibility pop
># 57 "/usr/include/c++/4.0.2/string" 2 3
># 1 "/usr/include/c++/4.0.2/bits/basic_string.tcc" 1 3
># 46 "/usr/include/c++/4.0.2/bits/basic_string.tcc" 3
>       
># 47 "/usr/include/c++/4.0.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/include/c++/4.0.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;
>      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&);
>
>
>}
># 58 "/usr/include/c++/4.0.2/string" 2 3
>
>
>#pragma GCC visibility pop
># 6 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h" 2
># 1 "/usr/include/c++/4.0.2/deque" 1 3
># 63 "/usr/include/c++/4.0.2/deque" 3
>       
># 64 "/usr/include/c++/4.0.2/deque" 3
>#pragma GCC visibility push(default)
>
>
>
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/stl_deque.h" 1 3
># 68 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>namespace std
>{
># 82 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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 *static_cast<const _Alloc*>(&this->_M_impl); }
>
>      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:
>
>
>
>      struct _Deque_impl
>      : public _Alloc
>      {
> _Tp** _M_map;
> size_t _M_map_size;
> iterator _M_start;
> iterator _M_finish;
>
> _Deque_impl(const _Alloc& __a)
> : _Alloc(__a), _M_map(0), _M_map_size(0), _M_start(), _M_finish()
> { }
>      };
>
>      typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type;
>      _Map_alloc_type _M_get_map_allocator() const
>      { return _Map_alloc_type(this->get_allocator()); }
>
>      _Tp*
>      _M_allocate_node()
>      { return _M_impl._Alloc::allocate(__deque_buf_size(sizeof(_Tp))); }
>
>      void
>      _M_deallocate_node(_Tp* __p)
>      { _M_impl._Alloc::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);
> }
>    }
># 444 "/usr/include/c++/4.0.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);
>    }
># 594 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
>    class deque : protected _Deque_base<_Tp, _Alloc>
>    {
>
>     
>
>      typedef _Deque_base<_Tp, _Alloc> _Base;
>
>    public:
>      typedef _Tp value_type;
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::const_pointer const_pointer;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::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 typename _Base::allocator_type 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_impl;
>
>    public:
>
>
>
>
>
>      explicit
>      deque(const allocator_type& __a = allocator_type())
>      : _Base(__a, 0) {}
># 655 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      deque(size_type __n, const value_type& __value,
>     const allocator_type& __a = allocator_type())
>      : _Base(__a, __n)
>      { _M_fill_initialize(__value); }
># 667 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      explicit
>      deque(size_type __n)
>      : _Base(allocator_type(), __n)
>      { _M_fill_initialize(value_type()); }
># 679 "/usr/include/c++/4.0.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,
>        this->get_allocator()); }
># 699 "/usr/include/c++/4.0.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,
>        this->get_allocator()); }
># 725 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      deque&
>      operator=(const deque& __x);
># 738 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 754 "/usr/include/c++/4.0.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); }
># 859 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      void
>      resize(size_type __new_size, const value_type& __x)
>      {
> 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);
>      }
># 878 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      void
>      resize(size_type new_size)
>      { resize(new_size, value_type()); }
>
>
>
>
>
>      bool
>      empty() const
>      { return this->_M_impl._M_finish == this->_M_impl._M_start; }
># 902 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      reference
>      operator[](size_type __n)
>      { return this->_M_impl._M_start[difference_type(__n)]; }
># 917 "/usr/include/c++/4.0.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:
># 942 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      reference
>      at(size_type __n)
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
># 960 "/usr/include/c++/4.0.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;
>      }
># 1017 "/usr/include/c++/4.0.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);
>      }
># 1038 "/usr/include/c++/4.0.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);
>      }
># 1059 "/usr/include/c++/4.0.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();
>      }
># 1080 "/usr/include/c++/4.0.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();
>      }
># 1102 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      iterator
>      insert(iterator position, const value_type& __x);
># 1114 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 1128 "/usr/include/c++/4.0.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());
> }
># 1151 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      iterator
>      erase(iterator __position);
># 1170 "/usr/include/c++/4.0.2/bits/stl_deque.h" 3
>      iterator
>      erase(iterator __first, iterator __last);
># 1182 "/usr/include/c++/4.0.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());
> }
># 1236 "/usr/include/c++/4.0.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);
># 1260 "/usr/include/c++/4.0.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);
># 1404 "/usr/include/c++/4.0.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);
># 1442 "/usr/include/c++/4.0.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);
>
>    };
># 1474 "/usr/include/c++/4.0.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()); }
># 1492 "/usr/include/c++/4.0.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); }
>}
># 72 "/usr/include/c++/4.0.2/deque" 2 3
>
>
># 1 "/usr/include/c++/4.0.2/bits/deque.tcc" 1 3
># 64 "/usr/include/c++/4.0.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,
>       this->get_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,
>       this->get_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(),
>   this->get_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,
>   this->get_allocator());
>   std::_Destroy(this->_M_impl._M_finish._M_first,
>   this->_M_impl._M_finish._M_cur,
>   this->get_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,
>        this->get_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,
>       this->get_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,
>       this->get_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, this->get_allocator());
>          std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first,
>          this->_M_impl._M_finish._M_cur,
>          __value, this->get_allocator());
>        }
>      catch(...)
>        {
>          std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur),
>   this->get_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,
>       this->get_allocator());
>              __first = __mid;
>            }
>            std::__uninitialized_copy_a(__first, __last,
>     this->_M_impl._M_finish._M_first,
>     this->get_allocator());
>          }
>        catch(...)
>          {
>            std::_Destroy(this->_M_impl._M_start,
>     iterator(*__cur_node, __cur_node),
>     this->get_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,
>         this->get_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,
>         this->get_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,
>           this->get_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,
>       this->get_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,
>           this->get_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,
>       this->get_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,
>      this->get_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,
>         this->get_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,
>           this->get_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,
>       this->get_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);
>    }
>}
># 75 "/usr/include/c++/4.0.2/deque" 2 3
>
>
>
>
>
>
>#pragma GCC visibility pop
># 7 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h" 2
># 1 "/usr/include/c++/4.0.2/ostream" 1 3
># 42 "/usr/include/c++/4.0.2/ostream" 3
>       
># 43 "/usr/include/c++/4.0.2/ostream" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/c++/4.0.2/ios" 1 3
># 42 "/usr/include/c++/4.0.2/ios" 3
>       
># 43 "/usr/include/c++/4.0.2/ios" 3
>#pragma GCC visibility push(default)
>
>
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/localefwd.h" 1 3
># 43 "/usr/include/c++/4.0.2/bits/localefwd.h" 3
>       
># 44 "/usr/include/c++/4.0.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;
>    }
>}
># 50 "/usr/include/c++/4.0.2/ios" 2 3
># 1 "/usr/include/c++/4.0.2/bits/ios_base.h" 1 3
># 43 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/locale_classes.h" 1 3
># 43 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>
>
>
>
>
>
>
>namespace std
>{
># 67 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_classes.h" 3
>    locale() throw();
># 133 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    locale(const locale& __other) throw();
># 143 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    explicit
>    locale(const char* __s);
># 158 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    locale(const locale& __base, const char* __s, category __cat);
># 171 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    locale(const locale& __base, const locale& __add, category __cat);
># 183 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    template<typename _Facet>
>      locale(const locale& __other, _Facet* __f);
>
>
>    ~locale() throw();
># 197 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    const locale&
>    operator=(const locale& __other) throw();
># 212 "/usr/include/c++/4.0.2/bits/locale_classes.h" 3
>    template<typename _Facet>
>      locale
>      combine(const locale& __other) const;
>
>
>
>
>
>
>    string
>    name() const;
># 231 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_classes.h" 3
>    static const size_t _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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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* __cache, size_t __index) throw()
>    {
>      __cache->_M_add_reference();
>      _M_caches[__index] = __cache;
>    }
>  };
>
>  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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/ios_base.h" 3
>    typedef _Ios_Fmtflags fmtflags;
>
>
>    static const fmtflags boolalpha = fmtflags(__ios_flags::_S_boolalpha);
>
>
>    static const fmtflags dec = fmtflags(__ios_flags::_S_dec);
>
>
>    static const fmtflags fixed = fmtflags(__ios_flags::_S_fixed);
>
>
>    static const fmtflags hex = fmtflags(__ios_flags::_S_hex);
>
>
>
>
>    static const fmtflags internal = fmtflags(__ios_flags::_S_internal);
>
>
>
>    static const fmtflags left = fmtflags(__ios_flags::_S_left);
>
>
>    static const fmtflags oct = fmtflags(__ios_flags::_S_oct);
>
>
>
>    static const fmtflags right = fmtflags(__ios_flags::_S_right);
>
>
>    static const fmtflags scientific = fmtflags(__ios_flags::_S_scientific);
>
>
>
>    static const fmtflags showbase = fmtflags(__ios_flags::_S_showbase);
>
>
>
>    static const fmtflags showpoint = fmtflags(__ios_flags::_S_showpoint);
>
>
>    static const fmtflags showpos = fmtflags(__ios_flags::_S_showpos);
>
>
>    static const fmtflags skipws = fmtflags(__ios_flags::_S_skipws);
>
>
>    static const fmtflags unitbuf = fmtflags(__ios_flags::_S_unitbuf);
>
>
>
>    static const fmtflags uppercase = fmtflags(__ios_flags::_S_uppercase);
>
>
>    static const fmtflags adjustfield = fmtflags(__ios_flags::_S_adjustfield);
>
>
>    static const fmtflags basefield = fmtflags(__ios_flags::_S_basefield);
>
>
>    static const fmtflags floatfield = fmtflags(__ios_flags::_S_floatfield);
># 328 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    typedef _Ios_Iostate iostate;
>
>
>
>    static const iostate badbit = iostate(__ios_flags::_S_badbit);
>
>
>    static const iostate eofbit = iostate(__ios_flags::_S_eofbit);
>
>
>
>
>    static const iostate failbit = iostate(__ios_flags::_S_failbit);
>
>
>    static const iostate goodbit = iostate(0);
># 359 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    typedef _Ios_Openmode openmode;
>
>
>    static const openmode app = openmode(__ios_flags::_S_app);
>
>
>    static const openmode ate = openmode(__ios_flags::_S_ate);
>
>
>
>
>
>    static const openmode binary = openmode(__ios_flags::_S_bin);
>
>
>    static const openmode in = openmode(__ios_flags::_S_in);
>
>
>    static const openmode out = openmode(__ios_flags::_S_out);
>
>
>    static const openmode trunc = openmode(__ios_flags::_S_trunc);
># 392 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    typedef _Ios_Seekdir seekdir;
>
>
>    static const seekdir beg = seekdir(0);
>
>
>    static const seekdir cur = seekdir(1);
>
>
>    static const seekdir end = seekdir(2);
>
>
>    typedef int io_state;
>    typedef int open_mode;
>    typedef int seek_dir;
>
>    typedef std::streampos streampos;
>    typedef std::streamoff streamoff;
># 418 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    enum event
>    {
>      erase_event,
>      imbue_event,
>      copyfmt_event
>    };
># 435 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    typedef void (*event_callback) (event, ios_base&, int);
># 447 "/usr/include/c++/4.0.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;
>
>
>
>    static const int _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/include/c++/4.0.2/bits/ios_base.h" 3
>    inline fmtflags
>    flags(fmtflags __fmtfl)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags = __fmtfl;
>      return __old;
>    }
># 573 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    inline fmtflags
>    setf(fmtflags __fmtfl)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags |= __fmtfl;
>      return __old;
>    }
># 590 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/ios_base.h" 3
>    static bool
>    sync_with_stdio(bool __sync = true);
># 678 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    locale
>    imbue(const locale& __loc);
># 689 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    inline locale
>    getloc() const { return _M_ios_locale; }
># 699 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    inline const locale&
>    _M_getloc() const { return _M_ios_locale; }
># 717 "/usr/include/c++/4.0.2/bits/ios_base.h" 3
>    static int
>    xalloc() throw();
># 733 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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;
>  }
>}
># 51 "/usr/include/c++/4.0.2/ios" 2 3
># 1 "/usr/include/c++/4.0.2/streambuf" 1 3
># 42 "/usr/include/c++/4.0.2/streambuf" 3
>       
># 43 "/usr/include/c++/4.0.2/streambuf" 3
>#pragma GCC visibility push(default)
>
>
>
>
>
>
>namespace std
>{
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin,
>        basic_streambuf<_CharT, _Traits>* __sbout);
># 122 "/usr/include/c++/4.0.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;
># 145 "/usr/include/c++/4.0.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, typename _Alloc>
>        friend basic_istream<_CharT2, _Traits2>&
>        getline(basic_istream<_CharT2, _Traits2>&,
>  basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2);
>
>    protected:
># 174 "/usr/include/c++/4.0.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()
>      { }
># 202 "/usr/include/c++/4.0.2/streambuf" 3
>      locale
>      pubimbue(const locale &__loc)
>      {
> locale __tmp(this->getloc());
> this->imbue(__loc);
> _M_buf_locale = __loc;
> return __tmp;
>      }
># 219 "/usr/include/c++/4.0.2/streambuf" 3
>      locale
>      getloc() const
>      { return _M_buf_locale; }
># 232 "/usr/include/c++/4.0.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(); }
># 259 "/usr/include/c++/4.0.2/streambuf" 3
>      streamsize
>      in_avail()
>      {
> const streamsize __ret = this->egptr() - this->gptr();
> return __ret ? __ret : this->showmanyc();
>      }
># 273 "/usr/include/c++/4.0.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;
>      }
># 291 "/usr/include/c++/4.0.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;
>      }
># 313 "/usr/include/c++/4.0.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;
>      }
># 332 "/usr/include/c++/4.0.2/streambuf" 3
>      streamsize
>      sgetn(char_type* __s, streamsize __n)
>      { return this->xsgetn(__s, __n); }
># 346 "/usr/include/c++/4.0.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;
>      }
># 371 "/usr/include/c++/4.0.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;
>      }
># 398 "/usr/include/c++/4.0.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;
>      }
># 424 "/usr/include/c++/4.0.2/streambuf" 3
>      streamsize
>      sputn(const char_type* __s, streamsize __n)
>      { return this->xsputn(__s, __n); }
>
>    protected:
># 438 "/usr/include/c++/4.0.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())
>      { }
># 456 "/usr/include/c++/4.0.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; }
># 472 "/usr/include/c++/4.0.2/streambuf" 3
>      void
>      gbump(int __n) { _M_in_cur += __n; }
># 483 "/usr/include/c++/4.0.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;
>      }
># 503 "/usr/include/c++/4.0.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; }
># 519 "/usr/include/c++/4.0.2/streambuf" 3
>      void
>      pbump(int __n) { _M_out_cur += __n; }
># 529 "/usr/include/c++/4.0.2/streambuf" 3
>      void
>      setp(char_type* __pbeg, char_type* __pend)
>      {
> _M_out_beg = _M_out_cur = __pbeg;
> _M_out_end = __pend;
>      }
># 550 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual void
>      imbue(const locale&)
>      { }
># 565 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual basic_streambuf<char_type,_Traits>*
>      setbuf(char_type*, streamsize)
>      { return this; }
># 576 "/usr/include/c++/4.0.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)); }
># 588 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual pos_type
>      seekpos(pos_type,
>       ios_base::openmode = ios_base::in | ios_base::out)
>      { return pos_type(off_type(-1)); }
># 601 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual int
>      sync() { return 0; }
># 623 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual streamsize
>      showmanyc() { return 0; }
># 639 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual streamsize
>      xsgetn(char_type* __s, streamsize __n);
># 661 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual int_type
>      underflow()
>      { return traits_type::eof(); }
># 674 "/usr/include/c++/4.0.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;
>      }
># 698 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual int_type
>      pbackfail(int_type = traits_type::eof())
>      { return traits_type::eof(); }
># 716 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual streamsize
>      xsputn(const char_type* __s, streamsize __n);
># 741 "/usr/include/c++/4.0.2/streambuf" 3
>      virtual int_type
>      overflow(int_type = traits_type::eof())
>      { return traits_type::eof(); }
># 770 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/streambuf.tcc" 1 3
># 43 "/usr/include/c++/4.0.2/bits/streambuf.tcc" 3
>       
># 44 "/usr/include/c++/4.0.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 size_t __buf_len = this->egptr() - this->gptr();
>   if (__buf_len)
>     {
>       const size_t __remaining = __n - __ret;
>       const size_t __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 size_t __buf_len = this->epptr() - this->pptr();
>   if (__buf_len)
>     {
>       const size_t __remaining = __n - __ret;
>       const size_t __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>*);
>
>
>}
># 799 "/usr/include/c++/4.0.2/streambuf" 2 3
>
>
>#pragma GCC visibility pop
># 52 "/usr/include/c++/4.0.2/ios" 2 3
># 1 "/usr/include/c++/4.0.2/bits/basic_ios.h" 1 3
># 39 "/usr/include/c++/4.0.2/bits/basic_ios.h" 3
>       
># 40 "/usr/include/c++/4.0.2/bits/basic_ios.h" 3
>
># 1 "/usr/include/c++/4.0.2/bits/streambuf_iterator.h" 1 3
># 39 "/usr/include/c++/4.0.2/bits/streambuf_iterator.h" 3
>       
># 40 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 2 3
>
>
># 1 "/usr/include/c++/4.0.2/bits/locale_facets.h" 1 3
># 43 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>
>
># 1 "/usr/include/c++/4.0.2/cwctype" 1 3
># 47 "/usr/include/c++/4.0.2/cwctype" 3
>       
># 48 "/usr/include/c++/4.0.2/cwctype" 3
>#pragma GCC visibility push(default)
>
>
>
>
># 1 "/usr/include/wctype.h" 1 3 4
># 35 "/usr/include/wctype.h" 3 4
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stddef.h" 1 3 4
># 36 "/usr/include/wctype.h" 2 3 4
># 45 "/usr/include/wctype.h" 3 4
>
>
>
># 64 "/usr/include/wctype.h" 3 4
>
>
>
>typedef unsigned long int wctype_t;
>
># 86 "/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 ();
># 186 "/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 ();
>
>
>}
># 228 "/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/include/c++/4.0.2/cwctype" 2 3
># 80 "/usr/include/c++/4.0.2/cwctype" 3
>namespace std
>{
>  using ::wint_t;
>
>  using ::wctype_t;
>  using ::wctrans_t;
>
>  using ::iswalnum;
>  using ::iswalpha;
>
>  using ::iswblank;
>
>  using ::iswcntrl;
>  using ::iswdigit;
>  using ::iswgraph;
>  using ::iswlower;
>  using ::iswprint;
>  using ::iswprint;
>  using ::iswpunct;
>  using ::iswspace;
>  using ::iswupper;
>  using ::iswxdigit;
>  using ::iswctype;
>  using ::towlower;
>  using ::towupper;
>  using ::towctrans;
>  using ::wctrans;
>  using ::wctype;
>}
>
>
>#pragma GCC visibility pop
># 47 "/usr/include/c++/4.0.2/bits/locale_facets.h" 2 3
>
>
>
>
>namespace std
>{
># 63 "/usr/include/c++/4.0.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/include/c++/4.0.2/i586-suse-linux/bits/ctype_base.h" 1 3
># 43 "/usr/include/c++/4.0.2/i586-suse-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/include/c++/4.0.2/bits/locale_facets.h" 2 3
># 144 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      bool
>      is(mask __m, char_type __c) const
>      { return this->do_is(__m, __c); }
># 179 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      toupper(char_type __c) const
>      { return this->do_toupper(__c); }
># 240 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      tolower(char_type __c) const
>      { return this->do_tolower(__c); }
># 269 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      widen(char __c) const
>      { return this->do_widen(__c); }
># 305 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      char
>      narrow(char_type __c, char __dfault) const
>      { return this->do_narrow(__c, __dfault); }
># 346 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual bool
>      do_is(mask __m, char_type __c) const = 0;
># 390 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const = 0;
># 463 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const = 0;
># 479 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const = 0;
># 496 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const = 0;
># 515 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char) const = 0;
># 536 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi,
>        char_type* __dest) const = 0;
># 558 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type, char __dfault) const = 0;
># 582 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);
># 724 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false,
>     size_t __refs = 0);
># 737 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      inline bool
>      is(mask __m, char __c) const;
># 752 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      inline const char*
>      is(const char* __lo, const char* __hi, mask* __vec) const;
># 766 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      inline const char*
>      scan_is(mask __m, const char* __lo, const char* __hi) const;
># 780 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      inline const char*
>      scan_not(mask __m, const char* __lo, const char* __hi) const;
># 795 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      toupper(char_type __c) const
>      { return this->do_toupper(__c); }
># 812 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      tolower(char_type __c) const
>      { return this->do_tolower(__c); }
># 845 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const;
># 1020 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
># 1036 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const;
># 1053 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
># 1073 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char __c) const
>      { return __c; }
># 1096 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type __c, char) const
>      { return __c; }
># 1148 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      ctype(size_t __refs = 0);
># 1256 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual bool
>      do_is(mask __m, char_type __c) const;
># 1299 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const;
># 1369 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
># 1385 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const;
># 1402 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
># 1422 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char) const;
># 1444 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi, char_type* __dest) const;
># 1467 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type, char __dfault) const;
># 1493 "/usr/include/c++/4.0.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/include/c++/4.0.2/i586-suse-linux/bits/ctype_inline.h" 1 3
># 37 "/usr/include/c++/4.0.2/i586-suse-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/include/c++/4.0.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/include/c++/4.0.2/bits/codecvt.h" 1 3
># 45 "/usr/include/c++/4.0.2/bits/codecvt.h" 3
>       
># 46 "/usr/include/c++/4.0.2/bits/codecvt.h" 3
>
>
>  class codecvt_base
>  {
>  public:
>    enum result
>    {
>      ok,
>      partial,
>      error,
>      noconv
>    };
>  };
># 69 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      decimal_point() const
>      { return this->do_decimal_point(); }
># 1734 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      thousands_sep() const
>      { return this->do_thousands_sep(); }
># 1765 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string
>      grouping() const
>      { return this->do_grouping(); }
># 1778 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string_type
>      truename() const
>      { return this->do_truename(); }
># 1791 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string_type
>      falsename() const
>      { return this->do_falsename(); }
>
>    protected:
>
>      virtual
>      ~numpunct();
># 1808 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_decimal_point() const
>      { return _M_data->_M_decimal_point; }
># 1820 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_thousands_sep() const
>      { return _M_data->_M_thousands_sep; }
># 1833 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string
>      do_grouping() const
>      { return _M_data->_M_grouping; }
># 1846 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_truename() const
>      { return _M_data->_M_truename; }
># 1859 "/usr/include/c++/4.0.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() { }
>    };
># 1925 "/usr/include/c++/4.0.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;
># 1946 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      num_get(size_t __refs = 0) : facet(__refs) { }
># 1972 "/usr/include/c++/4.0.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); }
># 2008 "/usr/include/c++/4.0.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); }
># 2067 "/usr/include/c++/4.0.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); }
># 2109 "/usr/include/c++/4.0.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;
># 2142 "/usr/include/c++/4.0.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;
>
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id num_get<_CharT, _InIter>::id;
># 2204 "/usr/include/c++/4.0.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;
># 2225 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      num_put(size_t __refs = 0) : facet(__refs) { }
># 2243 "/usr/include/c++/4.0.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); }
># 2285 "/usr/include/c++/4.0.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); }
># 2348 "/usr/include/c++/4.0.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); }
># 2373 "/usr/include/c++/4.0.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() { };
># 2421 "/usr/include/c++/4.0.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;
># 2465 "/usr/include/c++/4.0.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;
># 2492 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      collate(size_t __refs = 0)
>      : facet(__refs), _M_c_locale_collate(_S_get_c_locale())
>      { }
># 2506 "/usr/include/c++/4.0.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))
>      { }
># 2523 "/usr/include/c++/4.0.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); }
># 2542 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string_type
>      transform(const _CharT* __lo, const _CharT* __hi) const
>      { return this->do_transform(__lo, __hi); }
># 2556 "/usr/include/c++/4.0.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); }
># 2585 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual int
>      do_compare(const _CharT* __lo1, const _CharT* __hi1,
>   const _CharT* __lo2, const _CharT* __hi2) const;
># 2601 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_transform(const _CharT* __lo, const _CharT* __hi) const;
># 2614 "/usr/include/c++/4.0.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() { }
>    };
># 2674 "/usr/include/c++/4.0.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);
># 2832 "/usr/include/c++/4.0.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/include/c++/4.0.2/i586-suse-linux/bits/time_members.h" 1 3
># 37 "/usr/include/c++/4.0.2/i586-suse-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(__s)
>    {
>      char* __tmp = new char[std::strlen(__s) + 1];
>      std::strcpy(__tmp, __s);
>      _M_name_timepunct = __tmp;
>      _M_initialize_timepunct(__cloc);
>    }
>
>  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);
>    }
># 2968 "/usr/include/c++/4.0.2/bits/locale_facets.h" 2 3
># 2981 "/usr/include/c++/4.0.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;
># 3003 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      time_get(size_t __refs = 0)
>      : facet (__refs) { }
># 3020 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      dateorder
>      date_order() const
>      { return this->do_date_order(); }
># 3044 "/usr/include/c++/4.0.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); }
># 3069 "/usr/include/c++/4.0.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); }
># 3097 "/usr/include/c++/4.0.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); }
># 3126 "/usr/include/c++/4.0.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); }
># 3152 "/usr/include/c++/4.0.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() { }
># 3172 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual dateorder
>      do_date_order() const;
># 3190 "/usr/include/c++/4.0.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;
># 3209 "/usr/include/c++/4.0.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;
># 3228 "/usr/include/c++/4.0.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;
># 3247 "/usr/include/c++/4.0.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;
># 3266 "/usr/include/c++/4.0.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() { }
>    };
># 3322 "/usr/include/c++/4.0.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;
># 3343 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      time_put(size_t __refs = 0)
>      : facet(__refs) { }
># 3362 "/usr/include/c++/4.0.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;
># 3382 "/usr/include/c++/4.0.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()
>      { }
># 3409 "/usr/include/c++/4.0.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() { }
>    };
># 3447 "/usr/include/c++/4.0.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;
># 3568 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(size_t __refs = 0) : facet(__refs), _M_data(__null)
>      { _M_initialize_moneypunct(); }
># 3580 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(__cache_type* __cache, size_t __refs = 0)
>      : facet(__refs), _M_data(__cache)
>      { _M_initialize_moneypunct(); }
># 3595 "/usr/include/c++/4.0.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); }
># 3609 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      decimal_point() const
>      { return this->do_decimal_point(); }
># 3622 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      char_type
>      thousands_sep() const
>      { return this->do_thousands_sep(); }
># 3651 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string
>      grouping() const
>      { return this->do_grouping(); }
># 3664 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string_type
>      curr_symbol() const
>      { return this->do_curr_symbol(); }
># 3681 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string_type
>      positive_sign() const
>      { return this->do_positive_sign(); }
># 3698 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      string_type
>      negative_sign() const
>      { return this->do_negative_sign(); }
># 3714 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      int
>      frac_digits() const
>      { return this->do_frac_digits(); }
># 3749 "/usr/include/c++/4.0.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();
># 3771 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_decimal_point() const
>      { return _M_data->_M_decimal_point; }
># 3783 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_thousands_sep() const
>      { return _M_data->_M_thousands_sep; }
># 3796 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string
>      do_grouping() const
>      { return _M_data->_M_grouping; }
># 3809 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_curr_symbol() const
>      { return _M_data->_M_curr_symbol; }
># 3822 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_positive_sign() const
>      { return _M_data->_M_positive_sign; }
># 3835 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_negative_sign() const
>      { return _M_data->_M_negative_sign; }
># 3849 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual int
>      do_frac_digits() const
>      { return _M_data->_M_frac_digits; }
># 3863 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual pattern
>      do_pos_format() const
>      { return _M_data->_M_pos_format; }
># 3877 "/usr/include/c++/4.0.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;
># 3968 "/usr/include/c++/4.0.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;
># 3990 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      money_get(size_t __refs = 0) : facet(__refs) { }
># 4020 "/usr/include/c++/4.0.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); }
># 4050 "/usr/include/c++/4.0.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() { }
># 4067 "/usr/include/c++/4.0.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;
># 4078 "/usr/include/c++/4.0.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;
>
>      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;
># 4103 "/usr/include/c++/4.0.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;
># 4124 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      money_put(size_t __refs = 0) : facet(__refs) { }
># 4144 "/usr/include/c++/4.0.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); }
># 4166 "/usr/include/c++/4.0.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() { }
># 4194 "/usr/include/c++/4.0.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;
># 4216 "/usr/include/c++/4.0.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;
>
>      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;
>  };
># 4257 "/usr/include/c++/4.0.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;
># 4285 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      messages(size_t __refs = 0);
># 4299 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      explicit
>      messages(__c_locale __cloc, const char* __s, size_t __refs = 0);
># 4312 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      catalog
>      open(const basic_string<char>& __s, const locale& __loc) const
>      { return this->do_open(__s, __loc); }
># 4330 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      catalog
>      open(const basic_string<char>&, const locale&, const char*) const;
># 4348 "/usr/include/c++/4.0.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); }
># 4359 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      void
>      close(catalog __c) const
>      { return this->do_close(__c); }
>
>    protected:
>
>      virtual
>      ~messages();
># 4379 "/usr/include/c++/4.0.2/bits/locale_facets.h" 3
>      virtual catalog
>      do_open(const basic_string<char>&, const locale&) const;
># 4398 "/usr/include/c++/4.0.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
>      {
># 4455 "/usr/include/c++/4.0.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/include/c++/4.0.2/i586-suse-linux/bits/messages_members.h" 1 3
># 37 "/usr/include/c++/4.0.2/i586-suse-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(_S_clone_c_locale(__cloc)),
>     _M_name_messages(__s)
>     {
>       char* __tmp = new char[std::strlen(__s) + 1];
>       std::strcpy(__tmp, __s);
>       _M_name_messages = __tmp;
>     }
>
>  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);
>  }
>     }
># 4492 "/usr/include/c++/4.0.2/bits/locale_facets.h" 2 3
># 4500 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 3
>      iostate
>      rdstate() const
>      { return _M_streambuf_state; }
># 133 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 3
>      iostate
>      exceptions() const
>      { return _M_exception; }
># 242 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 3
>      basic_ostream<_CharT, _Traits>*
>      tie() const
>      { return _M_tie; }
># 292 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 3
>      basic_streambuf<_CharT, _Traits>*
>      rdbuf(basic_streambuf<_CharT, _Traits>* __sb);
># 346 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 3
>      char_type
>      fill(char_type __ch)
>      {
> char_type __old = this->fill();
> _M_fill = __ch;
> return __old;
>      }
># 395 "/usr/include/c++/4.0.2/bits/basic_ios.h" 3
>      locale
>      imbue(const locale& __loc);
># 415 "/usr/include/c++/4.0.2/bits/basic_ios.h" 3
>      char
>      narrow(char_type __c, char __dfault) const;
># 433 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.tcc" 1 3
># 38 "/usr/include/c++/4.0.2/bits/basic_ios.tcc" 3
>       
># 39 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.2/bits/basic_ios.h" 2 3
># 53 "/usr/include/c++/4.0.2/ios" 2 3
>
>#pragma GCC visibility pop
># 46 "/usr/include/c++/4.0.2/ostream" 2 3
>
>namespace std
>{
># 57 "/usr/include/c++/4.0.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*);
># 104 "/usr/include/c++/4.0.2/ostream" 3
>      explicit
>      basic_ostream(__streambuf_type* __sb)
>      { this->init(__sb); }
>
>
>
>
>
>
>      virtual
>      ~basic_ostream() { }
>
>
>      class sentry;
>      friend class sentry;
># 130 "/usr/include/c++/4.0.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&));
># 167 "/usr/include/c++/4.0.2/ostream" 3
>      __ostream_type&
>      operator<<(long __n);
>
>      __ostream_type&
>      operator<<(unsigned long __n);
>
>      __ostream_type&
>      operator<<(bool __n);
>
>      __ostream_type&
>      operator<<(short __n)
>      {
> ios_base::fmtflags __fmt = this->flags() & ios_base::basefield;
> if (__fmt & ios_base::oct || __fmt & ios_base::hex)
>   return this->operator<<(static_cast<unsigned long>
>      (static_cast<unsigned short>(__n)));
> else
>   return this->operator<<(static_cast<long>(__n));
>      }
>
>      __ostream_type&
>      operator<<(unsigned short __n)
>      { return this->operator<<(static_cast<unsigned long>(__n)); }
>
>      __ostream_type&
>      operator<<(int __n)
>      {
> ios_base::fmtflags __fmt = this->flags() & ios_base::basefield;
> if (__fmt & ios_base::oct || __fmt & ios_base::hex)
>   return this->operator<<(static_cast<unsigned long>
>      (static_cast<unsigned int>(__n)));
> else
>   return this->operator<<(static_cast<long>(__n));
>      }
>
>      __ostream_type&
>      operator<<(unsigned int __n)
>      { return this->operator<<(static_cast<unsigned long>(__n)); }
>
>
>      __ostream_type&
>      operator<<(long long __n);
>
>      __ostream_type&
>      operator<<(unsigned long long __n);
>
>
>      __ostream_type&
>      operator<<(double __f);
>
>      __ostream_type&
>      operator<<(float __f)
>      { return this->operator<<(static_cast<double>(__f)); }
>
>      __ostream_type&
>      operator<<(long double __f);
>
>      __ostream_type&
>      operator<<(const void* __p);
># 248 "/usr/include/c++/4.0.2/ostream" 3
>      __ostream_type&
>      operator<<(__streambuf_type* __sb);
># 281 "/usr/include/c++/4.0.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);
>      }
># 309 "/usr/include/c++/4.0.2/ostream" 3
>      __ostream_type&
>      write(const char_type* __s, streamsize __n);
># 322 "/usr/include/c++/4.0.2/ostream" 3
>      __ostream_type&
>      flush();
># 333 "/usr/include/c++/4.0.2/ostream" 3
>      pos_type
>      tellp();
># 344 "/usr/include/c++/4.0.2/ostream" 3
>      __ostream_type&
>      seekp(pos_type);
># 356 "/usr/include/c++/4.0.2/ostream" 3
>       __ostream_type&
>      seekp(off_type, ios_base::seekdir);
>
>    protected:
>      explicit
>      basic_ostream() { }
>    };
># 374 "/usr/include/c++/4.0.2/ostream" 3
>  template <typename _CharT, typename _Traits>
>    class basic_ostream<_CharT, _Traits>::sentry
>    {
>
>      bool _M_ok;
>      basic_ostream<_CharT,_Traits>& _M_os;
>
>    public:
># 393 "/usr/include/c++/4.0.2/ostream" 3
>      explicit
>      sentry(basic_ostream<_CharT,_Traits>& __os);
># 403 "/usr/include/c++/4.0.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);
>   }
>      }
># 421 "/usr/include/c++/4.0.2/ostream" 3
>      operator bool() const
>      { return _M_ok; }
>    };
># 442 "/usr/include/c++/4.0.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)); }
># 482 "/usr/include/c++/4.0.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)); }
># 516 "/usr/include/c++/4.0.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/include/c++/4.0.2/bits/ostream.tcc" 1 3
># 43 "/usr/include/c++/4.0.2/bits/ostream.tcc" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/ostream.tcc" 3
>
># 1 "/usr/include/c++/4.0.2/locale" 1 3
># 42 "/usr/include/c++/4.0.2/locale" 3
>       
># 43 "/usr/include/c++/4.0.2/locale" 3
>#pragma GCC visibility push(default)
>
>
>
>
># 1 "/usr/include/c++/4.0.2/bits/locale_facets.tcc" 1 3
># 39 "/usr/include/c++/4.0.2/bits/locale_facets.tcc" 3
>       
># 40 "/usr/include/c++/4.0.2/bits/locale_facets.tcc" 3
>
>
># 1 "/usr/include/c++/4.0.2/typeinfo" 1 3
># 40 "/usr/include/c++/4.0.2/typeinfo" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace __cxxabiv1
>{
>  class __class_type_info;
>}
># 59 "/usr/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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/include/c++/4.0.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 && __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 && __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);
>    }
># 269 "/usr/include/c++/4.0.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;
>      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;
>  }
>       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);
>      int __sep_pos = 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 (!__found_dec && !__found_sci)
>  {
>
>
>    if (__sep_pos)
>      {
>        __found_grouping += static_cast<char>(__sep_pos);
>        __sep_pos = 0;
>      }
>    else
>      {
>        __err |= ios_base::failbit;
>        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_mantissa && !__found_sci)
>     {
>
>       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;
> 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;
>     else if (__found_zero)
>       {
>  if (__c == __lit[__num_base::_S_ix]
>      || __c == __lit[__num_base::_S_iX])
>    {
>      if (__basefield == 0)
>        __base = 16;
>      if (__base == 16)
>        __found_zero = false;
>      else
>        break;
>    }
>  else
>    {
>      if (__basefield == 0)
>        __base = 8;
>      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);
> int __sep_pos = 0;
> bool __overflow = 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
>    {
>      __err |= ios_base::failbit;
>      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)
>    __overflow = true;
>  else
>    {
>      __result *= __base;
>      __overflow |= __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 (!(__err & ios_base::failbit) && !__overflow
>     && (__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;
>    }
>
>  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 = static_cast<unsigned long>(__v);
>      if (__v < 0)
> __ul = -__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 = static_cast<unsigned long long>(__v);
>      if (__v < 0)
> __ull = -__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 (__basefield == ios_base::oct)
>   {
>
>     if (__flags & ios_base::showbase && __v)
>       *--__cs = __lit[__num_base::_S_odigits], ++__len;
>   }
> else
>   {
>
>     if (__flags & ios_base::showbase && __v)
>       {
>
>  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;
>    }
># 1034 "/usr/include/c++/4.0.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);
>   }
># 1098 "/usr/include/c++/4.0.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& __b, char_type __fill, long long __v) const
>    { return _M_insert_int(__s, __b, __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); }
>
>  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))
>    __testvalid = false;
>       }
>
>
>     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;
>      }
>
>  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;
>      }
>
>  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);
>    }
># 2398 "/usr/include/c++/4.0.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];
>
>
>    __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)
> {
>   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&);
>
>
>}
># 49 "/usr/include/c++/4.0.2/locale" 2 3
>
>#pragma GCC visibility pop
># 46 "/usr/include/c++/4.0.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<<(long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       bool __b = false;
>       const char_type __c = this->fill();
>       const ios_base::fmtflags __fmt = (this->flags()
>      & ios_base::basefield);
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if ((__fmt & ios_base::oct) || (__fmt & ios_base::hex))
>  {
>    const unsigned long __l = static_cast<unsigned long>(__n);
>    __b = __np.put(*this, *this, __c, __l).failed();
>  }
>       else
>  __b = __np.put(*this, *this, __c, __n).failed();
>       if (__b)
>  __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
>     {
>       bool __b = false;
>       const char_type __c = this->fill();
>       const ios_base::fmtflags __fmt = (this->flags()
>      & ios_base::basefield);
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if ((__fmt & ios_base::oct) || (__fmt & ios_base::hex))
>  {
>    const unsigned long long __l = (static_cast<
>        unsigned long long>(__n));
>    __b = __np.put(*this, *this, __c, __l).failed();
>  }
>       else
>  __b = __np.put(*this, *this, __c, __n).failed();
>       if (__b)
>  __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<<(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*);
>
>
>}
># 546 "/usr/include/c++/4.0.2/ostream" 2 3
>
>
>#pragma GCC visibility pop
># 8 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h" 2
>
>using std::string;
>using std::deque;
># 81 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
>namespace storage
>{
>    enum FsType { FSUNKNOWN, REISERFS, EXT2, EXT3, VFAT, XFS, JFS, HFS, NTFS, SWAP, FSNONE };
>
>    enum PartitionType { PRIMARY, EXTENDED, LOGICAL, PTYPE_ANY };
>
>    enum MountByType { MOUNTBY_DEVICE, MOUNTBY_UUID, MOUNTBY_LABEL };
>
>    enum EncryptType { ENC_NONE, ENC_TWOFISH, ENC_TWOFISH_OLD,
>                       ENC_TWOFISH256_OLD, ENC_UNKNOWN };
>
>    enum MdType { RAID_UNK, RAID0, RAID1, RAID5, RAID6, RAID10, MULTIPATH };
>
>    enum MdParity { PAR_NONE, LEFT_ASYMMETRIC, LEFT_SYMMETRIC,
>      RIGHT_ASYMMETRIC, RIGHT_SYMMETRIC };
>
>    enum UsedByType { UB_NONE, UB_LVM, UB_MD, UB_EVMS, UB_DM };
>
>    enum CType { CUNKNOWN, DISK, MD, LOOP, LVM, DM, EVMS };
>
>
>
>
>
>    typedef void (*CallbackProgressBar)( const string& id, unsigned cur, unsigned max );
>
>
>
>
>
>    typedef void (*CallbackShowInstallInfo)( const string& id );
>
>
>
>
>
>    typedef void (*CallbackInfoPopup)( const string& text );
>
>
>
>
>
>
>
>    typedef bool (*CallbackYesNoPopup)( const string& text );
>
>
>
>
>
>    struct FsCapabilities
>    {
> FsCapabilities () {}
> bool isExtendable;
> bool isExtendableWhileMounted;
> bool isReduceable;
> bool isReduceableWhileMounted;
> bool supportsUuid;
> bool supportsLabel;
> bool labelWhileMounted;
> unsigned int labelLength;
> unsigned long long minimalFsSizeK;
>    };
>
>
>
>
>    struct ContainerInfo
> {
> ContainerInfo() {};
> CType type;
> unsigned volcnt;
> string device;
> string name;
> UsedByType usedBy;
> string usedByName;
> bool readonly;
> };
>
>
>
>
>    struct DiskInfo
> {
> DiskInfo() {};
> unsigned long long sizeK;
> unsigned long long cylSizeB;
> unsigned long cyl;
> unsigned long heads;
> unsigned long sectors;
> string disklabel;
> unsigned maxLogical;
> unsigned maxPrimary;
> };
>
>
>
>
>    struct LvmVgInfo
> {
> LvmVgInfo() {};
> unsigned long long sizeK;
> unsigned long long peSize;
> unsigned long peCount;
> unsigned long peFree;
> string uuid;
> bool lvm2;
> bool create;
> string devices;
> string devices_add;
> string devices_rem;
> };
>
>
>
>
>
>    struct EvmsCoInfo
> {
> EvmsCoInfo() {};
> unsigned long long sizeK;
> unsigned long long peSize;
> unsigned long peCount;
> unsigned long peFree;
> string uuid;
> bool lvm2;
> bool create;
> bool realContainer;
> string devices;
> string devices_add;
> string devices_rem;
> };
>
>
>
>
>    struct VolumeInfo
> {
> VolumeInfo() {};
> unsigned long long sizeK;
> unsigned long major;
> unsigned long minor;
> string name;
> string device;
> string mount;
> MountByType mount_by;
> UsedByType usedBy;
> string usedByName;
> string fstab_options;
> string uuid;
> string label;
> string mkfs_options;
> string loop;
> EncryptType encryption;
> string crypt_pwd;
> FsType fs;
> bool format;
> bool create;
> bool is_mounted;
> bool resize;
> unsigned long long OrigSizeK;
> };
>
>
>
>
>    struct PartitionInfo
> {
> PartitionInfo() {};
> VolumeInfo v;
> unsigned nr;
> unsigned long cylStart;
> unsigned long cylSize;
> PartitionType partitionType;
> unsigned id;
> bool boot;
> };
>
>
>
>
>    struct LvmLvInfo
> {
> LvmLvInfo() {};
> VolumeInfo v;
> unsigned stripe;
> unsigned stripe_size;
> string uuid;
> string status;
> string allocation;
> string dm_table;
> string dm_target;
> };
>
>
>
>
>    struct EvmsInfo
> {
> EvmsInfo() {};
> VolumeInfo v;
> unsigned stripe;
> unsigned stripe_size;
> bool compatible;
> string dm_table;
> string dm_target;
> };
>
>
>
>
>
>    struct MdInfo
> {
> MdInfo() {};
> VolumeInfo v;
> unsigned nr;
> unsigned type;
> unsigned parity;
> string uuid;
> unsigned long chunk;
> string devices;
> };
>
>
>
>
>    struct LoopInfo
> {
> LoopInfo() {};
> VolumeInfo v;
> unsigned nr;
> string file;
> };
>
>
>
>
>    struct DmInfo
> {
> DmInfo() {};
> VolumeInfo v;
> unsigned nr;
> string table;
> string target;
> };
>
>
>
>
>    enum ErrorCodes
>    {
> DISK_PARTITION_OVERLAPS_EXISTING = -1000,
> DISK_PARTITION_EXCEEDS_DISK = -1001,
> DISK_CREATE_PARTITION_EXT_ONLY_ONCE = -1002,
> DISK_CREATE_PARTITION_EXT_IMPOSSIBLE = -1003,
> DISK_PARTITION_NO_FREE_NUMBER = -1004,
> DISK_CREATE_PARTITION_INVALID_VOLUME = -1005,
> DISK_CREATE_PARTITION_INVALID_TYPE = -1006,
> DISK_CREATE_PARTITION_PARTED_FAILED = -1007,
> DISK_PARTITION_NOT_FOUND = -1008,
> DISK_CREATE_PARTITION_LOGICAL_NO_EXT = -1009,
> DISK_PARTITION_LOGICAL_OUTSIDE_EXT = -1010,
> DISK_SET_TYPE_INVALID_VOLUME = -1011,
> DISK_SET_TYPE_PARTED_FAILED = -1012,
> DISK_SET_LABEL_PARTED_FAILED = -1013,
> DISK_REMOVE_PARTITION_PARTED_FAILED = -1014,
> DISK_REMOVE_PARTITION_INVALID_VOLUME = -1015,
> DISK_REMOVE_PARTITION_LIST_ERASE = -1016,
> DISK_DESTROY_TABLE_INVALID_LABEL = -1017,
> DISK_PARTITION_ZERO_SIZE = -1018,
> DISK_CHANGE_READONLY = -1019,
> DISK_RESIZE_PARTITION_INVALID_VOLUME = -1020,
> DISK_RESIZE_PARTITION_PARTED_FAILED = -1021,
> DISK_RESIZE_NO_SPACE = -1022,
> DISK_CHECK_RESIZE_INVALID_VOLUME = -1023,
> DISK_REMOVE_PARTITION_CREATE_NOT_FOUND = -1024,
> DISK_COMMIT_NOTHING_TODO = -1025,
> DISK_CREATE_PARTITION_NO_SPACE = -1026,
> DISK_REMOVE_USED_BY = -1027,
>
> STORAGE_DISK_NOT_FOUND = -2000,
> STORAGE_VOLUME_NOT_FOUND = -2001,
> STORAGE_REMOVE_PARTITION_INVALID_CONTAINER = -2002,
> STORAGE_CHANGE_PARTITION_ID_INVALID_CONTAINER = -2003,
> STORAGE_CHANGE_READONLY = -2004,
> STORAGE_DISK_USED_BY = -2005,
> STORAGE_LVM_VG_EXISTS = -2006,
> STORAGE_LVM_VG_NOT_FOUND = -2007,
> STORAGE_LVM_INVALID_DEVICE = -2008,
> STORAGE_CONTAINER_NOT_FOUND = -2009,
> STORAGE_VG_INVALID_NAME = -2010,
> STORAGE_REMOVE_USED_VOLUME = -2011,
> STORAGE_REMOVE_USING_UNKNOWN_TYPE = -2012,
> STORAGE_NOT_YET_IMPLEMENTED = -2013,
> STORAGE_MD_INVALID_NAME = -2014,
> STORAGE_MD_NOT_FOUND = -2015,
> STORAGE_MEMORY_EXHAUSTED = -2016,
> STORAGE_LOOP_NOT_FOUND = -2017,
> STORAGE_CREATED_LOOP_NOT_FOUND = -2018,
> STORAGE_EVMS_INVALID_NAME = -2019,
> STORAGE_EVMS_CO_EXISTS = -2020,
> STORAGE_EVMS_CO_NOT_FOUND = -2021,
> STORAGE_EVMS_INVALID_DEVICE = -2022,
> STORAGE_CHANGE_AREA_INVALID_CONTAINER = -2023,
> STORAGE_BACKUP_STATE_NOT_FOUND = -2024,
> STORAGE_INVALID_FSTAB_VALUE = -2025,
> STORAGE_NO_FSTAB_PTR = -2026,
>
> VOLUME_COMMIT_UNKNOWN_STAGE = -3000,
> VOLUME_FSTAB_EMPTY_MOUNT = -3001,
> VOLUME_UMOUNT_FAILED = -3002,
> VOLUME_MOUNT_FAILED = -3003,
> VOLUME_FORMAT_DD_FAILED = -3004,
> VOLUME_FORMAT_UNKNOWN_FS = -3005,
> VOLUME_FORMAT_FS_UNDETECTED = -3006,
> VOLUME_FORMAT_FS_TOO_SMALL = -3007,
> VOLUME_FORMAT_FAILED = -3008,
> VOLUME_TUNE2FS_FAILED = -3009,
> VOLUME_MKLABEL_FS_UNABLE = -3010,
> VOLUME_MKLABEL_FAILED = -3011,
> VOLUME_LOSETUP_NO_LOOP = -3012,
> VOLUME_LOSETUP_FAILED = -3013,
> VOLUME_CRYPT_NO_PWD = -3014,
> VOLUME_CRYPT_PWD_TOO_SHORT = -3015,
> VOLUME_CRYPT_NOT_DETECTED = -3016,
> VOLUME_FORMAT_EXTENDED_UNSUPPORTED = -3017,
> VOLUME_MOUNT_EXTENDED_UNSUPPORTED = -3018,
> VOLUME_MOUNT_POINT_INAVLID = -3019,
> VOLUME_MOUNTBY_NOT_ENCRYPTED = -3020,
> VOLUME_MOUNTBY_UNSUPPORTED_BY_FS = -3021,
> VOLUME_LABEL_NOT_SUPPORTED = -3022,
> VOLUME_LABEL_TOO_LONG = -3023,
> VOLUME_LABEL_WHILE_MOUNTED = -3024,
> VOLUME_RESIZE_UNSUPPORTED_BY_FS = -3025,
> VOLUME_RESIZE_UNSUPPORTED_BY_CONTAINER = -3026,
> VOLUME_RESIZE_FAILED = -3027,
> VOLUME_ALREADY_IN_USE = -3028,
> VOLUME_LOUNSETUP_FAILED = -3029,
> VOLUME_DEVICE_NOT_PRESENT = -3030,
> VOLUME_DEVICE_NOT_BLOCK = -3031,
>
> LVM_CREATE_PV_FAILED = -4000,
> LVM_PV_ALREADY_CONTAINED = -4001,
> LVM_PV_DEVICE_UNKNOWN = -4002,
> LVM_PV_DEVICE_USED = -4003,
> LVM_VG_HAS_NONE_PV = -4004,
> LVM_LV_INVALID_NAME = -4005,
> LVM_LV_DUPLICATE_NAME = -4006,
> LVM_LV_NO_SPACE = -4007,
> LVM_LV_UNKNOWN_NAME = -4008,
> LVM_LV_NOT_IN_LIST = -4009,
> LVM_VG_CREATE_FAILED = -4010,
> LVM_VG_EXTEND_FAILED = -4011,
> LVM_VG_REDUCE_FAILED = -4012,
> LVM_VG_REMOVE_FAILED = -4013,
> LVM_LV_CREATE_FAILED = -4014,
> LVM_LV_REMOVE_FAILED = -4015,
> LVM_LV_RESIZE_FAILED = -4016,
> LVM_PV_STILL_ADDED = -4017,
> LVM_PV_REMOVE_NOT_FOUND = -4018,
> LVM_CREATE_LV_INVALID_VOLUME = -4019,
> LVM_REMOVE_LV_INVALID_VOLUME = -4020,
> LVM_RESIZE_LV_INVALID_VOLUME = -4021,
> LVM_CHANGE_READONLY = -4022,
> LVM_CHECK_RESIZE_INVALID_VOLUME = -4023,
> LVM_COMMIT_NOTHING_TODO = -4024,
> LVM_LV_REMOVE_USED_BY = -4025,
> LVM_LV_ALREADY_ON_DISK = -4026,
> LVM_LV_NO_STRIPE_SIZE = -4027,
>
> FSTAB_ENTRY_NOT_FOUND = -5000,
> FSTAB_CHANGE_PREFIX_IMPOSSIBLE = -5001,
> FSTAB_REMOVE_ENTRY_NOT_FOUND = -5002,
> FSTAB_UPDATE_ENTRY_NOT_FOUND = -5003,
> FSTAB_ADD_ENTRY_FOUND = -5004,
>
> MD_CHANGE_READONLY = -6000,
> MD_DUPLICATE_NUMBER = -6001,
> MD_TOO_FEW_DEVICES = -6002,
> MD_DEVICE_UNKNOWN = -6003,
> MD_DEVICE_USED = -6004,
> MD_CREATE_INVALID_VOLUME = -6005,
> MD_REMOVE_FAILED = -6006,
> MD_NOT_IN_LIST = -6007,
> MD_CREATE_FAILED = -6008,
> MD_UNKNOWN_NUMBER = -6009,
> MD_REMOVE_USED_BY = -6010,
> MD_NUMBER_TOO_LARGE = -6011,
> MD_REMOVE_INVALID_VOLUME = -6012,
> MD_REMOVE_CREATE_NOT_FOUND = -6013,
> MD_NO_RESIZE_ON_DISK = -6014,
> MD_ADD_DUPLICATE = -6015,
> MD_REMOVE_NONEXISTENT = -6016,
> MD_NO_CHANGE_ON_DISK = -6017,
> MD_NO_CREATE_UNKNOWN = -6018,
>
> LOOP_CHANGE_READONLY = -7000,
> LOOP_DUPLICATE_FILE = -7001,
> LOOP_UNKNOWN_FILE = -7002,
> LOOP_REMOVE_USED_BY = -7003,
> LOOP_FILE_CREATE_FAILED = -7004,
> LOOP_CREATE_INVALID_VOLUME = -7005,
> LOOP_REMOVE_FILE_FAILED = -7006,
> LOOP_REMOVE_INVALID_VOLUME = -7007,
> LOOP_NOT_IN_LIST = -7008,
> LOOP_REMOVE_CREATE_NOT_FOUND = -7009,
>
> EVMS_HELPER_UNKNOWN_CMD = -8000,
> EVMS_UNSUPPORTED_CONTAINER_TYPE = -8001,
> EVMS_MALLOC_FAILED = -8002,
> EVMS_INVALID_PHYSICAL_VOLUME = -8003,
> EVMS_PHYSICAL_VOLUME_IN_USE = -8004,
> EVMS_PLUGIN_NOT_FOUND = -8005,
> EVMS_CREATE_CONTAINER_FAILED = -8006,
> EVMS_RESIZE_VOLUME_NOT_FOUND = -8007,
> EVMS_RESIZE_CONTAINER_NOT_FOUND = -8008,
> EVMS_RESIZE_EXPAND_FAILED = -8009,
> EVMS_RESIZE_SHRINK_FAILED = -8010,
> EVMS_COMMIT_FAILED = -8011,
> EVMS_CREATE_VOLUME_FREESPACE_NOT_FOUND = -8012,
> EVMS_CREATE_VOLUME_FAILED = -8013,
> EVMS_CREATE_COMPAT_VOLUME_FAILED = -8014,
> EVMS_SEGMENT_NOT_FOUND = -8015,
> EVMS_REMOVE_VOLUME_NOT_FOUND = -8016,
> EVMS_REMOVE_REGION_FAILED = -8017,
> EVMS_CONTAINER_NOT_FOUND = -8018,
> EVMS_CONTAINER_EXPAND_FAILED = -8019,
> EVMS_CONTAINER_SHRINK_INVALID_SEGMENT = -8020,
> EVMS_CONTAINER_SHRINK_FAILED = -8021,
> EVMS_CONTAINER_REMOVE_FAILED = -8022,
> EVMS_PV_ALREADY_CONTAINED = -8023,
> EVMS_PV_DEVICE_UNKNOWN = -8024,
> EVMS_PV_DEVICE_USED = -8025,
> EVMS_CO_HAS_NONE_PV = -8026,
> EVMS_LV_INVALID_NAME = -8027,
> EVMS_LV_DUPLICATE_NAME = -8028,
> EVMS_LV_NO_SPACE = -8020,
> EVMS_LV_UNKNOWN_NAME = -8030,
> EVMS_LV_NOT_IN_LIST = -8031,
> EVMS_PV_STILL_ADDED = -8032,
> EVMS_PV_REMOVE_NOT_FOUND = -8033,
> EVMS_CREATE_LV_INVALID_VOLUME = -8034,
> EVMS_REMOVE_LV_INVALID_VOLUME = -8035,
> EVMS_RESIZE_LV_INVALID_VOLUME = -8036,
> EVMS_CHANGE_READONLY = -8037,
> EVMS_CHECK_RESIZE_INVALID_VOLUME = -8038,
> EVMS_COMMIT_NOTHING_TODO = -8039,
> EVMS_LV_REMOVE_USED_BY = -8040,
> EVMS_COMMUNICATION_FAILED = -8041,
> EVMS_LV_ALREADY_ON_DISK = -8042,
> EVMS_LV_NO_STRIPE_SIZE = -8043,
>
> PEC_PE_SIZE_INVALID = -9000,
> PEC_PV_NOT_FOUND = -9001,
> PEC_REMOVE_PV_IN_USE = -9002,
> PEC_REMOVE_PV_SIZE_NEEDED = -9003,
> PEC_LV_NO_SPACE_STRIPED = -9004,
> PEC_LV_NO_SPACE_SINGLE = -9005,
> PEC_LV_PE_DEV_NOT_FOUND = -9006,
>
> DM_CHANGE_READONLY = -10000,
> DM_UNKNOWN_TABLE = -10001,
> DM_REMOVE_USED_BY = -10002,
> DM_REMOVE_CREATE_NOT_FOUND = -10003,
> DM_REMOVE_INVALID_VOLUME = -10004,
> DM_REMOVE_FAILED = -10005,
> DM_NOT_IN_LIST = -10006,
>
> CONTAINER_INTERNAL_ERROR = -99000,
> CONTAINER_INVALID_VIRTUAL_CALL = -99001,
>
>    };
>
>
>
>
>
>    class StorageInterface
>    {
>    public:
>
> StorageInterface () {}
> virtual ~StorageInterface () {}
>
>
>
>
> virtual void getContainers( deque<ContainerInfo>& infos) = 0;
># 578 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getDiskInfo( const string& disk, DiskInfo& info) = 0;
># 588 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getContDiskInfo( const string& disk, ContainerInfo& cinfo,
>                              DiskInfo& info ) = 0;
># 598 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getLvmVgInfo( const string& name, LvmVgInfo& info) = 0;
># 608 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getContLvmVgInfo( const string& name, ContainerInfo& cinfo,
>                               LvmVgInfo& info) = 0;
># 618 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getEvmsCoInfo( const string& name, EvmsCoInfo& info) = 0;
># 628 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getContEvmsCoInfo( const string& name, ContainerInfo& cinfo,
>           EvmsCoInfo& info) = 0;
>
>
>
>
>
>
> virtual void getVolumes( deque<VolumeInfo>& infos) = 0;
># 645 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getVolume( const string& device, VolumeInfo& info) = 0;
># 654 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getPartitionInfo( const string& disk,
>                               deque<PartitionInfo>& plist ) = 0;
># 664 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getLvmLvInfo( const string& name,
>      deque<LvmLvInfo>& plist ) = 0;
># 674 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getEvmsInfo( const string& name,
>     deque<EvmsInfo>& plist ) = 0;
>
>
>
>
>
>
>
> virtual int getMdInfo( deque<MdInfo>& plist ) = 0;
>
>
>
>
>
>
>
> virtual int getLoopInfo( deque<LoopInfo>& plist ) = 0;
>
>
>
>
>
>
>
> virtual int getDmInfo( deque<DmInfo>& plist ) = 0;
>
>
>
>
> virtual bool getFsCapabilities (FsType fstype, FsCapabilities& fscapabilities) const = 0;
># 713 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void printInfo( std::ostream& str ) = 0;
># 727 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createPartition( const string& disk, PartitionType type,
>         unsigned long start,
>         unsigned long sizeCyl,
>         string& device ) = 0;
># 739 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int resizePartition( const string& device,
>         unsigned long sizeCyl ) = 0;
># 752 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int updatePartitionArea( const string& device,
>                                  unsigned long start,
>      unsigned long sizeCyl ) = 0;
># 766 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int nextFreePartition( const string& disk, PartitionType type,
>                                unsigned &nr, string& device ) = 0;
># 781 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createPartitionKb( const string& disk, PartitionType type,
>           unsigned long long start,
>           unsigned long long size,
>           string& device ) = 0;
># 796 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createPartitionAny( const string& disk,
>     unsigned long long size,
>     string& device ) = 0;
># 810 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createPartitionMax( const string& disk, PartitionType type,
>     string& device ) = 0;
># 820 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual unsigned long long cylinderToKb( const string& disk,
>                                          unsigned long size ) = 0;
># 830 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual unsigned long kbToCylinder( const string& disk,
>         unsigned long long size ) = 0;
>
>
>
>
>
>
>
> virtual int removePartition (const string& partition) = 0;
># 849 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changePartitionId (const string& partition, unsigned id) = 0;
>
>
>
>
>
>
> virtual int forgetChangePartitionId (const string& partition ) = 0;
># 866 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int destroyPartitionTable (const string& disk, const string& label) = 0;
>
>
>
>
>
>
>
> virtual string defaultDiskLabel() const = 0;
># 884 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeFormatVolume( const string& device, bool format, FsType fs ) = 0;
># 893 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeLabelVolume( const string& device, const string& label ) = 0;
># 902 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeMkfsOptVolume( const string& device, const string& opts ) = 0;
># 912 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeMountPoint( const string& device, const string& mount ) = 0;
># 921 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getMountPoint( const string& device, string& mount ) = 0;
># 930 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeMountBy( const string& device, MountByType mby ) = 0;
># 940 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getMountBy( const string& device, MountByType& mby ) = 0;
># 954 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeFstabOptions( const string& device, const string& options ) = 0;
># 964 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getFstabOptions( const string& device, string& options ) = 0;
># 974 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int addFstabOptions( const string& device, const string& options ) = 0;
># 985 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeFstabOptions( const string& device, const string& options ) = 0;
># 994 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int setCryptPassword( const string& device, const string& pwd ) = 0;
>
>
>
>
>
>
>
> virtual int forgetCryptPassword( const string& device ) = 0;
># 1011 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getCryptPassword( const string& device, string& pwd ) = 0;
># 1020 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int setCrypt( const string& device, bool val ) = 0;
># 1030 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getCrypt( const string& device, bool& val ) = 0;
># 1044 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int setIgnoreFstab( const string& device, bool val ) = 0;
># 1054 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int getIgnoreFstab( const string& device, bool& val ) = 0;
># 1070 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int addFstabEntry( const string& device, const string& mount,
>                            const string& vfs, const string& options,
>       unsigned freq, unsigned passno ) = 0;
># 1082 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int resizeVolume( const string& device, unsigned long long newSizeMb ) = 0;
>
>
>
>
>
>
>
> virtual int forgetResizeVolume( const string& device ) = 0;
># 1106 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setRecursiveRemoval( bool val ) = 0;
>
>
>
>
>
>
> virtual bool getRecursiveRemoval() const = 0;
># 1128 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setZeroNewPartitions( bool val ) = 0;
>
>
>
>
>
>
> virtual bool getZeroNewPartitions() const = 0;
># 1146 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setRootPrefix( const string& root ) = 0;
>
>
>
>
>
>
> virtual void setDetectMountedVolumes( bool val ) = 0;
>
>
>
>
>
>
> virtual bool getDetectMountedVolumes() const = 0;
># 1169 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeVolume( const string& device ) = 0;
># 1181 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createLvmVg( const string& name,
>                          unsigned long long peSizeK, bool lvm1,
>                          const deque<string>& devs ) = 0;
># 1192 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeLvmVg( const string& name ) = 0;
># 1201 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int extendLvmVg( const string& name,
>                          const deque<string>& devs ) = 0;
># 1211 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int shrinkLvmVg( const string& name,
>                          const deque<string>& devs ) = 0;
># 1225 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createLvmLv( const string& vg, const string& name,
>                          unsigned long long sizeM, unsigned stripe,
>     string& device ) = 0;
>
>
>
>
>
>
>
> virtual int removeLvmLvByDevice( const string& device ) = 0;
># 1244 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeLvmLv( const string& vg, const string& name ) = 0;
># 1255 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeLvStripeSize( const string& vg, const string& name,
>                                 unsigned long long stripeSize ) = 0;
># 1268 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createEvmsContainer( const string& name,
>      unsigned long long peSizeK, bool lvm1,
>      const deque<string>& devs ) = 0;
># 1279 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeEvmsContainer( const string& name ) = 0;
># 1288 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int extendEvmsContainer( const string& name,
>      const deque<string>& devs ) = 0;
># 1298 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int shrinkEvmsContainer( const string& name,
>      const deque<string>& devs ) = 0;
># 1312 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createEvmsVolume( const string& coname, const string& name,
>          unsigned long long sizeM, unsigned stripe,
>          string& device ) = 0;
>
>
>
>
>
>
>
> virtual int removeEvmsVolumeByDevice( const string& device ) = 0;
># 1331 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeEvmsVolume( const string& coname, const string& name ) = 0;
># 1342 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeEvmsStripeSize( const string& coname,
>                                   const string& name,
>       unsigned long long stripeSize ) = 0;
># 1354 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createMd( const string& name, MdType rtype,
>         const deque<string>& devs ) = 0;
># 1365 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createMdAny( MdType rtype, const deque<string>& devs,
>     string& device ) = 0;
># 1376 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeMd( const string& name, bool destroySb ) = 0;
># 1386 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int extendMd( const string& name, const string& dev ) = 0;
># 1396 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int shrinkMd( const string& name, const string& dev ) = 0;
># 1406 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeMdType( const string& name, MdType rtype ) = 0;
># 1416 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeMdChunk( const string& name, unsigned long chunk ) = 0;
># 1426 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int changeMdParity( const string& name, MdParity ptype ) = 0;
>
>
>
>
>
>
>
> virtual int checkMd( const string& name ) = 0;
># 1452 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int createFileLoop( const string& lname, bool reuseExisting,
>                             unsigned long long sizeK,
>        const string& mp, const string& pwd,
>        string& device ) = 0;
># 1465 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeFileLoop( const string& lname, bool removeFile ) = 0;
># 1475 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual deque<string> getCommitActions( bool mark_destructive ) = 0;
>
>
>
>
>
>
> virtual const string& getLastAction() const = 0;
>
>
>
>
>
>
>
> virtual const string& getExtendedErrorMessage() const = 0;
># 1500 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setCallbackProgressBar( CallbackProgressBar pfnc ) = 0;
>
>
>
>
>
>
> virtual CallbackProgressBar getCallbackProgressBar() const = 0;
>
>
>
>
>
>
>
> virtual void setCallbackShowInstallInfo( CallbackShowInstallInfo pfnc ) = 0;
>
>
>
>
>
>
> virtual CallbackShowInstallInfo getCallbackShowInstallInfo() const = 0;
># 1531 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setCallbackInfoPopup( CallbackInfoPopup pfnc ) = 0;
>
>
>
>
>
>
>
> virtual CallbackInfoPopup getCallbackInfoPopup() const = 0;
># 1548 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setCallbackYesNoPopup( CallbackYesNoPopup pfnc ) = 0;
>
>
>
>
>
>
>
> virtual CallbackYesNoPopup getCallbackYesNoPopup() const = 0;
># 1565 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void setCacheChanges (bool cache) = 0;
>
>
>
>
> virtual bool isCacheChanges () const = 0;
>
>
>
>
>
> virtual int commit() = 0;
>
>
>
>
>
>
>
> virtual int createBackupState( const string& name ) = 0;
>
>
>
>
>
>
>
> virtual int restoreBackupState( const string& name ) = 0;
>
>
>
>
>
>
>
> virtual bool checkBackupState( const string& name ) = 0;
># 1610 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual bool equalBackupStates( const string& lhs,
>                                 const string& rhs,
>     bool verbose_log ) const = 0;
># 1621 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual int removeBackupState( const string& name ) = 0;
># 1630 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual bool checkDeviceMounted( const string& device, string& mp ) = 0;
># 1640 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual bool umountDevice( const string& device ) = 0;
># 1651 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual bool mountDevice( const string& device, const string& mp ) = 0;
># 1663 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual bool getFreeInfo( const string& device,
>                           unsigned long long& resize_free,
>                           unsigned long long& df_free,
>                           unsigned long long& used,
>      bool& win ) = 0;
># 1676 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual bool readFstab( const string& dir, deque<VolumeInfo>& infos) = 0;
>
>
>
>
>
>
>
> virtual void activateHld( bool val ) = 0;
># 1695 "y2storage/y2storage/y2storage/y2storage/StorageInterface.h"
> virtual void rescanEverything() = 0;
>
>    };
>
>
>
>
>
>    void initDefaultLogger ();
>
>
>
>
>
>    StorageInterface* createDefaultStorageInterface ();
>
>
>
>
>
>    StorageInterface* createStorageInterface (bool readonly, bool testmode,
>           bool autodetect);
>
>
>
>
>
>    void destroyStorageInterface (StorageInterface*);
>
>};
># 5 "y2storage/y2storage/y2storage/Volume.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/StorageTypes.h" 1
>
>
>
># 1 "/usr/include/c++/4.0.2/iostream" 1 3
># 42 "/usr/include/c++/4.0.2/iostream" 3
>       
># 43 "/usr/include/c++/4.0.2/iostream" 3
>#pragma GCC visibility push(default)
>
>
>
># 1 "/usr/include/c++/4.0.2/istream" 1 3
># 42 "/usr/include/c++/4.0.2/istream" 3
>       
># 43 "/usr/include/c++/4.0.2/istream" 3
>#pragma GCC visibility push(default)
>
>
>
>
>namespace std
>{
># 58 "/usr/include/c++/4.0.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:
># 104 "/usr/include/c++/4.0.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;
># 131 "/usr/include/c++/4.0.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&));
># 169 "/usr/include/c++/4.0.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);
># 230 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      operator>>(__streambuf_type* __sb);
># 240 "/usr/include/c++/4.0.2/istream" 3
>      inline streamsize
>      gcount() const
>      { return _M_gcount; }
># 272 "/usr/include/c++/4.0.2/istream" 3
>      int_type
>      get();
># 286 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      get(char_type& __c);
># 313 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      get(char_type* __s, streamsize __n, char_type __delim);
># 324 "/usr/include/c++/4.0.2/istream" 3
>      inline __istream_type&
>      get(char_type* __s, streamsize __n)
>      { return this->get(__s, __n, this->widen('\n')); }
># 347 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      get(__streambuf_type& __sb, char_type __delim);
># 357 "/usr/include/c++/4.0.2/istream" 3
>      inline __istream_type&
>      get(__streambuf_type& __sb)
>      { return this->get(__sb, this->widen('\n')); }
># 386 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      getline(char_type* __s, streamsize __n, char_type __delim);
># 397 "/usr/include/c++/4.0.2/istream" 3
>      inline __istream_type&
>      getline(char_type* __s, streamsize __n)
>      { return this->getline(__s, __n, this->widen('\n')); }
># 421 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      ignore();
>
>      __istream_type&
>      ignore(streamsize __n);
>
>      __istream_type&
>      ignore(streamsize __n, int_type __delim);
># 438 "/usr/include/c++/4.0.2/istream" 3
>      int_type
>      peek();
># 456 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      read(char_type* __s, streamsize __n);
># 475 "/usr/include/c++/4.0.2/istream" 3
>      streamsize
>      readsome(char_type* __s, streamsize __n);
># 491 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      putback(char_type __c);
># 506 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      unget();
># 524 "/usr/include/c++/4.0.2/istream" 3
>      int
>      sync();
># 538 "/usr/include/c++/4.0.2/istream" 3
>      pos_type
>      tellg();
># 553 "/usr/include/c++/4.0.2/istream" 3
>      __istream_type&
>      seekg(pos_type);
># 569 "/usr/include/c++/4.0.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);
># 622 "/usr/include/c++/4.0.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;
># 654 "/usr/include/c++/4.0.2/istream" 3
>      explicit
>      sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);
># 664 "/usr/include/c++/4.0.2/istream" 3
>      operator bool() const { return _M_ok; }
>
>    private:
>      bool _M_ok;
>    };
># 683 "/usr/include/c++/4.0.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)); }
># 724 "/usr/include/c++/4.0.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __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)); }
># 746 "/usr/include/c++/4.0.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()
>      { }
>    };
># 809 "/usr/include/c++/4.0.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    ws(basic_istream<_CharT, _Traits>& __is);
>}
>
>
># 1 "/usr/include/c++/4.0.2/bits/istream.tcc" 1 3
># 43 "/usr/include/c++/4.0.2/bits/istream.tcc" 3
>       
># 44 "/usr/include/c++/4.0.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/include/c++/4.0.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>;
>
>
>}
># 816 "/usr/include/c++/4.0.2/istream" 2 3
>
>
>#pragma GCC visibility pop
># 48 "/usr/include/c++/4.0.2/iostream" 2 3
>
>namespace std
>{
># 64 "/usr/include/c++/4.0.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;
>}
>
>#pragma GCC visibility pop
># 5 "y2storage/y2storage/y2storage/y2storage/StorageTypes.h" 2
># 1 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 1 3
># 37 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>       
># 38 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/c++/4.0.2/fstream" 1 3
># 42 "/usr/include/c++/4.0.2/fstream" 3
>       
># 43 "/usr/include/c++/4.0.2/fstream" 3
>#pragma GCC visibility push(default)
>
>
>
>
>
># 1 "/usr/include/c++/4.0.2/i586-suse-linux/bits/basic_file.h" 1 3
># 42 "/usr/include/c++/4.0.2/i586-suse-linux/bits/basic_file.h" 3
>       
># 43 "/usr/include/c++/4.0.2/i586-suse-linux/bits/basic_file.h" 3
>
>
>
>
>namespace std
>{
>
>  template<typename _CharT>
>    class __basic_file;
>
>
>  template<>
>    class __basic_file<char>
>    {
>
>      __c_file* _M_cfile;
>
>
>      bool _M_cfile_created;
>
>    public:
>      __basic_file(__c_lock* __lock = 0);
>
>      __basic_file*
>      open(const char* __name, ios_base::openmode __mode, int __prot = 0664);
>
>      __basic_file*
>      sys_open(__c_file* __file, ios_base::openmode);
>
>      __basic_file*
>      sys_open(int __fd, ios_base::openmode __mode);
>
>      __basic_file*
>      close();
>
>      bool
>      is_open() const;
>
>      int
>      fd();
>
>      __c_file*
>      file();
>
>      ~__basic_file();
>
>      streamsize
>      xsputn(const char* __s, streamsize __n);
>
>      streamsize
>      xsputn_2(const char* __s1, streamsize __n1,
>        const char* __s2, streamsize __n2);
>
>      streamsize
>      xsgetn(char* __s, streamsize __n);
>
>      streamoff
>      seekoff(streamoff __off, ios_base::seekdir __way);
>
>      int
>      sync();
>
>      streamsize
>      showmanyc();
>    };
>}
># 50 "/usr/include/c++/4.0.2/fstream" 2 3
>
>
>namespace std
>{
># 68 "/usr/include/c++/4.0.2/fstream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_filebuf : public basic_streambuf<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>      typedef basic_streambuf<char_type, traits_type> __streambuf_type;
>      typedef basic_filebuf<char_type, traits_type> __filebuf_type;
>      typedef __basic_file<char> __file_type;
>      typedef typename traits_type::state_type __state_type;
>      typedef codecvt<char_type, char, __state_type> __codecvt_type;
>
>      friend class ios_base;
>
>    protected:
>
>
>      __c_lock _M_lock;
>
>
>      __file_type _M_file;
>
>
>
>
>
>
>      ios_base::openmode _M_mode;
>
>
>      __state_type _M_state_beg;
>
>
>
>
>      __state_type _M_state_cur;
>
>
>
>      __state_type _M_state_last;
>
>
>
>
>
>
>      char_type* _M_buf;
># 128 "/usr/include/c++/4.0.2/fstream" 3
>      size_t _M_buf_size;
>
>
>      bool _M_buf_allocated;
># 142 "/usr/include/c++/4.0.2/fstream" 3
>      bool _M_reading;
>      bool _M_writing;
># 153 "/usr/include/c++/4.0.2/fstream" 3
>      char_type _M_pback;
>      char_type* _M_pback_cur_save;
>      char_type* _M_pback_end_save;
>      bool _M_pback_init;
>
>
>
>      const __codecvt_type* _M_codecvt;
># 169 "/usr/include/c++/4.0.2/fstream" 3
>      char* _M_ext_buf;
>
>
>
>
>
>
>      streamsize _M_ext_buf_size;
># 185 "/usr/include/c++/4.0.2/fstream" 3
>      const char* _M_ext_next;
>      char* _M_ext_end;
># 195 "/usr/include/c++/4.0.2/fstream" 3
>      void
>      _M_create_pback()
>      {
> if (!_M_pback_init)
>   {
>     _M_pback_cur_save = this->gptr();
>     _M_pback_end_save = this->egptr();
>     this->setg(&_M_pback, &_M_pback, &_M_pback + 1);
>     _M_pback_init = true;
>   }
>      }
># 214 "/usr/include/c++/4.0.2/fstream" 3
>      void
>      _M_destroy_pback() throw()
>      {
> if (_M_pback_init)
>   {
>
>     _M_pback_cur_save += this->gptr() != this->eback();
>     this->setg(_M_buf, _M_pback_cur_save, _M_pback_end_save);
>     _M_pback_init = false;
>   }
>      }
>
>    public:
>
>
>
>
>
>
>
>      basic_filebuf();
>
>
>
>
>      virtual
>      ~basic_filebuf()
>      { this->close(); }
>
>
>
>
>
>      bool
>      is_open() const throw()
>      { return _M_file.is_open(); }
># 264 "/usr/include/c++/4.0.2/fstream" 3
>      __filebuf_type*
>      open(const char* __s, ios_base::openmode __mode);
># 278 "/usr/include/c++/4.0.2/fstream" 3
>      __filebuf_type*
>      close() throw();
>
>    protected:
>      void
>      _M_allocate_internal_buffer();
>
>      void
>      _M_destroy_internal_buffer() throw();
>
>
>      virtual streamsize
>      showmanyc();
>
>
>
>
>
>
>      virtual int_type
>      underflow();
>
>      virtual int_type
>      pbackfail(int_type __c = _Traits::eof());
># 310 "/usr/include/c++/4.0.2/fstream" 3
>      virtual int_type
>      overflow(int_type __c = _Traits::eof());
>
>
>
>      bool
>      _M_convert_to_external(char_type*, streamsize);
># 330 "/usr/include/c++/4.0.2/fstream" 3
>      virtual __streambuf_type*
>      setbuf(char_type* __s, streamsize __n);
>
>      virtual pos_type
>      seekoff(off_type __off, ios_base::seekdir __way,
>       ios_base::openmode __mode = ios_base::in | ios_base::out);
>
>      virtual pos_type
>      seekpos(pos_type __pos,
>       ios_base::openmode __mode = ios_base::in | ios_base::out);
>
>
>      pos_type
>      _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state);
>
>      virtual int
>      sync();
>
>      virtual void
>      imbue(const locale& __loc);
>
>      virtual streamsize
>      xsgetn(char_type* __s, streamsize __n);
>
>      virtual streamsize
>      xsputn(const char_type* __s, streamsize __n);
>
>
>      bool
>      _M_terminate_output();
># 375 "/usr/include/c++/4.0.2/fstream" 3
>      void
>      _M_set_buffer(streamsize __off)
>      {
>  const bool __testin = _M_mode & ios_base::in;
>  const bool __testout = _M_mode & ios_base::out;
>
> if (__testin && __off > 0)
>   this->setg(_M_buf, _M_buf, _M_buf + __off);
> else
>   this->setg(_M_buf, _M_buf, _M_buf);
>
> if (__testout && __off == 0 && _M_buf_size > 1 )
>   this->setp(_M_buf, _M_buf + _M_buf_size - 1);
> else
>   this->setp(__null, __null);
>      }
>    };
># 402 "/usr/include/c++/4.0.2/fstream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_ifstream : public basic_istream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_filebuf<char_type, traits_type> __filebuf_type;
>      typedef basic_istream<char_type, traits_type> __istream_type;
>
>    private:
>      __filebuf_type _M_filebuf;
>
>    public:
># 429 "/usr/include/c++/4.0.2/fstream" 3
>      basic_ifstream() : __istream_type(), _M_filebuf()
>      { this->init(&_M_filebuf); }
># 442 "/usr/include/c++/4.0.2/fstream" 3
>      explicit
>      basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in)
>      : __istream_type(), _M_filebuf()
>      {
> this->init(&_M_filebuf);
> this->open(__s, __mode);
>      }
>
>
>
>
>
>
>
>      ~basic_ifstream()
>      { }
># 466 "/usr/include/c++/4.0.2/fstream" 3
>      __filebuf_type*
>      rdbuf() const
>      { return const_cast<__filebuf_type*>(&_M_filebuf); }
>
>
>
>
>
>      bool
>      is_open()
>      { return _M_filebuf.is_open(); }
>
>
>
>      bool
>      is_open() const
>      { return _M_filebuf.is_open(); }
># 495 "/usr/include/c++/4.0.2/fstream" 3
>      void
>      open(const char* __s, ios_base::openmode __mode = ios_base::in)
>      {
> if (!_M_filebuf.open(__s, __mode | ios_base::in))
>   this->setstate(ios_base::failbit);
> else
>
>
>   this->clear();
>      }
>
>
>
>
>
>
>
>      void
>      close()
>      {
> if (!_M_filebuf.close())
>   this->setstate(ios_base::failbit);
>      }
>    };
># 530 "/usr/include/c++/4.0.2/fstream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_ofstream : public basic_ostream<_CharT,_Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_filebuf<char_type, traits_type> __filebuf_type;
>      typedef basic_ostream<char_type, traits_type> __ostream_type;
>
>    private:
>      __filebuf_type _M_filebuf;
>
>    public:
># 557 "/usr/include/c++/4.0.2/fstream" 3
>      basic_ofstream(): __ostream_type(), _M_filebuf()
>      { this->init(&_M_filebuf); }
># 571 "/usr/include/c++/4.0.2/fstream" 3
>      explicit
>      basic_ofstream(const char* __s,
>       ios_base::openmode __mode = ios_base::out|ios_base::trunc)
>      : __ostream_type(), _M_filebuf()
>      {
> this->init(&_M_filebuf);
> this->open(__s, __mode);
>      }
>
>
>
>
>
>
>
>      ~basic_ofstream()
>      { }
># 596 "/usr/include/c++/4.0.2/fstream" 3
>      __filebuf_type*
>      rdbuf() const
>      { return const_cast<__filebuf_type*>(&_M_filebuf); }
>
>
>
>
>
>      bool
>      is_open()
>      { return _M_filebuf.is_open(); }
>
>
>
>      bool
>      is_open() const
>      { return _M_filebuf.is_open(); }
># 625 "/usr/include/c++/4.0.2/fstream" 3
>      void
>      open(const char* __s,
>    ios_base::openmode __mode = ios_base::out | ios_base::trunc)
>      {
> if (!_M_filebuf.open(__s, __mode | ios_base::out))
>   this->setstate(ios_base::failbit);
> else
>
>
>   this->clear();
>      }
>
>
>
>
>
>
>
>      void
>      close()
>      {
> if (!_M_filebuf.close())
>   this->setstate(ios_base::failbit);
>      }
>    };
># 661 "/usr/include/c++/4.0.2/fstream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_fstream : public basic_iostream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_filebuf<char_type, traits_type> __filebuf_type;
>      typedef basic_ios<char_type, traits_type> __ios_type;
>      typedef basic_iostream<char_type, traits_type> __iostream_type;
>
>    private:
>      __filebuf_type _M_filebuf;
>
>    public:
># 689 "/usr/include/c++/4.0.2/fstream" 3
>      basic_fstream()
>      : __iostream_type(), _M_filebuf()
>      { this->init(&_M_filebuf); }
># 701 "/usr/include/c++/4.0.2/fstream" 3
>      explicit
>      basic_fstream(const char* __s,
>      ios_base::openmode __mode = ios_base::in | ios_base::out)
>      : __iostream_type(__null), _M_filebuf()
>      {
> this->init(&_M_filebuf);
> this->open(__s, __mode);
>      }
>
>
>
>
>
>
>
>      ~basic_fstream()
>      { }
># 726 "/usr/include/c++/4.0.2/fstream" 3
>      __filebuf_type*
>      rdbuf() const
>      { return const_cast<__filebuf_type*>(&_M_filebuf); }
>
>
>
>
>
>      bool
>      is_open()
>      { return _M_filebuf.is_open(); }
>
>
>
>      bool
>      is_open() const
>      { return _M_filebuf.is_open(); }
># 755 "/usr/include/c++/4.0.2/fstream" 3
>      void
>      open(const char* __s,
>    ios_base::openmode __mode = ios_base::in | ios_base::out)
>      {
> if (!_M_filebuf.open(__s, __mode))
>   this->setstate(ios_base::failbit);
> else
>
>
>   this->clear();
>      }
>
>
>
>
>
>
>
>      void
>      close()
>      {
> if (!_M_filebuf.close())
>   this->setstate(ios_base::failbit);
>      }
>    };
>}
>
>
># 1 "/usr/include/c++/4.0.2/bits/fstream.tcc" 1 3
># 43 "/usr/include/c++/4.0.2/bits/fstream.tcc" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/fstream.tcc" 3
>
>namespace std
>{
>  template<typename _CharT, typename _Traits>
>    void
>    basic_filebuf<_CharT, _Traits>::
>    _M_allocate_internal_buffer()
>    {
>
>
>      if (!_M_buf_allocated && !_M_buf)
> {
>   _M_buf = new char_type[_M_buf_size];
>   _M_buf_allocated = true;
> }
>    }
>
>  template<typename _CharT, typename _Traits>
>    void
>    basic_filebuf<_CharT, _Traits>::
>    _M_destroy_internal_buffer() throw()
>    {
>      if (_M_buf_allocated)
> {
>   delete [] _M_buf;
>   _M_buf = __null;
>   _M_buf_allocated = false;
> }
>      delete [] _M_ext_buf;
>      _M_ext_buf = __null;
>      _M_ext_buf_size = 0;
>      _M_ext_next = __null;
>      _M_ext_end = __null;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_filebuf<_CharT, _Traits>::
>    basic_filebuf() : __streambuf_type(), _M_lock(), _M_file(&_M_lock),
>    _M_mode(ios_base::openmode(0)), _M_state_beg(), _M_state_cur(),
>    _M_state_last(), _M_buf(__null), _M_buf_size(8192),
>    _M_buf_allocated(false), _M_reading(false), _M_writing(false), _M_pback(),
>    _M_pback_cur_save(0), _M_pback_end_save(0), _M_pback_init(false),
>    _M_codecvt(0), _M_ext_buf(0), _M_ext_buf_size(0), _M_ext_next(0),
>    _M_ext_end(0)
>    {
>      if (has_facet<__codecvt_type>(this->_M_buf_locale))
> _M_codecvt = &use_facet<__codecvt_type>(this->_M_buf_locale);
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::__filebuf_type*
>    basic_filebuf<_CharT, _Traits>::
>    open(const char* __s, ios_base::openmode __mode)
>    {
>      __filebuf_type *__ret = __null;
>      if (!this->is_open())
> {
>   _M_file.open(__s, __mode);
>   if (this->is_open())
>     {
>       _M_allocate_internal_buffer();
>       _M_mode = __mode;
>
>
>       _M_reading = false;
>       _M_writing = false;
>       _M_set_buffer(-1);
>
>
>       _M_state_last = _M_state_cur = _M_state_beg;
>
>
>       if ((__mode & ios_base::ate)
>    && this->seekoff(0, ios_base::end, __mode)
>    == pos_type(off_type(-1)))
>  this->close();
>       else
>  __ret = this;
>     }
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::__filebuf_type*
>    basic_filebuf<_CharT, _Traits>::
>    close() throw()
>    {
>      __filebuf_type* __ret = __null;
>      if (this->is_open())
> {
>   bool __testfail = false;
>   try
>     {
>       if (!_M_terminate_output())
>  __testfail = true;
>     }
>   catch(...)
>     { __testfail = true; }
>
>
>   _M_mode = ios_base::openmode(0);
>   _M_pback_init = false;
>   _M_destroy_internal_buffer();
>   _M_reading = false;
>   _M_writing = false;
>   _M_set_buffer(-1);
>   _M_state_last = _M_state_cur = _M_state_beg;
>
>   if (!_M_file.close())
>     __testfail = true;
>
>   if (!__testfail)
>     __ret = this;
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    basic_filebuf<_CharT, _Traits>::
>    showmanyc()
>    {
>      streamsize __ret = -1;
>      const bool __testin = _M_mode & ios_base::in;
>      if (__testin && this->is_open())
> {
>
>
>   __ret = this->egptr() - this->gptr();
>
>
>
>
>
>
>
>   if (__check_facet(_M_codecvt).encoding() >= 0)
>
>     __ret += _M_file.showmanyc() / _M_codecvt->max_length();
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::int_type
>    basic_filebuf<_CharT, _Traits>::
>    underflow()
>    {
>      int_type __ret = traits_type::eof();
>      const bool __testin = _M_mode & ios_base::in;
>      if (__testin && !_M_writing)
> {
>
>
>
>   _M_destroy_pback();
>
>   if (this->gptr() < this->egptr())
>     return traits_type::to_int_type(*this->gptr());
>
>
>   const size_t __buflen = _M_buf_size > 1
>                           ? _M_buf_size - 1 : 1;
>
>
>   bool __got_eof = false;
>
>   streamsize __ilen = 0;
>   codecvt_base::result __r = codecvt_base::ok;
>   if (__check_facet(_M_codecvt).always_noconv())
>     {
>       __ilen = _M_file.xsgetn(reinterpret_cast<char*>(this->eback()),
>          __buflen);
>       if (__ilen == 0)
>  __got_eof = true;
>     }
>   else
>     {
>
>
>       const int __enc = _M_codecvt->encoding();
>       streamsize __blen;
>       streamsize __rlen;
>       if (__enc > 0)
>  __blen = __rlen = __buflen * __enc;
>       else
>  {
>    __blen = __buflen + _M_codecvt->max_length() - 1;
>    __rlen = __buflen;
>  }
>       const streamsize __remainder = _M_ext_end - _M_ext_next;
>       __rlen = __rlen > __remainder ? __rlen - __remainder : 0;
>
>
>
>       if (_M_reading && this->egptr() == this->eback() && __remainder)
>  __rlen = 0;
>
>
>
>       if (_M_ext_buf_size < __blen)
>  {
>    char* __buf = new char[__blen];
>    if (__remainder)
>      std::memcpy(__buf, _M_ext_next, __remainder);
>
>    delete [] _M_ext_buf;
>    _M_ext_buf = __buf;
>    _M_ext_buf_size = __blen;
>  }
>       else if (__remainder)
>  std::memmove(_M_ext_buf, _M_ext_next, __remainder);
>
>       _M_ext_next = _M_ext_buf;
>       _M_ext_end = _M_ext_buf + __remainder;
>       _M_state_last = _M_state_cur;
>
>       do
>  {
>    if (__rlen > 0)
>      {
>
>
>
>        if (_M_ext_end - _M_ext_buf + __rlen > _M_ext_buf_size)
>   {
>     __throw_ios_failure(("basic_filebuf::underflow " "codecvt::max_length() " "is not valid"));
>
>
>   }
>        streamsize __elen = _M_file.xsgetn(_M_ext_end, __rlen);
>        if (__elen == 0)
>   __got_eof = true;
>        else if (__elen == -1)
>   break;
>        _M_ext_end += __elen;
>      }
>
>    char_type* __iend;
>    __r = _M_codecvt->in(_M_state_cur, _M_ext_next,
>           _M_ext_end, _M_ext_next, this->eback(),
>           this->eback() + __buflen, __iend);
>    if (__r == codecvt_base::noconv)
>      {
>        size_t __avail = _M_ext_end - _M_ext_buf;
>        __ilen = std::min(__avail, __buflen);
>        traits_type::copy(this->eback(),
>     reinterpret_cast<char_type*>(_M_ext_buf), __ilen);
>        _M_ext_next = _M_ext_buf + __ilen;
>      }
>    else
>      __ilen = __iend - this->eback();
>
>
>
>
>    if (__r == codecvt_base::error)
>      break;
>
>    __rlen = 1;
>  }
>       while (__ilen == 0 && !__got_eof);
>     }
>
>   if (__ilen > 0)
>     {
>       _M_set_buffer(__ilen);
>       _M_reading = true;
>       __ret = traits_type::to_int_type(*this->gptr());
>     }
>   else if (__got_eof)
>     {
>
>
>
>       _M_set_buffer(-1);
>       _M_reading = false;
>
>
>       if (__r == codecvt_base::partial)
>  __throw_ios_failure(("basic_filebuf::underflow " "incomplete character in file"));
>
>     }
>   else if (__r == codecvt_base::error)
>     __throw_ios_failure(("basic_filebuf::underflow " "invalid byte sequence in file"));
>
>   else
>     __throw_ios_failure(("basic_filebuf::underflow " "error reading the file"));
>
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::int_type
>    basic_filebuf<_CharT, _Traits>::
>    pbackfail(int_type __i)
>    {
>      int_type __ret = traits_type::eof();
>      const bool __testin = _M_mode & ios_base::in;
>      if (__testin && !_M_writing)
> {
>
>
>   const bool __testpb = _M_pback_init;
>   const bool __testeof = traits_type::eq_int_type(__i, __ret);
>   int_type __tmp;
>   if (this->eback() < this->gptr())
>     {
>       this->gbump(-1);
>       __tmp = traits_type::to_int_type(*this->gptr());
>     }
>   else if (this->seekoff(-1, ios_base::cur) != pos_type(off_type(-1)))
>     {
>       __tmp = this->underflow();
>       if (traits_type::eq_int_type(__tmp, __ret))
>  return __ret;
>     }
>   else
>     {
>
>
>
>
>
>       return __ret;
>     }
>
>
>
>   if (!__testeof && traits_type::eq_int_type(__i, __tmp))
>     __ret = __i;
>   else if (__testeof)
>     __ret = traits_type::not_eof(__i);
>   else if (!__testpb)
>     {
>       _M_create_pback();
>       _M_reading = true;
>       *this->gptr() = traits_type::to_char_type(__i);
>       __ret = __i;
>     }
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::int_type
>    basic_filebuf<_CharT, _Traits>::
>    overflow(int_type __c)
>    {
>      int_type __ret = traits_type::eof();
>      const bool __testeof = traits_type::eq_int_type(__c, __ret);
>      const bool __testout = _M_mode & ios_base::out;
>      if (__testout && !_M_reading)
> {
>   if (this->pbase() < this->pptr())
>     {
>
>       if (!__testeof)
>  {
>    *this->pptr() = traits_type::to_char_type(__c);
>    this->pbump(1);
>  }
>
>
>
>       if (_M_convert_to_external(this->pbase(),
>      this->pptr() - this->pbase()))
>  {
>    _M_set_buffer(0);
>    __ret = traits_type::not_eof(__c);
>  }
>     }
>   else if (_M_buf_size > 1)
>     {
>
>
>
>       _M_set_buffer(0);
>       _M_writing = true;
>       if (!__testeof)
>  {
>    *this->pptr() = traits_type::to_char_type(__c);
>    this->pbump(1);
>  }
>       __ret = traits_type::not_eof(__c);
>     }
>   else
>     {
>
>       char_type __conv = traits_type::to_char_type(__c);
>       if (__testeof || _M_convert_to_external(&__conv, 1))
>  {
>    _M_writing = true;
>    __ret = traits_type::not_eof(__c);
>  }
>     }
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    bool
>    basic_filebuf<_CharT, _Traits>::
>    _M_convert_to_external(_CharT* __ibuf, streamsize __ilen)
>    {
>
>      streamsize __elen;
>      streamsize __plen;
>      if (__check_facet(_M_codecvt).always_noconv())
> {
>   __elen = _M_file.xsputn(reinterpret_cast<char*>(__ibuf), __ilen);
>   __plen = __ilen;
> }
>      else
> {
>
>
>   streamsize __blen = __ilen * _M_codecvt->max_length();
>   char* __buf = static_cast<char*>(__builtin_alloca(__blen));
>
>   char* __bend;
>   const char_type* __iend;
>   codecvt_base::result __r;
>   __r = _M_codecvt->out(_M_state_cur, __ibuf, __ibuf + __ilen,
>    __iend, __buf, __buf + __blen, __bend);
>
>   if (__r == codecvt_base::ok || __r == codecvt_base::partial)
>     __blen = __bend - __buf;
>   else if (__r == codecvt_base::noconv)
>     {
>
>       __buf = reinterpret_cast<char*>(__ibuf);
>       __blen = __ilen;
>     }
>   else
>     __throw_ios_failure(("basic_filebuf::_M_convert_to_external " "conversion error"));
>
>
>   __elen = _M_file.xsputn(__buf, __blen);
>   __plen = __blen;
>
>
>   if (__r == codecvt_base::partial && __elen == __plen)
>     {
>       const char_type* __iresume = __iend;
>       streamsize __rlen = this->pptr() - __iend;
>       __r = _M_codecvt->out(_M_state_cur, __iresume,
>        __iresume + __rlen, __iend, __buf,
>        __buf + __blen, __bend);
>       if (__r != codecvt_base::error)
>  {
>    __rlen = __bend - __buf;
>    __elen = _M_file.xsputn(__buf, __rlen);
>    __plen = __rlen;
>  }
>       else
>  __throw_ios_failure(("basic_filebuf::_M_convert_to_external " "conversion error"));
>
>     }
> }
>      return __elen == __plen;
>    }
>
>   template<typename _CharT, typename _Traits>
>     streamsize
>     basic_filebuf<_CharT, _Traits>::
>     xsgetn(_CharT* __s, streamsize __n)
>     {
>
>       streamsize __ret = 0;
>       if (_M_pback_init)
>  {
>    if (__n > 0 && this->gptr() == this->eback())
>      {
>        *__s++ = *this->gptr();
>        this->gbump(1);
>        __ret = 1;
>        --__n;
>      }
>    _M_destroy_pback();
>  }
>
>
>
>
>       const bool __testin = _M_mode & ios_base::in;
>       const streamsize __buflen = _M_buf_size > 1 ? _M_buf_size - 1 : 1;
>
>       if (__n > __buflen && __check_facet(_M_codecvt).always_noconv()
>    && __testin && !_M_writing)
>  {
>
>    const streamsize __avail = this->egptr() - this->gptr();
>    if (__avail != 0)
>      {
>        if (__avail == 1)
>   *__s = *this->gptr();
>        else
>   traits_type::copy(__s, this->gptr(), __avail);
>        __s += __avail;
>        this->gbump(__avail);
>        __ret += __avail;
>        __n -= __avail;
>      }
>
>
>
>    streamsize __len;
>    for (;;)
>      {
>        __len = _M_file.xsgetn(reinterpret_cast<char*>(__s),
>          __n);
>        if (__len == -1)
>   __throw_ios_failure(("basic_filebuf::xsgetn " "error reading the file"));
>
>        if (__len == 0)
>   break;
>
>        __n -= __len;
>        __ret += __len;
>        if (__n == 0)
>   break;
>
>        __s += __len;
>      }
>
>    if (__n == 0)
>      {
>        _M_set_buffer(0);
>        _M_reading = true;
>      }
>    else if (__len == 0)
>      {
>
>
>
>        _M_set_buffer(-1);
>        _M_reading = false;
>      }
>  }
>       else
>  __ret += __streambuf_type::xsgetn(__s, __n);
>
>       return __ret;
>     }
>
>   template<typename _CharT, typename _Traits>
>     streamsize
>     basic_filebuf<_CharT, _Traits>::
>     xsputn(const _CharT* __s, streamsize __n)
>     {
>
>
>
>       streamsize __ret = 0;
>       const bool __testout = _M_mode & ios_base::out;
>       if (__check_facet(_M_codecvt).always_noconv()
>    && __testout && !_M_reading)
> {
>
>   const streamsize __chunk = 1ul << 10;
>   streamsize __bufavail = this->epptr() - this->pptr();
>
>
>   if (!_M_writing && _M_buf_size > 1)
>     __bufavail = _M_buf_size - 1;
>
>   const streamsize __limit = std::min(__chunk, __bufavail);
>   if (__n >= __limit)
>     {
>       const streamsize __buffill = this->pptr() - this->pbase();
>       const char* __buf = reinterpret_cast<const char*>(this->pbase());
>       __ret = _M_file.xsputn_2(__buf, __buffill,
>           reinterpret_cast<const char*>(__s),
>           __n);
>       if (__ret == __buffill + __n)
>  {
>    _M_set_buffer(0);
>    _M_writing = true;
>  }
>       if (__ret > __buffill)
>  __ret -= __buffill;
>       else
>  __ret = 0;
>     }
>   else
>     __ret = __streambuf_type::xsputn(__s, __n);
> }
>       else
>  __ret = __streambuf_type::xsputn(__s, __n);
>       return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::__streambuf_type*
>    basic_filebuf<_CharT, _Traits>::
>    setbuf(char_type* __s, streamsize __n)
>    {
>      if (!this->is_open())
> if (__s == 0 && __n == 0)
>   _M_buf_size = 1;
> else if (__s && __n > 0)
>   {
># 657 "/usr/include/c++/4.0.2/bits/fstream.tcc" 3
>     _M_buf = __s;
>     _M_buf_size = __n;
>   }
>      return this;
>    }
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::pos_type
>    basic_filebuf<_CharT, _Traits>::
>    seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode)
>    {
>      int __width = 0;
>      if (_M_codecvt)
> __width = _M_codecvt->encoding();
>      if (__width < 0)
> __width = 0;
>
>      pos_type __ret = pos_type(off_type(-1));
>      const bool __testfail = __off != 0 && __width <= 0;
>      if (this->is_open() && !__testfail)
> {
>
>   _M_destroy_pback();
>
>
>
>
>
>
>   __state_type __state = _M_state_beg;
>   off_type __computed_off = __off * __width;
>   if (_M_reading && __way == ios_base::cur)
>     {
>       if (_M_codecvt->always_noconv())
>  __computed_off += this->gptr() - this->egptr();
>       else
>  {
>
>
>
>    const int __gptr_off =
>      _M_codecvt->length(_M_state_last, _M_ext_buf, _M_ext_next,
>           this->gptr() - this->eback());
>    __computed_off += _M_ext_buf + __gptr_off - _M_ext_end;
>
>
>
>    __state = _M_state_last;
>  }
>     }
>   __ret = _M_seek(__computed_off, __way, __state);
> }
>      return __ret;
>    }
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::pos_type
>    basic_filebuf<_CharT, _Traits>::
>    seekpos(pos_type __pos, ios_base::openmode)
>    {
>      pos_type __ret = pos_type(off_type(-1));
>      if (this->is_open())
> {
>
>   _M_destroy_pback();
>   __ret = _M_seek(off_type(__pos), ios_base::beg, __pos.state());
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_filebuf<_CharT, _Traits>::pos_type
>    basic_filebuf<_CharT, _Traits>::
>    _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state)
>    {
>      pos_type __ret = pos_type(off_type(-1));
>      if (_M_terminate_output())
> {
>
>   __ret = pos_type(_M_file.seekoff(__off, __way));
>   _M_reading = false;
>   _M_writing = false;
>   _M_ext_next = _M_ext_end = _M_ext_buf;
>   _M_set_buffer(-1);
>   _M_state_cur = __state;
>   __ret.state(_M_state_cur);
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    bool
>    basic_filebuf<_CharT, _Traits>::
>    _M_terminate_output()
>    {
>
>      bool __testvalid = true;
>      if (this->pbase() < this->pptr())
> {
>   const int_type __tmp = this->overflow();
>   if (traits_type::eq_int_type(__tmp, traits_type::eof()))
>     __testvalid = false;
> }
>
>
>      if (_M_writing && !__check_facet(_M_codecvt).always_noconv()
>   && __testvalid)
> {
>
>
>
>   const size_t __blen = 128;
>   char __buf[__blen];
>   codecvt_base::result __r;
>   streamsize __ilen = 0;
>
>   do
>     {
>       char* __next;
>       __r = _M_codecvt->unshift(_M_state_cur, __buf,
>     __buf + __blen, __next);
>       if (__r == codecvt_base::error)
>  __testvalid = false;
>       else if (__r == codecvt_base::ok ||
>         __r == codecvt_base::partial)
>  {
>    __ilen = __next - __buf;
>    if (__ilen > 0)
>      {
>        const streamsize __elen = _M_file.xsputn(__buf, __ilen);
>        if (__elen != __ilen)
>   __testvalid = false;
>      }
>  }
>     }
>   while (__r == codecvt_base::partial && __ilen > 0 && __testvalid);
>
>   if (__testvalid)
>     {
>
>
>
>
>       const int_type __tmp = this->overflow();
>       if (traits_type::eq_int_type(__tmp, traits_type::eof()))
>  __testvalid = false;
>     }
> }
>      return __testvalid;
>    }
>
>  template<typename _CharT, typename _Traits>
>    int
>    basic_filebuf<_CharT, _Traits>::
>    sync()
>    {
>
>
>      int __ret = 0;
>      if (this->pbase() < this->pptr())
> {
>   const int_type __tmp = this->overflow();
>   if (traits_type::eq_int_type(__tmp, traits_type::eof()))
>     __ret = -1;
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    void
>    basic_filebuf<_CharT, _Traits>::
>    imbue(const locale& __loc)
>    {
>      bool __testvalid = true;
>
>      const __codecvt_type* _M_codecvt_tmp = 0;
>      if (__builtin_expect(has_facet<__codecvt_type>(__loc), true))
> _M_codecvt_tmp = &use_facet<__codecvt_type>(__loc);
>
>      if (this->is_open())
> {
>
>   if ((_M_reading || _M_writing)
>       && __check_facet(_M_codecvt).encoding() == -1)
>     __testvalid = false;
>   else
>     {
>       if (_M_reading)
>  {
>    if (__check_facet(_M_codecvt).always_noconv())
>      {
>        if (_M_codecvt_tmp
>     && !__check_facet(_M_codecvt_tmp).always_noconv())
>   __testvalid = this->seekoff(0, ios_base::cur, _M_mode)
>                 != pos_type(off_type(-1));
>      }
>    else
>      {
>
>        _M_ext_next = _M_ext_buf
>   + _M_codecvt->length(_M_state_last, _M_ext_buf, _M_ext_next,
>          this->gptr() - this->eback());
>        const streamsize __remainder = _M_ext_end - _M_ext_next;
>        if (__remainder)
>   std::memmove(_M_ext_buf, _M_ext_next, __remainder);
>
>        _M_ext_next = _M_ext_buf;
>        _M_ext_end = _M_ext_buf + __remainder;
>        _M_set_buffer(-1);
>        _M_state_last = _M_state_cur = _M_state_beg;
>      }
>  }
>       else if (_M_writing && (__testvalid = _M_terminate_output()))
>  _M_set_buffer(-1);
>     }
> }
>
>      if (__testvalid)
> _M_codecvt = _M_codecvt_tmp;
>      else
> _M_codecvt = 0;
>    }
>
>
>
>
>
>  extern template class basic_filebuf<char>;
>  extern template class basic_ifstream<char>;
>  extern template class basic_ofstream<char>;
>  extern template class basic_fstream<char>;
>
>
>  extern template class basic_filebuf<wchar_t>;
>  extern template class basic_ifstream<wchar_t>;
>  extern template class basic_ofstream<wchar_t>;
>  extern template class basic_fstream<wchar_t>;
>
>
>}
># 784 "/usr/include/c++/4.0.2/fstream" 2 3
>
>
>#pragma GCC visibility pop
># 41 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 2 3
>
>namespace __gnu_cxx
>{
># 52 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>  template<typename _CharT, typename _Traits = std::char_traits<_CharT> >
>    class stdio_filebuf : public std::basic_filebuf<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>      typedef std::size_t size_t;
>
>    public:
>
>
>
>      stdio_filebuf() : std::basic_filebuf<_CharT, _Traits>() {}
># 79 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>      stdio_filebuf(int __fd, std::ios_base::openmode __mode,
>      size_t __size = static_cast<size_t>(8192));
># 92 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>      stdio_filebuf(std::__c_file* __f, std::ios_base::openmode __mode,
>      size_t __size = static_cast<size_t>(8192));
>
>
>
>
>
>      virtual
>      ~stdio_filebuf();
># 110 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>      int
>      fd() { return this->_M_file.fd(); }
># 120 "/usr/include/c++/4.0.2/ext/stdio_filebuf.h" 3
>      std::__c_file*
>      file() { return this->_M_file.file(); }
>    };
>
>  template<typename _CharT, typename _Traits>
>    stdio_filebuf<_CharT, _Traits>::~stdio_filebuf()
>    { }
>
>  template<typename _CharT, typename _Traits>
>    stdio_filebuf<_CharT, _Traits>::
>    stdio_filebuf(int __fd, std::ios_base::openmode __mode, size_t __size)
>    {
>      this->_M_file.sys_open(__fd, __mode);
>      if (this->is_open())
> {
>   this->_M_mode = __mode;
>   this->_M_buf_size = __size;
>   this->_M_allocate_internal_buffer();
>   this->_M_reading = false;
>   this->_M_writing = false;
>   this->_M_set_buffer(-1);
> }
>    }
>
>  template<typename _CharT, typename _Traits>
>    stdio_filebuf<_CharT, _Traits>::
>    stdio_filebuf(std::__c_file* __f, std::ios_base::openmode __mode,
>    size_t __size)
>    {
>      this->_M_file.sys_open(__f, __mode);
>      if (this->is_open())
> {
>   this->_M_mode = __mode;
>   this->_M_buf_size = __size;
>   this->_M_allocate_internal_buffer();
>   this->_M_reading = false;
>   this->_M_writing = false;
>   this->_M_set_buffer(-1);
> }
>    }
>}
>
>#pragma GCC visibility pop
># 6 "y2storage/y2storage/y2storage/y2storage/StorageTypes.h" 2
>
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/Regex.h" 1
># 11 "y2storage/y2storage/y2storage/y2storage/y2storage/Regex.h"
># 1 "/usr/include/regex.h" 1 3 4
># 29 "/usr/include/regex.h" 3 4
>extern "C" {
># 45 "/usr/include/regex.h" 3 4
>typedef long int s_reg_t;
>typedef unsigned long int active_reg_t;
>
>
>
>
>
>
>typedef unsigned long int reg_syntax_t;
># 190 "/usr/include/regex.h" 3 4
>extern reg_syntax_t re_syntax_options;
># 312 "/usr/include/regex.h" 3 4
>typedef enum
>{
>
>  REG_ENOSYS = -1,
>
>
>  REG_NOERROR = 0,
>  REG_NOMATCH,
>
>
>
>  REG_BADPAT,
>  REG_ECOLLATE,
>  REG_ECTYPE,
>  REG_EESCAPE,
>  REG_ESUBREG,
>  REG_EBRACK,
>  REG_EPAREN,
>  REG_EBRACE,
>  REG_BADBR,
>  REG_ERANGE,
>  REG_ESPACE,
>  REG_BADRPT,
>
>
>  REG_EEND,
>  REG_ESIZE,
>  REG_ERPAREN
>} reg_errcode_t;
># 352 "/usr/include/regex.h" 3 4
>struct re_pattern_buffer
>{
>
>
>
>
>  unsigned char *buffer;
>
>
>  unsigned long int allocated;
>
>
>  unsigned long int used;
>
>
>  reg_syntax_t syntax;
>
>
>
>
>  char *fastmap;
>
>
>
>
>
>  char * translate;
>
>
>  size_t re_nsub;
>
>
>
>
>
>
>  unsigned can_be_null : 1;
># 397 "/usr/include/regex.h" 3 4
>  unsigned regs_allocated : 2;
>
>
>
>  unsigned fastmap_accurate : 1;
>
>
>
>  unsigned no_sub : 1;
>
>
>
>  unsigned not_bol : 1;
>
>
>  unsigned not_eol : 1;
>
>
>  unsigned newline_anchor : 1;
>
>
>};
>
>typedef struct re_pattern_buffer regex_t;
>
>
>typedef int regoff_t;
>
>
>
>
>struct re_registers
>{
>  unsigned num_regs;
>  regoff_t *start;
>  regoff_t *end;
>};
># 447 "/usr/include/regex.h" 3 4
>typedef struct
>{
>  regoff_t rm_so;
>  regoff_t rm_eo;
>} regmatch_t;
># 473 "/usr/include/regex.h" 3 4
>extern reg_syntax_t re_set_syntax (reg_syntax_t syntax);
>
>
>
>
>extern const char *re_compile_pattern
>  (const char *pattern, size_t length, struct re_pattern_buffer *buffer);
>
>
>
>
>
>
>extern int re_compile_fastmap (struct re_pattern_buffer *buffer);
>
>
>
>
>
>
>
>extern int re_search
>  (struct re_pattern_buffer *buffer, const char *string, int length, int start, int range, struct re_registers *regs);
>
>
>
>
>
>extern int re_search_2
>  (struct re_pattern_buffer *buffer, const char *string1, int length1, const char *string2, int length2, int start, int range, struct re_registers *regs, int stop);
>
>
>
>
>
>
>extern int re_match
>  (struct re_pattern_buffer *buffer, const char *string, int length, int start, struct re_registers *regs);
>
>
>
>
>extern int re_match_2
>  (struct re_pattern_buffer *buffer, const char *string1, int length1, const char *string2, int length2, int start, struct re_registers *regs, int stop);
># 533 "/usr/include/regex.h" 3 4
>extern void re_set_registers
>  (struct re_pattern_buffer *buffer, struct re_registers *regs, unsigned num_regs, regoff_t *starts, regoff_t *ends);
># 566 "/usr/include/regex.h" 3 4
>extern int regcomp (regex_t *__restrict __preg, const char *__restrict __pattern, int __cflags);
>
>
>
>extern int regexec (const regex_t *__restrict __preg, const char *__restrict __string, size_t __nmatch, regmatch_t __pmatch[], int __eflags);
>
>
>
>
>extern size_t regerror (int __errcode, const regex_t *__preg, char *__errbuf, size_t __errbuf_size);
>
>
>extern void regfree (regex_t *__preg);
>
>
>
>}
># 12 "y2storage/y2storage/y2storage/y2storage/y2storage/Regex.h" 2
>
>
>using std::string;
>
>class Regex
>{
>public:
>
>    Regex (const char*, int = 1, unsigned int = 10);
>    Regex (const string&, int = 1, unsigned int = 10);
>    ~Regex ();
>
>    string getPattern () const { return pattern; };
>    int getCflags () const { return cflags; }
>
>    bool match (const string&, int = 0) const;
>
>    regoff_t so (unsigned int) const;
>    regoff_t eo (unsigned int) const;
>
>    string cap (unsigned int) const;
>
>private:
>    const string pattern;
>    const int cflags;
>    const unsigned int nm;
>
>    mutable regex_t rx;
>    mutable int my_nl_msg_cat_cntr;
>    mutable regmatch_t* rm;
>
>    mutable string last_str;
>};
># 8 "y2storage/y2storage/y2storage/y2storage/StorageTypes.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/StorageInterface.h" 1
># 9 "y2storage/y2storage/y2storage/y2storage/StorageTypes.h" 2
>
>namespace storage
>{
>struct contOrder
>    {
>    contOrder(CType t) : order(0)
> {
> if( t==LOOP )
>     order=1;
> }
>    operator unsigned() const { return( order ); }
>    protected:
> unsigned order;
>    };
>
>typedef enum { DECREASE, INCREASE, FORMAT, MOUNT } CommitStage;
>
>struct commitAction
>    {
>    commitAction( CommitStage s, CType t, const string& d, bool destr=false,
>                  bool cont=false )
> { stage=s; type=t; descr=d; destructive=destr; container=cont; }
>    CommitStage stage;
>    CType type;
>    string descr;
>    bool destructive;
>    bool container;
>    bool operator==( const commitAction& rhs ) const
> { return( stage==rhs.stage && type==rhs.type ); }
>    bool operator<( const commitAction& rhs ) const
> {
> contOrder l(type);
> contOrder r(rhs.type);
>
> if( unsigned(r)==unsigned(l) )
>     {
>     if( stage==rhs.stage )
>  {
>  if( stage==DECREASE )
>      {
>      if( type!=rhs.type )
>   return( type>rhs.type );
>      else
>   return( container<rhs.container );
>      }
>  else
>      {
>      if( type!=rhs.type )
>   return( type<rhs.type );
>      else
>   return( container>rhs.container );
>      }
>  }
>     else
>  return( stage<rhs.stage );
>     }
> else
>     return( unsigned(l)<unsigned(r) );
> }
>    bool operator<=( const commitAction& rhs ) const
> { return( *this < rhs || *this == rhs ); }
>    bool operator>=( const commitAction& rhs ) const
> { return( ! (*this < rhs) ); }
>    bool operator>( const commitAction& rhs ) const
> { return( !(*this < rhs && *this == rhs) ); }
>    };
>
>struct usedBy
>    {
>    usedBy() : t(storage::UB_NONE) {;}
>    usedBy( storage::UsedByType typ, const string& n ) : t(typ), nm(n) {;}
>    void clear() { t=storage::UB_NONE; nm.erase(); }
>    void set( storage::UsedByType type, const string& n )
> { t=type; (t==storage::UB_NONE)?nm.erase():nm=n; }
>    bool operator==( const usedBy& rhs ) const
> { return( t==rhs.t && nm==rhs.nm ); }
>    bool operator!=( const usedBy& rhs ) const
> { return( !(*this==rhs)); }
>    inline operator string() const;
>
>    storage::UsedByType type() const { return( t ); }
>    const string& name() const { return( nm ); }
>    friend inline std::ostream& operator<< (std::ostream&, const usedBy& );
>
>    storage::UsedByType t;
>    string nm;
>    };
>
>inline usedBy::operator string() const
>    {
>    string st;
>    if( t!=storage::UB_NONE )
> {
> switch( t )
>     {
>     case storage::UB_LVM:
>  st = "lvm";
>  break;
>     case storage::UB_MD:
>  st = "md";
>  break;
>     case storage::UB_EVMS:
>  st = "evms";
>  break;
>     case storage::UB_DM:
>  st = "dm";
>  break;
>     default:
>  st = "UNKNOWN";
>  break;
>     }
> st += "[" + nm + "]";
> }
>    return( st );
>    }
>
>inline std::ostream& operator<< (std::ostream& s, const usedBy& d )
>    {
>    if( d.t!=storage::UB_NONE )
> {
> s << " UsedBy:" << string(d);
> }
>    return( s );
>    }
>
>struct match_string
>    {
>    match_string( const string& t ) : r(t) {};
>    bool operator()(const string&s) { return( r.match( s )); }
>    Regex r;
>    };
>
>struct find_begin
>    {
>    find_begin( const string& t ) : val(t) {};
>    bool operator()(const string&s) { return( s.find(val)==0 ); }
>    const string& val;
>    };
>
>}
># 6 "y2storage/y2storage/y2storage/Volume.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 1
>
>
>
># 1 "/usr/include/c++/4.0.2/functional" 1 3
># 51 "/usr/include/c++/4.0.2/functional" 3
>       
># 52 "/usr/include/c++/4.0.2/functional" 3
>#pragma GCC visibility push(default)
>
>
>
>
>
>#pragma GCC visibility pop
># 5 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
>
># 1 "/usr/include/c++/4.0.2/sstream" 1 3
># 42 "/usr/include/c++/4.0.2/sstream" 3
>       
># 43 "/usr/include/c++/4.0.2/sstream" 3
>#pragma GCC visibility push(default)
>
>
>
>
>namespace std
>{
># 62 "/usr/include/c++/4.0.2/sstream" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_stringbuf : public basic_streambuf<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>      typedef basic_streambuf<char_type, traits_type> __streambuf_type;
>      typedef basic_string<char_type, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>
>    protected:
>
>
>
>
>
>      ios_base::openmode _M_mode;
>
>
>      __string_type _M_string;
>
>    public:
># 100 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out)
>      : __streambuf_type(), _M_mode(__mode), _M_string()
>      { }
># 113 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_stringbuf(const __string_type& __str,
>        ios_base::openmode __mode = ios_base::in | ios_base::out)
>      : __streambuf_type(), _M_mode(), _M_string(__str.data(), __str.size())
>      { _M_stringbuf_init(__mode); }
># 128 "/usr/include/c++/4.0.2/sstream" 3
>      __string_type
>      str() const
>      {
> if (this->pptr())
>   {
>
>     if (this->pptr() > this->egptr())
>       return __string_type(this->pbase(), this->pptr());
>     else
>        return __string_type(this->pbase(), this->egptr());
>   }
> else
>   return _M_string;
>      }
># 150 "/usr/include/c++/4.0.2/sstream" 3
>      void
>      str(const __string_type& __s)
>      {
>
> _M_string.assign(__s.data(), __s.size());
> _M_stringbuf_init(this->_M_mode);
>      }
>
>    protected:
>
>      void
>      _M_stringbuf_init(ios_base::openmode __mode)
>      {
> this->_M_mode = __mode;
>
> __size_type __len = 0;
> if (this->_M_mode & (ios_base::ate | ios_base::app))
>   __len = _M_string.size();
> _M_sync(const_cast<char_type*>(_M_string.data()), 0, __len);
>      }
>
>      virtual int_type
>      underflow();
>
>      virtual int_type
>      pbackfail(int_type __c = traits_type::eof());
>
>      virtual int_type
>      overflow(int_type __c = traits_type::eof());
># 191 "/usr/include/c++/4.0.2/sstream" 3
>      virtual __streambuf_type*
>      setbuf(char_type* __s, streamsize __n)
>      {
> if (__s && __n >= 0)
>   {
>
>
>
>
>
>
>     _M_string.assign(__s, __n);
>
>
>     _M_sync(__s, 0, 0);
>   }
> return this;
>      }
>
>      virtual pos_type
>      seekoff(off_type __off, ios_base::seekdir __way,
>       ios_base::openmode __mode = ios_base::in | ios_base::out);
>
>      virtual pos_type
>      seekpos(pos_type __sp,
>       ios_base::openmode __mode = ios_base::in | ios_base::out);
>
>
>
>
>
>
>
>      void
>      _M_sync(char_type* __base, __size_type __i, __size_type __o)
>      {
> const bool __testin = this->_M_mode & ios_base::in;
> const bool __testout = this->_M_mode & ios_base::out;
> char_type* __end = __base + _M_string.size();
>
> if (__testin)
>   this->setg(__base, __base + __i, __end);
> if (__testout)
>   {
>
>
>
>     if (__base == _M_string.data())
>       this->setp(__base, __base + _M_string.capacity());
>     else
>       this->setp(__base, __end);
>     this->pbump(__o);
>
>
>
>     if (!__testin)
>       this->setg(__end, __end, __end);
>   }
>      }
>
>
>
>      void
>      _M_update_egptr()
>      {
> const bool __testin = this->_M_mode & ios_base::in;
>
> if (this->pptr() && this->pptr() > this->egptr())
>   if (__testin)
>     this->setg(this->eback(), this->gptr(), this->pptr());
>   else
>     this->setg(this->pptr(), this->pptr(), this->pptr());
>      }
>    };
># 276 "/usr/include/c++/4.0.2/sstream" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_istringstream : public basic_istream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;
>      typedef basic_istream<char_type, traits_type> __istream_type;
>
>    private:
>      __stringbuf_type _M_stringbuf;
>
>    public:
># 314 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_istringstream(ios_base::openmode __mode = ios_base::in)
>      : __istream_type(), _M_stringbuf(__mode | ios_base::in)
>      { this->init(&_M_stringbuf); }
># 334 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_istringstream(const __string_type& __str,
>     ios_base::openmode __mode = ios_base::in)
>      : __istream_type(), _M_stringbuf(__str, __mode | ios_base::in)
>      { this->init(&_M_stringbuf); }
>
>
>
>
>
>
>
>      ~basic_istringstream()
>      { }
># 356 "/usr/include/c++/4.0.2/sstream" 3
>      __stringbuf_type*
>      rdbuf() const
>      { return const_cast<__stringbuf_type*>(&_M_stringbuf); }
>
>
>
>
>
>      __string_type
>      str() const
>      { return _M_stringbuf.str(); }
>
>
>
>
>
>
>
>      void
>      str(const __string_type& __s)
>      { _M_stringbuf.str(__s); }
>    };
># 389 "/usr/include/c++/4.0.2/sstream" 3
>  template <typename _CharT, typename _Traits, typename _Alloc>
>    class basic_ostringstream : public basic_ostream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;
>      typedef basic_ostream<char_type, traits_type> __ostream_type;
>
>    private:
>      __stringbuf_type _M_stringbuf;
>
>    public:
># 427 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_ostringstream(ios_base::openmode __mode = ios_base::out)
>      : __ostream_type(), _M_stringbuf(__mode | ios_base::out)
>      { this->init(&_M_stringbuf); }
># 447 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_ostringstream(const __string_type& __str,
>     ios_base::openmode __mode = ios_base::out)
>      : __ostream_type(), _M_stringbuf(__str, __mode | ios_base::out)
>      { this->init(&_M_stringbuf); }
>
>
>
>
>
>
>
>      ~basic_ostringstream()
>      { }
># 469 "/usr/include/c++/4.0.2/sstream" 3
>      __stringbuf_type*
>      rdbuf() const
>      { return const_cast<__stringbuf_type*>(&_M_stringbuf); }
>
>
>
>
>
>      __string_type
>      str() const
>      { return _M_stringbuf.str(); }
>
>
>
>
>
>
>
>      void
>      str(const __string_type& __s)
>      { _M_stringbuf.str(__s); }
>    };
># 502 "/usr/include/c++/4.0.2/sstream" 3
>  template <typename _CharT, typename _Traits, typename _Alloc>
>    class basic_stringstream : public basic_iostream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;
>      typedef basic_iostream<char_type, traits_type> __iostream_type;
>
>    private:
>      __stringbuf_type _M_stringbuf;
>
>    public:
># 538 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in)
>      : __iostream_type(), _M_stringbuf(__m)
>      { this->init(&_M_stringbuf); }
># 556 "/usr/include/c++/4.0.2/sstream" 3
>      explicit
>      basic_stringstream(const __string_type& __str,
>    ios_base::openmode __m = ios_base::out | ios_base::in)
>      : __iostream_type(), _M_stringbuf(__str, __m)
>      { this->init(&_M_stringbuf); }
>
>
>
>
>
>
>
>      ~basic_stringstream()
>      { }
># 578 "/usr/include/c++/4.0.2/sstream" 3
>      __stringbuf_type*
>      rdbuf() const
>      { return const_cast<__stringbuf_type*>(&_M_stringbuf); }
>
>
>
>
>
>      __string_type
>      str() const
>      { return _M_stringbuf.str(); }
>
>
>
>
>
>
>
>      void
>      str(const __string_type& __s)
>      { _M_stringbuf.str(__s); }
>    };
>}
>
>
># 1 "/usr/include/c++/4.0.2/bits/sstream.tcc" 1 3
># 43 "/usr/include/c++/4.0.2/bits/sstream.tcc" 3
>       
># 44 "/usr/include/c++/4.0.2/bits/sstream.tcc" 3
>
># 1 "/usr/include/c++/4.0.2/sstream" 1 3
># 46 "/usr/include/c++/4.0.2/bits/sstream.tcc" 2 3
>
>namespace std
>{
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    pbackfail(int_type __c)
>    {
>      int_type __ret = traits_type::eof();
>      if (this->eback() < this->gptr())
> {
>
>
>   const bool __testeof = traits_type::eq_int_type(__c, __ret);
>   if (!__testeof)
>     {
>       const bool __testeq = traits_type::eq(traits_type::
>          to_char_type(__c),
>          this->gptr()[-1]);
>       const bool __testout = this->_M_mode & ios_base::out;
>       if (__testeq || __testout)
>  {
>    this->gbump(-1);
>    if (!__testeq)
>      *this->gptr() = traits_type::to_char_type(__c);
>    __ret = __c;
>  }
>     }
>   else
>     {
>       this->gbump(-1);
>       __ret = traits_type::not_eof(__c);
>     }
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    overflow(int_type __c)
>    {
>      const bool __testout = this->_M_mode & ios_base::out;
>      if (__builtin_expect(!__testout, false))
> return traits_type::eof();
>
>      const bool __testeof = traits_type::eq_int_type(__c, traits_type::eof());
>      if (__builtin_expect(__testeof, false))
> return traits_type::not_eof(__c);
>
>      const __size_type __capacity = _M_string.capacity();
>      const __size_type __max_size = _M_string.max_size();
>      const bool __testput = this->pptr() < this->epptr();
>      if (__builtin_expect(!__testput && __capacity == __max_size, false))
> return traits_type::eof();
>
>
>
>      if (!__testput)
> {
>
>
>
>
>
>
>   const __size_type __opt_len = std::max(__size_type(2 * __capacity),
>       __size_type(512));
>   const __size_type __len = std::min(__opt_len, __max_size);
>   __string_type __tmp;
>   __tmp.reserve(__len);
>   if (this->pbase())
>     __tmp.assign(this->pbase(), this->epptr() - this->pbase());
>   _M_string.swap(__tmp);
>   _M_sync(const_cast<char_type*>(_M_string.data()),
>    this->gptr() - this->eback(), this->pptr() - this->pbase());
> }
>      return this->sputc(traits_type::to_char_type(__c));
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    underflow()
>    {
>      int_type __ret = traits_type::eof();
>      const bool __testin = this->_M_mode & ios_base::in;
>      if (__testin)
> {
>
>   _M_update_egptr();
>
>   if (this->gptr() < this->egptr())
>     __ret = traits_type::to_int_type(*this->gptr());
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode)
>    {
>      pos_type __ret = pos_type(off_type(-1));
>      bool __testin = (ios_base::in & this->_M_mode & __mode) != 0;
>      bool __testout = (ios_base::out & this->_M_mode & __mode) != 0;
>      const bool __testboth = __testin && __testout && __way != ios_base::cur;
>      __testin &= !(__mode & ios_base::out);
>      __testout &= !(__mode & ios_base::in);
>
>
>
>      const char_type* __beg = __testin ? this->eback() : this->pbase();
>      if ((__beg || !__off) && (__testin || __testout || __testboth))
> {
>   _M_update_egptr();
>
>   off_type __newoffi = __off;
>   off_type __newoffo = __newoffi;
>   if (__way == ios_base::cur)
>     {
>       __newoffi += this->gptr() - __beg;
>       __newoffo += this->pptr() - __beg;
>     }
>   else if (__way == ios_base::end)
>     __newoffo = __newoffi += this->egptr() - __beg;
>
>   if ((__testin || __testboth)
>       && __newoffi >= 0
>       && this->egptr() - __beg >= __newoffi)
>     {
>       this->gbump((__beg + __newoffi) - this->gptr());
>       __ret = pos_type(__newoffi);
>     }
>   if ((__testout || __testboth)
>       && __newoffo >= 0
>       && this->egptr() - __beg >= __newoffo)
>     {
>       this->pbump((__beg + __newoffo) - this->pptr());
>       __ret = pos_type(__newoffo);
>     }
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    seekpos(pos_type __sp, ios_base::openmode __mode)
>    {
>      pos_type __ret = pos_type(off_type(-1));
>      const bool __testin = (ios_base::in & this->_M_mode & __mode) != 0;
>      const bool __testout = (ios_base::out & this->_M_mode & __mode) != 0;
>
>      const char_type* __beg = __testin ? this->eback() : this->pbase();
>      if (__beg && (__testin || __testout))
> {
>   _M_update_egptr();
>
>   const off_type __pos(__sp);
>   const bool __testpos = 0 <= __pos
>                          && __pos <= this->egptr() - __beg;
>   if (__testpos)
>     {
>       if (__testin)
>  this->gbump((__beg + __pos) - this->gptr());
>       if (__testout)
>                this->pbump((__beg + __pos) - this->pptr());
>       __ret = __sp;
>     }
> }
>      return __ret;
>    }
>
>
>
>
>
>  extern template class basic_stringbuf<char>;
>  extern template class basic_istringstream<char>;
>  extern template class basic_ostringstream<char>;
>  extern template class basic_stringstream<char>;
>
>
>  extern template class basic_stringbuf<wchar_t>;
>  extern template class basic_istringstream<wchar_t>;
>  extern template class basic_ostringstream<wchar_t>;
>  extern template class basic_stringstream<wchar_t>;
>
>
>}
># 604 "/usr/include/c++/4.0.2/sstream" 2 3
>
>
>#pragma GCC visibility pop
># 7 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
>
># 1 "/usr/include/c++/4.0.2/map" 1 3
># 63 "/usr/include/c++/4.0.2/map" 3
>       
># 64 "/usr/include/c++/4.0.2/map" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/include/c++/4.0.2/bits/stl_tree.h" 1 3
># 72 "/usr/include/c++/4.0.2/bits/stl_tree.h" 3
>namespace std
>{
># 90 "/usr/include/c++/4.0.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() { }
>
>      _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() { }
>
>      _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_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_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);
>
>      _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 static_cast<_Link_type>(this->_M_impl._M_header._M_left); }
>
>      const_iterator
>      begin() const
>      {
> return static_cast<_Const_Link_type>
>   (this->_M_impl._M_header._M_left);
>      }
>
>      iterator
>      end()
>      { return static_cast<_Link_type>(&this->_M_impl._M_header); }
>
>      const_iterator
>      end() const
>      { return 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);
>
>      iterator
>      insert_equal(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);
>
>      size_type
>      erase(const key_type& __x);
>
>      void
>      erase(iterator __first, 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>::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>::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 _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>
>    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 _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;
>    }
>}
># 67 "/usr/include/c++/4.0.2/map" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_map.h" 1 3
># 66 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>namespace std
>{
># 89 "/usr/include/c++/4.0.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;
>
>      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 _Rb_tree<key_type, value_type,
>         _Select1st<value_type>, key_compare, _Alloc> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::const_pointer const_pointer;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::const_reference const_reference;
>      typedef typename _Rep_type::allocator_type allocator_type;
>      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) { }
># 165 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      map(const map& __x)
>      : _M_t(__x._M_t) { }
># 177 "/usr/include/c++/4.0.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); }
># 193 "/usr/include/c++/4.0.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); }
># 215 "/usr/include/c++/4.0.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(); }
># 330 "/usr/include/c++/4.0.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;
>      }
># 358 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      std::pair<iterator,bool>
>      insert(const value_type& __x)
>      { return _M_t.insert_unique(__x); }
># 382 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      iterator
>      insert(iterator position, const value_type& __x)
>      { return _M_t.insert_unique(position, __x); }
># 394 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      template <typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_unique(__first, __last); }
># 408 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 423 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 438 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 453 "/usr/include/c++/4.0.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()); }
># 496 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 511 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 523 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
># 538 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 553 "/usr/include/c++/4.0.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); }
># 592 "/usr/include/c++/4.0.2/bits/stl_map.h" 3
>      std::pair<iterator,iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 611 "/usr/include/c++/4.0.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>&);
>    };
># 636 "/usr/include/c++/4.0.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; }
># 653 "/usr/include/c++/4.0.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); }
>}
># 68 "/usr/include/c++/4.0.2/map" 2 3
># 1 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 1 3
># 66 "/usr/include/c++/4.0.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/include/c++/4.0.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;
>
>      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 _Rb_tree<key_type, value_type,
>         _Select1st<value_type>, key_compare, _Alloc> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::const_pointer const_pointer;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::const_reference const_reference;
>      typedef typename _Rep_type::allocator_type allocator_type;
>      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) { }
># 181 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      multimap(const multimap& __x)
>      : _M_t(__x._M_t) { }
># 193 "/usr/include/c++/4.0.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); }
># 209 "/usr/include/c++/4.0.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); }
># 232 "/usr/include/c++/4.0.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(); }
># 346 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      insert(const value_type& __x)
>      { return _M_t.insert_equal(__x); }
># 370 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t.insert_equal(__position, __x); }
># 382 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      template <typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_equal(__first, __last); }
># 397 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 412 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 427 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 442 "/usr/include/c++/4.0.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()); }
># 485 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 500 "/usr/include/c++/4.0.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); }
># 524 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 539 "/usr/include/c++/4.0.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); }
># 576 "/usr/include/c++/4.0.2/bits/stl_multimap.h" 3
>      std::pair<iterator,iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 593 "/usr/include/c++/4.0.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>&);
>  };
># 618 "/usr/include/c++/4.0.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; }
># 635 "/usr/include/c++/4.0.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); }
>}
># 69 "/usr/include/c++/4.0.2/map" 2 3
>
>
>
>
>
>#pragma GCC visibility pop
># 9 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
>
>
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/IterPair.h" 1
>
>
>
># 1 "/usr/include/c++/4.0.2/iterator" 1 3
># 63 "/usr/include/c++/4.0.2/iterator" 3
>       
># 64 "/usr/include/c++/4.0.2/iterator" 3
>#pragma GCC visibility push(default)
># 73 "/usr/include/c++/4.0.2/iterator" 3
># 1 "/usr/include/c++/4.0.2/bits/stream_iterator.h" 1 3
># 38 "/usr/include/c++/4.0.2/bits/stream_iterator.h" 3
>       
># 39 "/usr/include/c++/4.0.2/bits/stream_iterator.h" 3
>
>
>
>namespace std
>{
>
>  template<typename _Tp, typename _CharT = char,
>           typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t>
>    class istream_iterator
>    : public iterator<input_iterator_tag, _Tp, _Dist, const _Tp*, const _Tp&>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef basic_istream<_CharT, _Traits> istream_type;
>
>    private:
>      istream_type* _M_stream;
>      _Tp _M_value;
>      bool _M_ok;
>
>    public:
>
>      istream_iterator()
>      : _M_stream(0), _M_ok(false) {}
>
>
>      istream_iterator(istream_type& __s)
>      : _M_stream(&__s)
>      { _M_read(); }
>
>      istream_iterator(const istream_iterator& __obj)
>      : _M_stream(__obj._M_stream), _M_value(__obj._M_value),
>        _M_ok(__obj._M_ok)
>      { }
>
>      const _Tp&
>      operator*() const
>      {
> ;
>
>
> return _M_value;
>      }
>
>      const _Tp*
>      operator->() const { return &(operator*()); }
>
>      istream_iterator&
>      operator++()
>      {
> ;
>
>
> _M_read();
> return *this;
>      }
>
>      istream_iterator
>      operator++(int)
>      {
> ;
>
>
> istream_iterator __tmp = *this;
> _M_read();
> return __tmp;
>      }
>
>      bool
>      _M_equal(const istream_iterator& __x) const
>      { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); }
>
>    private:
>      void
>      _M_read()
>      {
> _M_ok = (_M_stream && *_M_stream) ? true : false;
> if (_M_ok)
>   {
>     *_M_stream >> _M_value;
>     _M_ok = *_M_stream ? true : false;
>   }
>      }
>    };
>
>
>  template<typename _Tp, typename _CharT, typename _Traits, typename _Dist>
>    inline bool
>    operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,
>        const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)
>    { return __x._M_equal(__y); }
>
>
>  template <class _Tp, class _CharT, class _Traits, class _Dist>
>    inline bool
>    operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,
>        const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)
>    { return !__x._M_equal(__y); }
># 150 "/usr/include/c++/4.0.2/bits/stream_iterator.h" 3
>  template<typename _Tp, typename _CharT = char,
>           typename _Traits = char_traits<_CharT> >
>    class ostream_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    public:
>
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef basic_ostream<_CharT, _Traits> ostream_type;
>
>
>    private:
>      ostream_type* _M_stream;
>      const _CharT* _M_string;
>
>    public:
>
>      ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {}
># 181 "/usr/include/c++/4.0.2/bits/stream_iterator.h" 3
>      ostream_iterator(ostream_type& __s, const _CharT* __c)
>      : _M_stream(&__s), _M_string(__c) { }
>
>
>      ostream_iterator(const ostream_iterator& __obj)
>      : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { }
>
>
>
>      ostream_iterator&
>      operator=(const _Tp& __value)
>      {
> ;
>
>
> *_M_stream << __value;
> if (_M_string) *_M_stream << _M_string;
> return *this;
>      }
>
>      ostream_iterator&
>      operator*()
>      { return *this; }
>
>      ostream_iterator&
>      operator++()
>      { return *this; }
>
>      ostream_iterator&
>      operator++(int)
>      { return *this; }
>    };
>}
># 74 "/usr/include/c++/4.0.2/iterator" 2 3
>
>
>#pragma GCC visibility pop
># 5 "y2storage/y2storage/y2storage/y2storage/y2storage/IterPair.h" 2
>
>template< class Iter >
>class IterPair
>    {
>    public:
> typedef Iter itype;
> IterPair( const Iter b, const Iter e ) : m_begin(b), m_end(e) {}
> IterPair( const IterPair& x )
>     {
>     *this = x;
>     }
> IterPair& operator=(const IterPair& x)
>     {
>     m_begin=x.m_begin;
>     m_end=x.m_end;
>     return( *this );
>     }
> bool operator==(const IterPair& x) const
>     {
>     return( m_begin==x.m_begin && m_end==x.m_end );
>     }
> bool empty() const { return( m_begin==m_end ); }
> unsigned length() const { return( std::distance( m_begin, m_end )); }
> Iter begin() const { return( m_begin ); }
> Iter end() const { return( m_end ); }
>    protected:
> Iter m_begin;
> Iter m_end;
>    };
>
>template< class Container, class Iter >
>IterPair<Iter> MakeIterPair( Container& c )
>    {
>    return( IterPair<Iter>( c.begin(), c.end() ));
>    }
>
>template< class Pred, class Iter >
>class MakeCondIterPair : public IterPair<Iter>
>    {
>    typedef IterPair<Iter> _bclass;
>    public:
> MakeCondIterPair( const Iter& b, const Iter& e ) :
>     _bclass( b, e ) {}
>    };
># 12 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/FilterIterator.h" 1
>
>
>
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/y2storage/AppUtil.h" 1
># 9 "y2storage/y2storage/y2storage/y2storage/y2storage/y2storage/AppUtil.h"
># 1 "/usr/include/c++/4.0.2/cstdarg" 1 3
># 47 "/usr/include/c++/4.0.2/cstdarg" 3
>       
># 48 "/usr/include/c++/4.0.2/cstdarg" 3
>#pragma GCC visibility push(default)
>
># 1 "/usr/lib/gcc/i586-suse-linux/4.0.2/include/stdarg.h" 1 3 4
># 51 "/usr/include/c++/4.0.2/cstdarg" 2 3
>
>
>
>
>
>
>namespace std
>{
>  using ::va_list;
>}
>
>#pragma GCC visibility pop
># 10 "y2storage/y2storage/y2storage/y2storage/y2storage/y2storage/AppUtil.h" 2
>
>
>
>
>
>
>
>using std::string;
>
>class AsciiFile;
>
>bool searchFile(AsciiFile& File_Cr, string Pat_Cv, string& Line_Cr);
>bool searchFile(AsciiFile& File_Cr, string Pat_Cv, string& Line_Cr,
>  int& StartLine_ir);
>void timeMark(const char*const Text_pcv, bool PrintDiff_bi = true);
>void createPath(string Path_Cv);
>bool checkNormalFile(string Path_Cv);
>bool checkDir(string Path_Cv);
>
>string dupDash(const string& s);
>string extractNthWord(int Num_iv, string Line_Cv, bool GetRest_bi = false);
>std::list<string> splitString( const string& s, const string& delChars=" \t\n",
>                          bool multipleDelim=true, bool skipEmpty=true );
>string mergeString( const std::list<string>& l, const string& del=" " );
>std::map<string,string> makeMap( const std::list<string>& l,
>                                 const string& delim = "=",
>     const string& removeSur = " \t\n" );
>void removeLastIf(string& Text_Cr, char Char_cv);
>string kbyteToHumanString( unsigned long long size );
>string normalizeDevice( const string& dev );
>void normalizeDevice( string& dev );
>string undevDevice( const string& dev );
>void undevDevice( string& dev );
>bool runningFromSystem();
>void delay(int Microsec_iv);
>
>int createLogger( const string& component, const string& name,
>                  const string& logpath, const string& logfile );
>
>void log_msg( unsigned level, const char* file, unsigned line,
>              const char* func, const char* add_str, const char* format, ... )
> __attribute__ ((format(printf, 6, 7)));
>void log_msg( unsigned level, const char* file, unsigned line,
>              const char* func, const char* add_str, const char* format, ... )
> __attribute__ ((format(printf, 6, 7)));
># 77 "y2storage/y2storage/y2storage/y2storage/y2storage/y2storage/AppUtil.h"
>inline string sformat( const char* txt, ... )
>    {
>    unsigned s = strlen(txt)+3072;
>    char * mem = new char[s];
>    if( mem != __null )
> {
> va_list p;
> __builtin_va_start(p,txt);
> vsnprintf( mem, s-1, txt, p );
> __builtin_va_end(p);
> mem[s-1]=0;
> string s( mem );
> delete [] mem;
> return( s );
> }
>    else
> return( "" );
>    }
>
>inline const char* _(const char* msgid)
>    {
>    return( dgettext("storage", msgid) );
>    }
>
>inline const char* _(const char* msgid1, const char* msgid2, unsigned long int n)
>    {
>    return( dngettext ("storage", msgid1, msgid2, n) );
>    }
>
>
>
>extern bool system_cmd_testmode;
>extern const string app_ws;
># 5 "y2storage/y2storage/y2storage/y2storage/y2storage/FilterIterator.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/y2storage/IterPair.h" 1
># 6 "y2storage/y2storage/y2storage/y2storage/y2storage/FilterIterator.h" 2
>
>template< class Pred, class Iter >
>class FilterIterator : public std::iterator<std::bidirectional_iterator_tag,
>                                            typename Iter::value_type>
>    {
>    public:
> typedef typename Iter::value_type value_type;
> typedef typename Iter::reference reference;
> typedef typename Iter::pointer pointer;
> typedef typename Iter::difference_type difference_type;
> typedef typename Iter::iterator_category iterator_category;
>
>        FilterIterator() { }
>
> FilterIterator( const Iter& begin, const Iter& end, Pred f, bool setend=false ) :
>     m_begin(begin), m_end(end), m_cur(begin), m_f(f)
>     {
>     initialize( setend );
>     }
> FilterIterator( const IterPair<Iter>& p, Pred f, bool setend=false ) :
>     m_begin(p.begin()), m_end(p.end()), m_cur(p.begin()), m_f(f)
>     {
>     initialize( setend );
>     }
>
> FilterIterator( const FilterIterator& x )
>     {
>     copyMembers( x );
>     }
>
> FilterIterator& operator=(const FilterIterator& x)
>     {
>     copyMembers( x );
>     return *this;
>     }
>
> FilterIterator& operator++()
>     {
>     ++m_cur;
>     assertPred();
>     return *this;
>     }
> FilterIterator operator++(int)
>     {
>     log_msg( 1, "y2storage/y2storage/y2storage/y2storage/y2storage/FilterIterator.h", 50, __FUNCTION__, "[WARNING]", "Expensive ++ FilterIterator" );
>     FilterIterator tmp(*this);
>     ++m_cur;
>     assertPred();
>     return tmp;
>     }
>
> FilterIterator& operator--()
>     {
>     --m_cur;
>     assertPred(false);
>     return *this;
>     }
> FilterIterator operator--(int)
>     {
>     log_msg( 1, "y2storage/y2storage/y2storage/y2storage/y2storage/FilterIterator.h", 65, __FUNCTION__, "[WARNING]", "Expensive -- FilterIterator" );
>     FilterIterator tmp(*this);
>     --m_cur;
>     assertPred(false);
>     return tmp;
>     }
>
> value_type operator*() const
>     {
>     return( *m_cur );
>     }
>
> pointer operator->() const
>     {
>     return( &(*m_cur) );
>     }
> bool operator==(const FilterIterator& x) const
>     {
>     return( m_cur == x.cur() );
>     }
> bool operator!=(const FilterIterator& x) const
>     {
>     return( m_cur != x.cur() );
>     }
>
> Pred pred() const {return m_f;}
> Iter end() const {return m_end;}
> Iter cur() const {return m_cur;}
> Iter begin() const {return m_begin;}
>
>    private:
> Iter m_begin;
> Iter m_end;
> Iter m_cur;
> Pred m_f;
>
> void initialize( bool setend )
>     {
>     if( setend )
>  m_cur = m_end;
>     else
>  assertPred();
>     }
>
> void copyMembers( const FilterIterator& x )
>     {
>     m_begin = x.begin();
>     m_end = x.end();
>     m_cur = x.cur();
>     m_f = x.pred();
>     }
>
>
> void assertPred( bool forward=true )
>     {
>     if( forward )
>  while( m_cur!=m_end && !m_f(**m_cur) )
>      ++m_cur;
>     else
>  while( m_cur!=m_begin && !m_f(**m_cur) )
>      --m_cur;
>     };
>
>    };
># 13 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/DerefIterator.h" 1
>
>
>
>
>
>template< class Iter, class Value >
>class DerefIterator : public Iter
>    {
>    public:
> typedef Value value_type;
> typedef Value& reference;
> typedef Value* pointer;
> typedef typename Iter::difference_type difference_type;
> typedef typename Iter::iterator_category iterator_category;
>
>        DerefIterator() {}
>
> DerefIterator( const Iter& i ) : Iter(i) {}
>
> DerefIterator& operator++() { Iter::operator++(); return(*this); }
> DerefIterator operator++(int)
>     {
>     log_msg( 1, "y2storage/y2storage/y2storage/y2storage/y2storage/DerefIterator.h", 23, __FUNCTION__, "[WARNING]", "Expensive ++ DerefIterator" );
>     DerefIterator tmp(*this);
>     Iter::operator++();
>     return(tmp);
>     }
> DerefIterator& operator--() { Iter::operator--(); return(*this); }
> DerefIterator operator--(int)
>     {
>     log_msg( 1, "y2storage/y2storage/y2storage/y2storage/y2storage/DerefIterator.h", 31, __FUNCTION__, "[WARNING]", "Expensive -- DerefIterator" );
>     DerefIterator tmp(*this);
>     Iter::operator--();
>     return(tmp);
>     }
>
> reference operator*() const
>     {
>     return( *Iter::operator*() );
>     }
>
> pointer operator->() const
>     {
>     return( Iter::operator*() );
>     }
>    };
># 14 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
># 1 "y2storage/y2storage/y2storage/y2storage/y2storage/AppUtil.h" 1
># 15 "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h" 2
>
>template< class Value >
>class CheckFnc
>    {
>    public:
>        CheckFnc( bool (* ChkFnc)( Value& )=__null ) : m_check(ChkFnc) {}
> bool operator()(Value& d) const
>     { return(m_check==__null || (*m_check)(d)); }
> private:
>     bool (* m_check)( Value& d );
>    };
>
>template< class Pred, class Iter >
>class ContainerIter : public FilterIterator< Pred, Iter >
>    {
>    typedef FilterIterator< Pred, Iter > _bclass;
>    public:
> ContainerIter() : _bclass() {}
> ContainerIter( const Iter& b, const Iter& e, const Pred& p,
>         bool atend=false ) :
>     _bclass(b, e, p, atend ) {}
> ContainerIter( const IterPair<Iter>& pair, const Pred& p,
>         bool atend=false ) :
>     _bclass(pair, p, atend ) {}
> ContainerIter( const ContainerIter& i) { *this=i;}
>    };
>
>template< class Pred, class Iter, class Value >
>class ContainerDerIter : public DerefIterator<Iter,Value>
>    {
>    typedef DerefIterator<Iter,Value> _bclass;
>    public:
> ContainerDerIter() : _bclass() {}
> ContainerDerIter( const _bclass& i ) : _bclass(i) {}
> ContainerDerIter( const ContainerDerIter& i) { *this=i;}
>    };
>
>template< class Iter, class CastResult >
>class CastIterator : public Iter
>    {
>    public:
> typedef CastResult value_type;
> typedef CastResult& reference;
> typedef CastResult* pointer;
>
> CastIterator() : Iter() {}
> CastIterator( const Iter& i ) : Iter( i ) {}
> CastIterator( const CastIterator& i ) { *this=i; }
> CastResult operator*() const
>     {
>     return( static_cast<CastResult>(Iter::operator*()) );
>     }
> CastResult* operator->() const
>     {
>     return( static_cast<CastResult*>(Iter::operator->()) );
>     }
> CastIterator& operator++()
>     {
>     Iter::operator++(); return(*this);
>     }
> CastIterator operator++(int)
>     {
>     log_msg( 1, "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h", 77, __FUNCTION__, "[WARNING]", "Expensive ++ CastIterator" );
>     CastIterator tmp(*this);
>     Iter::operator++();
>     return(tmp);
>     }
> CastIterator& operator--()
>     {
>     Iter::operator--(); return(*this);
>     }
> CastIterator operator--(int)
>     {
>     log_msg( 1, "y2storage/y2storage/y2storage/y2storage/StorageTmpl.h", 88, __FUNCTION__, "[WARNING]", "Expensive -- CastIterator" );
>     CastIterator tmp(*this);
>     Iter::operator--();
>     return(tmp);
>     }
>    };
>
>template < class Checker, class ContIter, class Iter, class Value >
>class CheckerIterator : public Checker, public ContIter
>    {
>    public:
> CheckerIterator() {};
> CheckerIterator( const Iter& b, const Iter& e,
>    bool (* CheckFnc)( const Value& )=__null,
>    bool atend=false ) :
>     Checker( CheckFnc ),
>     ContIter( b, e, *this, atend ) {}
> CheckerIterator( const IterPair<Iter>& p,
>    bool (* CheckFnc)( const Value& )=__null,
>    bool atend=false ) :
>     Checker( CheckFnc ),
>     ContIter( p, *this, atend ) {}
> CheckerIterator( const CheckerIterator& i ) { *this=i; }
>    };
>
>template < class C >
>void pointerIntoSortedList( std::list<C*>& l, C* e )
>    {
>    typename std::list<C*>::iterator i = l.begin();
>    while( i!=l.end() && **i < *e )
> i++;
>    l.insert( i, e );
>    }
>
>
>template<class Num> string decString(Num number)
>    {
>    std::ostringstream num_str;
>    num_str << number;
>    return( num_str.str() );
>    }
>
>template<class Num> string hexString(Num number)
>    {
>    std::ostringstream num_str;
>    num_str << std::hex << number;
>    return( num_str.str() );
>    }
>
>template<class Value> void operator>>( const string& d, Value& v)
>    {
>    std::istringstream Data( d );
>    Data >> v;
>    }
>
>template<class Value> std::ostream& operator<<( std::ostream& s, const std::list<Value>& l )
>    {
>    s << "<";
>    for( typename std::list<Value>::const_iterator i=l.begin(); i!=l.end(); i++ )
> {
> if( i!=l.begin() )
>     s << " ";
> s << *i;
> }
>    s << ">";
>    return( s );
>    }
>
>template<class Value> std::ostream& operator<<( std::ostream& s, const std::deque<Value>& l )
>    {
>    s << "<";
>    for( typename std::deque<Value>::const_iterator i=l.begin(); i!=l.end(); i++ )
> {
> if( i!=l.begin() )
>     s << " ";
> s << *i;
> }
>    s << ">";
>    return( s );
>    }
>
>template<class F, class S> std::ostream& operator<<( std::ostream& s, const std::pair<F,S>& p )
>    {
>    s << "[" << p.first << ":" << p.second << "]";
>    return( s );
>    }
>
>template<class Key, class Value> std::ostream& operator<<( std::ostream& s, const std::map<Key,Value>& m )
>    {
>    s << "<";
>    for( typename std::map<Key,Value>::const_iterator i=m.begin(); i!=m.end(); i++ )
> {
> if( i!=m.begin() )
>     s << " ";
> s << i->first << ":" << i->second;
> }
>    s << ">";
>    return( s );
>    }
>
>template< class Val >
>struct cont_less : public std::binary_function<Val*,Val*,bool>
>    {
>    bool operator()(const Val* __x, const Val* __y) const { return *__x < *__y; }
>    };
>
>template <class T, unsigned int sz>
>  inline unsigned int lengthof (T (&)[sz]) { return sz; }
># 7 "y2storage/y2storage/y2storage/Volume.h" 2
>
>class SystemCmd;
>class ProcMounts;
>class EtcFstab;
>class FstabEntry;
>class Container;
>class Storage;
>
>class Volume
>    {
>    friend class Storage;
>
>    public:
> Volume( const Container& d, unsigned Pnr, unsigned long long SizeK );
> Volume( const Container& d, const string& PName, unsigned long long SizeK );
> Volume( const Container& d );
> Volume( const Volume& );
> Volume& operator=( const Volume& );
>
> virtual ~Volume();
>
> const string& device() const { return dev; }
> const string& mountDevice() const { return( is_loop?loop_dev:dev ); }
> const string& loopDevice() const { return( loop_dev ); }
> const Container* getContainer() const { return cont; }
> storage::CType cType() const;
> bool deleted() const { return del; }
> bool created() const { return create; }
> void setDeleted( bool val=true ) { del=val; }
> void setCreated( bool val=true ) { create=val; }
> void setReadonly( bool val=true ) { ronly=val; }
> bool ignoreFstab() const { return( ignore_fstab ); }
> void setIgnoreFstab( bool val=true ) { ignore_fstab=val; }
> void setFstabAdded( bool val=true ) { fstab_added=val; }
> bool fstabAdded() const { return( fstab_added ); }
> const storage::usedBy& getUsedBy() const{ return( uby ); }
> storage::UsedByType getUsedByType() const { return( uby.type() ); }
> const string& usedByName() const { return( uby.name() ); }
> void setUsedBy( storage::UsedByType t, const string& name ) { uby.set( t, name );}
>
> virtual int setFormat( bool format=true, storage::FsType fs=storage::REISERFS );
> void formattingDone() { format=false; detected_fs=fs; }
> bool getFormat() const { return format; }
> int changeFstabOptions( const string& options );
> int changeMountBy( storage::MountByType mby );
> virtual int changeMount( const string& m );
> bool loop() const { return is_loop; }
> bool loopActive() const { return( is_loop&&loop_active ); }
> bool needLosetup() const { return is_loop!=loop_active; }
> const string& getUuid() const { return uuid; }
> const string& getLabel() const { return label; }
> int setLabel( const string& val );
> bool needLabel() const { return( label!=orig_label ); }
> storage::EncryptType getEncryption() const { return encryption; }
> void setEncryption( storage::EncryptType val=storage::ENC_TWOFISH )
>     { encryption=orig_encryption=val; }
> int setEncryption( bool val );
> const string& getCryptPwd() const { return crypt_pwd; }
> int setCryptPwd( const string& val );
> void clearCryptPwd() { crypt_pwd.erase(); }
> const string& getMount() const { return mp; }
> bool needRemount() const;
> bool needShrink() const { return(size_k<orig_size_k); }
> bool needExtend() const { return(size_k>orig_size_k); }
> long long extendSize() const { return(orig_size_k-size_k);}
> storage::FsType getFs() const { return fs; }
> void setFs( storage::FsType val ) { detected_fs=fs=val; }
> storage::MountByType getMountBy() const { return mount_by; }
> const string& getFstabOption() const { return fstab_opt; }
> void setFstabOption( const string& val ) { fstab_opt=val; }
> bool needFstabUpdate() const
>     { return( !ignore_fstab &&
>               (fstab_opt!=orig_fstab_opt || mount_by!=orig_mount_by ||
>                encryption!=orig_encryption) ); }
> const string& getMkfsOption() const { return mkfs_opt; }
> int setMkfsOption( const string& val ) { mkfs_opt=val; return 0; }
> const std::list<string>& altNames() const { return( alt_names ); }
> unsigned nr() const { return num; }
> unsigned long long sizeK() const { return size_k; }
> unsigned long long origSizeK() const { return orig_size_k; }
> const string& name() const { return nm; }
> unsigned long minorNr() const { return mnr; }
> unsigned long majorNr() const { return mjr; }
> void setMajorMinor( unsigned long Major, unsigned long Minor )
>     { mjr=Major; mnr=Minor; }
> void setSize( unsigned long long SizeK ) { size_k=orig_size_k=SizeK; }
> virtual void setResizedSize( unsigned long long SizeK ) { size_k=SizeK; }
> virtual void forgetResize() { size_k=orig_size_k; }
> virtual bool canUseDevice() const;
>
>        bool operator== ( const Volume& rhs ) const;
>        bool operator!= ( const Volume& rhs ) const
>            { return( !(*this==rhs) ); }
>        bool operator< ( const Volume& rhs ) const;
>        bool operator<= ( const Volume& rhs ) const
>            { return( *this<rhs || *this==rhs ); }
>        bool operator>= ( const Volume& rhs ) const
>            { return( !(*this<rhs) ); }
>        bool operator> ( const Volume& rhs ) const
>            { return( !(*this<=rhs) ); }
> bool equalContent( const Volume& rhs ) const;
> string logDifference( const Volume& c ) const;
> friend std::ostream& operator<< (std::ostream& s, const Volume &v );
>
> int prepareRemove();
> int umount( const string& mp="" );
> int loUnsetup();
> int mount( const string& mp="" );
> int canResize( unsigned long long newSizeK ) const;
> int doMount();
> int doFormat();
> int doLosetup();
> int doSetLabel();
> int doFstabUpdate();
> int resizeFs();
> void fstabUpdateDone();
> bool isMounted() const { return( is_mounted ); }
> virtual string removeText(bool doing=true) const;
> virtual string createText(bool doing=true) const;
> virtual string resizeText(bool doing=true) const;
> virtual string formatText(bool doing=true) const;
> virtual void getCommitActions( std::list<storage::commitAction*>& l ) const;
> string mountText( bool doing=true ) const;
> string labelText( bool doing=true ) const;
> string losetupText( bool doing=true ) const;
> string fstabUpdateText() const;
> string sizeString() const;
> string bootMount() const;
> bool optNoauto() const;
> bool inCrypto() const { return( is_loop && !optNoauto() ); }
> virtual void print( std::ostream& s ) const { s << *this; }
> int getFreeLoop();
> void getInfo( storage::VolumeInfo& info ) const;
> void mergeFstabInfo( storage::VolumeInfo& tinfo, const FstabEntry& fste ) const;
> static bool loopInUse( Storage* sto, const string& loopdev );
>
> struct SkipDeleted
>     {
>     bool operator()(const Volume&d) const { return( !d.deleted());}
>     };
> static SkipDeleted SkipDel;
> static bool notDeleted( const Volume&d ) { return( !d.deleted() ); }
> static bool isDeleted( const Volume&d ) { return( d.deleted() ); }
> static bool getMajorMinor( const string& device,
>                            unsigned long& Major, unsigned long& Minor );
> static bool loopStringNum( const string& name, unsigned& num );
> static storage::EncryptType toEncType( const string& val );
> static storage::FsType toFsType( const string& val );
> static storage::MountByType toMountByType( const string& val );
> const string& fsTypeString() const { return fs_names[fs]; }
> static const string& fsTypeString( const storage::FsType type )
>     { return fs_names[type]; }
> static const string& encTypeString( const storage::EncryptType type )
>     { return enc_names[type]; }
> static const string& mbyTypeString( const storage::MountByType type )
>     { return mb_names[type]; }
>
>
>    protected:
> void init();
> void setNameDev();
> int checkDevice();
> int checkDevice( const string& device );
> void getFsData( SystemCmd& blkidData );
> void getLoopData( SystemCmd& loopData );
> void getMountData( const ProcMounts& mountData );
> void getFstabData( EtcFstab& fstabData );
> void getTestmodeData( const string& data );
> string getMountByString( storage::MountByType mby, const string& dev,
>                          const string& uuid, const string& label ) const;
> void setExtError( const SystemCmd& cmd, bool serr=true );
>
> std::ostream& logVolume( std::ostream& file ) const;
> string getLosetupCmd( storage::EncryptType e, const string& pwdfile ) const;
> storage::EncryptType detectLoopEncryption();
>
> const Container* const cont;
> bool numeric;
> bool create;
> bool del;
> bool format;
> bool silent;
> bool fstab_added;
> storage::FsType fs;
> storage::FsType detected_fs;
> storage::MountByType mount_by;
> storage::MountByType orig_mount_by;
> string uuid;
> string label;
> string orig_label;
> string mp;
> string orig_mp;
> string fstab_opt;
> string orig_fstab_opt;
> string mkfs_opt;
> bool is_loop;
> bool is_mounted;
> bool ignore_fstab;
> bool loop_active;
> bool ronly;
> storage::EncryptType encryption;
> storage::EncryptType orig_encryption;
> string loop_dev;
> string fstab_loop_dev;
> string crypt_pwd;
> string nm;
> std::list<string> alt_names;
> unsigned num;
> unsigned long long size_k;
> unsigned long long orig_size_k;
> string dev;
> unsigned long mnr;
> unsigned long mjr;
> storage::usedBy uby;
>
> static string fs_names[storage::FSNONE+1];
> static string mb_names[storage::MOUNTBY_LABEL+1];
> static string enc_names[storage::ENC_UNKNOWN+1];
>
> mutable storage::VolumeInfo info;
>    };
># 7 "y2storage/y2storage/Container.h" 2
># 1 "y2storage/y2storage/y2storage/StorageTypes.h" 1
># 8 "y2storage/y2storage/Container.h" 2
># 1 "y2storage/y2storage/y2storage/StorageTmpl.h" 1
># 9 "y2storage/y2storage/Container.h" 2
>
>class Container
>    {
>    friend class Storage;
>    protected:
> template<typename L1, typename L2> friend class ListListIterator;
>
> typedef std::list<Volume*> VCont;
> typedef VCont::iterator VIter;
> typedef VCont::const_iterator CVIter;
> typedef VCont::reverse_iterator RVIter;
> typedef VCont::const_reverse_iterator CRVIter;
>
>
>    public:
> bool operator== ( const Container& rhs ) const
>     { return( typ == rhs.typ && nm == rhs.nm && del == rhs.del ); }
> bool operator!= ( const Container& rhs ) const
>     { return( !(*this==rhs) ); }
> bool operator< ( const Container& rhs ) const
>     {
>     if( typ != rhs.typ )
>  return( typ<rhs.typ );
>     else if( nm != rhs.nm )
>  return( nm<rhs.nm );
>     else
>  return( !del );
>     }
> bool operator<= ( const Container& rhs ) const
>     { return( *this<rhs || *this==rhs ); }
> bool operator>= ( const Container& rhs ) const
>     { return( !(*this<rhs) ); }
> bool operator> ( const Container& rhs ) const
>     { return( !(*this<=rhs) ); }
> bool equalContent( const Container& rhs ) const;
> string logDifference( const Container& c ) const;
>
> virtual void getCommitActions( std::list<storage::commitAction*>& l ) const;
> virtual int getToCommit( storage::CommitStage stage, std::list<Container*>& col,
>                          std::list<Volume*>& vol );
> virtual int commitChanges( storage::CommitStage stage );
> virtual int commitChanges( storage::CommitStage stage, Volume* vol );
> unsigned numVolumes() const;
> void getInfo( storage::ContainerInfo& info ) const;
> bool findVolume( const string& device, Volume*& vol );
>
>
>    protected:
>
> template< class Pred >
>     struct ConstVolumePI { typedef ContainerIter<Pred, CVIter> type; };
> template< class Pred >
>     struct VolumePI { typedef ContainerIter<Pred, VIter> type; };
> template< class Pred >
>     struct VolumeI { typedef ContainerDerIter<Pred, typename VolumePI<Pred>::type, Volume> type; };
> typedef CheckFnc<const Volume> CheckFncVol;
> typedef CheckerIterator< CheckFncVol, ConstVolumePI<CheckFncVol>::type,
>                          CVIter, Volume> ConstVolPIterator;
> typedef CheckerIterator< CheckFncVol, VolumePI<CheckFncVol>::type,
>                          VIter, Volume> VolPIterator;
> typedef DerefIterator<VolPIterator,Volume> VolIterator;
> typedef IterPair<VolIterator> VolPair;
>
>    public:
>
> template< class Pred >
>     struct ConstVolumeI { typedef ContainerDerIter<Pred, typename ConstVolumePI<Pred>::type, const Volume> type; };
> template< class Pred >
>     struct VolCondIPair { typedef MakeCondIterPair<Pred, typename ConstVolumeI<Pred>::type> type;};
> typedef DerefIterator<ConstVolPIterator,const Volume> ConstVolIterator;
> typedef IterPair<ConstVolIterator> ConstVolPair;
>
>
> ConstVolPair volPair( bool (* CheckFnc)( const Volume& )=__null ) const
>     {
>     return( ConstVolPair( volBegin( CheckFnc ), volEnd( CheckFnc ) ));
>     }
> ConstVolIterator volBegin( bool (* CheckFnc)( const Volume& )=__null ) const
>     {
>     return( ConstVolIterator( ConstVolPIterator(vols.begin(), vols.end(), CheckFnc )) );
>     }
> ConstVolIterator volEnd( bool (* CheckFnc)( const Volume& )=__null ) const
>     {
>     return( ConstVolIterator( ConstVolPIterator(vols.begin(), vols.end(), CheckFnc, true )) );
>     }
>
> template< class Pred > typename VolCondIPair<Pred>::type volCondPair( const Pred& p ) const
>     {
>     return( VolCondIPair<Pred>::type( volCondBegin( p ), volCondEnd( p ) ) );
>     }
> template< class Pred > typename ConstVolumeI<Pred>::type volCondBegin( const Pred& p ) const
>     {
>     return( ConstVolumeI<Pred>::type( vols.begin(), vols.end(), p ) );
>     }
> template< class Pred > typename ConstVolumeI<Pred>::type volCondEnd( const Pred& p ) const
>     {
>     return( ConstVolumeI<Pred>::type( vols.begin(), vols.end(), p, true ) );
>     }
>
>    protected:
>
> VolPair volPair( bool (* CheckFnc)( const Volume& )=__null )
>     {
>     return( VolPair( vBegin( CheckFnc ), vEnd( CheckFnc ) ));
>     }
> VolIterator vBegin( bool (* CheckFnc)( const Volume& )=__null )
>     {
>     return( VolIterator( VolPIterator(vols.begin(), vols.end(), CheckFnc )) );
>     }
> VolIterator vEnd( bool (* CheckFnc)( const Volume& )=__null )
>     {
>     return( VolIterator( VolPIterator(vols.begin(), vols.end(), CheckFnc, true )) );
>     }
>
>    public:
> Container( Storage * const, const string& Name, storage::CType typ );
> Container( const Container& );
> Storage * const getStorage() const { return sto; }
> virtual ~Container();
> const string& name() const { return nm; }
> const string& device() const { return dev; }
> storage::CType type() const { return typ; }
> bool deleted() const { return del; }
> bool created() const { return create; }
> void setDeleted( bool val=true ) { del=val; }
> void setCreated( bool val=true ) { create=val; }
> void setSilent( bool val=true ) { silent=val; }
> void setUsedBy( storage::UsedByType t, const string& name ) { uby.set( t, name );}
> const storage::usedBy& getUsedBy() const { return( uby ); }
> storage::UsedByType getUsedByType() const { return( uby.type() ); }
> const string& usedByName() const { return( uby.name() ); }
> bool readonly() const { return ronly; }
> virtual string removeText(bool doing=true) const;
> virtual string createText(bool doing=true) const;
> virtual int resizeVolume( Volume* v, unsigned long long newSize );
> virtual int removeVolume( Volume* v );
> static storage::CType const staticType() { return storage::CUNKNOWN; }
> friend std::ostream& operator<< (std::ostream& s, const Container &c );
> virtual Container* getCopy() const { return( new Container( *this ) ); }
> bool compareContainer( const Container* c, bool verbose ) const;
> void setExtError( const string& txt ) const;
> void setExtError( const SystemCmd& cmd, bool serr=true ) const;
>
>    protected:
> typedef CVIter ConstPlainIterator;
> ConstPlainIterator begin() const { return vols.begin(); }
> ConstPlainIterator end() const { return vols.end(); }
>
> typedef VIter PlainIterator;
> PlainIterator begin() { return vols.begin(); }
> PlainIterator end() { return vols.end(); }
>
> virtual void print( std::ostream& s ) const { s << *this; }
> void addToList( Volume* e )
>     { pointerIntoSortedList<Volume>( vols, e ); }
> bool removeFromList( Volume* e );
> virtual int doCreate( Volume * v );
> virtual int doRemove( Volume * v );
> virtual int doResize( Volume * v );
> virtual void logData( const string& Dir ) {;}
> Container& operator=( const Container& );
>
> static string type_names[storage::EVMS+1];
> static unsigned order[storage::EVMS+1];
>
> Storage * const sto;
> storage::CType typ;
> string nm;
> string dev;
> bool del;
> bool create;
> bool silent;
> bool ronly;
> storage::usedBy uby;
> VCont vols;
> mutable storage::ContainerInfo info;
>    };
># 7 "y2storage/Disk.h" 2
># 1 "y2storage/y2storage/Partition.h" 1
>
>
>
># 1 "y2storage/y2storage/y2storage/StorageInterface.h" 1
># 5 "y2storage/y2storage/Partition.h" 2
>
># 1 "y2storage/y2storage/y2storage/Region.h" 1
>
>
>
>
>
>class Region
>    {
>    public:
> Region() : s(0), l(0) {};
> Region( unsigned long start, unsigned long len ) : s(start), l(len) {};
> Region( const Region& x )
>     { *this = x; }
> Region& operator=(const Region& r)
>     { s = r.start(); l = r.len(); return( *this ); }
> bool doIntersect( const Region& r ) const
>     { return( r.start() <= end() && r.end() >= start() ); }
> Region intersect( const Region& r ) const
>     {
>     Region ret;
>     if( r.start() <= end() && r.end() >= start() )
>  {
>  unsigned long s = std::max( r.start(), start() );
>  unsigned long e = std::min( r.end(), end() );
>  ret = Region( s, e-s+1 );
>  }
>     return( ret );
>     }
> bool inside( const Region& r ) const
>     { return( start()>=r.start() && end() <= r.end() ); }
> bool operator==(const Region& r) const
>     { return( r.start()==s && r.len()==l ); }
> bool operator!=(const Region& r) const
>     { return( ! (*this==r) ); }
> bool operator<(const Region& r) const
>     { return( s < r.start() ); }
> bool operator>(const Region& r) const
>     { return( s > r.start() ); }
> unsigned long start() const { return( s ); }
> unsigned long end() const { return( s+l-1 ); }
> unsigned long len() const { return( l ); }
>    protected:
> unsigned long s;
> unsigned long l;
>    };
>
>inline std::ostream& operator<< (std::ostream& s, const Region &p )
>    {
>    s << "[" << p.start() << "," << p.len() << "]";
>    return( s );
>    }
>
>inline std::istream& operator>> (std::istream& s, Region &p )
>    {
>    unsigned long start, len;
>    s >> start >> len;
>    p = Region( start, len );
>    return( s );
>    }
># 7 "y2storage/y2storage/Partition.h" 2
>
>class Disk;
>
>class Partition : public Volume
>    {
>    public:
>
> typedef enum { ID_DOS16=0x6, ID_DOS=0x0c, ID_NTFS=0x07,
>                ID_EXTENDED=0x0f,
>         ID_LINUX=0x83, ID_SWAP=0x82, ID_LVM=0x8e, ID_RAID=0xfd,
>         ID_APPLE_OTHER=0x101, ID_APPLE_HFS=0x102,
>         ID_GPT_BOOT=0x103, ID_GPT_SERVICE=0x104 } IdNum;
>
> Partition( const Disk& d, unsigned Pnr, unsigned long long SizeK,
>            unsigned long Start, unsigned long CSize,
>     storage::PartitionType Type,
>     unsigned id=ID_LINUX, bool Boot=false );
> Partition( const Disk& d, const string& Data );
> Partition( const Disk& d, const Partition& d );
> virtual ~Partition();
>
> unsigned long cylStart() const { return reg.start(); }
> unsigned long cylSize() const { return reg.len(); }
> unsigned long cylEnd() const { return reg.start()+reg.len()-1; }
> const Region& region() const { return reg; }
> bool intersectArea( const Region& r, unsigned fuzz=0 ) const;
> bool contains( const Region& r, unsigned fuzz=0 ) const;
> unsigned OrigNr() const { return( orig_num ); }
> bool boot() const { return bootflag; }
> unsigned id() const { return idt; }
> storage::PartitionType type() const { return typ; }
> std::ostream& logData( std::ostream& file ) const;
> void changeRegion( unsigned long Start, unsigned long CSize,
>                    unsigned long long SizeK );
> void changeNumber( unsigned new_num );
> void changeId( unsigned id );
> void changeIdDone();
> void unChangeId();
> string removeText( bool doing=true ) const;
> string createText( bool doing=true ) const;
> string formatText(bool doing=true) const;
> string resizeText(bool doing=true) const;
> void getCommitActions( std::list<storage::commitAction*>& l ) const;
> string setTypeText( bool doing=true ) const;
> int setFormat( bool format=true, storage::FsType fs=storage::REISERFS );
> int changeMount( const string& val );
> const Disk* const disk() const;
> bool isWindows() const;
> friend std::ostream& operator<< (std::ostream& s, const Partition &p );
> static bool notDeleted( const Partition&d ) { return( !d.deleted() ); }
> static bool toChangeId( const Partition&d ) { return( !d.deleted() && d.idt!=d.orig_id ); }
> virtual void print( std::ostream& s ) const { s << *this; }
> void setResizedSize( unsigned long long SizeK );
> void forgetResize();
> bool canUseDevice() const;
>
> void getInfo( storage::PartitionInfo& info ) const;
> bool equalContent( const Partition& rhs ) const;
> void logDifference( const Partition& d ) const;
>
>    protected:
> Partition& operator=( const Partition& );
>
> Region reg;
> bool bootflag;
> storage::PartitionType typ;
> unsigned idt;
> unsigned orig_id;
> string parted_start;
> unsigned orig_num;
>
> static string pt_names[storage::PTYPE_ANY+1];
> mutable storage::PartitionInfo info;
>    };
># 8 "y2storage/Disk.h" 2
>
>class Storage;
>class SystemCmd;
>class ProcPart;
>class Region;
>
>class Disk : public Container
>    {
>    friend class Storage;
>
>    struct label_info
> {
> string name;
> bool extended;
> unsigned primary;
> unsigned logical;
> };
>
>    public:
> Disk( Storage * const s, const string& Name, unsigned long long Size );
> Disk( const Disk& rhs );
> virtual ~Disk();
>
> unsigned long cylinders() const { return cyl; }
> unsigned heads() const { return head; }
> unsigned sectors() const { return sector; }
> unsigned long long sizeK() const { return size_k; }
> unsigned long minorNr() const { return mnr; }
> unsigned long majorNr() const { return mjr; }
> unsigned long numMinor() const { return range; }
> unsigned long cylSizeB() const { return byte_cyl; }
> unsigned maxPrimary() const { return max_primary; }
> unsigned maxLogical() const { return max_logical; }
> const string& labelName() const { return label; }
> unsigned numPartitions() const;
> static storage::CType const staticType() { return storage::DISK; }
> friend std::ostream& operator<< (std::ostream&, const Disk& );
>
> static bool needP( const string& dev );
> int createPartition( storage::PartitionType type, long unsigned start,
>                      long unsigned len, string& device,
>        bool checkRelaxed=false );
> int createPartition( long unsigned len, string& device,
>        bool checkRelaxed=false );
> int createPartition( storage::PartitionType type, string& device );
> int removePartition( unsigned nr );
> int changePartitionId( unsigned nr, unsigned id );
> int forgetChangePartitionId( unsigned nr );
> int changePartitionArea( unsigned nr, unsigned long start,
>                          unsigned long size, bool checkRelaxed=false );
> int nextFreePartition( storage::PartitionType type, unsigned& nr,
>                        string& device );
> int destroyPartitionTable( const string& new_label );
> unsigned availablePartNumber( storage::PartitionType type=storage::PRIMARY );
> void getCommitActions( std::list<storage::commitAction*>& l ) const;
> int getToCommit( storage::CommitStage stage, std::list<Container*>& col,
>    std::list<Volume*>& vol );
> int commitChanges( storage::CommitStage stage );
> int commitChanges( storage::CommitStage stage, Volume* vol );
> int resizePartition( Partition* p, unsigned long newCyl );
> int resizeVolume( Volume* v, unsigned long long newSize );
> int removeVolume( Volume* v );
> void getUnusedSpace( std::list<Region>& free, bool all=true,
>                      bool logical=false );
> bool hasExtended() const;
> string setDiskLabelText( bool doing=true ) const;
> unsigned long long cylinderToKb( unsigned long ) const;
> unsigned long kbToCylinder( unsigned long long ) const;
> string getPartName( unsigned nr ) const;
> void getInfo( storage::DiskInfo& info ) const;
> bool equalContent( const Disk& rhs ) const;
> void logDifference( const Disk& d ) const;
>
>
> static string getPartName( const string& disk, unsigned nr );
> static string getPartName( const string& disk, const string& nr );
> static std::pair<string,long> getDiskPartition( const string& dev );
>
>    protected:
>
>
>
>        typedef CastIterator<VIter, Partition *> PartInter;
>        typedef CastIterator<CVIter, const Partition *> PartCInter;
>        template< class Pred >
>            struct PartitionPI { typedef ContainerIter<Pred, PartInter> type; };
>        template< class Pred >
>            struct PartitionCPI { typedef ContainerIter<Pred, PartCInter> type; };
>        typedef CheckFnc<const Partition> CheckFncPartition;
>        typedef CheckerIterator< CheckFncPartition, PartitionPI<CheckFncPartition>::type,
>                                 PartInter, Partition > PartPIterator;
>        typedef CheckerIterator< CheckFncPartition, PartitionCPI<CheckFncPartition>::type,
>                                 PartCInter, const Partition > PartCPIterator;
> typedef DerefIterator<PartPIterator,Partition> PartIter;
> typedef DerefIterator<PartCPIterator,const Partition> ConstPartIter;
>        typedef IterPair<PartIter> PartPair;
>        typedef IterPair<ConstPartIter> ConstPartPair;
>
>        PartPair partPair( bool (* CheckPart)( const Partition& )=__null)
>            {
>            return( PartPair( partBegin( CheckPart ), partEnd( CheckPart ) ));
>            }
>        PartIter partBegin( bool (* CheckPart)( const Partition& )=__null)
>            {
>     IterPair<PartInter> p( (PartInter(begin())), (PartInter(end())) );
>            return( PartIter( PartPIterator( p, CheckPart )) );
>     }
>        PartIter partEnd( bool (* CheckPart)( const Partition& )=__null)
>            {
>     IterPair<PartInter> p( (PartInter(begin())), (PartInter(end())) );
>            return( PartIter( PartPIterator( p, CheckPart, true )) );
>     }
>
>        ConstPartPair partPair( bool (* CheckPart)( const Partition& )=__null) const
>            {
>            return( ConstPartPair( partBegin( CheckPart ), partEnd( CheckPart ) ));
>            }
>        ConstPartIter partBegin( bool (* CheckPart)( const Partition& )=__null) const
>            {
>     IterPair<PartCInter> p( (PartCInter(begin())), (PartCInter(end())) );
>            return( ConstPartIter( PartCPIterator( p, CheckPart )) );
>     }
>        ConstPartIter partEnd( bool (* CheckPart)( const Partition& )=__null) const
>            {
>     IterPair<PartCInter> p( (PartCInter(begin())), (PartCInter(end())) );
>            return( ConstPartIter( PartCPIterator( p, CheckPart, true )) );
>     }
>
> Disk( Storage * const s, const string& File );
> unsigned long long capacityInKb() const { return size_k; }
> bool detectGeometry();
> bool detectPartitions();
> bool getSysfsInfo( const string& SysFsDir );
> int checkSystemError( const string& cmd_line, const SystemCmd& cmd );
> int execCheckFailed( const string& cmd_line );
> bool checkPartedOutput( const SystemCmd& cmd );
> bool scanPartedLine( const string& Line, unsigned& nr,
>                      unsigned long& start, unsigned long& csize,
>        storage::PartitionType& type,
>        unsigned& id, bool& boot );
> bool checkPartedValid( const ProcPart& pp, const std::list<string>& ps,
>                        const std::list<Partition*>& pl );
> bool getPartedValues( Partition *p );
> virtual void print( std::ostream& s ) const { s << *this; }
> virtual Container* getCopy() const { return( new Disk( *this ) ); }
>
> static bool notDeleted( const Partition&d ) { return( !d.deleted() ); }
>
> int doCreate( Volume* v );
> int doRemove( Volume* v );
> int doResize( Volume* v );
> int doSetType( Volume* v );
> int doCreateLabel();
>
>
> void logData( const string& Dir );
> bool haveBsdPart( const std::list<Partition*>& pl) const;
> void setLabelData( const string& );
> Disk& operator= ( const Disk& rhs );
>
> static string defaultLabel();
> static label_info labels[];
> static string p_disks[];
>
> unsigned long cyl;
> unsigned head;
> unsigned sector;
> string label;
> string detected_label;
> string system_stderr;
> unsigned max_primary;
> bool ext_possible;
> unsigned max_logical;
> unsigned long byte_cyl;
> unsigned long long size_k;
> unsigned long mnr;
> unsigned long mjr;
> unsigned long range;
> mutable storage::DiskInfo info;
>    };
># 2 "Disk.cc" 2
>
>using namespace std;
>using namespace storage;
>
>int Disk::removePartition( unsigned nr )
>    {
>    int ret = 0;
>    PartPair p = partPair( notDeleted );
>    PartIter i = p.begin();
>    while( i!=p.end() && i->nr()!=nr)
> {
> ++i;
> }
>    if( ret==0 )
> {
> PartitionType t = i->type();
> bool creat = i->created();
> if( creat )
>     {
>     if( !removeFromList( &(*i) ))
>  ret = DISK_REMOVE_PARTITION_CREATE_NOT_FOUND;
>     p = partPair( notDeleted );
>     }
> else
>     i->setDeleted();
> if( ret==0 && nr>max_primary )
>     {
>     i = p.begin();
>     while( i!=p.end() )
>  {
>  if( i->nr()>nr )
>      {
>      i->changeNumber( i->nr()-1 );
>      }
>  ++i;
>  }
>     }
> else if( t==EXTENDED )
>     {
>     list<Volume*> l;
>     i = p.begin();
>     while( i!=p.end() )
>  {
>  if( i->nr()>max_primary )
>      {
>      if( creat )
>   l.push_back( &(*i) );
>      else
>   i->setDeleted();
>      }
>  ++i;
>  }
>     list<Volume*>::iterator vi = l.begin();
>     while( ret==0 && vi!=l.end() )
>  {
>  if( !removeFromList( *vi ))
>      ret = DISK_PARTITION_NOT_FOUND;
>  ++vi;
>  }
>     }
> }
>    log_msg( 1, "Disk.cc", 63, __FUNCTION__, __null, "ret %d", ret );
>    return( ret );
>    }

Actions: View

Attachments on bug 112985: 47555 | 47556