Attachment 419234 Details for Bug 679513

libgflags_la-gflags.i

libgflags_la-gflags.i (text/plain), 599.79 KB, created by Krzysztof Pawlik on 2011-03-14 19:37:42 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Krzysztof Pawlik

Created: 2011-03-14 19:37:42 UTC

Size: 599.79 KB

patch

obsolete

># 1 "src/gflags.cc"
># 1 "<built-in>"
># 1 "<command-line>"
># 1 "src/gflags.cc"
># 91 "src/gflags.cc"
># 1 "src/config.h" 1
># 92 "src/gflags.cc" 2
>
>
>
>
>
># 1 "/usr/include/inttypes.h" 1 3 4
># 26 "/usr/include/inttypes.h" 3 4
># 1 "/usr/include/features.h" 1 3 4
># 347 "/usr/include/features.h" 3 4
># 1 "/usr/include/sys/cdefs.h" 1 3 4
># 353 "/usr/include/sys/cdefs.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 354 "/usr/include/sys/cdefs.h" 2 3 4
># 348 "/usr/include/features.h" 2 3 4
># 371 "/usr/include/features.h" 3 4
># 1 "/usr/include/gnu/stubs.h" 1 3 4
>
>
>
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 5 "/usr/include/gnu/stubs.h" 2 3 4
>
>
>
>
># 1 "/usr/include/gnu/stubs-64.h" 1 3 4
># 10 "/usr/include/gnu/stubs.h" 2 3 4
># 372 "/usr/include/features.h" 2 3 4
># 27 "/usr/include/inttypes.h" 2 3 4
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stdint.h" 1 3 4
>
>
># 1 "/usr/include/stdint.h" 1 3 4
># 27 "/usr/include/stdint.h" 3 4
># 1 "/usr/include/bits/wchar.h" 1 3 4
># 28 "/usr/include/stdint.h" 2 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/stdint.h" 2 3 4
># 37 "/usr/include/stdint.h" 3 4
>typedef signed char int8_t;
>typedef short int int16_t;
>typedef int int32_t;
>
>typedef long int int64_t;
>
>
>
>
>
>
>
>typedef unsigned char uint8_t;
>typedef unsigned short int uint16_t;
>
>typedef unsigned int uint32_t;
>
>
>
>typedef unsigned long int uint64_t;
># 66 "/usr/include/stdint.h" 3 4
>typedef signed char int_least8_t;
>typedef short int int_least16_t;
>typedef int int_least32_t;
>
>typedef long int int_least64_t;
>
>
>
>
>
>
>typedef unsigned char uint_least8_t;
>typedef unsigned short int uint_least16_t;
>typedef unsigned int uint_least32_t;
>
>typedef unsigned long int uint_least64_t;
># 91 "/usr/include/stdint.h" 3 4
>typedef signed char int_fast8_t;
>
>typedef long int int_fast16_t;
>typedef long int int_fast32_t;
>typedef long int int_fast64_t;
># 104 "/usr/include/stdint.h" 3 4
>typedef unsigned char uint_fast8_t;
>
>typedef unsigned long int uint_fast16_t;
>typedef unsigned long int uint_fast32_t;
>typedef unsigned long int uint_fast64_t;
># 120 "/usr/include/stdint.h" 3 4
>typedef long int intptr_t;
>
>
>typedef unsigned long int uintptr_t;
># 135 "/usr/include/stdint.h" 3 4
>typedef long int intmax_t;
>typedef unsigned long int uintmax_t;
># 4 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stdint.h" 2 3 4
># 29 "/usr/include/inttypes.h" 2 3 4
># 274 "/usr/include/inttypes.h" 3 4
>extern "C" {
>
>
>
>
>typedef struct
>  {
>    long int quot;
>    long int rem;
>  } imaxdiv_t;
># 298 "/usr/include/inttypes.h" 3 4
>extern intmax_t imaxabs (intmax_t __n) throw () __attribute__ ((__const__));
>
>
>extern imaxdiv_t imaxdiv (intmax_t __numer, intmax_t __denom)
>      throw () __attribute__ ((__const__));
>
>
>extern intmax_t strtoimax (__const char *__restrict __nptr,
>      char **__restrict __endptr, int __base) throw ();
>
>
>extern uintmax_t strtoumax (__const char *__restrict __nptr,
>       char ** __restrict __endptr, int __base) throw ();
>
>
>extern intmax_t wcstoimax (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>extern uintmax_t wcstoumax (__const wchar_t *__restrict __nptr,
>       wchar_t ** __restrict __endptr, int __base)
>     throw ();
>
>
>
>
>
>extern long int __strtol_internal (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern __inline __attribute__ ((__gnu_inline__)) intmax_t
>strtoimax (__const char *__restrict nptr, char **__restrict endptr, int base) throw ()
>
>{
>  return __strtol_internal (nptr, endptr, base, 0);
>}
>
>extern unsigned long int __strtoul_internal (__const char *
>          __restrict __nptr,
>          char ** __restrict __endptr,
>          int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern __inline __attribute__ ((__gnu_inline__)) uintmax_t
>strtoumax (__const char *__restrict nptr, char **__restrict endptr, int base) throw ()
>
>{
>  return __strtoul_internal (nptr, endptr, base, 0);
>}
>
>extern long int __wcstol_internal (__const wchar_t * __restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern __inline __attribute__ ((__gnu_inline__)) intmax_t
>wcstoimax (__const wchar_t *__restrict nptr, wchar_t **__restrict endptr, int base) throw ()
>
>{
>  return __wcstol_internal (nptr, endptr, base, 0);
>}
>
>extern unsigned long int __wcstoul_internal (__const wchar_t *
>          __restrict __nptr,
>          wchar_t **
>          __restrict __endptr,
>          int __base, int __group)
>  throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern __inline __attribute__ ((__gnu_inline__)) uintmax_t
>wcstoumax (__const wchar_t *__restrict nptr, wchar_t **__restrict endptr, int base) throw ()
>
>{
>  return __wcstoul_internal (nptr, endptr, base, 0);
>}
># 442 "/usr/include/inttypes.h" 3 4
>}
># 98 "src/gflags.cc" 2
>
># 1 "/usr/include/stdio.h" 1 3 4
># 30 "/usr/include/stdio.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 211 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 3 4
>typedef long unsigned int size_t;
># 35 "/usr/include/stdio.h" 2 3 4
>
># 1 "/usr/include/bits/types.h" 1 3 4
># 28 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/bits/types.h" 2 3 4
>
>
>typedef unsigned char __u_char;
>typedef unsigned short int __u_short;
>typedef unsigned int __u_int;
>typedef unsigned long int __u_long;
>
>
>typedef signed char __int8_t;
>typedef unsigned char __uint8_t;
>typedef signed short int __int16_t;
>typedef unsigned short int __uint16_t;
>typedef signed int __int32_t;
>typedef unsigned int __uint32_t;
>
>typedef signed long int __int64_t;
>typedef unsigned long int __uint64_t;
>
>
>
>
>
>
>
>typedef long int __quad_t;
>typedef unsigned long int __u_quad_t;
># 131 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/typesizes.h" 1 3 4
># 132 "/usr/include/bits/types.h" 2 3 4
>
>
>typedef unsigned long int __dev_t;
>typedef unsigned int __uid_t;
>typedef unsigned int __gid_t;
>typedef unsigned long int __ino_t;
>typedef unsigned long int __ino64_t;
>typedef unsigned int __mode_t;
>typedef unsigned long int __nlink_t;
>typedef long int __off_t;
>typedef long int __off64_t;
>typedef int __pid_t;
>typedef struct { int __val[2]; } __fsid_t;
>typedef long int __clock_t;
>typedef unsigned long int __rlim_t;
>typedef unsigned long int __rlim64_t;
>typedef unsigned int __id_t;
>typedef long int __time_t;
>typedef unsigned int __useconds_t;
>typedef long int __suseconds_t;
>
>typedef int __daddr_t;
>typedef long int __swblk_t;
>typedef int __key_t;
>
>
>typedef int __clockid_t;
>
>
>typedef void * __timer_t;
>
>
>typedef long int __blksize_t;
>
>
>
>
>typedef long int __blkcnt_t;
>typedef long int __blkcnt64_t;
>
>
>typedef unsigned long int __fsblkcnt_t;
>typedef unsigned long int __fsblkcnt64_t;
>
>
>typedef unsigned long int __fsfilcnt_t;
>typedef unsigned long int __fsfilcnt64_t;
>
>typedef long int __ssize_t;
>
>
>
>typedef __off64_t __loff_t;
>typedef __quad_t *__qaddr_t;
>typedef char *__caddr_t;
>
>
>typedef long int __intptr_t;
>
>
>typedef unsigned int __socklen_t;
># 37 "/usr/include/stdio.h" 2 3 4
># 45 "/usr/include/stdio.h" 3 4
>struct _IO_FILE;
>
>
>
>typedef struct _IO_FILE FILE;
>
>
>
>
>
># 65 "/usr/include/stdio.h" 3 4
>typedef struct _IO_FILE __FILE;
># 75 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/libio.h" 1 3 4
># 32 "/usr/include/libio.h" 3 4
># 1 "/usr/include/_G_config.h" 1 3 4
># 15 "/usr/include/_G_config.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 16 "/usr/include/_G_config.h" 2 3 4
>
>
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 83 "/usr/include/wchar.h" 3 4
>typedef struct
>{
>  int __count;
>  union
>  {
>
>    unsigned int __wch;
>
>
>
>    char __wchb[4];
>  } __value;
>} __mbstate_t;
># 21 "/usr/include/_G_config.h" 2 3 4
>
>typedef struct
>{
>  __off_t __pos;
>  __mbstate_t __state;
>} _G_fpos_t;
>typedef struct
>{
>  __off64_t __pos;
>  __mbstate_t __state;
>} _G_fpos64_t;
># 53 "/usr/include/_G_config.h" 3 4
>typedef int _G_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef int _G_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int _G_uint16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int _G_uint32_t __attribute__ ((__mode__ (__SI__)));
># 33 "/usr/include/libio.h" 2 3 4
># 53 "/usr/include/libio.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stdarg.h" 1 3 4
># 40 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stdarg.h" 3 4
>typedef __builtin_va_list __gnuc_va_list;
># 54 "/usr/include/libio.h" 2 3 4
># 170 "/usr/include/libio.h" 3 4
>struct _IO_jump_t; struct _IO_FILE;
># 180 "/usr/include/libio.h" 3 4
>typedef void _IO_lock_t;
>
>
>
>
>
>struct _IO_marker {
>  struct _IO_marker *_next;
>  struct _IO_FILE *_sbuf;
>
>
>
>  int _pos;
># 203 "/usr/include/libio.h" 3 4
>};
>
>
>enum __codecvt_result
>{
>  __codecvt_ok,
>  __codecvt_partial,
>  __codecvt_error,
>  __codecvt_noconv
>};
># 271 "/usr/include/libio.h" 3 4
>struct _IO_FILE {
>  int _flags;
>
>
>
>
>  char* _IO_read_ptr;
>  char* _IO_read_end;
>  char* _IO_read_base;
>  char* _IO_write_base;
>  char* _IO_write_ptr;
>  char* _IO_write_end;
>  char* _IO_buf_base;
>  char* _IO_buf_end;
>
>  char *_IO_save_base;
>  char *_IO_backup_base;
>  char *_IO_save_end;
>
>  struct _IO_marker *_markers;
>
>  struct _IO_FILE *_chain;
>
>  int _fileno;
>
>
>
>  int _flags2;
>
>  __off_t _old_offset;
>
>
>
>  unsigned short _cur_column;
>  signed char _vtable_offset;
>  char _shortbuf[1];
>
>
>
>  _IO_lock_t *_lock;
># 319 "/usr/include/libio.h" 3 4
>  __off64_t _offset;
># 328 "/usr/include/libio.h" 3 4
>  void *__pad1;
>  void *__pad2;
>  void *__pad3;
>  void *__pad4;
>  size_t __pad5;
>
>  int _mode;
>
>  char _unused2[15 * sizeof (int) - 4 * sizeof (void *) - sizeof (size_t)];
>
>};
>
>
>
>
>
>struct _IO_FILE_plus;
>
>extern struct _IO_FILE_plus _IO_2_1_stdin_;
>extern struct _IO_FILE_plus _IO_2_1_stdout_;
>extern struct _IO_FILE_plus _IO_2_1_stderr_;
># 364 "/usr/include/libio.h" 3 4
>typedef __ssize_t __io_read_fn (void *__cookie, char *__buf, size_t __nbytes);
>
>
>
>
>
>
>
>typedef __ssize_t __io_write_fn (void *__cookie, __const char *__buf,
>     size_t __n);
>
>
>
>
>
>
>
>typedef int __io_seek_fn (void *__cookie, __off64_t *__pos, int __w);
>
>
>typedef int __io_close_fn (void *__cookie);
>
>
>
>
>typedef __io_read_fn cookie_read_function_t;
>typedef __io_write_fn cookie_write_function_t;
>typedef __io_seek_fn cookie_seek_function_t;
>typedef __io_close_fn cookie_close_function_t;
>
>
>typedef struct
>{
>  __io_read_fn *read;
>  __io_write_fn *write;
>  __io_seek_fn *seek;
>  __io_close_fn *close;
>} _IO_cookie_io_functions_t;
>typedef _IO_cookie_io_functions_t cookie_io_functions_t;
>
>struct _IO_cookie_file;
>
>
>extern void _IO_cookie_init (struct _IO_cookie_file *__cfile, int __read_write,
>        void *__cookie, _IO_cookie_io_functions_t __fns);
>
>
>
>
>extern "C" {
>
>
>extern int __underflow (_IO_FILE *);
>extern int __uflow (_IO_FILE *);
>extern int __overflow (_IO_FILE *, int);
># 460 "/usr/include/libio.h" 3 4
>extern int _IO_getc (_IO_FILE *__fp);
>extern int _IO_putc (int __c, _IO_FILE *__fp);
>extern int _IO_feof (_IO_FILE *__fp) throw ();
>extern int _IO_ferror (_IO_FILE *__fp) throw ();
>
>extern int _IO_peekc_locked (_IO_FILE *__fp);
>
>
>
>
>
>extern void _IO_flockfile (_IO_FILE *) throw ();
>extern void _IO_funlockfile (_IO_FILE *) throw ();
>extern int _IO_ftrylockfile (_IO_FILE *) throw ();
># 490 "/usr/include/libio.h" 3 4
>extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict,
>   __gnuc_va_list, int *__restrict);
>extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict,
>    __gnuc_va_list);
>extern __ssize_t _IO_padn (_IO_FILE *, int, __ssize_t);
>extern size_t _IO_sgetn (_IO_FILE *, void *, size_t);
>
>extern __off64_t _IO_seekoff (_IO_FILE *, __off64_t, int, int);
>extern __off64_t _IO_seekpos (_IO_FILE *, __off64_t, int);
>
>extern void _IO_free_backup_area (_IO_FILE *) throw ();
># 552 "/usr/include/libio.h" 3 4
>}
># 76 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>typedef __gnuc_va_list va_list;
># 89 "/usr/include/stdio.h" 3 4
>
>
>typedef _G_fpos_t fpos_t;
>
>
>
>
>
>typedef _G_fpos64_t fpos64_t;
># 141 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 142 "/usr/include/stdio.h" 2 3 4
>
>
>
>extern struct _IO_FILE *stdin;
>extern struct _IO_FILE *stdout;
>extern struct _IO_FILE *stderr;
>
>
>
>
>
>
>
>
>
>extern int remove (__const char *__filename) throw ();
>
>extern int rename (__const char *__old, __const char *__new) throw ();
>
>
>
>
>extern int renameat (int __oldfd, __const char *__old, int __newfd,
>       __const char *__new) throw ();
>
>
>
>
>
>
>
>
>extern FILE *tmpfile (void) ;
># 184 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile64 (void) ;
>
>
>
>extern char *tmpnam (char *__s) throw () ;
>
>
>
>
>
>extern char *tmpnam_r (char *__s) throw () ;
># 206 "/usr/include/stdio.h" 3 4
>extern char *tempnam (__const char *__dir, __const char *__pfx)
>     throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>
>
>
>
>extern int fclose (FILE *__stream);
>
>
>
>
>extern int fflush (FILE *__stream);
>
># 231 "/usr/include/stdio.h" 3 4
>extern int fflush_unlocked (FILE *__stream);
># 241 "/usr/include/stdio.h" 3 4
>extern int fcloseall (void);
>
>
>
>
>
>
>
>
>
>extern FILE *fopen (__const char *__restrict __filename,
>      __const char *__restrict __modes) ;
>
>
>
>
>extern FILE *freopen (__const char *__restrict __filename,
>        __const char *__restrict __modes,
>        FILE *__restrict __stream) ;
># 274 "/usr/include/stdio.h" 3 4
>
>
>extern FILE *fopen64 (__const char *__restrict __filename,
>        __const char *__restrict __modes) ;
>extern FILE *freopen64 (__const char *__restrict __filename,
>   __const char *__restrict __modes,
>   FILE *__restrict __stream) ;
>
>
>
>
>extern FILE *fdopen (int __fd, __const char *__modes) throw () ;
>
>
>
>
>
>extern FILE *fopencookie (void *__restrict __magic_cookie,
>     __const char *__restrict __modes,
>     _IO_cookie_io_functions_t __io_funcs) throw () ;
>
>
>
>
>extern FILE *fmemopen (void *__s, size_t __len, __const char *__modes)
>  throw () ;
>
>
>
>
>extern FILE *open_memstream (char **__bufloc, size_t *__sizeloc) throw () ;
>
>
>
>
>
>
>extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) throw ();
>
>
>
>extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf,
>      int __modes, size_t __n) throw ();
>
>
>
>
>
>extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf,
>         size_t __size) throw ();
>
>
>extern void setlinebuf (FILE *__stream) throw ();
>
>
>
>
>
>
>
>
>extern int fprintf (FILE *__restrict __stream,
>      __const char *__restrict __format, ...);
>
>
>
>
>extern int printf (__const char *__restrict __format, ...);
>
>extern int sprintf (char *__restrict __s,
>      __const char *__restrict __format, ...) throw ();
>
>
>
>
>
>extern int vfprintf (FILE *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg);
>
>
>
>
>extern int vprintf (__const char *__restrict __format, __gnuc_va_list __arg);
>
>extern int vsprintf (char *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg) throw ();
>
>
>
>
>
>extern int snprintf (char *__restrict __s, size_t __maxlen,
>       __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 3, 4)));
>
>extern int vsnprintf (char *__restrict __s, size_t __maxlen,
>        __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 3, 0)));
>
>
>
>
>
>
>extern int vasprintf (char **__restrict __ptr, __const char *__restrict __f,
>        __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0))) ;
>extern int __asprintf (char **__restrict __ptr,
>         __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3))) ;
>extern int asprintf (char **__restrict __ptr,
>       __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3))) ;
># 396 "/usr/include/stdio.h" 3 4
>extern int vdprintf (int __fd, __const char *__restrict __fmt,
>       __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__printf__, 2, 0)));
>extern int dprintf (int __fd, __const char *__restrict __fmt, ...)
>     __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>
>
>
>
>
>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 ();
># 447 "/usr/include/stdio.h" 3 4
>
>
>
>
>
>
>
>
>extern int vfscanf (FILE *__restrict __s, __const char *__restrict __format,
>      __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 2, 0))) ;
>
>
>
>
>
>extern int vscanf (__const char *__restrict __format, __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 1, 0))) ;
>
>
>extern int vsscanf (__const char *__restrict __s,
>      __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__scanf__, 2, 0)));
># 506 "/usr/include/stdio.h" 3 4
>
>
>
>
>
>
>
>
>
>extern int fgetc (FILE *__stream);
>extern int getc (FILE *__stream);
>
>
>
>
>
>extern int getchar (void);
>
># 534 "/usr/include/stdio.h" 3 4
>extern int getc_unlocked (FILE *__stream);
>extern int getchar_unlocked (void);
># 545 "/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);
>
># 578 "/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) ;
>
># 624 "/usr/include/stdio.h" 3 4
>extern char *fgets_unlocked (char *__restrict __s, int __n,
>        FILE *__restrict __stream) ;
># 640 "/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) ;
>
># 701 "/usr/include/stdio.h" 3 4
>extern int fputs_unlocked (__const char *__restrict __s,
>      FILE *__restrict __stream);
># 712 "/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);
>
># 748 "/usr/include/stdio.h" 3 4
>extern int fseeko (FILE *__stream, __off_t __off, int __whence);
>
>
>
>
>extern __off_t ftello (FILE *__stream) ;
># 767 "/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);
># 790 "/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[];
># 829 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>extern int fileno (FILE *__stream) throw () ;
>
>
>
>
>extern int fileno_unlocked (FILE *__stream) throw () ;
># 848 "/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 ();
># 909 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio.h" 1 3 4
># 36 "/usr/include/bits/stdio.h" 3 4
>extern __inline __attribute__ ((__gnu_inline__)) int
>vprintf (__const char *__restrict __fmt, __gnuc_va_list __arg)
>{
>  return vfprintf (stdout, __fmt, __arg);
>}
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>getchar (void)
>{
>  return _IO_getc (stdin);
>}
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>fgetc_unlocked (FILE *__fp)
>{
>  return (__builtin_expect (((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end), 0) ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>getc_unlocked (FILE *__fp)
>{
>  return (__builtin_expect (((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end), 0) ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
>}
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>getchar_unlocked (void)
>{
>  return (__builtin_expect (((stdin)->_IO_read_ptr >= (stdin)->_IO_read_end), 0) ? __uflow (stdin) : *(unsigned char *) (stdin)->_IO_read_ptr++);
>}
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>putchar (int __c)
>{
>  return _IO_putc (__c, stdout);
>}
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>fputc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end), 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>putc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end), 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>putchar_unlocked (int __c)
>{
>  return (__builtin_expect (((stdout)->_IO_write_ptr >= (stdout)->_IO_write_end), 0) ? __overflow (stdout, (unsigned char) (__c)) : (unsigned char) (*(stdout)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) __ssize_t
>getline (char **__lineptr, size_t *__n, FILE *__stream)
>{
>  return __getdelim (__lineptr, __n, '\n', __stream);
>}
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>feof_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x10) != 0);
>}
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>ferror_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x20) != 0);
>}
># 910 "/usr/include/stdio.h" 2 3 4
># 918 "/usr/include/stdio.h" 3 4
>}
># 100 "src/gflags.cc" 2
># 1 "/usr/include/ctype.h" 1 3 4
># 30 "/usr/include/ctype.h" 3 4
>extern "C" {
># 41 "/usr/include/ctype.h" 3 4
># 1 "/usr/include/endian.h" 1 3 4
># 37 "/usr/include/endian.h" 3 4
># 1 "/usr/include/bits/endian.h" 1 3 4
># 38 "/usr/include/endian.h" 2 3 4
># 61 "/usr/include/endian.h" 3 4
># 1 "/usr/include/bits/byteswap.h" 1 3 4
># 28 "/usr/include/bits/byteswap.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/bits/byteswap.h" 2 3 4
># 62 "/usr/include/endian.h" 2 3 4
># 42 "/usr/include/ctype.h" 2 3 4
>
>
>
>
>
>
>enum
>{
>  _ISupper = ((0) < 8 ? ((1 << (0)) << 8) : ((1 << (0)) >> 8)),
>  _ISlower = ((1) < 8 ? ((1 << (1)) << 8) : ((1 << (1)) >> 8)),
>  _ISalpha = ((2) < 8 ? ((1 << (2)) << 8) : ((1 << (2)) >> 8)),
>  _ISdigit = ((3) < 8 ? ((1 << (3)) << 8) : ((1 << (3)) >> 8)),
>  _ISxdigit = ((4) < 8 ? ((1 << (4)) << 8) : ((1 << (4)) >> 8)),
>  _ISspace = ((5) < 8 ? ((1 << (5)) << 8) : ((1 << (5)) >> 8)),
>  _ISprint = ((6) < 8 ? ((1 << (6)) << 8) : ((1 << (6)) >> 8)),
>  _ISgraph = ((7) < 8 ? ((1 << (7)) << 8) : ((1 << (7)) >> 8)),
>  _ISblank = ((8) < 8 ? ((1 << (8)) << 8) : ((1 << (8)) >> 8)),
>  _IScntrl = ((9) < 8 ? ((1 << (9)) << 8) : ((1 << (9)) >> 8)),
>  _ISpunct = ((10) < 8 ? ((1 << (10)) << 8) : ((1 << (10)) >> 8)),
>  _ISalnum = ((11) < 8 ? ((1 << (11)) << 8) : ((1 << (11)) >> 8))
>};
># 81 "/usr/include/ctype.h" 3 4
>extern __const unsigned short int **__ctype_b_loc (void)
>     throw () __attribute__ ((__const));
>extern __const __int32_t **__ctype_tolower_loc (void)
>     throw () __attribute__ ((__const));
>extern __const __int32_t **__ctype_toupper_loc (void)
>     throw () __attribute__ ((__const));
># 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 ();
># 233 "/usr/include/ctype.h" 3 4
># 1 "/usr/include/xlocale.h" 1 3 4
># 28 "/usr/include/xlocale.h" 3 4
>typedef struct __locale_struct
>{
>
>  struct locale_data *__locales[13];
>
>
>  const unsigned short int *__ctype_b;
>  const int *__ctype_tolower;
>  const int *__ctype_toupper;
>
>
>  const char *__names[13];
>} *__locale_t;
>
>
>typedef __locale_t locale_t;
># 234 "/usr/include/ctype.h" 2 3 4
># 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
>}
># 101 "src/gflags.cc" 2
># 1 "/usr/include/errno.h" 1 3 4
># 32 "/usr/include/errno.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/errno.h" 1 3 4
># 25 "/usr/include/bits/errno.h" 3 4
># 1 "/usr/include/linux/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm/errno.h" 1 3 4
># 1 "/usr/include/asm-generic/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm-generic/errno-base.h" 1 3 4
># 5 "/usr/include/asm-generic/errno.h" 2 3 4
># 1 "/usr/include/asm/errno.h" 2 3 4
># 5 "/usr/include/linux/errno.h" 2 3 4
># 26 "/usr/include/bits/errno.h" 2 3 4
># 43 "/usr/include/bits/errno.h" 3 4
>extern int *__errno_location (void) throw () __attribute__ ((__const__));
># 37 "/usr/include/errno.h" 2 3 4
># 55 "/usr/include/errno.h" 3 4
>extern char *program_invocation_name, *program_invocation_short_name;
>
>
>
>}
># 69 "/usr/include/errno.h" 3 4
>typedef int error_t;
># 102 "src/gflags.cc" 2
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stdarg.h" 1 3 4
># 104 "src/gflags.cc" 2
># 1 "/usr/include/string.h" 1 3 4
># 28 "/usr/include/string.h" 3 4
>extern "C" {
>
>
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/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 "C++"
>{
>extern void *memchr (void *__s, int __c, size_t __n)
>      throw () __asm ("memchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern __const void *memchr (__const void *__s, int __c, size_t __n)
>      throw () __asm ("memchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) void *
>memchr (void *__s, int __c, size_t __n) throw ()
>{
>  return __builtin_memchr (__s, __c, __n);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const void *
>memchr (__const void *__s, int __c, size_t __n) throw ()
>{
>  return __builtin_memchr (__s, __c, __n);
>}
>
>}
>
>
>
>
>
>
>
>
>
>
>extern "C++" void *rawmemchr (void *__s, int __c)
>     throw () __asm ("rawmemchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern "C++" __const void *rawmemchr (__const void *__s, int __c)
>     throw () __asm ("rawmemchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern "C++" void *memrchr (void *__s, int __c, size_t __n)
>      throw () __asm ("memrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern "C++" __const void *memrchr (__const void *__s, int __c, size_t __n)
>      throw () __asm ("memrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>
>
>extern char *strcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strcat (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncat (char *__restrict __dest, __const char *__restrict __src,
>        size_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern int strncmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcoll (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern size_t strxfrm (char *__restrict __dest,
>         __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (2)));
>
># 164 "/usr/include/string.h" 3 4
>extern int strcoll_l (__const char *__s1, __const char *__s2, __locale_t __l)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>extern size_t strxfrm_l (char *__dest, __const char *__src, size_t __n,
>    __locale_t __l) throw () __attribute__ ((__nonnull__ (2, 4)));
>
>
>
>
>extern char *strdup (__const char *__s)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern char *strndup (__const char *__string, size_t __n)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1)));
># 208 "/usr/include/string.h" 3 4
>
>
>
>extern "C++"
>{
>extern char *strchr (char *__s, int __c)
>     throw () __asm ("strchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern __const char *strchr (__const char *__s, int __c)
>     throw () __asm ("strchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>strchr (char *__s, int __c) throw ()
>{
>  return __builtin_strchr (__s, __c);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char *
>strchr (__const char *__s, int __c) throw ()
>{
>  return __builtin_strchr (__s, __c);
>}
>
>}
>
>
>
>
>
>
>extern "C++"
>{
>extern char *strrchr (char *__s, int __c)
>     throw () __asm ("strrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern __const char *strrchr (__const char *__s, int __c)
>     throw () __asm ("strrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>strrchr (char *__s, int __c) throw ()
>{
>  return __builtin_strrchr (__s, __c);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char *
>strrchr (__const char *__s, int __c) throw ()
>{
>  return __builtin_strrchr (__s, __c);
>}
>
>}
>
>
>
>
>
>
>
>
>
>
>extern "C++" char *strchrnul (char *__s, int __c)
>     throw () __asm ("strchrnul") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern "C++" __const char *strchrnul (__const char *__s, int __c)
>     throw () __asm ("strchrnul") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>
>
>extern size_t strcspn (__const char *__s, __const char *__reject)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern size_t strspn (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern "C++"
>{
>extern char *strpbrk (char *__s, __const char *__accept)
>     throw () __asm ("strpbrk") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>extern __const char *strpbrk (__const char *__s, __const char *__accept)
>     throw () __asm ("strpbrk") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>strpbrk (char *__s, __const char *__accept) throw ()
>{
>  return __builtin_strpbrk (__s, __accept);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char *
>strpbrk (__const char *__s, __const char *__accept) throw ()
>{
>  return __builtin_strpbrk (__s, __accept);
>}
>
>}
>
>
>
>
>
>
>extern "C++"
>{
>extern char *strstr (char *__haystack, __const char *__needle)
>     throw () __asm ("strstr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>extern __const char *strstr (__const char *__haystack,
>        __const char *__needle)
>     throw () __asm ("strstr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>strstr (char *__haystack, __const char *__needle) throw ()
>{
>  return __builtin_strstr (__haystack, __needle);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char *
>strstr (__const char *__haystack, __const char *__needle) throw ()
>{
>  return __builtin_strstr (__haystack, __needle);
>}
>
>}
>
>
>
>
>
>
>
>extern char *strtok (char *__restrict __s, __const char *__restrict __delim)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>extern char *__strtok_r (char *__restrict __s,
>    __const char *__restrict __delim,
>    char **__restrict __save_ptr)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>extern char *strtok_r (char *__restrict __s, __const char *__restrict __delim,
>         char **__restrict __save_ptr)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>
>
>
>
>extern "C++" char *strcasestr (char *__haystack, __const char *__needle)
>     throw () __asm ("strcasestr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>extern "C++" __const char *strcasestr (__const char *__haystack,
>           __const char *__needle)
>     throw () __asm ("strcasestr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
># 380 "/usr/include/string.h" 3 4
>extern void *memmem (__const void *__haystack, size_t __haystacklen,
>       __const void *__needle, size_t __needlelen)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>extern void *__mempcpy (void *__restrict __dest,
>   __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern void *mempcpy (void *__restrict __dest,
>        __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern size_t strlen (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern size_t strnlen (__const char *__string, size_t __maxlen)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strerror (int __errnum) throw ();
>
># 436 "/usr/include/string.h" 3 4
>extern char *strerror_r (int __errnum, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>extern char *strerror_l (int __errnum, __locale_t __l) throw ();
>
>
>
>
>
>extern void __bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern void bcopy (__const void *__src, void *__dest, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int bcmp (__const void *__s1, __const void *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern "C++"
>{
>extern char *index (char *__s, int __c)
>     throw () __asm ("index") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern __const char *index (__const char *__s, int __c)
>     throw () __asm ("index") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>index (char *__s, int __c) throw ()
>{
>  return __builtin_index (__s, __c);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char *
>index (__const char *__s, int __c) throw ()
>{
>  return __builtin_index (__s, __c);
>}
>
>}
>
>
>
>
>
>
>
>extern "C++"
>{
>extern char *rindex (char *__s, int __c)
>     throw () __asm ("rindex") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>extern __const char *rindex (__const char *__s, int __c)
>     throw () __asm ("rindex") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) char *
>rindex (char *__s, int __c) throw ()
>{
>  return __builtin_rindex (__s, __c);
>}
>
>extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__)) __const char *
>rindex (__const char *__s, int __c) throw ()
>{
>  return __builtin_rindex (__s, __c);
>}
>
>}
>
>
>
>
>
>
>
>extern int ffs (int __i) throw () __attribute__ ((__const__));
>
>
>
>
>extern int ffsl (long int __l) throw () __attribute__ ((__const__));
>
>__extension__ extern int ffsll (long long int __ll)
>     throw () __attribute__ ((__const__));
>
>
>
>
>extern int strcasecmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strncasecmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern int strcasecmp_l (__const char *__s1, __const char *__s2,
>    __locale_t __loc)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>extern int strncasecmp_l (__const char *__s1, __const char *__s2,
>     size_t __n, __locale_t __loc)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 4)));
>
>
>
>
>
>extern char *strsep (char **__restrict __stringp,
>       __const char *__restrict __delim)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern char *strsignal (int __sig) throw ();
>
>
>extern char *__stpcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern char *stpcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern char *__stpncpy (char *__restrict __dest,
>   __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern char *stpncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int strverscmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strfry (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memfrob (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern "C++" char *basename (char *__filename)
>     throw () __asm ("basename") __attribute__ ((__nonnull__ (1)));
>extern "C++" __const char *basename (__const char *__filename)
>     throw () __asm ("basename") __attribute__ ((__nonnull__ (1)));
># 644 "/usr/include/string.h" 3 4
>}
># 105 "src/gflags.cc" 2
># 1 "/usr/include/assert.h" 1 3 4
># 106 "src/gflags.cc" 2
>
># 1 "/usr/include/fnmatch.h" 1 3 4
># 23 "/usr/include/fnmatch.h" 3 4
>extern "C" {
># 65 "/usr/include/fnmatch.h" 3 4
>extern int fnmatch (const char *__pattern, const char *__name,
>      int __flags);
>
>
>}
># 108 "src/gflags.cc" 2
>
># 1 "/usr/include/c++/4.5/string" 1 3
># 38 "/usr/include/c++/4.5/string" 3
>       
># 39 "/usr/include/c++/4.5/string" 3
>
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++config.h" 1 3
>
>
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 4 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++config.h" 2 3
># 1783 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++config.h" 3
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/os_defines.h" 1 3
># 1784 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++config.h" 2 3
>
>
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/cpu_defines.h" 1 3
># 1787 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++config.h" 2 3
># 41 "/usr/include/c++/4.5/string" 2 3
># 1 "/usr/include/c++/4.5/bits/stringfwd.h" 1 3
># 39 "/usr/include/c++/4.5/bits/stringfwd.h" 3
>       
># 40 "/usr/include/c++/4.5/bits/stringfwd.h" 3
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _Alloc>
>    class allocator;
>
>
>
>
>
>
>
>  template<class _CharT>
>    struct char_traits;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>           typename _Alloc = allocator<_CharT> >
>    class basic_string;
>
>  template<> struct char_traits<char>;
>
>  typedef basic_string<char> string;
>
>
>  template<> struct char_traits<wchar_t>;
>
>  typedef basic_string<wchar_t> wstring;
># 83 "/usr/include/c++/4.5/bits/stringfwd.h" 3
>}
># 42 "/usr/include/c++/4.5/string" 2 3
># 1 "/usr/include/c++/4.5/bits/char_traits.h" 1 3
># 39 "/usr/include/c++/4.5/bits/char_traits.h" 3
>       
># 40 "/usr/include/c++/4.5/bits/char_traits.h" 3
>
># 1 "/usr/include/c++/4.5/bits/stl_algobase.h" 1 3
># 61 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 149 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 3 4
>typedef long int ptrdiff_t;
># 45 "/usr/include/c++/4.5/cstddef" 2 3
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::ptrdiff_t;
>  using ::size_t;
>
>}
># 62 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/bits/functexcept.h" 1 3
># 37 "/usr/include/c++/4.5/bits/functexcept.h" 3
># 1 "/usr/include/c++/4.5/exception_defines.h" 1 3
># 38 "/usr/include/c++/4.5/bits/functexcept.h" 2 3
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>  void
>  __throw_bad_exception(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_alloc(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_cast(void) __attribute__((__noreturn__));
>
>  void
>  __throw_bad_typeid(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_logic_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_domain_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_invalid_argument(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_length_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_out_of_range(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_runtime_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_range_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_overflow_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_underflow_error(const char*) __attribute__((__noreturn__));
>
>
>  void
>  __throw_ios_failure(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_system_error(int) __attribute__((__noreturn__));
>
>  void
>  __throw_future_error(int) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_function_call() __attribute__((__noreturn__));
>
>}
># 63 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/bits/cpp_type_traits.h" 1 3
># 36 "/usr/include/c++/4.5/bits/cpp_type_traits.h" 3
>       
># 37 "/usr/include/c++/4.5/bits/cpp_type_traits.h" 3
># 69 "/usr/include/c++/4.5/bits/cpp_type_traits.h" 3
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator;
>
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  struct __true_type { };
>  struct __false_type { };
>
>  template<bool>
>    struct __truth_type
>    { typedef __false_type __type; };
>
>  template<>
>    struct __truth_type<true>
>    { typedef __true_type __type; };
>
>
>
>  template<class _Sp, class _Tp>
>    struct __traitor
>    {
>      enum { __value = bool(_Sp::__value) || bool(_Tp::__value) };
>      typedef typename __truth_type<__value>::__type __type;
>    };
>
>
>  template<typename, typename>
>    struct __are_same
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Tp>
>    struct __are_same<_Tp, _Tp>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<typename _Tp>
>    struct __is_void
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<>
>    struct __is_void<void>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_integer
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>
>
>
>  template<>
>    struct __is_integer<bool>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<signed char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<>
>    struct __is_integer<wchar_t>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
># 194 "/usr/include/c++/4.5/bits/cpp_type_traits.h" 3
>  template<>
>    struct __is_integer<short>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned short>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<int>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned int>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<long long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned long long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_floating
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>
>  template<>
>    struct __is_floating<float>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_floating<double>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_floating<long double>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_pointer
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Tp>
>    struct __is_pointer<_Tp*>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_normal_iterator
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Iterator, typename _Container>
>    struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator,
>             _Container> >
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_arithmetic
>    : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_fundamental
>    : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_scalar
>    : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_char
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<>
>    struct __is_char<char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<>
>    struct __is_char<wchar_t>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<typename _Tp>
>    struct __is_byte
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<>
>    struct __is_byte<char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_byte<signed char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_byte<unsigned char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_move_iterator
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
># 417 "/usr/include/c++/4.5/bits/cpp_type_traits.h" 3
>  template<typename _Tp>
>    class __is_iterator_helper
>    {
>      typedef char __one;
>      typedef struct { char __arr[2]; } __two;
>
>      template<typename _Up>
>        struct _Wrap_type
> { };
>
>      template<typename _Up>
>        static __one __test(_Wrap_type<typename _Up::iterator_category>*);
>
>      template<typename _Up>
>        static __two __test(...);
>
>    public:
>      static const bool __value = (sizeof(__test<_Tp>(0)) == 1
>       || __is_pointer<_Tp>::__value);
>    };
>
>  template<typename _Tp>
>    struct __is_iterator
>    {
>      enum { __value = __is_iterator_helper<_Tp>::__value };
>      typedef typename __truth_type<__value>::__type __type;
>    };
>
>}
># 64 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/ext/type_traits.h" 1 3
># 32 "/usr/include/c++/4.5/ext/type_traits.h" 3
>       
># 33 "/usr/include/c++/4.5/ext/type_traits.h" 3
>
>
>
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>
>  template<bool, typename>
>    struct __enable_if
>    { };
>
>  template<typename _Tp>
>    struct __enable_if<true, _Tp>
>    { typedef _Tp __type; };
>
>
>
>  template<bool _Cond, typename _Iftrue, typename _Iffalse>
>    struct __conditional_type
>    { typedef _Iftrue __type; };
>
>  template<typename _Iftrue, typename _Iffalse>
>    struct __conditional_type<false, _Iftrue, _Iffalse>
>    { typedef _Iffalse __type; };
>
>
>
>  template<typename _Tp>
>    struct __add_unsigned
>    {
>    private:
>      typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type;
>
>    public:
>      typedef typename __if_type::__type __type;
>    };
>
>  template<>
>    struct __add_unsigned<char>
>    { typedef unsigned char __type; };
>
>  template<>
>    struct __add_unsigned<signed char>
>    { typedef unsigned char __type; };
>
>  template<>
>    struct __add_unsigned<short>
>    { typedef unsigned short __type; };
>
>  template<>
>    struct __add_unsigned<int>
>    { typedef unsigned int __type; };
>
>  template<>
>    struct __add_unsigned<long>
>    { typedef unsigned long __type; };
>
>  template<>
>    struct __add_unsigned<long long>
>    { typedef unsigned long long __type; };
>
>
>  template<>
>    struct __add_unsigned<bool>;
>
>  template<>
>    struct __add_unsigned<wchar_t>;
>
>
>
>  template<typename _Tp>
>    struct __remove_unsigned
>    {
>    private:
>      typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type;
>
>    public:
>      typedef typename __if_type::__type __type;
>    };
>
>  template<>
>    struct __remove_unsigned<char>
>    { typedef signed char __type; };
>
>  template<>
>    struct __remove_unsigned<unsigned char>
>    { typedef signed char __type; };
>
>  template<>
>    struct __remove_unsigned<unsigned short>
>    { typedef short __type; };
>
>  template<>
>    struct __remove_unsigned<unsigned int>
>    { typedef int __type; };
>
>  template<>
>    struct __remove_unsigned<unsigned long>
>    { typedef long __type; };
>
>  template<>
>    struct __remove_unsigned<unsigned long long>
>    { typedef long long __type; };
>
>
>  template<>
>    struct __remove_unsigned<bool>;
>
>  template<>
>    struct __remove_unsigned<wchar_t>;
>
>
>
>  template<typename _Type>
>    inline bool
>    __is_null_pointer(_Type* __ptr)
>    { return __ptr == 0; }
>
>  template<typename _Type>
>    inline bool
>    __is_null_pointer(_Type)
>    { return false; }
>
>
>
>  template<typename _Tp, bool = std::__is_integer<_Tp>::__value>
>    struct __promote
>    { typedef double __type; };
>
>  template<typename _Tp>
>    struct __promote<_Tp, false>
>    { typedef _Tp __type; };
>
>  template<typename _Tp, typename _Up>
>    struct __promote_2
>    {
>    private:
>      typedef typename __promote<_Tp>::__type __type1;
>      typedef typename __promote<_Up>::__type __type2;
>
>    public:
>      typedef __typeof__(__type1() + __type2()) __type;
>    };
>
>  template<typename _Tp, typename _Up, typename _Vp>
>    struct __promote_3
>    {
>    private:
>      typedef typename __promote<_Tp>::__type __type1;
>      typedef typename __promote<_Up>::__type __type2;
>      typedef typename __promote<_Vp>::__type __type3;
>
>    public:
>      typedef __typeof__(__type1() + __type2() + __type3()) __type;
>    };
>
>  template<typename _Tp, typename _Up, typename _Vp, typename _Wp>
>    struct __promote_4
>    {
>    private:
>      typedef typename __promote<_Tp>::__type __type1;
>      typedef typename __promote<_Up>::__type __type2;
>      typedef typename __promote<_Vp>::__type __type3;
>      typedef typename __promote<_Wp>::__type __type4;
>
>    public:
>      typedef __typeof__(__type1() + __type2() + __type3() + __type4()) __type;
>    };
>
>}
># 65 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/ext/numeric_traits.h" 1 3
># 32 "/usr/include/c++/4.5/ext/numeric_traits.h" 3
>       
># 33 "/usr/include/c++/4.5/ext/numeric_traits.h" 3
>
>
>
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
># 52 "/usr/include/c++/4.5/ext/numeric_traits.h" 3
>  template<typename _Value>
>    struct __numeric_traits_integer
>    {
>
>      static const _Value __min = (((_Value)(-1) < 0) ? (_Value)1 << (sizeof(_Value) * 8 - ((_Value)(-1) < 0)) : (_Value)0);
>      static const _Value __max = (((_Value)(-1) < 0) ? (((((_Value)1 << ((sizeof(_Value) * 8 - ((_Value)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(_Value)0);
>
>
>
>      static const bool __is_signed = ((_Value)(-1) < 0);
>      static const int __digits = (sizeof(_Value) * 8 - ((_Value)(-1) < 0));
>    };
>
>  template<typename _Value>
>    const _Value __numeric_traits_integer<_Value>::__min;
>
>  template<typename _Value>
>    const _Value __numeric_traits_integer<_Value>::__max;
>
>  template<typename _Value>
>    const bool __numeric_traits_integer<_Value>::__is_signed;
>
>  template<typename _Value>
>    const int __numeric_traits_integer<_Value>::__digits;
># 97 "/usr/include/c++/4.5/ext/numeric_traits.h" 3
>  template<typename _Value>
>    struct __numeric_traits_floating
>    {
>
>      static const int __max_digits10 = (2 + (std::__are_same<_Value, float>::__value ? 24 : std::__are_same<_Value, double>::__value ? 53 : 64) * 3010 / 10000);
>
>
>      static const bool __is_signed = true;
>      static const int __digits10 = (std::__are_same<_Value, float>::__value ? 6 : std::__are_same<_Value, double>::__value ? 15 : 18);
>      static const int __max_exponent10 = (std::__are_same<_Value, float>::__value ? 38 : std::__are_same<_Value, double>::__value ? 308 : 4932);
>    };
>
>  template<typename _Value>
>    const int __numeric_traits_floating<_Value>::__max_digits10;
>
>  template<typename _Value>
>    const bool __numeric_traits_floating<_Value>::__is_signed;
>
>  template<typename _Value>
>    const int __numeric_traits_floating<_Value>::__digits10;
>
>  template<typename _Value>
>    const int __numeric_traits_floating<_Value>::__max_exponent10;
>
>  template<typename _Value>
>    struct __numeric_traits
>    : public __conditional_type<std::__is_integer<_Value>::__value,
>    __numeric_traits_integer<_Value>,
>    __numeric_traits_floating<_Value> >::__type
>    { };
>
>}
># 66 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_pair.h" 1 3
># 60 "/usr/include/c++/4.5/bits/stl_pair.h" 3
># 1 "/usr/include/c++/4.5/bits/move.h" 1 3
># 34 "/usr/include/c++/4.5/bits/move.h" 3
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 35 "/usr/include/c++/4.5/bits/move.h" 2 3
># 1 "/usr/include/c++/4.5/bits/concept_check.h" 1 3
># 33 "/usr/include/c++/4.5/bits/concept_check.h" 3
>       
># 34 "/usr/include/c++/4.5/bits/concept_check.h" 3
># 36 "/usr/include/c++/4.5/bits/move.h" 2 3
># 95 "/usr/include/c++/4.5/bits/move.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 104 "/usr/include/c++/4.5/bits/move.h" 3
>  template<typename _Tp>
>    inline void
>    swap(_Tp& __a, _Tp& __b)
>    {
>
>     
>
>      _Tp __tmp = (__a);
>      __a = (__b);
>      __b = (__tmp);
>    }
>
>
>
>  template<typename _Tp, size_t _Nm>
>    inline void
>    swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm])
>    {
>      for (size_t __n = 0; __n < _Nm; ++__n)
> swap(__a[__n], __b[__n]);
>    }
>
>}
># 61 "/usr/include/c++/4.5/bits/stl_pair.h" 2 3
>
>
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>  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) { }
># 113 "/usr/include/c++/4.5/bits/stl_pair.h" 3
>      template<class _U1, class _U2>
>        pair(const pair<_U1, _U2>& __p)
> : first(__p.first),
>   second(__p.second) { }
># 149 "/usr/include/c++/4.5/bits/stl_pair.h" 3
>    };
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __x.first == __y.first && __x.second == __y.second; }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __x.first < __y.first
>      || (!(__y.first < __x.first) && __x.second < __y.second); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__x == __y); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __y < __x; }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__y < __x); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__x < __y); }
># 211 "/usr/include/c++/4.5/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); }
># 257 "/usr/include/c++/4.5/bits/stl_pair.h" 3
>}
># 67 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_iterator_base_types.h" 1 3
># 63 "/usr/include/c++/4.5/bits/stl_iterator_base_types.h" 3
>       
># 64 "/usr/include/c++/4.5/bits/stl_iterator_base_types.h" 3
>
>
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 67 "/usr/include/c++/4.5/bits/stl_iterator_base_types.h" 2 3
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 85 "/usr/include/c++/4.5/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 { };
># 112 "/usr/include/c++/4.5/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;
>    };
># 136 "/usr/include/c++/4.5/bits/stl_iterator_base_types.h" 3
>  template<typename _Iterator>
>    struct iterator_traits
>    {
>      typedef typename _Iterator::iterator_category iterator_category;
>      typedef typename _Iterator::value_type value_type;
>      typedef typename _Iterator::difference_type difference_type;
>      typedef typename _Iterator::pointer pointer;
>      typedef typename _Iterator::reference reference;
>    };
>
>
>  template<typename _Tp>
>    struct iterator_traits<_Tp*>
>    {
>      typedef random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef _Tp& reference;
>    };
>
>
>  template<typename _Tp>
>    struct iterator_traits<const _Tp*>
>    {
>      typedef random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef ptrdiff_t difference_type;
>      typedef const _Tp* pointer;
>      typedef const _Tp& reference;
>    };
>
>
>
>
>
>  template<typename _Iter>
>    inline typename iterator_traits<_Iter>::iterator_category
>    __iterator_category(const _Iter&)
>    { return typename iterator_traits<_Iter>::iterator_category(); }
>
>
>
>}
># 68 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_iterator_base_funcs.h" 1 3
># 63 "/usr/include/c++/4.5/bits/stl_iterator_base_funcs.h" 3
>       
># 64 "/usr/include/c++/4.5/bits/stl_iterator_base_funcs.h" 3
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _InputIterator>
>    inline typename iterator_traits<_InputIterator>::difference_type
>    __distance(_InputIterator __first, _InputIterator __last,
>               input_iterator_tag)
>    {
>
>     
>
>      typename iterator_traits<_InputIterator>::difference_type __n = 0;
>      while (__first != __last)
> {
>   ++__first;
>   ++__n;
> }
>      return __n;
>    }
>
>  template<typename _RandomAccessIterator>
>    inline typename iterator_traits<_RandomAccessIterator>::difference_type
>    __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
>               random_access_iterator_tag)
>    {
>
>     
>
>      return __last - __first;
>    }
># 109 "/usr/include/c++/4.5/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;
>    }
># 167 "/usr/include/c++/4.5/bits/stl_iterator_base_funcs.h" 3
>  template<typename _InputIterator, typename _Distance>
>    inline void
>    advance(_InputIterator& __i, _Distance __n)
>    {
>
>      typename iterator_traits<_InputIterator>::difference_type __d = __n;
>      std::__advance(__i, __d, std::__iterator_category(__i));
>    }
>
>}
># 69 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_iterator.h" 1 3
># 68 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 94 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  template<typename _Iterator>
>    class reverse_iterator
>    : public iterator<typename iterator_traits<_Iterator>::iterator_category,
>        typename iterator_traits<_Iterator>::value_type,
>        typename iterator_traits<_Iterator>::difference_type,
>        typename iterator_traits<_Iterator>::pointer,
>                      typename iterator_traits<_Iterator>::reference>
>    {
>    protected:
>      _Iterator current;
>
>      typedef iterator_traits<_Iterator> __traits_type;
>
>    public:
>      typedef _Iterator iterator_type;
>      typedef typename __traits_type::difference_type difference_type;
>      typedef typename __traits_type::pointer pointer;
>      typedef typename __traits_type::reference reference;
>
>
>
>
>
>
>
>      reverse_iterator() : current() { }
>
>
>
>
>      explicit
>      reverse_iterator(iterator_type __x) : current(__x) { }
>
>
>
>
>      reverse_iterator(const reverse_iterator& __x)
>      : current(__x.current) { }
>
>
>
>
>
>      template<typename _Iter>
>        reverse_iterator(const reverse_iterator<_Iter>& __x)
> : current(__x.base()) { }
>
>
>
>
>      iterator_type
>      base() const
>      { return current; }
>
>
>
>
>
>
>      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); }
>    };
># 281 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  template<typename _Iterator>
>    inline bool
>    operator==(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return __x.base() == __y.base(); }
>
>  template<typename _Iterator>
>    inline bool
>    operator<(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y.base() < __x.base(); }
>
>  template<typename _Iterator>
>    inline bool
>    operator!=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Iterator>
>    inline bool
>    operator>(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y < __x; }
>
>  template<typename _Iterator>
>    inline bool
>    operator<=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Iterator>
>    inline bool
>    operator>=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Iterator>
>    inline typename reverse_iterator<_Iterator>::difference_type
>    operator-(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y.base() - __x.base(); }
>
>  template<typename _Iterator>
>    inline reverse_iterator<_Iterator>
>    operator+(typename reverse_iterator<_Iterator>::difference_type __n,
>       const reverse_iterator<_Iterator>& __x)
>    { return reverse_iterator<_Iterator>(__x.base() - __n); }
>
>
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator==(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return __x.base() == __y.base(); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator<(const reverse_iterator<_IteratorL>& __x,
>       const reverse_iterator<_IteratorR>& __y)
>    { return __y.base() < __x.base(); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator!=(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return !(__x == __y); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator>(const reverse_iterator<_IteratorL>& __x,
>       const reverse_iterator<_IteratorR>& __y)
>    { return __y < __x; }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator<=(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return !(__y < __x); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator>=(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return !(__x < __y); }
>
>  template<typename _IteratorL, typename _IteratorR>
>
>
>
>
>
>
>
>    inline typename reverse_iterator<_IteratorL>::difference_type
>    operator-(const reverse_iterator<_IteratorL>& __x,
>       const reverse_iterator<_IteratorR>& __y)
>
>    { return __y.base() - __x.base(); }
># 393 "/usr/include/c++/4.5/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) { }
># 420 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>      back_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_back(__value);
> return *this;
>      }
># 443 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>      back_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      back_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      back_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 469 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline back_insert_iterator<_Container>
>    back_inserter(_Container& __x)
>    { return back_insert_iterator<_Container>(__x); }
># 484 "/usr/include/c++/4.5/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) { }
># 510 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>      front_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_front(__value);
> return *this;
>      }
># 533 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>      front_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      front_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      front_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 559 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline front_insert_iterator<_Container>
>    front_inserter(_Container& __x)
>    { return front_insert_iterator<_Container>(__x); }
># 578 "/usr/include/c++/4.5/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) {}
># 621 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>      insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> iter = container->insert(iter, __value);
> ++iter;
> return *this;
>      }
># 647 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>      insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++(int)
>      { return *this; }
>    };
># 673 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  template<typename _Container, typename _Iterator>
>    inline insert_iterator<_Container>
>    inserter(_Container& __x, _Iterator __i)
>    {
>      return insert_iterator<_Container>(__x,
>      typename _Container::iterator(__i));
>    }
>
>
>
>}
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
># 694 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  using std::iterator_traits;
>  using std::iterator;
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator
>    {
>    protected:
>      _Iterator _M_current;
>
>      typedef iterator_traits<_Iterator> __traits_type;
>
>    public:
>      typedef _Iterator iterator_type;
>      typedef typename __traits_type::iterator_category iterator_category;
>      typedef typename __traits_type::value_type value_type;
>      typedef typename __traits_type::difference_type difference_type;
>      typedef typename __traits_type::reference reference;
>      typedef typename __traits_type::pointer pointer;
>
>      __normal_iterator() : _M_current(_Iterator()) { }
>
>      explicit
>      __normal_iterator(const _Iterator& __i) : _M_current(__i) { }
>
>
>      template<typename _Iter>
>        __normal_iterator(const __normal_iterator<_Iter,
>     typename __enable_if<
>              (std::__are_same<_Iter, typename _Container::pointer>::__value),
>        _Container>::__type>& __i)
>        : _M_current(__i.base()) { }
>
>
>      reference
>      operator*() const
>      { return *_M_current; }
>
>      pointer
>      operator->() const
>      { return _M_current; }
>
>      __normal_iterator&
>      operator++()
>      {
> ++_M_current;
> return *this;
>      }
>
>      __normal_iterator
>      operator++(int)
>      { return __normal_iterator(_M_current++); }
>
>
>      __normal_iterator&
>      operator--()
>      {
> --_M_current;
> return *this;
>      }
>
>      __normal_iterator
>      operator--(int)
>      { return __normal_iterator(_M_current--); }
>
>
>      reference
>      operator[](const difference_type& __n) const
>      { return _M_current[__n]; }
>
>      __normal_iterator&
>      operator+=(const difference_type& __n)
>      { _M_current += __n; return *this; }
>
>      __normal_iterator
>      operator+(const difference_type& __n) const
>      { return __normal_iterator(_M_current + __n); }
>
>      __normal_iterator&
>      operator-=(const difference_type& __n)
>      { _M_current -= __n; return *this; }
>
>      __normal_iterator
>      operator-(const difference_type& __n) const
>      { return __normal_iterator(_M_current - __n); }
>
>      const _Iterator&
>      base() const
>      { return _M_current; }
>    };
># 792 "/usr/include/c++/4.5/bits/stl_iterator.h" 3
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() == __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator==(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() == __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() != __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator!=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() != __rhs.base(); }
>
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() < __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator<(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() < __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() > __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator>(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() > __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() <= __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator<=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() <= __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() >= __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator>=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() >= __rhs.base(); }
>
>
>
>
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>
>
>
>
>
>
>
>    inline typename __normal_iterator<_IteratorL, _Container>::difference_type
>    operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>
>    { return __lhs.base() - __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline typename __normal_iterator<_Iterator, _Container>::difference_type
>    operator-(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() - __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline __normal_iterator<_Iterator, _Container>
>    operator+(typename __normal_iterator<_Iterator, _Container>::difference_type
>       __n, const __normal_iterator<_Iterator, _Container>& __i)
>    { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }
>
>}
># 70 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
>
># 1 "/usr/include/c++/4.5/debug/debug.h" 1 3
># 47 "/usr/include/c++/4.5/debug/debug.h" 3
>namespace std
>{
>  namespace __debug { }
>}
>
>
>
>
>namespace __gnu_debug
>{
>  using namespace std::__debug;
>}
># 72 "/usr/include/c++/4.5/bits/stl_algobase.h" 2 3
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>
>
>  template<bool _BoolType>
>    struct __iter_swap
>    {
>      template<typename _ForwardIterator1, typename _ForwardIterator2>
>        static void
>        iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>        {
>          typedef typename iterator_traits<_ForwardIterator1>::value_type
>            _ValueType1;
>          _ValueType1 __tmp = (*__a);
>          *__a = (*__b);
>          *__b = (__tmp);
> }
>    };
>
>  template<>
>    struct __iter_swap<true>
>    {
>      template<typename _ForwardIterator1, typename _ForwardIterator2>
>        static void
>        iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>        {
>          swap(*__a, *__b);
>        }
>    };
># 115 "/usr/include/c++/4.5/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);
>    }
># 156 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    _ForwardIterator2
>    swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>  _ForwardIterator2 __first2)
>    {
>
>     
>
>     
>
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> std::iter_swap(__first1, __first2);
>      return __first2;
>    }
># 184 "/usr/include/c++/4.5/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;
>    }
># 207 "/usr/include/c++/4.5/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;
>    }
># 230 "/usr/include/c++/4.5/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;
>    }
># 251 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    max(const _Tp& __a, const _Tp& __b, _Compare __comp)
>    {
>
>      if (__comp(__a, __b))
> return __b;
>      return __a;
>    }
>
>
>
>
>  template<typename _Iterator, bool _HasBase>
>    struct _Iter_base
>    {
>      typedef _Iterator iterator_type;
>      static iterator_type
>      _S_base(_Iterator __it)
>      { return __it; }
>    };
>
>  template<typename _Iterator>
>    struct _Iter_base<_Iterator, true>
>    {
>      typedef typename _Iterator::iterator_type iterator_type;
>      static iterator_type
>      _S_base(_Iterator __it)
>      { return __it.base(); }
>    };
>
>
>
>  template<typename _Iterator>
>    struct _Niter_base
>    : _Iter_base<_Iterator, __is_normal_iterator<_Iterator>::__value>
>    { };
>
>  template<typename _Iterator>
>    inline typename _Niter_base<_Iterator>::iterator_type
>    __niter_base(_Iterator __it)
>    { return std::_Niter_base<_Iterator>::_S_base(__it); }
>
>
>  template<typename _Iterator>
>    struct _Miter_base
>    : _Iter_base<_Iterator, __is_move_iterator<_Iterator>::__value>
>    { };
>
>  template<typename _Iterator>
>    inline typename _Miter_base<_Iterator>::iterator_type
>    __miter_base(_Iterator __it)
>    { return std::_Miter_base<_Iterator>::_S_base(__it); }
>
>
>
>
>
>
>
>  template<bool, bool, typename>
>    struct __copy_move
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        __copy_m(_II __first, _II __last, _OI __result)
>        {
>   for (; __first != __last; ++__result, ++__first)
>     *__result = *__first;
>   return __result;
> }
>    };
># 339 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<>
>    struct __copy_move<false, false, random_access_iterator_tag>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        __copy_m(_II __first, _II __last, _OI __result)
>        {
>   typedef typename iterator_traits<_II>::difference_type _Distance;
>   for(_Distance __n = __last - __first; __n > 0; --__n)
>     {
>       *__result = *__first;
>       ++__first;
>       ++__result;
>     }
>   return __result;
> }
>    };
># 377 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<bool _IsMove>
>    struct __copy_move<_IsMove, true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   const ptrdiff_t _Num = __last - __first;
>   if (_Num)
>     __builtin_memmove(__result, __first, sizeof(_Tp) * _Num);
>   return __result + _Num;
> }
>    };
>
>  template<bool _IsMove, typename _II, typename _OI>
>    inline _OI
>    __copy_move_a(_II __first, _II __last, _OI __result)
>    {
>      typedef typename iterator_traits<_II>::value_type _ValueTypeI;
>      typedef typename iterator_traits<_OI>::value_type _ValueTypeO;
>      typedef typename iterator_traits<_II>::iterator_category _Category;
>      const bool __simple = (__is_pod(_ValueTypeI)
>                      && __is_pointer<_II>::__value
>                      && __is_pointer<_OI>::__value
>        && __are_same<_ValueTypeI, _ValueTypeO>::__value);
>
>      return std::__copy_move<_IsMove, __simple,
>                       _Category>::__copy_m(__first, __last, __result);
>    }
>
>
>
>  template<typename _CharT>
>    struct char_traits;
>
>  template<typename _CharT, typename _Traits>
>    class istreambuf_iterator;
>
>  template<typename _CharT, typename _Traits>
>    class ostreambuf_iterator;
>
>  template<bool _IsMove, typename _CharT>
>    typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
>      ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type
>    __copy_move_a2(_CharT*, _CharT*,
>     ostreambuf_iterator<_CharT, char_traits<_CharT> >);
>
>  template<bool _IsMove, typename _CharT>
>    typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
>      ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type
>    __copy_move_a2(const _CharT*, const _CharT*,
>     ostreambuf_iterator<_CharT, char_traits<_CharT> >);
>
>  template<bool _IsMove, typename _CharT>
>    typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
>        _CharT*>::__type
>    __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >,
>     istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*);
>
>  template<bool _IsMove, typename _II, typename _OI>
>    inline _OI
>    __copy_move_a2(_II __first, _II __last, _OI __result)
>    {
>      return _OI(std::__copy_move_a<_IsMove>(std::__niter_base(__first),
>          std::__niter_base(__last),
>          std::__niter_base(__result)));
>    }
># 462 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _II, typename _OI>
>    inline _OI
>    copy(_II __first, _II __last, _OI __result)
>    {
>
>     
>     
>
>      ;
>
>      return (std::__copy_move_a2<__is_move_iterator<_II>::__value>
>       (std::__miter_base(__first), std::__miter_base(__last),
>        __result));
>    }
># 514 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<bool, bool, typename>
>    struct __copy_move_backward
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   while (__first != __last)
>     *--__result = *--__last;
>   return __result;
> }
>    };
># 542 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<>
>    struct __copy_move_backward<false, false, random_access_iterator_tag>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   typename iterator_traits<_BI1>::difference_type __n;
>   for (__n = __last - __first; __n > 0; --__n)
>     *--__result = *--__last;
>   return __result;
> }
>    };
># 572 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<bool _IsMove>
>    struct __copy_move_backward<_IsMove, true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   const ptrdiff_t _Num = __last - __first;
>   if (_Num)
>     __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num);
>   return __result - _Num;
> }
>    };
>
>  template<bool _IsMove, typename _BI1, typename _BI2>
>    inline _BI2
>    __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>      typedef typename iterator_traits<_BI1>::value_type _ValueType1;
>      typedef typename iterator_traits<_BI2>::value_type _ValueType2;
>      typedef typename iterator_traits<_BI1>::iterator_category _Category;
>      const bool __simple = (__is_pod(_ValueType1)
>                      && __is_pointer<_BI1>::__value
>                      && __is_pointer<_BI2>::__value
>        && __are_same<_ValueType1, _ValueType2>::__value);
>
>      return std::__copy_move_backward<_IsMove, __simple,
>                                _Category>::__copy_move_b(__first,
>         __last,
>         __result);
>    }
>
>  template<bool _IsMove, typename _BI1, typename _BI2>
>    inline _BI2
>    __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>      return _BI2(std::__copy_move_backward_a<_IsMove>
>    (std::__niter_base(__first), std::__niter_base(__last),
>     std::__niter_base(__result)));
>    }
># 631 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _BI1, typename _BI2>
>    inline _BI2
>    copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value>
>       (std::__miter_base(__first), std::__miter_base(__last),
>        __result));
>    }
># 689 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline typename
>    __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type
>    __fill_a(_ForwardIterator __first, _ForwardIterator __last,
>       const _Tp& __value)
>    {
>      for (; __first != __last; ++__first)
> *__first = __value;
>    }
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline typename
>    __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type
>    __fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>    {
>      const _Tp __tmp = __value;
>      for (; __first != __last; ++__first)
> *__first = __tmp;
>    }
>
>
>  template<typename _Tp>
>    inline typename
>    __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type
>    __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c)
>    {
>      const _Tp __tmp = __c;
>      __builtin_memset(__first, static_cast<unsigned char>(__tmp),
>         __last - __first);
>    }
># 733 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
>    {
>
>     
>
>      ;
>
>      std::__fill_a(std::__niter_base(__first), std::__niter_base(__last),
>      __value);
>    }
>
>  template<typename _OutputIterator, typename _Size, typename _Tp>
>    inline typename
>    __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type
>    __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)
>    {
>      for (; __n > 0; --__n, ++__first)
> *__first = __value;
>      return __first;
>    }
>
>  template<typename _OutputIterator, typename _Size, typename _Tp>
>    inline typename
>    __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type
>    __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)
>    {
>      const _Tp __tmp = __value;
>      for (; __n > 0; --__n, ++__first)
> *__first = __tmp;
>      return __first;
>    }
>
>  template<typename _Size, typename _Tp>
>    inline typename
>    __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type
>    __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c)
>    {
>      std::__fill_a(__first, __first + __n, __c);
>      return __first + __n;
>    }
># 791 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _OI, typename _Size, typename _Tp>
>    inline _OI
>    fill_n(_OI __first, _Size __n, const _Tp& __value)
>    {
>
>     
>
>      return _OI(std::__fill_n_a(std::__niter_base(__first), __n, __value));
>    }
>
>  template<bool _BoolType>
>    struct __equal
>    {
>      template<typename _II1, typename _II2>
>        static bool
>        equal(_II1 __first1, _II1 __last1, _II2 __first2)
>        {
>   for (; __first1 != __last1; ++__first1, ++__first2)
>     if (!(*__first1 == *__first2))
>       return false;
>   return true;
> }
>    };
>
>  template<>
>    struct __equal<true>
>    {
>      template<typename _Tp>
>        static bool
>        equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2)
>        {
>   return !__builtin_memcmp(__first1, __first2, sizeof(_Tp)
>       * (__last1 - __first1));
> }
>    };
>
>  template<typename _II1, typename _II2>
>    inline bool
>    __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)
>    {
>      typedef typename iterator_traits<_II1>::value_type _ValueType1;
>      typedef typename iterator_traits<_II2>::value_type _ValueType2;
>      const bool __simple = (__is_integer<_ValueType1>::__value
>                      && __is_pointer<_II1>::__value
>                      && __is_pointer<_II2>::__value
>        && __are_same<_ValueType1, _ValueType2>::__value);
>
>      return std::__equal<__simple>::equal(__first1, __last1, __first2);
>    }
>
>
>  template<typename, typename>
>    struct __lc_rai
>    {
>      template<typename _II1, typename _II2>
>        static _II1
>        __newlast1(_II1, _II1 __last1, _II2, _II2)
>        { return __last1; }
>
>      template<typename _II>
>        static bool
>        __cnd2(_II __first, _II __last)
>        { return __first != __last; }
>    };
>
>  template<>
>    struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag>
>    {
>      template<typename _RAI1, typename _RAI2>
>        static _RAI1
>        __newlast1(_RAI1 __first1, _RAI1 __last1,
>     _RAI2 __first2, _RAI2 __last2)
>        {
>   const typename iterator_traits<_RAI1>::difference_type
>     __diff1 = __last1 - __first1;
>   const typename iterator_traits<_RAI2>::difference_type
>     __diff2 = __last2 - __first2;
>   return __diff2 < __diff1 ? __first1 + __diff2 : __last1;
> }
>
>      template<typename _RAI>
>        static bool
>        __cnd2(_RAI, _RAI)
>        { return true; }
>    };
>
>  template<bool _BoolType>
>    struct __lexicographical_compare
>    {
>      template<typename _II1, typename _II2>
>        static bool __lc(_II1, _II1, _II2, _II2);
>    };
>
>  template<bool _BoolType>
>    template<typename _II1, typename _II2>
>      bool
>      __lexicographical_compare<_BoolType>::
>      __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)
>      {
> typedef typename iterator_traits<_II1>::iterator_category _Category1;
> typedef typename iterator_traits<_II2>::iterator_category _Category2;
> typedef std::__lc_rai<_Category1, _Category2> __rai_type;
>
> __last1 = __rai_type::__newlast1(__first1, __last1,
>      __first2, __last2);
> for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2);
>      ++__first1, ++__first2)
>   {
>     if (*__first1 < *__first2)
>       return true;
>     if (*__first2 < *__first1)
>       return false;
>   }
> return __first1 == __last1 && __first2 != __last2;
>      }
>
>  template<>
>    struct __lexicographical_compare<true>
>    {
>      template<typename _Tp, typename _Up>
>        static bool
>        __lc(const _Tp* __first1, const _Tp* __last1,
>      const _Up* __first2, const _Up* __last2)
> {
>   const size_t __len1 = __last1 - __first1;
>   const size_t __len2 = __last2 - __first2;
>   const int __result = __builtin_memcmp(__first1, __first2,
>      std::min(__len1, __len2));
>   return __result != 0 ? __result < 0 : __len1 < __len2;
> }
>    };
>
>  template<typename _II1, typename _II2>
>    inline bool
>    __lexicographical_compare_aux(_II1 __first1, _II1 __last1,
>      _II2 __first2, _II2 __last2)
>    {
>      typedef typename iterator_traits<_II1>::value_type _ValueType1;
>      typedef typename iterator_traits<_II2>::value_type _ValueType2;
>      const bool __simple =
> (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value
>  && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed
>  && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed
>  && __is_pointer<_II1>::__value
>  && __is_pointer<_II2>::__value);
>
>      return std::__lexicographical_compare<__simple>::__lc(__first1, __last1,
>           __first2, __last2);
>    }
># 952 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    _ForwardIterator
>    lower_bound(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _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;
>    }
>
>
>
>  template<typename _Size>
>    inline _Size
>    __lg(_Size __n)
>    {
>      _Size __k;
>      for (__k = 0; __n != 0; __n >>= 1)
> ++__k;
>      return __k - 1;
>    }
>
>  inline int
>  __lg(int __n)
>  { return sizeof(int) * 8 - 1 - __builtin_clz(__n); }
>
>  inline long
>  __lg(long __n)
>  { return sizeof(long) * 8 - 1 - __builtin_clzl(__n); }
>
>  inline long long
>  __lg(long long __n)
>  { return sizeof(long long) * 8 - 1 - __builtin_clzll(__n); }
>
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 1028 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _II1, typename _II2>
>    inline bool
>    equal(_II1 __first1, _II1 __last1, _II2 __first2)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      return std::__equal_aux(std::__niter_base(__first1),
>         std::__niter_base(__last1),
>         std::__niter_base(__first2));
>    }
># 1060 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
>    inline bool
>    equal(_IIter1 __first1, _IIter1 __last1,
>   _IIter2 __first2, _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!bool(__binary_pred(*__first1, *__first2)))
>   return false;
>      return true;
>    }
># 1091 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _II1, typename _II2>
>    inline bool
>    lexicographical_compare(_II1 __first1, _II1 __last1,
>       _II2 __first2, _II2 __last2)
>    {
>
>      typedef typename iterator_traits<_II1>::value_type _ValueType1;
>      typedef typename iterator_traits<_II2>::value_type _ValueType2;
>     
>     
>     
>     
>      ;
>      ;
>
>      return std::__lexicographical_compare_aux(std::__niter_base(__first1),
>      std::__niter_base(__last1),
>      std::__niter_base(__first2),
>      std::__niter_base(__last2));
>    }
># 1125 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _II1, typename _II2, typename _Compare>
>    bool
>    lexicographical_compare(_II1 __first1, _II1 __last1,
>       _II2 __first2, _II2 __last2, _Compare __comp)
>    {
>      typedef typename iterator_traits<_II1>::iterator_category _Category1;
>      typedef typename iterator_traits<_II2>::iterator_category _Category2;
>      typedef std::__lc_rai<_Category1, _Category2> __rai_type;
>
>
>     
>     
>      ;
>      ;
>
>      __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2);
>      for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2);
>    ++__first1, ++__first2)
> {
>   if (__comp(*__first1, *__first2))
>     return true;
>   if (__comp(*__first2, *__first1))
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
># 1165 "/usr/include/c++/4.5/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);
>    }
># 1202 "/usr/include/c++/4.5/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _BinaryPredicate>
>    pair<_InputIterator1, _InputIterator2>
>    mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      while (__first1 != __last1 && bool(__binary_pred(*__first1, *__first2)))
>        {
>   ++__first1;
>   ++__first2;
>        }
>      return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
>    }
>
>}
># 42 "/usr/include/c++/4.5/bits/char_traits.h" 2 3
># 1 "/usr/include/c++/4.5/bits/postypes.h" 1 3
># 40 "/usr/include/c++/4.5/bits/postypes.h" 3
>       
># 41 "/usr/include/c++/4.5/bits/postypes.h" 3
>
># 1 "/usr/include/c++/4.5/cwchar" 1 3
># 41 "/usr/include/c++/4.5/cwchar" 3
>       
># 42 "/usr/include/c++/4.5/cwchar" 3
>
>
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 45 "/usr/include/c++/4.5/cwchar" 2 3
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 52 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 352 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 3 4
>typedef unsigned int wint_t;
># 53 "/usr/include/wchar.h" 2 3 4
># 104 "/usr/include/wchar.h" 3 4
>
>
>typedef __mbstate_t mbstate_t;
>
>
>
># 129 "/usr/include/wchar.h" 3 4
>extern "C" {
>
>
>
>
>struct tm;
>
>
>
>
>
>
>
>
>
>extern wchar_t *wcscpy (wchar_t *__restrict __dest,
>   const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncpy (wchar_t *__restrict __dest,
>    const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern wchar_t *wcscat (wchar_t *__restrict __dest,
>   const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncat (wchar_t *__restrict __dest,
>    const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern int wcscmp (const wchar_t *__s1, const wchar_t *__s2)
>     throw () __attribute__ ((__pure__));
>
>extern int wcsncmp (const wchar_t *__s1, const wchar_t *__s2, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern int wcscasecmp (const wchar_t *__s1, const wchar_t *__s2) throw ();
>
>
>extern int wcsncasecmp (const wchar_t *__s1, const wchar_t *__s2,
>   size_t __n) throw ();
>
>
>
>
>
>extern int wcscasecmp_l (const wchar_t *__s1, const wchar_t *__s2,
>    __locale_t __loc) throw ();
>
>extern int wcsncasecmp_l (const wchar_t *__s1, const wchar_t *__s2,
>     size_t __n, __locale_t __loc) throw ();
>
>
>
>
>
>extern int wcscoll (const wchar_t *__s1, const wchar_t *__s2) throw ();
>
>
>
>extern size_t wcsxfrm (wchar_t *__restrict __s1,
>         const wchar_t *__restrict __s2, size_t __n) throw ();
>
>
>
>
>
>
>
>
>extern int wcscoll_l (const wchar_t *__s1, const wchar_t *__s2,
>        __locale_t __loc) throw ();
>
>
>
>
>extern size_t wcsxfrm_l (wchar_t *__s1, const wchar_t *__s2,
>    size_t __n, __locale_t __loc) throw ();
>
>
>extern wchar_t *wcsdup (const wchar_t *__s) throw () __attribute__ ((__malloc__));
>
>
>
>
>
>extern "C++" wchar_t *wcschr (wchar_t *__wcs, wchar_t __wc)
>     throw () __asm ("wcschr") __attribute__ ((__pure__));
>extern "C++" const wchar_t *wcschr (const wchar_t *__wcs, wchar_t __wc)
>     throw () __asm ("wcschr") __attribute__ ((__pure__));
>
>
>
>
>
>
>extern "C++" wchar_t *wcsrchr (wchar_t *__wcs, wchar_t __wc)
>     throw () __asm ("wcsrchr") __attribute__ ((__pure__));
>extern "C++" const wchar_t *wcsrchr (const wchar_t *__wcs, wchar_t __wc)
>     throw () __asm ("wcsrchr") __attribute__ ((__pure__));
>
>
>
>
>
>
>
>
>
>extern wchar_t *wcschrnul (const wchar_t *__s, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern size_t wcscspn (const wchar_t *__wcs, const wchar_t *__reject)
>     throw () __attribute__ ((__pure__));
>
>
>extern size_t wcsspn (const wchar_t *__wcs, const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>
>extern "C++" wchar_t *wcspbrk (wchar_t *__wcs, const wchar_t *__accept)
>     throw () __asm ("wcspbrk") __attribute__ ((__pure__));
>extern "C++" const wchar_t *wcspbrk (const wchar_t *__wcs,
>           const wchar_t *__accept)
>     throw () __asm ("wcspbrk") __attribute__ ((__pure__));
>
>
>
>
>
>
>extern "C++" wchar_t *wcsstr (wchar_t *__haystack, const wchar_t *__needle)
>     throw () __asm ("wcsstr") __attribute__ ((__pure__));
>extern "C++" const wchar_t *wcsstr (const wchar_t *__haystack,
>          const wchar_t *__needle)
>     throw () __asm ("wcsstr") __attribute__ ((__pure__));
>
>
>
>
>
>
>extern wchar_t *wcstok (wchar_t *__restrict __s,
>   const wchar_t *__restrict __delim,
>   wchar_t **__restrict __ptr) throw ();
>
>
>extern size_t wcslen (const wchar_t *__s) throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern "C++" wchar_t *wcswcs (wchar_t *__haystack, const wchar_t *__needle)
>     throw () __asm ("wcswcs") __attribute__ ((__pure__));
>extern "C++" const wchar_t *wcswcs (const wchar_t *__haystack,
>          const wchar_t *__needle)
>     throw () __asm ("wcswcs") __attribute__ ((__pure__));
># 303 "/usr/include/wchar.h" 3 4
>extern size_t wcsnlen (const wchar_t *__s, size_t __maxlen)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>
>extern "C++" wchar_t *wmemchr (wchar_t *__s, wchar_t __c, size_t __n)
>     throw () __asm ("wmemchr") __attribute__ ((__pure__));
>extern "C++" const wchar_t *wmemchr (const wchar_t *__s, wchar_t __c,
>           size_t __n)
>     throw () __asm ("wmemchr") __attribute__ ((__pure__));
>
>
>
>
>
>
>extern int wmemcmp (const wchar_t *__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 wint_t __btowc_alias (int __c) __asm ("btowc");
>extern __inline __attribute__ ((__gnu_inline__)) wint_t
>btowc (int __c) throw ()
>{ return (__builtin_constant_p (__c) && __c >= '\0' && __c <= '\x7f'
>   ? (wint_t) __c : __btowc_alias (__c)); }
>
>extern int __wctob_alias (wint_t __c) __asm ("wctob");
>extern __inline __attribute__ ((__gnu_inline__)) int
>wctob (wint_t __wc) throw ()
>{ return (__builtin_constant_p (__wc) && __wc >= L'\0' && __wc <= L'\x7f'
>   ? (int) __wc : __wctob_alias (__wc)); }
>
>extern __inline __attribute__ ((__gnu_inline__)) size_t
>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 ();
># 528 "/usr/include/wchar.h" 3 4
>extern long int wcstol_l (const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr, int __base,
>     __locale_t __loc) throw ();
>
>extern unsigned long int wcstoul_l (const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr,
>        int __base, __locale_t __loc) throw ();
>
>__extension__
>extern long long int wcstoll_l (const wchar_t *__restrict __nptr,
>    wchar_t **__restrict __endptr,
>    int __base, __locale_t __loc) throw ();
>
>__extension__
>extern unsigned long long int wcstoull_l (const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw ();
>
>extern double wcstod_l (const wchar_t *__restrict __nptr,
>   wchar_t **__restrict __endptr, __locale_t __loc)
>     throw ();
>
>extern float wcstof_l (const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr, __locale_t __loc)
>     throw ();
>
>extern long double wcstold_l (const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr,
>         __locale_t __loc) throw ();
>
>
>
>
>
>
>extern wchar_t *wcpcpy (wchar_t *__restrict __dest,
>   const wchar_t *__restrict __src) throw ();
>
>
>
>extern wchar_t *wcpncpy (wchar_t *__restrict __dest,
>    const wchar_t *__restrict __src, size_t __n)
>     throw ();
># 580 "/usr/include/wchar.h" 3 4
>extern __FILE *open_wmemstream (wchar_t **__bufloc, size_t *__sizeloc) throw ();
>
>
>
>
>
>
>extern int fwide (__FILE *__fp, int __mode) throw ();
>
>
>
>
>
>
>extern int fwprintf (__FILE *__restrict __stream,
>       const wchar_t *__restrict __format, ...)
>                                                           ;
>
>
>
>
>extern int wprintf (const wchar_t *__restrict __format, ...)
>                                                           ;
>
>extern int swprintf (wchar_t *__restrict __s, size_t __n,
>       const wchar_t *__restrict __format, ...)
>     throw () ;
>
>
>
>
>
>extern int vfwprintf (__FILE *__restrict __s,
>        const wchar_t *__restrict __format,
>        __gnuc_va_list __arg)
>                                                           ;
>
>
>
>
>extern int vwprintf (const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>                                                           ;
>
>
>extern int vswprintf (wchar_t *__restrict __s, size_t __n,
>        const wchar_t *__restrict __format,
>        __gnuc_va_list __arg)
>     throw () ;
>
>
>
>
>
>
>extern int fwscanf (__FILE *__restrict __stream,
>      const wchar_t *__restrict __format, ...)
>                                                          ;
>
>
>
>
>extern int wscanf (const wchar_t *__restrict __format, ...)
>                                                          ;
>
>extern int swscanf (const wchar_t *__restrict __s,
>      const wchar_t *__restrict __format, ...)
>     throw () ;
># 680 "/usr/include/wchar.h" 3 4
>
>
>
>
>
>
>
>
>
>extern int vfwscanf (__FILE *__restrict __s,
>       const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>                                                          ;
>
>
>
>
>extern int vwscanf (const wchar_t *__restrict __format,
>      __gnuc_va_list __arg)
>                                                          ;
>
>extern int vswscanf (const wchar_t *__restrict __s,
>       const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>     throw () ;
># 736 "/usr/include/wchar.h" 3 4
>
>
>
>
>
>
>
>
>
>extern wint_t fgetwc (__FILE *__stream);
>extern wint_t getwc (__FILE *__stream);
>
>
>
>
>
>extern wint_t getwchar (void);
>
>
>
>
>
>
>extern wint_t fputwc (wchar_t __wc, __FILE *__stream);
>extern wint_t putwc (wchar_t __wc, __FILE *__stream);
>
>
>
>
>
>extern wint_t putwchar (wchar_t __wc);
>
>
>
>
>
>
>
>extern wchar_t *fgetws (wchar_t *__restrict __ws, int __n,
>   __FILE *__restrict __stream);
>
>
>
>
>
>extern int fputws (const wchar_t *__restrict __ws,
>     __FILE *__restrict __stream);
>
>
>
>
>
>
>extern wint_t ungetwc (wint_t __wc, __FILE *__stream);
>
># 801 "/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);
># 827 "/usr/include/wchar.h" 3 4
>extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream);
>extern wint_t putwchar_unlocked (wchar_t __wc);
># 837 "/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 ();
># 891 "/usr/include/wchar.h" 3 4
>}
># 48 "/usr/include/c++/4.5/cwchar" 2 3
># 65 "/usr/include/c++/4.5/cwchar" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::mbstate_t;
>
>}
># 139 "/usr/include/c++/4.5/cwchar" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::wint_t;
>
>  using ::btowc;
>  using ::fgetwc;
>  using ::fgetws;
>  using ::fputwc;
>  using ::fputws;
>  using ::fwide;
>  using ::fwprintf;
>  using ::fwscanf;
>  using ::getwc;
>  using ::getwchar;
>  using ::mbrlen;
>  using ::mbrtowc;
>  using ::mbsinit;
>  using ::mbsrtowcs;
>  using ::putwc;
>  using ::putwchar;
>
>  using ::swprintf;
>
>  using ::swscanf;
>  using ::ungetwc;
>  using ::vfwprintf;
>
>  using ::vfwscanf;
>
>
>  using ::vswprintf;
>
>
>  using ::vswscanf;
>
>  using ::vwprintf;
>
>  using ::vwscanf;
>
>  using ::wcrtomb;
>  using ::wcscat;
>  using ::wcscmp;
>  using ::wcscoll;
>  using ::wcscpy;
>  using ::wcscspn;
>  using ::wcsftime;
>  using ::wcslen;
>  using ::wcsncat;
>  using ::wcsncmp;
>  using ::wcsncpy;
>  using ::wcsrtombs;
>  using ::wcsspn;
>  using ::wcstod;
>
>  using ::wcstof;
>
>  using ::wcstok;
>  using ::wcstol;
>  using ::wcstoul;
>  using ::wcsxfrm;
>  using ::wctob;
>  using ::wmemcmp;
>  using ::wmemcpy;
>  using ::wmemmove;
>  using ::wmemset;
>  using ::wprintf;
>  using ::wscanf;
>  using ::wcschr;
>  using ::wcspbrk;
>  using ::wcsrchr;
>  using ::wcsstr;
>  using ::wmemchr;
># 234 "/usr/include/c++/4.5/cwchar" 3
>}
>
>
>
>
>
>
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>
>
>
>
>
>  using ::wcstold;
># 258 "/usr/include/c++/4.5/cwchar" 3
>  using ::wcstoll;
>  using ::wcstoull;
>
>
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::__gnu_cxx::wcstold;
>  using ::__gnu_cxx::wcstoll;
>  using ::__gnu_cxx::wcstoull;
>
>}
># 43 "/usr/include/c++/4.5/bits/postypes.h" 2 3
># 70 "/usr/include/c++/4.5/bits/postypes.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 88 "/usr/include/c++/4.5/bits/postypes.h" 3
>  typedef long streamoff;
># 98 "/usr/include/c++/4.5/bits/postypes.h" 3
>  typedef ptrdiff_t streamsize;
># 111 "/usr/include/c++/4.5/bits/postypes.h" 3
>  template<typename _StateT>
>    class fpos
>    {
>    private:
>      streamoff _M_off;
>      _StateT _M_state;
>
>    public:
>
>
>
>
>      fpos()
>      : _M_off(0), _M_state() { }
># 133 "/usr/include/c++/4.5/bits/postypes.h" 3
>      fpos(streamoff __off)
>      : _M_off(__off), _M_state() { }
>
>
>      operator streamoff() const { return _M_off; }
>
>
>      void
>      state(_StateT __st)
>      { _M_state = __st; }
>
>
>      _StateT
>      state() const
>      { return _M_state; }
>
>
>
>
>
>      fpos&
>      operator+=(streamoff __off)
>      {
> _M_off += __off;
> return *this;
>      }
>
>
>
>
>
>      fpos&
>      operator-=(streamoff __off)
>      {
> _M_off -= __off;
> return *this;
>      }
>
>
>
>
>
>
>
>      fpos
>      operator+(streamoff __off) const
>      {
> fpos __pos(*this);
> __pos += __off;
> return __pos;
>      }
>
>
>
>
>
>
>
>      fpos
>      operator-(streamoff __off) const
>      {
> fpos __pos(*this);
> __pos -= __off;
> return __pos;
>      }
>
>
>
>
>
>
>      streamoff
>      operator-(const fpos& __other) const
>      { return _M_off - __other._M_off; }
>    };
>
>
>
>
>
>
>  template<typename _StateT>
>    inline bool
>    operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
>    { return streamoff(__lhs) == streamoff(__rhs); }
>
>  template<typename _StateT>
>    inline bool
>    operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
>    { return streamoff(__lhs) != streamoff(__rhs); }
>
>
>
>
>
>  typedef fpos<mbstate_t> streampos;
>
>  typedef fpos<mbstate_t> wstreampos;
># 239 "/usr/include/c++/4.5/bits/postypes.h" 3
>}
># 43 "/usr/include/c++/4.5/bits/char_traits.h" 2 3
># 1 "/usr/include/c++/4.5/cwchar" 1 3
># 41 "/usr/include/c++/4.5/cwchar" 3
>       
># 42 "/usr/include/c++/4.5/cwchar" 3
>
>
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 45 "/usr/include/c++/4.5/cwchar" 2 3
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/c++/4.5/cwchar" 2 3
># 44 "/usr/include/c++/4.5/bits/char_traits.h" 2 3
># 52 "/usr/include/c++/4.5/bits/char_traits.h" 3
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
># 64 "/usr/include/c++/4.5/bits/char_traits.h" 3
>  template<typename _CharT>
>    struct _Char_types
>    {
>      typedef unsigned long int_type;
>      typedef std::streampos pos_type;
>      typedef std::streamoff off_type;
>      typedef std::mbstate_t state_type;
>    };
># 89 "/usr/include/c++/4.5/bits/char_traits.h" 3
>  template<typename _CharT>
>    struct char_traits
>    {
>      typedef _CharT char_type;
>      typedef typename _Char_types<_CharT>::int_type int_type;
>      typedef typename _Char_types<_CharT>::pos_type pos_type;
>      typedef typename _Char_types<_CharT>::off_type off_type;
>      typedef typename _Char_types<_CharT>::state_type state_type;
>
>      static void
>      assign(char_type& __c1, const char_type& __c2)
>      { __c1 = __c2; }
>
>      static bool
>      eq(const char_type& __c1, const char_type& __c2)
>      { return __c1 == __c2; }
>
>      static bool
>      lt(const char_type& __c1, const char_type& __c2)
>      { return __c1 < __c2; }
>
>      static int
>      compare(const char_type* __s1, const char_type* __s2, std::size_t __n);
>
>      static std::size_t
>      length(const char_type* __s);
>
>      static const char_type*
>      find(const char_type* __s, std::size_t __n, const char_type& __a);
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, std::size_t __n);
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, std::size_t __n);
>
>      static char_type*
>      assign(char_type* __s, std::size_t __n, char_type __a);
>
>      static char_type
>      to_char_type(const int_type& __c)
>      { return static_cast<char_type>(__c); }
>
>      static int_type
>      to_int_type(const char_type& __c)
>      { return static_cast<int_type>(__c); }
>
>      static bool
>      eq_int_type(const int_type& __c1, const int_type& __c2)
>      { return __c1 == __c2; }
>
>      static int_type
>      eof()
>      { return static_cast<int_type>((-1)); }
>
>      static int_type
>      not_eof(const int_type& __c)
>      { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); }
>    };
>
>  template<typename _CharT>
>    int
>    char_traits<_CharT>::
>    compare(const char_type* __s1, const char_type* __s2, std::size_t __n)
>    {
>      for (std::size_t __i = 0; __i < __n; ++__i)
> if (lt(__s1[__i], __s2[__i]))
>   return -1;
> else if (lt(__s2[__i], __s1[__i]))
>   return 1;
>      return 0;
>    }
>
>  template<typename _CharT>
>    std::size_t
>    char_traits<_CharT>::
>    length(const char_type* __p)
>    {
>      std::size_t __i = 0;
>      while (!eq(__p[__i], char_type()))
>        ++__i;
>      return __i;
>    }
>
>  template<typename _CharT>
>    const typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    find(const char_type* __s, std::size_t __n, const char_type& __a)
>    {
>      for (std::size_t __i = 0; __i < __n; ++__i)
>        if (eq(__s[__i], __a))
>          return __s + __i;
>      return 0;
>    }
>
>  template<typename _CharT>
>    typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    move(char_type* __s1, const char_type* __s2, std::size_t __n)
>    {
>      return static_cast<_CharT*>(__builtin_memmove(__s1, __s2,
>          __n * sizeof(char_type)));
>    }
>
>  template<typename _CharT>
>    typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    copy(char_type* __s1, const char_type* __s2, std::size_t __n)
>    {
>
>      std::copy(__s2, __s2 + __n, __s1);
>      return __s1;
>    }
>
>  template<typename _CharT>
>    typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    assign(char_type* __s, std::size_t __n, char_type __a)
>    {
>
>      std::fill_n(__s, __n, __a);
>      return __s;
>    }
>
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 230 "/usr/include/c++/4.5/bits/char_traits.h" 3
>  template<class _CharT>
>    struct char_traits : public __gnu_cxx::char_traits<_CharT>
>    { };
>
>
>
>  template<>
>    struct char_traits<char>
>    {
>      typedef char char_type;
>      typedef int int_type;
>      typedef streampos pos_type;
>      typedef streamoff off_type;
>      typedef mbstate_t state_type;
>
>      static void
>      assign(char_type& __c1, const char_type& __c2)
>      { __c1 = __c2; }
>
>      static bool
>      eq(const char_type& __c1, const char_type& __c2)
>      { return __c1 == __c2; }
>
>      static bool
>      lt(const char_type& __c1, const char_type& __c2)
>      { return __c1 < __c2; }
>
>      static int
>      compare(const char_type* __s1, const char_type* __s2, size_t __n)
>      { return __builtin_memcmp(__s1, __s2, __n); }
>
>      static size_t
>      length(const char_type* __s)
>      { return __builtin_strlen(__s); }
>
>      static const char_type*
>      find(const char_type* __s, size_t __n, const char_type& __a)
>      { return static_cast<const char_type*>(__builtin_memchr(__s, __a, __n)); }
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, size_t __n)
>      { return static_cast<char_type*>(__builtin_memmove(__s1, __s2, __n)); }
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, size_t __n)
>      { return static_cast<char_type*>(__builtin_memcpy(__s1, __s2, __n)); }
>
>      static char_type*
>      assign(char_type* __s, size_t __n, char_type __a)
>      { return static_cast<char_type*>(__builtin_memset(__s, __a, __n)); }
>
>      static char_type
>      to_char_type(const int_type& __c)
>      { return static_cast<char_type>(__c); }
>
>
>
>      static int_type
>      to_int_type(const char_type& __c)
>      { return static_cast<int_type>(static_cast<unsigned char>(__c)); }
>
>      static bool
>      eq_int_type(const int_type& __c1, const int_type& __c2)
>      { return __c1 == __c2; }
>
>      static int_type
>      eof()
>      { return static_cast<int_type>((-1)); }
>
>      static int_type
>      not_eof(const int_type& __c)
>      { return (__c == eof()) ? 0 : __c; }
>  };
>
>
>
>
>  template<>
>    struct char_traits<wchar_t>
>    {
>      typedef wchar_t char_type;
>      typedef wint_t int_type;
>      typedef streamoff off_type;
>      typedef wstreampos pos_type;
>      typedef mbstate_t state_type;
>
>      static void
>      assign(char_type& __c1, const char_type& __c2)
>      { __c1 = __c2; }
>
>      static bool
>      eq(const char_type& __c1, const char_type& __c2)
>      { return __c1 == __c2; }
>
>      static bool
>      lt(const char_type& __c1, const char_type& __c2)
>      { return __c1 < __c2; }
>
>      static int
>      compare(const char_type* __s1, const char_type* __s2, size_t __n)
>      { return wmemcmp(__s1, __s2, __n); }
>
>      static size_t
>      length(const char_type* __s)
>      { return wcslen(__s); }
>
>      static const char_type*
>      find(const char_type* __s, size_t __n, const char_type& __a)
>      { return wmemchr(__s, __a, __n); }
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, size_t __n)
>      { return wmemmove(__s1, __s2, __n); }
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, size_t __n)
>      { return wmemcpy(__s1, __s2, __n); }
>
>      static char_type*
>      assign(char_type* __s, size_t __n, char_type __a)
>      { return wmemset(__s, __a, __n); }
>
>      static char_type
>      to_char_type(const int_type& __c)
>      { return char_type(__c); }
>
>      static int_type
>      to_int_type(const char_type& __c)
>      { return int_type(__c); }
>
>      static bool
>      eq_int_type(const int_type& __c1, const int_type& __c2)
>      { return __c1 == __c2; }
>
>      static int_type
>      eof()
>      { return static_cast<int_type>((0xffffffffu)); }
>
>      static int_type
>      not_eof(const int_type& __c)
>      { return eq_int_type(__c, eof()) ? 0 : __c; }
>  };
>
>
>}
># 43 "/usr/include/c++/4.5/string" 2 3
># 1 "/usr/include/c++/4.5/bits/allocator.h" 1 3
># 48 "/usr/include/c++/4.5/bits/allocator.h" 3
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++allocator.h" 1 3
># 34 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++allocator.h" 3
># 1 "/usr/include/c++/4.5/ext/new_allocator.h" 1 3
># 33 "/usr/include/c++/4.5/ext/new_allocator.h" 3
># 1 "/usr/include/c++/4.5/new" 1 3
># 39 "/usr/include/c++/4.5/new" 3
>       
># 40 "/usr/include/c++/4.5/new" 3
>
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 42 "/usr/include/c++/4.5/new" 2 3
># 1 "/usr/include/c++/4.5/exception" 1 3
># 35 "/usr/include/c++/4.5/exception" 3
>       
># 36 "/usr/include/c++/4.5/exception" 3
>
>#pragma GCC visibility push(default)
>
>
>
>extern "C++" {
>
>namespace std
>{
># 61 "/usr/include/c++/4.5/exception" 3
>  class exception
>  {
>  public:
>    exception() throw() { }
>    virtual ~exception() throw();
>
>
>
>    virtual const char* what() const throw();
>  };
>
>
>
>  class bad_exception : public exception
>  {
>  public:
>    bad_exception() throw() { }
>
>
>
>    virtual ~bad_exception() throw();
>
>
>    virtual const char* what() const throw();
>  };
>
>
>  typedef void (*terminate_handler) ();
>
>
>  typedef void (*unexpected_handler) ();
>
>
>  terminate_handler set_terminate(terminate_handler) throw();
>
>
>
>  void terminate() throw() __attribute__ ((__noreturn__));
>
>
>  unexpected_handler set_unexpected(unexpected_handler) throw();
>
>
>
>  void unexpected() __attribute__ ((__noreturn__));
># 118 "/usr/include/c++/4.5/exception" 3
>  bool uncaught_exception() throw() __attribute__ ((__pure__));
>
>
>}
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
># 141 "/usr/include/c++/4.5/exception" 3
>  void __verbose_terminate_handler();
>
>}
>
>}
>
>#pragma GCC visibility pop
># 43 "/usr/include/c++/4.5/new" 2 3
>
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
>
>
>
>
>
>
>  class bad_alloc : public exception
>  {
>  public:
>    bad_alloc() throw() { }
>
>
>
>    virtual ~bad_alloc() throw();
>
>
>    virtual const char* what() const throw();
>  };
>
>  struct nothrow_t { };
>
>  extern const nothrow_t nothrow;
>
>
>
>  typedef void (*new_handler)();
>
>
>
>  new_handler set_new_handler(new_handler) throw();
>}
># 93 "/usr/include/c++/4.5/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
># 34 "/usr/include/c++/4.5/ext/new_allocator.h" 2 3
>
>
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>  using std::size_t;
>  using std::ptrdiff_t;
># 50 "/usr/include/c++/4.5/ext/new_allocator.h" 3
>  template<typename _Tp>
>    class new_allocator
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef new_allocator<_Tp1> other; };
>
>      new_allocator() throw() { }
>
>      new_allocator(const new_allocator&) throw() { }
>
>      template<typename _Tp1>
>        new_allocator(const new_allocator<_Tp1>&) throw() { }
>
>      ~new_allocator() throw() { }
>
>      pointer
>      address(reference __x) const { return &__x; }
>
>      const_pointer
>      address(const_reference __x) const { return &__x; }
>
>
>
>      pointer
>      allocate(size_type __n, const void* = 0)
>      {
> if (__n > this->max_size())
>   std::__throw_bad_alloc();
>
> return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
>      }
>
>
>      void
>      deallocate(pointer __p, size_type)
>      { ::operator delete(__p); }
>
>      size_type
>      max_size() const throw()
>      { return size_t(-1) / sizeof(_Tp); }
>
>
>
>      void
>      construct(pointer __p, const _Tp& __val)
>      { ::new((void *)__p) _Tp(__val); }
># 114 "/usr/include/c++/4.5/ext/new_allocator.h" 3
>      void
>      destroy(pointer __p) { __p->~_Tp(); }
>    };
>
>  template<typename _Tp>
>    inline bool
>    operator==(const new_allocator<_Tp>&, const new_allocator<_Tp>&)
>    { return true; }
>
>  template<typename _Tp>
>    inline bool
>    operator!=(const new_allocator<_Tp>&, const new_allocator<_Tp>&)
>    { return false; }
>
>}
># 35 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++allocator.h" 2 3
># 49 "/usr/include/c++/4.5/bits/allocator.h" 2 3
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 59 "/usr/include/c++/4.5/bits/allocator.h" 3
>  template<typename _Tp>
>    class allocator;
>
>
>  template<>
>    class allocator<void>
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef void* pointer;
>      typedef const void* const_pointer;
>      typedef void value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef allocator<_Tp1> other; };
>    };
># 85 "/usr/include/c++/4.5/bits/allocator.h" 3
>  template<typename _Tp>
>    class allocator: public __gnu_cxx::new_allocator<_Tp>
>    {
>   public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef allocator<_Tp1> other; };
>
>      allocator() throw() { }
>
>      allocator(const allocator& __a) throw()
>      : __gnu_cxx::new_allocator<_Tp>(__a) { }
>
>      template<typename _Tp1>
>        allocator(const allocator<_Tp1>&) throw() { }
>
>      ~allocator() throw() { }
>
>
>    };
>
>  template<typename _T1, typename _T2>
>    inline bool
>    operator==(const allocator<_T1>&, const allocator<_T2>&)
>    { return true; }
>
>  template<typename _Tp>
>    inline bool
>    operator==(const allocator<_Tp>&, const allocator<_Tp>&)
>    { return true; }
>
>  template<typename _T1, typename _T2>
>    inline bool
>    operator!=(const allocator<_T1>&, const allocator<_T2>&)
>    { return false; }
>
>  template<typename _Tp>
>    inline bool
>    operator!=(const allocator<_Tp>&, const allocator<_Tp>&)
>    { return false; }
>
>
>
>
>
>  extern template class allocator<char>;
>  extern template class allocator<wchar_t>;
>
>
>
>
>
>
>  template<typename _Alloc, bool = __is_empty(_Alloc)>
>    struct __alloc_swap
>    { static void _S_do_it(_Alloc&, _Alloc&) { } };
>
>  template<typename _Alloc>
>    struct __alloc_swap<_Alloc, false>
>    {
>      static void
>      _S_do_it(_Alloc& __one, _Alloc& __two)
>      {
>
> if (__one != __two)
>   swap(__one, __two);
>      }
>    };
>
>
>  template<typename _Alloc, bool = __is_empty(_Alloc)>
>    struct __alloc_neq
>    {
>      static bool
>      _S_do_it(const _Alloc&, const _Alloc&)
>      { return false; }
>    };
>
>  template<typename _Alloc>
>    struct __alloc_neq<_Alloc, false>
>    {
>      static bool
>      _S_do_it(const _Alloc& __one, const _Alloc& __two)
>      { return __one != __two; }
>    };
># 204 "/usr/include/c++/4.5/bits/allocator.h" 3
>}
># 44 "/usr/include/c++/4.5/string" 2 3
>
># 1 "/usr/include/c++/4.5/bits/localefwd.h" 1 3
># 39 "/usr/include/c++/4.5/bits/localefwd.h" 3
>       
># 40 "/usr/include/c++/4.5/bits/localefwd.h" 3
>
>
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++locale.h" 1 3
># 40 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++locale.h" 3
>       
># 41 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++locale.h" 3
>
># 1 "/usr/include/c++/4.5/clocale" 1 3
># 41 "/usr/include/c++/4.5/clocale" 3
>       
># 42 "/usr/include/c++/4.5/clocale" 3
>
>
># 1 "/usr/include/locale.h" 1 3 4
># 29 "/usr/include/locale.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 30 "/usr/include/locale.h" 2 3 4
># 1 "/usr/include/bits/locale.h" 1 3 4
># 27 "/usr/include/bits/locale.h" 3 4
>enum
>{
>  __LC_CTYPE = 0,
>  __LC_NUMERIC = 1,
>  __LC_TIME = 2,
>  __LC_COLLATE = 3,
>  __LC_MONETARY = 4,
>  __LC_MESSAGES = 5,
>  __LC_ALL = 6,
>  __LC_PAPER = 7,
>  __LC_NAME = 8,
>  __LC_ADDRESS = 9,
>  __LC_TELEPHONE = 10,
>  __LC_MEASUREMENT = 11,
>  __LC_IDENTIFICATION = 12
>};
># 31 "/usr/include/locale.h" 2 3 4
>
>extern "C" {
># 51 "/usr/include/locale.h" 3 4
>
>
>
>struct lconv
>{
>
>
>  char *decimal_point;
>  char *thousands_sep;
>
>
>
>
>
>  char *grouping;
>
>
>
>
>
>  char *int_curr_symbol;
>  char *currency_symbol;
>  char *mon_decimal_point;
>  char *mon_thousands_sep;
>  char *mon_grouping;
>  char *positive_sign;
>  char *negative_sign;
>  char int_frac_digits;
>  char frac_digits;
>
>  char p_cs_precedes;
>
>  char p_sep_by_space;
>
>  char n_cs_precedes;
>
>  char n_sep_by_space;
>
>
>
>
>
>
>  char p_sign_posn;
>  char n_sign_posn;
>
>
>  char int_p_cs_precedes;
>
>  char int_p_sep_by_space;
>
>  char int_n_cs_precedes;
>
>  char int_n_sep_by_space;
>
>
>
>
>
>
>  char int_p_sign_posn;
>  char int_n_sign_posn;
># 121 "/usr/include/locale.h" 3 4
>};
>
>
>
>extern char *setlocale (int __category, const char *__locale) throw ();
>
>
>extern struct lconv *localeconv (void) throw ();
>
>
># 152 "/usr/include/locale.h" 3 4
>extern __locale_t newlocale (int __category_mask, const char *__locale,
>        __locale_t __base) throw ();
># 187 "/usr/include/locale.h" 3 4
>extern __locale_t duplocale (__locale_t __dataset) throw ();
>
>
>
>extern void freelocale (__locale_t __dataset) throw ();
>
>
>
>
>
>
>extern __locale_t uselocale (__locale_t __dataset) throw ();
>
>
>
>
>
>
>
>}
># 45 "/usr/include/c++/4.5/clocale" 2 3
># 53 "/usr/include/c++/4.5/clocale" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::lconv;
>  using ::setlocale;
>  using ::localeconv;
>
>}
># 43 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 44 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++locale.h" 2 3
>
>
>
>
>
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>  extern "C" __typeof(uselocale) __uselocale;
>
>}
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  typedef __locale_t __c_locale;
>
>
>
>
>
>  inline int
>  __convert_from_v(const __c_locale& __cloc __attribute__ ((__unused__)),
>     char* __out,
>     const int __size __attribute__ ((__unused__)),
>     const char* __fmt, ...)
>  {
>
>    __c_locale __old = __gnu_cxx::__uselocale(__cloc);
># 85 "/usr/include/c++/4.5/x86_64-suse-linux/bits/c++locale.h" 3
>    __builtin_va_list __args;
>    __builtin_va_start(__args, __fmt);
>
>
>    const int __ret = __builtin_vsnprintf(__out, __size, __fmt, __args);
>
>
>
>
>    __builtin_va_end(__args);
>
>
>    __gnu_cxx::__uselocale(__old);
>
>
>
>
>
>
>
>    return __ret;
>  }
>
>}
># 43 "/usr/include/c++/4.5/bits/localefwd.h" 2 3
># 1 "/usr/include/c++/4.5/iosfwd" 1 3
># 38 "/usr/include/c++/4.5/iosfwd" 3
>       
># 39 "/usr/include/c++/4.5/iosfwd" 3
>
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 74 "/usr/include/c++/4.5/iosfwd" 3
>  class ios_base;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ios;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_streambuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_istream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ostream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_iostream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>     typename _Alloc = allocator<_CharT> >
>    class basic_stringbuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_istringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_ostringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_stringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_filebuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ifstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ofstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_fstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class istreambuf_iterator;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class ostreambuf_iterator;
>
>
>
>
>  typedef basic_ios<char> ios;
>  typedef basic_streambuf<char> streambuf;
>  typedef basic_istream<char> istream;
>  typedef basic_ostream<char> ostream;
>  typedef basic_iostream<char> iostream;
>  typedef basic_stringbuf<char> stringbuf;
>  typedef basic_istringstream<char> istringstream;
>  typedef basic_ostringstream<char> ostringstream;
>  typedef basic_stringstream<char> stringstream;
>  typedef basic_filebuf<char> filebuf;
>  typedef basic_ifstream<char> ifstream;
>  typedef basic_ofstream<char> ofstream;
>  typedef basic_fstream<char> fstream;
>
>
>  typedef basic_ios<wchar_t> wios;
>  typedef basic_streambuf<wchar_t> wstreambuf;
>  typedef basic_istream<wchar_t> wistream;
>  typedef basic_ostream<wchar_t> wostream;
>  typedef basic_iostream<wchar_t> wiostream;
>  typedef basic_stringbuf<wchar_t> wstringbuf;
>  typedef basic_istringstream<wchar_t> wistringstream;
>  typedef basic_ostringstream<wchar_t> wostringstream;
>  typedef basic_stringstream<wchar_t> wstringstream;
>  typedef basic_filebuf<wchar_t> wfilebuf;
>  typedef basic_ifstream<wchar_t> wifstream;
>  typedef basic_ofstream<wchar_t> wofstream;
>  typedef basic_fstream<wchar_t> wfstream;
>
>
>
>}
># 44 "/usr/include/c++/4.5/bits/localefwd.h" 2 3
># 1 "/usr/include/c++/4.5/cctype" 1 3
># 41 "/usr/include/c++/4.5/cctype" 3
>       
># 42 "/usr/include/c++/4.5/cctype" 3
># 64 "/usr/include/c++/4.5/cctype" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::isalnum;
>  using ::isalpha;
>  using ::iscntrl;
>  using ::isdigit;
>  using ::isgraph;
>  using ::islower;
>  using ::isprint;
>  using ::ispunct;
>  using ::isspace;
>  using ::isupper;
>  using ::isxdigit;
>  using ::tolower;
>  using ::toupper;
>
>}
># 45 "/usr/include/c++/4.5/bits/localefwd.h" 2 3
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 55 "/usr/include/c++/4.5/bits/localefwd.h" 3
>  class locale;
>
>  template<typename _Facet>
>    bool
>    has_facet(const locale&) throw();
>
>  template<typename _Facet>
>    const _Facet&
>    use_facet(const locale&);
>
>
>  template<typename _CharT>
>    bool
>    isspace(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isprint(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    iscntrl(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isupper(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    islower(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isalpha(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isdigit(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    ispunct(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isxdigit(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isalnum(_CharT, const locale&);
>
>  template<typename _CharT>
>    bool
>    isgraph(_CharT, const locale&);
>
>  template<typename _CharT>
>    _CharT
>    toupper(_CharT, const locale&);
>
>  template<typename _CharT>
>    _CharT
>    tolower(_CharT, const locale&);
>
>
>  class ctype_base;
>  template<typename _CharT>
>    class ctype;
>  template<> class ctype<char>;
>
>  template<> class ctype<wchar_t>;
>
>  template<typename _CharT>
>    class ctype_byname;
>
>
>  class codecvt_base;
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt;
>  template<> class codecvt<char, char, mbstate_t>;
>
>  template<> class codecvt<wchar_t, char, mbstate_t>;
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt_byname;
>
>
>
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class num_get;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class num_put;
>
>  template<typename _CharT> class numpunct;
>  template<typename _CharT> class numpunct_byname;
>
>
>  template<typename _CharT>
>    class collate;
>  template<typename _CharT> class
>    collate_byname;
>
>
>  class time_base;
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class time_get;
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class time_get_byname;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class time_put;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class time_put_byname;
>
>
>  class money_base;
>
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class money_get;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class money_put;
>
>  template<typename _CharT, bool _Intl = false>
>    class moneypunct;
>  template<typename _CharT, bool _Intl = false>
>    class moneypunct_byname;
>
>
>  class messages_base;
>  template<typename _CharT>
>    class messages;
>  template<typename _CharT>
>    class messages_byname;
>
>}
># 46 "/usr/include/c++/4.5/string" 2 3
># 1 "/usr/include/c++/4.5/bits/ostream_insert.h" 1 3
># 33 "/usr/include/c++/4.5/bits/ostream_insert.h" 3
>       
># 34 "/usr/include/c++/4.5/bits/ostream_insert.h" 3
>
>
># 1 "/usr/include/c++/4.5/cxxabi-forced.h" 1 3
># 33 "/usr/include/c++/4.5/cxxabi-forced.h" 3
>       
># 34 "/usr/include/c++/4.5/cxxabi-forced.h" 3
>
>#pragma GCC visibility push(default)
>
>
>namespace __cxxabiv1
>{
>
>
>
>
>
>
>
>  class __forced_unwind
>  {
>    virtual ~__forced_unwind() throw();
>
>
>    virtual void __pure_dummy() = 0;
>  };
>}
>
>
>#pragma GCC visibility pop
># 37 "/usr/include/c++/4.5/bits/ostream_insert.h" 2 3
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _CharT, typename _Traits>
>    inline void
>    __ostream_write(basic_ostream<_CharT, _Traits>& __out,
>      const _CharT* __s, streamsize __n)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typedef typename __ostream_type::ios_base __ios_base;
>
>      const streamsize __put = __out.rdbuf()->sputn(__s, __n);
>      if (__put != __n)
> __out.setstate(__ios_base::badbit);
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline void
>    __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typedef typename __ostream_type::ios_base __ios_base;
>
>      const _CharT __c = __out.fill();
>      for (; __n > 0; --__n)
> {
>   const typename _Traits::int_type __put = __out.rdbuf()->sputc(__c);
>   if (_Traits::eq_int_type(__put, _Traits::eof()))
>     {
>       __out.setstate(__ios_base::badbit);
>       break;
>     }
> }
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    __ostream_insert(basic_ostream<_CharT, _Traits>& __out,
>       const _CharT* __s, streamsize __n)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typedef typename __ostream_type::ios_base __ios_base;
>
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       if (__w > __n)
>  {
>    const bool __left = ((__out.flags()
>     & __ios_base::adjustfield)
>           == __ios_base::left);
>    if (!__left)
>      __ostream_fill(__out, __w - __n);
>    if (__out.good())
>      __ostream_write(__out, __s, __n);
>    if (__left && __out.good())
>      __ostream_fill(__out, __w - __n);
>  }
>       else
>  __ostream_write(__out, __s, __n);
>       __out.width(0);
>     }
>   catch(__cxxabiv1::__forced_unwind&)
>     {
>       __out._M_setstate(__ios_base::badbit);
>       throw;
>     }
>   catch(...)
>     { __out._M_setstate(__ios_base::badbit); }
> }
>      return __out;
>    }
>
>
>
>
>
>  extern template ostream& __ostream_insert(ostream&, const char*, streamsize);
>
>
>  extern template wostream& __ostream_insert(wostream&, const wchar_t*,
>          streamsize);
>
>
>
>}
># 47 "/usr/include/c++/4.5/string" 2 3
>
>
>
># 1 "/usr/include/c++/4.5/bits/stl_function.h" 1 3
># 60 "/usr/include/c++/4.5/bits/stl_function.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 99 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Arg, typename _Result>
>    struct unary_function
>    {
>      typedef _Arg argument_type;
>
>
>      typedef _Result result_type;
>    };
>
>
>
>
>  template<typename _Arg1, typename _Arg2, typename _Result>
>    struct binary_function
>    {
>      typedef _Arg1 first_argument_type;
>
>
>      typedef _Arg2 second_argument_type;
>      typedef _Result result_type;
>    };
># 134 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Tp>
>    struct plus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x + __y; }
>    };
>
>
>  template<typename _Tp>
>    struct minus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x - __y; }
>    };
>
>
>  template<typename _Tp>
>    struct multiplies : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x * __y; }
>    };
>
>
>  template<typename _Tp>
>    struct divides : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x / __y; }
>    };
>
>
>  template<typename _Tp>
>    struct modulus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x % __y; }
>    };
>
>
>  template<typename _Tp>
>    struct negate : public unary_function<_Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x) const
>      { return -__x; }
>    };
># 198 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Tp>
>    struct equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x == __y; }
>    };
>
>
>  template<typename _Tp>
>    struct not_equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x != __y; }
>    };
>
>
>  template<typename _Tp>
>    struct greater : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x > __y; }
>    };
>
>
>  template<typename _Tp>
>    struct less : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x < __y; }
>    };
>
>
>  template<typename _Tp>
>    struct greater_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x >= __y; }
>    };
>
>
>  template<typename _Tp>
>    struct less_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x <= __y; }
>    };
># 262 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Tp>
>    struct logical_and : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x && __y; }
>    };
>
>
>  template<typename _Tp>
>    struct logical_or : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x || __y; }
>    };
>
>
>  template<typename _Tp>
>    struct logical_not : public unary_function<_Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x) const
>      { return !__x; }
>    };
>
>
>
>
>  template<typename _Tp>
>    struct bit_and : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x & __y; }
>    };
>
>  template<typename _Tp>
>    struct bit_or : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x | __y; }
>    };
>
>  template<typename _Tp>
>    struct bit_xor : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x ^ __y; }
>    };
># 345 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Predicate>
>    class unary_negate
>    : public unary_function<typename _Predicate::argument_type, bool>
>    {
>    protected:
>      _Predicate _M_pred;
>
>    public:
>      explicit
>      unary_negate(const _Predicate& __x) : _M_pred(__x) { }
>
>      bool
>      operator()(const typename _Predicate::argument_type& __x) const
>      { return !_M_pred(__x); }
>    };
>
>
>  template<typename _Predicate>
>    inline unary_negate<_Predicate>
>    not1(const _Predicate& __pred)
>    { return unary_negate<_Predicate>(__pred); }
>
>
>  template<typename _Predicate>
>    class binary_negate
>    : public binary_function<typename _Predicate::first_argument_type,
>        typename _Predicate::second_argument_type, bool>
>    {
>    protected:
>      _Predicate _M_pred;
>
>    public:
>      explicit
>      binary_negate(const _Predicate& __x) : _M_pred(__x) { }
>
>      bool
>      operator()(const typename _Predicate::first_argument_type& __x,
>   const typename _Predicate::second_argument_type& __y) const
>      { return !_M_pred(__x, __y); }
>    };
>
>
>  template<typename _Predicate>
>    inline binary_negate<_Predicate>
>    not2(const _Predicate& __pred)
>    { return binary_negate<_Predicate>(__pred); }
># 416 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Arg, typename _Result>
>    class pointer_to_unary_function : public unary_function<_Arg, _Result>
>    {
>    protected:
>      _Result (*_M_ptr)(_Arg);
>
>    public:
>      pointer_to_unary_function() { }
>
>      explicit
>      pointer_to_unary_function(_Result (*__x)(_Arg))
>      : _M_ptr(__x) { }
>
>      _Result
>      operator()(_Arg __x) const
>      { return _M_ptr(__x); }
>    };
>
>
>  template<typename _Arg, typename _Result>
>    inline pointer_to_unary_function<_Arg, _Result>
>    ptr_fun(_Result (*__x)(_Arg))
>    { return pointer_to_unary_function<_Arg, _Result>(__x); }
>
>
>  template<typename _Arg1, typename _Arg2, typename _Result>
>    class pointer_to_binary_function
>    : public binary_function<_Arg1, _Arg2, _Result>
>    {
>    protected:
>      _Result (*_M_ptr)(_Arg1, _Arg2);
>
>    public:
>      pointer_to_binary_function() { }
>
>      explicit
>      pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))
>      : _M_ptr(__x) { }
>
>      _Result
>      operator()(_Arg1 __x, _Arg2 __y) const
>      { return _M_ptr(__x, __y); }
>    };
>
>
>  template<typename _Arg1, typename _Arg2, typename _Result>
>    inline pointer_to_binary_function<_Arg1, _Arg2, _Result>
>    ptr_fun(_Result (*__x)(_Arg1, _Arg2))
>    { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); }
>
>
>  template<typename _Tp>
>    struct _Identity : public unary_function<_Tp,_Tp>
>    {
>      _Tp&
>      operator()(_Tp& __x) const
>      { return __x; }
>
>      const _Tp&
>      operator()(const _Tp& __x) const
>      { return __x; }
>    };
>
>  template<typename _Pair>
>    struct _Select1st : public unary_function<_Pair,
>           typename _Pair::first_type>
>    {
>      typename _Pair::first_type&
>      operator()(_Pair& __x) const
>      { return __x.first; }
>
>      const typename _Pair::first_type&
>      operator()(const _Pair& __x) const
>      { return __x.first; }
>    };
>
>  template<typename _Pair>
>    struct _Select2nd : public unary_function<_Pair,
>           typename _Pair::second_type>
>    {
>      typename _Pair::second_type&
>      operator()(_Pair& __x) const
>      { return __x.second; }
>
>      const typename _Pair::second_type&
>      operator()(const _Pair& __x) const
>      { return __x.second; }
>    };
># 523 "/usr/include/c++/4.5/bits/stl_function.h" 3
>  template<typename _Ret, typename _Tp>
>    class mem_fun_t : public unary_function<_Tp*, _Ret>
>    {
>    public:
>      explicit
>      mem_fun_t(_Ret (_Tp::*__pf)())
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(_Tp* __p) const
>      { return (__p->*_M_f)(); }
>
>    private:
>      _Ret (_Tp::*_M_f)();
>    };
>
>
>
>  template<typename _Ret, typename _Tp>
>    class const_mem_fun_t : public unary_function<const _Tp*, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun_t(_Ret (_Tp::*__pf)() const)
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(const _Tp* __p) const
>      { return (__p->*_M_f)(); }
>
>    private:
>      _Ret (_Tp::*_M_f)() const;
>    };
>
>
>
>  template<typename _Ret, typename _Tp>
>    class mem_fun_ref_t : public unary_function<_Tp, _Ret>
>    {
>    public:
>      explicit
>      mem_fun_ref_t(_Ret (_Tp::*__pf)())
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(_Tp& __r) const
>      { return (__r.*_M_f)(); }
>
>    private:
>      _Ret (_Tp::*_M_f)();
>  };
>
>
>
>  template<typename _Ret, typename _Tp>
>    class const_mem_fun_ref_t : public unary_function<_Tp, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(const _Tp& __r) const
>      { return (__r.*_M_f)(); }
>
>    private:
>      _Ret (_Tp::*_M_f)() const;
>    };
>
>
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret>
>    {
>    public:
>      explicit
>      mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(_Tp* __p, _Arg __x) const
>      { return (__p->*_M_f)(__x); }
>
>    private:
>      _Ret (_Tp::*_M_f)(_Arg);
>    };
>
>
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(const _Tp* __p, _Arg __x) const
>      { return (__p->*_M_f)(__x); }
>
>    private:
>      _Ret (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
>    {
>    public:
>      explicit
>      mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(_Tp& __r, _Arg __x) const
>      { return (__r.*_M_f)(__x); }
>
>    private:
>      _Ret (_Tp::*_M_f)(_Arg);
>    };
>
>
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) { }
>
>      _Ret
>      operator()(const _Tp& __r, _Arg __x) const
>      { return (__r.*_M_f)(__x); }
>
>    private:
>      _Ret (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>
>  template<typename _Ret, typename _Tp>
>    inline mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)())
>    { return mem_fun_t<_Ret, _Tp>(__f); }
>
>  template<typename _Ret, typename _Tp>
>    inline const_mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_t<_Ret, _Tp>(__f); }
>
>  template<typename _Ret, typename _Tp>
>    inline mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)())
>    { return mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template<typename _Ret, typename _Tp>
>    inline const_mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    inline mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    inline const_mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg) const)
>    { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    inline mem_fun1_ref_t<_Ret, _Tp, _Arg>
>    mem_fun_ref(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); }
>
>  template<typename _Ret, typename _Tp, typename _Arg>
>    inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg>
>    mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const)
>    { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); }
>
>
>
>}
>
>
># 1 "/usr/include/c++/4.5/backward/binders.h" 1 3
># 60 "/usr/include/c++/4.5/backward/binders.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 97 "/usr/include/c++/4.5/backward/binders.h" 3
>  template<typename _Operation>
>    class binder1st
>    : public unary_function<typename _Operation::second_argument_type,
>       typename _Operation::result_type>
>    {
>    protected:
>      _Operation op;
>      typename _Operation::first_argument_type value;
>
>    public:
>      binder1st(const _Operation& __x,
>  const typename _Operation::first_argument_type& __y)
>      : op(__x), value(__y) { }
>
>      typename _Operation::result_type
>      operator()(const typename _Operation::second_argument_type& __x) const
>      { return op(value, __x); }
>
>
>
>      typename _Operation::result_type
>      operator()(typename _Operation::second_argument_type& __x) const
>      { return op(value, __x); }
>    } ;
>
>
>  template<typename _Operation, typename _Tp>
>    inline binder1st<_Operation>
>    bind1st(const _Operation& __fn, const _Tp& __x)
>    {
>      typedef typename _Operation::first_argument_type _Arg1_type;
>      return binder1st<_Operation>(__fn, _Arg1_type(__x));
>    }
>
>
>  template<typename _Operation>
>    class binder2nd
>    : public unary_function<typename _Operation::first_argument_type,
>       typename _Operation::result_type>
>    {
>    protected:
>      _Operation op;
>      typename _Operation::second_argument_type value;
>
>    public:
>      binder2nd(const _Operation& __x,
>  const typename _Operation::second_argument_type& __y)
>      : op(__x), value(__y) { }
>
>      typename _Operation::result_type
>      operator()(const typename _Operation::first_argument_type& __x) const
>      { return op(__x, value); }
>
>
>
>      typename _Operation::result_type
>      operator()(typename _Operation::first_argument_type& __x) const
>      { return op(__x, value); }
>    } ;
>
>
>  template<typename _Operation, typename _Tp>
>    inline binder2nd<_Operation>
>    bind2nd(const _Operation& __fn, const _Tp& __x)
>    {
>      typedef typename _Operation::second_argument_type _Arg2_type;
>      return binder2nd<_Operation>(__fn, _Arg2_type(__x));
>    }
>
>
>}
># 713 "/usr/include/c++/4.5/bits/stl_function.h" 2 3
># 51 "/usr/include/c++/4.5/string" 2 3
>
>
># 1 "/usr/include/c++/4.5/bits/basic_string.h" 1 3
># 39 "/usr/include/c++/4.5/bits/basic_string.h" 3
>       
># 40 "/usr/include/c++/4.5/bits/basic_string.h" 3
>
># 1 "/usr/include/c++/4.5/ext/atomicity.h" 1 3
># 34 "/usr/include/c++/4.5/ext/atomicity.h" 3
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr.h" 1 3
># 30 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr.h" 3
>#pragma GCC visibility push(default)
># 162 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr.h" 3
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr-default.h" 1 3
># 41 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr-default.h" 3
># 1 "/usr/include/pthread.h" 1 3 4
># 25 "/usr/include/pthread.h" 3 4
># 1 "/usr/include/sched.h" 1 3 4
># 29 "/usr/include/sched.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 30 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/time.h" 1 3 4
># 120 "/usr/include/time.h" 3 4
>struct timespec
>  {
>    __time_t tv_sec;
>    long int tv_nsec;
>  };
># 33 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/bits/sched.h" 1 3 4
># 71 "/usr/include/bits/sched.h" 3 4
>struct sched_param
>  {
>    int __sched_priority;
>  };
>
>extern "C" {
>
>
>
>extern int clone (int (*__fn) (void *__arg), void *__child_stack,
>    int __flags, void *__arg, ...) throw ();
>
>
>extern int unshare (int __flags) throw ();
>
>
>extern int sched_getcpu (void) throw ();
>
>
>}
>
>
>
>
>
>
>
>struct __sched_param
>  {
>    int __sched_priority;
>  };
># 113 "/usr/include/bits/sched.h" 3 4
>typedef unsigned long int __cpu_mask;
>
>
>
>
>
>
>typedef struct
>{
>  __cpu_mask __bits[4096 / (8 * sizeof (__cpu_mask))];
>} cpu_set_t;
># 196 "/usr/include/bits/sched.h" 3 4
>extern "C" {
>
>extern int __sched_cpucount (size_t __setsize, const cpu_set_t *__setp)
>  throw ();
>extern cpu_set_t *__sched_cpualloc (size_t __count) throw () ;
>extern void __sched_cpufree (cpu_set_t *__set) throw ();
>
>}
># 36 "/usr/include/sched.h" 2 3 4
>
>
>
>
>extern "C" {
>
>
>extern int sched_setparam (__pid_t __pid, const struct sched_param *__param)
>     throw ();
>
>
>extern int sched_getparam (__pid_t __pid, struct sched_param *__param) throw ();
>
>
>extern int sched_setscheduler (__pid_t __pid, int __policy,
>          const struct sched_param *__param) throw ();
>
>
>extern int sched_getscheduler (__pid_t __pid) throw ();
>
>
>extern int sched_yield (void) throw ();
>
>
>extern int sched_get_priority_max (int __algorithm) throw ();
>
>
>extern int sched_get_priority_min (int __algorithm) throw ();
>
>
>extern int sched_rr_get_interval (__pid_t __pid, struct timespec *__t) throw ();
># 110 "/usr/include/sched.h" 3 4
>extern int sched_setaffinity (__pid_t __pid, size_t __cpusetsize,
>         const cpu_set_t *__cpuset) throw ();
>
>
>extern int sched_getaffinity (__pid_t __pid, size_t __cpusetsize,
>         cpu_set_t *__cpuset) throw ();
>
>
>}
># 26 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/time.h" 1 3 4
># 30 "/usr/include/time.h" 3 4
>extern "C" {
>
>
>
>
>
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/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
># 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;
># 131 "/usr/include/time.h" 3 4
>
>
>struct tm
>{
>  int tm_sec;
>  int tm_min;
>  int tm_hour;
>  int tm_mday;
>  int tm_mon;
>  int tm_year;
>  int tm_wday;
>  int tm_yday;
>  int tm_isdst;
>
>
>  long int tm_gmtoff;
>  const char *tm_zone;
>
>
>
>
>};
>
>
>
>
>
>
>
>
>struct itimerspec
>  {
>    struct timespec it_interval;
>    struct timespec it_value;
>  };
>
>
>struct sigevent;
>
>
>
>
>
>typedef __pid_t pid_t;
>
>
>
>
>
>
>
>
>extern clock_t clock (void) throw ();
>
>
>extern time_t time (time_t *__timer) throw ();
>
>
>extern double difftime (time_t __time1, time_t __time0)
>     throw () __attribute__ ((__const__));
>
>
>extern time_t mktime (struct tm *__tp) throw ();
>
>
>
>
>
>extern size_t strftime (char *__restrict __s, size_t __maxsize,
>   const char *__restrict __format,
>   const struct tm *__restrict __tp) throw ();
>
>
>
>
>
>extern char *strptime (const char *__restrict __s,
>         const char *__restrict __fmt, struct tm *__tp)
>     throw ();
>
>
>
>
>
>
>
>extern size_t strftime_l (char *__restrict __s, size_t __maxsize,
>     const char *__restrict __format,
>     const struct tm *__restrict __tp,
>     __locale_t __loc) throw ();
>
>
>
>extern char *strptime_l (const char *__restrict __s,
>    const char *__restrict __fmt, struct tm *__tp,
>    __locale_t __loc) throw ();
>
>
>
>
>
>
>extern struct tm *gmtime (const time_t *__timer) throw ();
>
>
>
>extern struct tm *localtime (const time_t *__timer) throw ();
>
>
>
>
>
>extern struct tm *gmtime_r (const time_t *__restrict __timer,
>       struct tm *__restrict __tp) throw ();
>
>
>
>extern struct tm *localtime_r (const time_t *__restrict __timer,
>          struct tm *__restrict __tp) throw ();
>
>
>
>
>
>extern char *asctime (const struct tm *__tp) throw ();
>
>
>extern char *ctime (const time_t *__timer) throw ();
>
>
>
>
>
>
>
>extern char *asctime_r (const struct tm *__restrict __tp,
>   char *__restrict __buf) throw ();
>
>
>extern char *ctime_r (const time_t *__restrict __timer,
>        char *__restrict __buf) throw ();
>
>
>
>
>extern char *__tzname[2];
>extern int __daylight;
>extern long int __timezone;
>
>
>
>
>extern char *tzname[2];
>
>
>
>extern void tzset (void) throw ();
>
>
>
>extern int daylight;
>extern long int timezone;
>
>
>
>
>
>extern int stime (const time_t *__when) throw ();
># 313 "/usr/include/time.h" 3 4
>extern time_t timegm (struct tm *__tp) throw ();
>
>
>extern time_t timelocal (struct tm *__tp) throw ();
>
>
>extern int dysize (int __year) throw () __attribute__ ((__const__));
># 328 "/usr/include/time.h" 3 4
>extern int nanosleep (const struct timespec *__requested_time,
>        struct timespec *__remaining);
>
>
>
>extern int clock_getres (clockid_t __clock_id, struct timespec *__res) throw ();
>
>
>extern int clock_gettime (clockid_t __clock_id, struct timespec *__tp) throw ();
>
>
>extern int clock_settime (clockid_t __clock_id, const struct timespec *__tp)
>     throw ();
>
>
>
>
>
>
>extern int clock_nanosleep (clockid_t __clock_id, int __flags,
>       const struct timespec *__req,
>       struct timespec *__rem);
>
>
>extern int clock_getcpuclockid (pid_t __pid, clockid_t *__clock_id) throw ();
>
>
>
>
>extern int timer_create (clockid_t __clock_id,
>    struct sigevent *__restrict __evp,
>    timer_t *__restrict __timerid) throw ();
>
>
>extern int timer_delete (timer_t __timerid) throw ();
>
>
>extern int timer_settime (timer_t __timerid, int __flags,
>     const struct itimerspec *__restrict __value,
>     struct itimerspec *__restrict __ovalue) throw ();
>
>
>extern int timer_gettime (timer_t __timerid, struct itimerspec *__value)
>     throw ();
>
>
>extern int timer_getoverrun (timer_t __timerid) throw ();
># 390 "/usr/include/time.h" 3 4
>extern int getdate_err;
># 399 "/usr/include/time.h" 3 4
>extern struct tm *getdate (const char *__string);
># 413 "/usr/include/time.h" 3 4
>extern int getdate_r (const char *__restrict __string,
>        struct tm *__restrict __resbufp);
>
>
>}
># 27 "/usr/include/pthread.h" 2 3 4
>
>
># 1 "/usr/include/signal.h" 1 3 4
># 31 "/usr/include/signal.h" 3 4
>extern "C" {
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 24 "/usr/include/bits/sigset.h" 3 4
>typedef int __sig_atomic_t;
>
>
>
>
>typedef struct
>  {
>    unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))];
>  } __sigset_t;
># 34 "/usr/include/signal.h" 2 3 4
># 50 "/usr/include/signal.h" 3 4
>typedef __sigset_t sigset_t;
># 408 "/usr/include/signal.h" 3 4
>}
># 30 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/pthreadtypes.h" 1 3 4
># 23 "/usr/include/bits/pthreadtypes.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 24 "/usr/include/bits/pthreadtypes.h" 2 3 4
># 50 "/usr/include/bits/pthreadtypes.h" 3 4
>typedef unsigned long int pthread_t;
>
>
>typedef union
>{
>  char __size[56];
>  long int __align;
>} pthread_attr_t;
>
>
>
>typedef struct __pthread_internal_list
>{
>  struct __pthread_internal_list *__prev;
>  struct __pthread_internal_list *__next;
>} __pthread_list_t;
># 76 "/usr/include/bits/pthreadtypes.h" 3 4
>typedef union
>{
>  struct __pthread_mutex_s
>  {
>    int __lock;
>    unsigned int __count;
>    int __owner;
>
>    unsigned int __nusers;
>
>
>
>    int __kind;
>
>    int __spins;
>    __pthread_list_t __list;
># 101 "/usr/include/bits/pthreadtypes.h" 3 4
>  } __data;
>  char __size[40];
>  long int __align;
>} pthread_mutex_t;
>
>typedef union
>{
>  char __size[4];
>  int __align;
>} pthread_mutexattr_t;
>
>
>
>
>typedef union
>{
>  struct
>  {
>    int __lock;
>    unsigned int __futex;
>    __extension__ unsigned long long int __total_seq;
>    __extension__ unsigned long long int __wakeup_seq;
>    __extension__ unsigned long long int __woken_seq;
>    void *__mutex;
>    unsigned int __nwaiters;
>    unsigned int __broadcast_seq;
>  } __data;
>  char __size[48];
>  __extension__ long long int __align;
>} pthread_cond_t;
>
>typedef union
>{
>  char __size[4];
>  int __align;
>} pthread_condattr_t;
>
>
>
>typedef unsigned int pthread_key_t;
>
>
>
>typedef int pthread_once_t;
>
>
>
>
>
>typedef union
>{
>
>  struct
>  {
>    int __lock;
>    unsigned int __nr_readers;
>    unsigned int __readers_wakeup;
>    unsigned int __writer_wakeup;
>    unsigned int __nr_readers_queued;
>    unsigned int __nr_writers_queued;
>    int __writer;
>    int __shared;
>    unsigned long int __pad1;
>    unsigned long int __pad2;
>
>
>    unsigned int __flags;
>  } __data;
># 187 "/usr/include/bits/pthreadtypes.h" 3 4
>  char __size[56];
>  long int __align;
>} pthread_rwlock_t;
>
>typedef union
>{
>  char __size[8];
>  long int __align;
>} pthread_rwlockattr_t;
>
>
>
>
>
>typedef volatile int pthread_spinlock_t;
>
>
>
>
>typedef union
>{
>  char __size[32];
>  long int __align;
>} pthread_barrier_t;
>
>typedef union
>{
>  char __size[4];
>  int __align;
>} pthread_barrierattr_t;
># 31 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/setjmp.h" 1 3 4
># 27 "/usr/include/bits/setjmp.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 28 "/usr/include/bits/setjmp.h" 2 3 4
>
>
>
>
>typedef long int __jmp_buf[8];
># 32 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 33 "/usr/include/pthread.h" 2 3 4
>
>
>
>enum
>{
>  PTHREAD_CREATE_JOINABLE,
>
>  PTHREAD_CREATE_DETACHED
>
>};
>
>
>
>enum
>{
>  PTHREAD_MUTEX_TIMED_NP,
>  PTHREAD_MUTEX_RECURSIVE_NP,
>  PTHREAD_MUTEX_ERRORCHECK_NP,
>  PTHREAD_MUTEX_ADAPTIVE_NP
>
>  ,
>  PTHREAD_MUTEX_NORMAL = PTHREAD_MUTEX_TIMED_NP,
>  PTHREAD_MUTEX_RECURSIVE = PTHREAD_MUTEX_RECURSIVE_NP,
>  PTHREAD_MUTEX_ERRORCHECK = PTHREAD_MUTEX_ERRORCHECK_NP,
>  PTHREAD_MUTEX_DEFAULT = PTHREAD_MUTEX_NORMAL
>
>
>
>  , PTHREAD_MUTEX_FAST_NP = PTHREAD_MUTEX_TIMED_NP
>
>};
>
>
>
>
>enum
>{
>  PTHREAD_MUTEX_STALLED,
>  PTHREAD_MUTEX_STALLED_NP = PTHREAD_MUTEX_STALLED,
>  PTHREAD_MUTEX_ROBUST,
>  PTHREAD_MUTEX_ROBUST_NP = PTHREAD_MUTEX_ROBUST
>};
>
>
>
>
>
>enum
>{
>  PTHREAD_PRIO_NONE,
>  PTHREAD_PRIO_INHERIT,
>  PTHREAD_PRIO_PROTECT
>};
># 117 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_RWLOCK_PREFER_READER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP,
>  PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_READER_NP
>};
># 149 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_INHERIT_SCHED,
>
>  PTHREAD_EXPLICIT_SCHED
>
>};
>
>
>
>enum
>{
>  PTHREAD_SCOPE_SYSTEM,
>
>  PTHREAD_SCOPE_PROCESS
>
>};
>
>
>
>enum
>{
>  PTHREAD_PROCESS_PRIVATE,
>
>  PTHREAD_PROCESS_SHARED
>
>};
># 184 "/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
>
>};
># 222 "/usr/include/pthread.h" 3 4
>extern "C" {
>
>
>
>
>extern int pthread_create (pthread_t *__restrict __newthread,
>      const pthread_attr_t *__restrict __attr,
>      void *(*__start_routine) (void *),
>      void *__restrict __arg) throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>
>
>extern void pthread_exit (void *__retval) __attribute__ ((__noreturn__));
>
>
>
>
>
>
>
>extern int pthread_join (pthread_t __th, void **__thread_return);
>
>
>
>
>extern int pthread_tryjoin_np (pthread_t __th, void **__thread_return) throw ();
>
>
>
>
>
>
>
>extern int pthread_timedjoin_np (pthread_t __th, void **__thread_return,
>     const struct timespec *__abstime);
>
>
>
>
>
>
>extern int pthread_detach (pthread_t __th) throw ();
>
>
>
>extern pthread_t pthread_self (void) throw () __attribute__ ((__const__));
>
>
>extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw ();
>
>
>
>
>
>
>
>extern int pthread_attr_init (pthread_attr_t *__attr) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_destroy (pthread_attr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_getdetachstate (const pthread_attr_t *__attr,
>     int *__detachstate)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setdetachstate (pthread_attr_t *__attr,
>     int __detachstate)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getguardsize (const pthread_attr_t *__attr,
>          size_t *__guardsize)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setguardsize (pthread_attr_t *__attr,
>          size_t __guardsize)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getschedparam (const pthread_attr_t *__restrict
>           __attr,
>           struct sched_param *__restrict __param)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setschedparam (pthread_attr_t *__restrict __attr,
>           const struct sched_param *__restrict
>           __param) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_getschedpolicy (const pthread_attr_t *__restrict
>     __attr, int *__restrict __policy)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_getinheritsched (const pthread_attr_t *__restrict
>      __attr, int *__restrict __inherit)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setinheritsched (pthread_attr_t *__attr,
>      int __inherit)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getscope (const pthread_attr_t *__restrict __attr,
>      int *__restrict __scope)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_getstackaddr (const pthread_attr_t *__restrict
>          __attr, void **__restrict __stackaddr)
>     throw () __attribute__ ((__nonnull__ (1, 2))) __attribute__ ((__deprecated__));
>
>
>
>
>
>extern int pthread_attr_setstackaddr (pthread_attr_t *__attr,
>          void *__stackaddr)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__));
>
>
>extern int pthread_attr_getstacksize (const pthread_attr_t *__restrict
>          __attr, size_t *__restrict __stacksize)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int pthread_attr_setstacksize (pthread_attr_t *__attr,
>          size_t __stacksize)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getstack (const pthread_attr_t *__restrict __attr,
>      void **__restrict __stackaddr,
>      size_t *__restrict __stacksize)
>     throw () __attribute__ ((__nonnull__ (1, 2, 3)));
>
>
>
>
>extern int pthread_attr_setstack (pthread_attr_t *__attr, void *__stackaddr,
>      size_t __stacksize) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int pthread_attr_setaffinity_np (pthread_attr_t *__attr,
>     size_t __cpusetsize,
>     const cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>extern int pthread_attr_getaffinity_np (const pthread_attr_t *__attr,
>     size_t __cpusetsize,
>     cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>
>
>extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>
>
>extern int pthread_setschedparam (pthread_t __target_thread, int __policy,
>      const struct sched_param *__param)
>     throw () __attribute__ ((__nonnull__ (3)));
>
>
>extern int pthread_getschedparam (pthread_t __target_thread,
>      int *__restrict __policy,
>      struct sched_param *__restrict __param)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>
>extern int pthread_setschedprio (pthread_t __target_thread, int __prio)
>     throw ();
>
>
>
>
>extern int pthread_getconcurrency (void) throw ();
>
>
>extern int pthread_setconcurrency (int __level) throw ();
>
>
>
>
>
>
>
>extern int pthread_yield (void) throw ();
>
>
>
>
>extern int pthread_setaffinity_np (pthread_t __th, size_t __cpusetsize,
>       const cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (3)));
>
>
>extern int pthread_getaffinity_np (pthread_t __th, size_t __cpusetsize,
>       cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (3)));
># 468 "/usr/include/pthread.h" 3 4
>extern int pthread_once (pthread_once_t *__once_control,
>    void (*__init_routine) (void)) __attribute__ ((__nonnull__ (1, 2)));
># 480 "/usr/include/pthread.h" 3 4
>extern int pthread_setcancelstate (int __state, int *__oldstate);
>
>
>
>extern int pthread_setcanceltype (int __type, int *__oldtype);
>
>
>extern int pthread_cancel (pthread_t __th);
>
>
>
>
>extern void pthread_testcancel (void);
>
>
>
>
>typedef struct
>{
>  struct
>  {
>    __jmp_buf __cancel_jmp_buf;
>    int __mask_was_saved;
>  } __cancel_jmp_buf[1];
>  void *__pad[4];
>} __pthread_unwind_buf_t __attribute__ ((__aligned__));
># 514 "/usr/include/pthread.h" 3 4
>struct __pthread_cleanup_frame
>{
>  void (*__cancel_routine) (void *);
>  void *__cancel_arg;
>  int __do_it;
>  int __cancel_type;
>};
>
>
>
>
>class __pthread_cleanup_class
>{
>  void (*__cancel_routine) (void *);
>  void *__cancel_arg;
>  int __do_it;
>  int __cancel_type;
>
> public:
>  __pthread_cleanup_class (void (*__fct) (void *), void *__arg)
>    : __cancel_routine (__fct), __cancel_arg (__arg), __do_it (1) { }
>  ~__pthread_cleanup_class () { if (__do_it) __cancel_routine (__cancel_arg); }
>  void __setdoit (int __newval) { __do_it = __newval; }
>  void __defer () { pthread_setcanceltype (PTHREAD_CANCEL_DEFERRED,
>        &__cancel_type); }
>  void __restore () const { pthread_setcanceltype (__cancel_type, 0); }
>};
># 716 "/usr/include/pthread.h" 3 4
>struct __jmp_buf_tag;
>extern int __sigsetjmp (struct __jmp_buf_tag *__env, int __savemask) throw ();
>
>
>
>
>
>extern int pthread_mutex_init (pthread_mutex_t *__mutex,
>          const pthread_mutexattr_t *__mutexattr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutex_destroy (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutex_trylock (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutex_lock (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_mutex_timedlock (pthread_mutex_t *__restrict __mutex,
>                                    const struct timespec *__restrict
>                                    __abstime) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutex_unlock (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int pthread_mutex_getprioceiling (const pthread_mutex_t *
>      __restrict __mutex,
>      int *__restrict __prioceiling)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutex_setprioceiling (pthread_mutex_t *__restrict __mutex,
>      int __prioceiling,
>      int *__restrict __old_ceiling)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>
>
>extern int pthread_mutex_consistent_np (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>extern int pthread_mutex_consistent_np (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
># 782 "/usr/include/pthread.h" 3 4
>extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_getpshared (const pthread_mutexattr_t *
>      __restrict __attr,
>      int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_mutexattr_setpshared (pthread_mutexattr_t *__attr,
>      int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_mutexattr_gettype (const pthread_mutexattr_t *__restrict
>          __attr, int *__restrict __kind)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_getprotocol (const pthread_mutexattr_t *
>       __restrict __attr,
>       int *__restrict __protocol)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutexattr_setprotocol (pthread_mutexattr_t *__attr,
>       int __protocol)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_getprioceiling (const pthread_mutexattr_t *
>          __restrict __attr,
>          int *__restrict __prioceiling)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_mutexattr_setprioceiling (pthread_mutexattr_t *__attr,
>          int __prioceiling)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int pthread_mutexattr_getrobust (const pthread_mutexattr_t *__attr,
>     int *__robustness)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int pthread_mutexattr_getrobust_np (const pthread_mutexattr_t *__attr,
>        int *__robustness)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutexattr_setrobust (pthread_mutexattr_t *__attr,
>     int __robustness)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>extern int pthread_mutexattr_setrobust_np (pthread_mutexattr_t *__attr,
>        int __robustness)
>     throw () __attribute__ ((__nonnull__ (1)));
># 864 "/usr/include/pthread.h" 3 4
>extern int pthread_rwlock_init (pthread_rwlock_t *__restrict __rwlock,
>    const pthread_rwlockattr_t *__restrict
>    __attr) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock)
>  throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock,
>           const struct timespec *__restrict
>           __abstime) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock,
>           const struct timespec *__restrict
>           __abstime) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlockattr_getpshared (const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr,
>       int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlockattr_getkind_np (const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pref)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr,
>       int __pref) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int pthread_cond_init (pthread_cond_t *__restrict __cond,
>         const pthread_condattr_t *__restrict
>         __cond_attr) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_cond_destroy (pthread_cond_t *__cond)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_cond_signal (pthread_cond_t *__cond)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_cond_broadcast (pthread_cond_t *__cond)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int pthread_cond_wait (pthread_cond_t *__restrict __cond,
>         pthread_mutex_t *__restrict __mutex)
>     __attribute__ ((__nonnull__ (1, 2)));
># 976 "/usr/include/pthread.h" 3 4
>extern int pthread_cond_timedwait (pthread_cond_t *__restrict __cond,
>       pthread_mutex_t *__restrict __mutex,
>       const struct timespec *__restrict
>       __abstime) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>
>
>
>extern int pthread_condattr_init (pthread_condattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_condattr_destroy (pthread_condattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_condattr_getpshared (const pthread_condattr_t *
>                                        __restrict __attr,
>                                        int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_condattr_setpshared (pthread_condattr_t *__attr,
>                                        int __pshared) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_condattr_getclock (const pthread_condattr_t *
>          __restrict __attr,
>          __clockid_t *__restrict __clock_id)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_condattr_setclock (pthread_condattr_t *__attr,
>          __clockid_t __clock_id)
>     throw () __attribute__ ((__nonnull__ (1)));
># 1020 "/usr/include/pthread.h" 3 4
>extern int pthread_spin_init (pthread_spinlock_t *__lock, int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_destroy (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_lock (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_trylock (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_unlock (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int pthread_barrier_init (pthread_barrier_t *__restrict __barrier,
>     const pthread_barrierattr_t *__restrict
>     __attr, unsigned int __count)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrier_destroy (pthread_barrier_t *__barrier)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrier_wait (pthread_barrier_t *__barrier)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_barrierattr_init (pthread_barrierattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrierattr_destroy (pthread_barrierattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrierattr_getpshared (const pthread_barrierattr_t *
>        __restrict __attr,
>        int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_barrierattr_setpshared (pthread_barrierattr_t *__attr,
>                                           int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
># 1087 "/usr/include/pthread.h" 3 4
>extern int pthread_key_create (pthread_key_t *__key,
>          void (*__destr_function) (void *))
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_key_delete (pthread_key_t __key) throw ();
>
>
>extern void *pthread_getspecific (pthread_key_t __key) throw ();
>
>
>extern int pthread_setspecific (pthread_key_t __key,
>    const void *__pointer) throw () ;
>
>
>
>
>extern int pthread_getcpuclockid (pthread_t __thread_id,
>      __clockid_t *__clock_id)
>     throw () __attribute__ ((__nonnull__ (2)));
># 1121 "/usr/include/pthread.h" 3 4
>extern int pthread_atfork (void (*__prepare) (void),
>      void (*__parent) (void),
>      void (*__child) (void)) throw ();
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) int
>pthread_equal (pthread_t __thread1, pthread_t __thread2) throw ()
>{
>  return __thread1 == __thread2;
>}
>
>
>}
># 42 "/usr/include/c++/4.5/x86_64-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" {
># 203 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/bits/posix_opt.h" 1 3 4
># 204 "/usr/include/unistd.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/environments.h" 1 3 4
># 23 "/usr/include/bits/environments.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 24 "/usr/include/bits/environments.h" 2 3 4
># 208 "/usr/include/unistd.h" 2 3 4
># 221 "/usr/include/unistd.h" 3 4
>typedef __ssize_t ssize_t;
>
>
>
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 228 "/usr/include/unistd.h" 2 3 4
>
>
>
>
>
>typedef __gid_t gid_t;
>
>
>
>
>typedef __uid_t uid_t;
>
>
>
>
>
>typedef __off_t off_t;
>
>
>
>
>
>
>typedef __off64_t off64_t;
>
>
>
>
>typedef __useconds_t useconds_t;
># 275 "/usr/include/unistd.h" 3 4
>typedef __socklen_t socklen_t;
># 288 "/usr/include/unistd.h" 3 4
>extern int access (const char *__name, int __type) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int euidaccess (const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int eaccess (const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int faccessat (int __fd, const char *__file, int __type, int __flag)
>     throw () __attribute__ ((__nonnull__ (2))) ;
># 331 "/usr/include/unistd.h" 3 4
>extern __off_t lseek (int __fd, __off_t __offset, int __whence) throw ();
># 342 "/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) ;
># 373 "/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) ;
># 401 "/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 () ;
>
>
>
>
>extern int pipe2 (int __pipedes[2], int __flags) throw () ;
># 429 "/usr/include/unistd.h" 3 4
>extern unsigned int alarm (unsigned int __seconds) throw ();
># 441 "/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);
># 465 "/usr/include/unistd.h" 3 4
>extern int pause (void);
>
>
>
>extern int chown (const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchown (int __fd, __uid_t __owner, __gid_t __group) throw () ;
>
>
>
>
>extern int lchown (const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>extern int fchownat (int __fd, const char *__file, __uid_t __owner,
>       __gid_t __group, int __flag)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int chdir (const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchdir (int __fd) throw () ;
># 507 "/usr/include/unistd.h" 3 4
>extern char *getcwd (char *__buf, size_t __size) throw () ;
>
>
>
>
>
>extern char *get_current_dir_name (void) throw ();
>
>
>
>
>
>
>extern char *getwd (char *__buf)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__)) ;
>
>
>
>
>extern int dup (int __fd) throw () ;
>
>
>extern int dup2 (int __fd, int __fd2) throw ();
>
>
>
>
>extern int dup3 (int __fd, int __fd2, int __flags) 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 execvpe (const char *__file, char *const __argv[],
>      char *const __envp[])
>     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,
>
>
>    _SC_V7_ILP32_OFF32,
>
>    _SC_V7_ILP32_OFFBIG,
>
>    _SC_V7_LP64_OFF64,
>
>    _SC_V7_LPBIG_OFFBIG,
>
>
>    _SC_SS_REPL_MAX,
>
>
>    _SC_TRACE_EVENT_NAME_MAX,
>
>    _SC_TRACE_NAME_MAX,
>
>    _SC_TRACE_SYS_MAX,
>
>    _SC_TRACE_USER_EVENT_MAX,
>
>
>    _SC_XOPEN_STREAMS,
>
>
>    _SC_THREAD_ROBUST_PRIO_INHERIT,
>
>    _SC_THREAD_ROBUST_PRIO_PROTECT
>
>  };
>
>
>enum
>  {
>    _CS_PATH,
>
>
>    _CS_V6_WIDTH_RESTRICTED_ENVS,
>
>
>
>    _CS_GNU_LIBC_VERSION,
>
>    _CS_GNU_LIBPTHREAD_VERSION,
>
>
>    _CS_V5_WIDTH_RESTRICTED_ENVS,
>
>
>
>    _CS_V7_WIDTH_RESTRICTED_ENVS,
>
>
>
>    _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,
>
>
>    _CS_POSIX_V7_ILP32_OFF32_CFLAGS,
>
>    _CS_POSIX_V7_ILP32_OFF32_LDFLAGS,
>
>    _CS_POSIX_V7_ILP32_OFF32_LIBS,
>
>    _CS_POSIX_V7_ILP32_OFF32_LINTFLAGS,
>
>    _CS_POSIX_V7_ILP32_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V7_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V7_ILP32_OFFBIG_LIBS,
>
>    _CS_POSIX_V7_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_POSIX_V7_LP64_OFF64_CFLAGS,
>
>    _CS_POSIX_V7_LP64_OFF64_LDFLAGS,
>
>    _CS_POSIX_V7_LP64_OFF64_LIBS,
>
>    _CS_POSIX_V7_LP64_OFF64_LINTFLAGS,
>
>    _CS_POSIX_V7_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V7_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V7_LPBIG_OFFBIG_LIBS,
>
>    _CS_POSIX_V7_LPBIG_OFFBIG_LINTFLAGS
>
>  };
># 605 "/usr/include/unistd.h" 2 3 4
>
>
>extern long int pathconf (const char *__path, int __name)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int fpathconf (int __fd, int __name) throw ();
>
>
>extern long int sysconf (int __name) throw ();
>
>
>
>extern size_t confstr (int __name, char *__buf, size_t __len) throw ();
>
>
>
>
>extern __pid_t getpid (void) throw ();
>
>
>extern __pid_t getppid (void) throw ();
>
>
>
>
>extern __pid_t getpgrp (void) throw ();
># 641 "/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 ();
># 667 "/usr/include/unistd.h" 3 4
>extern int setpgrp (void) throw ();
># 684 "/usr/include/unistd.h" 3 4
>extern __pid_t setsid (void) throw ();
>
>
>
>extern __pid_t getsid (__pid_t __pid) throw ();
>
>
>
>extern __uid_t getuid (void) throw ();
>
>
>extern __uid_t geteuid (void) throw ();
>
>
>extern __gid_t getgid (void) throw ();
>
>
>extern __gid_t getegid (void) throw ();
>
>
>
>
>extern int getgroups (int __size, __gid_t __list[]) throw () ;
>
>
>
>extern int group_member (__gid_t __gid) throw ();
>
>
>
>
>
>
>extern int setuid (__uid_t __uid) throw ();
>
>
>
>
>extern int setreuid (__uid_t __ruid, __uid_t __euid) throw ();
>
>
>
>
>extern int seteuid (__uid_t __uid) throw ();
>
>
>
>
>
>
>extern int setgid (__gid_t __gid) throw ();
>
>
>
>
>extern int setregid (__gid_t __rgid, __gid_t __egid) throw ();
>
>
>
>
>extern int setegid (__gid_t __gid) throw ();
>
>
>
>
>
>extern int getresuid (__uid_t *__ruid, __uid_t *__euid, __uid_t *__suid)
>     throw ();
>
>
>
>extern int getresgid (__gid_t *__rgid, __gid_t *__egid, __gid_t *__sgid)
>     throw ();
>
>
>
>extern int setresuid (__uid_t __ruid, __uid_t __euid, __uid_t __suid)
>     throw ();
>
>
>
>extern int setresgid (__gid_t __rgid, __gid_t __egid, __gid_t __sgid)
>     throw ();
>
>
>
>
>
>
>extern __pid_t fork (void) throw ();
>
>
>
>
>
>
>extern __pid_t vfork (void) throw ();
>
>
>
>
>
>extern char *ttyname (int __fd) throw ();
>
>
>
>extern int ttyname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int isatty (int __fd) throw ();
>
>
>
>
>
>extern int ttyslot (void) throw ();
>
>
>
>
>extern int link (const char *__from, const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int linkat (int __fromfd, const char *__from, int __tofd,
>     const char *__to, int __flags)
>     throw () __attribute__ ((__nonnull__ (2, 4))) ;
>
>
>
>
>extern int symlink (const char *__from, const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern ssize_t readlink (const char *__restrict __path,
>    char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int symlinkat (const char *__from, int __tofd,
>        const char *__to) throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>
>extern ssize_t readlinkat (int __fd, const char *__restrict __path,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (2, 3))) ;
>
>
>
>extern int unlink (const char *__name) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int unlinkat (int __fd, const char *__name, int __flag)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern int rmdir (const char *__path) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern __pid_t tcgetpgrp (int __fd) throw ();
>
>
>extern int tcsetpgrp (int __fd, __pid_t __pgrp_id) throw ();
>
>
>
>
>
>
>extern char *getlogin (void);
>
>
>
>
>
>
>
>extern int getlogin_r (char *__name, size_t __name_len) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int setlogin (const char *__name) throw () __attribute__ ((__nonnull__ (1)));
># 887 "/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 ();
># 187 "/usr/include/getopt.h" 3 4
>}
># 888 "/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)));
># 973 "/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))) ;
># 1010 "/usr/include/unistd.h" 3 4
>extern int truncate64 (const char *__file, __off64_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 1020 "/usr/include/unistd.h" 3 4
>extern int ftruncate (int __fd, __off_t __length) throw () ;
># 1030 "/usr/include/unistd.h" 3 4
>extern int ftruncate64 (int __fd, __off64_t __length) throw () ;
># 1040 "/usr/include/unistd.h" 3 4
>extern int brk (void *__addr) throw () ;
>
>
>
>
>
>extern void *sbrk (intptr_t __delta) throw ();
># 1061 "/usr/include/unistd.h" 3 4
>extern long int syscall (long int __sysno, ...) throw ();
># 1084 "/usr/include/unistd.h" 3 4
>extern int lockf (int __fd, int __cmd, __off_t __len) ;
># 1094 "/usr/include/unistd.h" 3 4
>extern int lockf64 (int __fd, int __cmd, __off64_t __len) ;
># 1115 "/usr/include/unistd.h" 3 4
>extern int fdatasync (int __fildes);
>
>
>
>
>
>
>
>extern char *crypt (const char *__key, const char *__salt)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern void encrypt (char *__block, int __edflag) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void swab (const void *__restrict __from, void *__restrict __to,
>    ssize_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
># 1153 "/usr/include/unistd.h" 3 4
>}
># 43 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr-default.h" 2 3
>
>typedef pthread_t __gthread_t;
>typedef pthread_key_t __gthread_key_t;
>typedef pthread_once_t __gthread_once_t;
>typedef pthread_mutex_t __gthread_mutex_t;
>typedef pthread_mutex_t __gthread_recursive_mutex_t;
>typedef pthread_cond_t __gthread_cond_t;
>typedef struct timespec __gthread_time_t;
># 118 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr-default.h" 3
>static __typeof(pthread_once) __gthrw_pthread_once __attribute__ ((__weakref__("pthread_once")));
>static __typeof(pthread_getspecific) __gthrw_pthread_getspecific __attribute__ ((__weakref__("pthread_getspecific")));
>static __typeof(pthread_setspecific) __gthrw_pthread_setspecific __attribute__ ((__weakref__("pthread_setspecific")));
>
>static __typeof(pthread_create) __gthrw_pthread_create __attribute__ ((__weakref__("pthread_create")));
>static __typeof(pthread_join) __gthrw_pthread_join __attribute__ ((__weakref__("pthread_join")));
>static __typeof(pthread_equal) __gthrw_pthread_equal __attribute__ ((__weakref__("pthread_equal")));
>static __typeof(pthread_self) __gthrw_pthread_self __attribute__ ((__weakref__("pthread_self")));
>static __typeof(pthread_detach) __gthrw_pthread_detach __attribute__ ((__weakref__("pthread_detach")));
>static __typeof(pthread_cancel) __gthrw_pthread_cancel __attribute__ ((__weakref__("pthread_cancel")));
>static __typeof(sched_yield) __gthrw_sched_yield __attribute__ ((__weakref__("sched_yield")));
>
>static __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __attribute__ ((__weakref__("pthread_mutex_lock")));
>static __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __attribute__ ((__weakref__("pthread_mutex_trylock")));
>
>
>static __typeof(pthread_mutex_timedlock) __gthrw_pthread_mutex_timedlock __attribute__ ((__weakref__("pthread_mutex_timedlock")));
>
>
>static __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __attribute__ ((__weakref__("pthread_mutex_unlock")));
>static __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __attribute__ ((__weakref__("pthread_mutex_init")));
>static __typeof(pthread_mutex_destroy) __gthrw_pthread_mutex_destroy __attribute__ ((__weakref__("pthread_mutex_destroy")));
>
>static __typeof(pthread_cond_broadcast) __gthrw_pthread_cond_broadcast __attribute__ ((__weakref__("pthread_cond_broadcast")));
>static __typeof(pthread_cond_signal) __gthrw_pthread_cond_signal __attribute__ ((__weakref__("pthread_cond_signal")));
>static __typeof(pthread_cond_wait) __gthrw_pthread_cond_wait __attribute__ ((__weakref__("pthread_cond_wait")));
>static __typeof(pthread_cond_timedwait) __gthrw_pthread_cond_timedwait __attribute__ ((__weakref__("pthread_cond_timedwait")));
>static __typeof(pthread_cond_destroy) __gthrw_pthread_cond_destroy __attribute__ ((__weakref__("pthread_cond_destroy")));
>
>
>static __typeof(pthread_key_create) __gthrw_pthread_key_create __attribute__ ((__weakref__("pthread_key_create")));
>static __typeof(pthread_key_delete) __gthrw_pthread_key_delete __attribute__ ((__weakref__("pthread_key_delete")));
>static __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __attribute__ ((__weakref__("pthread_mutexattr_init")));
>static __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __attribute__ ((__weakref__("pthread_mutexattr_settype")));
>static __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __attribute__ ((__weakref__("pthread_mutexattr_destroy")));
># 237 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_active_p (void)
>{
>  static void *const __gthread_active_ptr
>    = __extension__ (void *) &__gthrw_pthread_cancel;
>  return __gthread_active_ptr != 0;
>}
># 675 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_create (__gthread_t *__threadid, void *(*__func) (void*),
>    void *__args)
>{
>  return __gthrw_pthread_create (__threadid, __null, __func, __args);
>}
>
>static inline int
>__gthread_join (__gthread_t __threadid, void **__value_ptr)
>{
>  return __gthrw_pthread_join (__threadid, __value_ptr);
>}
>
>static inline int
>__gthread_detach (__gthread_t __threadid)
>{
>  return __gthrw_pthread_detach (__threadid);
>}
>
>static inline int
>__gthread_equal (__gthread_t __t1, __gthread_t __t2)
>{
>  return __gthrw_pthread_equal (__t1, __t2);
>}
>
>static inline __gthread_t
>__gthread_self (void)
>{
>  return __gthrw_pthread_self ();
>}
>
>static inline int
>__gthread_yield (void)
>{
>  return __gthrw_sched_yield ();
>}
>
>static inline int
>__gthread_once (__gthread_once_t *__once, void (*__func) (void))
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_once (__once, __func);
>  else
>    return -1;
>}
>
>static inline int
>__gthread_key_create (__gthread_key_t *__key, void (*__dtor) (void *))
>{
>  return __gthrw_pthread_key_create (__key, __dtor);
>}
>
>static inline int
>__gthread_key_delete (__gthread_key_t __key)
>{
>  return __gthrw_pthread_key_delete (__key);
>}
>
>static inline void *
>__gthread_getspecific (__gthread_key_t __key)
>{
>  return __gthrw_pthread_getspecific (__key);
>}
>
>static inline int
>__gthread_setspecific (__gthread_key_t __key, const void *__ptr)
>{
>  return __gthrw_pthread_setspecific (__key, __ptr);
>}
>
>static inline int
>__gthread_mutex_destroy (__gthread_mutex_t *__mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_destroy (__mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_lock (__gthread_mutex_t *__mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_lock (__mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_trylock (__gthread_mutex_t *__mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_trylock (__mutex);
>  else
>    return 0;
>}
>
>
>
>static inline int
>__gthread_mutex_timedlock (__gthread_mutex_t *__mutex,
>      const __gthread_time_t *__abs_timeout)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_timedlock (__mutex, __abs_timeout);
>  else
>    return 0;
>}
>
>
>
>static inline int
>__gthread_mutex_unlock (__gthread_mutex_t *__mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_unlock (__mutex);
>  else
>    return 0;
>}
># 818 "/usr/include/c++/4.5/x86_64-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_timedlock (__gthread_recursive_mutex_t *__mutex,
>         const __gthread_time_t *__abs_timeout)
>{
>  return __gthread_mutex_timedlock (__mutex, __abs_timeout);
>}
>
>
>
>static inline int
>__gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *__mutex)
>{
>  return __gthread_mutex_unlock (__mutex);
>}
>
>static inline int
>__gthread_cond_broadcast (__gthread_cond_t *__cond)
>{
>  return __gthrw_pthread_cond_broadcast (__cond);
>}
>
>static inline int
>__gthread_cond_signal (__gthread_cond_t *__cond)
>{
>  return __gthrw_pthread_cond_signal (__cond);
>}
>
>static inline int
>__gthread_cond_wait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex)
>{
>  return __gthrw_pthread_cond_wait (__cond, __mutex);
>}
>
>static inline int
>__gthread_cond_timedwait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex,
>     const __gthread_time_t *__abs_timeout)
>{
>  return __gthrw_pthread_cond_timedwait (__cond, __mutex, __abs_timeout);
>}
>
>static inline int
>__gthread_cond_wait_recursive (__gthread_cond_t *__cond,
>          __gthread_recursive_mutex_t *__mutex)
>{
>  return __gthread_cond_wait (__cond, __mutex);
>}
>
>static inline int
>__gthread_cond_timedwait_recursive (__gthread_cond_t *__cond,
>        __gthread_recursive_mutex_t *__mutex,
>        const __gthread_time_t *__abs_timeout)
>{
>  return __gthread_cond_timedwait (__cond, __mutex, __abs_timeout);
>}
>
>static inline int
>__gthread_cond_destroy (__gthread_cond_t* __cond)
>{
>  return __gthrw_pthread_cond_destroy (__cond);
>}
># 163 "/usr/include/c++/4.5/x86_64-suse-linux/bits/gthr.h" 2 3
>
>
>
>
>
>
>
>#pragma GCC visibility pop
># 35 "/usr/include/c++/4.5/ext/atomicity.h" 2 3
># 1 "/usr/include/c++/4.5/x86_64-suse-linux/bits/atomic_word.h" 1 3
># 32 "/usr/include/c++/4.5/x86_64-suse-linux/bits/atomic_word.h" 3
>typedef int _Atomic_word;
># 36 "/usr/include/c++/4.5/ext/atomicity.h" 2 3
>
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>
>
>
>
>
>  static inline _Atomic_word
>  __exchange_and_add(volatile _Atomic_word* __mem, int __val)
>  { return __sync_fetch_and_add(__mem, __val); }
>
>  static inline void
>  __atomic_add(volatile _Atomic_word* __mem, int __val)
>  { __sync_fetch_and_add(__mem, __val); }
># 61 "/usr/include/c++/4.5/ext/atomicity.h" 3
>  static inline _Atomic_word
>  __exchange_and_add_single(_Atomic_word* __mem, int __val)
>  {
>    _Atomic_word __result = *__mem;
>    *__mem += __val;
>    return __result;
>  }
>
>  static inline void
>  __atomic_add_single(_Atomic_word* __mem, int __val)
>  { *__mem += __val; }
>
>  static inline _Atomic_word
>  __attribute__ ((__unused__))
>  __exchange_and_add_dispatch(_Atomic_word* __mem, int __val)
>  {
>
>    if (__gthread_active_p())
>      return __exchange_and_add(__mem, __val);
>    else
>      return __exchange_and_add_single(__mem, __val);
>
>
>
>  }
>
>  static inline void
>  __attribute__ ((__unused__))
>  __atomic_add_dispatch(_Atomic_word* __mem, int __val)
>  {
>
>    if (__gthread_active_p())
>      __atomic_add(__mem, __val);
>    else
>      __atomic_add_single(__mem, __val);
>
>
>
>  }
>
>}
># 42 "/usr/include/c++/4.5/bits/basic_string.h" 2 3
>
># 1 "/usr/include/c++/4.5/initializer_list" 1 3
># 33 "/usr/include/c++/4.5/initializer_list" 3
>       
># 34 "/usr/include/c++/4.5/initializer_list" 3
># 44 "/usr/include/c++/4.5/bits/basic_string.h" 2 3
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 104 "/usr/include/c++/4.5/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_string
>    {
>      typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;
>
>
>    public:
>      typedef _Traits traits_type;
>      typedef typename _Traits::char_type value_type;
>      typedef _Alloc allocator_type;
>      typedef typename _CharT_alloc_type::size_type size_type;
>      typedef typename _CharT_alloc_type::difference_type difference_type;
>      typedef typename _CharT_alloc_type::reference reference;
>      typedef typename _CharT_alloc_type::const_reference const_reference;
>      typedef typename _CharT_alloc_type::pointer pointer;
>      typedef typename _CharT_alloc_type::const_pointer const_pointer;
>      typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator;
>      typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
>                                                            const_iterator;
>      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>      typedef std::reverse_iterator<iterator> reverse_iterator;
>
>    private:
># 141 "/usr/include/c++/4.5/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;
># 166 "/usr/include/c++/4.5/bits/basic_string.h" 3
> static const size_type _S_max_size;
> static const _CharT _S_terminal;
>
>
>
>        static size_type _S_empty_rep_storage[];
>
>        static _Rep&
>        _S_empty_rep()
>        {
>
>
>
>   void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage);
>   return *reinterpret_cast<_Rep*>(__p);
> }
>
>        bool
> _M_is_leaked() const
>        { return this->_M_refcount < 0; }
>
>        bool
> _M_is_shared() const
>        { return this->_M_refcount > 0; }
>
>        void
> _M_set_leaked()
>        { this->_M_refcount = -1; }
>
>        void
> _M_set_sharable()
>        { this->_M_refcount = 0; }
>
> void
> _M_set_length_and_sharable(size_type __n)
> {
>
>   if (__builtin_expect(this != &_S_empty_rep(), false))
>
>     {
>       this->_M_set_sharable();
>       this->_M_length = __n;
>       traits_type::assign(this->_M_refdata()[__n], _S_terminal);
>
>
>     }
> }
>
> _CharT*
> _M_refdata() throw()
> { return reinterpret_cast<_CharT*>(this + 1); }
>
> _CharT*
> _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)
> {
>   return (!_M_is_leaked() && __alloc1 == __alloc2)
>           ? _M_refcopy() : _M_clone(__alloc1);
> }
>
>
> static _Rep*
> _S_create(size_type, size_type, const _Alloc&);
>
> void
> _M_dispose(const _Alloc& __a)
> {
>
>   if (__builtin_expect(this != &_S_empty_rep(), false))
>
>     if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,
>             -1) <= 0)
>       _M_destroy(__a);
> }
>
> void
> _M_destroy(const _Alloc&) throw();
>
> _CharT*
> _M_refcopy() throw()
> {
>
>   if (__builtin_expect(this != &_S_empty_rep(), false))
>
>            __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
>   return _M_refdata();
> }
>
> _CharT*
> _M_clone(const _Alloc&, size_type __res = 0);
>      };
>
>
>      struct _Alloc_hider : _Alloc
>      {
> _Alloc_hider(_CharT* __dat, const _Alloc& __a)
> : _Alloc(__a), _M_p(__dat) { }
>
> _CharT* _M_p;
>      };
>
>    public:
>
>
>
>
>      static const size_type npos = static_cast<size_type>(-1);
>
>    private:
>
>      mutable _Alloc_hider _M_dataplus;
>
>      _CharT*
>      _M_data() const
>      { return _M_dataplus._M_p; }
>
>      _CharT*
>      _M_data(_CharT* __p)
>      { return (_M_dataplus._M_p = __p); }
>
>      _Rep*
>      _M_rep() const
>      { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }
>
>
>
>      iterator
>      _M_ibegin() const
>      { return iterator(_M_data()); }
>
>      iterator
>      _M_iend() const
>      { return iterator(_M_data() + this->size()); }
>
>      void
>      _M_leak()
>      {
> if (!_M_rep()->_M_is_leaked())
>   _M_leak_hard();
>      }
>
>      size_type
>      _M_check(size_type __pos, const char* __s) const
>      {
> if (__pos > this->size())
>   __throw_out_of_range((__s));
> return __pos;
>      }
>
>      void
>      _M_check_length(size_type __n1, size_type __n2, const char* __s) const
>      {
> if (this->max_size() - (this->size() - __n1) < __n2)
>   __throw_length_error((__s));
>      }
>
>
>      size_type
>      _M_limit(size_type __pos, size_type __off) const
>      {
> const bool __testoff = __off < this->size() - __pos;
> return __testoff ? __off : this->size() - __pos;
>      }
>
>
>      bool
>      _M_disjunct(const _CharT* __s) const
>      {
> return (less<const _CharT*>()(__s, _M_data())
>  || less<const _CharT*>()(_M_data() + this->size(), __s));
>      }
>
>
>
>      static void
>      _M_copy(_CharT* __d, const _CharT* __s, size_type __n)
>      {
> if (__n == 1)
>   traits_type::assign(*__d, *__s);
> else
>   traits_type::copy(__d, __s, __n);
>      }
>
>      static void
>      _M_move(_CharT* __d, const _CharT* __s, size_type __n)
>      {
> if (__n == 1)
>   traits_type::assign(*__d, *__s);
> else
>   traits_type::move(__d, __s, __n);
>      }
>
>      static void
>      _M_assign(_CharT* __d, size_type __n, _CharT __c)
>      {
> if (__n == 1)
>   traits_type::assign(*__d, __c);
> else
>   traits_type::assign(__d, __n, __c);
>      }
>
>
>
>      template<class _Iterator>
>        static void
>        _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
>        {
>   for (; __k1 != __k2; ++__k1, ++__p)
>     traits_type::assign(*__p, *__k1);
> }
>
>      static void
>      _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
>      { _S_copy_chars(__p, __k1.base(), __k2.base()); }
>
>      static void
>      _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
>      { _S_copy_chars(__p, __k1.base(), __k2.base()); }
>
>      static void
>      _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)
>      { _M_copy(__p, __k1, __k2 - __k1); }
>
>      static void
>      _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
>      { _M_copy(__p, __k1, __k2 - __k1); }
>
>      static int
>      _S_compare(size_type __n1, size_type __n2)
>      {
> const difference_type __d = difference_type(__n1 - __n2);
>
> if (__d > __gnu_cxx::__numeric_traits<int>::__max)
>   return __gnu_cxx::__numeric_traits<int>::__max;
> else if (__d < __gnu_cxx::__numeric_traits<int>::__min)
>   return __gnu_cxx::__numeric_traits<int>::__min;
> else
>   return int(__d);
>      }
>
>      void
>      _M_mutate(size_type __pos, size_type __len1, size_type __len2);
>
>      void
>      _M_leak_hard();
>
>      static _Rep&
>      _S_empty_rep()
>      { return _Rep::_S_empty_rep(); }
>
>    public:
>
>
>
>
>
>
>
>      basic_string()
>
>      : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }
>
>
>
>
>
>
>
>      explicit
>      basic_string(const _Alloc& __a);
>
>
>
>
>
>
>      basic_string(const basic_string& __str);
>
>
>
>
>
>
>      basic_string(const basic_string& __str, size_type __pos,
>     size_type __n = npos);
>
>
>
>
>
>
>
>      basic_string(const basic_string& __str, size_type __pos,
>     size_type __n, const _Alloc& __a);
># 469 "/usr/include/c++/4.5/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());
># 517 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      template<class _InputIterator>
>        basic_string(_InputIterator __beg, _InputIterator __end,
>       const _Alloc& __a = _Alloc());
>
>
>
>
>      ~basic_string()
>      { _M_rep()->_M_dispose(this->get_allocator()); }
>
>
>
>
>
>      basic_string&
>      operator=(const basic_string& __str)
>      { return this->assign(__str); }
>
>
>
>
>
>      basic_string&
>      operator=(const _CharT* __s)
>      { return this->assign(__s); }
># 550 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      operator=(_CharT __c)
>      {
> this->assign(1, __c);
> return *this;
>      }
># 590 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      iterator
>      begin()
>      {
> _M_leak();
> return iterator(_M_data());
>      }
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return const_iterator(_M_data()); }
>
>
>
>
>
>      iterator
>      end()
>      {
> _M_leak();
> return iterator(_M_data() + this->size());
>      }
>
>
>
>
>
>      const_iterator
>      end() const
>      { return const_iterator(_M_data() + this->size()); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return reverse_iterator(this->end()); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return const_reverse_iterator(this->end()); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return reverse_iterator(this->begin()); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return const_reverse_iterator(this->begin()); }
># 696 "/usr/include/c++/4.5/bits/basic_string.h" 3
>    public:
>
>
>
>      size_type
>      size() const
>      { return _M_rep()->_M_length; }
>
>
>
>      size_type
>      length() const
>      { return _M_rep()->_M_length; }
>
>
>      size_type
>      max_size() const
>      { return _Rep::_S_max_size; }
># 725 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      void
>      resize(size_type __n, _CharT __c);
># 738 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      void
>      resize(size_type __n)
>      { this->resize(__n, _CharT()); }
># 758 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      capacity() const
>      { return _M_rep()->_M_capacity; }
># 779 "/usr/include/c++/4.5/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; }
># 808 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      const_reference
>      operator[] (size_type __pos) const
>      {
> ;
> return _M_data()[__pos];
>      }
># 825 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      reference
>      operator[](size_type __pos)
>      {
>
> ;
>
> ;
> _M_leak();
> return _M_data()[__pos];
>      }
># 846 "/usr/include/c++/4.5/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];
>      }
># 865 "/usr/include/c++/4.5/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;
>      }
># 921 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      append(const basic_string& __str);
># 936 "/usr/include/c++/4.5/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));
>      }
># 968 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      append(size_type __n, _CharT __c);
># 990 "/usr/include/c++/4.5/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);
># 1046 "/usr/include/c++/4.5/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)); }
># 1062 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s, size_type __n);
># 1074 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s)
>      {
> ;
> return this->assign(__s, traits_type::length(__s));
>      }
># 1090 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      assign(size_type __n, _CharT __c)
>      { return _M_replace_aux(size_type(0), this->size(), __n, __c); }
># 1102 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      template<class _InputIterator>
>        basic_string&
>        assign(_InputIterator __first, _InputIterator __last)
>        { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
># 1130 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      void
>      insert(iterator __p, size_type __n, _CharT __c)
>      { this->replace(__p, __p, __n, __c); }
># 1145 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      template<class _InputIterator>
>        void
>        insert(iterator __p, _InputIterator __beg, _InputIterator __end)
>        { this->replace(__p, __p, __beg, __end); }
># 1176 "/usr/include/c++/4.5/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()); }
># 1198 "/usr/include/c++/4.5/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)); }
># 1221 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s, size_type __n);
># 1239 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s)
>      {
> ;
> return this->insert(__pos, __s, traits_type::length(__s));
>      }
># 1262 "/usr/include/c++/4.5/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); }
># 1279 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      iterator
>      insert(iterator __p, _CharT __c)
>      {
> ;
> const size_type __pos = __p - _M_ibegin();
> _M_replace_aux(__pos, size_type(0), size_type(1), __c);
> _M_rep()->_M_set_leaked();
> return iterator(_M_data() + __pos);
>      }
># 1303 "/usr/include/c++/4.5/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;
>      }
># 1319 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      iterator
>      erase(iterator __position)
>      {
>
>                               ;
> const size_type __pos = __position - _M_ibegin();
> _M_mutate(__pos, size_type(1), size_type(0));
> _M_rep()->_M_set_leaked();
> return iterator(_M_data() + __pos);
>      }
># 1339 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      iterator
>      erase(iterator __first, iterator __last);
># 1358 "/usr/include/c++/4.5/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()); }
># 1380 "/usr/include/c++/4.5/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)); }
># 1404 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2);
># 1423 "/usr/include/c++/4.5/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));
>      }
># 1446 "/usr/include/c++/4.5/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); }
># 1464 "/usr/include/c++/4.5/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()); }
># 1482 "/usr/include/c++/4.5/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);
>      }
># 1503 "/usr/include/c++/4.5/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));
>      }
># 1524 "/usr/include/c++/4.5/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);
>      }
># 1546 "/usr/include/c++/4.5/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);
>      }
># 1621 "/usr/include/c++/4.5/bits/basic_string.h" 3
>    private:
>      template<class _Integer>
> basic_string&
> _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
>       _Integer __val, __true_type)
>        { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
>
>      template<class _InputIterator>
> basic_string&
> _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
>       _InputIterator __k2, __false_type);
>
>      basic_string&
>      _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
>       _CharT __c);
>
>      basic_string&
>      _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
>        size_type __n2);
>
>
>
>      template<class _InIterator>
>        static _CharT*
>        _S_construct_aux(_InIterator __beg, _InIterator __end,
>    const _Alloc& __a, __false_type)
> {
>          typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
>          return _S_construct(__beg, __end, __a, _Tag());
> }
>
>
>
>      template<class _Integer>
>        static _CharT*
>        _S_construct_aux(_Integer __beg, _Integer __end,
>    const _Alloc& __a, __true_type)
>        { return _S_construct_aux_2(static_cast<size_type>(__beg),
>        __end, __a); }
>
>      static _CharT*
>      _S_construct_aux_2(size_type __req, _CharT __c, const _Alloc& __a)
>      { return _S_construct(__req, __c, __a); }
>
>      template<class _InIterator>
>        static _CharT*
>        _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)
> {
>   typedef typename std::__is_integer<_InIterator>::__type _Integral;
>   return _S_construct_aux(__beg, __end, __a, _Integral());
>        }
>
>
>      template<class _InIterator>
>        static _CharT*
>         _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
>        input_iterator_tag);
>
>
>
>      template<class _FwdIterator>
>        static _CharT*
>        _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a,
>       forward_iterator_tag);
>
>      static _CharT*
>      _S_construct(size_type __req, _CharT __c, const _Alloc& __a);
>
>    public:
># 1702 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
># 1712 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      void
>      swap(basic_string& __s);
># 1722 "/usr/include/c++/4.5/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; }
># 1754 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find(const _CharT* __s, size_type __pos, size_type __n) const;
># 1767 "/usr/include/c++/4.5/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()); }
># 1781 "/usr/include/c++/4.5/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));
>      }
># 1798 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find(_CharT __c, size_type __pos = 0) const;
># 1811 "/usr/include/c++/4.5/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()); }
># 1826 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      rfind(const _CharT* __s, size_type __pos, size_type __n) const;
># 1839 "/usr/include/c++/4.5/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));
>      }
># 1856 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      rfind(_CharT __c, size_type __pos = npos) const;
># 1869 "/usr/include/c++/4.5/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()); }
># 1884 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1897 "/usr/include/c++/4.5/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));
>      }
># 1916 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_first_of(_CharT __c, size_type __pos = 0) const
>      { return this->find(__c, __pos); }
># 1930 "/usr/include/c++/4.5/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()); }
># 1945 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1958 "/usr/include/c++/4.5/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));
>      }
># 1977 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_last_of(_CharT __c, size_type __pos = npos) const
>      { return this->rfind(__c, __pos); }
># 1991 "/usr/include/c++/4.5/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()); }
># 2006 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(const _CharT* __s, size_type __pos,
>   size_type __n) const;
># 2020 "/usr/include/c++/4.5/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));
>      }
># 2037 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(_CharT __c, size_type __pos = 0) const;
># 2050 "/usr/include/c++/4.5/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()); }
># 2066 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(const _CharT* __s, size_type __pos,
>         size_type __n) const;
># 2079 "/usr/include/c++/4.5/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));
>      }
># 2096 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(_CharT __c, size_type __pos = npos) const;
># 2111 "/usr/include/c++/4.5/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); }
># 2129 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      int
>      compare(const basic_string& __str) const
>      {
> const size_type __size = this->size();
> const size_type __osize = __str.size();
> const size_type __len = std::min(__size, __osize);
>
> int __r = traits_type::compare(_M_data(), __str.data(), __len);
> if (!__r)
>   __r = _S_compare(__size, __osize);
> return __r;
>      }
># 2159 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n, const basic_string& __str) const;
># 2183 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      int
>      compare(size_type __pos1, size_type __n1, const basic_string& __str,
>       size_type __pos2, size_type __n2) const;
># 2201 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      int
>      compare(const _CharT* __s) const;
># 2224 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s) const;
># 2249 "/usr/include/c++/4.5/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2) const;
>  };
># 2261 "/usr/include/c++/4.5/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;
>    }
># 2332 "/usr/include/c++/4.5/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __lhs.compare(__rhs) == 0; }
>
>  template<typename _CharT>
>    inline
>    typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type
>    operator==(const basic_string<_CharT>& __lhs,
>        const basic_string<_CharT>& __rhs)
>    { return (__lhs.size() == __rhs.size()
>       && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(),
>          __lhs.size())); }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator==(const _CharT* __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) == 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const _CharT* __rhs)
>    { return __lhs.compare(__rhs) == 0; }
># 2378 "/usr/include/c++/4.5/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return !(__lhs == __rhs); }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator!=(const _CharT* __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return !(__lhs == __rhs); }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const _CharT* __rhs)
>    { return !(__lhs == __rhs); }
># 2415 "/usr/include/c++/4.5/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; }
># 2452 "/usr/include/c++/4.5/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; }
># 2489 "/usr/include/c++/4.5/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; }
># 2526 "/usr/include/c++/4.5/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; }
># 2563 "/usr/include/c++/4.5/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); }
># 2580 "/usr/include/c++/4.5/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __is,
>        basic_string<_CharT, _Traits, _Alloc>& __str);
>
>  template<>
>    basic_istream<char>&
>    operator>>(basic_istream<char>& __is, basic_string<char>& __str);
># 2598 "/usr/include/c++/4.5/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __os,
>        const basic_string<_CharT, _Traits, _Alloc>& __str)
>    {
>
>
>      return __ostream_insert(__os, __str.data(), __str.size());
>    }
># 2621 "/usr/include/c++/4.5/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);
># 2639 "/usr/include/c++/4.5/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_istream<_CharT, _Traits>&
>    getline(basic_istream<_CharT, _Traits>& __is,
>     basic_string<_CharT, _Traits, _Alloc>& __str)
>    { return getline(__is, __str, __is.widen('\n')); }
>
>  template<>
>    basic_istream<char>&
>    getline(basic_istream<char>& __in, basic_string<char>& __str,
>     char __delim);
>
>
>  template<>
>    basic_istream<wchar_t>&
>    getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str,
>     wchar_t __delim);
>
>
>}
># 54 "/usr/include/c++/4.5/string" 2 3
>
>
># 1 "/usr/include/c++/4.5/bits/basic_string.tcc" 1 3
># 42 "/usr/include/c++/4.5/bits/basic_string.tcc" 3
>       
># 43 "/usr/include/c++/4.5/bits/basic_string.tcc" 3
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    const typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4;
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    const _CharT
>    basic_string<_CharT, _Traits, _Alloc>::
>    _Rep::_S_terminal = _CharT();
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    const typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::npos;
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[
>    (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) /
>      sizeof(size_type)];
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template<typename _InIterator>
>      _CharT*
>      basic_string<_CharT, _Traits, _Alloc>::
>      _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
>     input_iterator_tag)
>      {
>
> if (__beg == __end && __a == _Alloc())
>   return _S_empty_rep()._M_refdata();
>
>
> _CharT __buf[128];
> size_type __len = 0;
> while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT))
>   {
>     __buf[__len++] = *__beg;
>     ++__beg;
>   }
> _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
> _M_copy(__r->_M_refdata(), __buf, __len);
> try
>   {
>     while (__beg != __end)
>       {
>  if (__len == __r->_M_capacity)
>    {
>
>      _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
>      _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
>      __r->_M_destroy(__a);
>      __r = __another;
>    }
>  __r->_M_refdata()[__len++] = *__beg;
>  ++__beg;
>       }
>   }
> catch(...)
>   {
>     __r->_M_destroy(__a);
>     throw;
>   }
> __r->_M_set_length_and_sharable(__len);
> return __r->_M_refdata();
>      }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template <typename _InIterator>
>      _CharT*
>      basic_string<_CharT, _Traits, _Alloc>::
>      _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
>     forward_iterator_tag)
>      {
>
> if (__beg == __end && __a == _Alloc())
>   return _S_empty_rep()._M_refdata();
>
>
> if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end)
>   __throw_logic_error(("basic_string::_S_construct NULL not valid"));
>
> const size_type __dnew = static_cast<size_type>(std::distance(__beg,
>              __end));
>
> _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);
> try
>   { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
> catch(...)
>   {
>     __r->_M_destroy(__a);
>     throw;
>   }
> __r->_M_set_length_and_sharable(__dnew);
> return __r->_M_refdata();
>      }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    _CharT*
>    basic_string<_CharT, _Traits, _Alloc>::
>    _S_construct(size_type __n, _CharT __c, const _Alloc& __a)
>    {
>
>      if (__n == 0 && __a == _Alloc())
> return _S_empty_rep()._M_refdata();
>
>
>      _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
>      if (__n)
> _M_assign(__r->_M_refdata(), __n, __c);
>
>      __r->_M_set_length_and_sharable(__n);
>      return __r->_M_refdata();
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const basic_string& __str)
>    : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()),
>       __str.get_allocator()),
>    __str.get_allocator())
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const _Alloc& __a)
>    : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a)
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const basic_string& __str, size_type __pos, size_type __n)
>    : _M_dataplus(_S_construct(__str._M_data()
>          + __str._M_check(__pos,
>      "basic_string::basic_string"),
>          __str._M_data() + __str._M_limit(__pos, __n)
>          + __pos, _Alloc()), _Alloc())
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const basic_string& __str, size_type __pos,
>   size_type __n, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__str._M_data()
>          + __str._M_check(__pos,
>      "basic_string::basic_string"),
>          __str._M_data() + __str._M_limit(__pos, __n)
>          + __pos, __a), __a)
>    { }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const _CharT* __s, size_type __n, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__s, __s + __n, __a), __a)
>    { }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const _CharT* __s, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) :
>          __s + npos, __a), __a)
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(size_type __n, _CharT __c, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__n, __c, __a), __a)
>    { }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template<typename _InputIterator>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__beg, __end, __a), __a)
>    { }
># 240 "/usr/include/c++/4.5/bits/basic_string.tcc" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    assign(const basic_string& __str)
>    {
>      if (_M_rep() != __str._M_rep())
> {
>
>   const allocator_type __a = this->get_allocator();
>   _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator());
>   _M_rep()->_M_dispose(__a);
>   _M_data(__tmp);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    assign(const _CharT* __s, size_type __n)
>    {
>      ;
>      _M_check_length(this->size(), __n, "basic_string::assign");
>      if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
> return _M_replace_safe(size_type(0), this->size(), __s, __n);
>      else
> {
>
>   const size_type __pos = __s - _M_data();
>   if (__pos >= __n)
>     _M_copy(_M_data(), __s, __n);
>   else if (__pos)
>     _M_move(_M_data(), __s, __n);
>   _M_rep()->_M_set_length_and_sharable(__n);
>   return *this;
> }
>     }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(size_type __n, _CharT __c)
>    {
>      if (__n)
> {
>   _M_check_length(size_type(0), __n, "basic_string::append");
>   const size_type __len = __n + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     this->reserve(__len);
>   _M_assign(_M_data() + this->size(), __n, __c);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(const _CharT* __s, size_type __n)
>    {
>      ;
>      if (__n)
> {
>   _M_check_length(size_type(0), __n, "basic_string::append");
>   const size_type __len = __n + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     {
>       if (_M_disjunct(__s))
>  this->reserve(__len);
>       else
>  {
>    const size_type __off = __s - _M_data();
>    this->reserve(__len);
>    __s = _M_data() + __off;
>  }
>     }
>   _M_copy(_M_data() + this->size(), __s, __n);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(const basic_string& __str)
>    {
>      const size_type __size = __str.size();
>      if (__size)
> {
>   const size_type __len = __size + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     this->reserve(__len);
>   _M_copy(_M_data() + this->size(), __str._M_data(), __size);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(const basic_string& __str, size_type __pos, size_type __n)
>    {
>      __str._M_check(__pos, "basic_string::append");
>      __n = __str._M_limit(__pos, __n);
>      if (__n)
> {
>   const size_type __len = __n + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     this->reserve(__len);
>   _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>   template<typename _CharT, typename _Traits, typename _Alloc>
>     basic_string<_CharT, _Traits, _Alloc>&
>     basic_string<_CharT, _Traits, _Alloc>::
>     insert(size_type __pos, const _CharT* __s, size_type __n)
>     {
>       ;
>       _M_check(__pos, "basic_string::insert");
>       _M_check_length(size_type(0), __n, "basic_string::insert");
>       if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
>         return _M_replace_safe(__pos, size_type(0), __s, __n);
>       else
>         {
>
>           const size_type __off = __s - _M_data();
>           _M_mutate(__pos, 0, __n);
>           __s = _M_data() + __off;
>           _CharT* __p = _M_data() + __pos;
>           if (__s + __n <= __p)
>             _M_copy(__p, __s, __n);
>           else if (__s >= __p)
>             _M_copy(__p, __s + __n, __n);
>           else
>             {
>        const size_type __nleft = __p - __s;
>               _M_copy(__p, __s, __nleft);
>               _M_copy(__p + __nleft, __p + __n, __n - __nleft);
>             }
>           return *this;
>         }
>     }
>
>   template<typename _CharT, typename _Traits, typename _Alloc>
>     typename basic_string<_CharT, _Traits, _Alloc>::iterator
>     basic_string<_CharT, _Traits, _Alloc>::
>     erase(iterator __first, iterator __last)
>     {
>      
>                           ;
>
>
>
>
>       const size_type __size = __last - __first;
>       if (__size)
>  {
>    const size_type __pos = __first - _M_ibegin();
>    _M_mutate(__pos, __size, size_type(0));
>    _M_rep()->_M_set_leaked();
>    return iterator(_M_data() + __pos);
>  }
>       else
>  return __first;
>     }
>
>   template<typename _CharT, typename _Traits, typename _Alloc>
>     basic_string<_CharT, _Traits, _Alloc>&
>     basic_string<_CharT, _Traits, _Alloc>::
>     replace(size_type __pos, size_type __n1, const _CharT* __s,
>      size_type __n2)
>     {
>       ;
>       _M_check(__pos, "basic_string::replace");
>       __n1 = _M_limit(__pos, __n1);
>       _M_check_length(__n1, __n2, "basic_string::replace");
>       bool __left;
>       if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
>         return _M_replace_safe(__pos, __n1, __s, __n2);
>       else if ((__left = __s + __n2 <= _M_data() + __pos)
>  || _M_data() + __pos + __n1 <= __s)
>  {
>
>    size_type __off = __s - _M_data();
>    __left ? __off : (__off += __n2 - __n1);
>    _M_mutate(__pos, __n1, __n2);
>    _M_copy(_M_data() + __pos, _M_data() + __off, __n2);
>    return *this;
>  }
>       else
>  {
>
>    const basic_string __tmp(__s, __n2);
>    return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2);
>  }
>     }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::
>    _M_destroy(const _Alloc& __a) throw ()
>    {
>      const size_type __size = sizeof(_Rep_base) +
>                        (this->_M_capacity + 1) * sizeof(_CharT);
>      _Raw_bytes_alloc(__a).deallocate(reinterpret_cast<char*>(this), __size);
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_leak_hard()
>    {
>
>      if (_M_rep() == &_S_empty_rep())
> return;
>
>      if (_M_rep()->_M_is_shared())
> _M_mutate(0, 0, 0);
>      _M_rep()->_M_set_leaked();
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_mutate(size_type __pos, size_type __len1, size_type __len2)
>    {
>      const size_type __old_size = this->size();
>      const size_type __new_size = __old_size + __len2 - __len1;
>      const size_type __how_much = __old_size - __pos - __len1;
>
>      if (__new_size > this->capacity() || _M_rep()->_M_is_shared())
> {
>
>   const allocator_type __a = get_allocator();
>   _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a);
>
>   if (__pos)
>     _M_copy(__r->_M_refdata(), _M_data(), __pos);
>   if (__how_much)
>     _M_copy(__r->_M_refdata() + __pos + __len2,
>      _M_data() + __pos + __len1, __how_much);
>
>   _M_rep()->_M_dispose(__a);
>   _M_data(__r->_M_refdata());
> }
>      else if (__how_much && __len1 != __len2)
> {
>
>   _M_move(_M_data() + __pos + __len2,
>    _M_data() + __pos + __len1, __how_much);
> }
>      _M_rep()->_M_set_length_and_sharable(__new_size);
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    reserve(size_type __res)
>    {
>      if (__res != this->capacity() || _M_rep()->_M_is_shared())
>        {
>
>   if (__res < this->size())
>     __res = this->size();
>   const allocator_type __a = get_allocator();
>   _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size());
>   _M_rep()->_M_dispose(__a);
>   _M_data(__tmp);
>        }
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    swap(basic_string& __s)
>    {
>      if (_M_rep()->_M_is_leaked())
> _M_rep()->_M_set_sharable();
>      if (__s._M_rep()->_M_is_leaked())
> __s._M_rep()->_M_set_sharable();
>      if (this->get_allocator() == __s.get_allocator())
> {
>   _CharT* __tmp = _M_data();
>   _M_data(__s._M_data());
>   __s._M_data(__tmp);
> }
>
>      else
> {
>   const basic_string __tmp1(_M_ibegin(), _M_iend(),
>        __s.get_allocator());
>   const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
>        this->get_allocator());
>   *this = __tmp2;
>   __s = __tmp1;
> }
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::_Rep*
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::
>    _S_create(size_type __capacity, size_type __old_capacity,
>       const _Alloc& __alloc)
>    {
>
>
>      if (__capacity > _S_max_size)
> __throw_length_error(("basic_string::_S_create"));
># 577 "/usr/include/c++/4.5/bits/basic_string.tcc" 3
>      const size_type __pagesize = 4096;
>      const size_type __malloc_header_size = 4 * sizeof(void*);
>
>
>
>
>
>
>
>      if (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
> __capacity = 2 * __old_capacity;
>
>
>
>
>      size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep);
>
>      const size_type __adj_size = __size + __malloc_header_size;
>      if (__adj_size > __pagesize && __capacity > __old_capacity)
> {
>   const size_type __extra = __pagesize - __adj_size % __pagesize;
>   __capacity += __extra / sizeof(_CharT);
>
>   if (__capacity > _S_max_size)
>     __capacity = _S_max_size;
>   __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep);
> }
>
>
>
>      void* __place = _Raw_bytes_alloc(__alloc).allocate(__size);
>      _Rep *__p = new (__place) _Rep;
>      __p->_M_capacity = __capacity;
>
>
>
>
>
>
>
>      __p->_M_set_sharable();
>      return __p;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    _CharT*
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::
>    _M_clone(const _Alloc& __alloc, size_type __res)
>    {
>
>      const size_type __requested_cap = this->_M_length + __res;
>      _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity,
>      __alloc);
>      if (this->_M_length)
> _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length);
>
>      __r->_M_set_length_and_sharable(this->_M_length);
>      return __r->_M_refdata();
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    resize(size_type __n, _CharT __c)
>    {
>      const size_type __size = this->size();
>      _M_check_length(__size, __n, "basic_string::resize");
>      if (__size < __n)
> this->append(__n - __size, __c);
>      else if (__n < __size)
> this->erase(__n);
>
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template<typename _InputIterator>
>      basic_string<_CharT, _Traits, _Alloc>&
>      basic_string<_CharT, _Traits, _Alloc>::
>      _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
>     _InputIterator __k2, __false_type)
>      {
> const basic_string __s(__k1, __k2);
> const size_type __n1 = __i2 - __i1;
> _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch");
> return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(),
>          __s.size());
>      }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
>     _CharT __c)
>    {
>      _M_check_length(__n1, __n2, "basic_string::_M_replace_aux");
>      _M_mutate(__pos1, __n1, __n2);
>      if (__n2)
> _M_assign(_M_data() + __pos1, __n2, __c);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
>      size_type __n2)
>    {
>      _M_mutate(__pos1, __n1, __n2);
>      if (__n2)
> _M_copy(_M_data() + __pos1, __s, __n2);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>
>    operator+(const _CharT* __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    {
>      ;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>      const __size_type __len = _Traits::length(__lhs);
>      __string_type __str;
>      __str.reserve(__len + __rhs.size());
>      __str.append(__lhs, __len);
>      __str.append(__rhs);
>      return __str;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>
>    operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    {
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>      __string_type __str;
>      const __size_type __len = __rhs.size();
>      __str.reserve(__len + 1);
>      __str.append(__size_type(1), __lhs);
>      __str.append(__rhs);
>      return __str;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    copy(_CharT* __s, size_type __n, size_type __pos) const
>    {
>      _M_check(__pos, "basic_string::copy");
>      __n = _M_limit(__pos, __n);
>      ;
>      if (__n)
> _M_copy(__s, _M_data() + __pos, __n);
>
>      return __n;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      const size_type __size = this->size();
>      const _CharT* __data = _M_data();
>
>      if (__n == 0)
> return __pos <= __size ? __pos : npos;
>
>      if (__n <= __size)
> {
>   for (; __pos <= __size - __n; ++__pos)
>     if (traits_type::eq(__data[__pos], __s[0])
>  && traits_type::compare(__data + __pos + 1,
>     __s + 1, __n - 1) == 0)
>       return __pos;
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find(_CharT __c, size_type __pos) const
>    {
>      size_type __ret = npos;
>      const size_type __size = this->size();
>      if (__pos < __size)
> {
>   const _CharT* __data = _M_data();
>   const size_type __n = __size - __pos;
>   const _CharT* __p = traits_type::find(__data + __pos, __n, __c);
>   if (__p)
>     __ret = __p - __data;
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    rfind(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      const size_type __size = this->size();
>      if (__n <= __size)
> {
>   __pos = std::min(size_type(__size - __n), __pos);
>   const _CharT* __data = _M_data();
>   do
>     {
>       if (traits_type::compare(__data + __pos, __s, __n) == 0)
>  return __pos;
>     }
>   while (__pos-- > 0);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    rfind(_CharT __c, size_type __pos) const
>    {
>      size_type __size = this->size();
>      if (__size)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   for (++__size; __size-- > 0; )
>     if (traits_type::eq(_M_data()[__size], __c))
>       return __size;
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_first_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      for (; __n && __pos < this->size(); ++__pos)
> {
>   const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]);
>   if (__p)
>     return __pos;
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_last_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      size_type __size = this->size();
>      if (__size && __n)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   do
>     {
>       if (traits_type::find(__s, __n, _M_data()[__size]))
>  return __size;
>     }
>   while (__size-- != 0);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      for (; __pos < this->size(); ++__pos)
> if (!traits_type::find(__s, __n, _M_data()[__pos]))
>   return __pos;
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_first_not_of(_CharT __c, size_type __pos) const
>    {
>      for (; __pos < this->size(); ++__pos)
> if (!traits_type::eq(_M_data()[__pos], __c))
>   return __pos;
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      size_type __size = this->size();
>      if (__size)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   do
>     {
>       if (!traits_type::find(__s, __n, _M_data()[__size]))
>  return __size;
>     }
>   while (__size--);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_last_not_of(_CharT __c, size_type __pos) const
>    {
>      size_type __size = this->size();
>      if (__size)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   do
>     {
>       if (!traits_type::eq(_M_data()[__size], __c))
>  return __size;
>     }
>   while (__size--);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string<_CharT, _Traits, _Alloc>::
>    compare(size_type __pos, size_type __n, const basic_string& __str) const
>    {
>      _M_check(__pos, "basic_string::compare");
>      __n = _M_limit(__pos, __n);
>      const size_type __osize = __str.size();
>      const size_type __len = std::min(__n, __osize);
>      int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len);
>      if (!__r)
> __r = _S_compare(__n, __osize);
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string<_CharT, _Traits, _Alloc>::
>    compare(size_type __pos1, size_type __n1, const basic_string& __str,
>     size_type __pos2, size_type __n2) const
>    {
>      _M_check(__pos1, "basic_string::compare");
>      __str._M_check(__pos2, "basic_string::compare");
>      __n1 = _M_limit(__pos1, __n1);
>      __n2 = __str._M_limit(__pos2, __n2);
>      const size_type __len = std::min(__n1, __n2);
>      int __r = traits_type::compare(_M_data() + __pos1,
>         __str.data() + __pos2, __len);
>      if (!__r)
> __r = _S_compare(__n1, __n2);
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string<_CharT, _Traits, _Alloc>::
>    compare(const _CharT* __s) const
>    {
>      ;
>      const size_type __size = this->size();
>      const size_type __osize = traits_type::length(__s);
>      const size_type __len = std::min(__size, __osize);
>      int __r = traits_type::compare(_M_data(), __s, __len);
>      if (!__r)
> __r = _S_compare(__size, __osize);
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string <_CharT, _Traits, _Alloc>::
>    compare(size_type __pos, size_type __n1, const _CharT* __s) const
>    {
>      ;
>      _M_check(__pos, "basic_string::compare");
>      __n1 = _M_limit(__pos, __n1);
>      const size_type __osize = traits_type::length(__s);
>      const size_type __len = std::min(__n1, __osize);
>      int __r = traits_type::compare(_M_data() + __pos, __s, __len);
>      if (!__r)
> __r = _S_compare(__n1, __osize);
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string <_CharT, _Traits, _Alloc>::
>    compare(size_type __pos, size_type __n1, const _CharT* __s,
>     size_type __n2) const
>    {
>      ;
>      _M_check(__pos, "basic_string::compare");
>      __n1 = _M_limit(__pos, __n1);
>      const size_type __len = std::min(__n1, __n2);
>      int __r = traits_type::compare(_M_data() + __pos, __s, __len);
>      if (!__r)
> __r = _S_compare(__n1, __n2);
>      return __r;
>    }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in,
>        basic_string<_CharT, _Traits, _Alloc>& __str)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __istream_type::ios_base __ios_base;
>      typedef typename __istream_type::int_type __int_type;
>      typedef typename __string_type::size_type __size_type;
>      typedef ctype<_CharT> __ctype_type;
>      typedef typename __ctype_type::ctype_base __ctype_base;
>
>      __size_type __extracted = 0;
>      typename __ios_base::iostate __err = __ios_base::goodbit;
>      typename __istream_type::sentry __cerb(__in, false);
>      if (__cerb)
> {
>   try
>     {
>
>       __str.erase();
>       _CharT __buf[128];
>       __size_type __len = 0;
>       const streamsize __w = __in.width();
>       const __size_type __n = __w > 0 ? static_cast<__size_type>(__w)
>                                : __str.max_size();
>       const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc());
>       const __int_type __eof = _Traits::eof();
>       __int_type __c = __in.rdbuf()->sgetc();
>
>       while (__extracted < __n
>       && !_Traits::eq_int_type(__c, __eof)
>       && !__ct.is(__ctype_base::space,
>     _Traits::to_char_type(__c)))
>  {
>    if (__len == sizeof(__buf) / sizeof(_CharT))
>      {
>        __str.append(__buf, sizeof(__buf) / sizeof(_CharT));
>        __len = 0;
>      }
>    __buf[__len++] = _Traits::to_char_type(__c);
>    ++__extracted;
>    __c = __in.rdbuf()->snextc();
>  }
>       __str.append(__buf, __len);
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= __ios_base::eofbit;
>       __in.width(0);
>     }
>   catch(__cxxabiv1::__forced_unwind&)
>     {
>       __in._M_setstate(__ios_base::badbit);
>       throw;
>     }
>   catch(...)
>     {
>
>
>
>       __in._M_setstate(__ios_base::badbit);
>     }
> }
>
>      if (!__extracted)
> __err |= __ios_base::failbit;
>      if (__err)
> __in.setstate(__err);
>      return __in;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    getline(basic_istream<_CharT, _Traits>& __in,
>     basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __istream_type::ios_base __ios_base;
>      typedef typename __istream_type::int_type __int_type;
>      typedef typename __string_type::size_type __size_type;
>
>      __size_type __extracted = 0;
>      const __size_type __n = __str.max_size();
>      typename __ios_base::iostate __err = __ios_base::goodbit;
>      typename __istream_type::sentry __cerb(__in, true);
>      if (__cerb)
> {
>   try
>     {
>       __str.erase();
>       const __int_type __idelim = _Traits::to_int_type(__delim);
>       const __int_type __eof = _Traits::eof();
>       __int_type __c = __in.rdbuf()->sgetc();
>
>       while (__extracted < __n
>       && !_Traits::eq_int_type(__c, __eof)
>       && !_Traits::eq_int_type(__c, __idelim))
>  {
>    __str += _Traits::to_char_type(__c);
>    ++__extracted;
>    __c = __in.rdbuf()->snextc();
>  }
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= __ios_base::eofbit;
>       else if (_Traits::eq_int_type(__c, __idelim))
>  {
>    ++__extracted;
>    __in.rdbuf()->sbumpc();
>  }
>       else
>  __err |= __ios_base::failbit;
>     }
>   catch(__cxxabiv1::__forced_unwind&)
>     {
>       __in._M_setstate(__ios_base::badbit);
>       throw;
>     }
>   catch(...)
>     {
>
>
>
>       __in._M_setstate(__ios_base::badbit);
>     }
> }
>      if (!__extracted)
> __err |= __ios_base::failbit;
>      if (__err)
> __in.setstate(__err);
>      return __in;
>    }
>
>
>
>
>
>  extern template class basic_string<char>;
>  extern template
>    basic_istream<char>&
>    operator>>(basic_istream<char>&, string&);
>  extern template
>    basic_ostream<char>&
>    operator<<(basic_ostream<char>&, const string&);
>  extern template
>    basic_istream<char>&
>    getline(basic_istream<char>&, string&, char);
>  extern template
>    basic_istream<char>&
>    getline(basic_istream<char>&, string&);
>
>
>  extern template class basic_string<wchar_t>;
>  extern template
>    basic_istream<wchar_t>&
>    operator>>(basic_istream<wchar_t>&, wstring&);
>  extern template
>    basic_ostream<wchar_t>&
>    operator<<(basic_ostream<wchar_t>&, const wstring&);
>  extern template
>    basic_istream<wchar_t>&
>    getline(basic_istream<wchar_t>&, wstring&, wchar_t);
>  extern template
>    basic_istream<wchar_t>&
>    getline(basic_istream<wchar_t>&, wstring&);
>
>
>
>}
># 57 "/usr/include/c++/4.5/string" 2 3
># 110 "src/gflags.cc" 2
># 1 "/usr/include/c++/4.5/map" 1 3
># 58 "/usr/include/c++/4.5/map" 3
>       
># 59 "/usr/include/c++/4.5/map" 3
>
># 1 "/usr/include/c++/4.5/bits/stl_tree.h" 1 3
># 67 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 85 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>  enum _Rb_tree_color { _S_red = false, _S_black = true };
>
>  struct _Rb_tree_node_base
>  {
>    typedef _Rb_tree_node_base* _Base_ptr;
>    typedef const _Rb_tree_node_base* _Const_Base_ptr;
>
>    _Rb_tree_color _M_color;
>    _Base_ptr _M_parent;
>    _Base_ptr _M_left;
>    _Base_ptr _M_right;
>
>    static _Base_ptr
>    _S_minimum(_Base_ptr __x)
>    {
>      while (__x->_M_left != 0) __x = __x->_M_left;
>      return __x;
>    }
>
>    static _Const_Base_ptr
>    _S_minimum(_Const_Base_ptr __x)
>    {
>      while (__x->_M_left != 0) __x = __x->_M_left;
>      return __x;
>    }
>
>    static _Base_ptr
>    _S_maximum(_Base_ptr __x)
>    {
>      while (__x->_M_right != 0) __x = __x->_M_right;
>      return __x;
>    }
>
>    static _Const_Base_ptr
>    _S_maximum(_Const_Base_ptr __x)
>    {
>      while (__x->_M_right != 0) __x = __x->_M_right;
>      return __x;
>    }
>  };
>
>  template<typename _Val>
>    struct _Rb_tree_node : public _Rb_tree_node_base
>    {
>      typedef _Rb_tree_node<_Val>* _Link_type;
>      _Val _M_value_field;
>
>
>
>
>
>
>
>    };
>
>  __attribute__ ((__pure__)) _Rb_tree_node_base*
>  _Rb_tree_increment(_Rb_tree_node_base* __x) throw ();
>
>  __attribute__ ((__pure__)) const _Rb_tree_node_base*
>  _Rb_tree_increment(const _Rb_tree_node_base* __x) throw ();
>
>  __attribute__ ((__pure__)) _Rb_tree_node_base*
>  _Rb_tree_decrement(_Rb_tree_node_base* __x) throw ();
>
>  __attribute__ ((__pure__)) const _Rb_tree_node_base*
>  _Rb_tree_decrement(const _Rb_tree_node_base* __x) throw ();
>
>  template<typename _Tp>
>    struct _Rb_tree_iterator
>    {
>      typedef _Tp value_type;
>      typedef _Tp& reference;
>      typedef _Tp* pointer;
>
>      typedef bidirectional_iterator_tag iterator_category;
>      typedef ptrdiff_t difference_type;
>
>      typedef _Rb_tree_iterator<_Tp> _Self;
>      typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
>      typedef _Rb_tree_node<_Tp>* _Link_type;
>
>      _Rb_tree_iterator()
>      : _M_node() { }
>
>      explicit
>      _Rb_tree_iterator(_Link_type __x)
>      : _M_node(__x) { }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      _Self&
>      operator++()
>      {
> _M_node = _Rb_tree_increment(_M_node);
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_increment(_M_node);
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> _M_node = _Rb_tree_decrement(_M_node);
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_decrement(_M_node);
> return __tmp;
>      }
>
>      bool
>      operator==(const _Self& __x) const
>      { return _M_node == __x._M_node; }
>
>      bool
>      operator!=(const _Self& __x) const
>      { return _M_node != __x._M_node; }
>
>      _Base_ptr _M_node;
>  };
>
>  template<typename _Tp>
>    struct _Rb_tree_const_iterator
>    {
>      typedef _Tp value_type;
>      typedef const _Tp& reference;
>      typedef const _Tp* pointer;
>
>      typedef _Rb_tree_iterator<_Tp> iterator;
>
>      typedef bidirectional_iterator_tag iterator_category;
>      typedef ptrdiff_t difference_type;
>
>      typedef _Rb_tree_const_iterator<_Tp> _Self;
>      typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
>      typedef const _Rb_tree_node<_Tp>* _Link_type;
>
>      _Rb_tree_const_iterator()
>      : _M_node() { }
>
>      explicit
>      _Rb_tree_const_iterator(_Link_type __x)
>      : _M_node(__x) { }
>
>      _Rb_tree_const_iterator(const iterator& __it)
>      : _M_node(__it._M_node) { }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      _Self&
>      operator++()
>      {
> _M_node = _Rb_tree_increment(_M_node);
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_increment(_M_node);
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> _M_node = _Rb_tree_decrement(_M_node);
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_decrement(_M_node);
> return __tmp;
>      }
>
>      bool
>      operator==(const _Self& __x) const
>      { return _M_node == __x._M_node; }
>
>      bool
>      operator!=(const _Self& __x) const
>      { return _M_node != __x._M_node; }
>
>      _Base_ptr _M_node;
>    };
>
>  template<typename _Val>
>    inline bool
>    operator==(const _Rb_tree_iterator<_Val>& __x,
>               const _Rb_tree_const_iterator<_Val>& __y)
>    { return __x._M_node == __y._M_node; }
>
>  template<typename _Val>
>    inline bool
>    operator!=(const _Rb_tree_iterator<_Val>& __x,
>               const _Rb_tree_const_iterator<_Val>& __y)
>    { return __x._M_node != __y._M_node; }
>
>  void
>  _Rb_tree_insert_and_rebalance(const bool __insert_left,
>                                _Rb_tree_node_base* __x,
>                                _Rb_tree_node_base* __p,
>                                _Rb_tree_node_base& __header) throw ();
>
>  _Rb_tree_node_base*
>  _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
>          _Rb_tree_node_base& __header) throw ();
>
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc = allocator<_Val> >
>    class _Rb_tree
>    {
>      typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other
>              _Node_allocator;
>
>    protected:
>      typedef _Rb_tree_node_base* _Base_ptr;
>      typedef const _Rb_tree_node_base* _Const_Base_ptr;
>
>    public:
>      typedef _Key key_type;
>      typedef _Val value_type;
>      typedef value_type* pointer;
>      typedef const value_type* const_pointer;
>      typedef value_type& reference;
>      typedef const value_type& const_reference;
>      typedef _Rb_tree_node<_Val>* _Link_type;
>      typedef const _Rb_tree_node<_Val>* _Const_Link_type;
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Alloc allocator_type;
>
>      _Node_allocator&
>      _M_get_Node_allocator()
>      { return *static_cast<_Node_allocator*>(&this->_M_impl); }
>
>      const _Node_allocator&
>      _M_get_Node_allocator() const
>      { return *static_cast<const _Node_allocator*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_get_Node_allocator()); }
>
>    protected:
>      _Link_type
>      _M_get_node()
>      { return _M_impl._Node_allocator::allocate(1); }
>
>      void
>      _M_put_node(_Link_type __p)
>      { _M_impl._Node_allocator::deallocate(__p, 1); }
>
>
>      _Link_type
>      _M_create_node(const value_type& __x)
>      {
> _Link_type __tmp = _M_get_node();
> try
>   { get_allocator().construct(&__tmp->_M_value_field, __x); }
> catch(...)
>   {
>     _M_put_node(__tmp);
>     throw;
>   }
> return __tmp;
>      }
>
>      void
>      _M_destroy_node(_Link_type __p)
>      {
> get_allocator().destroy(&__p->_M_value_field);
> _M_put_node(__p);
>      }
># 413 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>      _Link_type
>      _M_clone_node(_Const_Link_type __x)
>      {
> _Link_type __tmp = _M_create_node(__x->_M_value_field);
> __tmp->_M_color = __x->_M_color;
> __tmp->_M_left = 0;
> __tmp->_M_right = 0;
> return __tmp;
>      }
>
>    protected:
>      template<typename _Key_compare,
>        bool _Is_pod_comparator = __is_pod(_Key_compare)>
>        struct _Rb_tree_impl : public _Node_allocator
>        {
>   _Key_compare _M_key_compare;
>   _Rb_tree_node_base _M_header;
>   size_type _M_node_count;
>
>   _Rb_tree_impl()
>   : _Node_allocator(), _M_key_compare(), _M_header(),
>     _M_node_count(0)
>   { _M_initialize(); }
>
>   _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a)
>   : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
>     _M_node_count(0)
>   { _M_initialize(); }
>
> private:
>   void
>   _M_initialize()
>   {
>     this->_M_header._M_color = _S_red;
>     this->_M_header._M_parent = 0;
>     this->_M_header._M_left = &this->_M_header;
>     this->_M_header._M_right = &this->_M_header;
>   }
> };
>
>      _Rb_tree_impl<_Compare> _M_impl;
>
>    protected:
>      _Base_ptr&
>      _M_root()
>      { return this->_M_impl._M_header._M_parent; }
>
>      _Const_Base_ptr
>      _M_root() const
>      { return this->_M_impl._M_header._M_parent; }
>
>      _Base_ptr&
>      _M_leftmost()
>      { return this->_M_impl._M_header._M_left; }
>
>      _Const_Base_ptr
>      _M_leftmost() const
>      { return this->_M_impl._M_header._M_left; }
>
>      _Base_ptr&
>      _M_rightmost()
>      { return this->_M_impl._M_header._M_right; }
>
>      _Const_Base_ptr
>      _M_rightmost() const
>      { return this->_M_impl._M_header._M_right; }
>
>      _Link_type
>      _M_begin()
>      { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
>
>      _Const_Link_type
>      _M_begin() const
>      {
> return static_cast<_Const_Link_type>
>   (this->_M_impl._M_header._M_parent);
>      }
>
>      _Link_type
>      _M_end()
>      { return static_cast<_Link_type>(&this->_M_impl._M_header); }
>
>      _Const_Link_type
>      _M_end() const
>      { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }
>
>      static const_reference
>      _S_value(_Const_Link_type __x)
>      { return __x->_M_value_field; }
>
>      static const _Key&
>      _S_key(_Const_Link_type __x)
>      { return _KeyOfValue()(_S_value(__x)); }
>
>      static _Link_type
>      _S_left(_Base_ptr __x)
>      { return static_cast<_Link_type>(__x->_M_left); }
>
>      static _Const_Link_type
>      _S_left(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x->_M_left); }
>
>      static _Link_type
>      _S_right(_Base_ptr __x)
>      { return static_cast<_Link_type>(__x->_M_right); }
>
>      static _Const_Link_type
>      _S_right(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x->_M_right); }
>
>      static const_reference
>      _S_value(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x)->_M_value_field; }
>
>      static const _Key&
>      _S_key(_Const_Base_ptr __x)
>      { return _KeyOfValue()(_S_value(__x)); }
>
>      static _Base_ptr
>      _S_minimum(_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_minimum(__x); }
>
>      static _Const_Base_ptr
>      _S_minimum(_Const_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_minimum(__x); }
>
>      static _Base_ptr
>      _S_maximum(_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_maximum(__x); }
>
>      static _Const_Base_ptr
>      _S_maximum(_Const_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_maximum(__x); }
>
>    public:
>      typedef _Rb_tree_iterator<value_type> iterator;
>      typedef _Rb_tree_const_iterator<value_type> const_iterator;
>
>      typedef std::reverse_iterator<iterator> reverse_iterator;
>      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>
>    private:
>      iterator
>      _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y,
>   const value_type& __v);
>
>
>
>      iterator
>      _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
>
>      iterator
>      _M_insert_equal_lower(const value_type& __x);
>
>      _Link_type
>      _M_copy(_Const_Link_type __x, _Link_type __p);
>
>      void
>      _M_erase(_Link_type __x);
>
>      iterator
>      _M_lower_bound(_Link_type __x, _Link_type __y,
>       const _Key& __k);
>
>      const_iterator
>      _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,
>       const _Key& __k) const;
>
>      iterator
>      _M_upper_bound(_Link_type __x, _Link_type __y,
>       const _Key& __k);
>
>      const_iterator
>      _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,
>       const _Key& __k) const;
>
>    public:
>
>      _Rb_tree() { }
>
>      _Rb_tree(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_impl(__comp, __a) { }
>
>      _Rb_tree(const _Rb_tree& __x)
>      : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())
>      {
> if (__x._M_root() != 0)
>   {
>     _M_root() = _M_copy(__x._M_begin(), _M_end());
>     _M_leftmost() = _S_minimum(_M_root());
>     _M_rightmost() = _S_maximum(_M_root());
>     _M_impl._M_node_count = __x._M_impl._M_node_count;
>   }
>      }
>
>
>
>
>
>      ~_Rb_tree()
>      { _M_erase(_M_begin()); }
>
>      _Rb_tree&
>      operator=(const _Rb_tree& __x);
>
>
>      _Compare
>      key_comp() const
>      { return _M_impl._M_key_compare; }
>
>      iterator
>      begin()
>      {
> return iterator(static_cast<_Link_type>
>   (this->_M_impl._M_header._M_left));
>      }
>
>      const_iterator
>      begin() const
>      {
> return const_iterator(static_cast<_Const_Link_type>
>         (this->_M_impl._M_header._M_left));
>      }
>
>      iterator
>      end()
>      { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); }
>
>      const_iterator
>      end() const
>      {
> return const_iterator(static_cast<_Const_Link_type>
>         (&this->_M_impl._M_header));
>      }
>
>      reverse_iterator
>      rbegin()
>      { return reverse_iterator(end()); }
>
>      const_reverse_iterator
>      rbegin() const
>      { return const_reverse_iterator(end()); }
>
>      reverse_iterator
>      rend()
>      { return reverse_iterator(begin()); }
>
>      const_reverse_iterator
>      rend() const
>      { return const_reverse_iterator(begin()); }
>
>      bool
>      empty() const
>      { return _M_impl._M_node_count == 0; }
>
>      size_type
>      size() const
>      { return _M_impl._M_node_count; }
>
>      size_type
>      max_size() const
>      { return _M_get_Node_allocator().max_size(); }
>
>      void
>      swap(_Rb_tree& __t);
>
>
>      pair<iterator, bool>
>      _M_insert_unique(const value_type& __x);
>
>      iterator
>      _M_insert_equal(const value_type& __x);
>
>      iterator
>      _M_insert_unique_(const_iterator __position, const value_type& __x);
>
>      iterator
>      _M_insert_equal_(const_iterator __position, const value_type& __x);
>
>      template<typename _InputIterator>
>        void
>        _M_insert_unique(_InputIterator __first, _InputIterator __last);
>
>      template<typename _InputIterator>
>        void
>        _M_insert_equal(_InputIterator __first, _InputIterator __last);
># 712 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>      void
>      erase(iterator __position);
>
>      void
>      erase(const_iterator __position);
>
>      size_type
>      erase(const key_type& __x);
># 732 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>      void
>      erase(iterator __first, iterator __last);
>
>      void
>      erase(const_iterator __first, const_iterator __last);
>
>      void
>      erase(const key_type* __first, const key_type* __last);
>
>      void
>      clear()
>      {
>        _M_erase(_M_begin());
>        _M_leftmost() = _M_end();
>        _M_root() = 0;
>        _M_rightmost() = _M_end();
>        _M_impl._M_node_count = 0;
>      }
>
>
>      iterator
>      find(const key_type& __k);
>
>      const_iterator
>      find(const key_type& __k) const;
>
>      size_type
>      count(const key_type& __k) const;
>
>      iterator
>      lower_bound(const key_type& __k)
>      { return _M_lower_bound(_M_begin(), _M_end(), __k); }
>
>      const_iterator
>      lower_bound(const key_type& __k) const
>      { return _M_lower_bound(_M_begin(), _M_end(), __k); }
>
>      iterator
>      upper_bound(const key_type& __k)
>      { return _M_upper_bound(_M_begin(), _M_end(), __k); }
>
>      const_iterator
>      upper_bound(const key_type& __k) const
>      { return _M_upper_bound(_M_begin(), _M_end(), __k); }
>
>      pair<iterator, iterator>
>      equal_range(const key_type& __k);
>
>      pair<const_iterator, const_iterator>
>      equal_range(const key_type& __k) const;
>
>
>      bool
>      __rb_verify() const;
>    };
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    {
>      return __x.size() == __y.size()
>      && std::equal(__x.begin(), __x.end(), __y.begin());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>       const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    {
>      return std::lexicographical_compare(__x.begin(), __x.end(),
>       __y.begin(), __y.end());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>       const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
># 867 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
>    {
>      if (this != &__x)
> {
>
>   clear();
>   _M_impl._M_key_compare = __x._M_impl._M_key_compare;
>   if (__x._M_root() != 0)
>     {
>       _M_root() = _M_copy(__x._M_begin(), _M_end());
>       _M_leftmost() = _S_minimum(_M_root());
>       _M_rightmost() = _S_maximum(_M_root());
>       _M_impl._M_node_count = __x._M_impl._M_node_count;
>     }
> }
>      return *this;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v)
>    {
>      bool __insert_left = (__x != 0 || __p == _M_end()
>       || _M_impl._M_key_compare(_KeyOfValue()(__v),
>            _S_key(__p)));
>
>      _Link_type __z = _M_create_node(__v);
>
>      _Rb_tree_insert_and_rebalance(__insert_left, __z,
>        const_cast<_Base_ptr>(__p),
>        this->_M_impl._M_header);
>      ++_M_impl._M_node_count;
>      return iterator(__z);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v)
>    {
>      bool __insert_left = (__x != 0 || __p == _M_end()
>       || !_M_impl._M_key_compare(_S_key(__p),
>             _KeyOfValue()(__v)));
>
>      _Link_type __z = _M_create_node(__v);
>
>      _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
>        this->_M_impl._M_header);
>      ++_M_impl._M_node_count;
>      return iterator(__z);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_equal_lower(const _Val& __v)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   __y = __x;
>   __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
>         _S_left(__x) : _S_right(__x);
> }
>      return _M_insert_lower(__x, __y, __v);
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
>    _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
>    _M_copy(_Const_Link_type __x, _Link_type __p)
>    {
>
>      _Link_type __top = _M_clone_node(__x);
>      __top->_M_parent = __p;
>
>      try
> {
>   if (__x->_M_right)
>     __top->_M_right = _M_copy(_S_right(__x), __top);
>   __p = __top;
>   __x = _S_left(__x);
>
>   while (__x != 0)
>     {
>       _Link_type __y = _M_clone_node(__x);
>       __p->_M_left = __y;
>       __y->_M_parent = __p;
>       if (__x->_M_right)
>  __y->_M_right = _M_copy(_S_right(__x), __y);
>       __p = __y;
>       __x = _S_left(__x);
>     }
> }
>      catch(...)
> {
>   _M_erase(__top);
>   throw;
> }
>      return __top;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_erase(_Link_type __x)
>    {
>
>      while (__x != 0)
> {
>   _M_erase(_S_right(__x));
>   _Link_type __y = _S_left(__x);
>   _M_destroy_node(__x);
>   __x = __y;
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_lower_bound(_Link_type __x, _Link_type __y,
>     const _Key& __k)
>    {
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,
>     const _Key& __k) const
>    {
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return const_iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_upper_bound(_Link_type __x, _Link_type __y,
>     const _Key& __k)
>    {
>      while (__x != 0)
> if (_M_impl._M_key_compare(__k, _S_key(__x)))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,
>     const _Key& __k) const
>    {
>      while (__x != 0)
> if (_M_impl._M_key_compare(__k, _S_key(__x)))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>      return const_iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator,
>  typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    equal_range(const _Key& __k)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   if (_M_impl._M_key_compare(_S_key(__x), __k))
>     __x = _S_right(__x);
>   else if (_M_impl._M_key_compare(__k, _S_key(__x)))
>     __y = __x, __x = _S_left(__x);
>   else
>     {
>       _Link_type __xu(__x), __yu(__y);
>       __y = __x, __x = _S_left(__x);
>       __xu = _S_right(__xu);
>       return pair<iterator,
>            iterator>(_M_lower_bound(__x, __y, __k),
>        _M_upper_bound(__xu, __yu, __k));
>     }
> }
>      return pair<iterator, iterator>(iterator(__y),
>          iterator(__y));
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::const_iterator,
>  typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::const_iterator>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    equal_range(const _Key& __k) const
>    {
>      _Const_Link_type __x = _M_begin();
>      _Const_Link_type __y = _M_end();
>      while (__x != 0)
> {
>   if (_M_impl._M_key_compare(_S_key(__x), __k))
>     __x = _S_right(__x);
>   else if (_M_impl._M_key_compare(__k, _S_key(__x)))
>     __y = __x, __x = _S_left(__x);
>   else
>     {
>       _Const_Link_type __xu(__x), __yu(__y);
>       __y = __x, __x = _S_left(__x);
>       __xu = _S_right(__xu);
>       return pair<const_iterator,
>            const_iterator>(_M_lower_bound(__x, __y, __k),
>       _M_upper_bound(__xu, __yu, __k));
>     }
> }
>      return pair<const_iterator, const_iterator>(const_iterator(__y),
>        const_iterator(__y));
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)
>    {
>      if (_M_root() == 0)
> {
>   if (__t._M_root() != 0)
>     {
>       _M_root() = __t._M_root();
>       _M_leftmost() = __t._M_leftmost();
>       _M_rightmost() = __t._M_rightmost();
>       _M_root()->_M_parent = _M_end();
>
>       __t._M_root() = 0;
>       __t._M_leftmost() = __t._M_end();
>       __t._M_rightmost() = __t._M_end();
>     }
> }
>      else if (__t._M_root() == 0)
> {
>   __t._M_root() = _M_root();
>   __t._M_leftmost() = _M_leftmost();
>   __t._M_rightmost() = _M_rightmost();
>   __t._M_root()->_M_parent = __t._M_end();
>
>   _M_root() = 0;
>   _M_leftmost() = _M_end();
>   _M_rightmost() = _M_end();
> }
>      else
> {
>   std::swap(_M_root(),__t._M_root());
>   std::swap(_M_leftmost(),__t._M_leftmost());
>   std::swap(_M_rightmost(),__t._M_rightmost());
>
>   _M_root()->_M_parent = _M_end();
>   __t._M_root()->_M_parent = __t._M_end();
> }
>
>      std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
>      std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
>
>
>
>      std::__alloc_swap<_Node_allocator>::
> _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator, bool>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_unique(const _Val& __v)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      bool __comp = true;
>      while (__x != 0)
> {
>   __y = __x;
>   __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));
>   __x = __comp ? _S_left(__x) : _S_right(__x);
> }
>      iterator __j = iterator(__y);
>      if (__comp)
> {
>   if (__j == begin())
>     return pair<iterator, bool>(_M_insert_(__x, __y, __v), true);
>   else
>     --__j;
> }
>      if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
> return pair<iterator, bool>(_M_insert_(__x, __y, __v), true);
>      return pair<iterator, bool>(__j, false);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_equal(const _Val& __v)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   __y = __x;
>   __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
>         _S_left(__x) : _S_right(__x);
> }
>      return _M_insert_(__x, __y, __v);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_unique_(const_iterator __position, const _Val& __v)
>    {
>
>      if (__position._M_node == _M_end())
> {
>   if (size() > 0
>       && _M_impl._M_key_compare(_S_key(_M_rightmost()),
>     _KeyOfValue()(__v)))
>     return _M_insert_(0, _M_rightmost(), __v);
>   else
>     return _M_insert_unique(__v).first;
> }
>      else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>          _S_key(__position._M_node)))
> {
>
>   const_iterator __before = __position;
>   if (__position._M_node == _M_leftmost())
>     return _M_insert_(_M_leftmost(), _M_leftmost(), __v);
>   else if (_M_impl._M_key_compare(_S_key((--__before)._M_node),
>       _KeyOfValue()(__v)))
>     {
>       if (_S_right(__before._M_node) == 0)
>  return _M_insert_(0, __before._M_node, __v);
>       else
>  return _M_insert_(__position._M_node,
>      __position._M_node, __v);
>     }
>   else
>     return _M_insert_unique(__v).first;
> }
>      else if (_M_impl._M_key_compare(_S_key(__position._M_node),
>          _KeyOfValue()(__v)))
> {
>
>   const_iterator __after = __position;
>   if (__position._M_node == _M_rightmost())
>     return _M_insert_(0, _M_rightmost(), __v);
>   else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>       _S_key((++__after)._M_node)))
>     {
>       if (_S_right(__position._M_node) == 0)
>  return _M_insert_(0, __position._M_node, __v);
>       else
>  return _M_insert_(__after._M_node, __after._M_node, __v);
>     }
>   else
>     return _M_insert_unique(__v).first;
> }
>      else
>
> return iterator(static_cast<_Link_type>
>   (const_cast<_Base_ptr>(__position._M_node)));
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert_equal_(const_iterator __position, const _Val& __v)
>    {
>
>      if (__position._M_node == _M_end())
> {
>   if (size() > 0
>       && !_M_impl._M_key_compare(_KeyOfValue()(__v),
>      _S_key(_M_rightmost())))
>     return _M_insert_(0, _M_rightmost(), __v);
>   else
>     return _M_insert_equal(__v);
> }
>      else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
>           _KeyOfValue()(__v)))
> {
>
>   const_iterator __before = __position;
>   if (__position._M_node == _M_leftmost())
>     return _M_insert_(_M_leftmost(), _M_leftmost(), __v);
>   else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
>        _S_key((--__before)._M_node)))
>     {
>       if (_S_right(__before._M_node) == 0)
>  return _M_insert_(0, __before._M_node, __v);
>       else
>  return _M_insert_(__position._M_node,
>      __position._M_node, __v);
>     }
>   else
>     return _M_insert_equal(__v);
> }
>      else
> {
>
>   const_iterator __after = __position;
>   if (__position._M_node == _M_rightmost())
>     return _M_insert_(0, _M_rightmost(), __v);
>   else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
>        _KeyOfValue()(__v)))
>     {
>       if (_S_right(__position._M_node) == 0)
>  return _M_insert_(0, __position._M_node, __v);
>       else
>  return _M_insert_(__after._M_node, __after._M_node, __v);
>     }
>   else
>     return _M_insert_equal_lower(__v);
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      _M_insert_unique(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   _M_insert_unique_(end(), *__first);
>      }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      _M_insert_equal(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   _M_insert_equal_(end(), *__first);
>      }
># 1391 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>  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));
>      _M_destroy_node(__y);
>      --_M_impl._M_node_count;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const_iterator __position)
>    {
>      _Link_type __y =
> static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
>    (const_cast<_Base_ptr>(__position._M_node),
>     this->_M_impl._M_header));
>      _M_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);
>      const size_type __old_size = size();
>      erase(__p.first, __p.second);
>      return __old_size - size();
>    }
># 1475 "/usr/include/c++/4.5/bits/stl_tree.h" 3
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(iterator __first, iterator __last)
>    {
>      if (__first == begin() && __last == end())
> clear();
>      else
> while (__first != __last)
>   erase(__first++);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const_iterator __first, const_iterator __last)
>    {
>      if (__first == begin() && __last == end())
> clear();
>      else
> while (__first != __last)
>   erase(__first++);
>    }
>
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const _Key* __first, const _Key* __last)
>    {
>      while (__first != __last)
> erase(*__first++);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    find(const _Key& __k)
>    {
>      iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
>      return (__j == end()
>       || _M_impl._M_key_compare(__k,
>     _S_key(__j._M_node))) ? end() : __j;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue,
>        _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    find(const _Key& __k) const
>    {
>      const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
>      return (__j == end()
>       || _M_impl._M_key_compare(__k,
>     _S_key(__j._M_node))) ? end() : __j;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    count(const _Key& __k) const
>    {
>      pair<const_iterator, const_iterator> __p = equal_range(__k);
>      const size_type __n = std::distance(__p.first, __p.second);
>      return __n;
>    }
>
>  __attribute__ ((__pure__)) unsigned int
>  _Rb_tree_black_count(const _Rb_tree_node_base* __node,
>                       const _Rb_tree_node_base* __root) throw ();
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    bool
>    _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const
>    {
>      if (_M_impl._M_node_count == 0 || begin() == end())
> return _M_impl._M_node_count == 0 && begin() == end()
>        && this->_M_impl._M_header._M_left == _M_end()
>        && this->_M_impl._M_header._M_right == _M_end();
>
>      unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
>      for (const_iterator __it = begin(); __it != end(); ++__it)
> {
>   _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
>   _Const_Link_type __L = _S_left(__x);
>   _Const_Link_type __R = _S_right(__x);
>
>   if (__x->_M_color == _S_red)
>     if ((__L && __L->_M_color == _S_red)
>  || (__R && __R->_M_color == _S_red))
>       return false;
>
>   if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
>     return false;
>   if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
>     return false;
>
>   if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
>     return false;
> }
>
>      if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
> return false;
>      if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
> return false;
>      return true;
>    }
>
>}
># 61 "/usr/include/c++/4.5/map" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_map.h" 1 3
># 64 "/usr/include/c++/4.5/bits/stl_map.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 84 "/usr/include/c++/4.5/bits/stl_map.h" 3
>  template <typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
>            typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class map
>    {
>    public:
>      typedef _Key key_type;
>      typedef _Tp mapped_type;
>      typedef std::pair<const _Key, _Tp> value_type;
>      typedef _Compare key_compare;
>      typedef _Alloc allocator_type;
>
>    private:
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>     
>     
>
>     
>
>    public:
>      class value_compare
>      : public std::binary_function<value_type, value_type, bool>
>      {
> friend class map<_Key, _Tp, _Compare, _Alloc>;
>      protected:
> _Compare comp;
>
> value_compare(_Compare __c)
> : comp(__c) { }
>
>      public:
> bool operator()(const value_type& __x, const value_type& __y) const
> { return comp(__x.first, __y.first); }
>      };
>
>    private:
>
>      typedef typename _Alloc::template rebind<value_type>::other
>        _Pair_alloc_type;
>
>      typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
>         key_compare, _Pair_alloc_type> _Rep_type;
>
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Pair_alloc_type::pointer pointer;
>      typedef typename _Pair_alloc_type::const_pointer const_pointer;
>      typedef typename _Pair_alloc_type::reference reference;
>      typedef typename _Pair_alloc_type::const_reference const_reference;
>      typedef typename _Rep_type::iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>      typedef typename _Rep_type::reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>
>
>
>
>
>
>
>      map()
>      : _M_t() { }
>
>
>
>
>
>
>      explicit
>      map(const _Compare& __comp,
>   const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 170 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      map(const map& __x)
>      : _M_t(__x._M_t) { }
># 211 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      template<typename _InputIterator>
>        map(_InputIterator __first, _InputIterator __last)
> : _M_t()
>        { _M_t._M_insert_unique(__first, __last); }
># 227 "/usr/include/c++/4.5/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._M_insert_unique(__first, __last); }
># 250 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      map&
>      operator=(const map& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
># 296 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      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(); }
># 415 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      bool
>      empty() const
>      { return _M_t.empty(); }
>
>
>      size_type
>      size() const
>      { return _M_t.size(); }
>
>
>      size_type
>      max_size() const
>      { return _M_t.max_size(); }
># 442 "/usr/include/c++/4.5/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;
>      }
># 464 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      mapped_type&
>      at(const key_type& __k)
>      {
> iterator __i = lower_bound(__k);
> if (__i == end() || key_comp()(__k, (*__i).first))
>   __throw_out_of_range(("map::at"));
> return (*__i).second;
>      }
>
>      const mapped_type&
>      at(const key_type& __k) const
>      {
> const_iterator __i = lower_bound(__k);
> if (__i == end() || key_comp()(__k, (*__i).first))
>   __throw_out_of_range(("map::at"));
> return (*__i).second;
>      }
># 499 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      std::pair<iterator, bool>
>      insert(const value_type& __x)
>      { return _M_t._M_insert_unique(__x); }
># 539 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t._M_insert_unique_(__position, __x); }
># 551 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      template<typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t._M_insert_unique(__first, __last); }
># 586 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 602 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 636 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 652 "/usr/include/c++/4.5/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()); }
># 695 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 710 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 722 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
># 737 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 752 "/usr/include/c++/4.5/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); }
># 791 "/usr/include/c++/4.5/bits/stl_map.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 810 "/usr/include/c++/4.5/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>&);
>    };
># 835 "/usr/include/c++/4.5/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; }
># 852 "/usr/include/c++/4.5/bits/stl_map.h" 3
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>              const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>              const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
>               const map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline void
>    swap(map<_Key, _Tp, _Compare, _Alloc>& __x,
>  map<_Key, _Tp, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>}
># 62 "/usr/include/c++/4.5/map" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_multimap.h" 1 3
># 63 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 83 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>  template <typename _Key, typename _Tp,
>     typename _Compare = std::less<_Key>,
>     typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class multimap
>    {
>    public:
>      typedef _Key key_type;
>      typedef _Tp mapped_type;
>      typedef std::pair<const _Key, _Tp> value_type;
>      typedef _Compare key_compare;
>      typedef _Alloc allocator_type;
>
>    private:
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>     
>     
>
>     
>
>    public:
>      class value_compare
>      : public std::binary_function<value_type, value_type, bool>
>      {
> friend class multimap<_Key, _Tp, _Compare, _Alloc>;
>      protected:
> _Compare comp;
>
> value_compare(_Compare __c)
> : comp(__c) { }
>
>      public:
> bool operator()(const value_type& __x, const value_type& __y) const
> { return comp(__x.first, __y.first); }
>      };
>
>    private:
>
>      typedef typename _Alloc::template rebind<value_type>::other
>        _Pair_alloc_type;
>
>      typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
>         key_compare, _Pair_alloc_type> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Pair_alloc_type::pointer pointer;
>      typedef typename _Pair_alloc_type::const_pointer const_pointer;
>      typedef typename _Pair_alloc_type::reference reference;
>      typedef typename _Pair_alloc_type::const_reference const_reference;
>      typedef typename _Rep_type::iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>      typedef typename _Rep_type::reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>
>
>
>
>
>
>      multimap()
>      : _M_t() { }
>
>
>
>
>
>
>      explicit
>      multimap(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 168 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      multimap(const multimap& __x)
>      : _M_t(__x._M_t) { }
># 208 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      template<typename _InputIterator>
>        multimap(_InputIterator __first, _InputIterator __last)
> : _M_t()
>        { _M_t._M_insert_equal(__first, __last); }
># 224 "/usr/include/c++/4.5/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._M_insert_equal(__first, __last); }
># 247 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      multimap&
>      operator=(const multimap& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
># 293 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      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(); }
># 410 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      bool
>      empty() const
>      { return _M_t.empty(); }
>
>
>      size_type
>      size() const
>      { return _M_t.size(); }
>
>
>      size_type
>      max_size() const
>      { return _M_t.max_size(); }
># 437 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      iterator
>      insert(const value_type& __x)
>      { return _M_t._M_insert_equal(__x); }
># 461 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t._M_insert_equal_(__position, __x); }
># 474 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      template<typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t._M_insert_equal(__first, __last); }
># 522 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 538 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 574 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 590 "/usr/include/c++/4.5/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()); }
># 633 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 648 "/usr/include/c++/4.5/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); }
># 672 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 687 "/usr/include/c++/4.5/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); }
># 724 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>      std::pair<iterator, iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 741 "/usr/include/c++/4.5/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>&);
>  };
># 766 "/usr/include/c++/4.5/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; }
># 783 "/usr/include/c++/4.5/bits/stl_multimap.h" 3
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>              const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>              const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>               const multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline void
>    swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x,
>         multimap<_Key, _Tp, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>}
># 63 "/usr/include/c++/4.5/map" 2 3
># 111 "src/gflags.cc" 2
># 1 "/usr/include/c++/4.5/vector" 1 3
># 59 "/usr/include/c++/4.5/vector" 3
>       
># 60 "/usr/include/c++/4.5/vector" 3
>
>
>
># 1 "/usr/include/c++/4.5/bits/stl_construct.h" 1 3
># 63 "/usr/include/c++/4.5/bits/stl_construct.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>
>
>
>  template<typename _T1, typename _T2>
>    inline void
>
>
>
>
>    _Construct(_T1* __p, const _T2& __value)
>
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1((__value));
>    }
>
>
>
>
>  template<typename _Tp>
>    inline void
>    _Destroy(_Tp* __pointer)
>    { __pointer->~_Tp(); }
>
>  template<bool>
>    struct _Destroy_aux
>    {
>      template<typename _ForwardIterator>
>        static void
>        __destroy(_ForwardIterator __first, _ForwardIterator __last)
> {
>   for (; __first != __last; ++__first)
>     std::_Destroy(&*__first);
> }
>    };
>
>  template<>
>    struct _Destroy_aux<true>
>    {
>      template<typename _ForwardIterator>
>        static void
>        __destroy(_ForwardIterator, _ForwardIterator) { }
>    };
>
>
>
>
>
>
>  template<typename _ForwardIterator>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
>                       _Value_type;
>      std::_Destroy_aux<__has_trivial_destructor(_Value_type)>::
> __destroy(__first, __last);
>    }
>
>
>
>
>
>
>
>  template <typename _Tp> class allocator;
>
>  template<typename _ForwardIterator, typename _Allocator>
>    void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      _Allocator& __alloc)
>    {
>      for (; __first != __last; ++__first)
> __alloc.destroy(&*__first);
>    }
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      allocator<_Tp>&)
>    {
>      _Destroy(__first, __last);
>    }
>
>}
># 64 "/usr/include/c++/4.5/vector" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 1 3
># 60 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<bool>
>    struct __uninitialized_copy
>    {
>      template<typename _InputIterator, typename _ForwardIterator>
>        static _ForwardIterator
>        uninitialized_copy(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result)
>        {
>   _ForwardIterator __cur = __result;
>   try
>     {
>       for (; __first != __last; ++__first, ++__cur)
>  std::_Construct(&*__cur, *__first);
>       return __cur;
>     }
>   catch(...)
>     {
>       std::_Destroy(__result, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_copy<true>
>    {
>      template<typename _InputIterator, typename _ForwardIterator>
>        static _ForwardIterator
>        uninitialized_copy(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result)
>        { return std::copy(__first, __last, __result); }
>    };
># 104 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    uninitialized_copy(_InputIterator __first, _InputIterator __last,
>         _ForwardIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType2;
>
>      return std::__uninitialized_copy<(__is_pod(_ValueType1)
>     && __is_pod(_ValueType2))>::
> uninitialized_copy(__first, __last, __result);
>    }
>
>
>  template<bool>
>    struct __uninitialized_fill
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        uninitialized_fill(_ForwardIterator __first,
>      _ForwardIterator __last, const _Tp& __x)
>        {
>   _ForwardIterator __cur = __first;
>   try
>     {
>       for (; __cur != __last; ++__cur)
>  std::_Construct(&*__cur, __x);
>     }
>   catch(...)
>     {
>       std::_Destroy(__first, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_fill<true>
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        uninitialized_fill(_ForwardIterator __first,
>      _ForwardIterator __last, const _Tp& __x)
>        { std::fill(__first, __last, __x); }
>    };
># 161 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,
>         const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>      std::__uninitialized_fill<__is_pod(_ValueType)>::
> uninitialized_fill(__first, __last, __x);
>    }
>
>
>  template<bool>
>    struct __uninitialized_construct_range_dispatch
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        __ucr(_ForwardIterator __first, _ForwardIterator __last,
>       _Tp& __value)
>        {
>   if(__first == __last)
>     return;
>
>   _ForwardIterator __cur = __first;
>   try
>     {
>       std::_Construct(&*__first, (__value));
>       _ForwardIterator __prev = __cur;
>       ++__cur;
>       for(; __cur != __last; ++__cur, ++__prev)
>  std::_Construct(&*__cur, (*__prev));
>       __value = (*__prev);
>     }
>   catch(...)
>     {
>       std::_Destroy(__first, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_construct_range_dispatch<true>
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        __ucr(_ForwardIterator, _ForwardIterator, _Tp&) { }
>    };
># 221 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    __uninitialized_construct_range(_ForwardIterator __first,
>        _ForwardIterator __last,
>        _Tp& __value)
>    {
>      typedef typename std::iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>      std::__uninitialized_construct_range_dispatch<
>        __has_trivial_constructor(_ValueType)>::
>   __ucr(__first, __last, __value);
>    }
>
>
>  template<bool>
>    struct __uninitialized_fill_n
>    {
>      template<typename _ForwardIterator, typename _Size, typename _Tp>
>        static void
>        uninitialized_fill_n(_ForwardIterator __first, _Size __n,
>        const _Tp& __x)
>        {
>   _ForwardIterator __cur = __first;
>   try
>     {
>       for (; __n > 0; --__n, ++__cur)
>  std::_Construct(&*__cur, __x);
>     }
>   catch(...)
>     {
>       std::_Destroy(__first, __cur);
>       throw;
>     }
> }
>    };
>
>  template<>
>    struct __uninitialized_fill_n<true>
>    {
>      template<typename _ForwardIterator, typename _Size, typename _Tp>
>        static void
>        uninitialized_fill_n(_ForwardIterator __first, _Size __n,
>        const _Tp& __x)
>        { std::fill_n(__first, __n, __x); }
>    };
># 277 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>      std::__uninitialized_fill_n<__is_pod(_ValueType)>::
> uninitialized_fill_n(__first, __n, __x);
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result, _Allocator& __alloc)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   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 _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_move_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result, _Allocator& __alloc)
>    {
>      return std::__uninitialized_copy_a((__first),
>      (__last),
>      __result, __alloc);
>    }
>
>  template<typename _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>
>    inline void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x, allocator<_Tp2>&)
>    { std::uninitialized_fill_n(__first, __n, __x); }
># 391 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_copy_move(_InputIterator1 __first1,
>         _InputIterator1 __last1,
>         _InputIterator2 __first2,
>         _InputIterator2 __last2,
>         _ForwardIterator __result,
>         _Allocator& __alloc)
>    {
>      _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1,
>          __result,
>          __alloc);
>      try
> {
>   return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_move_copy(_InputIterator1 __first1,
>         _InputIterator1 __last1,
>         _InputIterator2 __first2,
>         _InputIterator2 __last2,
>         _ForwardIterator __result,
>         _Allocator& __alloc)
>    {
>      _ForwardIterator __mid = std::__uninitialized_move_a(__first1, __last1,
>          __result,
>          __alloc);
>      try
> {
>   return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp, typename _InputIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid,
>         const _Tp& __x, _InputIterator __first,
>         _InputIterator __last, _Allocator& __alloc)
>    {
>      std::__uninitialized_fill_a(__result, __mid, __x, __alloc);
>      try
> {
>   return std::__uninitialized_move_a(__first, __last, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp,
>    typename _Allocator>
>    inline void
>    __uninitialized_move_fill(_InputIterator __first1, _InputIterator __last1,
>         _ForwardIterator __first2,
>         _ForwardIterator __last2, const _Tp& __x,
>         _Allocator& __alloc)
>    {
>      _ForwardIterator __mid2 = std::__uninitialized_move_a(__first1, __last1,
>           __first2,
>           __alloc);
>      try
> {
>   std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__first2, __mid2, __alloc);
>   throw;
> }
>    }
># 537 "/usr/include/c++/4.5/bits/stl_uninitialized.h" 3
>}
># 65 "/usr/include/c++/4.5/vector" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_vector.h" 1 3
># 65 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>  template<typename _Tp, typename _Alloc>
>    struct _Vector_base
>    {
>      typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;
>
>      struct _Vector_impl
>      : public _Tp_alloc_type
>      {
> typename _Tp_alloc_type::pointer _M_start;
> typename _Tp_alloc_type::pointer _M_finish;
> typename _Tp_alloc_type::pointer _M_end_of_storage;
>
> _Vector_impl()
> : _Tp_alloc_type(), _M_start(0), _M_finish(0), _M_end_of_storage(0)
> { }
>
> _Vector_impl(_Tp_alloc_type const& __a)
> : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)
> { }
>      };
>
>    public:
>      typedef _Alloc allocator_type;
>
>      _Tp_alloc_type&
>      _M_get_Tp_allocator()
>      { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
>
>      const _Tp_alloc_type&
>      _M_get_Tp_allocator() const
>      { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_get_Tp_allocator()); }
>
>      _Vector_base()
>      : _M_impl() { }
>
>      _Vector_base(const allocator_type& __a)
>      : _M_impl(__a) { }
>
>      _Vector_base(size_t __n, const allocator_type& __a)
>      : _M_impl(__a)
>      {
> this->_M_impl._M_start = this->_M_allocate(__n);
> this->_M_impl._M_finish = this->_M_impl._M_start;
> this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
>      }
># 131 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      ~_Vector_base()
>      { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage
>        - this->_M_impl._M_start); }
>
>    public:
>      _Vector_impl _M_impl;
>
>      typename _Tp_alloc_type::pointer
>      _M_allocate(size_t __n)
>      { return __n != 0 ? _M_impl.allocate(__n) : 0; }
>
>      void
>      _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n)
>      {
> if (__p)
>   _M_impl.deallocate(__p, __n);
>      }
>    };
># 169 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
>    class vector : protected _Vector_base<_Tp, _Alloc>
>    {
>
>      typedef typename _Alloc::value_type _Alloc_value_type;
>     
>     
>
>      typedef _Vector_base<_Tp, _Alloc> _Base;
>      typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;
>
>    public:
>      typedef _Tp value_type;
>      typedef typename _Tp_alloc_type::pointer pointer;
>      typedef typename _Tp_alloc_type::const_pointer const_pointer;
>      typedef typename _Tp_alloc_type::reference reference;
>      typedef typename _Tp_alloc_type::const_reference const_reference;
>      typedef __gnu_cxx::__normal_iterator<pointer, vector> iterator;
>      typedef __gnu_cxx::__normal_iterator<const_pointer, vector>
>      const_iterator;
>      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>      typedef std::reverse_iterator<iterator> reverse_iterator;
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Alloc allocator_type;
>
>    protected:
>      using _Base::_M_allocate;
>      using _Base::_M_deallocate;
>      using _Base::_M_impl;
>      using _Base::_M_get_Tp_allocator;
>
>    public:
>
>
>
>
>
>      vector()
>      : _Base() { }
>
>
>
>
>
>      explicit
>      vector(const allocator_type& __a)
>      : _Base(__a) { }
># 226 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      explicit
>      vector(size_type __n, const value_type& __value = value_type(),
>      const allocator_type& __a = allocator_type())
>      : _Base(__n, __a)
>      { _M_fill_initialize(__n, __value); }
># 241 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      vector(const vector& __x)
>      : _Base(__x.size(), __x._M_get_Tp_allocator())
>      { this->_M_impl._M_finish =
>   std::__uninitialized_copy_a(__x.begin(), __x.end(),
>          this->_M_impl._M_start,
>          _M_get_Tp_allocator());
>      }
># 296 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      template<typename _InputIterator>
>        vector(_InputIterator __first, _InputIterator __last,
>        const allocator_type& __a = allocator_type())
> : _Base(__a)
>        {
>
>   typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>   _M_initialize_dispatch(__first, __last, _Integral());
> }
>
>
>
>
>
>
>
>      ~vector()
>      { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>        _M_get_Tp_allocator()); }
># 324 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      vector&
>      operator=(const vector& __x);
># 374 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      assign(size_type __n, const value_type& __val)
>      { _M_fill_assign(__n, __val); }
># 390 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      template<typename _InputIterator>
>        void
>        assign(_InputIterator __first, _InputIterator __last)
>        {
>
>   typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>   _M_assign_dispatch(__first, __last, _Integral());
> }
># 417 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      using _Base::get_allocator;
>
>
>
>
>
>
>
>      iterator
>      begin()
>      { return iterator(this->_M_impl._M_start); }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return const_iterator(this->_M_impl._M_start); }
>
>
>
>
>
>
>      iterator
>      end()
>      { return iterator(this->_M_impl._M_finish); }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return const_iterator(this->_M_impl._M_finish); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return reverse_iterator(end()); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return const_reverse_iterator(end()); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return reverse_iterator(begin()); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return const_reverse_iterator(begin()); }
># 532 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      size_type
>      size() const
>      { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
>
>
>      size_type
>      max_size() const
>      { return _M_get_Tp_allocator().max_size(); }
># 552 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      resize(size_type __new_size, value_type __x = value_type())
>      {
> if (__new_size < size())
>   _M_erase_at_end(this->_M_impl._M_start + __new_size);
> else
>   insert(end(), __new_size - size(), __x);
>      }
># 572 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      size_type
>      capacity() const
>      { return size_type(this->_M_impl._M_end_of_storage
>    - this->_M_impl._M_start); }
>
>
>
>
>
>      bool
>      empty() const
>      { return begin() == end(); }
># 602 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      reserve(size_type __n);
># 617 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      reference
>      operator[](size_type __n)
>      { return *(this->_M_impl._M_start + __n); }
># 632 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      const_reference
>      operator[](size_type __n) const
>      { return *(this->_M_impl._M_start + __n); }
>
>    protected:
>
>      void
>      _M_range_check(size_type __n) const
>      {
> if (__n >= this->size())
>   __throw_out_of_range(("vector::_M_range_check"));
>      }
>
>    public:
># 657 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      reference
>      at(size_type __n)
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
># 675 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      const_reference
>      at(size_type __n) const
>      {
> _M_range_check(__n);
> return (*this)[__n];
>      }
>
>
>
>
>
>      reference
>      front()
>      { return *begin(); }
>
>
>
>
>
>      const_reference
>      front() const
>      { return *begin(); }
>
>
>
>
>
>      reference
>      back()
>      { return *(end() - 1); }
>
>
>
>
>
>      const_reference
>      back() const
>      { return *(end() - 1); }
># 721 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      pointer
>      data()
>      { return pointer(this->_M_impl._M_start); }
>
>      const_pointer
>      data() const
>      { return const_pointer(this->_M_impl._M_start); }
># 740 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      push_back(const value_type& __x)
>      {
> if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
>   {
>     this->_M_impl.construct(this->_M_impl._M_finish, __x);
>     ++this->_M_impl._M_finish;
>   }
> else
>   _M_insert_aux(end(), __x);
>      }
># 771 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      pop_back()
>      {
> --this->_M_impl._M_finish;
> this->_M_impl.destroy(this->_M_impl._M_finish);
>      }
># 807 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x);
># 857 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      insert(iterator __position, size_type __n, const value_type& __x)
>      { _M_fill_insert(__position, __n, __x); }
># 875 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      template<typename _InputIterator>
>        void
>        insert(iterator __position, _InputIterator __first,
>        _InputIterator __last)
>        {
>
>   typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>   _M_insert_dispatch(__position, __first, __last, _Integral());
> }
># 900 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      iterator
>      erase(iterator __position);
># 921 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      iterator
>      erase(iterator __first, iterator __last);
># 933 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      void
>      swap(vector& __x)
>      {
> std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
> std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
> std::swap(this->_M_impl._M_end_of_storage,
>    __x._M_impl._M_end_of_storage);
>
>
>
> std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(),
>          __x._M_get_Tp_allocator());
>      }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_erase_at_end(this->_M_impl._M_start); }
>
>    protected:
>
>
>
>
>      template<typename _ForwardIterator>
>        pointer
>        _M_allocate_and_copy(size_type __n,
>        _ForwardIterator __first, _ForwardIterator __last)
>        {
>   pointer __result = this->_M_allocate(__n);
>   try
>     {
>       std::__uninitialized_copy_a(__first, __last, __result,
>       _M_get_Tp_allocator());
>       return __result;
>     }
>   catch(...)
>     {
>       _M_deallocate(__result, __n);
>       throw;
>     }
> }
># 988 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      template<typename _Integer>
>        void
>        _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)
>        {
>   this->_M_impl._M_start = _M_allocate(static_cast<size_type>(__n));
>   this->_M_impl._M_end_of_storage =
>     this->_M_impl._M_start + static_cast<size_type>(__n);
>   _M_fill_initialize(static_cast<size_type>(__n), __value);
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
>          __false_type)
>        {
>   typedef typename std::iterator_traits<_InputIterator>::
>     iterator_category _IterCategory;
>   _M_range_initialize(__first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_range_initialize(_InputIterator __first,
>       _InputIterator __last, std::input_iterator_tag)
>        {
>   for (; __first != __last; ++__first)
>     push_back(*__first);
> }
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_range_initialize(_ForwardIterator __first,
>       _ForwardIterator __last, std::forward_iterator_tag)
>        {
>   const size_type __n = std::distance(__first, __last);
>   this->_M_impl._M_start = this->_M_allocate(__n);
>   this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
>   this->_M_impl._M_finish =
>     std::__uninitialized_copy_a(__first, __last,
>     this->_M_impl._M_start,
>     _M_get_Tp_allocator());
> }
>
>
>
>      void
>      _M_fill_initialize(size_type __n, const value_type& __value)
>      {
> std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value,
>          _M_get_Tp_allocator());
> this->_M_impl._M_finish = this->_M_impl._M_end_of_storage;
>      }
># 1052 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      template<typename _Integer>
>        void
>        _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>        { _M_fill_assign(__n, __val); }
>
>
>      template<typename _InputIterator>
>        void
>        _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
>      __false_type)
>        {
>   typedef typename std::iterator_traits<_InputIterator>::
>     iterator_category _IterCategory;
>   _M_assign_aux(__first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_assign_aux(_InputIterator __first, _InputIterator __last,
>        std::input_iterator_tag);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>        std::forward_iterator_tag);
>
>
>
>      void
>      _M_fill_assign(size_type __n, const value_type& __val);
># 1092 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>      template<typename _Integer>
>        void
>        _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
>      __true_type)
>        { _M_fill_insert(__pos, __n, __val); }
>
>
>      template<typename _InputIterator>
>        void
>        _M_insert_dispatch(iterator __pos, _InputIterator __first,
>      _InputIterator __last, __false_type)
>        {
>   typedef typename std::iterator_traits<_InputIterator>::
>     iterator_category _IterCategory;
>   _M_range_insert(__pos, __first, __last, _IterCategory());
> }
>
>
>      template<typename _InputIterator>
>        void
>        _M_range_insert(iterator __pos, _InputIterator __first,
>   _InputIterator __last, std::input_iterator_tag);
>
>
>      template<typename _ForwardIterator>
>        void
>        _M_range_insert(iterator __pos, _ForwardIterator __first,
>   _ForwardIterator __last, std::forward_iterator_tag);
>
>
>
>      void
>      _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
>
>
>
>      void
>      _M_insert_aux(iterator __position, const value_type& __x);
>
>
>
>
>
>
>
>      size_type
>      _M_check_len(size_type __n, const char* __s) const
>      {
> if (max_size() - size() < __n)
>   __throw_length_error((__s));
>
> const size_type __len = size() + std::max(size(), __n);
> return (__len < size() || __len > max_size()) ? max_size() : __len;
>      }
>
>
>
>
>
>      void
>      _M_erase_at_end(pointer __pos)
>      {
> std::_Destroy(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator());
> this->_M_impl._M_finish = __pos;
>      }
>    };
># 1170 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return (__x.size() == __y.size()
>       && std::equal(__x.begin(), __x.end(), __y.begin())); }
># 1187 "/usr/include/c++/4.5/bits/stl_vector.h" 3
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return std::lexicographical_compare(__x.begin(), __x.end(),
>       __y.begin(), __y.end()); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return __y < __x; }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline bool
>    operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template<typename _Tp, typename _Alloc>
>    inline void
>    swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)
>    { __x.swap(__y); }
>
>}
># 66 "/usr/include/c++/4.5/vector" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_bvector.h" 1 3
># 62 "/usr/include/c++/4.5/bits/stl_bvector.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  typedef unsigned long _Bit_type;
>  enum { _S_word_bit = int(8 * sizeof(_Bit_type)) };
>
>  struct _Bit_reference
>  {
>    _Bit_type * _M_p;
>    _Bit_type _M_mask;
>
>    _Bit_reference(_Bit_type * __x, _Bit_type __y)
>    : _M_p(__x), _M_mask(__y) { }
>
>    _Bit_reference() : _M_p(0), _M_mask(0) { }
>
>    operator bool() const
>    { return !!(*_M_p & _M_mask); }
>
>    _Bit_reference&
>    operator=(bool __x)
>    {
>      if (__x)
> *_M_p |= _M_mask;
>      else
> *_M_p &= ~_M_mask;
>      return *this;
>    }
>
>    _Bit_reference&
>    operator=(const _Bit_reference& __x)
>    { return *this = bool(__x); }
>
>    bool
>    operator==(const _Bit_reference& __x) const
>    { return bool(*this) == bool(__x); }
>
>    bool
>    operator<(const _Bit_reference& __x) const
>    { return !bool(*this) && bool(__x); }
>
>    void
>    flip()
>    { *_M_p ^= _M_mask; }
>  };
>
>  struct _Bit_iterator_base
>  : public std::iterator<std::random_access_iterator_tag, bool>
>  {
>    _Bit_type * _M_p;
>    unsigned int _M_offset;
>
>    _Bit_iterator_base(_Bit_type * __x, unsigned int __y)
>    : _M_p(__x), _M_offset(__y) { }
>
>    void
>    _M_bump_up()
>    {
>      if (_M_offset++ == int(_S_word_bit) - 1)
> {
>   _M_offset = 0;
>   ++_M_p;
> }
>    }
>
>    void
>    _M_bump_down()
>    {
>      if (_M_offset-- == 0)
> {
>   _M_offset = int(_S_word_bit) - 1;
>   --_M_p;
> }
>    }
>
>    void
>    _M_incr(ptrdiff_t __i)
>    {
>      difference_type __n = __i + _M_offset;
>      _M_p += __n / int(_S_word_bit);
>      __n = __n % int(_S_word_bit);
>      if (__n < 0)
> {
>   __n += int(_S_word_bit);
>   --_M_p;
> }
>      _M_offset = static_cast<unsigned int>(__n);
>    }
>
>    bool
>    operator==(const _Bit_iterator_base& __i) const
>    { return _M_p == __i._M_p && _M_offset == __i._M_offset; }
>
>    bool
>    operator<(const _Bit_iterator_base& __i) const
>    {
>      return _M_p < __i._M_p
>      || (_M_p == __i._M_p && _M_offset < __i._M_offset);
>    }
>
>    bool
>    operator!=(const _Bit_iterator_base& __i) const
>    { return !(*this == __i); }
>
>    bool
>    operator>(const _Bit_iterator_base& __i) const
>    { return __i < *this; }
>
>    bool
>    operator<=(const _Bit_iterator_base& __i) const
>    { return !(__i < *this); }
>
>    bool
>    operator>=(const _Bit_iterator_base& __i) const
>    { return !(*this < __i); }
>  };
>
>  inline ptrdiff_t
>  operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
>  {
>    return (int(_S_word_bit) * (__x._M_p - __y._M_p)
>     + __x._M_offset - __y._M_offset);
>  }
>
>  struct _Bit_iterator : public _Bit_iterator_base
>  {
>    typedef _Bit_reference reference;
>    typedef _Bit_reference* pointer;
>    typedef _Bit_iterator iterator;
>
>    _Bit_iterator() : _Bit_iterator_base(0, 0) { }
>
>    _Bit_iterator(_Bit_type * __x, unsigned int __y)
>    : _Bit_iterator_base(__x, __y) { }
>
>    reference
>    operator*() const
>    { return reference(_M_p, 1UL << _M_offset); }
>
>    iterator&
>    operator++()
>    {
>      _M_bump_up();
>      return *this;
>    }
>
>    iterator
>    operator++(int)
>    {
>      iterator __tmp = *this;
>      _M_bump_up();
>      return __tmp;
>    }
>
>    iterator&
>    operator--()
>    {
>      _M_bump_down();
>      return *this;
>    }
>
>    iterator
>    operator--(int)
>    {
>      iterator __tmp = *this;
>      _M_bump_down();
>      return __tmp;
>    }
>
>    iterator&
>    operator+=(difference_type __i)
>    {
>      _M_incr(__i);
>      return *this;
>    }
>
>    iterator&
>    operator-=(difference_type __i)
>    {
>      *this += -__i;
>      return *this;
>    }
>
>    iterator
>    operator+(difference_type __i) const
>    {
>      iterator __tmp = *this;
>      return __tmp += __i;
>    }
>
>    iterator
>    operator-(difference_type __i) const
>    {
>      iterator __tmp = *this;
>      return __tmp -= __i;
>    }
>
>    reference
>    operator[](difference_type __i) const
>    { return *(*this + __i); }
>  };
>
>  inline _Bit_iterator
>  operator+(ptrdiff_t __n, const _Bit_iterator& __x)
>  { return __x + __n; }
>
>  struct _Bit_const_iterator : public _Bit_iterator_base
>  {
>    typedef bool reference;
>    typedef bool const_reference;
>    typedef const bool* pointer;
>    typedef _Bit_const_iterator const_iterator;
>
>    _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
>
>    _Bit_const_iterator(_Bit_type * __x, unsigned int __y)
>    : _Bit_iterator_base(__x, __y) { }
>
>    _Bit_const_iterator(const _Bit_iterator& __x)
>    : _Bit_iterator_base(__x._M_p, __x._M_offset) { }
>
>    const_reference
>    operator*() const
>    { return _Bit_reference(_M_p, 1UL << _M_offset); }
>
>    const_iterator&
>    operator++()
>    {
>      _M_bump_up();
>      return *this;
>    }
>
>    const_iterator
>    operator++(int)
>    {
>      const_iterator __tmp = *this;
>      _M_bump_up();
>      return __tmp;
>    }
>
>    const_iterator&
>    operator--()
>    {
>      _M_bump_down();
>      return *this;
>    }
>
>    const_iterator
>    operator--(int)
>    {
>      const_iterator __tmp = *this;
>      _M_bump_down();
>      return __tmp;
>    }
>
>    const_iterator&
>    operator+=(difference_type __i)
>    {
>      _M_incr(__i);
>      return *this;
>    }
>
>    const_iterator&
>    operator-=(difference_type __i)
>    {
>      *this += -__i;
>      return *this;
>    }
>
>    const_iterator
>    operator+(difference_type __i) const
>    {
>      const_iterator __tmp = *this;
>      return __tmp += __i;
>    }
>
>    const_iterator
>    operator-(difference_type __i) const
>    {
>      const_iterator __tmp = *this;
>      return __tmp -= __i;
>    }
>
>    const_reference
>    operator[](difference_type __i) const
>    { return *(*this + __i); }
>  };
>
>  inline _Bit_const_iterator
>  operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)
>  { return __x + __n; }
>
>  inline void
>  __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
>  {
>    for (; __first != __last; ++__first)
>      *__first = __x;
>  }
>
>  inline void
>  fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
>  {
>    if (__first._M_p != __last._M_p)
>      {
> std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
> __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
> __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x);
>      }
>    else
>      __fill_bvector(__first, __last, __x);
>  }
>
>  template<typename _Alloc>
>    struct _Bvector_base
>    {
>      typedef typename _Alloc::template rebind<_Bit_type>::other
>        _Bit_alloc_type;
>
>      struct _Bvector_impl
>      : public _Bit_alloc_type
>      {
> _Bit_iterator _M_start;
> _Bit_iterator _M_finish;
> _Bit_type* _M_end_of_storage;
>
> _Bvector_impl()
> : _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage(0)
> { }
>
> _Bvector_impl(const _Bit_alloc_type& __a)
> : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0)
> { }
>      };
>
>    public:
>      typedef _Alloc allocator_type;
>
>      _Bit_alloc_type&
>      _M_get_Bit_allocator()
>      { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); }
>
>      const _Bit_alloc_type&
>      _M_get_Bit_allocator() const
>      { return *static_cast<const _Bit_alloc_type*>(&this->_M_impl); }
>
>      allocator_type
>      get_allocator() const
>      { return allocator_type(_M_get_Bit_allocator()); }
>
>      _Bvector_base()
>      : _M_impl() { }
>
>      _Bvector_base(const allocator_type& __a)
>      : _M_impl(__a) { }
># 429 "/usr/include/c++/4.5/bits/stl_bvector.h" 3
>      ~_Bvector_base()
>      { this->_M_deallocate(); }
>
>    protected:
>      _Bvector_impl _M_impl;
>
>      _Bit_type*
>      _M_allocate(size_t __n)
>      { return _M_impl.allocate((__n + int(_S_word_bit) - 1)
>    / int(_S_word_bit)); }
>
>      void
>      _M_deallocate()
>      {
> if (_M_impl._M_start._M_p)
>   _M_impl.deallocate(_M_impl._M_start._M_p,
>        _M_impl._M_end_of_storage - _M_impl._M_start._M_p);
>      }
>    };
>
>}
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 473 "/usr/include/c++/4.5/bits/stl_bvector.h" 3
>template<typename _Alloc>
>  class vector<bool, _Alloc> : protected _Bvector_base<_Alloc>
>  {
>    typedef _Bvector_base<_Alloc> _Base;
>
>
>
>
>
>  public:
>    typedef bool value_type;
>    typedef size_t size_type;
>    typedef ptrdiff_t difference_type;
>    typedef _Bit_reference reference;
>    typedef bool const_reference;
>    typedef _Bit_reference* pointer;
>    typedef const bool* const_pointer;
>    typedef _Bit_iterator iterator;
>    typedef _Bit_const_iterator const_iterator;
>    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>    typedef std::reverse_iterator<iterator> reverse_iterator;
>    typedef _Alloc allocator_type;
>
>    allocator_type get_allocator() const
>    { return _Base::get_allocator(); }
>
>  protected:
>    using _Base::_M_allocate;
>    using _Base::_M_deallocate;
>    using _Base::_M_get_Bit_allocator;
>
>  public:
>    vector()
>    : _Base() { }
>
>    explicit
>    vector(const allocator_type& __a)
>    : _Base(__a) { }
>
>    explicit
>    vector(size_type __n, const bool& __value = bool(),
>    const allocator_type& __a = allocator_type())
>    : _Base(__a)
>    {
>      _M_initialize(__n);
>      std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage,
>  __value ? ~0 : 0);
>    }
>
>    vector(const vector& __x)
>    : _Base(__x._M_get_Bit_allocator())
>    {
>      _M_initialize(__x.size());
>      _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
>    }
># 542 "/usr/include/c++/4.5/bits/stl_bvector.h" 3
>    template<typename _InputIterator>
>      vector(_InputIterator __first, _InputIterator __last,
>      const allocator_type& __a = allocator_type())
>      : _Base(__a)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_initialize_dispatch(__first, __last, _Integral());
>      }
>
>    ~vector() { }
>
>    vector&
>    operator=(const vector& __x)
>    {
>      if (&__x == this)
> return *this;
>      if (__x.size() > capacity())
> {
>   this->_M_deallocate();
>   _M_initialize(__x.size());
> }
>      this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
>      begin());
>      return *this;
>    }
># 591 "/usr/include/c++/4.5/bits/stl_bvector.h" 3
>    void
>    assign(size_type __n, const bool& __x)
>    { _M_fill_assign(__n, __x); }
>
>    template<typename _InputIterator>
>      void
>      assign(_InputIterator __first, _InputIterator __last)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_assign_dispatch(__first, __last, _Integral());
>      }
>
>
>
>
>
>
>
>    iterator
>    begin()
>    { return this->_M_impl._M_start; }
>
>    const_iterator
>    begin() const
>    { return this->_M_impl._M_start; }
>
>    iterator
>    end()
>    { return this->_M_impl._M_finish; }
>
>    const_iterator
>    end() const
>    { return this->_M_impl._M_finish; }
>
>    reverse_iterator
>    rbegin()
>    { return reverse_iterator(end()); }
>
>    const_reverse_iterator
>    rbegin() const
>    { return const_reverse_iterator(end()); }
>
>    reverse_iterator
>    rend()
>    { return reverse_iterator(begin()); }
>
>    const_reverse_iterator
>    rend() const
>    { return const_reverse_iterator(begin()); }
># 659 "/usr/include/c++/4.5/bits/stl_bvector.h" 3
>    size_type
>    size() const
>    { return size_type(end() - begin()); }
>
>    size_type
>    max_size() const
>    {
>      const size_type __isize =
> __gnu_cxx::__numeric_traits<difference_type>::__max
> - int(_S_word_bit) + 1;
>      const size_type __asize = _M_get_Bit_allocator().max_size();
>      return (__asize <= __isize / int(_S_word_bit)
>       ? __asize * int(_S_word_bit) : __isize);
>    }
>
>    size_type
>    capacity() const
>    { return size_type(const_iterator(this->_M_impl._M_end_of_storage, 0)
>         - begin()); }
>
>    bool
>    empty() const
>    { return begin() == end(); }
>
>    reference
>    operator[](size_type __n)
>    {
>      return *iterator(this->_M_impl._M_start._M_p
>         + __n / int(_S_word_bit), __n % int(_S_word_bit));
>    }
>
>    const_reference
>    operator[](size_type __n) const
>    {
>      return *const_iterator(this->_M_impl._M_start._M_p
>        + __n / int(_S_word_bit), __n % int(_S_word_bit));
>    }
>
>  protected:
>    void
>    _M_range_check(size_type __n) const
>    {
>      if (__n >= this->size())
>        __throw_out_of_range(("vector<bool>::_M_range_check"));
>    }
>
>  public:
>    reference
>    at(size_type __n)
>    { _M_range_check(__n); return (*this)[__n]; }
>
>    const_reference
>    at(size_type __n) const
>    { _M_range_check(__n); return (*this)[__n]; }
>
>    void
>    reserve(size_type __n);
>
>    reference
>    front()
>    { return *begin(); }
>
>    const_reference
>    front() const
>    { return *begin(); }
>
>    reference
>    back()
>    { return *(end() - 1); }
>
>    const_reference
>    back() const
>    { return *(end() - 1); }
>
>
>
>
>
>
>    void
>    data() { }
>
>    void
>    push_back(bool __x)
>    {
>      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
>        *this->_M_impl._M_finish++ = __x;
>      else
>        _M_insert_aux(end(), __x);
>    }
>
>    void
>    swap(vector& __x)
>    {
>      std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
>      std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
>      std::swap(this->_M_impl._M_end_of_storage,
>  __x._M_impl._M_end_of_storage);
>
>
>
>      std::__alloc_swap<typename _Base::_Bit_alloc_type>::
> _S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator());
>    }
>
>
>    static void
>    swap(reference __x, reference __y)
>    {
>      bool __tmp = __x;
>      __x = __y;
>      __y = __tmp;
>    }
>
>    iterator
>    insert(iterator __position, const bool& __x = bool())
>    {
>      const difference_type __n = __position - begin();
>      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage
>   && __position == end())
>        *this->_M_impl._M_finish++ = __x;
>      else
>        _M_insert_aux(__position, __x);
>      return begin() + __n;
>    }
>
>    template<typename _InputIterator>
>      void
>      insert(iterator __position,
>      _InputIterator __first, _InputIterator __last)
>      {
> typedef typename std::__is_integer<_InputIterator>::__type _Integral;
> _M_insert_dispatch(__position, __first, __last, _Integral());
>      }
>
>    void
>    insert(iterator __position, size_type __n, const bool& __x)
>    { _M_fill_insert(__position, __n, __x); }
>
>
>
>
>
>
>    void
>    pop_back()
>    { --this->_M_impl._M_finish; }
>
>    iterator
>    erase(iterator __position)
>    {
>      if (__position + 1 != end())
>        std::copy(__position + 1, end(), __position);
>      --this->_M_impl._M_finish;
>      return __position;
>    }
>
>    iterator
>    erase(iterator __first, iterator __last)
>    {
>      _M_erase_at_end(std::copy(__last, end(), __first));
>      return __first;
>    }
>
>    void
>    resize(size_type __new_size, bool __x = bool())
>    {
>      if (__new_size < size())
>        _M_erase_at_end(begin() + difference_type(__new_size));
>      else
>        insert(end(), __new_size - size(), __x);
>    }
>
>
>
>
>
>
>
>    void
>    flip()
>    {
>      for (_Bit_type * __p = this->_M_impl._M_start._M_p;
>    __p != this->_M_impl._M_end_of_storage; ++__p)
>        *__p = ~*__p;
>    }
>
>    void
>    clear()
>    { _M_erase_at_end(begin()); }
>
>
>  protected:
>
>    iterator
>    _M_copy_aligned(const_iterator __first, const_iterator __last,
>      iterator __result)
>    {
>      _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
>      return std::copy(const_iterator(__last._M_p, 0), __last,
>         iterator(__q, 0));
>    }
>
>    void
>    _M_initialize(size_type __n)
>    {
>      _Bit_type* __q = this->_M_allocate(__n);
>      this->_M_impl._M_end_of_storage = (__q
>      + ((__n + int(_S_word_bit) - 1)
>         / int(_S_word_bit)));
>      this->_M_impl._M_start = iterator(__q, 0);
>      this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n);
>    }
>
>
>
>
>
>    template<typename _Integer>
>      void
>      _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
>      {
> _M_initialize(static_cast<size_type>(__n));
> std::fill(this->_M_impl._M_start._M_p,
>    this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
>      }
>
>    template<typename _InputIterator>
>      void
>      _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
>        __false_type)
>      { _M_initialize_range(__first, __last,
>       std::__iterator_category(__first)); }
>
>    template<typename _InputIterator>
>      void
>      _M_initialize_range(_InputIterator __first, _InputIterator __last,
>     std::input_iterator_tag)
>      {
> for (; __first != __last; ++__first)
>   push_back(*__first);
>      }
>
>    template<typename _ForwardIterator>
>      void
>      _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
>     std::forward_iterator_tag)
>      {
> const size_type __n = std::distance(__first, __last);
> _M_initialize(__n);
> std::copy(__first, __last, this->_M_impl._M_start);
>      }
>
>
>
>    template<typename _Integer>
>      void
>      _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
>      { _M_fill_assign(__n, __val); }
>
>    template<class _InputIterator>
>      void
>      _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
>    __false_type)
>      { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
>
>    void
>    _M_fill_assign(size_t __n, bool __x)
>    {
>      if (__n > size())
> {
>   std::fill(this->_M_impl._M_start._M_p,
>      this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
>   insert(end(), __n - size(), __x);
> }
>      else
> {
>   _M_erase_at_end(begin() + __n);
>   std::fill(this->_M_impl._M_start._M_p,
>      this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
> }
>    }
>
>    template<typename _InputIterator>
>      void
>      _M_assign_aux(_InputIterator __first, _InputIterator __last,
>      std::input_iterator_tag)
>      {
> iterator __cur = begin();
> for (; __first != __last && __cur != end(); ++__cur, ++__first)
>   *__cur = *__first;
> if (__first == __last)
>   _M_erase_at_end(__cur);
> else
>   insert(end(), __first, __last);
>      }
>
>    template<typename _ForwardIterator>
>      void
>      _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>      std::forward_iterator_tag)
>      {
> const size_type __len = std::distance(__first, __last);
> if (__len < size())
>   _M_erase_at_end(std::copy(__first, __last, begin()));
> else
>   {
>     _ForwardIterator __mid = __first;
>     std::advance(__mid, size());
>     std::copy(__first, __mid, begin());
>     insert(end(), __mid, __last);
>   }
>      }
>
>
>
>
>
>    template<typename _Integer>
>      void
>      _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
>    __true_type)
>      { _M_fill_insert(__pos, __n, __x); }
>
>    template<typename _InputIterator>
>      void
>      _M_insert_dispatch(iterator __pos,
>    _InputIterator __first, _InputIterator __last,
>    __false_type)
>      { _M_insert_range(__pos, __first, __last,
>   std::__iterator_category(__first)); }
>
>    void
>    _M_fill_insert(iterator __position, size_type __n, bool __x);
>
>    template<typename _InputIterator>
>      void
>      _M_insert_range(iterator __pos, _InputIterator __first,
>        _InputIterator __last, std::input_iterator_tag)
>      {
> for (; __first != __last; ++__first)
>   {
>     __pos = insert(__pos, *__first);
>     ++__pos;
>   }
>      }
>
>    template<typename _ForwardIterator>
>      void
>      _M_insert_range(iterator __position, _ForwardIterator __first,
>        _ForwardIterator __last, std::forward_iterator_tag);
>
>    void
>    _M_insert_aux(iterator __position, bool __x);
>
>    size_type
>    _M_check_len(size_type __n, const char* __s) const
>    {
>      if (max_size() - size() < __n)
> __throw_length_error((__s));
>
>      const size_type __len = size() + std::max(size(), __n);
>      return (__len < size() || __len > max_size()) ? max_size() : __len;
>    }
>
>    void
>    _M_erase_at_end(iterator __pos)
>    { this->_M_impl._M_finish = __pos; }
>  };
>
>}
># 67 "/usr/include/c++/4.5/vector" 2 3
>
>
># 1 "/usr/include/c++/4.5/bits/vector.tcc" 1 3
># 60 "/usr/include/c++/4.5/bits/vector.tcc" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    reserve(size_type __n)
>    {
>      if (__n > this->max_size())
> __throw_length_error(("vector::reserve"));
>      if (this->capacity() < __n)
> {
>   const size_type __old_size = size();
>   pointer __tmp = _M_allocate_and_copy(__n,
>   (this->_M_impl._M_start),
>   (this->_M_impl._M_finish));
>   std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>   _M_get_Tp_allocator());
>   _M_deallocate(this->_M_impl._M_start,
>   this->_M_impl._M_end_of_storage
>   - this->_M_impl._M_start);
>   this->_M_impl._M_start = __tmp;
>   this->_M_impl._M_finish = __tmp + __old_size;
>   this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
> }
>    }
># 104 "/usr/include/c++/4.5/bits/vector.tcc" 3
>  template<typename _Tp, typename _Alloc>
>    typename vector<_Tp, _Alloc>::iterator
>    vector<_Tp, _Alloc>::
>    insert(iterator __position, const value_type& __x)
>    {
>      const size_type __n = __position - begin();
>      if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage
>   && __position == end())
> {
>   this->_M_impl.construct(this->_M_impl._M_finish, __x);
>   ++this->_M_impl._M_finish;
> }
>      else
> {
># 126 "/usr/include/c++/4.5/bits/vector.tcc" 3
>     _M_insert_aux(__position, __x);
> }
>      return iterator(this->_M_impl._M_start + __n);
>    }
>
>  template<typename _Tp, typename _Alloc>
>    typename vector<_Tp, _Alloc>::iterator
>    vector<_Tp, _Alloc>::
>    erase(iterator __position)
>    {
>      if (__position + 1 != end())
> std::copy(__position + 1, end(), __position);
>      --this->_M_impl._M_finish;
>      this->_M_impl.destroy(this->_M_impl._M_finish);
>      return __position;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    typename vector<_Tp, _Alloc>::iterator
>    vector<_Tp, _Alloc>::
>    erase(iterator __first, iterator __last)
>    {
>      if (__last != end())
> std::copy(__last, end(), __first);
>      _M_erase_at_end(__first.base() + (end() - __last));
>      return __first;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    vector<_Tp, _Alloc>&
>    vector<_Tp, _Alloc>::
>    operator=(const vector<_Tp, _Alloc>& __x)
>    {
>      if (&__x != this)
> {
>   const size_type __xlen = __x.size();
>   if (__xlen > capacity())
>     {
>       pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
>         __x.end());
>       std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>       _M_deallocate(this->_M_impl._M_start,
>       this->_M_impl._M_end_of_storage
>       - this->_M_impl._M_start);
>       this->_M_impl._M_start = __tmp;
>       this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;
>     }
>   else if (size() >= __xlen)
>     {
>       std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),
>       end(), _M_get_Tp_allocator());
>     }
>   else
>     {
>       std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),
>   this->_M_impl._M_start);
>       std::__uninitialized_copy_a(__x._M_impl._M_start + size(),
>       __x._M_impl._M_finish,
>       this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>     }
>   this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
> }
>      return *this;
>    }
>
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    _M_fill_assign(size_t __n, const value_type& __val)
>    {
>      if (__n > capacity())
> {
>   vector __tmp(__n, __val, _M_get_Tp_allocator());
>   __tmp.swap(*this);
> }
>      else if (__n > size())
> {
>   std::fill(begin(), end(), __val);
>   std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
>     __n - size(), __val,
>     _M_get_Tp_allocator());
>   this->_M_impl._M_finish += __n - size();
> }
>      else
>        _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
>    }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _InputIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_assign_aux(_InputIterator __first, _InputIterator __last,
>      std::input_iterator_tag)
>      {
> pointer __cur(this->_M_impl._M_start);
> for (; __first != __last && __cur != this->_M_impl._M_finish;
>      ++__cur, ++__first)
>   *__cur = *__first;
> if (__first == __last)
>   _M_erase_at_end(__cur);
> else
>   insert(end(), __first, __last);
>      }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _ForwardIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
>      std::forward_iterator_tag)
>      {
> const size_type __len = std::distance(__first, __last);
>
> if (__len > capacity())
>   {
>     pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
>     std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>     _M_get_Tp_allocator());
>     _M_deallocate(this->_M_impl._M_start,
>     this->_M_impl._M_end_of_storage
>     - this->_M_impl._M_start);
>     this->_M_impl._M_start = __tmp;
>     this->_M_impl._M_finish = this->_M_impl._M_start + __len;
>     this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;
>   }
> else if (size() >= __len)
>   _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
> else
>   {
>     _ForwardIterator __mid = __first;
>     std::advance(__mid, size());
>     std::copy(__first, __mid, this->_M_impl._M_start);
>     this->_M_impl._M_finish =
>       std::__uninitialized_copy_a(__mid, __last,
>       this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>   }
>      }
># 293 "/usr/include/c++/4.5/bits/vector.tcc" 3
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    _M_insert_aux(iterator __position, const _Tp& __x)
>
>    {
>      if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
> {
>   this->_M_impl.construct(this->_M_impl._M_finish,
>      (*(this->_M_impl._M_finish - 1))
>             );
>   ++this->_M_impl._M_finish;
>
>   _Tp __x_copy = __x;
>
>   std::copy_backward(__position.base(), this->_M_impl._M_finish - 2, this->_M_impl._M_finish - 1)
>
>                                  ;
>
>   *__position = __x_copy;
>
>
>
> }
>      else
> {
>   const size_type __len =
>     _M_check_len(size_type(1), "vector::_M_insert_aux");
>   const size_type __elems_before = __position - begin();
>   pointer __new_start(this->_M_allocate(__len));
>   pointer __new_finish(__new_start);
>   try
>     {
>
>
>
>
>       this->_M_impl.construct(__new_start + __elems_before,
>
>
>
>                               __x);
>
>       __new_finish = 0;
>
>       __new_finish =
>  std::__uninitialized_move_a(this->_M_impl._M_start,
>         __position.base(), __new_start,
>         _M_get_Tp_allocator());
>       ++__new_finish;
>
>       __new_finish =
>  std::__uninitialized_move_a(__position.base(),
>         this->_M_impl._M_finish,
>         __new_finish,
>         _M_get_Tp_allocator());
>     }
>          catch(...)
>     {
>       if (!__new_finish)
>  this->_M_impl.destroy(__new_start + __elems_before);
>       else
>  std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());
>       _M_deallocate(__new_start, __len);
>       throw;
>     }
>   std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>   _M_get_Tp_allocator());
>   _M_deallocate(this->_M_impl._M_start,
>   this->_M_impl._M_end_of_storage
>   - this->_M_impl._M_start);
>   this->_M_impl._M_start = __new_start;
>   this->_M_impl._M_finish = __new_finish;
>   this->_M_impl._M_end_of_storage = __new_start + __len;
> }
>    }
>
>  template<typename _Tp, typename _Alloc>
>    void
>    vector<_Tp, _Alloc>::
>    _M_fill_insert(iterator __position, size_type __n, const value_type& __x)
>    {
>      if (__n != 0)
> {
>   if (size_type(this->_M_impl._M_end_of_storage
>   - this->_M_impl._M_finish) >= __n)
>     {
>       value_type __x_copy = __x;
>       const size_type __elems_after = end() - __position;
>       pointer __old_finish(this->_M_impl._M_finish);
>       if (__elems_after > __n)
>  {
>    std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
>           this->_M_impl._M_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __n;
>    std::copy_backward(__position.base(), __old_finish - __n, __old_finish)
>                                        ;
>    std::fill(__position.base(), __position.base() + __n,
>       __x_copy);
>  }
>       else
>  {
>    std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
>      __n - __elems_after,
>      __x_copy,
>      _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __n - __elems_after;
>    std::__uninitialized_move_a(__position.base(), __old_finish,
>           this->_M_impl._M_finish,
>           _M_get_Tp_allocator());
>    this->_M_impl._M_finish += __elems_after;
>    std::fill(__position.base(), __old_finish, __x_copy);
>  }
>     }
>   else
>     {
>       const size_type __len =
>  _M_check_len(__n, "vector::_M_fill_insert");
>       const size_type __elems_before = __position - begin();
>       pointer __new_start(this->_M_allocate(__len));
>       pointer __new_finish(__new_start);
>       try
>  {
>
>    std::__uninitialized_fill_n_a(__new_start + __elems_before,
>      __n, __x,
>      _M_get_Tp_allocator());
>    __new_finish = 0;
>
>    __new_finish =
>      std::__uninitialized_move_a(this->_M_impl._M_start,
>      __position.base(),
>      __new_start,
>      _M_get_Tp_allocator());
>    __new_finish += __n;
>
>    __new_finish =
>      std::__uninitialized_move_a(__position.base(),
>      this->_M_impl._M_finish,
>      __new_finish,
>      _M_get_Tp_allocator());
>  }
>       catch(...)
>  {
>    if (!__new_finish)
>      std::_Destroy(__new_start + __elems_before,
>      __new_start + __elems_before + __n,
>      _M_get_Tp_allocator());
>    else
>      std::_Destroy(__new_start, __new_finish,
>      _M_get_Tp_allocator());
>    _M_deallocate(__new_start, __len);
>    throw;
>  }
>       std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>       _M_get_Tp_allocator());
>       _M_deallocate(this->_M_impl._M_start,
>       this->_M_impl._M_end_of_storage
>       - this->_M_impl._M_start);
>       this->_M_impl._M_start = __new_start;
>       this->_M_impl._M_finish = __new_finish;
>       this->_M_impl._M_end_of_storage = __new_start + __len;
>     }
> }
>    }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _InputIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_range_insert(iterator __pos, _InputIterator __first,
>        _InputIterator __last, std::input_iterator_tag)
>      {
> for (; __first != __last; ++__first)
>   {
>     __pos = insert(__pos, *__first);
>     ++__pos;
>   }
>      }
>
>  template<typename _Tp, typename _Alloc>
>    template<typename _ForwardIterator>
>      void
>      vector<_Tp, _Alloc>::
>      _M_range_insert(iterator __position, _ForwardIterator __first,
>        _ForwardIterator __last, std::forward_iterator_tag)
>      {
> if (__first != __last)
>   {
>     const size_type __n = std::distance(__first, __last);
>     if (size_type(this->_M_impl._M_end_of_storage
>     - this->_M_impl._M_finish) >= __n)
>       {
>  const size_type __elems_after = end() - __position;
>  pointer __old_finish(this->_M_impl._M_finish);
>  if (__elems_after > __n)
>    {
>      std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
>      this->_M_impl._M_finish,
>      this->_M_impl._M_finish,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_finish += __n;
>      std::copy_backward(__position.base(), __old_finish - __n, __old_finish)
>                                          ;
>      std::copy(__first, __last, __position);
>    }
>  else
>    {
>      _ForwardIterator __mid = __first;
>      std::advance(__mid, __elems_after);
>      std::__uninitialized_copy_a(__mid, __last,
>      this->_M_impl._M_finish,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_finish += __n - __elems_after;
>      std::__uninitialized_move_a(__position.base(),
>      __old_finish,
>      this->_M_impl._M_finish,
>      _M_get_Tp_allocator());
>      this->_M_impl._M_finish += __elems_after;
>      std::copy(__first, __mid, __position);
>    }
>       }
>     else
>       {
>  const size_type __len =
>    _M_check_len(__n, "vector::_M_range_insert");
>  pointer __new_start(this->_M_allocate(__len));
>  pointer __new_finish(__new_start);
>  try
>    {
>      __new_finish =
>        std::__uninitialized_move_a(this->_M_impl._M_start,
>        __position.base(),
>        __new_start,
>        _M_get_Tp_allocator());
>      __new_finish =
>        std::__uninitialized_copy_a(__first, __last,
>        __new_finish,
>        _M_get_Tp_allocator());
>      __new_finish =
>        std::__uninitialized_move_a(__position.base(),
>        this->_M_impl._M_finish,
>        __new_finish,
>        _M_get_Tp_allocator());
>    }
>  catch(...)
>    {
>      std::_Destroy(__new_start, __new_finish,
>      _M_get_Tp_allocator());
>      _M_deallocate(__new_start, __len);
>      throw;
>    }
>  std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
>         _M_get_Tp_allocator());
>  _M_deallocate(this->_M_impl._M_start,
>         this->_M_impl._M_end_of_storage
>         - this->_M_impl._M_start);
>  this->_M_impl._M_start = __new_start;
>  this->_M_impl._M_finish = __new_finish;
>  this->_M_impl._M_end_of_storage = __new_start + __len;
>       }
>   }
>      }
>
>
>
>
>  template<typename _Alloc>
>    void
>    vector<bool, _Alloc>::
>    reserve(size_type __n)
>    {
>      if (__n > this->max_size())
> __throw_length_error(("vector::reserve"));
>      if (this->capacity() < __n)
> {
>   _Bit_type* __q = this->_M_allocate(__n);
>   this->_M_impl._M_finish = _M_copy_aligned(begin(), end(),
>          iterator(__q, 0));
>   this->_M_deallocate();
>   this->_M_impl._M_start = iterator(__q, 0);
>   this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1)
>          / int(_S_word_bit));
> }
>    }
>
>  template<typename _Alloc>
>    void
>    vector<bool, _Alloc>::
>    _M_fill_insert(iterator __position, size_type __n, bool __x)
>    {
>      if (__n == 0)
> return;
>      if (capacity() - size() >= __n)
> {
>   std::copy_backward(__position, end(),
>        this->_M_impl._M_finish + difference_type(__n));
>   std::fill(__position, __position + difference_type(__n), __x);
>   this->_M_impl._M_finish += difference_type(__n);
> }
>      else
> {
>   const size_type __len =
>     _M_check_len(__n, "vector<bool>::_M_fill_insert");
>   _Bit_type * __q = this->_M_allocate(__len);
>   iterator __i = _M_copy_aligned(begin(), __position,
>      iterator(__q, 0));
>   std::fill(__i, __i + difference_type(__n), __x);
>   this->_M_impl._M_finish = std::copy(__position, end(),
>           __i + difference_type(__n));
>   this->_M_deallocate();
>   this->_M_impl._M_end_of_storage = (__q + ((__len
>           + int(_S_word_bit) - 1)
>          / int(_S_word_bit)));
>   this->_M_impl._M_start = iterator(__q, 0);
> }
>    }
>
>  template<typename _Alloc>
>    template<typename _ForwardIterator>
>      void
>      vector<bool, _Alloc>::
>      _M_insert_range(iterator __position, _ForwardIterator __first,
>        _ForwardIterator __last, std::forward_iterator_tag)
>      {
> if (__first != __last)
>   {
>     size_type __n = std::distance(__first, __last);
>     if (capacity() - size() >= __n)
>       {
>  std::copy_backward(__position, end(),
>       this->_M_impl._M_finish
>       + difference_type(__n));
>  std::copy(__first, __last, __position);
>  this->_M_impl._M_finish += difference_type(__n);
>       }
>     else
>       {
>  const size_type __len =
>    _M_check_len(__n, "vector<bool>::_M_insert_range");
>  _Bit_type * __q = this->_M_allocate(__len);
>  iterator __i = _M_copy_aligned(begin(), __position,
>            iterator(__q, 0));
>  __i = std::copy(__first, __last, __i);
>  this->_M_impl._M_finish = std::copy(__position, end(), __i);
>  this->_M_deallocate();
>  this->_M_impl._M_end_of_storage = (__q
>         + ((__len
>             + int(_S_word_bit) - 1)
>            / int(_S_word_bit)));
>  this->_M_impl._M_start = iterator(__q, 0);
>       }
>   }
>      }
>
>  template<typename _Alloc>
>    void
>    vector<bool, _Alloc>::
>    _M_insert_aux(iterator __position, bool __x)
>    {
>      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
> {
>   std::copy_backward(__position, this->_M_impl._M_finish,
>        this->_M_impl._M_finish + 1);
>   *__position = __x;
>   ++this->_M_impl._M_finish;
> }
>      else
> {
>   const size_type __len =
>     _M_check_len(size_type(1), "vector<bool>::_M_insert_aux");
>   _Bit_type * __q = this->_M_allocate(__len);
>   iterator __i = _M_copy_aligned(begin(), __position,
>      iterator(__q, 0));
>   *__i++ = __x;
>   this->_M_impl._M_finish = std::copy(__position, end(), __i);
>   this->_M_deallocate();
>   this->_M_impl._M_end_of_storage = (__q + ((__len
>           + int(_S_word_bit) - 1)
>          / int(_S_word_bit)));
>   this->_M_impl._M_start = iterator(__q, 0);
> }
>    }
>
>}
># 70 "/usr/include/c++/4.5/vector" 2 3
># 112 "src/gflags.cc" 2
># 1 "/usr/include/c++/4.5/utility" 1 3
># 59 "/usr/include/c++/4.5/utility" 3
>       
># 60 "/usr/include/c++/4.5/utility" 3
># 70 "/usr/include/c++/4.5/utility" 3
># 1 "/usr/include/c++/4.5/bits/stl_relops.h" 1 3
># 67 "/usr/include/c++/4.5/bits/stl_relops.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  namespace rel_ops
>  {
># 83 "/usr/include/c++/4.5/bits/stl_relops.h" 3
>    template <class _Tp>
>      inline bool
>      operator!=(const _Tp& __x, const _Tp& __y)
>      { return !(__x == __y); }
># 96 "/usr/include/c++/4.5/bits/stl_relops.h" 3
>    template <class _Tp>
>      inline bool
>      operator>(const _Tp& __x, const _Tp& __y)
>      { return __y < __x; }
># 109 "/usr/include/c++/4.5/bits/stl_relops.h" 3
>    template <class _Tp>
>      inline bool
>      operator<=(const _Tp& __x, const _Tp& __y)
>      { return !(__y < __x); }
># 122 "/usr/include/c++/4.5/bits/stl_relops.h" 3
>    template <class _Tp>
>      inline bool
>      operator>=(const _Tp& __x, const _Tp& __y)
>      { return !(__x < __y); }
>
>  }
>
>}
># 71 "/usr/include/c++/4.5/utility" 2 3
># 113 "src/gflags.cc" 2
># 1 "/usr/include/c++/4.5/algorithm" 1 3
># 59 "/usr/include/c++/4.5/algorithm" 3
>       
># 60 "/usr/include/c++/4.5/algorithm" 3
>
>
>
># 1 "/usr/include/c++/4.5/bits/stl_algo.h" 1 3
># 60 "/usr/include/c++/4.5/bits/stl_algo.h" 3
># 1 "/usr/include/c++/4.5/cstdlib" 1 3
># 41 "/usr/include/c++/4.5/cstdlib" 3
>       
># 42 "/usr/include/c++/4.5/cstdlib" 3
>
>
># 1 "/usr/include/c++/4.5/cstddef" 1 3
># 41 "/usr/include/c++/4.5/cstddef" 3
>       
># 42 "/usr/include/c++/4.5/cstddef" 3
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 45 "/usr/include/c++/4.5/cstddef" 2 3
># 45 "/usr/include/c++/4.5/cstdlib" 2 3
># 68 "/usr/include/c++/4.5/cstdlib" 3
># 1 "/usr/include/stdlib.h" 1 3 4
># 33 "/usr/include/stdlib.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/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
># 67 "/usr/include/bits/waitstatus.h" 3 4
>union wait
>  {
>    int w_status;
>    struct
>      {
>
> unsigned int __w_termsig:7;
> unsigned int __w_coredump:1;
> unsigned int __w_retcode:8;
> unsigned int:16;
>
>
>
>
>
>
>
>      } __wait_terminated;
>    struct
>      {
>
> unsigned int __w_stopval:8;
> unsigned int __w_stopsig:8;
> unsigned int:16;
>
>
>
>
>
>
>      } __wait_stopped;
>  };
># 44 "/usr/include/stdlib.h" 2 3 4
># 96 "/usr/include/stdlib.h" 3 4
>
>
>typedef struct
>  {
>    int quot;
>    int rem;
>  } div_t;
>
>
>
>typedef struct
>  {
>    long int quot;
>    long int rem;
>  } ldiv_t;
>
>
>
>
>
>
>
>__extension__ typedef struct
>  {
>    long long int quot;
>    long long int rem;
>  } lldiv_t;
>
>
># 140 "/usr/include/stdlib.h" 3 4
>extern size_t __ctype_get_mb_cur_max (void) throw () ;
>
>
>
>
>extern double atof (const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern int atoi (const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern long int atol (const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__ extern long long int atoll (const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern double strtod (const char *__restrict __nptr,
>        char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern float strtof (const char *__restrict __nptr,
>       char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern long double strtold (const char *__restrict __nptr,
>       char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern long int strtol (const char *__restrict __nptr,
>   char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern unsigned long int strtoul (const char *__restrict __nptr,
>      char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>__extension__
>extern long long int strtoq (const char *__restrict __nptr,
>        char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtouq (const char *__restrict __nptr,
>           char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__
>extern long long int strtoll (const char *__restrict __nptr,
>         char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtoull (const char *__restrict __nptr,
>     char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
># 240 "/usr/include/stdlib.h" 3 4
>extern long int strtol_l (const char *__restrict __nptr,
>     char **__restrict __endptr, int __base,
>     __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern unsigned long int strtoul_l (const char *__restrict __nptr,
>        char **__restrict __endptr,
>        int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern long long int strtoll_l (const char *__restrict __nptr,
>    char **__restrict __endptr, int __base,
>    __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern unsigned long long int strtoull_l (const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern double strtod_l (const char *__restrict __nptr,
>   char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern float strtof_l (const char *__restrict __nptr,
>         char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern long double strtold_l (const char *__restrict __nptr,
>         char **__restrict __endptr,
>         __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>
>
>
>
>extern __inline __attribute__ ((__gnu_inline__)) double
>atof (const char *__nptr) throw ()
>{
>  return strtod (__nptr, (char **) __null);
>}
>extern __inline __attribute__ ((__gnu_inline__)) int
>atoi (const char *__nptr) throw ()
>{
>  return (int) strtol (__nptr, (char **) __null, 10);
>}
>extern __inline __attribute__ ((__gnu_inline__)) long int
>atol (const char *__nptr) throw ()
>{
>  return strtol (__nptr, (char **) __null, 10);
>}
>
>
>
>
>__extension__ extern __inline __attribute__ ((__gnu_inline__)) long long int
>atoll (const char *__nptr) throw ()
>{
>  return strtoll (__nptr, (char **) __null, 10);
>}
>
># 311 "/usr/include/stdlib.h" 3 4
>extern char *l64a (long int __n) throw () ;
>
>
>extern long int a64l (const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
># 1 "/usr/include/sys/types.h" 1 3 4
># 29 "/usr/include/sys/types.h" 3 4
>extern "C" {
>
>
>
>
>
>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;
># 72 "/usr/include/sys/types.h" 3 4
>typedef __mode_t mode_t;
>
>
>
>
>typedef __nlink_t nlink_t;
># 105 "/usr/include/sys/types.h" 3 4
>typedef __id_t id_t;
># 116 "/usr/include/sys/types.h" 3 4
>typedef __daddr_t daddr_t;
>typedef __caddr_t caddr_t;
>
>
>
>
>
>typedef __key_t key_t;
># 141 "/usr/include/sys/types.h" 3 4
>typedef __suseconds_t suseconds_t;
>
>
>
>
>
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/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;
># 201 "/usr/include/sys/types.h" 3 4
>typedef unsigned int u_int8_t __attribute__ ((__mode__ (__QI__)));
>typedef unsigned int u_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int u_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int u_int64_t __attribute__ ((__mode__ (__DI__)));
>
>typedef int register_t __attribute__ ((__mode__ (__word__)));
># 220 "/usr/include/sys/types.h" 3 4
># 1 "/usr/include/sys/select.h" 1 3 4
># 31 "/usr/include/sys/select.h" 3 4
># 1 "/usr/include/bits/select.h" 1 3 4
># 23 "/usr/include/bits/select.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 24 "/usr/include/bits/select.h" 2 3 4
># 32 "/usr/include/sys/select.h" 2 3 4
>
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 35 "/usr/include/sys/select.h" 2 3 4
># 46 "/usr/include/sys/select.h" 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 * (int) sizeof (__fd_mask))];
>
>
>
>
>
>  } fd_set;
>
>
>
>
>
>
>typedef __fd_mask fd_mask;
># 99 "/usr/include/sys/select.h" 3 4
>extern "C" {
># 109 "/usr/include/sys/select.h" 3 4
>extern int select (int __nfds, fd_set *__restrict __readfds,
>     fd_set *__restrict __writefds,
>     fd_set *__restrict __exceptfds,
>     struct timeval *__restrict __timeout);
># 121 "/usr/include/sys/select.h" 3 4
>extern int pselect (int __nfds, fd_set *__restrict __readfds,
>      fd_set *__restrict __writefds,
>      fd_set *__restrict __exceptfds,
>      const struct timespec *__restrict __timeout,
>      const __sigset_t *__restrict __sigmask);
>
>
>}
># 221 "/usr/include/sys/types.h" 2 3 4
>
>
># 1 "/usr/include/sys/sysmacros.h" 1 3 4
># 30 "/usr/include/sys/sysmacros.h" 3 4
>__extension__
>extern unsigned int gnu_dev_major (unsigned long long int __dev)
>     throw ();
>__extension__
>extern unsigned int gnu_dev_minor (unsigned long long int __dev)
>     throw ();
>__extension__
>extern unsigned long long int gnu_dev_makedev (unsigned int __major,
>            unsigned int __minor)
>     throw ();
>
>
>__extension__ extern __inline __attribute__ ((__gnu_inline__)) unsigned int
>gnu_dev_major (unsigned long long int __dev) throw ()
>{
>  return ((__dev >> 8) & 0xfff) | ((unsigned int) (__dev >> 32) & ~0xfff);
>}
>
>__extension__ extern __inline __attribute__ ((__gnu_inline__)) unsigned int
>gnu_dev_minor (unsigned long long int __dev) throw ()
>{
>  return (__dev & 0xff) | ((unsigned int) (__dev >> 12) & ~0xff);
>}
>
>__extension__ extern __inline __attribute__ ((__gnu_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));
>}
># 224 "/usr/include/sys/types.h" 2 3 4
>
>
>
>
>typedef __blksize_t blksize_t;
>
>
>
>
>
>
>typedef __blkcnt_t blkcnt_t;
>
>
>
>typedef __fsblkcnt_t fsblkcnt_t;
>
>
>
>typedef __fsfilcnt_t fsfilcnt_t;
># 262 "/usr/include/sys/types.h" 3 4
>typedef __blkcnt64_t blkcnt64_t;
>typedef __fsblkcnt64_t fsblkcnt64_t;
>typedef __fsfilcnt64_t fsfilcnt64_t;
># 273 "/usr/include/sys/types.h" 3 4
>}
># 321 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>
>
>extern long int random (void) throw ();
>
>
>extern void srandom (unsigned int __seed) throw ();
>
>
>
>
>
>extern char *initstate (unsigned int __seed, char *__statebuf,
>   size_t __statelen) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern char *setstate (char *__statebuf) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>struct random_data
>  {
>    int32_t *fptr;
>    int32_t *rptr;
>    int32_t *state;
>    int rand_type;
>    int rand_deg;
>    int rand_sep;
>    int32_t *end_ptr;
>  };
>
>extern int random_r (struct random_data *__restrict __buf,
>       int32_t *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int srandom_r (unsigned int __seed, struct random_data *__buf)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int initstate_r (unsigned int __seed, char *__restrict __statebuf,
>   size_t __statelen,
>   struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (2, 4)));
>
>extern int setstate_r (char *__restrict __statebuf,
>         struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern int rand (void) throw ();
>
>extern void srand (unsigned int __seed) throw ();
>
>
>
>
>extern int rand_r (unsigned int *__seed) throw ();
>
>
>
>
>
>
>
>extern double drand48 (void) throw ();
>extern double erand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int lrand48 (void) throw ();
>extern long int nrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int mrand48 (void) throw ();
>extern long int jrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void srand48 (long int __seedval) throw ();
>extern unsigned short int *seed48 (unsigned short int __seed16v[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>extern void lcong48 (unsigned short int __param[7]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>struct drand48_data
>  {
>    unsigned short int __x[3];
>    unsigned short int __old_x[3];
>    unsigned short int __c;
>    unsigned short int __init;
>    unsigned long long int __a;
>  };
>
>
>extern int drand48_r (struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int erand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int lrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int nrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int mrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int jrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int srand48_r (long int __seedval, struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int seed48_r (unsigned short int __seed16v[3],
>       struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int lcong48_r (unsigned short int __param[7],
>        struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>
>
>extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>extern void *calloc (size_t __nmemb, size_t __size)
>     throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>
>
>
>
>
>
>extern void *realloc (void *__ptr, size_t __size)
>     throw () __attribute__ ((__warn_unused_result__));
>
>extern void free (void *__ptr) throw ();
>
>
>
>
>extern void cfree (void *__ptr) throw ();
>
>
>
># 1 "/usr/include/alloca.h" 1 3 4
># 25 "/usr/include/alloca.h" 3 4
># 1 "/usr/lib64/gcc/x86_64-suse-linux/4.5/include/stddef.h" 1 3 4
># 26 "/usr/include/alloca.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>extern void *alloca (size_t __size) throw ();
>
>
>
>
>
>}
># 498 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>extern void *valloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern void abort (void) throw () __attribute__ ((__noreturn__));
>
>
>
>extern int atexit (void (*__func) (void)) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern "C++" int at_quick_exit (void (*__func) (void))
>     throw () __asm ("at_quick_exit") __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>
>
>extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>
>extern void quick_exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>
>extern void _Exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>extern char *getenv (const char *__name) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern char *__secure_getenv (const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int putenv (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int setenv (const char *__name, const char *__value, int __replace)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int unsetenv (const char *__name) throw ();
>
>
>
>
>
>
>extern int clearenv (void) throw ();
># 604 "/usr/include/stdlib.h" 3 4
>extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
># 615 "/usr/include/stdlib.h" 3 4
>extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 625 "/usr/include/stdlib.h" 3 4
>extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 637 "/usr/include/stdlib.h" 3 4
>extern int mkstemps (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) ;
># 647 "/usr/include/stdlib.h" 3 4
>extern int mkstemps64 (char *__template, int __suffixlen)
>     __attribute__ ((__nonnull__ (1))) ;
># 658 "/usr/include/stdlib.h" 3 4
>extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
># 669 "/usr/include/stdlib.h" 3 4
>extern int mkostemp (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ;
># 679 "/usr/include/stdlib.h" 3 4
>extern int mkostemp64 (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ;
># 689 "/usr/include/stdlib.h" 3 4
>extern int mkostemps (char *__template, int __suffixlen, int __flags)
>     __attribute__ ((__nonnull__ (1))) ;
># 701 "/usr/include/stdlib.h" 3 4
>extern int mkostemps64 (char *__template, int __suffixlen, int __flags)
>     __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>
>
>extern int system (const char *__command) ;
>
>
>
>
>
>
>extern char *canonicalize_file_name (const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 729 "/usr/include/stdlib.h" 3 4
>extern char *realpath (const char *__restrict __name,
>         char *__restrict __resolved) throw () ;
>
>
>
>
>
>
>typedef int (*__compar_fn_t) (const void *, const void *);
>
>
>typedef __compar_fn_t comparison_fn_t;
>
>
>
>typedef int (*__compar_d_fn_t) (const void *, const void *, void *);
>
>
>
>
>
>extern void *bsearch (const void *__key, const void *__base,
>        size_t __nmemb, size_t __size, __compar_fn_t __compar)
>     __attribute__ ((__nonnull__ (1, 2, 5))) ;
>
>
>
>extern void qsort (void *__base, size_t __nmemb, size_t __size,
>     __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4)));
>
>extern void qsort_r (void *__base, size_t __nmemb, size_t __size,
>       __compar_d_fn_t __compar, void *__arg)
>  __attribute__ ((__nonnull__ (1, 4)));
>
>
>
>
>extern int abs (int __x) throw () __attribute__ ((__const__)) ;
>extern long int labs (long int __x) throw () __attribute__ ((__const__)) ;
>
>
>
>__extension__ extern long long int llabs (long long int __x)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>
>
>
>extern div_t div (int __numer, int __denom)
>     throw () __attribute__ ((__const__)) ;
>extern ldiv_t ldiv (long int __numer, long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>__extension__ extern lldiv_t lldiv (long long int __numer,
>        long long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
># 802 "/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))) ;
># 890 "/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)));
># 958 "/usr/include/stdlib.h" 3 4
>}
># 69 "/usr/include/c++/4.5/cstdlib" 2 3
># 100 "/usr/include/c++/4.5/cstdlib" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  using ::div_t;
>  using ::ldiv_t;
>
>  using ::abort;
>  using ::abs;
>  using ::atexit;
>  using ::atof;
>  using ::atoi;
>  using ::atol;
>  using ::bsearch;
>  using ::calloc;
>  using ::div;
>  using ::exit;
>  using ::free;
>  using ::getenv;
>  using ::labs;
>  using ::ldiv;
>  using ::malloc;
>
>  using ::mblen;
>  using ::mbstowcs;
>  using ::mbtowc;
>
>  using ::qsort;
>  using ::rand;
>  using ::realloc;
>  using ::srand;
>  using ::strtod;
>  using ::strtol;
>  using ::strtoul;
>  using ::system;
>
>  using ::wcstombs;
>  using ::wctomb;
>
>
>  inline long
>  abs(long __i) { return labs(__i); }
>
>  inline ldiv_t
>  div(long __i, long __j) { return ldiv(__i, __j); }
>
>}
># 157 "/usr/include/c++/4.5/cstdlib" 3
>namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) {
>
>
>  using ::lldiv_t;
>
>
>
>
>
>  using ::_Exit;
>
>
>  inline long long
>  abs(long long __x) { return __x >= 0 ? __x : -__x; }
>
>
>  using ::llabs;
>
>  inline lldiv_t
>  div(long long __n, long long __d)
>  { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }
>
>  using ::lldiv;
># 190 "/usr/include/c++/4.5/cstdlib" 3
>  using ::atoll;
>  using ::strtoll;
>  using ::strtoull;
>
>  using ::strtof;
>  using ::strtold;
>
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>  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;
>
>}
># 61 "/usr/include/c++/4.5/bits/stl_algo.h" 2 3
># 1 "/usr/include/c++/4.5/bits/algorithmfwd.h" 1 3
># 33 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>       
># 34 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>
>
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 199 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _FIter, typename _Tp>
>    bool
>    binary_search(_FIter, _FIter, const _Tp&);
>
>  template<typename _FIter, typename _Tp, typename _Compare>
>    bool
>    binary_search(_FIter, _FIter, const _Tp&, _Compare);
>
>  template<typename _IIter, typename _OIter>
>    _OIter
>    copy(_IIter, _IIter, _OIter);
>
>  template<typename _BIter1, typename _BIter2>
>    _BIter2
>    copy_backward(_BIter1, _BIter1, _BIter2);
># 228 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _FIter, typename _Tp>
>    pair<_FIter, _FIter>
>    equal_range(_FIter, _FIter, const _Tp&);
>
>  template<typename _FIter, typename _Tp, typename _Compare>
>    pair<_FIter, _FIter>
>    equal_range(_FIter, _FIter, const _Tp&, _Compare);
>
>  template<typename _FIter, typename _Tp>
>    void
>    fill(_FIter, _FIter, const _Tp&);
>
>  template<typename _OIter, typename _Size, typename _Tp>
>    _OIter
>    fill_n(_OIter, _Size, const _Tp&);
>
>
>
>  template<typename _FIter1, typename _FIter2>
>    _FIter1
>    find_end(_FIter1, _FIter1, _FIter2, _FIter2);
>
>  template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
>    _FIter1
>    find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
># 267 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _IIter1, typename _IIter2>
>    bool
>    includes(_IIter1, _IIter1, _IIter2, _IIter2);
>
>  template<typename _IIter1, typename _IIter2, typename _Compare>
>    bool
>    includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);
>
>  template<typename _BIter>
>    void
>    inplace_merge(_BIter, _BIter, _BIter);
>
>  template<typename _BIter, typename _Compare>
>    void
>    inplace_merge(_BIter, _BIter, _BIter, _Compare);
># 321 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _FIter1, typename _FIter2>
>    void
>    iter_swap(_FIter1, _FIter2);
>
>  template<typename _FIter, typename _Tp>
>    _FIter
>    lower_bound(_FIter, _FIter, const _Tp&);
>
>  template<typename _FIter, typename _Tp, typename _Compare>
>    _FIter
>    lower_bound(_FIter, _FIter, const _Tp&, _Compare);
>
>  template<typename _RAIter>
>    void
>    make_heap(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    make_heap(_RAIter, _RAIter, _Compare);
>
>  template<typename _Tp>
>    const _Tp&
>    max(const _Tp&, const _Tp&);
>
>  template<typename _Tp, typename _Compare>
>    const _Tp&
>    max(const _Tp&, const _Tp&, _Compare);
>
>
>
>
>  template<typename _Tp>
>    const _Tp&
>    min(const _Tp&, const _Tp&);
>
>  template<typename _Tp, typename _Compare>
>    const _Tp&
>    min(const _Tp&, const _Tp&, _Compare);
># 406 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _BIter>
>    bool
>    next_permutation(_BIter, _BIter);
>
>  template<typename _BIter, typename _Compare>
>    bool
>    next_permutation(_BIter, _BIter, _Compare);
># 423 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _IIter, typename _RAIter>
>    _RAIter
>    partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter);
>
>  template<typename _IIter, typename _RAIter, typename _Compare>
>    _RAIter
>    partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare);
># 444 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _RAIter>
>    void
>    pop_heap(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    pop_heap(_RAIter, _RAIter, _Compare);
>
>  template<typename _BIter>
>    bool
>    prev_permutation(_BIter, _BIter);
>
>  template<typename _BIter, typename _Compare>
>    bool
>    prev_permutation(_BIter, _BIter, _Compare);
>
>  template<typename _RAIter>
>    void
>    push_heap(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    push_heap(_RAIter, _RAIter, _Compare);
>
>
>
>  template<typename _FIter, typename _Tp>
>    _FIter
>    remove(_FIter, _FIter, const _Tp&);
>
>  template<typename _FIter, typename _Predicate>
>    _FIter
>    remove_if(_FIter, _FIter, _Predicate);
>
>  template<typename _IIter, typename _OIter, typename _Tp>
>    _OIter
>    remove_copy(_IIter, _IIter, _OIter, const _Tp&);
>
>  template<typename _IIter, typename _OIter, typename _Predicate>
>    _OIter
>    remove_copy_if(_IIter, _IIter, _OIter, _Predicate);
>
>
>
>  template<typename _IIter, typename _OIter, typename _Tp>
>    _OIter
>    replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&);
>
>  template<typename _Iter, typename _OIter, typename _Predicate, typename _Tp>
>    _OIter
>    replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&);
>
>
>
>  template<typename _BIter>
>    void
>    reverse(_BIter, _BIter);
>
>  template<typename _BIter, typename _OIter>
>    _OIter
>    reverse_copy(_BIter, _BIter, _OIter);
>
>  template<typename _FIter>
>    void
>    rotate(_FIter, _FIter, _FIter);
>
>  template<typename _FIter, typename _OIter>
>    _OIter
>    rotate_copy(_FIter, _FIter, _FIter, _OIter);
># 527 "/usr/include/c++/4.5/bits/algorithmfwd.h" 3
>  template<typename _RAIter>
>    void
>    sort_heap(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    sort_heap(_RAIter, _RAIter, _Compare);
>
>  template<typename _BIter, typename _Predicate>
>    _BIter
>    stable_partition(_BIter, _BIter, _Predicate);
>
>  template<typename _Tp>
>    void
>    swap(_Tp&, _Tp&);
>
>  template<typename _Tp, size_t _Nm>
>    void
>    swap(_Tp (&)[_Nm], _Tp (&)[_Nm]);
>
>  template<typename _FIter1, typename _FIter2>
>    _FIter2
>    swap_ranges(_FIter1, _FIter1, _FIter2);
>
>
>
>  template<typename _FIter>
>    _FIter
>    unique(_FIter, _FIter);
>
>  template<typename _FIter, typename _BinaryPredicate>
>    _FIter
>    unique(_FIter, _FIter, _BinaryPredicate);
>
>
>
>  template<typename _FIter, typename _Tp>
>    _FIter
>    upper_bound(_FIter, _FIter, const _Tp&);
>
>  template<typename _FIter, typename _Tp, typename _Compare>
>    _FIter
>    upper_bound(_FIter, _FIter, const _Tp&, _Compare);
>
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>  template<typename _FIter>
>    _FIter
>    adjacent_find(_FIter, _FIter);
>
>  template<typename _FIter, typename _BinaryPredicate>
>    _FIter
>    adjacent_find(_FIter, _FIter, _BinaryPredicate);
>
>  template<typename _IIter, typename _Tp>
>    typename iterator_traits<_IIter>::difference_type
>    count(_IIter, _IIter, const _Tp&);
>
>  template<typename _IIter, typename _Predicate>
>    typename iterator_traits<_IIter>::difference_type
>    count_if(_IIter, _IIter, _Predicate);
>
>  template<typename _IIter1, typename _IIter2>
>    bool
>    equal(_IIter1, _IIter1, _IIter2);
>
>  template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
>    bool
>    equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate);
>
>  template<typename _IIter, typename _Tp>
>    _IIter
>    find(_IIter, _IIter, const _Tp&);
>
>  template<typename _FIter1, typename _FIter2>
>    _FIter1
>    find_first_of(_FIter1, _FIter1, _FIter2, _FIter2);
>
>  template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
>    _FIter1
>    find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
>
>  template<typename _IIter, typename _Predicate>
>    _IIter
>    find_if(_IIter, _IIter, _Predicate);
>
>  template<typename _IIter, typename _Funct>
>    _Funct
>    for_each(_IIter, _IIter, _Funct);
>
>  template<typename _FIter, typename _Generator>
>    void
>    generate(_FIter, _FIter, _Generator);
>
>  template<typename _OIter, typename _Size, typename _Generator>
>    _OIter
>    generate_n(_OIter, _Size, _Generator);
>
>  template<typename _IIter1, typename _IIter2>
>    bool
>    lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2);
>
>  template<typename _IIter1, typename _IIter2, typename _Compare>
>    bool
>    lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);
>
>  template<typename _FIter>
>    _FIter
>    max_element(_FIter, _FIter);
>
>  template<typename _FIter, typename _Compare>
>    _FIter
>    max_element(_FIter, _FIter, _Compare);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter>
>    _OIter
>    merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter,
>    typename _Compare>
>    _OIter
>    merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
>
>  template<typename _FIter>
>    _FIter
>    min_element(_FIter, _FIter);
>
>  template<typename _FIter, typename _Compare>
>    _FIter
>    min_element(_FIter, _FIter, _Compare);
>
>  template<typename _IIter1, typename _IIter2>
>    pair<_IIter1, _IIter2>
>    mismatch(_IIter1, _IIter1, _IIter2);
>
>  template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
>    pair<_IIter1, _IIter2>
>    mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate);
>
>  template<typename _RAIter>
>    void
>    nth_element(_RAIter, _RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    nth_element(_RAIter, _RAIter, _RAIter, _Compare);
>
>  template<typename _RAIter>
>    void
>    partial_sort(_RAIter, _RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    partial_sort(_RAIter, _RAIter, _RAIter, _Compare);
>
>  template<typename _BIter, typename _Predicate>
>    _BIter
>    partition(_BIter, _BIter, _Predicate);
>
>  template<typename _RAIter>
>    void
>    random_shuffle(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Generator>
>    void
>    random_shuffle(_RAIter, _RAIter,
>
>
>
>     _Generator&);
>
>
>  template<typename _FIter, typename _Tp>
>    void
>    replace(_FIter, _FIter, const _Tp&, const _Tp&);
>
>  template<typename _FIter, typename _Predicate, typename _Tp>
>    void
>    replace_if(_FIter, _FIter, _Predicate, const _Tp&);
>
>  template<typename _FIter1, typename _FIter2>
>    _FIter1
>    search(_FIter1, _FIter1, _FIter2, _FIter2);
>
>  template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
>    _FIter1
>    search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
>
>  template<typename _FIter, typename _Size, typename _Tp>
>    _FIter
>    search_n(_FIter, _FIter, _Size, const _Tp&);
>
>  template<typename _FIter, typename _Size, typename _Tp,
>    typename _BinaryPredicate>
>    _FIter
>    search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter>
>    _OIter
>    set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter,
>    typename _Compare>
>    _OIter
>    set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter>
>    _OIter
>    set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter,
>    typename _Compare>
>    _OIter
>    set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter>
>    _OIter
>    set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter,
>    typename _Compare>
>    _OIter
>    set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2,
>        _OIter, _Compare);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter>
>    _OIter
>    set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter,
>    typename _Compare>
>    _OIter
>    set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
>
>  template<typename _RAIter>
>    void
>    sort(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    sort(_RAIter, _RAIter, _Compare);
>
>  template<typename _RAIter>
>    void
>    stable_sort(_RAIter, _RAIter);
>
>  template<typename _RAIter, typename _Compare>
>    void
>    stable_sort(_RAIter, _RAIter, _Compare);
>
>  template<typename _IIter, typename _OIter, typename _UnaryOperation>
>    _OIter
>    transform(_IIter, _IIter, _OIter, _UnaryOperation);
>
>  template<typename _IIter1, typename _IIter2, typename _OIter,
>    typename _BinaryOperation>
>    _OIter
>    transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation);
>
>  template<typename _IIter, typename _OIter>
>    _OIter
>    unique_copy(_IIter, _IIter, _OIter);
>
>  template<typename _IIter, typename _OIter, typename _BinaryPredicate>
>    _OIter
>    unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate);
>
>}
># 62 "/usr/include/c++/4.5/bits/stl_algo.h" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_heap.h" 1 3
># 62 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    _Distance
>    __is_heap_until(_RandomAccessIterator __first, _Distance __n)
>    {
>      _Distance __parent = 0;
>      for (_Distance __child = 1; __child < __n; ++__child)
> {
>   if (__first[__parent] < __first[__child])
>     return __child;
>   if ((__child & 1) == 0)
>     ++__parent;
> }
>      return __n;
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance,
>    typename _Compare>
>    _Distance
>    __is_heap_until(_RandomAccessIterator __first, _Distance __n,
>      _Compare __comp)
>    {
>      _Distance __parent = 0;
>      for (_Distance __child = 1; __child < __n; ++__child)
> {
>   if (__comp(__first[__parent], __first[__child]))
>     return __child;
>   if ((__child & 1) == 0)
>     ++__parent;
> }
>      return __n;
>    }
>
>
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    inline bool
>    __is_heap(_RandomAccessIterator __first, _Distance __n)
>    { return std::__is_heap_until(__first, __n) == __n; }
>
>  template<typename _RandomAccessIterator, typename _Compare,
>    typename _Distance>
>    inline bool
>    __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
>    { return std::__is_heap_until(__first, __n, __comp) == __n; }
>
>  template<typename _RandomAccessIterator>
>    inline bool
>    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    { return std::__is_heap(__first, std::distance(__first, __last)); }
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline bool
>    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
>    void
>    __push_heap(_RandomAccessIterator __first,
>  _Distance __holeIndex, _Distance __topIndex, _Tp __value)
>    {
>      _Distance __parent = (__holeIndex - 1) / 2;
>      while (__holeIndex > __topIndex && *(__first + __parent) < __value)
> {
>   *(__first + __holeIndex) = (*(__first + __parent));
>   __holeIndex = __parent;
>   __parent = (__holeIndex - 1) / 2;
> }
>      *(__first + __holeIndex) = (__value);
>    }
># 152 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>     
>      ;
>      ;
>
>      _ValueType __value = (*(__last - 1));
>      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
>         _DistanceType(0), (__value));
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Tp,
>    typename _Compare>
>    void
>    __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
>  _Distance __topIndex, _Tp __value, _Compare __comp)
>    {
>      _Distance __parent = (__holeIndex - 1) / 2;
>      while (__holeIndex > __topIndex
>      && __comp(*(__first + __parent), __value))
> {
>   *(__first + __holeIndex) = (*(__first + __parent));
>   __holeIndex = __parent;
>   __parent = (__holeIndex - 1) / 2;
> }
>      *(__first + __holeIndex) = (__value);
>    }
># 201 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>      ;
>      ;
>
>      _ValueType __value = (*(__last - 1));
>      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
>         _DistanceType(0), (__value), __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
>    void
>    __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
>    _Distance __len, _Tp __value)
>    {
>      const _Distance __topIndex = __holeIndex;
>      _Distance __secondChild = __holeIndex;
>      while (__secondChild < (__len - 1) / 2)
> {
>   __secondChild = 2 * (__secondChild + 1);
>   if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
>     __secondChild--;
>   *(__first + __holeIndex) = (*(__first + __secondChild));
>   __holeIndex = __secondChild;
> }
>      if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
> {
>   __secondChild = 2 * (__secondChild + 1);
>   *(__first + __holeIndex) = (*(__first + (__secondChild - 1)))
>                                  ;
>   __holeIndex = __secondChild - 1;
> }
>      std::__push_heap(__first, __holeIndex, __topIndex,
>         (__value));
>    }
>
>  template<typename _RandomAccessIterator>
>    inline void
>    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>        _RandomAccessIterator __result)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>      _ValueType __value = (*__result);
>      *__result = (*__first);
>      std::__adjust_heap(__first, _DistanceType(0),
>    _DistanceType(__last - __first),
>    (__value));
>    }
># 274 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      --__last;
>      std::__pop_heap(__first, __last, __last);
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance,
>    typename _Tp, typename _Compare>
>    void
>    __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
>    _Distance __len, _Tp __value, _Compare __comp)
>    {
>      const _Distance __topIndex = __holeIndex;
>      _Distance __secondChild = __holeIndex;
>      while (__secondChild < (__len - 1) / 2)
> {
>   __secondChild = 2 * (__secondChild + 1);
>   if (__comp(*(__first + __secondChild),
>       *(__first + (__secondChild - 1))))
>     __secondChild--;
>   *(__first + __holeIndex) = (*(__first + __secondChild));
>   __holeIndex = __secondChild;
> }
>      if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
> {
>   __secondChild = 2 * (__secondChild + 1);
>   *(__first + __holeIndex) = (*(__first + (__secondChild - 1)))
>                                  ;
>   __holeIndex = __secondChild - 1;
> }
>      std::__push_heap(__first, __holeIndex, __topIndex,
>         (__value), __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>        _RandomAccessIterator __result, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>      _ValueType __value = (*__result);
>      *__result = (*__first);
>      std::__adjust_heap(__first, _DistanceType(0),
>    _DistanceType(__last - __first),
>    (__value), __comp);
>    }
># 348 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    pop_heap(_RandomAccessIterator __first,
>      _RandomAccessIterator __last, _Compare __comp)
>    {
>
>     
>
>      ;
>      ;
>
>      --__last;
>      std::__pop_heap(__first, __last, __last, __comp);
>    }
># 371 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>     
>      ;
>
>      if (__last - __first < 2)
> return;
>
>      const _DistanceType __len = __last - __first;
>      _DistanceType __parent = (__len - 2) / 2;
>      while (true)
> {
>   _ValueType __value = (*(__first + __parent));
>   std::__adjust_heap(__first, __parent, __len, (__value));
>   if (__parent == 0)
>     return;
>   __parent--;
> }
>    }
># 411 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>      ;
>
>      if (__last - __first < 2)
> return;
>
>      const _DistanceType __len = __last - __first;
>      _DistanceType __parent = (__len - 2) / 2;
>      while (true)
> {
>   _ValueType __value = (*(__first + __parent));
>   std::__adjust_heap(__first, __parent, __len, (__value),
>        __comp);
>   if (__parent == 0)
>     return;
>   __parent--;
> }
>    }
># 450 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__last - __first > 1)
> {
>   --__last;
>   std::__pop_heap(__first, __last, __last);
> }
>    }
># 479 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>
>     
>
>      ;
>      ;
>
>      while (__last - __first > 1)
> {
>   --__last;
>   std::__pop_heap(__first, __last, __last, __comp);
> }
>    }
># 576 "/usr/include/c++/4.5/bits/stl_heap.h" 3
>}
># 63 "/usr/include/c++/4.5/bits/stl_algo.h" 2 3
># 1 "/usr/include/c++/4.5/bits/stl_tempbuf.h" 1 3
># 64 "/usr/include/c++/4.5/bits/stl_tempbuf.h" 3
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 83 "/usr/include/c++/4.5/bits/stl_tempbuf.h" 3
>  template<typename _Tp>
>    pair<_Tp*, ptrdiff_t>
>    get_temporary_buffer(ptrdiff_t __len)
>    {
>      const ptrdiff_t __max =
> __gnu_cxx::__numeric_traits<ptrdiff_t>::__max / sizeof(_Tp);
>      if (__len > __max)
> __len = __max;
>
>      while (__len > 0)
> {
>   _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp),
>       std::nothrow));
>   if (__tmp != 0)
>     return std::pair<_Tp*, ptrdiff_t>(__tmp, __len);
>   __len /= 2;
> }
>      return std::pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0);
>    }
># 110 "/usr/include/c++/4.5/bits/stl_tempbuf.h" 3
>  template<typename _Tp>
>    inline void
>    return_temporary_buffer(_Tp* __p)
>    { ::operator delete(__p, std::nothrow); }
>
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    class _Temporary_buffer
>    {
>
>     
>
>    public:
>      typedef _Tp value_type;
>      typedef value_type* pointer;
>      typedef pointer iterator;
>      typedef ptrdiff_t size_type;
>
>    protected:
>      size_type _M_original_len;
>      size_type _M_len;
>      pointer _M_buffer;
>
>    public:
>
>      size_type
>      size() const
>      { return _M_len; }
>
>
>      size_type
>      requested_size() const
>      { return _M_original_len; }
>
>
>      iterator
>      begin()
>      { return _M_buffer; }
>
>
>      iterator
>      end()
>      { return _M_buffer + _M_len; }
>
>
>
>
>
>      _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last);
>
>      ~_Temporary_buffer()
>      {
> std::_Destroy(_M_buffer, _M_buffer + _M_len);
> std::return_temporary_buffer(_M_buffer);
>      }
>
>    private:
>
>      _Temporary_buffer(const _Temporary_buffer&);
>
>      void
>      operator=(const _Temporary_buffer&);
>    };
>
>  template<typename _ForwardIterator, typename _Tp>
>    _Temporary_buffer<_ForwardIterator, _Tp>::
>    _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)
>    : _M_original_len(std::distance(__first, __last)),
>      _M_len(0), _M_buffer(0)
>    {
>      try
> {
>   std::pair<pointer, size_type> __p(std::get_temporary_buffer<
>         value_type>(_M_original_len));
>   _M_buffer = __p.first;
>   _M_len = __p.second;
>   if(_M_buffer)
>     std::__uninitialized_construct_range(_M_buffer, _M_buffer + _M_len,
>       *__first);
> }
>      catch(...)
> {
>   std::return_temporary_buffer(_M_buffer);
>   _M_buffer = 0;
>   _M_len = 0;
>   throw;
> }
>    }
>
>}
># 64 "/usr/include/c++/4.5/bits/stl_algo.h" 2 3
>
>
>
>
>
>
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
>
>
>  template<typename _Iterator>
>    void
>    __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c)
>    {
>
>     
>
>
>      if (*__a < *__b)
> {
>   if (*__b < *__c)
>     std::iter_swap(__a, __b);
>   else if (*__a < *__c)
>     std::iter_swap(__a, __c);
> }
>      else if (*__a < *__c)
> return;
>      else if (*__b < *__c)
> std::iter_swap(__a, __c);
>      else
> std::iter_swap(__a, __b);
>    }
>
>
>  template<typename _Iterator, typename _Compare>
>    void
>    __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c,
>   _Compare __comp)
>    {
>
>     
>
>
>
>      if (__comp(*__a, *__b))
> {
>   if (__comp(*__b, *__c))
>     std::iter_swap(__a, __b);
>   else if (__comp(*__a, *__c))
>     std::iter_swap(__a, __c);
> }
>      else if (__comp(*__a, *__c))
> return;
>      else if (__comp(*__b, *__c))
> std::iter_swap(__a, __c);
>      else
> std::iter_swap(__a, __b);
>    }
>
>
>
>
>  template<typename _InputIterator, typename _Tp>
>    inline _InputIterator
>    __find(_InputIterator __first, _InputIterator __last,
>    const _Tp& __val, input_iterator_tag)
>    {
>      while (__first != __last && !(*__first == __val))
> ++__first;
>      return __first;
>    }
>
>
>  template<typename _InputIterator, typename _Predicate>
>    inline _InputIterator
>    __find_if(_InputIterator __first, _InputIterator __last,
>       _Predicate __pred, input_iterator_tag)
>    {
>      while (__first != __last && !bool(__pred(*__first)))
> ++__first;
>      return __first;
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    _RandomAccessIterator
>    __find(_RandomAccessIterator __first, _RandomAccessIterator __last,
>    const _Tp& __val, random_access_iterator_tag)
>    {
>      typename iterator_traits<_RandomAccessIterator>::difference_type
> __trip_count = (__last - __first) >> 2;
>
>      for (; __trip_count > 0; --__trip_count)
> {
>   if (*__first == __val)
>     return __first;
>   ++__first;
>
>   if (*__first == __val)
>     return __first;
>   ++__first;
>
>   if (*__first == __val)
>     return __first;
>   ++__first;
>
>   if (*__first == __val)
>     return __first;
>   ++__first;
> }
>
>      switch (__last - __first)
> {
> case 3:
>   if (*__first == __val)
>     return __first;
>   ++__first;
> case 2:
>   if (*__first == __val)
>     return __first;
>   ++__first;
> case 1:
>   if (*__first == __val)
>     return __first;
>   ++__first;
> case 0:
> default:
>   return __last;
> }
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Predicate>
>    _RandomAccessIterator
>    __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Predicate __pred, random_access_iterator_tag)
>    {
>      typename iterator_traits<_RandomAccessIterator>::difference_type
> __trip_count = (__last - __first) >> 2;
>
>      for (; __trip_count > 0; --__trip_count)
> {
>   if (__pred(*__first))
>     return __first;
>   ++__first;
>
>   if (__pred(*__first))
>     return __first;
>   ++__first;
>
>   if (__pred(*__first))
>     return __first;
>   ++__first;
>
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> }
>
>      switch (__last - __first)
> {
> case 3:
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> case 2:
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> case 1:
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> case 0:
> default:
>   return __last;
> }
>    }
># 322 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp>
>    _ForwardIterator
>    __search_n(_ForwardIterator __first, _ForwardIterator __last,
>        _Integer __count, const _Tp& __val,
>        std::forward_iterator_tag)
>    {
>      __first = std::find(__first, __last, __val);
>      while (__first != __last)
> {
>   typename iterator_traits<_ForwardIterator>::difference_type
>     __n = __count;
>   _ForwardIterator __i = __first;
>   ++__i;
>   while (__i != __last && __n != 1 && *__i == __val)
>     {
>       ++__i;
>       --__n;
>     }
>   if (__n == 1)
>     return __first;
>   if (__i == __last)
>     return __last;
>   __first = std::find(++__i, __last, __val);
> }
>      return __last;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIter, typename _Integer, typename _Tp>
>    _RandomAccessIter
>    __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
>        _Integer __count, const _Tp& __val,
>        std::random_access_iterator_tag)
>    {
>
>      typedef typename std::iterator_traits<_RandomAccessIter>::difference_type
> _DistanceType;
>
>      _DistanceType __tailSize = __last - __first;
>      const _DistanceType __pattSize = __count;
>
>      if (__tailSize < __pattSize)
>        return __last;
>
>      const _DistanceType __skipOffset = __pattSize - 1;
>      _RandomAccessIter __lookAhead = __first + __skipOffset;
>      __tailSize -= __pattSize;
>
>      while (1)
> {
>
>
>   while (!(*__lookAhead == __val))
>     {
>       if (__tailSize < __pattSize)
>  return __last;
>       __lookAhead += __pattSize;
>       __tailSize -= __pattSize;
>     }
>   _DistanceType __remainder = __skipOffset;
>   for (_RandomAccessIter __backTrack = __lookAhead - 1;
>        *__backTrack == __val; --__backTrack)
>     {
>       if (--__remainder == 0)
>  return (__lookAhead - __skipOffset);
>     }
>   if (__remainder > __tailSize)
>     return __last;
>   __lookAhead += __remainder;
>   __tailSize -= __remainder;
> }
>    }
># 407 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp,
>           typename _BinaryPredicate>
>    _ForwardIterator
>    __search_n(_ForwardIterator __first, _ForwardIterator __last,
>        _Integer __count, const _Tp& __val,
>        _BinaryPredicate __binary_pred, std::forward_iterator_tag)
>    {
>      while (__first != __last && !bool(__binary_pred(*__first, __val)))
>        ++__first;
>
>      while (__first != __last)
> {
>   typename iterator_traits<_ForwardIterator>::difference_type
>     __n = __count;
>   _ForwardIterator __i = __first;
>   ++__i;
>   while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val)))
>     {
>       ++__i;
>       --__n;
>     }
>   if (__n == 1)
>     return __first;
>   if (__i == __last)
>     return __last;
>   __first = ++__i;
>   while (__first != __last
>   && !bool(__binary_pred(*__first, __val)))
>     ++__first;
> }
>      return __last;
>    }
>
>
>
>
>
>
>
>  template<typename _RandomAccessIter, typename _Integer, typename _Tp,
>    typename _BinaryPredicate>
>    _RandomAccessIter
>    __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
>        _Integer __count, const _Tp& __val,
>        _BinaryPredicate __binary_pred, std::random_access_iterator_tag)
>    {
>
>      typedef typename std::iterator_traits<_RandomAccessIter>::difference_type
> _DistanceType;
>
>      _DistanceType __tailSize = __last - __first;
>      const _DistanceType __pattSize = __count;
>
>      if (__tailSize < __pattSize)
>        return __last;
>
>      const _DistanceType __skipOffset = __pattSize - 1;
>      _RandomAccessIter __lookAhead = __first + __skipOffset;
>      __tailSize -= __pattSize;
>
>      while (1)
> {
>
>
>   while (!bool(__binary_pred(*__lookAhead, __val)))
>     {
>       if (__tailSize < __pattSize)
>  return __last;
>       __lookAhead += __pattSize;
>       __tailSize -= __pattSize;
>     }
>   _DistanceType __remainder = __skipOffset;
>   for (_RandomAccessIter __backTrack = __lookAhead - 1;
>        __binary_pred(*__backTrack, __val); --__backTrack)
>     {
>       if (--__remainder == 0)
>  return (__lookAhead - __skipOffset);
>     }
>   if (__remainder > __tailSize)
>     return __last;
>   __lookAhead += __remainder;
>   __tailSize -= __remainder;
> }
>    }
>
>
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    _ForwardIterator1
>    __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>        _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>        forward_iterator_tag, forward_iterator_tag)
>    {
>      if (__first2 == __last2)
> return __last1;
>      else
> {
>   _ForwardIterator1 __result = __last1;
>   while (1)
>     {
>       _ForwardIterator1 __new_result
>  = std::search(__first1, __last1, __first2, __last2);
>       if (__new_result == __last1)
>  return __result;
>       else
>  {
>    __result = __new_result;
>    __first1 = __new_result;
>    ++__first1;
>  }
>     }
> }
>    }
>
>  template<typename _ForwardIterator1, typename _ForwardIterator2,
>    typename _BinaryPredicate>
>    _ForwardIterator1
>    __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>        _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>        forward_iterator_tag, forward_iterator_tag,
>        _BinaryPredicate __comp)
>    {
>      if (__first2 == __last2)
> return __last1;
>      else
> {
>   _ForwardIterator1 __result = __last1;
>   while (1)
>     {
>       _ForwardIterator1 __new_result
>  = std::search(__first1, __last1, __first2,
>      __last2, __comp);
>       if (__new_result == __last1)
>  return __result;
>       else
>  {
>    __result = __new_result;
>    __first1 = __new_result;
>    ++__first1;
>  }
>     }
> }
>    }
>
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2>
>    _BidirectionalIterator1
>    __find_end(_BidirectionalIterator1 __first1,
>        _BidirectionalIterator1 __last1,
>        _BidirectionalIterator2 __first2,
>        _BidirectionalIterator2 __last2,
>        bidirectional_iterator_tag, bidirectional_iterator_tag)
>    {
>
>     
>
>     
>
>
>      typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1;
>      typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2;
>
>      _RevIterator1 __rlast1(__first1);
>      _RevIterator2 __rlast2(__first2);
>      _RevIterator1 __rresult = std::search(_RevIterator1(__last1),
>             __rlast1,
>             _RevIterator2(__last2),
>             __rlast2);
>
>      if (__rresult == __rlast1)
> return __last1;
>      else
> {
>   _BidirectionalIterator1 __result = __rresult.base();
>   std::advance(__result, -std::distance(__first2, __last2));
>   return __result;
> }
>    }
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _BinaryPredicate>
>    _BidirectionalIterator1
>    __find_end(_BidirectionalIterator1 __first1,
>        _BidirectionalIterator1 __last1,
>        _BidirectionalIterator2 __first2,
>        _BidirectionalIterator2 __last2,
>        bidirectional_iterator_tag, bidirectional_iterator_tag,
>        _BinaryPredicate __comp)
>    {
>
>     
>
>     
>
>
>      typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1;
>      typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2;
>
>      _RevIterator1 __rlast1(__first1);
>      _RevIterator2 __rlast2(__first2);
>      _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1,
>         _RevIterator2(__last2), __rlast2,
>         __comp);
>
>      if (__rresult == __rlast1)
> return __last1;
>      else
> {
>   _BidirectionalIterator1 __result = __rresult.base();
>   std::advance(__result, -std::distance(__first2, __last2));
>   return __result;
> }
>    }
># 645 "/usr/include/c++/4.5/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));
>    }
># 691 "/usr/include/c++/4.5/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);
>    }
># 870 "/usr/include/c++/4.5/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;
>    }
># 907 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _Predicate>
>    _OutputIterator
>    remove_copy_if(_InputIterator __first, _InputIterator __last,
>     _OutputIterator __result, _Predicate __pred)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for (; __first != __last; ++__first)
> if (!bool(__pred(*__first)))
>   {
>     *__result = *__first;
>     ++__result;
>   }
>      return __result;
>    }
># 1082 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    _ForwardIterator
>    remove(_ForwardIterator __first, _ForwardIterator __last,
>    const _Tp& __value)
>    {
>
>     
>
>     
>
>      ;
>
>      __first = std::find(__first, __last, __value);
>      if(__first == __last)
>        return __first;
>      _ForwardIterator __result = __first;
>      ++__first;
>      for(; __first != __last; ++__first)
>        if(!(*__first == __value))
>          {
>            *__result = (*__first);
>            ++__result;
>          }
>      return __result;
>    }
># 1125 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Predicate>
>    _ForwardIterator
>    remove_if(_ForwardIterator __first, _ForwardIterator __last,
>       _Predicate __pred)
>    {
>
>     
>
>     
>
>      ;
>
>      __first = std::find_if(__first, __last, __pred);
>      if(__first == __last)
>        return __first;
>      _ForwardIterator __result = __first;
>      ++__first;
>      for(; __first != __last; ++__first)
>        if(!bool(__pred(*__first)))
>          {
>            *__result = (*__first);
>            ++__result;
>          }
>      return __result;
>    }
># 1165 "/usr/include/c++/4.5/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;
>    }
># 1205 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _BinaryPredicate>
>    _ForwardIterator
>    unique(_ForwardIterator __first, _ForwardIterator __last,
>           _BinaryPredicate __binary_pred)
>    {
>
>     
>
>     
>
>
>      ;
>
>
>      __first = std::adjacent_find(__first, __last, __binary_pred);
>      if (__first == __last)
> return __last;
>
>
>      _ForwardIterator __dest = __first;
>      ++__first;
>      while (++__first != __last)
> if (!bool(__binary_pred(*__dest, *__first)))
>   *++__dest = (*__first);
>      return ++__dest;
>    }
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _OutputIterator>
>    _OutputIterator
>    __unique_copy(_ForwardIterator __first, _ForwardIterator __last,
>    _OutputIterator __result,
>    forward_iterator_tag, output_iterator_tag)
>    {
>
>      _ForwardIterator __next = __first;
>      *__result = *__first;
>      while (++__next != __last)
> if (!(*__first == *__next))
>   {
>     __first = __next;
>     *++__result = *__first;
>   }
>      return ++__result;
>    }
>
>
>
>
>
>
>  template<typename _InputIterator, typename _OutputIterator>
>    _OutputIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _OutputIterator __result,
>    input_iterator_tag, output_iterator_tag)
>    {
>
>      typename iterator_traits<_InputIterator>::value_type __value = *__first;
>      *__result = __value;
>      while (++__first != __last)
> if (!(__value == *__first))
>   {
>     __value = *__first;
>     *++__result = __value;
>   }
>      return ++__result;
>    }
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    _ForwardIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _ForwardIterator __result,
>    input_iterator_tag, forward_iterator_tag)
>    {
>
>      *__result = *__first;
>      while (++__first != __last)
> if (!(*__result == *__first))
>   *++__result = *__first;
>      return ++__result;
>    }
>
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _OutputIterator,
>    typename _BinaryPredicate>
>    _OutputIterator
>    __unique_copy(_ForwardIterator __first, _ForwardIterator __last,
>    _OutputIterator __result, _BinaryPredicate __binary_pred,
>    forward_iterator_tag, output_iterator_tag)
>    {
>
>     
>
>
>
>      _ForwardIterator __next = __first;
>      *__result = *__first;
>      while (++__next != __last)
> if (!bool(__binary_pred(*__first, *__next)))
>   {
>     __first = __next;
>     *++__result = *__first;
>   }
>      return ++__result;
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _BinaryPredicate>
>    _OutputIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _OutputIterator __result, _BinaryPredicate __binary_pred,
>    input_iterator_tag, output_iterator_tag)
>    {
>
>     
>
>
>
>      typename iterator_traits<_InputIterator>::value_type __value = *__first;
>      *__result = __value;
>      while (++__first != __last)
> if (!bool(__binary_pred(__value, *__first)))
>   {
>     __value = *__first;
>     *++__result = __value;
>   }
>      return ++__result;
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _BinaryPredicate>
>    _ForwardIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _ForwardIterator __result, _BinaryPredicate __binary_pred,
>    input_iterator_tag, forward_iterator_tag)
>    {
>
>     
>
>
>
>      *__result = *__first;
>      while (++__first != __last)
> if (!bool(__binary_pred(*__result, *__first)))
>   *++__result = *__first;
>      return ++__result;
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator>
>    void
>    __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,
>       bidirectional_iterator_tag)
>    {
>      while (true)
> if (__first == __last || __first == --__last)
>   return;
> else
>   {
>     std::iter_swap(__first, __last);
>     ++__first;
>   }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       random_access_iterator_tag)
>    {
>      if (__first == __last)
> return;
>      --__last;
>      while (__first < __last)
> {
>   std::iter_swap(__first, __last);
>   ++__first;
>   --__last;
> }
>    }
># 1433 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    inline void
>    reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
>    {
>
>     
>
>      ;
>      std::__reverse(__first, __last, std::__iterator_category(__first));
>    }
># 1460 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _OutputIterator>
>    _OutputIterator
>    reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,
>   _OutputIterator __result)
>    {
>
>     
>
>     
>
>      ;
>
>      while (__first != __last)
> {
>   --__last;
>   *__result = *__last;
>   ++__result;
> }
>      return __result;
>    }
>
>
>
>
>
>  template<typename _EuclideanRingElement>
>    _EuclideanRingElement
>    __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
>    {
>      while (__n != 0)
> {
>   _EuclideanRingElement __t = __m % __n;
>   __m = __n;
>   __n = __t;
> }
>      return __m;
>    }
>
>
>  template<typename _ForwardIterator>
>    void
>    __rotate(_ForwardIterator __first,
>      _ForwardIterator __middle,
>      _ForwardIterator __last,
>      forward_iterator_tag)
>    {
>      if (__first == __middle || __last == __middle)
> return;
>
>      _ForwardIterator __first2 = __middle;
>      do
> {
>   std::iter_swap(__first, __first2);
>   ++__first;
>   ++__first2;
>   if (__first == __middle)
>     __middle = __first2;
> }
>      while (__first2 != __last);
>
>      __first2 = __middle;
>
>      while (__first2 != __last)
> {
>   std::iter_swap(__first, __first2);
>   ++__first;
>   ++__first2;
>   if (__first == __middle)
>     __middle = __first2;
>   else if (__first2 == __last)
>     __first2 = __middle;
> }
>    }
>
>
>  template<typename _BidirectionalIterator>
>    void
>    __rotate(_BidirectionalIterator __first,
>      _BidirectionalIterator __middle,
>      _BidirectionalIterator __last,
>       bidirectional_iterator_tag)
>    {
>
>     
>
>
>      if (__first == __middle || __last == __middle)
> return;
>
>      std::__reverse(__first, __middle, bidirectional_iterator_tag());
>      std::__reverse(__middle, __last, bidirectional_iterator_tag());
>
>      while (__first != __middle && __middle != __last)
> {
>   std::iter_swap(__first, --__last);
>   ++__first;
> }
>
>      if (__first == __middle)
> std::__reverse(__middle, __last, bidirectional_iterator_tag());
>      else
> std::__reverse(__first, __middle, bidirectional_iterator_tag());
>    }
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __rotate(_RandomAccessIterator __first,
>      _RandomAccessIterator __middle,
>      _RandomAccessIterator __last,
>      random_access_iterator_tag)
>    {
>
>     
>
>
>      if (__first == __middle || __last == __middle)
> return;
>
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      _Distance __n = __last - __first;
>      _Distance __k = __middle - __first;
>
>      if (__k == __n - __k)
> {
>   std::swap_ranges(__first, __middle, __middle);
>   return;
> }
>
>      _RandomAccessIterator __p = __first;
>
>      for (;;)
> {
>   if (__k < __n - __k)
>     {
>       if (__is_pod(_ValueType) && __k == 1)
>  {
>    _ValueType __t = (*__p);
>    std::copy(__p + 1, __p + __n, __p);
>    *(__p + __n - 1) = (__t);
>    return;
>  }
>       _RandomAccessIterator __q = __p + __k;
>       for (_Distance __i = 0; __i < __n - __k; ++ __i)
>  {
>    std::iter_swap(__p, __q);
>    ++__p;
>    ++__q;
>  }
>       __n %= __k;
>       if (__n == 0)
>  return;
>       std::swap(__n, __k);
>       __k = __n - __k;
>     }
>   else
>     {
>       __k = __n - __k;
>       if (__is_pod(_ValueType) && __k == 1)
>  {
>    _ValueType __t = (*(__p + __n - 1));
>    std::copy_backward(__p, __p + __n - 1, __p + __n);
>    *__p = (__t);
>    return;
>  }
>       _RandomAccessIterator __q = __p + __n;
>       __p = __q - __k;
>       for (_Distance __i = 0; __i < __n - __k; ++ __i)
>  {
>    --__p;
>    --__q;
>    std::iter_swap(__p, __q);
>  }
>       __n %= __k;
>       if (__n == 0)
>  return;
>       std::swap(__n, __k);
>     }
> }
>    }
># 1664 "/usr/include/c++/4.5/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());
>    }
># 1698 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _OutputIterator>
>    _OutputIterator
>    rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
>                _ForwardIterator __last, _OutputIterator __result)
>    {
>
>     
>     
>
>      ;
>      ;
>
>      return std::copy(__first, __middle,
>                       std::copy(__middle, __last, __result));
>    }
>
>
>  template<typename _ForwardIterator, typename _Predicate>
>    _ForwardIterator
>    __partition(_ForwardIterator __first, _ForwardIterator __last,
>  _Predicate __pred, forward_iterator_tag)
>    {
>      if (__first == __last)
> return __first;
>
>      while (__pred(*__first))
> if (++__first == __last)
>   return __first;
>
>      _ForwardIterator __next = __first;
>
>      while (++__next != __last)
> if (__pred(*__next))
>   {
>     std::iter_swap(__first, __next);
>     ++__first;
>   }
>
>      return __first;
>    }
>
>
>  template<typename _BidirectionalIterator, typename _Predicate>
>    _BidirectionalIterator
>    __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,
>  _Predicate __pred, bidirectional_iterator_tag)
>    {
>      while (true)
> {
>   while (true)
>     if (__first == __last)
>       return __first;
>     else if (__pred(*__first))
>       ++__first;
>     else
>       break;
>   --__last;
>   while (true)
>     if (__first == __last)
>       return __first;
>     else if (!bool(__pred(*__last)))
>       --__last;
>     else
>       break;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Predicate, typename _Distance>
>    _ForwardIterator
>    __inplace_stable_partition(_ForwardIterator __first,
>          _ForwardIterator __last,
>          _Predicate __pred, _Distance __len)
>    {
>      if (__len == 1)
> return __pred(*__first) ? __last : __first;
>      _ForwardIterator __middle = __first;
>      std::advance(__middle, __len / 2);
>      _ForwardIterator __begin = std::__inplace_stable_partition(__first,
>         __middle,
>         __pred,
>         __len / 2);
>      _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last,
>              __pred,
>              __len
>              - __len / 2);
>      std::rotate(__begin, __middle, __end);
>      std::advance(__begin, std::distance(__middle, __end));
>      return __begin;
>    }
>
>
>  template<typename _ForwardIterator, typename _Pointer, typename _Predicate,
>    typename _Distance>
>    _ForwardIterator
>    __stable_partition_adaptive(_ForwardIterator __first,
>    _ForwardIterator __last,
>    _Predicate __pred, _Distance __len,
>    _Pointer __buffer,
>    _Distance __buffer_size)
>    {
>      if (__len <= __buffer_size)
> {
>   _ForwardIterator __result1 = __first;
>   _Pointer __result2 = __buffer;
>   for (; __first != __last; ++__first)
>     if (__pred(*__first))
>       {
>  *__result1 = (*__first);
>  ++__result1;
>       }
>     else
>       {
>  *__result2 = (*__first);
>  ++__result2;
>       }
>   std::copy(__buffer, __result2, __result1);
>   return __result1;
> }
>      else
> {
>   _ForwardIterator __middle = __first;
>   std::advance(__middle, __len / 2);
>   _ForwardIterator __begin =
>     std::__stable_partition_adaptive(__first, __middle, __pred,
>          __len / 2, __buffer,
>          __buffer_size);
>   _ForwardIterator __end =
>     std::__stable_partition_adaptive(__middle, __last, __pred,
>          __len - __len / 2,
>          __buffer, __buffer_size);
>   std::rotate(__begin, __middle, __end);
>   std::advance(__begin, std::distance(__middle, __end));
>   return __begin;
> }
>    }
># 1856 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Predicate>
>    _ForwardIterator
>    stable_partition(_ForwardIterator __first, _ForwardIterator __last,
>       _Predicate __pred)
>    {
>
>     
>
>     
>
>      ;
>
>      if (__first == __last)
> return __first;
>      else
> {
>   typedef typename iterator_traits<_ForwardIterator>::value_type
>     _ValueType;
>   typedef typename iterator_traits<_ForwardIterator>::difference_type
>     _DistanceType;
>
>   _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first,
>        __last);
> if (__buf.size() > 0)
>   return
>     std::__stable_partition_adaptive(__first, __last, __pred,
>       _DistanceType(__buf.requested_size()),
>       __buf.begin(),
>       _DistanceType(__buf.size()));
> else
>   return
>     std::__inplace_stable_partition(__first, __last, __pred,
>      _DistanceType(__buf.requested_size()));
> }
>    }
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __heap_select(_RandomAccessIterator __first,
>    _RandomAccessIterator __middle,
>    _RandomAccessIterator __last)
>    {
>      std::make_heap(__first, __middle);
>      for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
> if (*__i < *__first)
>   std::__pop_heap(__first, __middle, __i);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __heap_select(_RandomAccessIterator __first,
>    _RandomAccessIterator __middle,
>    _RandomAccessIterator __last, _Compare __comp)
>    {
>      std::make_heap(__first, __middle, __comp);
>      for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
> if (__comp(*__i, *__first))
>   std::__pop_heap(__first, __middle, __i, __comp);
>    }
># 1938 "/usr/include/c++/4.5/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;
>    }
># 2004 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare>
>    _RandomAccessIterator
>    partial_sort_copy(_InputIterator __first, _InputIterator __last,
>        _RandomAccessIterator __result_first,
>        _RandomAccessIterator __result_last,
>        _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _InputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _OutputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      if (__result_first == __result_last)
> return __result_last;
>      _RandomAccessIterator __result_real_last = __result_first;
>      while(__first != __last && __result_real_last != __result_last)
> {
>   *__result_real_last = *__first;
>   ++__result_real_last;
>   ++__first;
> }
>      std::make_heap(__result_first, __result_real_last, __comp);
>      while (__first != __last)
> {
>   if (__comp(*__first, *__result_first))
>     std::__adjust_heap(__result_first, _DistanceType(0),
>          _DistanceType(__result_real_last
>          - __result_first),
>          _InputValueType(*__first),
>          __comp);
>   ++__first;
> }
>      std::sort_heap(__result_first, __result_real_last, __comp);
>      return __result_real_last;
>    }
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __unguarded_linear_insert(_RandomAccessIterator __last)
>    {
>      typename iterator_traits<_RandomAccessIterator>::value_type
> __val = (*__last);
>      _RandomAccessIterator __next = __last;
>      --__next;
>      while (__val < *__next)
> {
>   *__last = (*__next);
>   __last = __next;
>   --__next;
> }
>      *__last = (__val);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __unguarded_linear_insert(_RandomAccessIterator __last,
>         _Compare __comp)
>    {
>      typename iterator_traits<_RandomAccessIterator>::value_type
> __val = (*__last);
>      _RandomAccessIterator __next = __last;
>      --__next;
>      while (__comp(__val, *__next))
> {
>   *__last = (*__next);
>   __last = __next;
>   --__next;
> }
>      *__last = (__val);
>    }
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __insertion_sort(_RandomAccessIterator __first,
>       _RandomAccessIterator __last)
>    {
>      if (__first == __last)
> return;
>
>      for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
> {
>   if (*__i < *__first)
>     {
>       typename iterator_traits<_RandomAccessIterator>::value_type
>  __val = (*__i);
>       std::copy_backward(__first, __i, __i + 1);
>       *__first = (__val);
>     }
>   else
>     std::__unguarded_linear_insert(__i);
> }
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __insertion_sort(_RandomAccessIterator __first,
>       _RandomAccessIterator __last, _Compare __comp)
>    {
>      if (__first == __last) return;
>
>      for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
> {
>   if (__comp(*__i, *__first))
>     {
>       typename iterator_traits<_RandomAccessIterator>::value_type
>  __val = (*__i);
>       std::copy_backward(__first, __i, __i + 1);
>       *__first = (__val);
>     }
>   else
>     std::__unguarded_linear_insert(__i, __comp);
> }
>    }
>
>
>  template<typename _RandomAccessIterator>
>    inline void
>    __unguarded_insertion_sort(_RandomAccessIterator __first,
>          _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
> std::__unguarded_linear_insert(__i);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    __unguarded_insertion_sort(_RandomAccessIterator __first,
>          _RandomAccessIterator __last, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
> std::__unguarded_linear_insert(__i, __comp);
>    }
>
>
>
>
>
>  enum { _S_threshold = 16 };
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __final_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last)
>    {
>      if (__last - __first > int(_S_threshold))
> {
>   std::__insertion_sort(__first, __first + int(_S_threshold));
>   std::__unguarded_insertion_sort(__first + int(_S_threshold), __last);
> }
>      else
> std::__insertion_sort(__first, __last);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __final_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last, _Compare __comp)
>    {
>      if (__last - __first > int(_S_threshold))
> {
>   std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
>   std::__unguarded_insertion_sort(__first + int(_S_threshold), __last,
>       __comp);
> }
>      else
> std::__insertion_sort(__first, __last, __comp);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    _RandomAccessIterator
>    __unguarded_partition(_RandomAccessIterator __first,
>     _RandomAccessIterator __last, const _Tp& __pivot)
>    {
>      while (true)
> {
>   while (*__first < __pivot)
>     ++__first;
>   --__last;
>   while (__pivot < *__last)
>     --__last;
>   if (!(__first < __last))
>     return __first;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
>    _RandomAccessIterator
>    __unguarded_partition(_RandomAccessIterator __first,
>     _RandomAccessIterator __last,
>     const _Tp& __pivot, _Compare __comp)
>    {
>      while (true)
> {
>   while (__comp(*__first, __pivot))
>     ++__first;
>   --__last;
>   while (__comp(__pivot, *__last))
>     --__last;
>   if (!(__first < __last))
>     return __first;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
>
>
>  template<typename _RandomAccessIterator>
>    inline _RandomAccessIterator
>    __unguarded_partition_pivot(_RandomAccessIterator __first,
>    _RandomAccessIterator __last)
>    {
>      _RandomAccessIterator __mid = __first + (__last - __first) / 2;
>      std::__move_median_first(__first, __mid, (__last - 1));
>      return std::__unguarded_partition(__first + 1, __last, *__first);
>    }
>
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline _RandomAccessIterator
>    __unguarded_partition_pivot(_RandomAccessIterator __first,
>    _RandomAccessIterator __last, _Compare __comp)
>    {
>      _RandomAccessIterator __mid = __first + (__last - __first) / 2;
>      std::__move_median_first(__first, __mid, (__last - 1), __comp);
>      return std::__unguarded_partition(__first + 1, __last, *__first, __comp);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Size>
>    void
>    __introsort_loop(_RandomAccessIterator __first,
>       _RandomAccessIterator __last,
>       _Size __depth_limit)
>    {
>      while (__last - __first > int(_S_threshold))
> {
>   if (__depth_limit == 0)
>     {
>       std::partial_sort(__first, __last, __last);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition_pivot(__first, __last);
>   std::__introsort_loop(__cut, __last, __depth_limit);
>   __last = __cut;
> }
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Size, typename _Compare>
>    void
>    __introsort_loop(_RandomAccessIterator __first,
>       _RandomAccessIterator __last,
>       _Size __depth_limit, _Compare __comp)
>    {
>      while (__last - __first > int(_S_threshold))
> {
>   if (__depth_limit == 0)
>     {
>       std::partial_sort(__first, __last, __last, __comp);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition_pivot(__first, __last, __comp);
>   std::__introsort_loop(__cut, __last, __depth_limit, __comp);
>   __last = __cut;
> }
>    }
>
>
>
>  template<typename _RandomAccessIterator, typename _Size>
>    void
>    __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
>    _RandomAccessIterator __last, _Size __depth_limit)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      while (__last - __first > 3)
> {
>   if (__depth_limit == 0)
>     {
>       std::__heap_select(__first, __nth + 1, __last);
>
>
>       std::iter_swap(__first, __nth);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition_pivot(__first, __last);
>   if (__cut <= __nth)
>     __first = __cut;
>   else
>     __last = __cut;
> }
>      std::__insertion_sort(__first, __last);
>    }
>
>  template<typename _RandomAccessIterator, typename _Size, typename _Compare>
>    void
>    __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
>    _RandomAccessIterator __last, _Size __depth_limit,
>    _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      while (__last - __first > 3)
> {
>   if (__depth_limit == 0)
>     {
>       std::__heap_select(__first, __nth + 1, __last, __comp);
>
>       std::iter_swap(__first, __nth);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition_pivot(__first, __last, __comp);
>   if (__cut <= __nth)
>     __first = __cut;
>   else
>     __last = __cut;
> }
>      std::__insertion_sort(__first, __last, __comp);
>    }
># 2388 "/usr/include/c++/4.5/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;
>    }
># 2437 "/usr/include/c++/4.5/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;
>    }
># 2488 "/usr/include/c++/4.5/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;
>    }
># 2543 "/usr/include/c++/4.5/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);
>    }
># 2605 "/usr/include/c++/4.5/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);
>    }
># 2666 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    bool
>    binary_search(_ForwardIterator __first, _ForwardIterator __last,
>                  const _Tp& __val)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>
>     
>     
>      ;
>      ;
>
>      _ForwardIterator __i = std::lower_bound(__first, __last, __val);
>      return __i != __last && !(__val < *__i);
>    }
># 2699 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    bool
>    binary_search(_ForwardIterator __first, _ForwardIterator __last,
>                  const _Tp& __val, _Compare __comp)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>
>
>     
>     
>
>     
>                    ;
>     
>                    ;
>
>      _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp);
>      return __i != __last && !bool(__comp(__val, *__i));
>    }
>
>
>
>
>  template<typename _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);
> }
>    }
>
>
>  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);
>    }
># 3059 "/usr/include/c++/4.5/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()));
>    }
># 3114 "/usr/include/c++/4.5/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 _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);
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    void
>    __chunk_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>      _Distance __chunk_size)
>    {
>      while (__last - __first >= __chunk_size)
> {
>   std::__insertion_sort(__first, __first + __chunk_size);
>   __first += __chunk_size;
> }
>      std::__insertion_sort(__first, __last);
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance,
>    typename _Compare>
>    void
>    __chunk_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>      _Distance __chunk_size, _Compare __comp)
>    {
>      while (__last - __first >= __chunk_size)
> {
>   std::__insertion_sort(__first, __first + __chunk_size, __comp);
>   __first += __chunk_size;
> }
>      std::__insertion_sort(__first, __last, __comp);
>    }
>
>  enum { _S_chunk_size = 7 };
>
>  template<typename _RandomAccessIterator, typename _Pointer>
>    void
>    __merge_sort_with_buffer(_RandomAccessIterator __first,
>        _RandomAccessIterator __last,
>                             _Pointer __buffer)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>
>      const _Distance __len = __last - __first;
>      const _Pointer __buffer_last = __buffer + __len;
>
>      _Distance __step_size = _S_chunk_size;
>      std::__chunk_insertion_sort(__first, __last, __step_size);
>
>      while (__step_size < __len)
> {
>   std::__merge_sort_loop(__first, __last, __buffer, __step_size);
>   __step_size *= 2;
>   std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size);
>   __step_size *= 2;
> }
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer, typename _Compare>
>    void
>    __merge_sort_with_buffer(_RandomAccessIterator __first,
>        _RandomAccessIterator __last,
>                             _Pointer __buffer, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>
>      const _Distance __len = __last - __first;
>      const _Pointer __buffer_last = __buffer + __len;
>
>      _Distance __step_size = _S_chunk_size;
>      std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
>
>      while (__step_size < __len)
> {
>   std::__merge_sort_loop(__first, __last, __buffer,
>     __step_size, __comp);
>   __step_size *= 2;
>   std::__merge_sort_loop(__buffer, __buffer_last, __first,
>     __step_size, __comp);
>   __step_size *= 2;
> }
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer,
>    typename _Distance>
>    void
>    __stable_sort_adaptive(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>                           _Pointer __buffer, _Distance __buffer_size)
>    {
>      const _Distance __len = (__last - __first + 1) / 2;
>      const _RandomAccessIterator __middle = __first + __len;
>      if (__len > __buffer_size)
> {
>   std::__stable_sort_adaptive(__first, __middle,
>          __buffer, __buffer_size);
>   std::__stable_sort_adaptive(__middle, __last,
>          __buffer, __buffer_size);
> }
>      else
> {
>   std::__merge_sort_with_buffer(__first, __middle, __buffer);
>   std::__merge_sort_with_buffer(__middle, __last, __buffer);
> }
>      std::__merge_adaptive(__first, __middle, __last,
>       _Distance(__middle - __first),
>       _Distance(__last - __middle),
>       __buffer, __buffer_size);
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer,
>    typename _Distance, typename _Compare>
>    void
>    __stable_sort_adaptive(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>                           _Pointer __buffer, _Distance __buffer_size,
>                           _Compare __comp)
>    {
>      const _Distance __len = (__last - __first + 1) / 2;
>      const _RandomAccessIterator __middle = __first + __len;
>      if (__len > __buffer_size)
> {
>   std::__stable_sort_adaptive(__first, __middle, __buffer,
>          __buffer_size, __comp);
>   std::__stable_sort_adaptive(__middle, __last, __buffer,
>          __buffer_size, __comp);
> }
>      else
> {
>   std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
>   std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
> }
>      std::__merge_adaptive(__first, __middle, __last,
>       _Distance(__middle - __first),
>       _Distance(__last - __middle),
>       __buffer, __buffer_size,
>       __comp);
>    }
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __inplace_stable_sort(_RandomAccessIterator __first,
>     _RandomAccessIterator __last)
>    {
>      if (__last - __first < 15)
> {
>   std::__insertion_sort(__first, __last);
>   return;
> }
>      _RandomAccessIterator __middle = __first + (__last - __first) / 2;
>      std::__inplace_stable_sort(__first, __middle);
>      std::__inplace_stable_sort(__middle, __last);
>      std::__merge_without_buffer(__first, __middle, __last,
>      __middle - __first,
>      __last - __middle);
>    }
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __inplace_stable_sort(_RandomAccessIterator __first,
>     _RandomAccessIterator __last, _Compare __comp)
>    {
>      if (__last - __first < 15)
> {
>   std::__insertion_sort(__first, __last, __comp);
>   return;
> }
>      _RandomAccessIterator __middle = __first + (__last - __first) / 2;
>      std::__inplace_stable_sort(__first, __middle, __comp);
>      std::__inplace_stable_sort(__middle, __last, __comp);
>      std::__merge_without_buffer(__first, __middle, __last,
>      __middle - __first,
>      __last - __middle,
>      __comp);
>    }
># 3412 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    bool
>    includes(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _InputIterator2 __last2)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>     
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first2 < *__first1)
>   return false;
> else if(*__first1 < *__first2)
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 3461 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _Compare>
>    bool
>    includes(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _InputIterator2 __last2,
>      _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first2, *__first1))
>   return false;
> else if(__comp(*__first1, *__first2))
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 3516 "/usr/include/c++/4.5/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;
>     }
> }
>    }
># 3573 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _Compare>
>    bool
>    next_permutation(_BidirectionalIterator __first,
>       _BidirectionalIterator __last, _Compare __comp)
>    {
>
>     
>
>     
>
>
>      ;
>
>      if (__first == __last)
> return false;
>      _BidirectionalIterator __i = __first;
>      ++__i;
>      if (__i == __last)
> return false;
>      __i = __last;
>      --__i;
>
>      for(;;)
> {
>   _BidirectionalIterator __ii = __i;
>   --__i;
>   if (__comp(*__i, *__ii))
>     {
>       _BidirectionalIterator __j = __last;
>       while (!bool(__comp(*__i, *--__j)))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 3629 "/usr/include/c++/4.5/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;
>     }
> }
>    }
># 3686 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _Compare>
>    bool
>    prev_permutation(_BidirectionalIterator __first,
>       _BidirectionalIterator __last, _Compare __comp)
>    {
>
>     
>
>     
>
>
>      ;
>
>      if (__first == __last)
> return false;
>      _BidirectionalIterator __i = __first;
>      ++__i;
>      if (__i == __last)
> return false;
>      __i = __last;
>      --__i;
>
>      for(;;)
> {
>   _BidirectionalIterator __ii = __i;
>   --__i;
>   if (__comp(*__ii, *__i))
>     {
>       _BidirectionalIterator __j = __last;
>       while (!bool(__comp(*--__j, *__i)))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 3746 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator, typename _Tp>
>    _OutputIterator
>    replace_copy(_InputIterator __first, _InputIterator __last,
>   _OutputIterator __result,
>   const _Tp& __old_value, const _Tp& __new_value)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for (; __first != __last; ++__first, ++__result)
> if (*__first == __old_value)
>   *__result = __new_value;
> else
>   *__result = *__first;
>      return __result;
>    }
># 3783 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _Predicate, typename _Tp>
>    _OutputIterator
>    replace_copy_if(_InputIterator __first, _InputIterator __last,
>      _OutputIterator __result,
>      _Predicate __pred, const _Tp& __new_value)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for (; __first != __last; ++__first, ++__result)
> if (__pred(*__first))
>   *__result = __new_value;
> else
>   *__result = *__first;
>      return __result;
>    }
># 4161 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>}
>
>namespace std __attribute__ ((__visibility__ ("default"))) {
># 4177 "/usr/include/c++/4.5/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);
>    }
># 4198 "/usr/include/c++/4.5/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));
>    }
># 4222 "/usr/include/c++/4.5/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));
>    }
># 4251 "/usr/include/c++/4.5/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;
>    }
># 4290 "/usr/include/c++/4.5/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;
>    }
># 4322 "/usr/include/c++/4.5/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;
>    }
># 4354 "/usr/include/c++/4.5/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;
>    }
># 4386 "/usr/include/c++/4.5/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;
>    }
># 4411 "/usr/include/c++/4.5/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;
>    }
># 4451 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    _ForwardIterator1
>    search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>    _ForwardIterator2 __first2, _ForwardIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>
>      if (__first1 == __last1 || __first2 == __last2)
> return __first1;
>
>
>      _ForwardIterator2 __p1(__first2);
>      if (++__p1 == __last2)
> return std::find(__first1, __last1, *__first2);
>
>
>      _ForwardIterator2 __p;
>      _ForwardIterator1 __current = __first1;
>
>      for (;;)
> {
>   __first1 = std::find(__first1, __last1, *__first2);
>   if (__first1 == __last1)
>     return __last1;
>
>   __p = __p1;
>   __current = __first1;
>   if (++__current == __last1)
>     return __last1;
>
>   while (*__current == *__p)
>     {
>       if (++__p == __last2)
>  return __first1;
>       if (++__current == __last1)
>  return __last1;
>     }
>   ++__first1;
> }
>      return __first1;
>    }
># 4522 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2,
>    typename _BinaryPredicate>
>    _ForwardIterator1
>    search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>    _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>    _BinaryPredicate __predicate)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>
>      if (__first1 == __last1 || __first2 == __last2)
> return __first1;
>
>
>      _ForwardIterator2 __p1(__first2);
>      if (++__p1 == __last2)
> {
>   while (__first1 != __last1
>   && !bool(__predicate(*__first1, *__first2)))
>     ++__first1;
>   return __first1;
> }
>
>
>      _ForwardIterator2 __p;
>      _ForwardIterator1 __current = __first1;
>
>      for (;;)
> {
>   while (__first1 != __last1
>   && !bool(__predicate(*__first1, *__first2)))
>     ++__first1;
>   if (__first1 == __last1)
>     return __last1;
>
>   __p = __p1;
>   __current = __first1;
>   if (++__current == __last1)
>     return __last1;
>
>   while (__predicate(*__current, *__p))
>     {
>       if (++__p == __last2)
>  return __first1;
>       if (++__current == __last1)
>  return __last1;
>     }
>   ++__first1;
> }
>      return __first1;
>    }
># 4596 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp>
>    _ForwardIterator
>    search_n(_ForwardIterator __first, _ForwardIterator __last,
>      _Integer __count, const _Tp& __val)
>    {
>
>     
>     
>
>      ;
>
>      if (__count <= 0)
> return __first;
>      if (__count == 1)
> return std::find(__first, __last, __val);
>      return std::__search_n(__first, __last, __count, __val,
>        std::__iterator_category(__first));
>    }
># 4632 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp,
>           typename _BinaryPredicate>
>    _ForwardIterator
>    search_n(_ForwardIterator __first, _ForwardIterator __last,
>      _Integer __count, const _Tp& __val,
>      _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>
>      ;
>
>      if (__count <= 0)
> return __first;
>      if (__count == 1)
> {
>   while (__first != __last && !bool(__binary_pred(*__first, __val)))
>     ++__first;
>   return __first;
> }
>      return std::__search_n(__first, __last, __count, __val, __binary_pred,
>        std::__iterator_category(__first));
>    }
># 4674 "/usr/include/c++/4.5/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;
>    }
># 4710 "/usr/include/c++/4.5/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;
>    }
># 4743 "/usr/include/c++/4.5/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;
>    }
># 4775 "/usr/include/c++/4.5/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;
>    }
># 4807 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Generator>
>    void
>    generate(_ForwardIterator __first, _ForwardIterator __last,
>      _Generator __gen)
>    {
>
>     
>     
>
>      ;
>
>      for (; __first != __last; ++__first)
> *__first = __gen();
>    }
># 4838 "/usr/include/c++/4.5/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;
>    }
># 4874 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    inline _OutputIterator
>    unique_copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      if (__first == __last)
> return __result;
>      return std::__unique_copy(__first, __last, __result,
>    std::__iterator_category(__first),
>    std::__iterator_category(__result));
>    }
># 4913 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _BinaryPredicate>
>    inline _OutputIterator
>    unique_copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result,
>  _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>
>      ;
>
>      if (__first == __last)
> return __result;
>      return std::__unique_copy(__first, __last, __result, __binary_pred,
>    std::__iterator_category(__first),
>    std::__iterator_category(__result));
>    }
># 4945 "/usr/include/c++/4.5/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)));
>    }
># 4973 "/usr/include/c++/4.5/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));
>    }
># 5009 "/usr/include/c++/4.5/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));
>    }
># 5043 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    partial_sort(_RandomAccessIterator __first,
>   _RandomAccessIterator __middle,
>   _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      std::__heap_select(__first, __middle, __last);
>      std::sort_heap(__first, __middle);
>    }
># 5082 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    partial_sort(_RandomAccessIterator __first,
>   _RandomAccessIterator __middle,
>   _RandomAccessIterator __last,
>   _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      std::__heap_select(__first, __middle, __last, __comp);
>      std::sort_heap(__first, __middle, __comp);
>    }
># 5120 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
>  _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      if (__first == __last || __nth == __last)
> return;
>
>      std::__introselect(__first, __nth, __last,
>    std::__lg(__last - __first) * 2);
>    }
># 5159 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
>  _RandomAccessIterator __last, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      if (__first == __last || __nth == __last)
> return;
>
>      std::__introselect(__first, __nth, __last,
>    std::__lg(__last - __first) * 2, __comp);
>    }
># 5197 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>
>      if (__first != __last)
> {
>   std::__introsort_loop(__first, __last,
>    std::__lg(__last - __first) * 2);
>   std::__final_insertion_sort(__first, __last);
> }
>    }
># 5233 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
>  _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>
>      if (__first != __last)
> {
>   std::__introsort_loop(__first, __last,
>    std::__lg(__last - __first) * 2, __comp);
>   std::__final_insertion_sort(__first, __last, __comp);
> }
>    }
># 5274 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    merge(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2, _InputIterator2 __last2,
>   _OutputIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (*__first2 < *__first1)
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 5337 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    merge(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2, _InputIterator2 __last2,
>   _OutputIterator __result, _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (__comp(*__first2, *__first1))
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 5397 "/usr/include/c++/4.5/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()));
>    }
># 5439 "/usr/include/c++/4.5/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);
>    }
># 5485 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_union(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>     
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (*__first1 < *__first2)
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   else if (*__first2 < *__first1)
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>       ++__first2;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 5552 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_union(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result, _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (__comp(*__first1, *__first2))
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   else if (__comp(*__first2, *__first1))
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>       ++__first2;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 5619 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>     
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   ++__first1;
> else if (*__first2 < *__first1)
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 5676 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result, _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   ++__first1;
> else if (__comp(*__first2, *__first1))
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 5734 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>     _InputIterator2 __first2, _InputIterator2 __last2,
>     _OutputIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>     
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (*__first2 < *__first1)
>   ++__first2;
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first1, __last1, __result);
>    }
># 5795 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>     _InputIterator2 __first2, _InputIterator2 __last2,
>     _OutputIterator __result, _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (__comp(*__first2, *__first1))
>   ++__first2;
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first1, __last1, __result);
>    }
># 5853 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>        _InputIterator2 __first2, _InputIterator2 __last2,
>        _OutputIterator __result)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>     
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (*__first2 < *__first1)
>   {
>     *__result = *__first2;
>     ++__first2;
>     ++__result;
>   }
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first2, __last2, std::copy(__first1,
>          __last1, __result));
>    }
># 5919 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>        _InputIterator2 __first2, _InputIterator2 __last2,
>        _OutputIterator __result,
>        _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_InputIterator2>::value_type
> _ValueType2;
>
>
>     
>     
>     
>
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (__comp(*__first2, *__first1))
>   {
>     *__result = *__first2;
>     ++__first2;
>     ++__result;
>   }
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first2, __last2,
>         std::copy(__first1, __last1, __result));
>    }
># 5976 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator>
>    _ForwardIterator
>    min_element(_ForwardIterator __first, _ForwardIterator __last)
>    {
>
>     
>     
>
>      ;
>
>      if (__first == __last)
> return __first;
>      _ForwardIterator __result = __first;
>      while (++__first != __last)
> if (*__first < *__result)
>   __result = __first;
>      return __result;
>    }
># 6004 "/usr/include/c++/4.5/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;
>    }
># 6032 "/usr/include/c++/4.5/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;
>    }
># 6060 "/usr/include/c++/4.5/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Compare>
>    _ForwardIterator
>    max_element(_ForwardIterator __first, _ForwardIterator __last,
>  _Compare __comp)
>    {
>
>     
>     
>
>
>      ;
>
>      if (__first == __last) return __first;
>      _ForwardIterator __result = __first;
>      while (++__first != __last)
> if (__comp(*__result, *__first))
>   __result = __first;
>      return __result;
>    }
>
>}
># 64 "/usr/include/c++/4.5/algorithm" 2 3
># 114 "src/gflags.cc" 2
># 1 "./src/gflags/gflags.h" 1
># 101 "./src/gflags/gflags.h"
>namespace google {
>
>
>typedef int32_t int32;
>typedef uint32_t uint32;
>typedef int64_t int64;
>typedef uint64_t uint64;
># 151 "./src/gflags/gflags.h"
>bool RegisterFlagValidator(const bool* flag,
>                           bool (*validate_fn)(const char*, bool));
>bool RegisterFlagValidator(const int32* flag,
>                           bool (*validate_fn)(const char*, int32));
>bool RegisterFlagValidator(const int64* flag,
>                           bool (*validate_fn)(const char*, int64));
>bool RegisterFlagValidator(const uint64* flag,
>                           bool (*validate_fn)(const char*, uint64));
>bool RegisterFlagValidator(const double* flag,
>                           bool (*validate_fn)(const char*, double));
>bool RegisterFlagValidator(const std::string* flag,
>                           bool (*validate_fn)(const char*, const std::string&));
># 176 "./src/gflags/gflags.h"
>struct CommandLineFlagInfo {
>  std::string name;
>  std::string type;
>  std::string description;
>  std::string current_value;
>  std::string default_value;
>  std::string filename;
>  bool has_validator_fn;
>  bool is_default;
>
>
>};
>
>
>
>
>
>
>extern void GetAllFlags(std::vector<CommandLineFlagInfo>* OUTPUT);
>
>extern void ShowUsageWithFlags(const char *argv0);
>extern void ShowUsageWithFlagsRestrict(const char *argv0, const char *restrict);
>
>
>
>extern std::string DescribeOneFlag(const CommandLineFlagInfo& flag);
>
>
>extern void SetArgv(int argc, const char** argv);
>
>
>extern const std::vector<std::string>& GetArgvs();
>extern const char* GetArgv();
>extern const char* GetArgv0();
>extern uint32 GetArgvSum();
>extern const char* ProgramInvocationName();
>extern const char* ProgramInvocationShortName();
>
>
>extern const char* ProgramUsage();
># 228 "./src/gflags/gflags.h"
>extern bool GetCommandLineOption(const char* name, std::string* OUTPUT);
>
>
>
>extern bool GetCommandLineFlagInfo(const char* name,
>                                   CommandLineFlagInfo* OUTPUT);
>
>
>
>
>extern CommandLineFlagInfo GetCommandLineFlagInfoOrDie(const char* name);
>
>enum FlagSettingMode {
>
>  SET_FLAGS_VALUE,
>
>
>  SET_FLAG_IF_DEFAULT,
>
>
>
>  SET_FLAGS_DEFAULT
>};
># 260 "./src/gflags/gflags.h"
>extern std::string SetCommandLineOption(const char* name, const char* value);
>extern std::string SetCommandLineOptionWithMode(const char* name, const char* value,
>                                                FlagSettingMode set_mode);
># 290 "./src/gflags/gflags.h"
>class FlagSaver {
> public:
>  FlagSaver();
>  ~FlagSaver();
>
> private:
>  class FlagSaverImpl* impl_;
>
>  FlagSaver(const FlagSaver&);
>  void operator=(const FlagSaver&);
>} __attribute__ ((unused));
>
>
>
>
>
>extern std::string CommandlineFlagsIntoString();
>
>extern bool ReadFlagsFromString(const std::string& flagfilecontents,
>                                const char* prog_name,
>                                bool errors_are_fatal);
>
>
>
>extern bool AppendFlagsIntoFile(const std::string& filename, const char* prog_name);
>extern bool SaveCommandFlags();
>extern bool ReadFromFlagsFile(const std::string& filename, const char* prog_name,
>                              bool errors_are_fatal);
># 328 "./src/gflags/gflags.h"
>extern bool BoolFromEnv(const char *varname, bool defval);
>extern int32 Int32FromEnv(const char *varname, int32 defval);
>extern int64 Int64FromEnv(const char *varname, int64 defval);
>extern uint64 Uint64FromEnv(const char *varname, uint64 defval);
>extern double DoubleFromEnv(const char *varname, double defval);
>extern const char *StringFromEnv(const char *varname, const char *defval);
># 345 "./src/gflags/gflags.h"
>extern void SetUsageMessage(const std::string& usage);
># 354 "./src/gflags/gflags.h"
>extern uint32 ParseCommandLineFlags(int *argc, char*** argv,
>                                    bool remove_flags);
># 369 "./src/gflags/gflags.h"
>extern uint32 ParseCommandLineNonHelpFlags(int *argc, char*** argv,
>                                           bool remove_flags);
>
>
>
>extern void HandleCommandLineHelpFlags();
>
>
>
>
>
>extern void AllowCommandLineReparsing();
># 390 "./src/gflags/gflags.h"
>extern uint32 ReparseCommandLineNonHelpFlags();
># 400 "./src/gflags/gflags.h"
>extern void ShutDownCommandLineFlags();
># 440 "./src/gflags/gflags.h"
>class FlagRegisterer {
> public:
>  FlagRegisterer(const char* name, const char* type,
>                 const char* help, const char* filename,
>                 void* current_storage, void* defvalue_storage);
>};
>
>extern bool FlagsTypeWarn(const char *name);
>
>
>
>
>
>
>extern const char kStrippedFlagHelp[];
>
>}
># 503 "./src/gflags/gflags.h"
>namespace fLB {
>struct CompileAssert {};
>typedef CompileAssert expected_sizeof_double_neq_sizeof_bool[
>                      (sizeof(double) != sizeof(bool)) ? 1 : -1];
>template<typename From> double IsBoolFlag(const From& from);
>bool IsBoolFlag(bool from);
>}
># 538 "./src/gflags/gflags.h"
>namespace fLS {
>
>
>
>
>typedef std::string clstring;
>
>inline clstring* dont_pass0toDEFINE_string(char *stringspot,
>                                           const char *value) {
>  return new(stringspot) clstring(value);
>}
>inline clstring* dont_pass0toDEFINE_string(char *stringspot,
>                                           const clstring &value) {
>  return new(stringspot) clstring(value);
>}
>inline clstring* dont_pass0toDEFINE_string(char *stringspot,
>                                           int value);
>}
># 115 "src/gflags.cc" 2
># 1 "src/mutex.h" 1
># 115 "src/mutex.h"
># 1 "src/config.h" 1
># 116 "src/mutex.h" 2
># 143 "src/mutex.h"
>  typedef pthread_mutex_t MutexType;
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 149 "src/mutex.h" 2
>
>
>
>
>namespace gflags_mutex_namespace {
>
>class Mutex {
> public:
>
>  enum LinkerInitialized { LINKER_INITIALIZED };
>
>
>
>  inline Mutex();
>
>
>
>
>  inline Mutex(LinkerInitialized);
>
>
>  inline ~Mutex();
>
>  inline void Lock();
>  inline void Unlock();
>
>
>
>
>
>
>
>  inline void ReaderLock();
>  inline void ReaderUnlock();
>  inline void WriterLock() { Lock(); }
>  inline void WriterUnlock() { Unlock(); }
>
> private:
>  MutexType mutex_;
>
>
>
>  volatile bool is_safe_;
>
>  bool destroy_;
>
>  inline void SetIsSafe() { is_safe_ = true; }
>
>
>  Mutex(Mutex* ) {}
>
>  Mutex(const Mutex&);
>  void operator=(const Mutex&);
>};
># 279 "src/mutex.h"
>Mutex::Mutex() : destroy_(true) {
>  SetIsSafe();
>  if (is_safe_ && pthread_mutex_init(&mutex_, __null) != 0) abort();
>}
>Mutex::Mutex(Mutex::LinkerInitialized) : destroy_(false) {
>  SetIsSafe();
>  if (is_safe_ && pthread_mutex_init(&mutex_, __null) != 0) abort();
>}
>Mutex::~Mutex() { if (destroy_) do { if (is_safe_ && pthread_mutex_destroy(&mutex_) != 0) abort(); } while (0); }
>void Mutex::Lock() { do { if (is_safe_ && pthread_mutex_lock(&mutex_) != 0) abort(); } while (0); }
>void Mutex::Unlock() { do { if (is_safe_ && pthread_mutex_unlock(&mutex_) != 0) abort(); } while (0); }
>
>
>
>
>void Mutex::ReaderLock() { Lock(); }
>void Mutex::ReaderUnlock() { Unlock(); }
># 304 "src/mutex.h"
>class MutexLock {
> public:
>  explicit MutexLock(Mutex *mu) : mu_(mu) { mu_->Lock(); }
>  ~MutexLock() { mu_->Unlock(); }
> private:
>  Mutex * const mu_;
>
>  MutexLock(const MutexLock&);
>  void operator=(const MutexLock&);
>};
>
>
>class ReaderMutexLock {
> public:
>  explicit ReaderMutexLock(Mutex *mu) : mu_(mu) { mu_->ReaderLock(); }
>  ~ReaderMutexLock() { mu_->ReaderUnlock(); }
> private:
>  Mutex * const mu_;
>
>  ReaderMutexLock(const ReaderMutexLock&);
>  void operator=(const ReaderMutexLock&);
>};
>
>class WriterMutexLock {
> public:
>  explicit WriterMutexLock(Mutex *mu) : mu_(mu) { mu_->WriterLock(); }
>  ~WriterMutexLock() { mu_->WriterUnlock(); }
> private:
>  Mutex * const mu_;
>
>  WriterMutexLock(const WriterMutexLock&);
>  void operator=(const WriterMutexLock&);
>};
>
>
>
>
>
>
>}
>
>using namespace gflags_mutex_namespace;
># 116 "src/gflags.cc" 2
># 146 "src/gflags.cc"
>typedef signed char int8;
>typedef unsigned char uint8;
>
>
>namespace fLS { using ::fLS::clstring; static union { void* align; char s[sizeof(clstring)]; }
> s_flagfile
># 150 "src/gflags.cc"
> [2]; clstring* const
> FLAGS_noflagfile
># 150 "src/gflags.cc"
> = ::fLS:: dont_pass0toDEFINE_string(
> s_flagfile
># 150 "src/gflags.cc"
> [0].s, ""); static ::google::FlagRegisterer
> o_flagfile
># 150 "src/gflags.cc"
> ( "flagfile", "string", "load flags from file",
> "src/gflags.cc"
># 150 "src/gflags.cc"
> ,
> s_flagfile
># 150 "src/gflags.cc"
> [0].s, new (
> s_flagfile
># 150 "src/gflags.cc"
> [1].s) clstring(*
> FLAGS_noflagfile
># 150 "src/gflags.cc"
> )); extern clstring&
> FLAGS_flagfile
># 150 "src/gflags.cc"
> ; using fLS::
> FLAGS_flagfile
># 150 "src/gflags.cc"
> ; clstring&
> FLAGS_flagfile
># 150 "src/gflags.cc"
> = *
> FLAGS_noflagfile
># 150 "src/gflags.cc"
> ; } using fLS::
> FLAGS_flagfile;
>namespace fLS { using ::fLS::clstring; static union { void* align; char s[sizeof(clstring)]; }
>
> s_fromenv
># 152 "src/gflags.cc"
> [2]; clstring* const
>
> FLAGS_nofromenv
># 152 "src/gflags.cc"
> = ::fLS:: dont_pass0toDEFINE_string(
>
> s_fromenv
># 152 "src/gflags.cc"
> [0].s, ""); static ::google::FlagRegisterer
>
> o_fromenv
># 152 "src/gflags.cc"
> ( "fromenv", "string", "set flags from the environment" " [use 'export FLAGS_flag1=value']",
>
> "src/gflags.cc"
># 152 "src/gflags.cc"
> ,
>
> s_fromenv
># 152 "src/gflags.cc"
> [0].s, new (
>
> s_fromenv
># 152 "src/gflags.cc"
> [1].s) clstring(*
>
> FLAGS_nofromenv
># 152 "src/gflags.cc"
> )); extern clstring&
>
> FLAGS_fromenv
># 152 "src/gflags.cc"
> ; using fLS::
>
> FLAGS_fromenv
># 152 "src/gflags.cc"
> ; clstring&
>
> FLAGS_fromenv
># 152 "src/gflags.cc"
> = *
>
> FLAGS_nofromenv
># 152 "src/gflags.cc"
> ; } using fLS::
>
> FLAGS_fromenv;
>namespace fLS { using ::fLS::clstring; static union { void* align; char s[sizeof(clstring)]; }
> s_tryfromenv
># 155 "src/gflags.cc"
> [2]; clstring* const
> FLAGS_notryfromenv
># 155 "src/gflags.cc"
> = ::fLS:: dont_pass0toDEFINE_string(
> s_tryfromenv
># 155 "src/gflags.cc"
> [0].s, ""); static ::google::FlagRegisterer
> o_tryfromenv
># 155 "src/gflags.cc"
> ( "tryfromenv", "string", "set flags from the environment if present",
> "src/gflags.cc"
># 155 "src/gflags.cc"
> ,
> s_tryfromenv
># 155 "src/gflags.cc"
> [0].s, new (
> s_tryfromenv
># 155 "src/gflags.cc"
> [1].s) clstring(*
> FLAGS_notryfromenv
># 155 "src/gflags.cc"
> )); extern clstring&
> FLAGS_tryfromenv
># 155 "src/gflags.cc"
> ; using fLS::
> FLAGS_tryfromenv
># 155 "src/gflags.cc"
> ; clstring&
> FLAGS_tryfromenv
># 155 "src/gflags.cc"
> = *
> FLAGS_notryfromenv
># 155 "src/gflags.cc"
> ; } using fLS::
> FLAGS_tryfromenv;
>
>
>namespace fLS { using ::fLS::clstring; static union { void* align; char s[sizeof(clstring)]; }
>
>
>
> s_undefok
># 159 "src/gflags.cc"
> [2]; clstring* const
>
>
>
> FLAGS_noundefok
># 159 "src/gflags.cc"
> = ::fLS:: dont_pass0toDEFINE_string(
>
>
>
> s_undefok
># 159 "src/gflags.cc"
> [0].s, ""); static ::google::FlagRegisterer
>
>
>
> o_undefok
># 159 "src/gflags.cc"
> ( "undefok", "string", "comma-separated list of flag names that it is okay to specify " "on the command line even if the program does not define a flag " "with that name.  IMPORTANT: flags in this list that have " "arguments MUST use the flag=value format",
>
>
>
> "src/gflags.cc"
># 159 "src/gflags.cc"
> ,
>
>
>
> s_undefok
># 159 "src/gflags.cc"
> [0].s, new (
>
>
>
> s_undefok
># 159 "src/gflags.cc"
> [1].s) clstring(*
>
>
>
> FLAGS_noundefok
># 159 "src/gflags.cc"
> )); extern clstring&
>
>
>
> FLAGS_undefok
># 159 "src/gflags.cc"
> ; using fLS::
>
>
>
> FLAGS_undefok
># 159 "src/gflags.cc"
> ; clstring&
>
>
>
> FLAGS_undefok
># 159 "src/gflags.cc"
> = *
>
>
>
> FLAGS_noundefok
># 159 "src/gflags.cc"
> ; } using fLS::
>
>
>
> FLAGS_undefok;
>
>namespace google {
>
>using std::map;
>using std::pair;
>using std::sort;
>using std::string;
>using std::vector;
>
>
>
>
>
>
>
>const char kStrippedFlagHelp[] = "\001\002\003\004 (unknown) \004\003\002\001";
>
>
>void (*commandlineflags_exitfunc)(int) = &exit;
>
>namespace {
>
>
>
>static const char kError[] = "ERROR: ";
>
>
>
>static bool allow_command_line_reparsing = false;
>
>static bool logging_is_probably_set_up = false;
>
>
>
>
>
>
>typedef bool (*ValidateFnProto)();
>
>
>enum DieWhenReporting { DIE, DO_NOT_DIE };
>
>
>static void ReportError(DieWhenReporting should_die, const char* format, ...) {
>  va_list ap;
>  __builtin_va_start(ap,format);
>  vfprintf(stderr, format, ap);
>  __builtin_va_end(ap);
>  if (should_die == DIE)
>    commandlineflags_exitfunc(1);
>}
># 224 "src/gflags.cc"
>class CommandLineFlag;
>class FlagValue {
> public:
>  FlagValue(void* valbuf, const char* type, bool transfer_ownership_of_value);
>  ~FlagValue();
>
>  bool ParseFrom(const char* spec);
>  string ToString() const;
>
> private:
>  friend class CommandLineFlag;
>  friend class ::google::FlagSaverImpl;
>  friend class FlagRegistry;
>  template <typename T> friend T GetFromEnv(const char*, const char*, T);
>  friend bool TryParseLocked(const CommandLineFlag*, FlagValue*,
>                             const char*, string*);
>
>  enum ValueType {
>    FV_BOOL = 0,
>    FV_INT32 = 1,
>    FV_INT64 = 2,
>    FV_UINT64 = 3,
>    FV_DOUBLE = 4,
>    FV_STRING = 5,
>    FV_MAX_INDEX = 5,
>  };
>  const char* TypeName() const;
>  bool Equal(const FlagValue& x) const;
>  FlagValue* New() const;
>  void CopyFrom(const FlagValue& x);
>  int ValueSize() const;
>
>
>
>
>
>  bool Validate(const char* flagname, ValidateFnProto validate_fn_proto) const;
>
>  void* value_buffer_;
>  int8 type_;
>  bool owns_value_;
>
>  FlagValue(const FlagValue&);
>  void operator=(const FlagValue&);
>};
># 277 "src/gflags.cc"
>FlagValue::FlagValue(void* valbuf, const char* type,
>                     bool transfer_ownership_of_value)
>    : value_buffer_(valbuf),
>      owns_value_(transfer_ownership_of_value) {
>  for (type_ = 0; type_ <= FV_MAX_INDEX; ++type_) {
>    if (!strcmp(type, TypeName())) {
>      break;
>    }
>  }
>  (static_cast<void> (0));
>}
>
>FlagValue::~FlagValue() {
>  if (!owns_value_) {
>    return;
>  }
>  switch (type_) {
>    case FV_BOOL: delete reinterpret_cast<bool*>(value_buffer_); break;
>    case FV_INT32: delete reinterpret_cast<int32*>(value_buffer_); break;
>    case FV_INT64: delete reinterpret_cast<int64*>(value_buffer_); break;
>    case FV_UINT64: delete reinterpret_cast<uint64*>(value_buffer_); break;
>    case FV_DOUBLE: delete reinterpret_cast<double*>(value_buffer_); break;
>    case FV_STRING: delete reinterpret_cast<string*>(value_buffer_); break;
>  }
>}
>
>bool FlagValue::ParseFrom(const char* value) {
>  if (type_ == FV_BOOL) {
>    const char* kTrue[] = { "1", "t", "true", "y", "yes" };
>    const char* kFalse[] = { "0", "f", "false", "n", "no" };
>    for (size_t i = 0; i < sizeof(kTrue)/sizeof(*kTrue); ++i) {
>      if (strcasecmp(value, kTrue[i]) == 0) {
>        *reinterpret_cast<bool*>(value_buffer_) = (true);
>        return true;
>      } else if (strcasecmp(value, kFalse[i]) == 0) {
>        *reinterpret_cast<bool*>(value_buffer_) = (false);
>        return true;
>      }
>    }
>    return false;
>
>  } else if (type_ == FV_STRING) {
>    *reinterpret_cast<string*>(value_buffer_) = (value);
>    return true;
>  }
>
>
>  if (value[0] == '\0')
>    return false;
>  char* end;
>
>
>  int base = 10;
>  if (value[0] == '0' && (value[1] == 'x' || value[1] == 'X'))
>    base = 16;
>  (*__errno_location ()) = 0;
>
>  switch (type_) {
>    case FV_INT32: {
>      const int64 r = strtoll(value, &end, base);
>      if ((*__errno_location ()) || end != value + strlen(value)) return false;
>      if (static_cast<int32>(r) != r)
>        return false;
>      *reinterpret_cast<int32*>(value_buffer_) = (static_cast<int32>(r));
>      return true;
>    }
>    case FV_INT64: {
>      const int64 r = strtoll(value, &end, base);
>      if ((*__errno_location ()) || end != value + strlen(value)) return false;
>      *reinterpret_cast<int64*>(value_buffer_) = (r);
>      return true;
>    }
>    case FV_UINT64: {
>      while (*value == ' ') value++;
>      if (*value == '-') return false;
>      const uint64 r = strtoull(value, &end, base);
>      if ((*__errno_location ()) || end != value + strlen(value)) return false;
>      *reinterpret_cast<uint64*>(value_buffer_) = (r);
>      return true;
>    }
>    case FV_DOUBLE: {
>      const double r = strtod(value, &end);
>      if ((*__errno_location ()) || end != value + strlen(value)) return false;
>      *reinterpret_cast<double*>(value_buffer_) = (r);
>      return true;
>    }
>    default: {
>      (static_cast<void> (0));
>      return false;
>    }
>  }
>}
>
>string FlagValue::ToString() const {
>  char intbuf[64];
>  switch (type_) {
>    case FV_BOOL:
>      return *reinterpret_cast<bool*>(value_buffer_) ? "true" : "false";
>    case FV_INT32:
>      snprintf(intbuf, sizeof(intbuf), "%""d", *reinterpret_cast<int32*>(value_buffer_));
>      return intbuf;
>    case FV_INT64:
>      snprintf(intbuf, sizeof(intbuf), "%""l" "d", *reinterpret_cast<int64*>(value_buffer_));
>      return intbuf;
>    case FV_UINT64:
>      snprintf(intbuf, sizeof(intbuf), "%""l" "u", *reinterpret_cast<uint64*>(value_buffer_));
>      return intbuf;
>    case FV_DOUBLE:
>      snprintf(intbuf, sizeof(intbuf), "%.17g", *reinterpret_cast<double*>(value_buffer_));
>      return intbuf;
>    case FV_STRING:
>      return *reinterpret_cast<string*>(value_buffer_);
>    default:
>      (static_cast<void> (0));
>      return "";
>  }
>}
>
>bool FlagValue::Validate(const char* flagname,
>                         ValidateFnProto validate_fn_proto) const {
>  switch (type_) {
>    case FV_BOOL:
>      return reinterpret_cast<bool (*)(const char*, bool)>(
>          validate_fn_proto)(flagname, *reinterpret_cast<bool*>(value_buffer_));
>    case FV_INT32:
>      return reinterpret_cast<bool (*)(const char*, int32)>(
>          validate_fn_proto)(flagname, *reinterpret_cast<int32*>(value_buffer_));
>    case FV_INT64:
>      return reinterpret_cast<bool (*)(const char*, int64)>(
>          validate_fn_proto)(flagname, *reinterpret_cast<int64*>(value_buffer_));
>    case FV_UINT64:
>      return reinterpret_cast<bool (*)(const char*, uint64)>(
>          validate_fn_proto)(flagname, *reinterpret_cast<uint64*>(value_buffer_));
>    case FV_DOUBLE:
>      return reinterpret_cast<bool (*)(const char*, double)>(
>          validate_fn_proto)(flagname, *reinterpret_cast<double*>(value_buffer_));
>    case FV_STRING:
>      return reinterpret_cast<bool (*)(const char*, const string&)>(
>          validate_fn_proto)(flagname, *reinterpret_cast<string*>(value_buffer_));
>    default:
>      (static_cast<void> (0));
>      return false;
>  }
>}
>
>const char* FlagValue::TypeName() const {
>  static const char types[] =
>      "bool\0xx"
>      "int32\0x"
>      "int64\0x"
>      "uint64\0"
>      "double\0"
>      "string";
>  if (type_ > FV_MAX_INDEX) {
>    (static_cast<void> (0));
>    return "";
>  }
>
>
>  return &types[type_ * 7];
>}
>
>bool FlagValue::Equal(const FlagValue& x) const {
>  if (type_ != x.type_)
>    return false;
>  switch (type_) {
>    case FV_BOOL: return *reinterpret_cast<bool*>(value_buffer_) == *reinterpret_cast<bool*>(x.value_buffer_);
>    case FV_INT32: return *reinterpret_cast<int32*>(value_buffer_) == *reinterpret_cast<int32*>(x.value_buffer_);
>    case FV_INT64: return *reinterpret_cast<int64*>(value_buffer_) == *reinterpret_cast<int64*>(x.value_buffer_);
>    case FV_UINT64: return *reinterpret_cast<uint64*>(value_buffer_) == *reinterpret_cast<uint64*>(x.value_buffer_);
>    case FV_DOUBLE: return *reinterpret_cast<double*>(value_buffer_) == *reinterpret_cast<double*>(x.value_buffer_);
>    case FV_STRING: return *reinterpret_cast<string*>(value_buffer_) == *reinterpret_cast<string*>(x.value_buffer_);
>    default: (static_cast<void> (0)); return false;
>  }
>}
>
>FlagValue* FlagValue::New() const {
>  const char *type = TypeName();
>  switch (type_) {
>    case FV_BOOL: return new FlagValue(new bool(false), type, true);
>    case FV_INT32: return new FlagValue(new int32(0), type, true);
>    case FV_INT64: return new FlagValue(new int64(0), type, true);
>    case FV_UINT64: return new FlagValue(new uint64(0), type, true);
>    case FV_DOUBLE: return new FlagValue(new double(0.0), type, true);
>    case FV_STRING: return new FlagValue(new string, type, true);
>    default: (static_cast<void> (0)); return __null;
>  }
>}
>
>void FlagValue::CopyFrom(const FlagValue& x) {
>  (static_cast<void> (0));
>  switch (type_) {
>    case FV_BOOL: *reinterpret_cast<bool*>(value_buffer_) = (*reinterpret_cast<bool*>(x.value_buffer_)); break;
>    case FV_INT32: *reinterpret_cast<int32*>(value_buffer_) = (*reinterpret_cast<int32*>(x.value_buffer_)); break;
>    case FV_INT64: *reinterpret_cast<int64*>(value_buffer_) = (*reinterpret_cast<int64*>(x.value_buffer_)); break;
>    case FV_UINT64: *reinterpret_cast<uint64*>(value_buffer_) = (*reinterpret_cast<uint64*>(x.value_buffer_)); break;
>    case FV_DOUBLE: *reinterpret_cast<double*>(value_buffer_) = (*reinterpret_cast<double*>(x.value_buffer_)); break;
>    case FV_STRING: *reinterpret_cast<string*>(value_buffer_) = (*reinterpret_cast<string*>(x.value_buffer_)); break;
>    default: (static_cast<void> (0));
>  }
>}
>
>int FlagValue::ValueSize() const {
>  if (type_ > FV_MAX_INDEX) {
>    (static_cast<void> (0));
>    return 0;
>  }
>  static const uint8 valuesize[] = {
>    sizeof(bool),
>    sizeof(int32),
>    sizeof(int64),
>    sizeof(uint64),
>    sizeof(double),
>    sizeof(string),
>  };
>  return valuesize[type_];
>}
># 506 "src/gflags.cc"
>class CommandLineFlag {
> public:
>
>  CommandLineFlag(const char* name, const char* help, const char* filename,
>                  FlagValue* current_val, FlagValue* default_val);
>  ~CommandLineFlag();
>
>  const char* name() const { return name_; }
>  const char* help() const { return help_; }
>  const char* filename() const { return file_; }
>  const char* CleanFileName() const;
>  string current_value() const { return current_->ToString(); }
>  string default_value() const { return defvalue_->ToString(); }
>  const char* type_name() const { return defvalue_->TypeName(); }
>  ValidateFnProto validate_function() const { return validate_fn_proto_; }
>
>  void FillCommandLineFlagInfo(struct CommandLineFlagInfo* result);
>
>
>  bool Validate(const FlagValue& value) const;
>  bool ValidateCurrent() const { return Validate(*current_); }
>
> private:
>
>  friend class FlagRegistry;
>  friend class ::google::FlagSaverImpl;
>
>  friend bool AddFlagValidator(const void*, ValidateFnProto);
>
>
>  void CopyFrom(const CommandLineFlag& src);
>
>  void UpdateModifiedBit();
>
>  const char* const name_;
>  const char* const help_;
>  const char* const file_;
>  bool modified_;
>  FlagValue* defvalue_;
>  FlagValue* current_;
>
>
>
>
>  ValidateFnProto validate_fn_proto_;
>
>  CommandLineFlag(const CommandLineFlag&);
>  void operator=(const CommandLineFlag&);
>};
>
>CommandLineFlag::CommandLineFlag(const char* name, const char* help,
>                                 const char* filename,
>                                 FlagValue* current_val, FlagValue* default_val)
>    : name_(name), help_(help), file_(filename), modified_(false),
>      defvalue_(default_val), current_(current_val), validate_fn_proto_(__null) {
>}
>
>CommandLineFlag::~CommandLineFlag() {
>  delete current_;
>  delete defvalue_;
>}
>
>const char* CommandLineFlag::CleanFileName() const {
>
>
>
>  static const char kRootDir[] = "";
>
>
>  if (sizeof(kRootDir)-1 == 0)
>    return filename();
>
>  const char* clean_name = filename() + strlen(filename()) - 1;
>  while ( clean_name > filename() ) {
>    if (*clean_name == '/') {
>      if (strncmp(clean_name, kRootDir, sizeof(kRootDir)-1) == 0) {
>
>        clean_name += sizeof(kRootDir)-1;
>        break;
>      }
>    }
>    --clean_name;
>  }
>  while ( *clean_name == '/' ) ++clean_name;
>  return clean_name;
>}
>
>void CommandLineFlag::FillCommandLineFlagInfo(
>    CommandLineFlagInfo* result) {
>  result->name = name();
>  result->type = type_name();
>  result->description = help();
>  result->current_value = current_value();
>  result->default_value = default_value();
>  result->filename = CleanFileName();
>  UpdateModifiedBit();
>  result->is_default = !modified_;
>  result->has_validator_fn = validate_function() != __null;
>}
>
>void CommandLineFlag::UpdateModifiedBit() {
>
>
>  if (!modified_ && !current_->Equal(*defvalue_)) {
>    modified_ = true;
>  }
>}
>
>void CommandLineFlag::CopyFrom(const CommandLineFlag& src) {
>
>  if (modified_ != src.modified_) modified_ = src.modified_;
>  if (!current_->Equal(*src.current_)) current_->CopyFrom(*src.current_);
>  if (!defvalue_->Equal(*src.defvalue_)) defvalue_->CopyFrom(*src.defvalue_);
>  if (validate_fn_proto_ != src.validate_fn_proto_)
>    validate_fn_proto_ = src.validate_fn_proto_;
>}
>
>bool CommandLineFlag::Validate(const FlagValue& value) const {
>  if (validate_function() == __null)
>    return true;
>  else
>    return value.Validate(name(), validate_function());
>}
># 641 "src/gflags.cc"
>struct StringCmp {
>  bool operator() (const char* s1, const char* s2) const {
>    return (strcmp(s1, s2) < 0);
>  }
>};
>
>class FlagRegistry {
> public:
>  FlagRegistry() { }
>  ~FlagRegistry() {
>    for (FlagMap::iterator p = flags_.begin(), e = flags_.end(); p != e; ++p) {
>      CommandLineFlag* flag = p->second;
>      delete flag;
>    }
>  }
>
>  static void DeleteGlobalRegistry() {
>    delete global_registry_;
>    global_registry_ = __null;
>  }
>
>  void Lock() { lock_.Lock(); }
>  void Unlock() { lock_.Unlock(); }
>
>
>  void RegisterFlag(CommandLineFlag* flag);
>
>
>  CommandLineFlag* FindFlagLocked(const char* name);
>
>
>
>  CommandLineFlag* FindFlagViaPtrLocked(const void* flag_ptr);
>
>
>
>
>
>
>  CommandLineFlag* SplitArgumentLocked(const char* argument,
>                                       string* key, const char** v,
>                                       string* error_message);
>
>
>
>
>
>  bool SetFlagLocked(CommandLineFlag* flag, const char* value,
>                     FlagSettingMode set_mode, string* msg);
>
>  static FlagRegistry* GlobalRegistry();
>
> private:
>  friend class ::google::FlagSaverImpl;
>  friend class CommandLineFlagParser;
>  friend void ::google::GetAllFlags(vector<CommandLineFlagInfo>*);
>
>
>  typedef map<const char*, CommandLineFlag*, StringCmp> FlagMap;
>  typedef FlagMap::iterator FlagIterator;
>  typedef FlagMap::const_iterator FlagConstIterator;
>  FlagMap flags_;
>
>
>  typedef map<const void*, CommandLineFlag*> FlagPtrMap;
>  FlagPtrMap flags_by_ptr_;
>
>  Mutex lock_;
>
>  static FlagRegistry* global_registry_;
>  static Mutex global_registry_lock_;
>
>
>  FlagRegistry(const FlagRegistry&);
>  FlagRegistry& operator=(const FlagRegistry&);
>};
>
>FlagRegistry* FlagRegistry::global_registry_ = __null;
>Mutex FlagRegistry::global_registry_lock_(Mutex::LINKER_INITIALIZED);
>
>FlagRegistry* FlagRegistry::GlobalRegistry() {
>  MutexLock acquire_lock(&global_registry_lock_);
>  if (!global_registry_) {
>    global_registry_ = new FlagRegistry;
>  }
>  return global_registry_;
>}
>
>void FlagRegistry::RegisterFlag(CommandLineFlag* flag) {
>  Lock();
>  pair<FlagIterator, bool> ins =
>    flags_.insert(pair<const char*, CommandLineFlag*>(flag->name(), flag));
>  if (ins.second == false) {
>    if (strcmp(ins.first->second->filename(), flag->filename()) != 0) {
>      ReportError(DIE, "ERROR: flag '%s' was defined more than once "
>                  "(in files '%s' and '%s').\n",
>                  flag->name(),
>                  ins.first->second->filename(),
>                  flag->filename());
>    } else {
>      ReportError(DIE, "ERROR: something wrong with flag '%s' in file '%s'.  "
>                  "One possibility: file '%s' is being linked both statically "
>                  "and dynamically into this executable.\n",
>                  flag->name(),
>                  flag->filename(), flag->filename());
>    }
>  }
>
>  flags_by_ptr_[flag->current_->value_buffer_] = flag;
>  Unlock();
>}
>
>CommandLineFlag* FlagRegistry::FindFlagLocked(const char* name) {
>  FlagConstIterator i = flags_.find(name);
>  if (i == flags_.end()) {
>    return __null;
>  } else {
>    return i->second;
>  }
>}
>
>CommandLineFlag* FlagRegistry::FindFlagViaPtrLocked(const void* flag_ptr) {
>  FlagPtrMap::const_iterator i = flags_by_ptr_.find(flag_ptr);
>  if (i == flags_by_ptr_.end()) {
>    return __null;
>  } else {
>    return i->second;
>  }
>}
>
>CommandLineFlag* FlagRegistry::SplitArgumentLocked(const char* arg,
>                                                   string* key,
>                                                   const char** v,
>                                                   string* error_message) {
>
>  const char* flag_name;
>  const char* value = strchr(arg, '=');
>  if (value == __null) {
>    key->assign(arg);
>    *v = __null;
>  } else {
>
>    key->assign(arg, value-arg);
>    *v = ++value;
>  }
>  flag_name = key->c_str();
>
>  CommandLineFlag* flag = FindFlagLocked(flag_name);
>
>  if (flag == __null) {
>
>
>
>
>    if (!(flag_name[0] == 'n' && flag_name[1] == 'o')) {
>
>      *error_message = (string(kError) +
>                        "unknown command line flag '" + *key + "'\n");
>      return __null;
>    }
>    flag = FindFlagLocked(flag_name+2);
>    if (flag == __null) {
>
>      *error_message = (string(kError) +
>                        "unknown command line flag '" + *key + "'\n");
>      return __null;
>    }
>    if (strcmp(flag->type_name(), "bool") != 0) {
>
>      *error_message = (string(kError) +
>                        "boolean value (" + *key + ") specified for " +
>                        flag->type_name() + " command line flag\n");
>      return __null;
>    }
>
>
>    key->assign(flag_name+2);
>    *v = "0";
>  }
>
>
>  if (*v == __null && strcmp(flag->type_name(), "bool") == 0) {
>    *v = "1";
>  }
>
>  return flag;
>}
>
>bool TryParseLocked(const CommandLineFlag* flag, FlagValue* flag_value,
>                    const char* value, string* msg) {
>
>  FlagValue* tentative_value = flag_value->New();
>  if (!tentative_value->ParseFrom(value)) {
>    if (msg) {
>      *msg += (string(kError) + "illegal value '" + value +
>               + "' specified for " + flag->type_name() + " flag '"
>               + flag->name() + "'\n");
>    }
>    delete tentative_value;
>    return false;
>  } else if (!flag->Validate(*tentative_value)) {
>    if (msg) {
>      *msg += (string(kError) + "failed validation of new value "
>               + "'" + tentative_value->ToString() + "' for flag '" +
>               + flag->name() + "'\n");
>    }
>    delete tentative_value;
>    return false;
>  } else {
>    flag_value->CopyFrom(*tentative_value);
>    if (msg) {
>      *msg += (string(flag->name()) + " set to " + flag_value->ToString()
>               + "\n");
>    }
>    delete tentative_value;
>    return true;
>  }
>}
>
>bool FlagRegistry::SetFlagLocked(CommandLineFlag* flag,
>                                 const char* value,
>                                 FlagSettingMode set_mode,
>                                 string* msg) {
>  flag->UpdateModifiedBit();
>  switch (set_mode) {
>    case SET_FLAGS_VALUE: {
>
>      if (!TryParseLocked(flag, flag->current_, value, msg))
>        return false;
>      flag->modified_ = true;
>      break;
>    }
>    case SET_FLAG_IF_DEFAULT: {
>
>      if (!flag->modified_) {
>        if (!TryParseLocked(flag, flag->current_, value, msg))
>          return false;
>        flag->modified_ = true;
>      } else {
>        *msg = string(flag->name()) + " set to " + flag->current_value();
>      }
>      break;
>    }
>    case SET_FLAGS_DEFAULT: {
>
>      if (!TryParseLocked(flag, flag->defvalue_, value, msg))
>        return false;
>      if (!flag->modified_) {
>
>        TryParseLocked(flag, flag->current_, value, __null);
>      }
>      break;
>    }
>    default: {
>
>      (static_cast<void> (0));
>      return false;
>    }
>  }
>
>  return true;
>}
>
>class FlagRegistryLock {
> public:
>  explicit FlagRegistryLock(FlagRegistry* fr) : fr_(fr) { fr_->Lock(); }
>  ~FlagRegistryLock() { fr_->Unlock(); }
> private:
>  FlagRegistry *const fr_;
>};
># 927 "src/gflags.cc"
>class CommandLineFlagParser {
> public:
>
>  explicit CommandLineFlagParser(FlagRegistry* reg) : registry_(reg) {}
>  ~CommandLineFlagParser() {}
>
>
>
>
>
>
>  uint32 ParseNewCommandLineFlags(int* argc, char*** argv, bool remove_flags);
>
>
>
>
>
>
>  void ValidateAllFlags();
>
>
>  bool ReportErrors();
># 958 "src/gflags.cc"
>  string ProcessSingleOptionLocked(CommandLineFlag* flag,
>                                   const char* value,
>                                   FlagSettingMode set_mode);
>
>
>
>
>
>
>
>  string ProcessOptionsFromStringLocked(const string& contentdata,
>                                        FlagSettingMode set_mode);
>
>
>
>
>
>  string ProcessFlagfileLocked(const string& flagval, FlagSettingMode set_mode);
>
>  string ProcessFromenvLocked(const string& flagval, FlagSettingMode set_mode,
>                              bool errors_are_fatal);
>
> private:
>  FlagRegistry* const registry_;
>  map<string, string> error_flags_;
>
>  map<string, string> undefined_names_;
>};
>
>
>
>static void ParseFlagList(const char* value, vector<string>* flags) {
>  for (const char *p = value; p && *p; value = p) {
>    p = strchr(value, ',');
>    int len;
>    if (p) {
>      len = static_cast<int>(p - value);
>      p++;
>    } else {
>      len = static_cast<int>(strlen(value));
>    }
>
>    if (len == 0)
>      ReportError(DIE, "ERROR: empty flaglist entry\n");
>    if (value[0] == '-')
>      ReportError(DIE, "ERROR: flag \"%*s\" begins with '-'\n", len, value);
>
>    flags->push_back(string(value, len));
>  }
>}
>
>
>
>
>
>
>
>static string ReadFileIntoString(const char* filename) {
>  const int kBufSize = 8092;
>  char buffer[kBufSize];
>  string s;
>  FILE* fp = fopen(filename, "r");
>  if (!fp) do { perror(filename); commandlineflags_exitfunc(1); } while (0);
>  size_t n;
>  while ( (n=fread(buffer, 1, kBufSize, fp)) > 0 ) {
>    if (ferror(fp)) do { perror(filename); commandlineflags_exitfunc(1); } while (0);
>    s.append(buffer, n);
>  }
>  fclose(fp);
>  return s;
>}
>
>uint32 CommandLineFlagParser::ParseNewCommandLineFlags(int* argc, char*** argv,
>                                                       bool remove_flags) {
>  const char *program_name = strrchr((*argv)[0], '/');
>  program_name = (program_name == __null ? (*argv)[0] : program_name+1);
>
>  int first_nonopt = *argc;
>
>  registry_->Lock();
>  for (int i = 1; i < first_nonopt; i++) {
>    char* arg = (*argv)[i];
>
>
>    if (arg[0] != '-' ||
>        (arg[0] == '-' && arg[1] == '\0')) {
>      memmove((*argv) + i, (*argv) + i+1, (*argc - (i+1)) * sizeof((*argv)[i]));
>      (*argv)[*argc-1] = arg;
>      first_nonopt--;
>      i--;
>      continue;
>    }
>
>    if (arg[0] == '-') arg++;
>    if (arg[0] == '-') arg++;
>
>
>    if (*arg == '\0') {
>      first_nonopt = i+1;
>      break;
>    }
>
>
>    string key;
>    const char* value;
>    string error_message;
>    CommandLineFlag* flag = registry_->SplitArgumentLocked(arg, &key, &value,
>                                                           &error_message);
>    if (flag == __null) {
>      undefined_names_[key] = "";
>      error_flags_[key] = error_message;
>      continue;
>    }
>
>    if (value == __null) {
>
>      (static_cast<void> (0));
>      if (i+1 >= first_nonopt) {
>
>        error_flags_[key] = (string(kError) + "flag '" + (*argv)[i] + "'"
>                             + " is missing its argument");
>        if (flag->help() && flag->help()[0] > '\001') {
>
>          error_flags_[key] += string("; flag description: ") + flag->help();
>        }
>        error_flags_[key] += "\n";
>        break;
>      } else {
>        value = (*argv)[++i];
># 1098 "src/gflags.cc"
>        if (value[0] == '-'
>            && strcmp(flag->type_name(), "string") == 0
>            && (strstr(flag->help(), "true")
>                || strstr(flag->help(), "false"))) {
>          fprintf(stderr, "Did you really mean to set flag '%s'"
>                  " to the value '%s'?\n",
>                  flag->name(), value);
>        }
>      }
>    }
>
>
>    ProcessSingleOptionLocked(flag, value, SET_FLAGS_VALUE);
>  }
>  registry_->Unlock();
>
>  if (remove_flags) {
>    (*argv)[first_nonopt-1] = (*argv)[0];
>    (*argv) += (first_nonopt-1);
>    (*argc) -= (first_nonopt-1);
>    first_nonopt = 1;
>  }
>
>  logging_is_probably_set_up = true;
>
>  return first_nonopt;
>}
>
>string CommandLineFlagParser::ProcessFlagfileLocked(const string& flagval,
>                                                    FlagSettingMode set_mode) {
>  if (flagval.empty())
>    return "";
>
>  string msg;
>  vector<string> filename_list;
>  ParseFlagList(flagval.c_str(), &filename_list);
>  for (size_t i = 0; i < filename_list.size(); ++i) {
>    const char* file = filename_list[i].c_str();
>    msg += ProcessOptionsFromStringLocked(ReadFileIntoString(file), set_mode);
>  }
>  return msg;
>}
>
>string CommandLineFlagParser::ProcessFromenvLocked(const string& flagval,
>                                                   FlagSettingMode set_mode,
>                                                   bool errors_are_fatal) {
>  if (flagval.empty())
>    return "";
>
>  string msg;
>  vector<string> flaglist;
>  ParseFlagList(flagval.c_str(), &flaglist);
>
>  for (size_t i = 0; i < flaglist.size(); ++i) {
>    const char* flagname = flaglist[i].c_str();
>    CommandLineFlag* flag = registry_->FindFlagLocked(flagname);
>    if (flag == __null) {
>      error_flags_[flagname] = (string(kError) + "unknown command line flag"
>                                + " '" + flagname + "'"
>                                + " (via --fromenv or --tryfromenv)\n");
>      undefined_names_[flagname] = "";
>      continue;
>    }
>
>    const string envname = string("FLAGS_") + string(flagname);
>    const char* envval = getenv(envname.c_str());
>    if (!envval) {
>      if (errors_are_fatal) {
>        error_flags_[flagname] = (string(kError) + envname +
>                                  " not found in environment\n");
>      }
>      continue;
>    }
>
>
>    if ((strcmp(envval, "fromenv") == 0) ||
>        (strcmp(envval, "tryfromenv") == 0)) {
>      error_flags_[flagname] = (string(kError) + "infinite recursion on " +
>                                "environment flag '" + envval + "'\n");
>      continue;
>    }
>
>    msg += ProcessSingleOptionLocked(flag, envval, set_mode);
>  }
>  return msg;
>}
>
>string CommandLineFlagParser::ProcessSingleOptionLocked(
>    CommandLineFlag* flag, const char* value, FlagSettingMode set_mode) {
>  string msg;
>  if (value && !registry_->SetFlagLocked(flag, value, set_mode, &msg)) {
>    error_flags_[flag->name()] = msg;
>    return "";
>  }
>
>
>
>
>  if (strcmp(flag->name(), "flagfile") == 0) {
>    msg += ProcessFlagfileLocked(FLAGS_flagfile, set_mode);
>
>  } else if (strcmp(flag->name(), "fromenv") == 0) {
>
>    msg += ProcessFromenvLocked(FLAGS_fromenv, set_mode, true);
>
>  } else if (strcmp(flag->name(), "tryfromenv") == 0) {
>    msg += ProcessFromenvLocked(FLAGS_tryfromenv, set_mode, false);
>  }
>
>  return msg;
>}
>
>void CommandLineFlagParser::ValidateAllFlags() {
>  FlagRegistryLock frl(registry_);
>  for (FlagRegistry::FlagConstIterator i = registry_->flags_.begin();
>       i != registry_->flags_.end(); ++i) {
>    if (!i->second->ValidateCurrent()) {
>
>
>
>      if (error_flags_[i->second->name()].empty())
>        error_flags_[i->second->name()] =
>            string(kError) + "--" + i->second->name() +
>            " must be set on the commandline"
>            " (default value fails validation)\n";
>    }
>  }
>}
>
>bool CommandLineFlagParser::ReportErrors() {
>
>
>  if (!FLAGS_undefok.empty()) {
>    vector<string> flaglist;
>    ParseFlagList(FLAGS_undefok.c_str(), &flaglist);
>    for (size_t i = 0; i < flaglist.size(); ++i) {
>
>      const string no_version = string("no") + flaglist[i];
>      if (undefined_names_.find(flaglist[i]) != undefined_names_.end()) {
>        error_flags_[flaglist[i]] = "";
>      } else if (undefined_names_.find(no_version) != undefined_names_.end()) {
>        error_flags_[no_version] = "";
>      }
>    }
>  }
>
>
>
>  if (allow_command_line_reparsing) {
>    for (map<string, string>::const_iterator it = undefined_names_.begin();
>         it != undefined_names_.end(); ++it)
>      error_flags_[it->first] = "";
>  }
>
>  bool found_error = false;
>  string error_message;
>  for (map<string, string>::const_iterator it = error_flags_.begin();
>       it != error_flags_.end(); ++it) {
>    if (!it->second.empty()) {
>      error_message.append(it->second.data(), it->second.size());
>      found_error = true;
>    }
>  }
>  if (found_error)
>    ReportError(DO_NOT_DIE, "%s", error_message.c_str());
>  return found_error;
>}
>
>string CommandLineFlagParser::ProcessOptionsFromStringLocked(
>    const string& contentdata, FlagSettingMode set_mode) {
>  string retval;
>  const char* flagfile_contents = contentdata.c_str();
>  bool flags_are_relevant = true;
>  bool in_filename_section = false;
>
>  const char* line_end = flagfile_contents;
>
>  for (; line_end; flagfile_contents = line_end + 1) {
>    while (*flagfile_contents && isspace(*flagfile_contents))
>      ++flagfile_contents;
>    line_end = strchr(flagfile_contents, '\n');
>    size_t len = line_end ? static_cast<size_t>(line_end - flagfile_contents)
>                          : strlen(flagfile_contents);
>    string line(flagfile_contents, len);
>
>
>
>
>
>
>    if (line.empty() || line[0] == '#') {
>
>
>    } else if (line[0] == '-') {
>      in_filename_section = false;
>      if (!flags_are_relevant)
>        continue;
>
>      const char* name_and_val = line.c_str() + 1;
>      if (*name_and_val == '-')
>        name_and_val++;
>      string key;
>      const char* value;
>      string error_message;
>      CommandLineFlag* flag = registry_->SplitArgumentLocked(name_and_val,
>                                                             &key, &value,
>                                                             &error_message);
>
>      if (flag == __null) {
>
>      } else if (value == __null) {
>
>      } else {
>        retval += ProcessSingleOptionLocked(flag, value, set_mode);
>      }
>
>    } else {
>      if (!in_filename_section) {
>        in_filename_section = true;
>        flags_are_relevant = false;
>      }
>
>
>      const char* space = line.c_str();
>      for (const char* word = line.c_str(); *space; word = space+1) {
>        if (flags_are_relevant)
>          break;
>        space = strchr(word, ' ');
>        if (space == __null)
>          space = word + strlen(word);
>        const string glob(word, space - word);
>
>
>        if (fnmatch(glob.c_str(),
>                    ProgramInvocationName(),
>                    (1 << 0)) == 0 ||
>            fnmatch(glob.c_str(),
>                    ProgramInvocationShortName(),
>                    (1 << 0)) == 0) {
>
>
>
>
>          flags_are_relevant = true;
>        }
>      }
>    }
>  }
>  return retval;
>}
># 1358 "src/gflags.cc"
>template<typename T>
>T GetFromEnv(const char *varname, const char* type, T dflt) {
>  const char* const valstr = getenv(varname);
>  if (!valstr)
>    return dflt;
>  FlagValue ifv(new T, type, true);
>  if (!ifv.ParseFrom(valstr))
>    ReportError(DIE, "ERROR: error parsing env variable '%s' with value '%s'\n",
>                varname, valstr);
>  return *reinterpret_cast<T*>(ifv.value_buffer_);
>}
>
>bool AddFlagValidator(const void* flag_ptr, ValidateFnProto validate_fn_proto) {
>
>
>
>
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  FlagRegistryLock frl(registry);
>
>
>  CommandLineFlag* flag = registry->FindFlagViaPtrLocked(flag_ptr);
>  if (!flag) {
>
>
>    return false;
>  } else if (validate_fn_proto == flag->validate_function()) {
>    return true;
>  } else if (validate_fn_proto != __null && flag->validate_function() != __null) {
>
>
>    return false;
>  } else {
>    flag->validate_fn_proto_ = validate_fn_proto;
>    return true;
>  }
>}
>
>}
># 1412 "src/gflags.cc"
>FlagRegisterer::FlagRegisterer(const char* name, const char* type,
>                               const char* help, const char* filename,
>                               void* current_storage, void* defvalue_storage) {
>  if (help == __null)
>    help = "";
>
>
>  if (strchr(type, ':'))
>    type = strrchr(type, ':') + 1;
>  FlagValue* current = new FlagValue(current_storage, type, false);
>  FlagValue* defvalue = new FlagValue(defvalue_storage, type, false);
>
>  CommandLineFlag* flag = new CommandLineFlag(name, help, filename,
>                                              current, defvalue);
>  FlagRegistry::GlobalRegistry()->RegisterFlag(flag);
>}
># 1437 "src/gflags.cc"
>struct FilenameFlagnameCmp {
>  bool operator()(const CommandLineFlagInfo& a,
>                  const CommandLineFlagInfo& b) const {
>    int cmp = strcmp(a.filename.c_str(), b.filename.c_str());
>    if (cmp == 0)
>      cmp = strcmp(a.name.c_str(), b.name.c_str());
>    return cmp < 0;
>  }
>};
>
>void GetAllFlags(vector<CommandLineFlagInfo>* OUTPUT) {
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  registry->Lock();
>  for (FlagRegistry::FlagConstIterator i = registry->flags_.begin();
>       i != registry->flags_.end(); ++i) {
>    CommandLineFlagInfo fi;
>    i->second->FillCommandLineFlagInfo(&fi);
>    OUTPUT->push_back(fi);
>  }
>  registry->Unlock();
>
>  sort(OUTPUT->begin(), OUTPUT->end(), FilenameFlagnameCmp());
>}
># 1477 "src/gflags.cc"
>static const char* argv0 = "UNKNOWN";
>static const char* cmdline = "";
>static vector<string> argvs;
>static uint32 argv_sum = 0;
>static const char* program_usage = __null;
>
>void SetArgv(int argc, const char** argv) {
>  static bool called_set_argv = false;
>  if (called_set_argv)
>    return;
>
>  called_set_argv = true;
>
>  (static_cast<void> (0));
>  argv0 = strdup(argv[0]);
>  (static_cast<void> (0));
>
>  string cmdline_string;
>  for (int i = 0; i < argc; i++) {
>    if (i != 0) {
>      cmdline_string += " ";
>    }
>    cmdline_string += argv[i];
>    argvs.push_back(argv[i]);
>  }
>  cmdline = strdup(cmdline_string.c_str());
>  (static_cast<void> (0));
>
>
>  for (const char* c = cmdline; *c; c++)
>    argv_sum += *c;
>}
>
>const vector<string>& GetArgvs() { return argvs; }
>const char* GetArgv() { return cmdline; }
>const char* GetArgv0() { return argv0; }
>uint32 GetArgvSum() { return argv_sum; }
>const char* ProgramInvocationName() {
>  return GetArgv0();
>}
>const char* ProgramInvocationShortName() {
>  const char* slash = strrchr(argv0, '/');
>
>
>
>  return slash ? slash + 1 : argv0;
>}
>
>void SetUsageMessage(const string& usage) {
>  if (program_usage != __null)
>    ReportError(DIE, "ERROR: SetUsageMessage() called twice\n");
>  program_usage = strdup(usage.c_str());
>}
>
>const char* ProgramUsage() {
>  if (program_usage) {
>    return program_usage;
>  }
>  return "Warning: SetUsageMessage() never called";
>}
># 1557 "src/gflags.cc"
>bool GetCommandLineOption(const char* name, string* value) {
>  if (__null == name)
>    return false;
>  (static_cast<void> (0));
>
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  FlagRegistryLock frl(registry);
>  CommandLineFlag* flag = registry->FindFlagLocked(name);
>  if (flag == __null) {
>    return false;
>  } else {
>    *value = flag->current_value();
>    return true;
>  }
>}
>
>bool GetCommandLineFlagInfo(const char* name, CommandLineFlagInfo* OUTPUT) {
>  if (__null == name) return false;
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  FlagRegistryLock frl(registry);
>  CommandLineFlag* flag = registry->FindFlagLocked(name);
>  if (flag == __null) {
>    return false;
>  } else {
>    (static_cast<void> (0));
>    flag->FillCommandLineFlagInfo(OUTPUT);
>    return true;
>  }
>}
>
>CommandLineFlagInfo GetCommandLineFlagInfoOrDie(const char* name) {
>  CommandLineFlagInfo info;
>  if (!GetCommandLineFlagInfo(name, &info)) {
>    fprintf(stderr, "FATAL ERROR: flag name '%s' doesn't exist\n", name);
>    commandlineflags_exitfunc(1);
>  }
>  return info;
>}
>
>string SetCommandLineOptionWithMode(const char* name, const char* value,
>                                    FlagSettingMode set_mode) {
>  string result;
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  FlagRegistryLock frl(registry);
>  CommandLineFlag* flag = registry->FindFlagLocked(name);
>  if (flag) {
>    CommandLineFlagParser parser(registry);
>    result = parser.ProcessSingleOptionLocked(flag, value, set_mode);
>    if (!result.empty()) {
>
>
>
>
>    }
>  }
>
>  return result;
>}
>
>string SetCommandLineOption(const char* name, const char* value) {
>  return SetCommandLineOptionWithMode(name, value, SET_FLAGS_VALUE);
>}
># 1630 "src/gflags.cc"
>class FlagSaverImpl {
> public:
>
>  explicit FlagSaverImpl(FlagRegistry* main_registry)
>      : main_registry_(main_registry) { }
>  ~FlagSaverImpl() {
>
>    vector<CommandLineFlag*>::const_iterator it;
>    for (it = backup_registry_.begin(); it != backup_registry_.end(); ++it)
>      delete *it;
>  }
>
>
>
>
>  void SaveFromRegistry() {
>    FlagRegistryLock frl(main_registry_);
>    (static_cast<void> (0));
>    for (FlagRegistry::FlagConstIterator it = main_registry_->flags_.begin();
>         it != main_registry_->flags_.end();
>         ++it) {
>      const CommandLineFlag* main = it->second;
>
>      CommandLineFlag* backup = new CommandLineFlag(
>          main->name(), main->help(), main->filename(),
>          main->current_->New(), main->defvalue_->New());
>
>      backup->CopyFrom(*main);
>      backup_registry_.push_back(backup);
>    }
>  }
>
>
>
>
>
>  void RestoreToRegistry() {
>    FlagRegistryLock frl(main_registry_);
>    vector<CommandLineFlag*>::const_iterator it;
>    for (it = backup_registry_.begin(); it != backup_registry_.end(); ++it) {
>      CommandLineFlag* main = main_registry_->FindFlagLocked((*it)->name());
>      if (main != __null) {
>        main->CopyFrom(**it);
>      }
>    }
>  }
>
> private:
>  FlagRegistry* const main_registry_;
>  vector<CommandLineFlag*> backup_registry_;
>
>  FlagSaverImpl(const FlagSaverImpl&);
>  void operator=(const FlagSaverImpl&);
>};
>
>FlagSaver::FlagSaver()
>    : impl_(new FlagSaverImpl(FlagRegistry::GlobalRegistry())) {
>  impl_->SaveFromRegistry();
>}
>
>FlagSaver::~FlagSaver() {
>  impl_->RestoreToRegistry();
>  delete impl_;
>}
># 1711 "src/gflags.cc"
>static string TheseCommandlineFlagsIntoString(
>    const vector<CommandLineFlagInfo>& flags) {
>  vector<CommandLineFlagInfo>::const_iterator i;
>
>  size_t retval_space = 0;
>  for (i = flags.begin(); i != flags.end(); ++i) {
>
>    retval_space += i->name.length() + i->current_value.length() + 5;
>  }
>
>  string retval;
>  retval.reserve(retval_space);
>  for (i = flags.begin(); i != flags.end(); ++i) {
>    retval += "--";
>    retval += i->name;
>    retval += "=";
>    retval += i->current_value;
>    retval += "\n";
>  }
>  return retval;
>}
>
>string CommandlineFlagsIntoString() {
>  vector<CommandLineFlagInfo> sorted_flags;
>  GetAllFlags(&sorted_flags);
>  return TheseCommandlineFlagsIntoString(sorted_flags);
>}
>
>bool ReadFlagsFromString(const string& flagfilecontents,
>                         const char* ,
>                         bool errors_are_fatal) {
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  FlagSaverImpl saved_states(registry);
>  saved_states.SaveFromRegistry();
>
>  CommandLineFlagParser parser(registry);
>  registry->Lock();
>  parser.ProcessOptionsFromStringLocked(flagfilecontents, SET_FLAGS_VALUE);
>  registry->Unlock();
>
>  HandleCommandLineHelpFlags();
>  if (parser.ReportErrors()) {
>
>    if (errors_are_fatal)
>      commandlineflags_exitfunc(1);
>    saved_states.RestoreToRegistry();
>    return false;
>  }
>  return true;
>}
>
>
>bool AppendFlagsIntoFile(const string& filename, const char *prog_name) {
>  FILE *fp = fopen(filename.c_str(), "a");
>  if (!fp) {
>    return false;
>  }
>
>  if (prog_name)
>    fprintf(fp, "%s\n", prog_name);
>
>  vector<CommandLineFlagInfo> flags;
>  GetAllFlags(&flags);
>
>  vector<CommandLineFlagInfo>::iterator i;
>  for (i = flags.begin(); i != flags.end(); ++i) {
>    if (strcmp(i->name.c_str(), "flagfile") == 0) {
>      flags.erase(i);
>      break;
>    }
>  }
>  fprintf(fp, "%s", TheseCommandlineFlagsIntoString(flags).c_str());
>
>  fclose(fp);
>  return true;
>}
>
>bool ReadFromFlagsFile(const string& filename, const char* prog_name,
>                       bool errors_are_fatal) {
>  return ReadFlagsFromString(ReadFileIntoString(filename.c_str()),
>                             prog_name, errors_are_fatal);
>}
># 1808 "src/gflags.cc"
>bool BoolFromEnv(const char *v, bool dflt) {
>  return GetFromEnv(v, "bool", dflt);
>}
>int32 Int32FromEnv(const char *v, int32 dflt) {
>  return GetFromEnv(v, "int32", dflt);
>}
>int64 Int64FromEnv(const char *v, int64 dflt) {
>  return GetFromEnv(v, "int64", dflt);
>}
>uint64 Uint64FromEnv(const char *v, uint64 dflt) {
>  return GetFromEnv(v, "uint64", dflt);
>}
>double DoubleFromEnv(const char *v, double dflt) {
>  return GetFromEnv(v, "double", dflt);
>}
>const char *StringFromEnv(const char *varname, const char *dflt) {
>  const char* const val = getenv(varname);
>  return val ? val : dflt;
>}
># 1841 "src/gflags.cc"
>bool RegisterFlagValidator(const bool* flag,
>                           bool (*validate_fn)(const char*, bool)) {
>  return AddFlagValidator(flag, reinterpret_cast<ValidateFnProto>(validate_fn));
>}
>bool RegisterFlagValidator(const int32* flag,
>                           bool (*validate_fn)(const char*, int32)) {
>  return AddFlagValidator(flag, reinterpret_cast<ValidateFnProto>(validate_fn));
>}
>bool RegisterFlagValidator(const int64* flag,
>                           bool (*validate_fn)(const char*, int64)) {
>  return AddFlagValidator(flag, reinterpret_cast<ValidateFnProto>(validate_fn));
>}
>bool RegisterFlagValidator(const uint64* flag,
>                           bool (*validate_fn)(const char*, uint64)) {
>  return AddFlagValidator(flag, reinterpret_cast<ValidateFnProto>(validate_fn));
>}
>bool RegisterFlagValidator(const double* flag,
>                           bool (*validate_fn)(const char*, double)) {
>  return AddFlagValidator(flag, reinterpret_cast<ValidateFnProto>(validate_fn));
>}
>bool RegisterFlagValidator(const string* flag,
>                           bool (*validate_fn)(const char*, const string&)) {
>  return AddFlagValidator(flag, reinterpret_cast<ValidateFnProto>(validate_fn));
>}
># 1878 "src/gflags.cc"
>static uint32 ParseCommandLineFlagsInternal(int* argc, char*** argv,
>                                            bool remove_flags, bool do_report) {
>  SetArgv(*argc, const_cast<const char**>(*argv));
>
>  FlagRegistry* const registry = FlagRegistry::GlobalRegistry();
>  CommandLineFlagParser parser(registry);
>
>
>
>
>
>
>  registry->Lock();
>  parser.ProcessFlagfileLocked(FLAGS_flagfile, SET_FLAGS_VALUE);
>
>  parser.ProcessFromenvLocked(FLAGS_fromenv, SET_FLAGS_VALUE, true);
>  parser.ProcessFromenvLocked(FLAGS_tryfromenv, SET_FLAGS_VALUE, false);
>  registry->Unlock();
>
>
>  const int r = parser.ParseNewCommandLineFlags(argc, argv, remove_flags);
>
>  if (do_report)
>    HandleCommandLineHelpFlags();
>
>
>  parser.ValidateAllFlags();
>
>  if (parser.ReportErrors())
>    commandlineflags_exitfunc(1);
>  return r;
>}
>
>uint32 ParseCommandLineFlags(int* argc, char*** argv, bool remove_flags) {
>  return ParseCommandLineFlagsInternal(argc, argv, remove_flags, true);
>}
>
>uint32 ParseCommandLineNonHelpFlags(int* argc, char*** argv,
>                                    bool remove_flags) {
>  return ParseCommandLineFlagsInternal(argc, argv, remove_flags, false);
>}
># 1933 "src/gflags.cc"
>void AllowCommandLineReparsing() {
>  allow_command_line_reparsing = true;
>}
>
>uint32 ReparseCommandLineNonHelpFlags() {
>
>  const vector<string>& argvs = GetArgvs();
>  int tmp_argc = static_cast<int>(argvs.size());
>  char** tmp_argv = new char* [tmp_argc + 1];
>  for (int i = 0; i < tmp_argc; ++i)
>    tmp_argv[i] = strdup(argvs[i].c_str());
>
>  const int retval = ParseCommandLineNonHelpFlags(&tmp_argc, &tmp_argv, false);
>
>  for (int i = 0; i < tmp_argc; ++i)
>    free(tmp_argv[i]);
>  delete[] tmp_argv;
>
>  return retval;
>}
>
>void ShutDownCommandLineFlags() {
>  FlagRegistry::DeleteGlobalRegistry();
>}
>
>}

Actions: View

Attachments on bug 679513: 419234