public inbox for gcc-prs@sourceware.org
help / color / mirror / Atom feed
* optimization/2435: GCC 3.0 20010326 emits duplicate template instantiations with -O
@ 2001-03-30 5:56 Andreas Zeller
0 siblings, 0 replies; only message in thread
From: Andreas Zeller @ 2001-03-30 5:56 UTC (permalink / raw)
To: gcc-gnats; +Cc: strecken
>Number: 2435
>Category: optimization
>Synopsis: GCC 3.0 20010326 emits duplicate template instantiations with -O
>Confidential: no
>Severity: serious
>Priority: high
>Responsible: unassigned
>State: open
>Class: wrong-code
>Submitter-Id: net
>Arrival-Date: Fri Mar 30 05:56:02 PST 2001
>Closed-Date:
>Last-Modified:
>Originator: Andreas Zeller
>Release: 3.0 20010326 (prerelease)
>Organization:
Universitaet Passau, Germany
>Environment:
System: Linux jamaica.fmi.uni-passau.de 2.2.17-14 #1 Mon Feb 5 18:48:50 EST 2001 i686 unknown
Architecture: i686
host: i686-pc-linux-gnu
build: i686-pc-linux-gnu
target: i686-pc-linux-gnu
configured with: ../egcs/configure --prefix=/public/packages/programming/gcc-current --enable-threads=posix --enable-shared --enable-languages=c++,java --with-system-zlib --with-gxx-include-dir=/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++
>Description:
Compiling the included `session.i' file (a simplified part of
GNU DDD) with `-O' optimization generates two superfluous
template instantiations in the object file:
$ c++ -O -c session.i; nm session.o | c++filt | grep ' T '
00000000 T lock_session_dir()
00000270 T unlock_session_dir()
00000220 T std::basic_ios<char, std::char_traits<char> >::rdstate() const
00000230 T std::basic_ios<char, std::char_traits<char> >::clear(std::_Ios_Iostate)
$ _
This happens multiple times, and thus breaks linkage due to
multiple occurrences of the same symbol.
Compiling without `-O' makes the problem go away:
$ c++ -c session.i; nm session.o | c++filt | grep ' T '
00000000 T lock_session_dir()
000000f0 T unlock_session_dir()
$ _
>How-To-Repeat:
Compile the included `session.i' file as described above.
# 29 "/home/st/andreas/ddd/ddd/session.C"
# 1 "/home/st/andreas/ddd/ddd/strclass.h" 1
# 409 "/home/st/andreas/ddd/ddd/strclass.h"
#pragma interface
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/iostream.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/iostream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iostream.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iostream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/os_defines.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/os_defines.h" 3
# 1 "/usr/include/features.h" 1 3
# 250 "/usr/include/features.h" 3
# 1 "/usr/include/sys/cdefs.h" 1 3
# 251 "/usr/include/features.h" 2 3
# 278 "/usr/include/features.h" 3
# 1 "/usr/include/gnu/stubs.h" 1 3
# 279 "/usr/include/features.h" 2 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/os_defines.h" 2 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 2 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iostream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ostream.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ostream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 147 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 3
typedef int ptrdiff_t;
# 199 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 3
typedef unsigned int size_t;
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 2 3
namespace std
{
using ::ptrdiff_t;
using ::size_t;
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdarg.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdarg.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stdarg.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stdarg.h" 3
typedef __builtin_va_list __gnuc_va_list;
# 110 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stdarg.h" 3
typedef __gnuc_va_list va_list;
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdarg.h" 2 3
namespace std
{
using ::va_list;
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 2 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 3
# 1 "/usr/include/stdio.h" 1 3
# 27 "/usr/include/stdio.h" 3
# 1 "/usr/include/features.h" 1 3
# 28 "/usr/include/stdio.h" 2 3
extern "C" {
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 34 "/usr/include/stdio.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stdarg.h" 1 3
# 39 "/usr/include/stdio.h" 2 3
# 1 "/usr/include/bits/types.h" 1 3
# 26 "/usr/include/bits/types.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/bits/types.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 30 "/usr/include/bits/types.h" 2 3
typedef unsigned char __u_char;
typedef unsigned short __u_short;
typedef unsigned int __u_int;
typedef unsigned long __u_long;
__extension__ typedef unsigned long long int __u_quad_t;
__extension__ typedef long long int __quad_t;
# 49 "/usr/include/bits/types.h" 3
typedef signed char __int8_t;
typedef unsigned char __uint8_t;
typedef signed short int __int16_t;
typedef unsigned short int __uint16_t;
typedef signed int __int32_t;
typedef unsigned int __uint32_t;
__extension__ typedef signed long long int __int64_t;
__extension__ typedef unsigned long long int __uint64_t;
typedef __quad_t *__qaddr_t;
typedef __u_quad_t __dev_t;
typedef __u_int __uid_t;
typedef __u_int __gid_t;
typedef __u_long __ino_t;
typedef __u_int __mode_t;
typedef __u_int __nlink_t;
typedef long int __off_t;
typedef __quad_t __loff_t;
typedef int __pid_t;
typedef int __ssize_t;
typedef long int __rlim_t;
typedef __quad_t __rlim64_t;
typedef __u_int __id_t;
typedef struct
{
int __val[2];
} __fsid_t;
typedef int __daddr_t;
typedef char *__caddr_t;
typedef long int __time_t;
typedef long int __swblk_t;
typedef long int __clock_t;
typedef unsigned long int __fd_mask;
# 100 "/usr/include/bits/types.h" 3
typedef struct
{
__fd_mask fds_bits[1024 / (8 * sizeof (__fd_mask))];
} __fd_set;
typedef int __key_t;
typedef unsigned short int __ipc_pid_t;
typedef long int __blkcnt_t;
typedef __quad_t __blkcnt64_t;
typedef __u_long __fsblkcnt_t;
typedef __u_quad_t __fsblkcnt64_t;
typedef __u_long __fsfilcnt_t;
typedef __u_quad_t __fsfilcnt64_t;
typedef __u_long __ino64_t;
typedef __loff_t __off64_t;
typedef long int __t_scalar_t;
typedef unsigned long int __t_uscalar_t;
typedef int __intptr_t;
# 1 "/usr/include/bits/pthreadtypes.h" 1 3
# 23 "/usr/include/bits/pthreadtypes.h" 3
# 1 "/usr/include/bits/sched.h" 1 3
# 68 "/usr/include/bits/sched.h" 3
struct __sched_param
{
int sched_priority;
};
# 24 "/usr/include/bits/pthreadtypes.h" 2 3
struct _pthread_fastlock
{
long int __status;
int __spinlock;
};
typedef struct _pthread_descr_struct *_pthread_descr;
typedef struct
{
int __detachstate;
int __schedpolicy;
struct __sched_param __schedparam;
int __inheritsched;
int __scope;
size_t __guardsize;
int __stackaddr_set;
void *__stackaddr;
size_t __stacksize;
} pthread_attr_t;
typedef struct
{
struct _pthread_fastlock __c_lock;
_pthread_descr __c_waiting;
} pthread_cond_t;
typedef struct
{
int __dummy;
} pthread_condattr_t;
typedef unsigned int pthread_key_t;
typedef struct
{
int __m_reserved;
int __m_count;
_pthread_descr __m_owner;
int __m_kind;
struct _pthread_fastlock __m_lock;
} pthread_mutex_t;
typedef struct
{
int __mutexkind;
} pthread_mutexattr_t;
typedef int pthread_once_t;
typedef struct _pthread_rwlock_t
{
struct _pthread_fastlock __rw_lock;
int __rw_readers;
_pthread_descr __rw_writer;
_pthread_descr __rw_read_waiting;
_pthread_descr __rw_write_waiting;
int __rw_kind;
int __rw_pshared;
} pthread_rwlock_t;
typedef struct
{
int __lockkind;
int __pshared;
} pthread_rwlockattr_t;
typedef unsigned long int pthread_t;
# 151 "/usr/include/bits/types.h" 2 3
# 41 "/usr/include/stdio.h" 2 3
typedef struct _IO_FILE FILE;
# 57 "/usr/include/stdio.h" 3
# 1 "/usr/include/libio.h" 1 3
# 30 "/usr/include/libio.h" 3
# 1 "/usr/include/_G_config.h" 1 3
# 9 "/usr/include/_G_config.h" 3
# 1 "/usr/include/bits/types.h" 1 3
# 10 "/usr/include/_G_config.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 312 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 3
typedef unsigned int wint_t;
# 15 "/usr/include/_G_config.h" 2 3
# 35 "/usr/include/_G_config.h" 3
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__)));
# 31 "/usr/include/libio.h" 2 3
# 48 "/usr/include/libio.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stdarg.h" 1 3
# 49 "/usr/include/libio.h" 2 3
# 154 "/usr/include/libio.h" 3
struct _IO_jump_t; struct _IO_FILE;
# 164 "/usr/include/libio.h" 3
typedef void _IO_lock_t;
struct _IO_marker {
struct _IO_marker *_next;
struct _IO_FILE *_sbuf;
int _pos;
# 187 "/usr/include/libio.h" 3
};
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 _blksize;
__off_t _old_offset;
unsigned short _cur_column;
signed char _vtable_offset;
char _shortbuf[1];
_IO_lock_t *_lock;
# 233 "/usr/include/libio.h" 3
__off64_t _offset;
int _unused2[16];
};
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_;
# 262 "/usr/include/libio.h" 3
typedef __ssize_t __io_read_fn (void * __cookie, char *__buf, size_t __nbytes);
# 271 "/usr/include/libio.h" 3
typedef __ssize_t __io_write_fn (void * __cookie, __const char *__buf, size_t __n);
# 280 "/usr/include/libio.h" 3
typedef int __io_seek_fn (void * __cookie, __off_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
{
struct _IO_FILE __file;
const void *__vtable;
void *__cookie;
_IO_cookie_io_functions_t __io_functions;
};
extern "C" {
extern int __underflow (_IO_FILE *) throw ();
extern int __uflow (_IO_FILE *) throw ();
extern int __overflow (_IO_FILE *, int) throw ();
# 337 "/usr/include/libio.h" 3
extern int _IO_getc (_IO_FILE *__fp) throw ();
extern int _IO_putc (int __c, _IO_FILE *__fp) throw ();
extern int _IO_feof (_IO_FILE *__fp) throw ();
extern int _IO_ferror (_IO_FILE *__fp) throw ();
extern int _IO_peekc_locked (_IO_FILE *__fp) throw ();
extern void _IO_flockfile (_IO_FILE *) throw ();
extern void _IO_funlockfile (_IO_FILE *) throw ();
extern int _IO_ftrylockfile (_IO_FILE *) throw ();
# 363 "/usr/include/libio.h" 3
extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict, __gnuc_va_list, int *__restrict) throw ();
extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict, __gnuc_va_list) throw ();
extern __ssize_t _IO_padn (_IO_FILE *, int, __ssize_t) throw ();
extern size_t _IO_sgetn (_IO_FILE *, void *, size_t) throw ();
extern __off64_t _IO_seekoff (_IO_FILE *, __off64_t, int, int) throw ();
extern __off64_t _IO_seekpos (_IO_FILE *, __off64_t, int) throw ();
extern void _IO_free_backup_area (_IO_FILE *) throw ();
}
# 58 "/usr/include/stdio.h" 2 3
typedef __off_t fpos_t;
typedef __off64_t fpos64_t;
# 110 "/usr/include/stdio.h" 3
# 1 "/usr/include/bits/stdio_lim.h" 1 3
# 111 "/usr/include/stdio.h" 2 3
extern FILE *stdin;
extern FILE *stdout;
extern FILE *stderr;
extern int remove (__const char *__filename) throw ();
extern int rename (__const char *__old, __const char *__new) throw ();
extern FILE *tmpfile (void) throw ();
# 140 "/usr/include/stdio.h" 3
extern FILE *tmpfile64 (void) throw ();
extern char *tmpnam (char *__s) throw ();
extern char *tmpnam_r (char *__s) throw ();
# 160 "/usr/include/stdio.h" 3
extern char *tempnam (__const char *__dir, __const char *__pfx) throw ();
extern int fclose (FILE *__stream) throw ();
extern int fflush (FILE *__stream) throw ();
extern int fflush_unlocked (FILE *__stream) throw ();
extern int fcloseall (void) throw ();
extern FILE *fopen (__const char *__restrict __filename, __const char *__restrict __modes) throw ();
extern FILE *freopen (__const char *__restrict __filename, __const char *__restrict __modes, FILE *__restrict __stream) throw ();
# 203 "/usr/include/stdio.h" 3
extern FILE *fopen64 (__const char *__restrict __filename, __const char *__restrict __modes) throw ();
extern FILE *freopen64 (__const char *__restrict __filename, __const char *__restrict __modes, FILE *__restrict __stream) throw ();
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 *open_memstream (char **__restrict __bufloc, size_t *__restrict __sizeloc) throw ();
extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) throw ();
extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf, int __modes, size_t __n) throw ();
extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf, size_t __size) throw ();
extern void setlinebuf (FILE *__stream) throw ();
extern int fprintf (FILE *__restrict __stream, __const char *__restrict __format, ...) throw ();
extern int printf (__const char *__restrict __format, ...) throw ();
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) throw ();
extern int vprintf (__const char *__restrict __format, __gnuc_va_list __arg) throw ();
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 vsnprintf (char *__restrict __s, size_t __maxlen, __const char *__restrict __format, __gnuc_va_list __arg) throw ()
__attribute__ ((__format__ (__printf__, 3, 0)));
extern int vasprintf (char **__restrict __ptr, __const char *__restrict __f, __gnuc_va_list __arg) throw ()
__attribute__ ((__format__ (__printf__, 2, 0)));
extern int __asprintf (char **__restrict __ptr, __const char *__restrict __fmt, ...) throw ()
__attribute__ ((__format__ (__printf__, 2, 3)));
extern int asprintf (char **__restrict __ptr, __const char *__restrict __fmt, ...) throw ()
__attribute__ ((__format__ (__printf__, 2, 3)));
extern int vdprintf (int __fd, __const char *__restrict __fmt, __gnuc_va_list __arg) throw ()
__attribute__ ((__format__ (__printf__, 2, 0)));
extern int dprintf (int __fd, __const char *__restrict __fmt, ...) throw ()
__attribute__ ((__format__ (__printf__, 2, 3)));
extern int fscanf (FILE *__restrict __stream, __const char *__restrict __format, ...) throw ();
extern int scanf (__const char *__restrict __format, ...) throw ();
extern int sscanf (__const char *__restrict __s, __const char *__restrict __format, ...) throw ();
extern int vfscanf (FILE *__restrict __s, __const char *__restrict __format, __gnuc_va_list __arg) throw ()
__attribute__ ((__format__ (__scanf__, 2, 0)));
extern int vscanf (__const char *__restrict __format, __gnuc_va_list __arg) throw ()
__attribute__ ((__format__ (__scanf__, 1, 0)));
extern int vsscanf (__const char *__restrict __s, __const char *__restrict __format, __gnuc_va_list __arg) throw ()
__attribute__ ((__format__ (__scanf__, 2, 0)));
extern int fgetc (FILE *__stream) throw ();
extern int getc (FILE *__stream) throw ();
extern int getchar (void) throw ();
extern int getc_unlocked (FILE *__stream) throw ();
extern int getchar_unlocked (void) throw ();
extern int fgetc_unlocked (FILE *__stream) throw ();
extern int fputc (int __c, FILE *__stream) throw ();
extern int putc (int __c, FILE *__stream) throw ();
extern int putchar (int __c) throw ();
extern int fputc_unlocked (int __c, FILE *__stream) throw ();
extern int putc_unlocked (int __c, FILE *__stream) throw ();
extern int putchar_unlocked (int __c) throw ();
extern int getw (FILE *__stream) throw ();
extern int putw (int __w, FILE *__stream) throw ();
extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream) throw ();
extern char *fgets_unlocked (char *__restrict __s, int __n, FILE *__restrict __stream) throw ();
extern char *gets (char *__s) throw ();
# 413 "/usr/include/stdio.h" 3
extern __ssize_t __getdelim (char **__restrict __lineptr, size_t *__restrict __n, int __delimiter, FILE *__restrict __stream) throw ();
extern __ssize_t getdelim (char **__restrict __lineptr, size_t *__restrict __n, int __delimiter, FILE *__restrict __stream) throw ();
extern __ssize_t getline (char **__restrict __lineptr, size_t *__restrict __n, FILE *__restrict __stream) throw ();
extern int fputs (__const char *__restrict __s, FILE *__restrict __stream) throw ();
extern int fputs_unlocked (__const char *__restrict __s, FILE *__restrict __stream) throw ();
extern int puts (__const char *__s) throw ();
extern int ungetc (int __c, FILE *__stream) throw ();
extern size_t fread (void *__restrict __ptr, size_t __size, size_t __n, FILE *__restrict __stream) throw ();
extern size_t fwrite (__const void *__restrict __ptr, size_t __size, size_t __n, FILE *__restrict __s) throw ();
extern size_t fread_unlocked (void *__restrict __ptr, size_t __size, size_t __n, FILE *__restrict __stream) throw ();
extern size_t fwrite_unlocked (__const void *__restrict __ptr, size_t __size, size_t __n, FILE *__restrict __stream) throw ();
extern int fseek (FILE *__stream, long int __off, int __whence) throw ();
extern long int ftell (FILE *__stream) throw ();
extern void rewind (FILE *__stream) throw ();
# 477 "/usr/include/stdio.h" 3
typedef __off_t off_t;
typedef __off64_t off64_t;
extern int fseeko (FILE *__stream, __off_t __off, int __whence) throw ();
extern __off_t ftello (FILE *__stream) throw ();
extern int fgetpos (FILE *__restrict __stream, fpos_t *__restrict __pos) throw ();
extern int fsetpos (FILE *__stream, __const fpos_t *__pos) throw ();
# 527 "/usr/include/stdio.h" 3
extern int fseeko64 (FILE *__stream, __off64_t __off, int __whence) throw ();
extern __off64_t ftello64 (FILE *__stream) throw ();
extern int fgetpos64 (FILE *__restrict __stream, fpos64_t *__restrict __pos) throw ();
extern int fsetpos64 (FILE *__stream, __const fpos64_t *__pos) throw ();
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) throw ();
extern int sys_nerr;
extern __const char *__const sys_errlist[];
extern int _sys_nerr;
extern __const char *__const _sys_errlist[];
extern int fileno (FILE *__stream) throw ();
extern int fileno_unlocked (FILE *__stream) throw ();
extern FILE *popen (__const char *__command, __const char *__modes) throw ();
extern int pclose (FILE *__stream) throw ();
extern char *ctermid (char *__s) throw ();
extern char *cuserid (char *__s) throw ();
struct obstack;
extern int obstack_printf (struct obstack *__restrict __obstack, __const char *__restrict __format, ...) throw ();
extern int obstack_vprintf (struct obstack *__restrict __obstack, __const char *__restrict __format, __gnuc_va_list __args) throw ();
# 614 "/usr/include/stdio.h" 3
extern void flockfile (FILE *__stream) throw ();
extern int ftrylockfile (FILE *__stream) throw ();
extern void funlockfile (FILE *__stream) throw ();
# 635 "/usr/include/stdio.h" 3
# 1 "/usr/include/bits/stdio.h" 1 3
# 32 "/usr/include/bits/stdio.h" 3
inline int
vprintf (__const char *__restrict __fmt, __gnuc_va_list __arg) throw ()
{
return vfprintf (stdout, __fmt, __arg);
}
inline int
getchar (void) throw ()
{
return _IO_getc (stdin);
}
inline int
getc_unlocked (FILE *__fp) throw ()
{
return ((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
}
inline int
getchar_unlocked (void) throw ()
{
return ((stdin)->_IO_read_ptr >= (stdin)->_IO_read_end ? __uflow (stdin) : *(unsigned char *) (stdin)->_IO_read_ptr++);
}
inline int
putchar (int __c) throw ()
{
return _IO_putc (__c, stdout);
}
inline int
fputc_unlocked (int __c, FILE *__stream) throw ()
{
return (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
}
inline int
putc_unlocked (int __c, FILE *__stream) throw ()
{
return (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
}
inline int
putchar_unlocked (int __c) throw ()
{
return (((stdout)->_IO_write_ptr >= (stdout)->_IO_write_end) ? __overflow (stdout, (unsigned char) (__c)) : (unsigned char) (*(stdout)->_IO_write_ptr++ = (__c)));
}
inline __ssize_t
getline (char **__lineptr, size_t *__n, FILE *__stream) throw ()
{
return __getdelim (__lineptr, __n, '\n', __stream);
}
inline int
feof_unlocked (FILE *__stream) throw ()
{
return (((__stream)->_flags & 0x10) != 0);
}
inline int
ferror_unlocked (FILE *__stream) throw ()
{
return (((__stream)->_flags & 0x20) != 0);
}
# 636 "/usr/include/stdio.h" 2 3
}
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 2 3
# 94 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 3
namespace std
{
using ::FILE;
using ::fpos_t;
extern "C" int remove(const char*);
extern "C" int rename(const char*, const char*);
extern "C" FILE* tmpfile(void);
extern "C" char* tmpnam(char*);
extern "C" int fclose(FILE*);
extern "C" int fflush(FILE*);
extern "C" FILE* fopen(const char*, const char*);
extern "C" FILE* freopen(const char*, const char*, FILE*);
extern "C" void setbuf(FILE*, char*);
extern "C" int setvbuf(FILE*, char*, int, size_t);
extern "C" int fprintf(FILE*, const char*, ...);
extern "C" int fscanf(FILE*, const char*, ...);
extern "C" int printf(const char*, ...);
extern "C" int scanf(const char*, ...);
extern "C" int snprintf(char *, size_t, const char*, ...);
extern "C" int sprintf(char *, const char*, ...);
extern "C" int sscanf(const char*, const char*, ...);
extern "C" int vfprintf(FILE*, const char*, va_list);
extern "C" int vfscanf(FILE*, const char*, va_list);
extern "C" int vprintf(const char*, va_list);
extern "C" int vscanf(const char*, va_list);
extern "C" int vsnprintf(char*, size_t, const char*, va_list);
extern "C" int vsprintf(char*, const char*, va_list);
extern "C" int vsscanf(const char*, const char*, va_list);
extern "C" int fgetc(FILE *);
extern "C" char *fgets(char*, int, FILE*);
extern "C" int fputc(int, FILE*);
extern "C" int fputs(const char*, FILE*);
extern "C" int getc(FILE*);
extern "C" int getchar(void);
extern "C" char *gets(char*);
extern "C" int putc(int, FILE*);
extern "C" int putchar(int);
extern "C" int puts(const char*);
extern "C" int ungetc(int, FILE*);
extern "C" size_t fread(void*, size_t, size_t, FILE*);
extern "C" size_t fwrite(const void*, size_t, size_t, FILE*);
extern "C" int fgetpos(FILE*, fpos_t*);
extern "C" int fseek(FILE*, long int, int);
extern "C" int fsetpos(FILE*, const fpos_t*);
extern "C" long int ftell(FILE*);
extern "C" void rewind(FILE*);
extern "C" void clearerr(FILE*);
extern "C" int feof(FILE*);
extern "C" int ferror(FILE*);
extern "C" void perror(const char*);
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdarg.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 2 3
# 46 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 3
# 1 "/usr/include/wchar.h" 1 3
# 27 "/usr/include/wchar.h" 3
# 1 "/usr/include/features.h" 1 3
# 28 "/usr/include/wchar.h" 2 3
# 1 "/usr/include/stdio.h" 1 3
# 32 "/usr/include/wchar.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 39 "/usr/include/wchar.h" 2 3
# 53 "/usr/include/wchar.h" 3
typedef struct
{
int count;
wint_t value;
} mbstate_t;
# 77 "/usr/include/wchar.h" 3
struct tm;
extern "C" {
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 ();
extern int wcsncmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw ();
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 ();
# 1 "/usr/include/xlocale.h" 1 3
# 28 "/usr/include/xlocale.h" 3
typedef struct __locale_struct
{
struct locale_data *__locales[6];
const unsigned short int *__ctype_b;
const int *__ctype_tolower;
const int *__ctype_toupper;
} *__locale_t;
# 113 "/usr/include/wchar.h" 2 3
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 ();
# 136 "/usr/include/wchar.h" 3
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 ();
extern wchar_t *wcschr (__const wchar_t *__wcs, wchar_t __wc) throw ();
extern wchar_t *wcsrchr (__const wchar_t *__wcs, wchar_t __wc) throw ();
extern size_t wcscspn (__const wchar_t *__wcs, __const wchar_t *__reject) throw ();
extern size_t wcsspn (__const wchar_t *__wcs, __const wchar_t *__accept) throw ();
extern wchar_t *wcspbrk (__const wchar_t *__wcs, __const wchar_t *__accept) throw ();
extern wchar_t *wcsstr (__const wchar_t *__haystack, __const wchar_t *__needle) throw ();
# 174 "/usr/include/wchar.h" 3
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 ();
extern size_t wcslen (__const wchar_t *__s) throw ();
extern size_t wcsnlen (__const wchar_t *__s, size_t __maxlen) throw ();
extern wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, size_t __n) throw ();
extern int wmemcmp (__const wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw ();
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 wint_t btowc (int __c) throw ();
extern int wctob (wint_t __c) throw ();
extern int mbsinit (__const mbstate_t *__ps) throw ();
extern size_t mbrtowc (wchar_t *__restrict __pwc, __const char *__restrict __s, size_t __n, mbstate_t *__p) throw ();
extern size_t wcrtomb (char *__restrict __s, wchar_t __wc, mbstate_t *__restrict __ps) throw ();
extern size_t __mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw ();
extern size_t mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw ();
extern __inline size_t mbrlen (__const char *__restrict __s, size_t __n,
mbstate_t *__restrict __ps) throw ()
{ return (__ps != __null
? mbrtowc (__null, __s, __n, __ps) : __mbrlen (__s, __n, __null)); }
extern size_t mbsrtowcs (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw ();
extern size_t wcsrtombs (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw ();
extern size_t mbsnrtowcs (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __nmc, size_t __len, mbstate_t *__restrict __ps) throw ();
extern size_t wcsnrtombs (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __nwc, size_t __len, mbstate_t *__restrict __ps) throw ();
# 277 "/usr/include/wchar.h" 3
extern int wcwidth (wint_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 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 ();
__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 ();
# 355 "/usr/include/wchar.h" 3
# 1 "/usr/include/xlocale.h" 1 3
# 356 "/usr/include/wchar.h" 2 3
extern long int __wcstol_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw ();
extern unsigned long int __wcstoul_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw ();
__extension__
extern long long int __wcstoll_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw ();
__extension__
extern unsigned long long int __wcstoull_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw ();
extern double __wcstod_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, __locale_t __loc) throw ();
extern float __wcstof_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, __locale_t __loc) throw ();
extern long double __wcstold_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, __locale_t __loc) throw ();
extern double __wcstod_internal (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __group) throw ();
extern float __wcstof_internal (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __group) throw ();
extern long double __wcstold_internal (__const wchar_t * __restrict __nptr, wchar_t **__restrict __endptr, int __group) throw ();
extern long int __wcstol_internal (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, int __group) throw ();
extern unsigned long int __wcstoul_internal (__const wchar_t * __restrict __nptr, wchar_t ** __restrict __endptr, int __base, int __group) throw ();
__extension__
extern long long int __wcstoll_internal (__const wchar_t * __restrict __nptr, wchar_t **__restrict __endptr, int __base, int __group) throw ();
__extension__
extern unsigned long long int __wcstoull_internal (__const wchar_t * __restrict __nptr, wchar_t ** __restrict __endptr, int __base, int __group) throw ();
# 443 "/usr/include/wchar.h" 3
extern __inline double wcstod (__const wchar_t *__restrict __nptr,
wchar_t **__restrict __endptr) throw ()
{ return __wcstod_internal (__nptr, __endptr, 0); }
extern __inline long int wcstol (__const wchar_t *__restrict __nptr,
wchar_t **__restrict __endptr,
int __base) throw ()
{ return __wcstol_internal (__nptr, __endptr, __base, 0); }
extern __inline unsigned long int wcstoul (__const wchar_t *__restrict __nptr,
wchar_t **__restrict __endptr,
int __base) throw ()
{ return __wcstoul_internal (__nptr, __endptr, __base, 0); }
extern __inline float wcstof (__const wchar_t *__restrict __nptr,
wchar_t **__restrict __endptr) throw ()
{ return __wcstof_internal (__nptr, __endptr, 0); }
extern __inline long double wcstold (__const wchar_t *__restrict __nptr,
wchar_t **__restrict __endptr) throw ()
{ return __wcstold_internal (__nptr, __endptr, 0); }
__extension__
extern __inline long long int wcstoq (__const wchar_t *__restrict __nptr,
wchar_t **__restrict __endptr,
int __base) throw ()
{ return __wcstoll_internal (__nptr, __endptr, __base, 0); }
__extension__
extern __inline unsigned long long int wcstouq (__const wchar_t *
__restrict __nptr,
wchar_t **__restrict __endptr,
int __base) throw ()
{ return __wcstoull_internal (__nptr, __endptr, __base, 0); }
extern wchar_t *wcpcpy (wchar_t *__dest, __const wchar_t *__src) throw ();
extern wchar_t *wcpncpy (wchar_t *__dest, __const wchar_t *__src, size_t __n) throw ();
# 502 "/usr/include/wchar.h" 3
}
# 47 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 2 3
# 62 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 3
namespace std
{
using ::mbstate_t;
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stringfwd.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stringfwd.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stringfwd.h" 2 3
namespace std
{
template<class _CharT>
struct char_traits;
template<typename _Alloc>
class allocator;
template<typename _CharT, typename _Traits = char_traits<_CharT>,
typename _Alloc = allocator<_CharT> >
class basic_string;
typedef basic_string<char> string;
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception_defines.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 2 3
namespace std
{
void
__throw_bad_exception(void);
void
__throw_bad_alloc(void);
void
__throw_bad_cast(void);
void
__throw_bad_typeid(void);
void
__throw_logic_error(const char* __s);
void
__throw_domain_error(const char* __s);
void
__throw_invalid_argument(const char* __s);
void
__throw_length_error(const char* __s);
void
__throw_out_of_range(const char* __s);
void
__throw_runtime_error(const char* __s);
void
__throw_range_error(const char* __s);
void
__throw_overflow_error(const char* __s);
void
__throw_underflow_error(const char* __s);
void
__throw_ios_failure(const char* __s);
}
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 2 3
namespace std
{
template<> class char_traits<char>;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_ios;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_streambuf;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_istream;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_ostream;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_iostream;
template<typename _CharT, typename _Traits = char_traits<_CharT>,
typename _Alloc = allocator<_CharT> >
class basic_stringbuf;
template<typename _CharT, typename _Traits = char_traits<_CharT>,
typename _Alloc = allocator<_CharT> >
class basic_istringstream;
template<typename _CharT, typename _Traits = char_traits<_CharT>,
typename _Alloc = allocator<_CharT> >
class basic_ostringstream;
template<typename _CharT, typename _Traits = char_traits<_CharT>,
typename _Alloc = allocator<_CharT> >
class basic_stringstream;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_filebuf;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_ifstream;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_ofstream;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class basic_fstream;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class istreambuf_iterator;
template<typename _CharT, typename _Traits = char_traits<_CharT> >
class ostreambuf_iterator;
class ios_base;
template<class _State> struct fpos;
typedef fpos<mbstate_t> streampos;
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;
# 147 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 3
}
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception" 3
#pragma interface "exception"
extern "C++" {
namespace std
{
class exception
{
public:
exception() throw() { }
virtual ~exception() throw() { }
virtual const char* what() const throw();
};
class bad_exception : public exception
{
public:
bad_exception() throw() { }
virtual ~bad_exception() throw() { }
};
typedef void (*terminate_handler) ();
typedef void (*unexpected_handler) ();
terminate_handler set_terminate(terminate_handler) throw();
void terminate() __attribute__ ((__noreturn__));
unexpected_handler set_unexpected(unexpected_handler) throw();
void unexpected() __attribute__ ((__noreturn__));
bool uncaught_exception() throw();
}
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cwchar.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 2 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 3
# 1 "/usr/include/string.h" 1 3
# 26 "/usr/include/string.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/string.h" 2 3
extern "C" {
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 34 "/usr/include/string.h" 2 3
extern void * memcpy (void * __restrict __dest, __const void * __restrict __src, size_t __n) throw ();
extern void * memmove (void * __dest, __const void * __src, size_t __n) throw ();
extern void * memccpy (void * __dest, __const void * __src, int __c, size_t __n) throw ();
extern void * memset (void * __s, int __c, size_t __n) throw ();
extern int memcmp (__const void * __s1, __const void * __s2, size_t __n) throw ();
extern void * memchr (__const void * __s, int __c, size_t __n) throw ();
extern void * rawmemchr (__const void * __s, int __c) throw ();
extern char *strcpy (char *__restrict __dest, __const char *__restrict __src) throw ();
extern char *strncpy (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw ();
extern char *strcat (char *__restrict __dest, __const char *__restrict __src) throw ();
extern char *strncat (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw ();
extern int strcmp (__const char *__s1, __const char *__s2) throw ();
extern int strncmp (__const char *__s1, __const char *__s2, size_t __n) throw ();
extern int strcoll (__const char *__s1, __const char *__s2) throw ();
extern size_t strxfrm (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw ();
# 1 "/usr/include/xlocale.h" 1 3
# 100 "/usr/include/string.h" 2 3
extern int __strcoll_l (__const char *__s1, __const char *__s2, __locale_t __l) throw ();
extern size_t __strxfrm_l (char *__dest, __const char *__src, size_t __n, __locale_t __l) throw ();
extern char *__strdup (__const char *__s) throw ();
extern char *strdup (__const char *__s) throw ();
extern char *strndup (__const char *__string, size_t __n) throw ();
# 146 "/usr/include/string.h" 3
extern char *strchr (__const char *__s, int __c) throw ();
extern char *strrchr (__const char *__s, int __c) throw ();
extern char *strchrnul (__const char *__s, int __c) throw ();
extern size_t strcspn (__const char *__s, __const char *__reject) throw ();
extern size_t strspn (__const char *__s, __const char *__accept) throw ();
extern char *strpbrk (__const char *__s, __const char *__accept) throw ();
extern char *strstr (__const char *__haystack, __const char *__needle) throw ();
extern char *__strcasestr (__const char *__haystack, __const char *__needle) throw ();
extern char *strcasestr (__const char *__haystack, __const char *__needle) throw ();
extern char *strtok (char *__restrict __s, __const char *__restrict __delim) throw ();
extern char *__strtok_r (char *__restrict __s, __const char *__restrict __delim, char **__restrict __save_ptr) throw ();
extern char *strtok_r (char *__restrict __s, __const char *__restrict __delim, char **__restrict __save_ptr) throw ();
# 194 "/usr/include/string.h" 3
extern void * memmem (__const void * __haystack, size_t __haystacklen, __const void * __needle, size_t __needlelen) throw ();
extern void * __mempcpy (void * __restrict __dest, __const void * __restrict __src, size_t __n) throw ();
extern void * mempcpy (void * __restrict __dest, __const void * __restrict __src, size_t __n) throw ();
extern size_t strlen (__const char *__s) throw ();
extern size_t strnlen (__const char *__string, size_t __maxlen) throw ();
extern char *strerror (int __errnum) throw ();
extern char *__strerror_r (int __errnum, char *__buf, size_t __buflen) throw ();
extern char *strerror_r (int __errnum, char *__buf, size_t __buflen) throw ();
extern void __bzero (void * __s, size_t __n) throw ();
extern void bcopy (__const void * __src, void * __dest, size_t __n) throw ();
extern void bzero (void * __s, size_t __n) throw ();
extern int bcmp (__const void * __s1, __const void * __s2, size_t __n) throw ();
extern char *index (__const char *__s, int __c) throw ();
extern char *rindex (__const char *__s, int __c) throw ();
extern int __ffs (int __i) throw () __attribute__ ((const));
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 ();
extern int strcasecmp (__const char *__s1, __const char *__s2) throw ();
extern int strncasecmp (__const char *__s1, __const char *__s2, size_t __n) throw ();
extern int __strcasecmp_l (__const char *__s1, __const char *__s2, __locale_t __loc) throw ();
extern int __strncasecmp_l (__const char *__s1, __const char *__s2, size_t __n, __locale_t __loc) throw ();
extern char *strsep (char **__restrict __stringp, __const char *__restrict __delim) throw ();
extern int strverscmp (__const char *__s1, __const char *__s2) throw ();
extern char *strsignal (int __sig) throw ();
extern char *__stpcpy (char *__restrict __dest, __const char *__restrict __src) throw ();
extern char *stpcpy (char *__restrict __dest, __const char *__restrict __src) throw ();
extern char *__stpncpy (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw ();
extern char *stpncpy (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw ();
extern char *strfry (char *__string) throw ();
extern void * memfrob (void * __s, size_t __n) throw ();
extern char *basename (__const char *__filename) throw ();
# 350 "/usr/include/string.h" 3
}
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 2 3
# 69 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 3
namespace std
{
extern "C" void* memcpy(void*, const void*, size_t);
extern "C" void* memmove(void*, const void*, size_t);
extern "C" char* strcpy(char*, const char*);
extern "C" char* strncpy(char*, const char*, size_t);
extern "C" char* strcat(char*, const char*);
extern "C" char* strncat(char*, const char*, size_t);
extern "C" int memcmp(const void*, const void*, size_t);
extern "C" int strcmp(const char*, const char*);
extern "C" int strcoll(const char*, const char*);
extern "C" int strncmp(const char*, const char*, size_t);
extern "C" size_t strxfrm(char*, const char*, size_t);
extern "C" void* memchr(const void*, int, size_t);
extern "C" char* strchr(const char*, int);
extern "C" size_t strcspn(const char*, const char*);
extern "C" char* strpbrk(const char*, const char*);
extern "C" char* strrchr(const char*, int);
extern "C" size_t strspn(const char*, const char*);
extern "C" char* strstr(const char*, const char*);
extern "C" char* strtok(char*, const char*);
extern "C" void* memset(void*, int, size_t);
extern "C" char* strerror(int);
extern "C" size_t strlen(const char*);
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/fpos.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/fpos.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++io.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++io.h" 3
# 1 "/usr/include/stdio.h" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++io.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++io.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++threads.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++threads.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++threads.h" 2 3
# 1 "/usr/include/pthread.h" 1 3
# 18 "/usr/include/pthread.h" 3
# 1 "/usr/include/features.h" 1 3
# 19 "/usr/include/pthread.h" 2 3
# 1 "/usr/include/sched.h" 1 3
# 23 "/usr/include/sched.h" 3
# 1 "/usr/include/features.h" 1 3
# 24 "/usr/include/sched.h" 2 3
# 1 "/usr/include/bits/types.h" 1 3
# 27 "/usr/include/sched.h" 2 3
# 1 "/usr/include/time.h" 1 3
# 83 "/usr/include/time.h" 3
struct timespec
{
long int tv_sec;
long int tv_nsec;
};
# 30 "/usr/include/sched.h" 2 3
# 1 "/usr/include/bits/sched.h" 1 3
# 47 "/usr/include/bits/sched.h" 3
struct sched_param
{
int sched_priority;
};
extern "C" {
extern int clone (int (*__fn) (void *__arg), void *__child_stack, int __flags, void *__arg) throw ();
}
# 33 "/usr/include/sched.h" 2 3
extern "C" {
extern int __sched_setparam (__pid_t __pid, __const struct sched_param *__param) throw ();
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_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_setscheduler (__pid_t __pid, int __policy, __const struct sched_param *__param) throw ();
extern int __sched_getscheduler (__pid_t __pid) throw ();
extern int sched_getscheduler (__pid_t __pid) throw ();
extern int __sched_yield (void) throw ();
extern int sched_yield (void) throw ();
extern int __sched_get_priority_max (int __algorithm) throw ();
extern int sched_get_priority_max (int __algorithm) throw ();
extern int __sched_get_priority_min (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 ();
extern int sched_rr_get_interval (__pid_t __pid, struct timespec *__t) throw ();
}
# 21 "/usr/include/pthread.h" 2 3
# 1 "/usr/include/time.h" 1 3
# 28 "/usr/include/time.h" 3
# 1 "/usr/include/features.h" 1 3
# 29 "/usr/include/time.h" 2 3
extern "C" {
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 39 "/usr/include/time.h" 2 3
# 1 "/usr/include/bits/time.h" 1 3
# 43 "/usr/include/time.h" 2 3
# 57 "/usr/include/time.h" 3
# 1 "/usr/include/bits/types.h" 1 3
# 58 "/usr/include/time.h" 2 3
typedef __clock_t clock_t;
# 1 "/usr/include/bits/types.h" 1 3
# 69 "/usr/include/time.h" 2 3
typedef __time_t time_t;
# 95 "/usr/include/time.h" 3
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;
};
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 *__s, __const char *__fmt, struct tm *__tp) 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 *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 ();
# 228 "/usr/include/time.h" 3
extern time_t timegm (struct tm *__tp) throw ();
extern time_t timelocal (struct tm *__tp) throw ();
extern int dysize (int __year) throw ();
extern int nanosleep (__const struct timespec *__requested_time, struct timespec *__remaining) throw ();
# 257 "/usr/include/time.h" 3
extern int getdate_err;
extern struct tm *getdate (__const char *__string) throw ();
# 272 "/usr/include/time.h" 3
extern int getdate_r (__const char *__restrict __string, struct tm *__restrict __resbufp) throw ();
}
# 22 "/usr/include/pthread.h" 2 3
# 1 "/usr/include/signal.h" 1 3
# 29 "/usr/include/signal.h" 3
# 1 "/usr/include/features.h" 1 3
# 30 "/usr/include/signal.h" 2 3
extern "C" {
# 1 "/usr/include/bits/sigset.h" 1 3
# 23 "/usr/include/bits/sigset.h" 3
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
# 49 "/usr/include/signal.h" 3
typedef __sigset_t sigset_t;
# 362 "/usr/include/signal.h" 3
}
# 25 "/usr/include/pthread.h" 2 3
# 1 "/usr/include/bits/pthreadtypes.h" 1 3
# 26 "/usr/include/pthread.h" 2 3
extern "C" {
# 49 "/usr/include/pthread.h" 3
enum
{
PTHREAD_CREATE_JOINABLE,
PTHREAD_CREATE_DETACHED
};
enum
{
PTHREAD_INHERIT_SCHED,
PTHREAD_EXPLICIT_SCHED
};
enum
{
PTHREAD_SCOPE_SYSTEM,
PTHREAD_SCOPE_PROCESS
};
enum
{
PTHREAD_MUTEX_FAST_NP,
PTHREAD_MUTEX_RECURSIVE_NP,
PTHREAD_MUTEX_ERRORCHECK_NP
,
PTHREAD_MUTEX_NORMAL = PTHREAD_MUTEX_FAST_NP,
PTHREAD_MUTEX_RECURSIVE = PTHREAD_MUTEX_RECURSIVE_NP,
PTHREAD_MUTEX_ERRORCHECK = PTHREAD_MUTEX_ERRORCHECK_NP,
PTHREAD_MUTEX_DEFAULT = PTHREAD_MUTEX_NORMAL
};
enum
{
PTHREAD_PROCESS_PRIVATE,
PTHREAD_PROCESS_SHARED
};
enum
{
PTHREAD_RWLOCK_PREFER_READER_NP,
PTHREAD_RWLOCK_PREFER_WRITER_NP,
PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP,
PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_WRITER_NP
};
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
};
# 141 "/usr/include/pthread.h" 3
extern int pthread_create (pthread_t *__thread, __const pthread_attr_t *__attr, void *(*__start_routine) (void *), void *__arg) throw ();
extern pthread_t pthread_self (void) throw ();
extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw ();
extern void pthread_exit (void *__retval) throw () __attribute__ ((__noreturn__));
extern int pthread_join (pthread_t __th, void **__thread_return) throw ();
extern int pthread_detach (pthread_t __th) throw ();
extern int pthread_attr_init (pthread_attr_t *__attr) throw ();
extern int pthread_attr_destroy (pthread_attr_t *__attr) throw ();
extern int pthread_attr_setdetachstate (pthread_attr_t *__attr, int __detachstate) throw ();
extern int pthread_attr_getdetachstate (__const pthread_attr_t *__attr, int *__detachstate) throw ();
extern int pthread_attr_setschedparam (pthread_attr_t *__attr, __const struct sched_param *__param) throw ();
extern int pthread_attr_getschedparam (__const pthread_attr_t *__attr, struct sched_param *__param) throw ();
extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy) throw ();
extern int pthread_attr_getschedpolicy (__const pthread_attr_t *__attr, int *__policy) throw ();
extern int pthread_attr_setinheritsched (pthread_attr_t *__attr, int __inherit) throw ();
extern int pthread_attr_getinheritsched (__const pthread_attr_t *__attr, int *__inherit) throw ();
extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope) throw ();
extern int pthread_attr_getscope (__const pthread_attr_t *__attr, int *__scope) throw ();
extern int pthread_attr_setguardsize (pthread_attr_t *__attr, size_t __guardsize) throw ();
extern int pthread_attr_getguardsize (__const pthread_attr_t *__attr, size_t *__guardsize) throw ();
extern int pthread_attr_setstackaddr (pthread_attr_t *__attr, void *__stackaddr) throw ();
extern int pthread_attr_getstackaddr (__const pthread_attr_t *__attr, void **__stackaddr) throw ();
extern int pthread_attr_setstacksize (pthread_attr_t *__attr, size_t __stacksize) throw ();
extern int pthread_attr_getstacksize (__const pthread_attr_t *__attr, size_t *__stacksize) throw ();
extern int pthread_setschedparam (pthread_t __target_thread, int __policy, __const struct sched_param *__param) throw ();
extern int pthread_getschedparam (pthread_t __target_thread, int *__policy, struct sched_param *__param) throw ();
extern int pthread_getconcurrency (void) throw ();
extern int pthread_setconcurrency (int __level) throw ();
extern int __pthread_mutex_init (pthread_mutex_t *__mutex, __const pthread_mutexattr_t *__mutex_attr) throw ();
extern int pthread_mutex_init (pthread_mutex_t *__mutex, __const pthread_mutexattr_t *__mutex_attr) throw ();
extern int __pthread_mutex_destroy (pthread_mutex_t *__mutex) throw ();
extern int pthread_mutex_destroy (pthread_mutex_t *__mutex) throw ();
extern int __pthread_mutex_trylock (pthread_mutex_t *__mutex) throw ();
extern int pthread_mutex_trylock (pthread_mutex_t *__mutex) throw ();
extern int __pthread_mutex_lock (pthread_mutex_t *__mutex) throw ();
extern int pthread_mutex_lock (pthread_mutex_t *__mutex) throw ();
extern int __pthread_mutex_unlock (pthread_mutex_t *__mutex) throw ();
extern int pthread_mutex_unlock (pthread_mutex_t *__mutex) throw ();
extern int __pthread_mutexattr_init (pthread_mutexattr_t *__attr) throw ();
extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr) throw ();
extern int __pthread_mutexattr_destroy (pthread_mutexattr_t *__attr) throw ();
extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr) throw ();
extern int __pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind) throw ();
extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind) throw ();
extern int pthread_mutexattr_gettype (__const pthread_mutexattr_t *__attr, int *__kind) throw ();
# 323 "/usr/include/pthread.h" 3
extern int pthread_cond_init (pthread_cond_t *__cond, __const pthread_condattr_t *__cond_attr) throw ();
extern int pthread_cond_destroy (pthread_cond_t *__cond) throw ();
extern int pthread_cond_signal (pthread_cond_t *__cond) throw ();
extern int pthread_cond_broadcast (pthread_cond_t *__cond) throw ();
extern int pthread_cond_wait (pthread_cond_t *__cond, pthread_mutex_t *__mutex) throw ();
extern int pthread_cond_timedwait (pthread_cond_t *__cond, pthread_mutex_t *__mutex, __const struct timespec *__abstime) throw ();
extern int pthread_condattr_init (pthread_condattr_t *__attr) throw ();
extern int pthread_condattr_destroy (pthread_condattr_t *__attr) throw ();
extern int pthread_rwlock_init (pthread_rwlock_t *__rwlock, __const pthread_rwlockattr_t *__attr) throw ();
extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock) throw ();
extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock) throw ();
extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock) throw ();
extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock) throw ();
extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock) throw ();
extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock) throw ();
extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr) throw ();
extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr) throw ();
extern int pthread_rwlockattr_getpshared (__const pthread_rwlockattr_t *__attr, int *__pshared) throw ();
extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr, int __pshared) throw ();
extern int pthread_rwlockattr_getkind_np (__const pthread_rwlockattr_t *__attr, int *__pref) throw ();
extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr, int __pref) throw ();
# 420 "/usr/include/pthread.h" 3
extern int __pthread_key_create (pthread_key_t *__key, void (*__destr_function) (void *)) throw ();
extern int pthread_key_create (pthread_key_t *__key, void (*__destr_function) (void *)) throw ();
extern int pthread_key_delete (pthread_key_t __key) throw ();
extern int __pthread_setspecific (pthread_key_t __key, __const void *__pointer) throw ();
extern int pthread_setspecific (pthread_key_t __key, __const void *__pointer) throw ();
extern void *__pthread_getspecific (pthread_key_t __key) throw ();
extern void *pthread_getspecific (pthread_key_t __key) throw ();
# 445 "/usr/include/pthread.h" 3
extern int __pthread_once (pthread_once_t *__once_control, void (*__init_routine) (void)) throw ();
extern int pthread_once (pthread_once_t *__once_control, void (*__init_routine) (void)) throw ();
extern int pthread_setcancelstate (int __state, int *__oldstate) throw ();
extern int pthread_setcanceltype (int __type, int *__oldtype) throw ();
extern int pthread_cancel (pthread_t __thread) throw ();
extern void pthread_testcancel (void) throw ();
# 481 "/usr/include/pthread.h" 3
extern void _pthread_cleanup_push (struct _pthread_cleanup_buffer *__buffer, void (*__routine) (void *), void *__arg) throw ();
# 491 "/usr/include/pthread.h" 3
extern void _pthread_cleanup_pop (struct _pthread_cleanup_buffer *__buffer, int __execute) throw ();
# 502 "/usr/include/pthread.h" 3
extern void _pthread_cleanup_push_defer (struct _pthread_cleanup_buffer *__buffer, void (*__routine) (void *), void *__arg) throw ();
# 513 "/usr/include/pthread.h" 3
extern void _pthread_cleanup_pop_restore (struct _pthread_cleanup_buffer *__buffer, int __execute) throw ();
# 1 "/usr/include/bits/sigthread.h" 1 3
# 31 "/usr/include/bits/sigthread.h" 3
extern int pthread_sigmask (int __how, __const __sigset_t *__newmask, __sigset_t *__oldmask) throw ();
extern int pthread_kill (pthread_t __thread, int __signo) throw ();
# 519 "/usr/include/pthread.h" 2 3
# 534 "/usr/include/pthread.h" 3
extern int __pthread_atfork (void (*__prepare) (void), void (*__parent) (void), void (*__child) (void)) throw ();
extern int pthread_atfork (void (*__prepare) (void), void (*__parent) (void), void (*__child) (void)) throw ();
extern void pthread_kill_other_threads_np (void) throw ();
extern void __pthread_initialize (void) throw ();
}
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++threads.h" 2 3
# 64 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++threads.h" 3
namespace std {
typedef pthread_mutex_t __mutext_type;
}
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++io.h" 2 3
namespace std
{
typedef long streamoff;
typedef ptrdiff_t streamsize;
typedef fpos_t __c_streampos;
typedef __mutext_type __c_lock;
typedef FILE __c_file_type;
struct __ios_flags
{
typedef short __int_type;
static const __int_type _S_boolalpha = 0x0001;
static const __int_type _S_dec = 0x0002;
static const __int_type _S_fixed = 0x0004;
static const __int_type _S_hex = 0x0008;
static const __int_type _S_internal = 0x0010;
static const __int_type _S_left = 0x0020;
static const __int_type _S_oct = 0x0040;
static const __int_type _S_right = 0x0080;
static const __int_type _S_scientific = 0x0100;
static const __int_type _S_showbase = 0x0200;
static const __int_type _S_showpoint = 0x0400;
static const __int_type _S_showpos = 0x0800;
static const __int_type _S_skipws = 0x1000;
static const __int_type _S_unitbuf = 0x2000;
static const __int_type _S_uppercase = 0x4000;
static const __int_type _S_adjustfield = 0x0020 | 0x0080 | 0x0010;
static const __int_type _S_basefield = 0x0002 | 0x0040 | 0x0008;
static const __int_type _S_floatfield = 0x0100 | 0x0004;
static const __int_type _S_badbit = 0x01;
static const __int_type _S_eofbit = 0x02;
static const __int_type _S_failbit = 0x04;
static const __int_type _S_app = 0x01;
static const __int_type _S_ate = 0x02;
static const __int_type _S_bin = 0x04;
static const __int_type _S_in = 0x08;
static const __int_type _S_out = 0x10;
static const __int_type _S_trunc = 0x20;
};
}
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/fpos.h" 2 3
namespace std {
template<typename _StateT>
class fpos
{
public:
typedef _StateT __state_type;
private:
__state_type _M_st;
streamoff _M_off;
public:
__state_type
state() const { return _M_st; }
void
state(__state_type __st) { _M_st = __st; }
fpos(): _M_st(__state_type()), _M_off(streamoff()) { }
fpos(streamoff __off, __state_type __st = __state_type())
: _M_st(__st), _M_off(__off) { }
operator streamoff() const { return _M_off; }
fpos&
operator+=(streamoff __off) { _M_off += __off; return *this; }
fpos&
operator-=(streamoff __off) { _M_off -= __off; return *this; }
bool
operator==(const fpos& __pos) const { return _M_off == __pos._M_off; }
bool
operator!=(const fpos& __pos) const { return _M_off != __pos._M_off; }
streamoff
_M_position() const { return _M_off; }
void
_M_position(streamoff __off) { _M_off = __off; }
};
template<typename _State>
inline fpos<_State>
operator+(const fpos<_State>& __pos, streamoff __off)
{
fpos<_State> t(__pos);
return t += __off;
}
template<typename _State>
inline fpos<_State>
operator-(const fpos<_State>& __pos, streamoff __off)
{
fpos<_State> t(__pos);
return t -= __off;
}
template<typename _State>
inline streamoff
operator-(const fpos<_State>& __pos1, const fpos<_State>& __pos2)
{ return __pos1._M_position() - __pos2._M_position(); }
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 2 3
namespace std {
typedef fpos<mbstate_t> streampos;
# 61 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 3
template<class _CharT>
struct char_traits
{
typedef _CharT char_type;
typedef unsigned long 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)
{
for (size_t __i = 0; __i < __n; ++__i)
if (!eq(__s1[__i], __s2[__i]))
return lt(__s1[__i], __s2[__i]) ? -1 : 1;
return 0;
}
static size_t
length(const char_type* __s)
{
const char_type* __p = __s;
while (*__p) ++__p;
return (__p - __s);
}
static const char_type*
find(const char_type* __s, size_t __n, const char_type& __a)
{
for (const char_type* __p = __s; size_t(__p - __s) < __n; ++__p)
if (*__p == __a) return __p;
return 0;
}
static char_type*
move(char_type* __s1, const char_type* __s2, size_t __n)
{ return (char_type*) memmove(__s1, __s2, __n * sizeof(char_type)); }
static char_type*
copy(char_type* __s1, const char_type* __s2, size_t __n)
{ return (char_type*) memcpy(__s1, __s2, __n * sizeof(char_type)); }
static char_type*
assign(char_type* __s, size_t __n, char_type __a)
{
for (char_type* __p = __s; __p < __s + __n; ++__p)
assign(*__p, __a);
return __s;
}
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>(-1); }
static int_type
not_eof(const int_type& __c)
{ return eq_int_type(__c, eof()) ? int_type(0) : __c; }
};
template<>
struct char_traits<char>
{
typedef char char_type;
typedef int int_type;
typedef streampos pos_type;
typedef streamoff off_type;
typedef mbstate_t state_type;
static void
assign(char_type& __c1, const char_type& __c2)
{ __c1 = __c2; }
static bool
eq(const char_type& __c1, const char_type& __c2)
{ return __c1 == __c2; }
static bool
lt(const char_type& __c1, const char_type& __c2)
{ return __c1 < __c2; }
static int
compare(const char_type* __s1, const char_type* __s2, size_t __n)
{ return memcmp(__s1, __s2, __n); }
static size_t
length(const char_type* __s)
{ return strlen(__s); }
static const char_type*
find(const char_type* __s, size_t __n, const char_type& __a)
{ return static_cast<const char_type*>(memchr(__s, __a, __n)); }
static char_type*
move(char_type* __s1, const char_type* __s2, size_t __n)
{ return static_cast<char_type*>(memmove(__s1, __s2, __n)); }
static char_type*
copy(char_type* __s1, const char_type* __s2, size_t __n)
{ return static_cast<char_type*>(memcpy(__s1, __s2, __n)); }
static char_type*
assign(char_type* __s, size_t __n, char_type __a)
{ return static_cast<char_type*>(memset(__s, __a, __n)); }
static char_type
to_char_type(const int_type& __c)
{ return static_cast<char_type>(__c); }
static int_type
to_int_type(const char_type& __c)
{ return static_cast<int_type>(static_cast<unsigned char>(__c)); }
static bool
eq_int_type(const int_type& __c1, const int_type& __c2)
{ return __c1 == __c2; }
static int_type
eof() { return static_cast<int_type>((-1)); }
static int_type
not_eof(const int_type& __c)
{ return (__c == eof()) ? 0 : __c; }
};
# 278 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 3
template<typename _CharT, typename _Traits>
struct _Char_traits_match
{
_CharT _M_c;
_Char_traits_match(_CharT const& __c) : _M_c(__c) { }
bool
operator()(_CharT const& __a) { return _Traits::eq(_M_c, __a); }
};
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++locale.h" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++locale.h" 3
namespace std
{
typedef int* __c_locale;
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_climits.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_climits.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/limits.h" 1 3
# 11 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/limits.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/syslimits.h" 1 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/limits.h" 1 3
# 130 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/limits.h" 3
# 1 "/usr/include/limits.h" 1 3
# 26 "/usr/include/limits.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/limits.h" 2 3
# 1 "/usr/include/bits/posix1_lim.h" 1 3
# 126 "/usr/include/bits/posix1_lim.h" 3
# 1 "/usr/include/bits/local_lim.h" 1 3
# 27 "/usr/include/bits/local_lim.h" 3
# 1 "/usr/include/linux/limits.h" 1 3
# 28 "/usr/include/bits/local_lim.h" 2 3
# 127 "/usr/include/bits/posix1_lim.h" 2 3
# 31 "/usr/include/limits.h" 2 3
# 1 "/usr/include/bits/posix2_lim.h" 1 3
# 35 "/usr/include/limits.h" 2 3
# 1 "/usr/include/bits/xopen_lim.h" 1 3
# 34 "/usr/include/bits/xopen_lim.h" 3
# 1 "/usr/include/bits/stdio_lim.h" 1 3
# 35 "/usr/include/bits/xopen_lim.h" 2 3
# 39 "/usr/include/limits.h" 2 3
# 131 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/limits.h" 2 3
# 8 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/syslimits.h" 2 3
# 12 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/limits.h" 2 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_climits.h" 2 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stringfwd.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/char_traits.h" 1 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_config.h" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/concept_checks.h" 1 3
# 232 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/concept_checks.h" 3
template <class _Tp>
struct _Mutable_trait {
typedef _Tp _Type;
};
template <class _Tp>
struct _Mutable_trait<const _Tp> {
typedef _Tp _Type;
};
template <class _Type>
void __sink_unused_warning(_Type) { }
template <class _TypeX, class _TypeY>
struct _STL_CONVERT_ERROR {
static void
__type_X_is_not_convertible_to_type_Y(_TypeX __x, _TypeY) {
_TypeY __y = __x;
__sink_unused_warning(__y);
}
};
template <class _Type> struct __check_equal { };
template <class _TypeX, class _TypeY>
struct _STL_SAME_TYPE_ERROR {
static void
__type_X_not_same_as_type_Y(_TypeX , _TypeY ) {
__check_equal<_TypeX> t1 = __check_equal<_TypeY>();
}
};
template <class _Func, class _Ret>
struct _STL_GENERATOR_ERROR {
static _Ret __generator_requirement_violation(_Func& __f) {
return __f();
}
};
template <class _Func>
struct _STL_GENERATOR_ERROR<_Func, void> {
static void __generator_requirement_violation(_Func& __f) {
__f();
}
};
template <class _Func, class _Ret, class _Arg>
struct _STL_UNARY_FUNCTION_ERROR {
static _Ret
__unary_function_requirement_violation(_Func& __f,
const _Arg& __arg) {
return __f(__arg);
}
};
template <class _Func, class _Arg>
struct _STL_UNARY_FUNCTION_ERROR<_Func, void, _Arg> {
static void
__unary_function_requirement_violation(_Func& __f,
const _Arg& __arg) {
__f(__arg);
}
};
template <class _Func, class _Ret, class _First, class _Second>
struct _STL_BINARY_FUNCTION_ERROR {
static _Ret
__binary_function_requirement_violation(_Func& __f,
const _First& __first,
const _Second& __second) {
return __f(__first, __second);
}
};
template <class _Func, class _First, class _Second>
struct _STL_BINARY_FUNCTION_ERROR<_Func, void, _First, _Second> {
static void
__binary_function_requirement_violation(_Func& __f,
const _First& __first,
const _Second& __second) {
__f(__first, __second);
}
};
# 338 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/concept_checks.h" 3
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_EQUAL_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first == __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first == __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_NOT_EQUAL_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first != __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first != __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_LESS_THAN_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first < __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first < __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_LESS_EQUAL_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first <= __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first <= __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_GREATER_THAN_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first > __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first > __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_GREATER_EQUAL_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first >= __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first >= __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_PLUS_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first + __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first + __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_TIMES_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first * __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first * __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_DIVIDE_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first / __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first / __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_SUBTRACT_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first - __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first - __second; } };
template <class _Ret, class _First, class _Second> struct _STL_BINARY_OP_MOD_ERROR { static _Ret __const_binary_operator_requirement_violation(const _First& __first, const _Second& __second) { return __first % __second; } static _Ret __binary_operator_requirement_violation(_First& __first, _Second& __second) { return __first % __second; } };
# 360 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/concept_checks.h" 3
struct _STL_ERROR {
template <class _Type>
static _Type
__default_constructor_requirement_violation(_Type) {
return _Type();
}
template <class _Type>
static _Type
__assignment_operator_requirement_violation(_Type __a) {
__a = __a;
return __a;
}
template <class _Type>
static _Type
__copy_constructor_requirement_violation(_Type __a) {
_Type __c(__a);
return __c;
}
template <class _Type>
static _Type
__const_parameter_required_for_copy_constructor(_Type ,
const _Type& __b) {
_Type __c(__b);
return __c;
}
template <class _Type>
static _Type
__const_parameter_required_for_assignment_operator(_Type __a,
const _Type& __b) {
__a = __b;
return __a;
}
template <class _Type>
static _Type
__less_than_comparable_requirement_violation(_Type __a, _Type __b) {
if (__a < __b) return __a;
return __b;
}
template <class _Type>
static _Type
__equality_comparable_requirement_violation(_Type __a, _Type __b) {
if (__a == __b || __a != __b) return __a;
return __b;
}
template <class _Iterator>
static void
__dereference_operator_requirement_violation(_Iterator __i) {
__sink_unused_warning(*__i);
}
template <class _Iterator>
static void
__dereference_operator_and_assignment_requirement_violation(_Iterator __i) {
*__i = *__i;
}
template <class _Iterator>
static void
__preincrement_operator_requirement_violation(_Iterator __i) {
++__i;
}
template <class _Iterator>
static void
__postincrement_operator_requirement_violation(_Iterator __i) {
__i++;
}
template <class _Iterator>
static void
__predecrement_operator_requirement_violation(_Iterator __i) {
--__i;
}
template <class _Iterator>
static void
__postdecrement_operator_requirement_violation(_Iterator __i) {
__i--;
}
template <class _Iterator, class _Type>
static void
__postincrement_operator_and_assignment_requirement_violation(_Iterator __i,
_Type __t) {
*__i++ = __t;
}
template <class _Iterator, class _Distance>
static _Iterator
__iterator_addition_assignment_requirement_violation(_Iterator __i,
_Distance __n) {
__i += __n;
return __i;
}
template <class _Iterator, class _Distance>
static _Iterator
__iterator_addition_requirement_violation(_Iterator __i, _Distance __n) {
__i = __i + __n;
__i = __n + __i;
return __i;
}
template <class _Iterator, class _Distance>
static _Iterator
__iterator_subtraction_assignment_requirement_violation(_Iterator __i,
_Distance __n) {
__i -= __n;
return __i;
}
template <class _Iterator, class _Distance>
static _Iterator
__iterator_subtraction_requirement_violation(_Iterator __i, _Distance __n) {
__i = __i - __n;
return __i;
}
template <class _Iterator, class _Distance>
static _Distance
__difference_operator_requirement_violation(_Iterator __i, _Iterator __j,
_Distance __n) {
__n = __i - __j;
return __n;
}
template <class _Exp, class _Type, class _Distance>
static _Type
__element_access_operator_requirement_violation(_Exp __x, _Type*,
_Distance __n) {
return __x[__n];
}
template <class _Exp, class _Type, class _Distance>
static void
__element_assignment_operator_requirement_violation(_Exp __x,
_Type* __t,
_Distance __n) {
__x[__n] = *__t;
}
};
namespace std {
template <class _Iterator> struct iterator_traits;
}
template <class _Iter>
struct __value_type_type_definition_requirement_violation {
typedef typename std::iterator_traits<_Iter>::value_type value_type;
};
template <class _Iter>
struct __difference_type_type_definition_requirement_violation {
typedef typename std::iterator_traits<_Iter>::difference_type
difference_type;
};
template <class _Iter>
struct __reference_type_definition_requirement_violation {
typedef typename std::iterator_traits<_Iter>::reference reference;
};
template <class _Iter>
struct __pointer_type_definition_requirement_violation {
typedef typename std::iterator_traits<_Iter>::pointer pointer;
};
template <class _Iter>
struct __iterator_category_type_definition_requirement_violation {
typedef typename std::iterator_traits<_Iter>::iterator_category
iterator_category;
};
template <class _Type>
struct _Assignable_concept_specification {
static void _Assignable_requirement_violation(_Type __a) {
_STL_ERROR::__assignment_operator_requirement_violation(__a);
_STL_ERROR::__copy_constructor_requirement_violation(__a);
_STL_ERROR::__const_parameter_required_for_copy_constructor(__a,__a);
_STL_ERROR::__const_parameter_required_for_assignment_operator(__a,__a);
}
};
template <class _Type>
struct _DefaultConstructible_concept_specification {
static void _DefaultConstructible_requirement_violation(_Type __a) {
_STL_ERROR::__default_constructor_requirement_violation(__a);
}
};
template <class _Type>
struct _EqualityComparable_concept_specification {
static void _EqualityComparable_requirement_violation(_Type __a) {
_STL_ERROR::__equality_comparable_requirement_violation(__a, __a);
}
};
template <class _Type>
struct _LessThanComparable_concept_specification {
static void _LessThanComparable_requirement_violation(_Type __a) {
_STL_ERROR::__less_than_comparable_requirement_violation(__a, __a);
}
};
template <class _TrivialIterator>
struct _TrivialIterator_concept_specification {
static void
_TrivialIterator_requirement_violation(_TrivialIterator __i) {
typedef typename
__value_type_type_definition_requirement_violation<_TrivialIterator>::
value_type __T;
_Assignable_concept_specification<_TrivialIterator>::
_Assignable_requirement_violation(__i);
_DefaultConstructible_concept_specification<_TrivialIterator>::
_DefaultConstructible_requirement_violation(__i);
_EqualityComparable_concept_specification<_TrivialIterator>::
_EqualityComparable_requirement_violation(__i);
_STL_ERROR::__dereference_operator_requirement_violation(__i);
}
};
template <class _TrivialIterator>
struct _Mutable_TrivialIterator_concept_specification {
static void
_Mutable_TrivialIterator_requirement_violation(_TrivialIterator __i) {
_TrivialIterator_concept_specification<_TrivialIterator>::
_TrivialIterator_requirement_violation(__i);
_STL_ERROR::__dereference_operator_and_assignment_requirement_violation(__i);
}
};
template <class _InputIterator>
struct _InputIterator_concept_specification {
static void
_InputIterator_requirement_violation(_InputIterator __i) {
_TrivialIterator_concept_specification<_InputIterator>::
_TrivialIterator_requirement_violation(__i);
__difference_type_type_definition_requirement_violation<_InputIterator>();
__reference_type_definition_requirement_violation<_InputIterator>();
__pointer_type_definition_requirement_violation<_InputIterator>();
__iterator_category_type_definition_requirement_violation<_InputIterator>();
_STL_ERROR::__preincrement_operator_requirement_violation(__i);
_STL_ERROR::__postincrement_operator_requirement_violation(__i);
}
};
template <class _OutputIterator>
struct _OutputIterator_concept_specification {
static void
_OutputIterator_requirement_violation(_OutputIterator __i) {
_Assignable_concept_specification<_OutputIterator>::
_Assignable_requirement_violation(__i);
__iterator_category_type_definition_requirement_violation<_OutputIterator>();
_STL_ERROR::__dereference_operator_requirement_violation(__i);
_STL_ERROR::__preincrement_operator_requirement_violation(__i);
_STL_ERROR::__postincrement_operator_requirement_violation(__i);
_STL_ERROR::
__postincrement_operator_and_assignment_requirement_violation(__i, *__i);
}
};
template <class _ForwardIterator>
struct _ForwardIterator_concept_specification {
static void
_ForwardIterator_requirement_violation(_ForwardIterator __i) {
_InputIterator_concept_specification<_ForwardIterator>::
_InputIterator_requirement_violation(__i);
}
};
template <class _ForwardIterator>
struct _Mutable_ForwardIterator_concept_specification {
static void
_Mutable_ForwardIterator_requirement_violation(_ForwardIterator __i) {
_ForwardIterator_concept_specification<_ForwardIterator>::
_ForwardIterator_requirement_violation(__i);
_OutputIterator_concept_specification<_ForwardIterator>::
_OutputIterator_requirement_violation(__i);
}
};
template <class _BidirectionalIterator>
struct _BidirectionalIterator_concept_specification {
static void
_BidirectionalIterator_requirement_violation(_BidirectionalIterator __i) {
_ForwardIterator_concept_specification<_BidirectionalIterator>::
_ForwardIterator_requirement_violation(__i);
_STL_ERROR::__predecrement_operator_requirement_violation(__i);
_STL_ERROR::__postdecrement_operator_requirement_violation(__i);
}
};
template <class _BidirectionalIterator>
struct _Mutable_BidirectionalIterator_concept_specification {
static void
_Mutable_BidirectionalIterator_requirement_violation(
_BidirectionalIterator __i)
{
_BidirectionalIterator_concept_specification<_BidirectionalIterator>::
_BidirectionalIterator_requirement_violation(__i);
_Mutable_ForwardIterator_concept_specification<_BidirectionalIterator>::
_Mutable_ForwardIterator_requirement_violation(__i);
typedef typename
__value_type_type_definition_requirement_violation<
_BidirectionalIterator>::value_type __T;
typename _Mutable_trait<__T>::_Type* __tmp_ptr = 0;
_STL_ERROR::
__postincrement_operator_and_assignment_requirement_violation(__i,
*__tmp_ptr);
}
};
template <class _RandAccIter>
struct _RandomAccessIterator_concept_specification {
static void
_RandomAccessIterator_requirement_violation(_RandAccIter __i) {
_BidirectionalIterator_concept_specification<_RandAccIter>::
_BidirectionalIterator_requirement_violation(__i);
_LessThanComparable_concept_specification<_RandAccIter>::
_LessThanComparable_requirement_violation(__i);
typedef typename
__value_type_type_definition_requirement_violation<_RandAccIter>
::value_type
value_type;
typedef typename
__difference_type_type_definition_requirement_violation<_RandAccIter>
::difference_type
_Dist;
typedef typename _Mutable_trait<_Dist>::_Type _MutDist;
_STL_ERROR::__iterator_addition_assignment_requirement_violation(__i,
_MutDist());
_STL_ERROR::__iterator_addition_requirement_violation(__i,
_MutDist());
_STL_ERROR::
__iterator_subtraction_assignment_requirement_violation(__i,
_MutDist());
_STL_ERROR::__iterator_subtraction_requirement_violation(__i,
_MutDist());
_STL_ERROR::__difference_operator_requirement_violation(__i, __i,
_MutDist());
typename _Mutable_trait<value_type>::_Type* __dummy_ptr = 0;
_STL_ERROR::__element_access_operator_requirement_violation(__i,
__dummy_ptr,
_MutDist());
}
};
template <class _RandAccIter>
struct _Mutable_RandomAccessIterator_concept_specification {
static void
_Mutable_RandomAccessIterator_requirement_violation(_RandAccIter __i)
{
_RandomAccessIterator_concept_specification<_RandAccIter>::
_RandomAccessIterator_requirement_violation(__i);
_Mutable_BidirectionalIterator_concept_specification<_RandAccIter>::
_Mutable_BidirectionalIterator_requirement_violation(__i);
typedef typename
__value_type_type_definition_requirement_violation<_RandAccIter>
::value_type
value_type;
typedef typename
__difference_type_type_definition_requirement_violation<_RandAccIter>
::difference_type
_Dist;
typename _Mutable_trait<value_type>::_Type* __tmp_ptr = 0;
_STL_ERROR::__element_assignment_operator_requirement_violation(__i,
__tmp_ptr, _Dist());
}
};
template <class Type> struct __value_type__typedef_requirement_violation { typedef typename Type::value_type value_type; };
template <class Type> struct __difference_type__typedef_requirement_violation { typedef typename Type::difference_type difference_type; };
template <class Type> struct __size_type__typedef_requirement_violation { typedef typename Type::size_type size_type; };
template <class Type> struct __reference__typedef_requirement_violation { typedef typename Type::reference reference; };
template <class Type> struct __const_reference__typedef_requirement_violation { typedef typename Type::const_reference const_reference; };
template <class Type> struct __pointer__typedef_requirement_violation { typedef typename Type::pointer pointer; };
template <class Type> struct __const_pointer__typedef_requirement_violation { typedef typename Type::const_pointer const_pointer; };
template <class _Alloc>
struct _Allocator_concept_specification {
static void
_Allocator_requirement_violation(_Alloc __a) {
_DefaultConstructible_concept_specification<_Alloc>::
_DefaultConstructible_requirement_violation(__a);
_EqualityComparable_concept_specification<_Alloc>::
_EqualityComparable_requirement_violation(__a);
__value_type__typedef_requirement_violation<_Alloc>();
__difference_type__typedef_requirement_violation<_Alloc>();
__size_type__typedef_requirement_violation<_Alloc>();
__reference__typedef_requirement_violation<_Alloc>();
__const_reference__typedef_requirement_violation<_Alloc>();
__pointer__typedef_requirement_violation<_Alloc>();
__const_pointer__typedef_requirement_violation<_Alloc>();
typedef typename _Alloc::value_type _Tp;
}
};
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 2 3
namespace std {
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 {};
template <class _Tp, class _Distance> struct input_iterator {
typedef input_iterator_tag iterator_category;
typedef _Tp value_type;
typedef _Distance difference_type;
typedef _Tp* pointer;
typedef _Tp& reference;
};
struct output_iterator {
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
};
template <class _Tp, class _Distance> struct forward_iterator {
typedef forward_iterator_tag iterator_category;
typedef _Tp value_type;
typedef _Distance difference_type;
typedef _Tp* pointer;
typedef _Tp& reference;
};
template <class _Tp, class _Distance> struct bidirectional_iterator {
typedef bidirectional_iterator_tag iterator_category;
typedef _Tp value_type;
typedef _Distance difference_type;
typedef _Tp* pointer;
typedef _Tp& reference;
};
template <class _Tp, class _Distance> struct random_access_iterator {
typedef random_access_iterator_tag iterator_category;
typedef _Tp value_type;
typedef _Distance difference_type;
typedef _Tp* pointer;
typedef _Tp& reference;
};
template <class _Category, class _Tp, class _Distance = ptrdiff_t,
class _Pointer = _Tp*, class _Reference = _Tp&>
struct iterator {
typedef _Category iterator_category;
typedef _Tp value_type;
typedef _Distance difference_type;
typedef _Pointer pointer;
typedef _Reference reference;
};
template <class _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 <class _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 <class _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;
};
# 142 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 3
template <class _Iter>
inline typename iterator_traits<_Iter>::iterator_category
__iterator_category(const _Iter&)
{
typedef typename iterator_traits<_Iter>::iterator_category _Category;
return _Category();
}
template <class _Iter>
inline typename iterator_traits<_Iter>::difference_type*
__distance_type(const _Iter&)
{
return static_cast<typename iterator_traits<_Iter>::difference_type*>(0);
}
template <class _Iter>
inline typename iterator_traits<_Iter>::value_type*
__value_type(const _Iter&)
{
return static_cast<typename iterator_traits<_Iter>::value_type*>(0);
}
template <class _Iter>
inline typename iterator_traits<_Iter>::iterator_category
iterator_category(const _Iter& __i) { return __iterator_category(__i); }
template <class _Iter>
inline typename iterator_traits<_Iter>::difference_type*
distance_type(const _Iter& __i) { return __distance_type(__i); }
template <class _Iter>
inline typename iterator_traits<_Iter>::value_type*
value_type(const _Iter& __i) { return __value_type(__i); }
# 267 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 3
template <class _InputIterator, class _Distance>
inline void __distance(_InputIterator __first, _InputIterator __last,
_Distance& __n, input_iterator_tag)
{
while (__first != __last) { ++__first; ++__n; }
}
template <class _RandomAccessIterator, class _Distance>
inline void __distance(_RandomAccessIterator __first,
_RandomAccessIterator __last,
_Distance& __n, random_access_iterator_tag)
{
do { void (*__x)( _RandomAccessIterator ) = _RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
__n += __last - __first;
}
template <class _InputIterator, class _Distance>
inline void distance(_InputIterator __first,
_InputIterator __last, _Distance& __n)
{
do { void (*__x)( _InputIterator ) = _InputIterator_concept_specification< _InputIterator > ::_InputIterator_requirement_violation; __x = __x; } while (0);
__distance(__first, __last, __n, iterator_category(__first));
}
template <class _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 <class _RandomAccessIterator>
inline typename iterator_traits<_RandomAccessIterator>::difference_type
__distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
random_access_iterator_tag) {
do { void (*__x)( _RandomAccessIterator ) = _RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
return __last - __first;
}
template <class _InputIterator>
inline typename iterator_traits<_InputIterator>::difference_type
distance(_InputIterator __first, _InputIterator __last) {
typedef typename iterator_traits<_InputIterator>::iterator_category
_Category;
do { void (*__x)( _InputIterator ) = _InputIterator_concept_specification< _InputIterator > ::_InputIterator_requirement_violation; __x = __x; } while (0);
return __distance(__first, __last, _Category());
}
template <class _InputIter, class _Distance>
inline void __advance(_InputIter& __i, _Distance __n, input_iterator_tag) {
while (__n--) ++__i;
}
template <class _BidirectionalIterator, class _Distance>
inline void __advance(_BidirectionalIterator& __i, _Distance __n,
bidirectional_iterator_tag) {
do { void (*__x)( _BidirectionalIterator ) = _BidirectionalIterator_concept_specification< _BidirectionalIterator > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
if (__n >= 0)
while (__n--) ++__i;
else
while (__n++) --__i;
}
template <class _RandomAccessIterator, class _Distance>
inline void __advance(_RandomAccessIterator& __i, _Distance __n,
random_access_iterator_tag) {
do { void (*__x)( _RandomAccessIterator ) = _RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
__i += __n;
}
template <class _InputIterator, class _Distance>
inline void advance(_InputIterator& __i, _Distance __n) {
do { void (*__x)( _InputIterator ) = _InputIterator_concept_specification< _InputIterator > ::_InputIterator_requirement_violation; __x = __x; } while (0);
__advance(__i, __n, iterator_category(__i));
}
}
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
namespace std {
template <class _Container>
class back_insert_iterator {
protected:
_Container* container;
public:
typedef _Container container_type;
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
explicit back_insert_iterator(_Container& __x) : container(&__x) {}
back_insert_iterator<_Container>&
operator=(const typename _Container::value_type& __value) {
container->push_back(__value);
return *this;
}
back_insert_iterator<_Container>& operator*() { return *this; }
back_insert_iterator<_Container>& operator++() { return *this; }
back_insert_iterator<_Container>& operator++(int) { return *this; }
};
# 71 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _Container>
inline back_insert_iterator<_Container> back_inserter(_Container& __x) {
return back_insert_iterator<_Container>(__x);
}
template <class _Container>
class front_insert_iterator {
protected:
_Container* container;
public:
typedef _Container container_type;
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
explicit front_insert_iterator(_Container& __x) : container(&__x) {}
front_insert_iterator<_Container>&
operator=(const typename _Container::value_type& __value) {
container->push_front(__value);
return *this;
}
front_insert_iterator<_Container>& operator*() { return *this; }
front_insert_iterator<_Container>& operator++() { return *this; }
front_insert_iterator<_Container>& operator++(int) { return *this; }
};
# 110 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _Container>
inline front_insert_iterator<_Container> front_inserter(_Container& __x) {
return front_insert_iterator<_Container>(__x);
}
template <class _Container>
class insert_iterator {
protected:
_Container* container;
typename _Container::iterator iter;
public:
typedef _Container container_type;
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
insert_iterator(_Container& __x, typename _Container::iterator __i)
: container(&__x), iter(__i) {}
insert_iterator<_Container>&
operator=(const typename _Container::value_type& __value) {
iter = container->insert(iter, __value);
++iter;
return *this;
}
insert_iterator<_Container>& operator*() { return *this; }
insert_iterator<_Container>& operator++() { return *this; }
insert_iterator<_Container>& operator++(int) { return *this; }
};
# 152 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _Container, class _Iterator>
inline
insert_iterator<_Container> inserter(_Container& __x, _Iterator __i)
{
typedef typename _Container::iterator __iter;
return insert_iterator<_Container>(__x, __iter(__i));
}
template <class _BidirectionalIterator, class _Tp, class _Reference = _Tp&,
class _Distance = ptrdiff_t>
class reverse_bidirectional_iterator {
typedef reverse_bidirectional_iterator<_BidirectionalIterator, _Tp,
_Reference, _Distance> _Self;
protected:
_BidirectionalIterator current;
public:
typedef bidirectional_iterator_tag iterator_category;
typedef _Tp value_type;
typedef _Distance difference_type;
typedef _Tp* pointer;
typedef _Reference reference;
reverse_bidirectional_iterator() {}
explicit reverse_bidirectional_iterator(_BidirectionalIterator __x)
: current(__x) {}
_BidirectionalIterator base() const { return current; }
_Reference operator*() const {
_BidirectionalIterator __tmp = current;
return *--__tmp;
}
pointer operator->() const { return &(operator*()); }
_Self& operator++() {
--current;
return *this;
}
_Self operator++(int) {
_Self __tmp = *this;
--current;
return __tmp;
}
_Self& operator--() {
++current;
return *this;
}
_Self operator--(int) {
_Self __tmp = *this;
++current;
return __tmp;
}
};
# 238 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _BiIter, class _Tp, class _Ref, class _Distance>
inline bool operator==(
const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x,
const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y)
{
return __x.base() == __y.base();
}
template <class _BiIter, class _Tp, class _Ref, class _Distance>
inline bool operator!=(
const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x,
const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y)
{
return !(__x == __y);
}
# 267 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _Iterator>
class reverse_iterator
{
protected:
_Iterator current;
public:
typedef typename iterator_traits<_Iterator>::iterator_category
iterator_category;
typedef typename iterator_traits<_Iterator>::value_type
value_type;
typedef typename iterator_traits<_Iterator>::difference_type
difference_type;
typedef typename iterator_traits<_Iterator>::pointer
pointer;
typedef typename iterator_traits<_Iterator>::reference
reference;
typedef _Iterator iterator_type;
typedef reverse_iterator<_Iterator> _Self;
public:
reverse_iterator() {}
explicit reverse_iterator(iterator_type __x) : current(__x) {}
reverse_iterator(const _Self& __x) : current(__x.current) {}
template <class _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*()); }
_Self& operator++() {
--current;
return *this;
}
_Self operator++(int) {
_Self __tmp = *this;
--current;
return __tmp;
}
_Self& operator--() {
++current;
return *this;
}
_Self operator--(int) {
_Self __tmp = *this;
++current;
return __tmp;
}
_Self operator+(difference_type __n) const {
return _Self(current - __n);
}
_Self& operator+=(difference_type __n) {
current -= __n;
return *this;
}
_Self operator-(difference_type __n) const {
return _Self(current + __n);
}
_Self& operator-=(difference_type __n) {
current += __n;
return *this;
}
reference operator[](difference_type __n) const { return *(*this + __n); }
};
template <class _Iterator>
inline bool operator==(const reverse_iterator<_Iterator>& __x,
const reverse_iterator<_Iterator>& __y) {
return __x.base() == __y.base();
}
template <class _Iterator>
inline bool operator<(const reverse_iterator<_Iterator>& __x,
const reverse_iterator<_Iterator>& __y) {
return __y.base() < __x.base();
}
template <class _Iterator>
inline bool operator!=(const reverse_iterator<_Iterator>& __x,
const reverse_iterator<_Iterator>& __y) {
return !(__x == __y);
}
template <class _Iterator>
inline bool operator>(const reverse_iterator<_Iterator>& __x,
const reverse_iterator<_Iterator>& __y) {
return __y < __x;
}
template <class _Iterator>
inline bool operator<=(const reverse_iterator<_Iterator>& __x,
const reverse_iterator<_Iterator>& __y) {
return !(__y < __x);
}
template <class _Iterator>
inline bool operator>=(const reverse_iterator<_Iterator>& __x,
const reverse_iterator<_Iterator>& __y) {
return !(__x < __y);
}
template <class _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 <class _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);
}
# 823 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _Tp, class _Dist = ptrdiff_t> class istream_iterator;
template <class _Tp, class _Dist>
inline bool operator==(const istream_iterator<_Tp, _Dist>&,
const istream_iterator<_Tp, _Dist>&);
template <class _Tp, class _Dist>
class istream_iterator {
template <class _T1, class _D1>
friend bool operator==(const istream_iterator<_T1, _D1>&,
const istream_iterator<_T1, _D1>&);
protected:
istream* _M_stream;
_Tp _M_value;
bool _M_end_marker;
void _M_read() {
_M_end_marker = (*_M_stream) ? true : false;
if (_M_end_marker) *_M_stream >> _M_value;
_M_end_marker = (*_M_stream) ? true : false;
}
public:
typedef input_iterator_tag iterator_category;
typedef _Tp value_type;
typedef _Dist difference_type;
typedef const _Tp* pointer;
typedef const _Tp& reference;
istream_iterator() : _M_stream(&cin), _M_end_marker(false) {}
istream_iterator(istream& __s) : _M_stream(&__s) { _M_read(); }
reference operator*() const { return _M_value; }
pointer operator->() const { return &(operator*()); }
istream_iterator<_Tp, _Dist>& operator++() {
_M_read();
return *this;
}
istream_iterator<_Tp, _Dist> operator++(int) {
istream_iterator<_Tp, _Dist> __tmp = *this;
_M_read();
return __tmp;
}
};
# 893 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template <class _Tp, class _Distance>
inline bool operator==(const istream_iterator<_Tp, _Distance>& __x,
const istream_iterator<_Tp, _Distance>& __y) {
return (__x._M_stream == __y._M_stream &&
__x._M_end_marker == __y._M_end_marker) ||
__x._M_end_marker == false && __y._M_end_marker == false;
}
template <class _Tp, class _Distance>
inline bool operator!=(const istream_iterator<_Tp, _Distance>& __x,
const istream_iterator<_Tp, _Distance>& __y) {
return !(__x == __y);
}
template <class _Tp>
class ostream_iterator {
protected:
ostream* _M_stream;
const char* _M_string;
public:
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
ostream_iterator(ostream& __s) : _M_stream(&__s), _M_string(0) {}
ostream_iterator(ostream& __s, const char* __c)
: _M_stream(&__s), _M_string(__c) {}
ostream_iterator<_Tp>& operator=(const _Tp& __value) {
*_M_stream << __value;
if (_M_string) *_M_stream << _M_string;
return *this;
}
ostream_iterator<_Tp>& operator*() { return *this; }
ostream_iterator<_Tp>& operator++() { return *this; }
ostream_iterator<_Tp>& operator++(int) { return *this; }
};
# 955 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 3
template<typename _Iterator, typename _Container>
class __normal_iterator
: public iterator<iterator_traits<_Iterator>::iterator_category,
iterator_traits<_Iterator>::value_type,
iterator_traits<_Iterator>::difference_type,
iterator_traits<_Iterator>::pointer,
iterator_traits<_Iterator>::reference>
{
protected:
_Iterator _M_current;
public:
typedef __normal_iterator<_Iterator, _Container> normal_iterator_type;
typedef iterator_traits<_Iterator> __traits_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::pointer pointer;
typedef typename __traits_type::reference reference;
__normal_iterator() : _M_current(_Iterator()) { }
explicit __normal_iterator(const _Iterator& __i) : _M_current(__i) { }
template<typename _Iter>
inline __normal_iterator(const __normal_iterator<_Iter, _Container>& __i)
: _M_current(__i.base()) { }
reference
operator*() const { return *_M_current; }
pointer
operator->() const { return _M_current; }
normal_iterator_type&
operator++() { ++_M_current; return *this; }
normal_iterator_type
operator++(int) { return __normal_iterator(_M_current++); }
normal_iterator_type&
operator--() { --_M_current; return *this; }
normal_iterator_type
operator--(int) { return __normal_iterator(_M_current--); }
reference
operator[](const difference_type& __n) const
{ return _M_current[__n]; }
normal_iterator_type&
operator+=(const difference_type& __n)
{ _M_current += __n; return *this; }
normal_iterator_type
operator+(const difference_type& __n) const
{ return __normal_iterator(_M_current + __n); }
normal_iterator_type&
operator-=(const difference_type& __n)
{ _M_current -= __n; return *this; }
normal_iterator_type
operator-(const difference_type& __n) const
{ return __normal_iterator(_M_current - __n); }
difference_type
operator-(const normal_iterator_type& __i) const
{ return _M_current - __i._M_current; }
const _Iterator&
base() const { return _M_current; }
};
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 _IteratorL, typename _IteratorR, typename _Container>
inline bool
operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,
const __normal_iterator<_IteratorR, _Container>& __rhs)
{ return !(__lhs == __rhs); }
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 _IteratorL, typename _IteratorR, typename _Container>
inline bool
operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,
const __normal_iterator<_IteratorR, _Container>& __rhs)
{ return __rhs < __lhs; }
template<typename _IteratorL, typename _IteratorR, typename _Container>
inline bool
operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,
const __normal_iterator<_IteratorR, _Container>& __rhs)
{ return !(__rhs < __lhs); }
template<typename _IteratorL, typename _IteratorR, typename _Container>
inline bool
operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,
const __normal_iterator<_IteratorR, _Container>& __rhs)
{ return !(__lhs < __rhs); }
template<typename _Iterator, typename _Container>
inline __normal_iterator<_Iterator, _Container>
operator+(__normal_iterator<_Iterator, _Container>::difference_type __n,
const __normal_iterator<_Iterator, _Container>& __i)
{ return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }
}
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iterator.h" 2 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 1 3
# 19 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_config.h" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_pair.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_pair.h" 3
namespace std {
template <class _T1, class _T2>
struct pair {
typedef _T1 first_type;
typedef _T2 second_type;
_T1 first;
_T2 second;
pair() : first(_T1()), second(_T2()) {}
pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
template <class _U1, class _U2>
pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
};
template <class _T1, class _T2>
inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
{
return __x.first == __y.first && __x.second == __y.second;
}
template <class _T1, class _T2>
inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
{
return __x.first < __y.first ||
(!(__y.first < __x.first) && __x.second < __y.second);
}
template <class _T1, class _T2>
inline bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
return !(__x == __y);
}
template <class _T1, class _T2>
inline bool operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
return __y < __x;
}
template <class _T1, class _T2>
inline bool operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
return !(__y < __x);
}
template <class _T1, class _T2>
inline bool operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
return !(__x < __y);
}
template <class _T1, class _T2>
inline pair<_T1, _T2> make_pair(const _T1 __x, const _T2 __y)
{
return pair<_T1, _T2>(__x, __y);
}
}
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 1 3
# 19 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_config.h" 1 3
# 22 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 2 3
# 59 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 3
template <bool _Truth> struct _Bool {};
typedef _Bool<true> __true_type;
typedef _Bool<false> __false_type;
template <class _Tp>
struct __type_traits {
typedef __true_type this_dummy_member_must_be_first;
# 83 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 3
typedef __false_type has_trivial_default_constructor;
typedef __false_type has_trivial_copy_constructor;
typedef __false_type has_trivial_assignment_operator;
typedef __false_type has_trivial_destructor;
typedef __false_type is_POD_type;
};
# 98 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 3
template<> struct __type_traits<bool> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<char> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<signed char> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<unsigned char> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<wchar_t> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<short> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<unsigned short> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<int> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<unsigned int> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<long> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<unsigned long> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<long long> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<unsigned long long> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<float> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<double> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template<> struct __type_traits<long double> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
template <class _Tp>
struct __type_traits<_Tp*> {
typedef __true_type has_trivial_default_constructor;
typedef __true_type has_trivial_copy_constructor;
typedef __true_type has_trivial_assignment_operator;
typedef __true_type has_trivial_destructor;
typedef __true_type is_POD_type;
};
# 303 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 3
template <class _Tp> struct _Is_integer {
typedef __false_type _Integral;
};
template<> struct _Is_integer<bool> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<char> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<signed char> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<unsigned char> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<wchar_t> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<short> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<unsigned short> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<int> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<unsigned int> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<long> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<unsigned long> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<long long> {
typedef __true_type _Integral;
};
template<> struct _Is_integer<unsigned long long> {
typedef __true_type _Integral;
};
template<typename _Tp> struct _Is_normal_iterator {
typedef __false_type _Normal;
};
namespace std {
template<typename _Iterator, typename _Container> class __normal_iterator;
};
template<typename _Iterator, typename _Container>
struct _Is_normal_iterator< std::__normal_iterator<_Iterator, _Container> > {
typedef __true_type _Normal;
};
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_climits.h" 1 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 2 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 3
# 1 "/usr/include/stdlib.h" 1 3
# 25 "/usr/include/stdlib.h" 3
# 1 "/usr/include/features.h" 1 3
# 26 "/usr/include/stdlib.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 34 "/usr/include/stdlib.h" 2 3
extern "C" {
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;
# 80 "/usr/include/stdlib.h" 3
extern size_t __ctype_get_mb_cur_max (void) throw ();
extern double atof (__const char *__nptr) throw ();
extern int atoi (__const char *__nptr) throw ();
extern long int atol (__const char *__nptr) throw ();
__extension__ extern long long int atoll (__const char *__nptr) throw ();
extern double strtod (__const char *__restrict __nptr, char **__restrict __endptr) throw ();
extern float strtof (__const char *__restrict __nptr, char **__restrict __endptr) throw ();
extern long double strtold (__const char *__restrict __nptr, char **__restrict __endptr) throw ();
extern long int strtol (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ();
extern unsigned long int strtoul (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ();
__extension__
extern long long int strtoq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ();
__extension__
extern unsigned long long int strtouq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ();
# 132 "/usr/include/stdlib.h" 3
__extension__
extern long long int strtoll (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ();
__extension__
extern unsigned long long int strtoull (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ();
# 157 "/usr/include/stdlib.h" 3
# 1 "/usr/include/xlocale.h" 1 3
# 158 "/usr/include/stdlib.h" 2 3
extern long int __strtol_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw ();
extern unsigned long int __strtoul_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw ();
__extension__
extern long long int __strtoll_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw ();
__extension__
extern unsigned long long int __strtoull_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw ();
extern double __strtod_l (__const char *__restrict __nptr, char **__restrict __endptr, __locale_t __loc) throw ();
extern float __strtof_l (__const char *__restrict __nptr, char **__restrict __endptr, __locale_t __loc) throw ();
extern long double __strtold_l (__const char *__restrict __nptr, char **__restrict __endptr, __locale_t __loc) throw ();
# 196 "/usr/include/stdlib.h" 3
extern double __strtod_internal (__const char *__restrict __nptr, char **__restrict __endptr, int __group) throw ();
extern float __strtof_internal (__const char *__restrict __nptr, char **__restrict __endptr, int __group) throw ();
extern long double __strtold_internal (__const char * __restrict __nptr, char **__restrict __endptr, int __group) throw ();
extern long int __strtol_internal (__const char *__restrict __nptr, char **__restrict __endptr, int __base, int __group) throw ();
extern unsigned long int __strtoul_internal (__const char * __restrict __nptr, char **__restrict __endptr, int __base, int __group) throw ();
__extension__
extern long long int __strtoll_internal (__const char *__restrict __nptr, char **__restrict __endptr, int __base, int __group) throw ();
__extension__
extern unsigned long long int __strtoull_internal (__const char * __restrict __nptr, char ** __restrict __endptr, int __base, int __group) throw ();
# 242 "/usr/include/stdlib.h" 3
extern __inline double
strtod (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
{
return __strtod_internal (__nptr, __endptr, 0);
}
extern __inline long int
strtol (__const char *__restrict __nptr, char **__restrict __endptr,
int __base) throw ()
{
return __strtol_internal (__nptr, __endptr, __base, 0);
}
extern __inline unsigned long int
strtoul (__const char *__restrict __nptr, char **__restrict __endptr,
int __base) throw ()
{
return __strtoul_internal (__nptr, __endptr, __base, 0);
}
extern __inline float
strtof (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
{
return __strtof_internal (__nptr, __endptr, 0);
}
extern __inline long double
strtold (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
{
return __strtold_internal (__nptr, __endptr, 0);
}
__extension__ extern __inline long long int
strtoq (__const char *__restrict __nptr, char **__restrict __endptr,
int __base) throw ()
{
return __strtoll_internal (__nptr, __endptr, __base, 0);
}
__extension__ extern __inline unsigned long long int
strtouq (__const char *__restrict __nptr, char **__restrict __endptr,
int __base) throw ()
{
return __strtoull_internal (__nptr, __endptr, __base, 0);
}
__extension__ extern __inline long long int
strtoll (__const char *__restrict __nptr, char **__restrict __endptr,
int __base) throw ()
{
return __strtoll_internal (__nptr, __endptr, __base, 0);
}
__extension__ extern __inline unsigned long long int
strtoull (__const char * __restrict __nptr, char **__restrict __endptr,
int __base) throw ()
{
return __strtoull_internal (__nptr, __endptr, __base, 0);
}
extern __inline double
atof (__const char *__nptr) throw ()
{
return strtod (__nptr, (char **) __null);
}
extern __inline int
atoi (__const char *__nptr) throw ()
{
return (int) strtol (__nptr, (char **) __null, 10);
}
extern __inline long int
atol (__const char *__nptr) throw ()
{
return strtol (__nptr, (char **) __null, 10);
}
__extension__ extern __inline long long int
atoll (__const char *__nptr) throw ()
{
return strtoll (__nptr, (char **) __null, 10);
}
# 333 "/usr/include/stdlib.h" 3
extern char *l64a (long int __n) throw ();
extern long int a64l (__const char *__s) throw ();
# 1 "/usr/include/sys/types.h" 1 3
# 26 "/usr/include/sys/types.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/sys/types.h" 2 3
extern "C" {
# 1 "/usr/include/bits/types.h" 1 3
# 31 "/usr/include/sys/types.h" 2 3
typedef __u_char u_char;
typedef __u_short u_short;
typedef __u_int u_int;
typedef __u_long u_long;
typedef __quad_t quad_t;
typedef __u_quad_t u_quad_t;
typedef __fsid_t fsid_t;
typedef __loff_t loff_t;
typedef __ino_t ino_t;
typedef __ino64_t ino64_t;
typedef __dev_t dev_t;
typedef __gid_t gid_t;
typedef __mode_t mode_t;
typedef __nlink_t nlink_t;
typedef __uid_t uid_t;
# 96 "/usr/include/sys/types.h" 3
typedef __pid_t pid_t;
typedef __id_t id_t;
typedef __ssize_t ssize_t;
typedef __daddr_t daddr_t;
typedef __caddr_t caddr_t;
typedef __key_t key_t;
# 1 "/usr/include/time.h" 1 3
# 123 "/usr/include/sys/types.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 126 "/usr/include/sys/types.h" 2 3
typedef unsigned long int ulong;
typedef unsigned short int ushort;
typedef unsigned int uint;
# 169 "/usr/include/sys/types.h" 3
typedef int int8_t __attribute__ ((__mode__ (__QI__)));
typedef int int16_t __attribute__ ((__mode__ (__HI__)));
typedef int int32_t __attribute__ ((__mode__ (__SI__)));
typedef int int64_t __attribute__ ((__mode__ (__DI__)));
typedef unsigned int u_int8_t __attribute__ ((__mode__ (__QI__)));
typedef unsigned int u_int16_t __attribute__ ((__mode__ (__HI__)));
typedef unsigned int u_int32_t __attribute__ ((__mode__ (__SI__)));
typedef unsigned int u_int64_t __attribute__ ((__mode__ (__DI__)));
typedef int register_t __attribute__ ((__mode__ (__word__)));
# 191 "/usr/include/sys/types.h" 3
# 1 "/usr/include/endian.h" 1 3
# 22 "/usr/include/endian.h" 3
# 1 "/usr/include/features.h" 1 3
# 23 "/usr/include/endian.h" 2 3
# 35 "/usr/include/endian.h" 3
# 1 "/usr/include/bits/endian.h" 1 3
# 36 "/usr/include/endian.h" 2 3
# 192 "/usr/include/sys/types.h" 2 3
# 1 "/usr/include/sys/select.h" 1 3
# 25 "/usr/include/sys/select.h" 3
# 1 "/usr/include/features.h" 1 3
# 26 "/usr/include/sys/select.h" 2 3
# 1 "/usr/include/bits/types.h" 1 3
# 29 "/usr/include/sys/select.h" 2 3
# 1 "/usr/include/bits/select.h" 1 3
# 32 "/usr/include/sys/select.h" 2 3
# 1 "/usr/include/bits/sigset.h" 1 3
# 35 "/usr/include/sys/select.h" 2 3
# 1 "/usr/include/time.h" 1 3
# 39 "/usr/include/sys/select.h" 2 3
extern "C" {
struct timeval;
typedef __fd_mask fd_mask;
typedef __fd_set fd_set;
# 74 "/usr/include/sys/select.h" 3
extern int __select (int __nfds, __fd_set *__readfds, __fd_set *__writefds, __fd_set *__exceptfds, struct timeval *__timeout) throw ();
extern int select (int __nfds, __fd_set *__readfds, __fd_set *__writefds, __fd_set *__exceptfds, struct timeval *__timeout) throw ();
# 87 "/usr/include/sys/select.h" 3
extern int pselect (int __nfds, __fd_set *__readfds, __fd_set *__writefds, __fd_set *__exceptfds, const struct timespec *__timeout, const __sigset_t *__sigmask) throw ();
}
# 195 "/usr/include/sys/types.h" 2 3
# 1 "/usr/include/sys/sysmacros.h" 1 3
# 198 "/usr/include/sys/types.h" 2 3
typedef __blkcnt_t blkcnt_t;
typedef __fsblkcnt_t fsblkcnt_t;
typedef __fsfilcnt_t fsfilcnt_t;
typedef __blkcnt64_t blkcnt64_t;
typedef __fsblkcnt64_t fsblkcnt64_t;
typedef __fsfilcnt64_t fsfilcnt64_t;
}
# 340 "/usr/include/stdlib.h" 2 3
extern int32_t random (void) throw ();
extern void srandom (unsigned int __seed) throw ();
extern void * initstate (unsigned int __seed, void * __statebuf, size_t __statelen) throw ();
extern void * setstate (void * __statebuf) throw ();
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 ();
extern int srandom_r (unsigned int __seed, struct random_data *__buf) throw ();
extern int initstate_r (unsigned int __seed, void * __restrict __statebuf, size_t __statelen, struct random_data *__restrict __buf) throw ();
extern int setstate_r (void * __restrict __statebuf, struct random_data *__restrict __buf) throw ();
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 ();
extern long int lrand48 (void) throw ();
extern long int nrand48 (unsigned short int __xsubi[3]) throw ();
extern long int mrand48 (void) throw ();
extern long int jrand48 (unsigned short int __xsubi[3]) throw ();
extern void srand48 (long int __seedval) throw ();
extern unsigned short int *seed48 (unsigned short int __seed16v[3]) throw ();
extern void lcong48 (unsigned short int __param[7]) throw ();
struct drand48_data
{
unsigned short int x[3];
unsigned short int a[3];
unsigned short int c;
unsigned short int old_x[3];
int init;
};
extern int drand48_r (struct drand48_data *__restrict __buffer, double *__restrict __result) throw ();
extern int erand48_r (unsigned short int __xsubi[3], struct drand48_data *__restrict __buffer, double *__restrict __result) throw ();
extern int lrand48_r (struct drand48_data *__restrict __buffer, long int *__restrict __result) throw ();
extern int nrand48_r (unsigned short int __xsubi[3], struct drand48_data *__restrict __buffer, long int *__restrict __result) throw ();
extern int mrand48_r (struct drand48_data *__restrict __buffer, long int *__restrict __result) throw ();
extern int jrand48_r (unsigned short int __xsubi[3], struct drand48_data *__restrict __buffer, long int *__restrict __result) throw ();
extern int srand48_r (long int __seedval, struct drand48_data *__buffer) throw ();
extern int seed48_r (unsigned short int __seed16v[3], struct drand48_data *__buffer) throw ();
extern int lcong48_r (unsigned short int __param[7], struct drand48_data *__buffer) throw ();
# 474 "/usr/include/stdlib.h" 3
extern void * malloc (size_t __size) throw ();
extern void * calloc (size_t __nmemb, size_t __size) throw ();
extern void * realloc (void * __ptr, size_t __size) throw ();
extern void free (void * __ptr) throw ();
extern void cfree (void * __ptr) throw ();
# 1 "/usr/include/alloca.h" 1 3
# 22 "/usr/include/alloca.h" 3
# 1 "/usr/include/features.h" 1 3
# 23 "/usr/include/alloca.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 26 "/usr/include/alloca.h" 2 3
extern "C" {
extern void * alloca (size_t __size) throw ();
}
# 493 "/usr/include/stdlib.h" 2 3
extern void * valloc (size_t __size) throw ();
extern void abort (void) throw () __attribute__ ((__noreturn__));
extern int atexit (void (*__func) (void)) throw ();
extern int __on_exit (void (*__func) (int __status, void * __arg), void * __arg) throw ();
extern int on_exit (void (*__func) (int __status, void * __arg), void * __arg) throw ();
extern void exit (int __status) throw () __attribute__ ((__noreturn__));
extern void _Exit (int __status) throw () __attribute__ ((__noreturn__));
extern char *getenv (__const char *__name) throw ();
extern char *__secure_getenv (__const char *__name) throw ();
extern int putenv (char *__string) throw ();
extern int setenv (__const char *__name, __const char *__value, int __replace) throw ();
extern void unsetenv (__const char *__name) throw ();
extern int clearenv (void) throw ();
# 566 "/usr/include/stdlib.h" 3
extern char *mktemp (char *__template) throw ();
extern int mkstemp (char *__template) throw ();
extern int system (__const char *__command) throw ();
extern char *canonicalize_file_name (__const char *__name) throw ();
# 595 "/usr/include/stdlib.h" 3
extern char *realpath (__const char *__restrict __name, char *__restrict __resolved) throw ();
typedef int (*__compar_fn_t) (__const void *, __const void *);
typedef __compar_fn_t comparison_fn_t;
extern void * bsearch (__const void * __key, __const void * __base, size_t __nmemb, size_t __size, __compar_fn_t __compar);
extern void qsort (void * __base, size_t __nmemb, size_t __size, __compar_fn_t __compar);
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__));
# 651 "/usr/include/stdlib.h" 3
extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw ();
extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw ();
extern char *gcvt (double __value, int __ndigit, char *__buf) throw ();
extern char *qecvt (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw ();
extern char *qfcvt (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw ();
extern char *qgcvt (long double __value, int __ndigit, char *__buf) throw ();
extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw ();
extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw ();
extern int qecvt_r (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw ();
extern int qfcvt_r (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw ();
# 695 "/usr/include/stdlib.h" 3
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 ();
# 718 "/usr/include/stdlib.h" 3
extern int rpmatch (__const char *__response) throw ();
# 729 "/usr/include/stdlib.h" 3
extern int getsubopt (char **__restrict __optionp, __const char *__const *__restrict __tokens, char **__restrict __valuep) throw ();
# 738 "/usr/include/stdlib.h" 3
extern void setkey (__const char *__key) throw ();
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 ();
extern int getpt (void) throw ();
}
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 2 3
# 83 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 3
namespace std
{
using ::div_t;
using ::ldiv_t;
# 100 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 3
extern "C" double atof(const char*);
extern "C" int atoi(const char*);
extern "C" long int atol(const char*);
extern "C" double strtod(const char*, char**);
extern "C" float strtof(const char*, char**);
extern "C" long int strtol(const char*, char**, int);
extern "C" unsigned long int strtoul(const char*, char**, int);
extern "C" int rand(void);
extern "C" void srand(unsigned int);
extern "C" void* calloc(size_t, size_t);
extern "C" void free(void*);
extern "C" void* malloc(size_t);
extern "C" void* realloc(void*, size_t);
extern "C" void abort(void);
extern "C" int atexit(void (*func)(void));
extern "C" void exit(int);
extern "C" void _Exit(int);
extern "C" char*getenv(const char*);
extern "C" int system(const char*);
extern "C" void* bsearch(const void*, const void*, size_t, size_t,
int (*comp)(const void *, const void *));
extern "C" void qsort(void*, size_t, size_t,
int (*comp)(const void *, const void *));
extern "C" int abs(int);
extern "C" long int labs(long int);
extern "C" div_t div(int, int);
extern "C" ldiv_t ldiv(long int, long int);
extern "C" int mblen(const char*, size_t);
extern "C" int mbtowc(wchar_t*, const char*, size_t);
extern "C" int wctomb(char*, wchar_t);
extern "C" size_t mbstowcs(wchar_t*, const char*, size_t);
extern "C" size_t wcstombs(char*, const wchar_t*, size_t);
# 154 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 3
extern "C" long double strtold(const char*, char**);
}
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 46 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/new" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/new" 3
#pragma interface "new"
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/cstddef" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/new" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception" 1 3
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/new" 2 3
extern "C++" {
namespace std
{
class bad_alloc : public exception
{
public:
virtual const char* what() const throw() { return "bad_alloc"; }
};
struct nothrow_t { };
extern const nothrow_t nothrow;
typedef void (*new_handler)();
new_handler set_new_handler(new_handler);
}
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 *place) throw() { return place; }
inline void *operator new[](std::size_t, void *place) throw() { return place; }
}
# 47 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 1 3
# 52 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 1 3
# 55 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator.h" 1 3
# 56 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 2 3
namespace std {
template <class _ForwardIter1, class _ForwardIter2, class _Tp>
inline void __iter_swap(_ForwardIter1 __a, _ForwardIter2 __b, _Tp*) {
_Tp __tmp = *__a;
*__a = *__b;
*__b = __tmp;
}
template <class _ForwardIter1, class _ForwardIter2>
inline void iter_swap(_ForwardIter1 __a, _ForwardIter2 __b) {
do { void (*__x)( _ForwardIter1 ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter1 > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter2 ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter2 > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter1>::value_type , typename iterator_traits<_ForwardIter2>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_ForwardIter1>::value_type , typename iterator_traits<_ForwardIter2>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter2>::value_type , typename iterator_traits<_ForwardIter1>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_ForwardIter2>::value_type , typename iterator_traits<_ForwardIter1>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
__iter_swap(__a, __b, __value_type(__a));
}
template <class _Tp>
inline void swap(_Tp& __a, _Tp& __b) {
do { void (*__x)( _Tp ) = _Assignable_concept_specification< _Tp > ::_Assignable_requirement_violation; __x = __x; } while (0);
_Tp __tmp = __a;
__a = __b;
__b = __tmp;
}
# 97 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 3
template <class _Tp>
inline const _Tp& min(const _Tp& __a, const _Tp& __b) {
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__b < __a) return __b; return __a;
}
template <class _Tp>
inline const _Tp& max(const _Tp& __a, const _Tp& __b) {
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__a < __b) return __b; return __a;
}
template <class _Tp, class _Compare>
inline const _Tp& min(const _Tp& __a, const _Tp& __b, _Compare __comp) {
if (__comp(__b, __a)) return __b; return __a;
}
template <class _Tp, class _Compare>
inline const _Tp& max(const _Tp& __a, const _Tp& __b, _Compare __comp) {
if (__comp(__a, __b)) return __b; return __a;
}
# 134 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 3
template <class _InputIter, class _OutputIter, class _Distance>
inline _OutputIter __copy(_InputIter __first, _InputIter __last,
_OutputIter __result,
input_iterator_tag, _Distance*)
{
for ( ; __first != __last; ++__result, ++__first)
*__result = *__first;
return __result;
}
template <class _RandomAccessIter, class _OutputIter, class _Distance>
inline _OutputIter
__copy(_RandomAccessIter __first, _RandomAccessIter __last,
_OutputIter __result, random_access_iterator_tag, _Distance*)
{
for (_Distance __n = __last - __first; __n > 0; --__n) {
*__result = *__first;
++__first;
++__result;
}
return __result;
}
template <class _Tp>
inline _Tp*
__copy_trivial(const _Tp* __first, const _Tp* __last, _Tp* __result) {
memmove(__result, __first, sizeof(_Tp) * (__last - __first));
return __result + (__last - __first);
}
template <class _InputIter, class _OutputIter>
inline _OutputIter __copy_aux2(_InputIter __first, _InputIter __last,
_OutputIter __result, __false_type) {
return __copy(__first, __last, __result,
__iterator_category(__first),
__distance_type(__first));
}
template <class _InputIter, class _OutputIter>
inline _OutputIter __copy_aux2(_InputIter __first, _InputIter __last,
_OutputIter __result, __true_type) {
return __copy(__first, __last, __result,
__iterator_category(__first),
__distance_type(__first));
}
template <class _Tp>
inline _Tp* __copy_aux2(_Tp* __first, _Tp* __last, _Tp* __result,
__true_type) {
return __copy_trivial(__first, __last, __result);
}
template <class _Tp>
inline _Tp* __copy_aux2(const _Tp* __first, const _Tp* __last, _Tp* __result,
__true_type) {
return __copy_trivial(__first, __last, __result);
}
template <class _InputIter, class _OutputIter, class _Tp>
inline _OutputIter __copy_aux(_InputIter __first, _InputIter __last,
_OutputIter __result, _Tp*) {
typedef typename __type_traits<_Tp>::has_trivial_assignment_operator
_Trivial;
return __copy_aux2(__first, __last, __result, _Trivial());
}
template<typename _InputIter, typename _OutputIter>
inline _OutputIter __copy_ni2(_InputIter __first, _InputIter __last,
_OutputIter __result, __true_type) {
return _OutputIter(__copy_aux(__first, __last, __result.base(),
__value_type(__first)));
}
template<typename _InputIter, typename _OutputIter>
inline _OutputIter __copy_ni2(_InputIter __first, _InputIter __last,
_OutputIter __result, __false_type) {
return __copy_aux(__first, __last, __result, __value_type(__first));
}
template<typename _InputIter, typename _OutputIter>
inline _OutputIter __copy_ni1(_InputIter __first, _InputIter __last,
_OutputIter __result, __true_type) {
typedef typename _Is_normal_iterator<_OutputIter>::_Normal __Normal;
return __copy_ni2(__first.base(), __last.base(), __result, __Normal());
}
template<typename _InputIter, typename _OutputIter>
inline _OutputIter __copy_ni1(_InputIter __first, _InputIter __last,
_OutputIter __result, __false_type) {
typedef typename _Is_normal_iterator<_OutputIter>::_Normal __Normal;
return __copy_ni2(__first, __last, __result, __Normal());
}
template <class _InputIter, class _OutputIter>
inline _OutputIter copy(_InputIter __first, _InputIter __last,
_OutputIter __result) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
typedef typename _Is_normal_iterator<_InputIter>::_Normal __Normal;
return __copy_ni1(__first, __last, __result, __Normal());
}
# 331 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 3
template <class _BidirectionalIter1, class _BidirectionalIter2,
class _Distance>
inline _BidirectionalIter2 __copy_backward(_BidirectionalIter1 __first,
_BidirectionalIter1 __last,
_BidirectionalIter2 __result,
bidirectional_iterator_tag,
_Distance*)
{
while (__first != __last)
*--__result = *--__last;
return __result;
}
template <class _RandomAccessIter, class _BidirectionalIter, class _Distance>
inline _BidirectionalIter __copy_backward(_RandomAccessIter __first,
_RandomAccessIter __last,
_BidirectionalIter __result,
random_access_iterator_tag,
_Distance*)
{
for (_Distance __n = __last - __first; __n > 0; --__n)
*--__result = *--__last;
return __result;
}
# 363 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 3
template <class _BidirectionalIter1, class _BidirectionalIter2,
class _BoolType>
struct __copy_backward_dispatch
{
typedef typename iterator_traits<_BidirectionalIter1>::iterator_category
_Cat;
typedef typename iterator_traits<_BidirectionalIter1>::difference_type
_Distance;
static _BidirectionalIter2 copy(_BidirectionalIter1 __first,
_BidirectionalIter1 __last,
_BidirectionalIter2 __result) {
return __copy_backward(__first, __last, __result, _Cat(), (_Distance*) 0);
}
};
template <class _Tp>
struct __copy_backward_dispatch<_Tp*, _Tp*, __true_type>
{
static _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) {
const ptrdiff_t _Num = __last - __first;
memmove(__result - _Num, __first, sizeof(_Tp) * _Num);
return __result - _Num;
}
};
template <class _Tp>
struct __copy_backward_dispatch<const _Tp*, _Tp*, __true_type>
{
static _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) {
return __copy_backward_dispatch<_Tp*, _Tp*, __true_type>
::copy(__first, __last, __result);
}
};
template <class _BI1, class _BI2>
inline _BI2 __copy_backward_aux(_BI1 __first, _BI1 __last, _BI2 __result) {
typedef typename __type_traits<typename iterator_traits<_BI2>::value_type>
::has_trivial_assignment_operator
_Trivial;
return __copy_backward_dispatch<_BI1, _BI2, _Trivial>
::copy(__first, __last, __result);
}
template <typename _BI1, typename _BI2>
inline _BI2 __copy_backward_output_normal_iterator(_BI1 __first, _BI1 __last,
_BI2 __result, __true_type) {
return _BI2(__copy_backward_aux(__first, __last, __result.base()));
}
template <typename _BI1, typename _BI2>
inline _BI2 __copy_backward_output_normal_iterator(_BI1 __first, _BI1 __last,
_BI2 __result, __false_type){
return __copy_backward_aux(__first, __last, __result);
}
template <typename _BI1, typename _BI2>
inline _BI2 __copy_backward_input_normal_iterator(_BI1 __first, _BI1 __last,
_BI2 __result, __true_type) {
typedef typename _Is_normal_iterator<_BI2>::_Normal __Normal;
return __copy_backward_output_normal_iterator(__first.base(), __last.base(),
__result, __Normal());
}
template <typename _BI1, typename _BI2>
inline _BI2 __copy_backward_input_normal_iterator(_BI1 __first, _BI1 __last,
_BI2 __result, __false_type) {
typedef typename _Is_normal_iterator<_BI2>::_Normal __Normal;
return __copy_backward_output_normal_iterator(__first, __last, __result,
__Normal());
}
template <typename _BI1, typename _BI2>
inline _BI2 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) {
do { void (*__x)( _BI1 ) = _BidirectionalIterator_concept_specification< _BI1 > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _BI2 ) = _Mutable_BidirectionalIterator_concept_specification< _BI2 > ::_Mutable_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_BI1>::value_type , typename iterator_traits<_BI2>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_BI1>::value_type , typename iterator_traits<_BI2>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
typedef typename _Is_normal_iterator<_BI1>::_Normal __Normal;
return __copy_backward_input_normal_iterator(__first, __last, __result,
__Normal());
}
# 460 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 3
template <class _InputIter, class _Size, class _OutputIter>
pair<_InputIter, _OutputIter> __copy_n(_InputIter __first, _Size __count,
_OutputIter __result,
input_iterator_tag) {
for ( ; __count > 0; --__count) {
*__result = *__first;
++__first;
++__result;
}
return pair<_InputIter, _OutputIter>(__first, __result);
}
template <class _RAIter, class _Size, class _OutputIter>
inline pair<_RAIter, _OutputIter>
__copy_n(_RAIter __first, _Size __count,
_OutputIter __result,
random_access_iterator_tag) {
_RAIter __last = __first + __count;
return pair<_RAIter, _OutputIter>(__last, copy(__first, __last, __result));
}
template <class _InputIter, class _Size, class _OutputIter>
inline pair<_InputIter, _OutputIter>
__copy_n(_InputIter __first, _Size __count, _OutputIter __result) {
return __copy_n(__first, __count, __result,
__iterator_category(__first));
}
template <class _InputIter, class _Size, class _OutputIter>
inline pair<_InputIter, _OutputIter>
copy_n(_InputIter __first, _Size __count, _OutputIter __result) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
return __copy_n(__first, __count, __result);
}
template <class _ForwardIter, class _Tp>
void fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __value) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
*__first = __value;
}
template <class _OutputIter, class _Size, class _Tp>
_OutputIter fill_n(_OutputIter __first, _Size __n, const _Tp& __value) {
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __n > 0; --__n, ++__first)
*__first = __value;
return __first;
}
inline void fill(unsigned char* __first, unsigned char* __last,
const unsigned char& __c) {
unsigned char __tmp = __c;
memset(__first, __tmp, __last - __first);
}
inline void fill(signed char* __first, signed char* __last,
const signed char& __c) {
signed char __tmp = __c;
memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
}
inline void fill(char* __first, char* __last, const char& __c) {
char __tmp = __c;
memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
}
template <class _Size>
inline unsigned char* fill_n(unsigned char* __first, _Size __n,
const unsigned char& __c) {
fill(__first, __first + __n, __c);
return __first + __n;
}
template <class _Size>
inline signed char* fill_n(char* __first, _Size __n,
const signed char& __c) {
fill(__first, __first + __n, __c);
return __first + __n;
}
template <class _Size>
inline char* fill_n(char* __first, _Size __n, const char& __c) {
fill(__first, __first + __n, __c);
return __first + __n;
}
template <class _InputIter1, class _InputIter2>
pair<_InputIter1, _InputIter2> mismatch(_InputIter1 __first1,
_InputIter1 __last1,
_InputIter2 __first2) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter2>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter2>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && *__first1 == *__first2) {
++__first1;
++__first2;
}
return pair<_InputIter1, _InputIter2>(__first1, __first2);
}
template <class _InputIter1, class _InputIter2, class _BinaryPredicate>
pair<_InputIter1, _InputIter2> mismatch(_InputIter1 __first1,
_InputIter1 __last1,
_InputIter2 __first2,
_BinaryPredicate __binary_pred) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __binary_pred(*__first1, *__first2)) {
++__first1;
++__first2;
}
return pair<_InputIter1, _InputIter2>(__first1, __first2);
}
template <class _InputIter1, class _InputIter2>
inline bool equal(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter2>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter2>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
for ( ; __first1 != __last1; ++__first1, ++__first2)
if (*__first1 != *__first2)
return false;
return true;
}
template <class _InputIter1, class _InputIter2, class _BinaryPredicate>
inline bool equal(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _BinaryPredicate __binary_pred) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __first1 != __last1; ++__first1, ++__first2)
if (!__binary_pred(*__first1, *__first2))
return false;
return true;
}
template <class _InputIter1, class _InputIter2>
bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter2>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter2>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
for ( ; __first1 != __last1 && __first2 != __last2
; ++__first1, ++__first2) {
if (*__first1 < *__first2)
return true;
if (*__first2 < *__first1)
return false;
}
return __first1 == __last1 && __first2 != __last2;
}
template <class _InputIter1, class _InputIter2, class _Compare>
bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __first1 != __last1 && __first2 != __last2
; ++__first1, ++__first2) {
if (__comp(*__first1, *__first2))
return true;
if (__comp(*__first2, *__first1))
return false;
}
return __first1 == __last1 && __first2 != __last2;
}
inline bool
lexicographical_compare(const unsigned char* __first1,
const unsigned char* __last1,
const unsigned char* __first2,
const unsigned char* __last2)
{
const size_t __len1 = __last1 - __first1;
const size_t __len2 = __last2 - __first2;
const int __result = memcmp(__first1, __first2, min(__len1, __len2));
return __result != 0 ? __result < 0 : __len1 < __len2;
}
inline bool lexicographical_compare(const char* __first1, const char* __last1,
const char* __first2, const char* __last2)
{
return lexicographical_compare((const signed char*) __first1,
(const signed char*) __last1,
(const signed char*) __first2,
(const signed char*) __last2);
}
template <class _InputIter1, class _InputIter2>
int __lexicographical_compare_3way(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2)
{
while (__first1 != __last1 && __first2 != __last2) {
if (*__first1 < *__first2)
return -1;
if (*__first2 < *__first1)
return 1;
++__first1;
++__first2;
}
if (__first2 == __last2) {
return !(__first1 == __last1);
}
else {
return -1;
}
}
inline int
__lexicographical_compare_3way(const unsigned char* __first1,
const unsigned char* __last1,
const unsigned char* __first2,
const unsigned char* __last2)
{
const ptrdiff_t __len1 = __last1 - __first1;
const ptrdiff_t __len2 = __last2 - __first2;
const int __result = memcmp(__first1, __first2, min(__len1, __len2));
return __result != 0 ? __result
: (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1));
}
inline int
__lexicographical_compare_3way(const char* __first1, const char* __last1,
const char* __first2, const char* __last2)
{
return __lexicographical_compare_3way(
(const signed char*) __first1,
(const signed char*) __last1,
(const signed char*) __first2,
(const signed char*) __last2);
}
template <class _InputIter1, class _InputIter2>
int lexicographical_compare_3way(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2)
{
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter2>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter2>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
return __lexicographical_compare_3way(__first1, __last1, __first2, __last2);
}
}
# 21 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 1 3
# 47 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/new" 1 3
# 48 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 53 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 1 3
# 54 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 1 3
# 55 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cassert.h" 1 3
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cassert.h" 3
# 1 "/home/st/andreas/ddd/ddd/assert.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cassert.h" 2 3
# 56 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
# 1 "/usr/include/pthread.h" 1 3
# 32 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 2 3
namespace std {
# 54 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
struct _Refcount_Base
{
typedef size_t _RC_t;
volatile _RC_t _M_ref_count;
pthread_mutex_t _M_ref_count_lock;
_Refcount_Base(_RC_t __n) : _M_ref_count(__n)
{ pthread_mutex_init(&_M_ref_count_lock, 0); }
# 87 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
void _M_incr() {
pthread_mutex_lock(&_M_ref_count_lock);
++_M_ref_count;
pthread_mutex_unlock(&_M_ref_count_lock);
}
_RC_t _M_decr() {
pthread_mutex_lock(&_M_ref_count_lock);
volatile _RC_t __tmp = --_M_ref_count;
pthread_mutex_unlock(&_M_ref_count_lock);
return __tmp;
}
# 114 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
};
# 134 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
template<int __dummy>
struct _Swap_lock_struct {
static pthread_mutex_t _S_swap_lock;
};
template<int __dummy>
pthread_mutex_t
_Swap_lock_struct<__dummy>::_S_swap_lock = {0, 0, 0, PTHREAD_MUTEX_FAST_NP, {0, 0}};
inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) {
pthread_mutex_lock(&_Swap_lock_struct<0>::_S_swap_lock);
unsigned long __result = *__p;
*__p = __q;
pthread_mutex_unlock(&_Swap_lock_struct<0>::_S_swap_lock);
return __result;
}
# 223 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
template <int __inst>
struct _STL_mutex_spin {
enum { __low_max = 30, __high_max = 1000 };
static unsigned __max;
static unsigned __last;
};
template <int __inst>
unsigned _STL_mutex_spin<__inst>::__max = _STL_mutex_spin<__inst>::__low_max;
template <int __inst>
unsigned _STL_mutex_spin<__inst>::__last = 0;
struct _STL_mutex_lock
{
# 319 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
pthread_mutex_t _M_lock;
void _M_initialize() { pthread_mutex_init(&_M_lock, __null); }
void _M_acquire_lock() { pthread_mutex_lock(&_M_lock); }
void _M_release_lock() { pthread_mutex_unlock(&_M_lock); }
# 333 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
};
# 355 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_threads.h" 3
struct _STL_auto_lock
{
_STL_mutex_lock& _M_lock;
_STL_auto_lock(_STL_mutex_lock& __lock) : _M_lock(__lock)
{ _M_lock._M_acquire_lock(); }
~_STL_auto_lock() { _M_lock._M_release_lock(); }
private:
void operator=(const _STL_auto_lock&);
_STL_auto_lock(const _STL_auto_lock&);
};
}
# 62 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 2 3
# 91 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
namespace std {
# 108 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
template <int __inst>
class __malloc_alloc_template {
private:
static void* _S_oom_malloc(size_t);
static void* _S_oom_realloc(void*, size_t);
static void (* __malloc_alloc_oom_handler)();
public:
static void* allocate(size_t __n)
{
void* __result = malloc(__n);
if (0 == __result) __result = _S_oom_malloc(__n);
return __result;
}
static void deallocate(void* __p, size_t )
{
free(__p);
}
static void* reallocate(void* __p, size_t , size_t __new_sz)
{
void* __result = realloc(__p, __new_sz);
if (0 == __result) __result = _S_oom_realloc(__p, __new_sz);
return __result;
}
static void (* __set_malloc_handler(void (*__f)()))()
{
void (* __old)() = __malloc_alloc_oom_handler;
__malloc_alloc_oom_handler = __f;
return(__old);
}
};
template <int __inst>
void (* __malloc_alloc_template<__inst>::__malloc_alloc_oom_handler)() = 0;
template <int __inst>
void*
__malloc_alloc_template<__inst>::_S_oom_malloc(size_t __n)
{
void (* __my_malloc_handler)();
void* __result;
for (;;) {
__my_malloc_handler = __malloc_alloc_oom_handler;
if (0 == __my_malloc_handler) { throw std::bad_alloc(); }
(*__my_malloc_handler)();
__result = malloc(__n);
if (__result) return(__result);
}
}
template <int __inst>
void* __malloc_alloc_template<__inst>::_S_oom_realloc(void* __p, size_t __n)
{
void (* __my_malloc_handler)();
void* __result;
for (;;) {
__my_malloc_handler = __malloc_alloc_oom_handler;
if (0 == __my_malloc_handler) { throw std::bad_alloc(); }
(*__my_malloc_handler)();
__result = realloc(__p, __n);
if (__result) return(__result);
}
}
typedef __malloc_alloc_template<0> malloc_alloc;
template<class _Tp, class _Alloc>
class simple_alloc {
public:
static _Tp* allocate(size_t __n)
{ return 0 == __n ? 0 : (_Tp*) _Alloc::allocate(__n * sizeof (_Tp)); }
static _Tp* allocate(void)
{ return (_Tp*) _Alloc::allocate(sizeof (_Tp)); }
static void deallocate(_Tp* __p, size_t __n)
{ if (0 != __n) _Alloc::deallocate(__p, __n * sizeof (_Tp)); }
static void deallocate(_Tp* __p)
{ _Alloc::deallocate(__p, sizeof (_Tp)); }
};
template <class _Alloc>
class debug_alloc {
private:
enum {_S_extra = 8};
public:
static void* allocate(size_t __n)
{
char* __result = (char*)_Alloc::allocate(__n + (int) _S_extra);
*(size_t*)__result = __n;
return __result + (int) _S_extra;
}
static void deallocate(void* __p, size_t __n)
{
char* __real_p = (char*)__p - (int) _S_extra;
;
_Alloc::deallocate(__real_p, __n + (int) _S_extra);
}
static void* reallocate(void* __p, size_t __old_sz, size_t __new_sz)
{
char* __real_p = (char*)__p - (int) _S_extra;
;
char* __result = (char*)
_Alloc::reallocate(__real_p, __old_sz + (int) _S_extra,
__new_sz + (int) _S_extra);
*(size_t*)__result = __new_sz;
return __result + (int) _S_extra;
}
};
typedef malloc_alloc alloc;
typedef malloc_alloc single_client_alloc;
# 588 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
template <class _Tp>
class allocator {
typedef alloc _Alloc;
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 <class _Tp1> struct rebind {
typedef allocator<_Tp1> other;
};
allocator() throw() {}
allocator(const allocator&) throw() {}
template <class _Tp1> allocator(const allocator<_Tp1>&) throw() {}
~allocator() throw() {}
pointer address(reference __x) const { return &__x; }
const_pointer address(const_reference __x) const { return &__x; }
_Tp* allocate(size_type __n, const void* = 0) {
return __n != 0 ? static_cast<_Tp*>(_Alloc::allocate(__n * sizeof(_Tp)))
: 0;
}
void deallocate(pointer __p, size_type __n)
{ _Alloc::deallocate(__p, __n * sizeof(_Tp)); }
size_type max_size() const throw()
{ return size_t(-1) / sizeof(_Tp); }
void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); }
void destroy(pointer __p) { __p->~_Tp(); }
};
template<>
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 <class _Tp1> struct rebind {
typedef allocator<_Tp1> other;
};
};
template <class _T1, class _T2>
inline bool operator==(const allocator<_T1>&, const allocator<_T2>&)
{
return true;
}
template <class _T1, class _T2>
inline bool operator!=(const allocator<_T1>&, const allocator<_T2>&)
{
return false;
}
# 664 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
template <class _Tp, class _Alloc>
struct __allocator {
_Alloc __underlying_alloc;
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 <class _Tp1> struct rebind {
typedef __allocator<_Tp1, _Alloc> other;
};
__allocator() throw() {}
__allocator(const __allocator& __a) throw()
: __underlying_alloc(__a.__underlying_alloc) {}
template <class _Tp1>
__allocator(const __allocator<_Tp1, _Alloc>& __a) throw()
: __underlying_alloc(__a.__underlying_alloc) {}
~__allocator() throw() {}
pointer address(reference __x) const { return &__x; }
const_pointer address(const_reference __x) const { return &__x; }
_Tp* allocate(size_type __n, const void* = 0) {
return __n != 0
? static_cast<_Tp*>(__underlying_alloc.allocate(__n * sizeof(_Tp)))
: 0;
}
void deallocate(pointer __p, size_type __n)
{ __underlying_alloc.deallocate(__p, __n * sizeof(_Tp)); }
size_type max_size() const throw()
{ return size_t(-1) / sizeof(_Tp); }
void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); }
void destroy(pointer __p) { __p->~_Tp(); }
};
template <class _Alloc>
class __allocator<void, _Alloc> {
typedef size_t size_type;
typedef ptrdiff_t difference_type;
typedef void* pointer;
typedef const void* const_pointer;
typedef void value_type;
template <class _Tp1> struct rebind {
typedef __allocator<_Tp1, _Alloc> other;
};
};
template <class _Tp, class _Alloc>
inline bool operator==(const __allocator<_Tp, _Alloc>& __a1,
const __allocator<_Tp, _Alloc>& __a2)
{
return __a1.__underlying_alloc == __a2.__underlying_alloc;
}
template <class _Tp, class _Alloc>
inline bool operator!=(const __allocator<_Tp, _Alloc>& __a1,
const __allocator<_Tp, _Alloc>& __a2)
{
return __a1.__underlying_alloc != __a2.__underlying_alloc;
}
template <int inst>
inline bool operator==(const __malloc_alloc_template<inst>&,
const __malloc_alloc_template<inst>&)
{
return true;
}
template <int __inst>
inline bool operator!=(const __malloc_alloc_template<__inst>&,
const __malloc_alloc_template<__inst>&)
{
return false;
}
template <class _Alloc>
inline bool operator==(const debug_alloc<_Alloc>&,
const debug_alloc<_Alloc>&) {
return true;
}
template <class _Alloc>
inline bool operator!=(const debug_alloc<_Alloc>&,
const debug_alloc<_Alloc>&) {
return false;
}
# 800 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
template <class _Tp, class _Allocator>
struct _Alloc_traits
{
static const bool _S_instanceless = false;
typedef typename _Allocator:: rebind<_Tp>::other
allocator_type;
};
template <class _Tp, class _Allocator>
const bool _Alloc_traits<_Tp, _Allocator>::_S_instanceless;
template <class _Tp, class _Tp1>
struct _Alloc_traits<_Tp, allocator<_Tp1> >
{
static const bool _S_instanceless = true;
typedef simple_alloc<_Tp, alloc> _Alloc_type;
typedef allocator<_Tp> allocator_type;
};
template <class _Tp, int __inst>
struct _Alloc_traits<_Tp, __malloc_alloc_template<__inst> >
{
static const bool _S_instanceless = true;
typedef simple_alloc<_Tp, __malloc_alloc_template<__inst> > _Alloc_type;
typedef __allocator<_Tp, __malloc_alloc_template<__inst> > allocator_type;
};
# 843 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
template <class _Tp, class _Alloc>
struct _Alloc_traits<_Tp, debug_alloc<_Alloc> >
{
static const bool _S_instanceless = true;
typedef simple_alloc<_Tp, debug_alloc<_Alloc> > _Alloc_type;
typedef __allocator<_Tp, debug_alloc<_Alloc> > allocator_type;
};
template <class _Tp, class _Tp1, int __inst>
struct _Alloc_traits<_Tp,
__allocator<_Tp1, __malloc_alloc_template<__inst> > >
{
static const bool _S_instanceless = true;
typedef simple_alloc<_Tp, __malloc_alloc_template<__inst> > _Alloc_type;
typedef __allocator<_Tp, __malloc_alloc_template<__inst> > allocator_type;
};
# 877 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
template <class _Tp, class _Tp1, class _Alloc>
struct _Alloc_traits<_Tp, __allocator<_Tp1, debug_alloc<_Alloc> > >
{
static const bool _S_instanceless = true;
typedef simple_alloc<_Tp, debug_alloc<_Alloc> > _Alloc_type;
typedef __allocator<_Tp, debug_alloc<_Alloc> > allocator_type;
};
# 892 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 3
}
# 22 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_construct.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_construct.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/new" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_construct.h" 2 3
namespace std {
# 46 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_construct.h" 3
template <class _T1, class _T2>
inline void _Construct(_T1* __p, const _T2& __value) {
new ((void*) __p) _T1(__value);
}
template <class _T1>
inline void _Construct(_T1* __p) {
new ((void*) __p) _T1();
}
template <class _Tp>
inline void _Destroy(_Tp* __pointer) {
__pointer->~_Tp();
}
template <class _ForwardIterator>
void
__destroy_aux(_ForwardIterator __first, _ForwardIterator __last, __false_type)
{
for ( ; __first != __last; ++__first)
destroy(&*__first);
}
template <class _ForwardIterator>
inline void __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type) {}
template <class _ForwardIterator, class _Tp>
inline void
__destroy(_ForwardIterator __first, _ForwardIterator __last, _Tp*)
{
typedef typename __type_traits<_Tp>::has_trivial_destructor
_Trivial_destructor;
__destroy_aux(__first, __last, _Trivial_destructor());
}
template <class _ForwardIterator>
inline void _Destroy(_ForwardIterator __first, _ForwardIterator __last) {
__destroy(__first, __last, __value_type(__first));
}
inline void _Destroy(char*, char*) {}
inline void _Destroy(int*, int*) {}
inline void _Destroy(long*, long*) {}
inline void _Destroy(float*, float*) {}
inline void _Destroy(double*, double*) {}
inline void _Destroy(wchar_t*, wchar_t*) {}
template <class _T1, class _T2>
inline void construct(_T1* __p, const _T2& __value) {
_Construct(__p, __value);
}
template <class _T1>
inline void construct(_T1* __p) {
_Construct(__p);
}
template <class _Tp>
inline void destroy(_Tp* __pointer) {
_Destroy(__pointer);
}
template <class _ForwardIterator>
inline void destroy(_ForwardIterator __first, _ForwardIterator __last) {
_Destroy(__first, __last);
}
}
# 23 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_iterator_base.h" 1 3
# 24 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_tempbuf.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_tempbuf.h" 3
namespace std {
template <class _Tp>
pair<_Tp*, ptrdiff_t>
__get_temporary_buffer(ptrdiff_t __len, _Tp*)
{
if (__len > ptrdiff_t(2147483647 / sizeof(_Tp)))
__len = 2147483647 / sizeof(_Tp);
while (__len > 0) {
_Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp));
if (__tmp != 0)
return pair<_Tp*, ptrdiff_t>(__tmp, __len);
__len /= 2;
}
return pair<_Tp*, ptrdiff_t>((_Tp*)0, 0);
}
template <class _Tp>
inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len) {
return __get_temporary_buffer(__len, (_Tp*) 0);
}
# 67 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_tempbuf.h" 3
template <class _Tp>
inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len, _Tp*) {
return __get_temporary_buffer(__len, (_Tp*) 0);
}
template <class _Tp>
void return_temporary_buffer(_Tp* __p) {
free(__p);
}
template <class _ForwardIterator, class _Tp>
class _Temporary_buffer {
private:
ptrdiff_t _M_original_len;
ptrdiff_t _M_len;
_Tp* _M_buffer;
void _M_allocate_buffer() {
_M_original_len = _M_len;
_M_buffer = 0;
if (_M_len > (ptrdiff_t)(2147483647 / sizeof(_Tp)))
_M_len = 2147483647 / sizeof(_Tp);
while (_M_len > 0) {
_M_buffer = (_Tp*) malloc(_M_len * sizeof(_Tp));
if (_M_buffer)
break;
_M_len /= 2;
}
}
void _M_initialize_buffer(const _Tp&, __true_type) {}
void _M_initialize_buffer(const _Tp& val, __false_type) {
uninitialized_fill_n(_M_buffer, _M_len, val);
}
public:
ptrdiff_t size() const { return _M_len; }
ptrdiff_t requested_size() const { return _M_original_len; }
_Tp* begin() { return _M_buffer; }
_Tp* end() { return _M_buffer + _M_len; }
_Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) {
typedef typename __type_traits<_Tp>::has_trivial_default_constructor
_Trivial;
try {
_M_len = 0;
distance(__first, __last, _M_len);
_M_allocate_buffer();
if (_M_len > 0)
_M_initialize_buffer(*__first, _Trivial());
}
catch(...) { free(_M_buffer); _M_buffer = 0; _M_len = 0; throw; };
}
~_Temporary_buffer() {
destroy(_M_buffer, _M_buffer + _M_len);
free(_M_buffer);
}
private:
_Temporary_buffer(const _Temporary_buffer&) {}
void operator=(const _Temporary_buffer&) {}
};
template <class _ForwardIterator,
class _Tp
= typename iterator_traits<_ForwardIterator>::value_type
>
struct temporary_buffer : public _Temporary_buffer<_ForwardIterator, _Tp>
{
temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)
: _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) {}
~temporary_buffer() {}
};
}
# 25 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_uninitialized.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_uninitialized.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstring.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_uninitialized.h" 2 3
namespace std {
template <class _InputIter, class _ForwardIter>
inline _ForwardIter
__uninitialized_copy_aux(_InputIter __first, _InputIter __last,
_ForwardIter __result,
__true_type)
{
return copy(__first, __last, __result);
}
template <class _InputIter, class _ForwardIter>
_ForwardIter
__uninitialized_copy_aux(_InputIter __first, _InputIter __last,
_ForwardIter __result,
__false_type)
{
_ForwardIter __cur = __result;
try {
for ( ; __first != __last; ++__first, ++__cur)
_Construct(&*__cur, *__first);
return __cur;
}
catch(...) { _Destroy(__result, __cur); throw; };
}
template <class _InputIter, class _ForwardIter, class _Tp>
inline _ForwardIter
__uninitialized_copy(_InputIter __first, _InputIter __last,
_ForwardIter __result, _Tp*)
{
typedef typename __type_traits<_Tp>::is_POD_type _Is_POD;
return __uninitialized_copy_aux(__first, __last, __result, _Is_POD());
}
template <class _InputIter, class _ForwardIter>
inline _ForwardIter
uninitialized_copy(_InputIter __first, _InputIter __last,
_ForwardIter __result)
{
return __uninitialized_copy(__first, __last, __result,
__value_type(__result));
}
inline char* uninitialized_copy(const char* __first, const char* __last,
char* __result) {
memmove(__result, __first, __last - __first);
return __result + (__last - __first);
}
inline wchar_t*
uninitialized_copy(const wchar_t* __first, const wchar_t* __last,
wchar_t* __result)
{
memmove(__result, __first, sizeof(wchar_t) * (__last - __first));
return __result + (__last - __first);
}
template <class _InputIter, class _Size, class _ForwardIter>
pair<_InputIter, _ForwardIter>
__uninitialized_copy_n(_InputIter __first, _Size __count,
_ForwardIter __result,
input_iterator_tag)
{
_ForwardIter __cur = __result;
try {
for ( ; __count > 0 ; --__count, ++__first, ++__cur)
_Construct(&*__cur, *__first);
return pair<_InputIter, _ForwardIter>(__first, __cur);
}
catch(...) { _Destroy(__result, __cur); throw; };
}
template <class _RandomAccessIter, class _Size, class _ForwardIter>
inline pair<_RandomAccessIter, _ForwardIter>
__uninitialized_copy_n(_RandomAccessIter __first, _Size __count,
_ForwardIter __result,
random_access_iterator_tag) {
_RandomAccessIter __last = __first + __count;
return pair<_RandomAccessIter, _ForwardIter>(
__last,
uninitialized_copy(__first, __last, __result));
}
template <class _InputIter, class _Size, class _ForwardIter>
inline pair<_InputIter, _ForwardIter>
__uninitialized_copy_n(_InputIter __first, _Size __count,
_ForwardIter __result) {
return __uninitialized_copy_n(__first, __count, __result,
__iterator_category(__first));
}
template <class _InputIter, class _Size, class _ForwardIter>
inline pair<_InputIter, _ForwardIter>
uninitialized_copy_n(_InputIter __first, _Size __count,
_ForwardIter __result) {
return __uninitialized_copy_n(__first, __count, __result,
__iterator_category(__first));
}
template <class _ForwardIter, class _Tp>
inline void
__uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last,
const _Tp& __x, __true_type)
{
fill(__first, __last, __x);
}
template <class _ForwardIter, class _Tp>
void
__uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last,
const _Tp& __x, __false_type)
{
_ForwardIter __cur = __first;
try {
for ( ; __cur != __last; ++__cur)
_Construct(&*__cur, __x);
}
catch(...) { _Destroy(__first, __cur); throw; };
}
template <class _ForwardIter, class _Tp, class _Tp1>
inline void __uninitialized_fill(_ForwardIter __first,
_ForwardIter __last, const _Tp& __x, _Tp1*)
{
typedef typename __type_traits<_Tp1>::is_POD_type _Is_POD;
__uninitialized_fill_aux(__first, __last, __x, _Is_POD());
}
template <class _ForwardIter, class _Tp>
inline void uninitialized_fill(_ForwardIter __first,
_ForwardIter __last,
const _Tp& __x)
{
__uninitialized_fill(__first, __last, __x, __value_type(__first));
}
template <class _ForwardIter, class _Size, class _Tp>
inline _ForwardIter
__uninitialized_fill_n_aux(_ForwardIter __first, _Size __n,
const _Tp& __x, __true_type)
{
return fill_n(__first, __n, __x);
}
template <class _ForwardIter, class _Size, class _Tp>
_ForwardIter
__uninitialized_fill_n_aux(_ForwardIter __first, _Size __n,
const _Tp& __x, __false_type)
{
_ForwardIter __cur = __first;
try {
for ( ; __n > 0; --__n, ++__cur)
_Construct(&*__cur, __x);
return __cur;
}
catch(...) { _Destroy(__first, __cur); throw; };
}
template <class _ForwardIter, class _Size, class _Tp, class _Tp1>
inline _ForwardIter
__uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x, _Tp1*)
{
typedef typename __type_traits<_Tp1>::is_POD_type _Is_POD;
return __uninitialized_fill_n_aux(__first, __n, __x, _Is_POD());
}
template <class _ForwardIter, class _Size, class _Tp>
inline _ForwardIter
uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x)
{
return __uninitialized_fill_n(__first, __n, __x, __value_type(__first));
}
# 230 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_uninitialized.h" 3
template <class _InputIter1, class _InputIter2, class _ForwardIter>
inline _ForwardIter
__uninitialized_copy_copy(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_ForwardIter __result)
{
_ForwardIter __mid = uninitialized_copy(__first1, __last1, __result);
try {
return uninitialized_copy(__first2, __last2, __mid);
}
catch(...) { _Destroy(__result, __mid); throw; };
}
template <class _ForwardIter, class _Tp, class _InputIter>
inline _ForwardIter
__uninitialized_fill_copy(_ForwardIter __result, _ForwardIter __mid,
const _Tp& __x,
_InputIter __first, _InputIter __last)
{
uninitialized_fill(__result, __mid, __x);
try {
return uninitialized_copy(__first, __last, __mid);
}
catch(...) { _Destroy(__result, __mid); throw; };
}
template <class _InputIter, class _ForwardIter, class _Tp>
inline void
__uninitialized_copy_fill(_InputIter __first1, _InputIter __last1,
_ForwardIter __first2, _ForwardIter __last2,
const _Tp& __x)
{
_ForwardIter __mid2 = uninitialized_copy(__first1, __last1, __first2);
try {
uninitialized_fill(__mid2, __last2, __x);
}
catch(...) { _Destroy(__first2, __mid2); throw; };
}
}
# 26 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_raw_storage_iter.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_raw_storage_iter.h" 3
namespace std {
template <class _ForwardIterator, class _Tp>
class raw_storage_iterator {
protected:
_ForwardIterator _M_iter;
public:
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
explicit raw_storage_iterator(_ForwardIterator __x) : _M_iter(__x) {}
raw_storage_iterator& operator*() { return *this; }
raw_storage_iterator& operator=(const _Tp& __element) {
construct(&*_M_iter, __element);
return *this;
}
raw_storage_iterator<_ForwardIterator, _Tp>& operator++() {
++_M_iter;
return *this;
}
raw_storage_iterator<_ForwardIterator, _Tp> operator++(int) {
raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this;
++_M_iter;
return __tmp;
}
};
# 75 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_raw_storage_iter.h" 3
}
# 27 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 2 3
namespace std {
template<class _Tp1> struct auto_ptr_ref {
_Tp1* _M_ptr;
auto_ptr_ref(_Tp1* __p) : _M_ptr(__p) {}
};
template <class _Tp> class auto_ptr {
private:
_Tp* _M_ptr;
public:
typedef _Tp element_type;
explicit auto_ptr(_Tp* __p = 0) throw() : _M_ptr(__p) {}
auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) {}
template <class _Tp1> auto_ptr(auto_ptr<_Tp1>& __a) throw()
: _M_ptr(__a.release()) {}
auto_ptr& operator=(auto_ptr& __a) throw() {
reset(__a.release());
return *this;
}
template <class _Tp1>
auto_ptr& operator=(auto_ptr<_Tp1>& __a) throw() {
reset(__a.release());
return *this;
}
~auto_ptr() { delete _M_ptr; }
_Tp& operator*() const throw() {
return *_M_ptr;
}
_Tp* operator->() const throw() {
return _M_ptr;
}
_Tp* get() const throw() {
return _M_ptr;
}
_Tp* release() throw() {
_Tp* __tmp = _M_ptr;
_M_ptr = 0;
return __tmp;
}
void reset(_Tp* __p = 0) throw() {
if (__p != _M_ptr) {
delete _M_ptr;
_M_ptr = __p;
}
}
# 103 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 3
public:
auto_ptr(auto_ptr_ref<_Tp> __ref) throw()
: _M_ptr(__ref._M_ptr) {}
auto_ptr& operator=(auto_ptr_ref<_Tp> __ref) throw() {
if (__ref._M_ptr != this->get()) {
delete _M_ptr;
_M_ptr = __ref._M_ptr;
}
return *this;
}
template <class _Tp1> operator auto_ptr_ref<_Tp1>() throw()
{ return auto_ptr_ref<_Tp>(this->release()); }
template <class _Tp1> operator auto_ptr<_Tp1>() throw()
{ return auto_ptr<_Tp1>(this->release()); }
};
}
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/type_traits.h" 1 3
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 1 3
# 46 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/atomicity.h" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/atomicity.h" 3
typedef int _Atomic_word;
static inline _Atomic_word
__attribute__ ((__unused__))
__exchange_and_add (volatile _Atomic_word *__mem, int __val)
{
register _Atomic_word __result;
__asm__ __volatile__ ("lock; xaddl %0,%2"
: "=r" (__result)
: "0" (__val), "m" (*__mem)
: "memory");
return __result;
}
static inline void
__attribute__ ((__unused__))
__atomic_add (volatile _Atomic_word* __mem, int __val)
{
__asm__ __volatile__ ("lock; addl %0,%1"
: : "ir" (__val), "m" (*__mem) : "memory");
}
static inline char
__attribute__ ((__unused__))
__compare_and_swap (volatile long* __p, long __oldval, long __newval)
{
char __ret;
long __readval;
__asm__ __volatile__ ("lock; cmpxchgl %3, %1; sete %0"
: "=q" (__ret), "=m" (*__p), "=a" (__readval)
: "r" (__newval), "m" (*__p), "a" (__oldval));
return __ret;
}
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 2 3
namespace std {
# 82 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 3
template<typename _CharT, typename _Traits, typename _Alloc>
class basic_string
{
public:
typedef _Traits traits_type;
typedef typename _Traits::char_type value_type;
typedef _Alloc allocator_type;
typedef typename _Alloc::size_type size_type;
typedef typename _Alloc::difference_type difference_type;
typedef typename _Alloc::reference reference;
typedef typename _Alloc::const_reference const_reference;
typedef typename _Alloc::pointer pointer;
typedef typename _Alloc::const_pointer const_pointer;
typedef __normal_iterator<pointer, basic_string> iterator;
typedef __normal_iterator<const_pointer, basic_string> const_iterator;
typedef reverse_iterator<const_iterator> const_reverse_iterator;
typedef reverse_iterator<iterator> reverse_iterator;
private:
# 117 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 3
struct _Rep
{
typedef typename _Alloc::rebind<char>::other _Raw_bytes_alloc;
# 135 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 3
static const size_type _S_max_size;
static const _CharT _S_terminal;
size_type _M_length;
size_type _M_capacity;
_Atomic_word _M_references;
bool
_M_is_leaked() const
{ return _M_references < 0; }
bool
_M_is_shared() const
{ return _M_references > 0; }
void
_M_set_leaked()
{ _M_references = -1; }
void
_M_set_sharable()
{ _M_references = 0; }
_CharT*
_M_refdata() throw()
{ return reinterpret_cast<_CharT*> (this + 1); }
_CharT&
operator[](size_t __s) throw()
{ return _M_refdata() [__s]; }
_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_t, const _Alloc&);
void
_M_dispose(const _Alloc& __a)
{
if (__exchange_and_add(&_M_references, -1) <= 0)
_M_destroy(__a);
}
void
_M_destroy(const _Alloc&) throw();
_CharT*
_M_refcopy() throw()
{
__atomic_add(&_M_references, 1);
return _M_refdata();
}
_CharT*
_M_clone(const _Alloc&, size_type __res = 0);
# 207 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.h" 3
inline static bool
_S_excess_slop(size_t, size_t);
};
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;
static size_type _S_empty_rep_storage[(sizeof(_Rep) + sizeof(_CharT) + sizeof(size_type) - 1)/sizeof(size_type)];
_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();
}
iterator
_M_check(size_type __pos) const
{
if (__pos > this->size())
__throw_out_of_range("basic_string::_M_check");
return _M_ibegin() + __pos;
}
iterator
_M_fold(size_type __pos, size_type __off) const
{
bool __testoff = __off < this->size() - __pos;
size_type __newoff = __testoff ? __off : this->size() - __pos;
return (_M_ibegin() + __pos + __newoff);
}
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)
{ traits_type::copy(__p, __k1, __k2 - __k1); }
static void
_S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
{ traits_type::copy(__p, __k1, __k2 - __k1); }
void
_M_mutate(size_type __pos, size_type __len1, size_type __len2);
void
_M_leak_hard();
static _Rep&
_S_empty_rep()
{ return *reinterpret_cast<_Rep*>(&_S_empty_rep_storage); }
public:
inline
basic_string();
explicit
basic_string(const _Alloc& __a);
basic_string(const basic_string& __str);
basic_string(const basic_string& __str, size_type __pos,
size_type __n = npos);
basic_string(const basic_string& __str, size_type __pos,
size_type __n, const _Alloc& __a);
basic_string(const _CharT* __s, size_type __n,
const _Alloc& __a = _Alloc());
basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());
basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());
template<class _InputIterator>
basic_string(_InputIterator __begin, _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); }
basic_string&
operator=(_CharT __c) { return this->assign(1, __c); }
iterator
begin()
{
_M_leak();
return iterator(_M_data());
}
const_iterator
begin() const
{ return const_iterator(_M_data()); }
iterator
end()
{
_M_leak();
return iterator(_M_data() + this->size());
}
const_iterator
end() const
{ return const_iterator(_M_data() + this->size()); }
reverse_iterator
rbegin()
{ return reverse_iterator(this->end()); }
const_reverse_iterator
rbegin() const
{ return const_reverse_iterator(this->end()); }
reverse_iterator
rend()
{ return reverse_iterator(this->begin()); }
const_reverse_iterator
rend() const
{ return const_reverse_iterator(this->begin()); }
public:
size_type
size() const { return _M_rep()->_M_length; }
size_type
length() const { return _M_rep()->_M_length; }
size_type
max_size() const { return _Rep::_S_max_size; }
void
resize(size_type __n, _CharT __c);
void
resize(size_type __n) { this->resize(__n, _CharT()); }
size_type
capacity() const { return _M_rep()->_M_capacity; }
void
reserve(size_type __res_arg = 0);
void
clear() { _M_mutate(0, this->size(), 0); }
bool
empty() const { return this->size() == 0; }
const_reference
operator[] (size_type __pos) const
{ return _M_data()[__pos]; }
reference
operator[](size_type __pos)
{
_M_leak();
return _M_data()[__pos];
}
const_reference
at(size_type __n) const
{
if (__n >= this->size())
__throw_out_of_range("basic_string::at");
return _M_data()[__n];
}
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) { return this->append(size_type(1), __c); }
basic_string&
append(const basic_string& __str);
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)); }
basic_string&
append(size_type __n, _CharT __c);
template<class _InputIterator>
basic_string&
append(_InputIterator __first, _InputIterator __last)
{ return this->replace(_M_iend(), _M_iend(), __first, __last); }
void
push_back(_CharT __c)
{ this->replace(_M_iend(), _M_iend(), 1, __c); }
basic_string&
assign(const basic_string& __str);
basic_string&
assign(const basic_string& __str, size_type __pos, size_type __n)
{
return this->assign(__str._M_check(__pos), __str._M_fold(__pos, __n));
}
basic_string&
assign(const _CharT* __s, size_type __n)
{ return this->assign(__s, __s + __n); }
basic_string&
assign(const _CharT* __s)
{ return this->assign(__s, __s + traits_type::length(__s)); }
basic_string&
assign(size_type __n, _CharT __c)
{ return this->replace(_M_ibegin(), _M_iend(), __n, __c); }
template<class _InputIterator>
basic_string&
assign(_InputIterator __first, _InputIterator __last)
{ return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
void
insert(iterator __p, size_type __n, _CharT __c)
{ this->replace(__p, __p, __n, __c); }
template<class _InputIterator>
void insert(iterator __p, _InputIterator __beg, _InputIterator __end)
{ this->replace(__p, __p, __beg, __end); }
basic_string&
insert(size_type __pos1, const basic_string& __str)
{
iterator __p = _M_check(__pos1);
this->replace(__p, __p, __str._M_ibegin(), __str._M_iend());
return *this;
}
basic_string&
insert(size_type __pos1, const basic_string& __str,
size_type __pos2, size_type __n)
{
iterator __p = _M_check(__pos1);
this->replace(__p, __p, __str._M_check(__pos2),
__str._M_fold(__pos2, __n));
return *this;
}
basic_string&
insert(size_type __pos, const _CharT* __s, size_type __n)
{
iterator __p = _M_check(__pos);
this->replace(__p, __p, __s, __s + __n);
return *this;
}
basic_string&
insert(size_type __pos, const _CharT* __s)
{ return this->insert(__pos, __s, traits_type::length(__s)); }
basic_string&
insert(size_type __pos, size_type __n, _CharT __c)
{
this->insert(_M_check(__pos), __n, __c);
return *this;
}
iterator
insert(iterator __p, _CharT __c = _CharT())
{
size_type __pos = __p - _M_ibegin();
this->insert(_M_check(__pos), size_type(1), __c);
_M_rep()->_M_set_leaked();
return this->_M_ibegin() + __pos;
}
basic_string&
erase(size_type __pos = 0, size_type __n = npos)
{
return this->replace(_M_check(__pos), _M_fold(__pos, __n),
_M_data(), _M_data());
}
iterator
erase(iterator __position)
{
size_type __i = __position - _M_ibegin();
this->replace(__position, __position + 1, _M_data(), _M_data());
_M_rep()->_M_set_leaked();
return _M_ibegin() + __i;
}
iterator
erase(iterator __first, iterator __last)
{
size_type __i = __first - _M_ibegin();
this->replace(__first, __last, _M_data(), _M_data());
_M_rep()->_M_set_leaked();
return _M_ibegin() + __i;
}
basic_string&
replace(size_type __pos, size_type __n, const basic_string& __str)
{
return this->replace(_M_check(__pos), _M_fold(__pos, __n),
__str.begin(), __str.end());
}
basic_string&
replace(size_type __pos1, size_type __n1, const basic_string& __str,
size_type __pos2, size_type __n2);
basic_string&
replace(size_type __pos, size_type __n1, const _CharT* __s,
size_type __n2)
{
return this->replace(_M_check(__pos), _M_fold(__pos, __n1),
__s, __s + __n2);
}
basic_string&
replace(size_type __pos, size_type __n1, const _CharT* __s)
{
return this->replace(_M_check(__pos), _M_fold(__pos, __n1),
__s, __s + traits_type::length(__s));
}
basic_string&
replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
{
return this->replace(_M_check(__pos), _M_fold(__pos, __n1), __n2, __c);
}
basic_string&
replace(iterator __i1, iterator __i2, const basic_string& __str)
{ return this->replace(__i1, __i2, __str.begin(), __str.end()); }
basic_string&
replace(iterator __i1, iterator __i2,
const _CharT* __s, size_type __n)
{ return this->replace(__i1, __i2, __s, __s + __n); }
basic_string&
replace(iterator __i1, iterator __i2, const _CharT* __s)
{ return this->replace(__i1, __i2, __s,
__s + traits_type::length(__s)); }
basic_string&
replace(iterator __i1, iterator __i2, size_type __n, _CharT __c);
template<class _InputIterator>
basic_string&
replace(iterator __i1, iterator __i2,
_InputIterator __k1, _InputIterator __k2)
{ return _M_replace(__i1, __i2, __k1, __k2,
typename iterator_traits<_InputIterator>::iterator_category()); }
private:
template<class _InputIterator>
basic_string&
_M_replace(iterator __i1, iterator __i2, _InputIterator __k1,
_InputIterator __k2, input_iterator_tag);
template<class _FwdIterator>
basic_string&
_M_replace(iterator __i1, iterator __i2, _FwdIterator __k1,
_FwdIterator __k2, forward_iterator_tag);
template<class _InIter>
static _CharT*
_S_construct_aux(_InIter __beg, _InIter __end, const _Alloc& __a,
__false_type)
{
typedef typename iterator_traits<_InIter>::iterator_category _Tag;
return _S_construct(__beg, __end, __a, _Tag());
}
template<class _InIter>
static _CharT*
_S_construct_aux(_InIter __beg, _InIter __end, const _Alloc& __a,
__true_type)
{
return _S_construct(static_cast<size_type>(__beg),
static_cast<value_type>(__end), __a);
}
template<class _InIter>
static _CharT*
_S_construct(_InIter __beg, _InIter __end, const _Alloc& __a)
{
typedef typename _Is_integer<_InIter>::_Integral _Integral;
return _S_construct_aux(__beg, __end, __a, _Integral());
}
template<class _InIter>
static _CharT*
_S_construct(_InIter __beg, _InIter __end, const _Alloc& __a,
input_iterator_tag);
template<class _FwdIter>
static _CharT*
_S_construct(_FwdIter __end, _FwdIter __beg, const _Alloc& __a,
forward_iterator_tag);
static _CharT*
_S_construct(size_type __req, _CharT __c, const _Alloc& __a);
public:
size_type
copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
void
swap(basic_string<_CharT, _Traits, _Alloc>& __s);
const _CharT*
c_str() const
{
size_type __n = this->size();
traits_type::assign(_M_data()[__n], _Rep::_S_terminal);
return _M_data();
}
const _CharT*
data() const { return _M_data(); }
allocator_type
get_allocator() const { return _M_dataplus; }
size_type
find(const _CharT* __s, size_type __pos, size_type __n) const;
size_type
find(const basic_string& __str, size_type __pos = 0) const
{ return this->find(__str.data(), __pos, __str.size()); }
size_type
find(const _CharT* __s, size_type __pos = 0) const
{ return this->find(__s, __pos, traits_type::length(__s)); }
size_type
find(_CharT __c, size_type __pos = 0) const;
size_type
rfind(const basic_string& __str, size_type __pos = npos) const
{ return this->rfind(__str.data(), __pos, __str.size()); }
size_type
rfind(const _CharT* __s, size_type __pos, size_type __n) const;
size_type
rfind(const _CharT* __s, size_type __pos = npos) const
{ return this->rfind(__s, __pos, traits_type::length(__s)); }
size_type
rfind(_CharT __c, size_type __pos = npos) const;
size_type
find_first_of(const basic_string& __str, size_type __pos = 0) const
{ return this->find_first_of(__str.data(), __pos, __str.size()); }
size_type
find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
size_type
find_first_of(const _CharT* __s, size_type __pos = 0) const
{ return this->find_first_of(__s, __pos, traits_type::length(__s)); }
size_type
find_first_of(_CharT __c, size_type __pos = 0) const
{ return this->find(__c, __pos); }
size_type
find_last_of(const basic_string& __str, size_type __pos = npos) const
{ return this->find_last_of(__str.data(), __pos, __str.size()); }
size_type
find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
size_type
find_last_of(const _CharT* __s, size_type __pos = npos) const
{ return this->find_last_of(__s, __pos, traits_type::length(__s)); }
size_type
find_last_of(_CharT __c, size_type __pos = npos) const
{ return this->rfind(__c, __pos); }
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()); }
size_type
find_first_not_of(const _CharT* __s, size_type __pos,
size_type __n) const;
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)); }
size_type
find_first_not_of(_CharT __c, size_type __pos = 0) const;
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()); }
size_type
find_last_not_of(const _CharT* __s, size_type __pos,
size_type __n) const;
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)); }
size_type
find_last_not_of(_CharT __c, size_type __pos = npos) const;
basic_string
substr(size_type __pos = 0, size_type __n = npos) const
{
if (__pos > this->size())
__throw_out_of_range("basic_string::substr");
return basic_string(*this, __pos, __n);
}
int
compare(const basic_string& __str) const
{
size_type __size = this->size();
size_type __osize = __str.size();
size_type __len = min(__size, __osize);
int __r = traits_type::compare(_M_data(), __str.data(), __len);
if (!__r)
__r = __size - __osize;
return __r;
}
int
compare(size_type __pos, size_type __n, const basic_string& __str) const;
int
compare(size_type __pos1, size_type __n1, const basic_string& __str,
size_type __pos2, size_type __n2) const;
int
compare(const _CharT* __s) const;
int
compare(size_type __pos, size_type __n1, const _CharT* __s,
size_type __n2 = npos) const;
};
template<typename _CharT, typename _Traits, typename _Alloc>
inline basic_string<_CharT, _Traits, _Alloc>::
basic_string()
: _M_dataplus(_S_empty_rep()._M_refcopy(), _Alloc()) { }
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;
}
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
const basic_string<_CharT, _Traits, _Alloc>& __rhs)
{ return __lhs.compare(__rhs) == 0; }
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
operator==(const _CharT* __lhs,
const basic_string<_CharT, _Traits, _Alloc>& __rhs)
{ return __rhs.compare(__lhs) == 0; }
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
const _CharT* __rhs)
{ return __lhs.compare(__rhs) == 0; }
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
const basic_string<_CharT, _Traits, _Alloc>& __rhs)
{ return __rhs.compare(__lhs) != 0; }
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
operator!=(const _CharT* __lhs,
const basic_string<_CharT, _Traits, _Alloc>& __rhs)
{ return __rhs.compare(__lhs) != 0; }
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
const _CharT* __rhs)
{ return __lhs.compare(__rhs) != 0; }
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; }
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; }
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; }
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; }
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); }
template<typename _CharT, typename _Traits, typename _Alloc>
basic_istream<_CharT, _Traits>&
operator>>(basic_istream<_CharT, _Traits>& __is,
basic_string<_CharT, _Traits, _Alloc>& __str);
template<typename _CharT, typename _Traits, typename _Alloc>
basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __os,
const basic_string<_CharT, _Traits, _Alloc>& __str);
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);
template<typename _CharT, typename _Traits, typename _Alloc>
inline basic_istream<_CharT,_Traits>&
getline(basic_istream<_CharT, _Traits>& __is,
basic_string<_CharT, _Traits, _Alloc>& __str);
}
# 47 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_construct.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_uninitialized.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_tempbuf.h" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algo.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algo.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_heap.h" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_heap.h" 3
namespace std {
template <class _RandomAccessIterator, class _Distance, class _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;
}
template <class _RandomAccessIterator, class _Distance, class _Tp>
inline void
__push_heap_aux(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Distance*, _Tp*)
{
__push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
_Tp(*(__last - 1)));
}
template <class _RandomAccessIterator>
inline void
push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIterator>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIterator>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
__push_heap_aux(__first, __last,
__distance_type(__first), __value_type(__first));
}
template <class _RandomAccessIterator, class _Distance, class _Tp,
class _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;
}
template <class _RandomAccessIterator, class _Compare,
class _Distance, class _Tp>
inline void
__push_heap_aux(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp,
_Distance*, _Tp*)
{
__push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
_Tp(*(__last - 1)), __comp);
}
template <class _RandomAccessIterator, class _Compare>
inline void
push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
_Compare __comp)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
__push_heap_aux(__first, __last, __comp,
__distance_type(__first), __value_type(__first));
}
template <class _RandomAccessIterator, class _Distance, class _Tp>
void
__adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
_Distance __len, _Tp __value)
{
_Distance __topIndex = __holeIndex;
_Distance __secondChild = 2 * __holeIndex + 2;
while (__secondChild < __len) {
if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
__secondChild--;
*(__first + __holeIndex) = *(__first + __secondChild);
__holeIndex = __secondChild;
__secondChild = 2 * (__secondChild + 1);
}
if (__secondChild == __len) {
*(__first + __holeIndex) = *(__first + (__secondChild - 1));
__holeIndex = __secondChild - 1;
}
__push_heap(__first, __holeIndex, __topIndex, __value);
}
template <class _RandomAccessIterator, class _Tp, class _Distance>
inline void
__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
_RandomAccessIterator __result, _Tp __value, _Distance*)
{
*__result = *__first;
__adjust_heap(__first, _Distance(0), _Distance(__last - __first), __value);
}
template <class _RandomAccessIterator, class _Tp>
inline void
__pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last,
_Tp*)
{
__pop_heap(__first, __last - 1, __last - 1,
_Tp(*(__last - 1)), __distance_type(__first));
}
template <class _RandomAccessIterator>
inline void pop_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIterator>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIterator>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
__pop_heap_aux(__first, __last, __value_type(__first));
}
template <class _RandomAccessIterator, class _Distance,
class _Tp, class _Compare>
void
__adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
_Distance __len, _Tp __value, _Compare __comp)
{
_Distance __topIndex = __holeIndex;
_Distance __secondChild = 2 * __holeIndex + 2;
while (__secondChild < __len) {
if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1))))
__secondChild--;
*(__first + __holeIndex) = *(__first + __secondChild);
__holeIndex = __secondChild;
__secondChild = 2 * (__secondChild + 1);
}
if (__secondChild == __len) {
*(__first + __holeIndex) = *(__first + (__secondChild - 1));
__holeIndex = __secondChild - 1;
}
__push_heap(__first, __holeIndex, __topIndex, __value, __comp);
}
template <class _RandomAccessIterator, class _Tp, class _Compare,
class _Distance>
inline void
__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
_RandomAccessIterator __result, _Tp __value, _Compare __comp,
_Distance*)
{
*__result = *__first;
__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
__value, __comp);
}
template <class _RandomAccessIterator, class _Tp, class _Compare>
inline void
__pop_heap_aux(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Tp*, _Compare __comp)
{
__pop_heap(__first, __last - 1, __last - 1, _Tp(*(__last - 1)), __comp,
__distance_type(__first));
}
template <class _RandomAccessIterator, class _Compare>
inline void
pop_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
__pop_heap_aux(__first, __last, __value_type(__first), __comp);
}
template <class _RandomAccessIterator, class _Tp, class _Distance>
void
__make_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Tp*, _Distance*)
{
if (__last - __first < 2) return;
_Distance __len = __last - __first;
_Distance __parent = (__len - 2)/2;
while (true) {
__adjust_heap(__first, __parent, __len, _Tp(*(__first + __parent)));
if (__parent == 0) return;
__parent--;
}
}
template <class _RandomAccessIterator>
inline void
make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIterator>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIterator>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
__make_heap(__first, __last,
__value_type(__first), __distance_type(__first));
}
template <class _RandomAccessIterator, class _Compare,
class _Tp, class _Distance>
void
__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
_Compare __comp, _Tp*, _Distance*)
{
if (__last - __first < 2) return;
_Distance __len = __last - __first;
_Distance __parent = (__len - 2)/2;
while (true) {
__adjust_heap(__first, __parent, __len, _Tp(*(__first + __parent)),
__comp);
if (__parent == 0) return;
__parent--;
}
}
template <class _RandomAccessIterator, class _Compare>
inline void
make_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
__make_heap(__first, __last, __comp,
__value_type(__first), __distance_type(__first));
}
template <class _RandomAccessIterator>
void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIterator>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIterator>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
while (__last - __first > 1)
pop_heap(__first, __last--);
}
template <class _RandomAccessIterator, class _Compare>
void
sort_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp)
{
do { void (*__x)( _RandomAccessIterator ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIterator > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
while (__last - __first > 1)
pop_heap(__first, __last--, __comp);
}
}
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algo.h" 2 3
namespace std {
template <class _Tp>
inline const _Tp& __median(const _Tp& __a, const _Tp& __b, const _Tp& __c) {
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__a < __b)
if (__b < __c)
return __b;
else if (__a < __c)
return __c;
else
return __a;
else if (__a < __c)
return __a;
else if (__b < __c)
return __c;
else
return __b;
}
template <class _Tp, class _Compare>
inline const _Tp&
__median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
do { bool (*__x)( _Compare&, const _Tp&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, _Tp, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__comp(__a, __b))
if (__comp(__b, __c))
return __b;
else if (__comp(__a, __c))
return __c;
else
return __a;
else if (__comp(__a, __c))
return __a;
else if (__comp(__b, __c))
return __c;
else
return __b;
}
template <class _InputIter, class _Function>
_Function for_each(_InputIter __first, _InputIter __last, _Function __f) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
__f(*__first);
return __f;
}
template <class _InputIter, class _Tp>
inline _InputIter find(_InputIter __first, _InputIter __last,
const _Tp& __val,
input_iterator_tag)
{
while (__first != __last && !(*__first == __val))
++__first;
return __first;
}
template <class _InputIter, class _Predicate>
inline _InputIter find_if(_InputIter __first, _InputIter __last,
_Predicate __pred,
input_iterator_tag)
{
while (__first != __last && !__pred(*__first))
++__first;
return __first;
}
template <class _RandomAccessIter, class _Tp>
_RandomAccessIter find(_RandomAccessIter __first, _RandomAccessIter __last,
const _Tp& __val,
random_access_iterator_tag)
{
typename iterator_traits<_RandomAccessIter>::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 <class _RandomAccessIter, class _Predicate>
_RandomAccessIter find_if(_RandomAccessIter __first, _RandomAccessIter __last,
_Predicate __pred,
random_access_iterator_tag)
{
typename iterator_traits<_RandomAccessIter>::difference_type __trip_count
= (__last - __first) >> 2;
for ( ; __trip_count > 0 ; --__trip_count) {
if (__pred(*__first)) return __first;
++__first;
if (__pred(*__first)) return __first;
++__first;
if (__pred(*__first)) return __first;
++__first;
if (__pred(*__first)) return __first;
++__first;
}
switch(__last - __first) {
case 3:
if (__pred(*__first)) return __first;
++__first;
case 2:
if (__pred(*__first)) return __first;
++__first;
case 1:
if (__pred(*__first)) return __first;
++__first;
case 0:
default:
return __last;
}
}
template <class _InputIter, class _Tp>
inline _InputIter find(_InputIter __first, _InputIter __last,
const _Tp& __val)
{
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_InputIter>::value_type&, _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, _Tp>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_InputIter>::value_type&, const _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, _Tp>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
return find(__first, __last, __val, __iterator_category(__first));
}
template <class _InputIter, class _Predicate>
inline _InputIter find_if(_InputIter __first, _InputIter __last,
_Predicate __pred) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_InputIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_InputIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
return find_if(__first, __last, __pred, __iterator_category(__first));
}
template <class _ForwardIter>
_ForwardIter adjacent_find(_ForwardIter __first, _ForwardIter __last) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_ForwardIter>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return __last;
_ForwardIter __next = __first;
while(++__next != __last) {
if (*__first == *__next)
return __first;
__first = __next;
}
return __last;
}
template <class _ForwardIter, class _BinaryPredicate>
_ForwardIter adjacent_find(_ForwardIter __first, _ForwardIter __last,
_BinaryPredicate __binary_pred) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _BinaryPredicate&, const typename iterator_traits<_ForwardIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPredicate, bool, typename iterator_traits<_ForwardIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return __last;
_ForwardIter __next = __first;
while(++__next != __last) {
if (__binary_pred(*__first, *__next))
return __first;
__first = __next;
}
return __last;
}
template <class _InputIter, class _Tp, class _Size>
void count(_InputIter __first, _InputIter __last, const _Tp& __value,
_Size& __n) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _EqualityComparable_concept_specification< _Tp > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
if (*__first == __value)
++__n;
}
template <class _InputIter, class _Predicate, class _Size>
void count_if(_InputIter __first, _InputIter __last, _Predicate __pred,
_Size& __n) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_InputIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_InputIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
if (__pred(*__first))
++__n;
}
template <class _InputIter, class _Tp>
typename iterator_traits<_InputIter>::difference_type
count(_InputIter __first, _InputIter __last, const _Tp& __value) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _EqualityComparable_concept_specification< _Tp > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
typename iterator_traits<_InputIter>::difference_type __n = 0;
for ( ; __first != __last; ++__first)
if (*__first == __value)
++__n;
return __n;
}
template <class _InputIter, class _Predicate>
typename iterator_traits<_InputIter>::difference_type
count_if(_InputIter __first, _InputIter __last, _Predicate __pred) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_InputIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_InputIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
typename iterator_traits<_InputIter>::difference_type __n = 0;
for ( ; __first != __last; ++__first)
if (__pred(*__first))
++__n;
return __n;
}
template <class _ForwardIter1, class _ForwardIter2>
_ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2, _ForwardIter2 __last2)
{
do { void (*__x)( _ForwardIter1 ) = _ForwardIterator_concept_specification< _ForwardIter1 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter2 ) = _ForwardIterator_concept_specification< _ForwardIter2 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_ForwardIter1>::value_type&, typename iterator_traits<_ForwardIter2>::value_type& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter1>::value_type, typename iterator_traits<_ForwardIter2>::value_type>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_ForwardIter1>::value_type&, const typename iterator_traits<_ForwardIter2>::value_type& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter1>::value_type, typename iterator_traits<_ForwardIter2>::value_type>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
if (__first1 == __last1 || __first2 == __last2)
return __first1;
_ForwardIter2 __tmp(__first2);
++__tmp;
if (__tmp == __last2)
return find(__first1, __last1, *__first2);
_ForwardIter2 __p1, __p;
__p1 = __first2; ++__p1;
_ForwardIter1 __current = __first1;
while (__first1 != __last1) {
__first1 = 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;
}
template <class _ForwardIter1, class _ForwardIter2, class _BinaryPred>
_ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2, _ForwardIter2 __last2,
_BinaryPred __predicate)
{
do { void (*__x)( _ForwardIter1 ) = _ForwardIterator_concept_specification< _ForwardIter1 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter2 ) = _ForwardIterator_concept_specification< _ForwardIter2 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _BinaryPred&, const typename iterator_traits<_ForwardIter1>::value_type&, const typename iterator_traits<_ForwardIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPred, bool, typename iterator_traits<_ForwardIter1>::value_type, typename iterator_traits<_ForwardIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first1 == __last1 || __first2 == __last2)
return __first1;
_ForwardIter2 __tmp(__first2);
++__tmp;
if (__tmp == __last2) {
while (__first1 != __last1 && !__predicate(*__first1, *__first2))
++__first1;
return __first1;
}
_ForwardIter2 __p1, __p;
__p1 = __first2; ++__p1;
_ForwardIter1 __current = __first1;
while (__first1 != __last1) {
while (__first1 != __last1) {
if (__predicate(*__first1, *__first2))
break;
++__first1;
}
while (__first1 != __last1 && !__predicate(*__first1, *__first2))
++__first1;
if (__first1 == __last1)
return __last1;
__p = __p1;
__current = __first1;
if (++__current == __last1) return __last1;
while (__predicate(*__current, *__p)) {
if (++__p == __last2)
return __first1;
if (++__current == __last1)
return __last1;
}
++__first1;
}
return __first1;
}
template <class _ForwardIter, class _Integer, class _Tp>
_ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
_Integer __count, const _Tp& __val) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_ForwardIter>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _EqualityComparable_concept_specification< _Tp > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
if (__count <= 0)
return __first;
else {
__first = find(__first, __last, __val);
while (__first != __last) {
_Integer __n = __count - 1;
_ForwardIter __i = __first;
++__i;
while (__i != __last && __n != 0 && *__i == __val) {
++__i;
--__n;
}
if (__n == 0)
return __first;
else
__first = find(__i, __last, __val);
}
return __last;
}
}
template <class _ForwardIter, class _Integer, class _Tp, class _BinaryPred>
_ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
_Integer __count, const _Tp& __val,
_BinaryPred __binary_pred) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _BinaryPred&, const typename iterator_traits<_ForwardIter>::value_type&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPred, bool, typename iterator_traits<_ForwardIter>::value_type, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__count <= 0)
return __first;
else {
while (__first != __last) {
if (__binary_pred(*__first, __val))
break;
++__first;
}
while (__first != __last) {
_Integer __n = __count - 1;
_ForwardIter __i = __first;
++__i;
while (__i != __last && __n != 0 && __binary_pred(*__i, __val)) {
++__i;
--__n;
}
if (__n == 0)
return __first;
else {
while (__i != __last) {
if (__binary_pred(*__i, __val))
break;
++__i;
}
__first = __i;
}
}
return __last;
}
}
template <class _ForwardIter1, class _ForwardIter2>
_ForwardIter2 swap_ranges(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2) {
do { void (*__x)( _ForwardIter1 ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter1 > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter2 ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter2 > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter1>::value_type , typename iterator_traits<_ForwardIter2>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_ForwardIter1>::value_type , typename iterator_traits<_ForwardIter2>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter2>::value_type , typename iterator_traits<_ForwardIter1>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_ForwardIter2>::value_type , typename iterator_traits<_ForwardIter1>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
for ( ; __first1 != __last1; ++__first1, ++__first2)
iter_swap(__first1, __first2);
return __first2;
}
template <class _InputIter, class _OutputIter, class _UnaryOperation>
_OutputIter transform(_InputIter __first, _InputIter __last,
_OutputIter __result, _UnaryOperation __unary_op) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first, ++__result)
*__result = __unary_op(*__first);
return __result;
}
template <class _InputIter1, class _InputIter2, class _OutputIter,
class _BinaryOperation>
_OutputIter transform(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _OutputIter __result,
_BinaryOperation __binary_op) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __first1 != __last1; ++__first1, ++__first2, ++__result)
*__result = __binary_op(*__first1, *__first2);
return __result;
}
template <class _ForwardIter, class _Tp>
void replace(_ForwardIter __first, _ForwardIter __last,
const _Tp& __old_value, const _Tp& __new_value) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_ForwardIter>::value_type&, _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter>::value_type, _Tp>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_ForwardIter>::value_type&, const _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter>::value_type, _Tp>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_CONVERT_ERROR< _Tp , typename iterator_traits<_ForwardIter>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
if (*__first == __old_value)
*__first = __new_value;
}
template <class _ForwardIter, class _Predicate, class _Tp>
void replace_if(_ForwardIter __first, _ForwardIter __last,
_Predicate __pred, const _Tp& __new_value) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_CONVERT_ERROR< _Tp , typename iterator_traits<_ForwardIter>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_ForwardIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
if (__pred(*__first))
*__first = __new_value;
}
template <class _InputIter, class _OutputIter, class _Tp>
_OutputIter replace_copy(_InputIter __first, _InputIter __last,
_OutputIter __result,
const _Tp& __old_value, const _Tp& __new_value) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_InputIter>::value_type&, _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, _Tp>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_InputIter>::value_type&, const _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, _Tp>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
for ( ; __first != __last; ++__first, ++__result)
*__result = *__first == __old_value ? __new_value : *__first;
return __result;
}
template <class _InputIter, class _OutputIter, class _Predicate, class _Tp>
_OutputIter replace_copy_if(_InputIter __first, _InputIter __last,
_OutputIter __result,
_Predicate __pred, const _Tp& __new_value) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_InputIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_InputIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first, ++__result)
*__result = __pred(*__first) ? __new_value : *__first;
return __result;
}
template <class _ForwardIter, class _Generator>
void generate(_ForwardIter __first, _ForwardIter __last, _Generator __gen) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { typename iterator_traits<_ForwardIter>::value_type (*__x)( _Generator&) = _STL_GENERATOR_ERROR< _Generator, typename iterator_traits<_ForwardIter>::value_type>::__generator_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
*__first = __gen();
}
template <class _OutputIter, class _Size, class _Generator>
_OutputIter generate_n(_OutputIter __first, _Size __n, _Generator __gen) {
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
for ( ; __n > 0; --__n, ++__first)
*__first = __gen();
return __first;
}
template <class _InputIter, class _OutputIter, class _Tp>
_OutputIter remove_copy(_InputIter __first, _InputIter __last,
_OutputIter __result, const _Tp& __value) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_InputIter>::value_type&, _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, _Tp>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_InputIter>::value_type&, const _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, _Tp>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
if (!(*__first == __value)) {
*__result = *__first;
++__result;
}
return __result;
}
template <class _InputIter, class _OutputIter, class _Predicate>
_OutputIter remove_copy_if(_InputIter __first, _InputIter __last,
_OutputIter __result, _Predicate __pred) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_InputIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_InputIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
for ( ; __first != __last; ++__first)
if (!__pred(*__first)) {
*__result = *__first;
++__result;
}
return __result;
}
template <class _ForwardIter, class _Tp>
_ForwardIter remove(_ForwardIter __first, _ForwardIter __last,
const _Tp& __value) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_ForwardIter>::value_type&, _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter>::value_type, _Tp>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_ForwardIter>::value_type&, const _Tp& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter>::value_type, _Tp>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_CONVERT_ERROR< _Tp , typename iterator_traits<_ForwardIter>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
__first = find(__first, __last, __value);
_ForwardIter __i = __first;
return __first == __last ? __first
: remove_copy(++__i, __last, __first, __value);
}
template <class _ForwardIter, class _Predicate>
_ForwardIter remove_if(_ForwardIter __first, _ForwardIter __last,
_Predicate __pred) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_ForwardIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
__first = find_if(__first, __last, __pred);
_ForwardIter __i = __first;
return __first == __last ? __first
: remove_copy_if(++__i, __last, __first, __pred);
}
template <class _InputIter, class _OutputIter, class _Tp>
_OutputIter __unique_copy(_InputIter __first, _InputIter __last,
_OutputIter __result, _Tp*) {
_Tp __value = *__first;
*__result = __value;
while (++__first != __last)
if (!(__value == *__first)) {
__value = *__first;
*++__result = __value;
}
return ++__result;
}
template <class _InputIter, class _OutputIter>
inline _OutputIter __unique_copy(_InputIter __first, _InputIter __last,
_OutputIter __result,
output_iterator_tag) {
return __unique_copy(__first, __last, __result, __value_type(__first));
}
template <class _InputIter, class _ForwardIter>
_ForwardIter __unique_copy(_InputIter __first, _InputIter __last,
_ForwardIter __result, forward_iterator_tag) {
*__result = *__first;
while (++__first != __last)
if (!(*__result == *__first))
*++__result = *__first;
return ++__result;
}
template <class _InputIter, class _OutputIter>
inline _OutputIter unique_copy(_InputIter __first, _InputIter __last,
_OutputIter __result) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_InputIter>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last) return __result;
return __unique_copy(__first, __last, __result,
__iterator_category(__result));
}
template <class _InputIter, class _OutputIter, class _BinaryPredicate,
class _Tp>
_OutputIter __unique_copy(_InputIter __first, _InputIter __last,
_OutputIter __result,
_BinaryPredicate __binary_pred, _Tp*) {
do { bool (*__x)( _BinaryPredicate&, const _Tp&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPredicate, bool, _Tp, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
_Tp __value = *__first;
*__result = __value;
while (++__first != __last)
if (!__binary_pred(__value, *__first)) {
__value = *__first;
*++__result = __value;
}
return ++__result;
}
template <class _InputIter, class _OutputIter, class _BinaryPredicate>
inline _OutputIter __unique_copy(_InputIter __first, _InputIter __last,
_OutputIter __result,
_BinaryPredicate __binary_pred,
output_iterator_tag) {
return __unique_copy(__first, __last, __result, __binary_pred,
__value_type(__first));
}
template <class _InputIter, class _ForwardIter, class _BinaryPredicate>
_ForwardIter __unique_copy(_InputIter __first, _InputIter __last,
_ForwardIter __result,
_BinaryPredicate __binary_pred,
forward_iterator_tag) {
do { bool (*__x)( _BinaryPredicate&, const typename iterator_traits<_ForwardIter>::value_type&, const typename iterator_traits<_InputIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPredicate, bool, typename iterator_traits<_ForwardIter>::value_type, typename iterator_traits<_InputIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
*__result = *__first;
while (++__first != __last)
if (!__binary_pred(*__result, *__first)) *++__result = *__first;
return ++__result;
}
template <class _InputIter, class _OutputIter, class _BinaryPredicate>
inline _OutputIter unique_copy(_InputIter __first, _InputIter __last,
_OutputIter __result,
_BinaryPredicate __binary_pred) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
if (__first == __last) return __result;
return __unique_copy(__first, __last, __result, __binary_pred,
__iterator_category(__result));
}
template <class _ForwardIter>
_ForwardIter unique(_ForwardIter __first, _ForwardIter __last) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter>::value_type ) = _EqualityComparable_concept_specification< typename iterator_traits<_ForwardIter>::value_type > ::_EqualityComparable_requirement_violation; __x = __x; } while (0);
__first = adjacent_find(__first, __last);
return unique_copy(__first, __last, __first);
}
template <class _ForwardIter, class _BinaryPredicate>
_ForwardIter unique(_ForwardIter __first, _ForwardIter __last,
_BinaryPredicate __binary_pred) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _BinaryPredicate&, const typename iterator_traits<_ForwardIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPredicate, bool, typename iterator_traits<_ForwardIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
__first = adjacent_find(__first, __last, __binary_pred);
return unique_copy(__first, __last, __first, __binary_pred);
}
template <class _BidirectionalIter>
void __reverse(_BidirectionalIter __first, _BidirectionalIter __last,
bidirectional_iterator_tag) {
while (true)
if (__first == __last || __first == --__last)
return;
else
iter_swap(__first++, __last);
}
template <class _RandomAccessIter>
void __reverse(_RandomAccessIter __first, _RandomAccessIter __last,
random_access_iterator_tag) {
while (__first < __last)
iter_swap(__first++, --__last);
}
template <class _BidirectionalIter>
inline void reverse(_BidirectionalIter __first, _BidirectionalIter __last) {
do { void (*__x)( _BidirectionalIter ) = _Mutable_BidirectionalIterator_concept_specification< _BidirectionalIter > ::_Mutable_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
__reverse(__first, __last, __iterator_category(__first));
}
template <class _BidirectionalIter, class _OutputIter>
_OutputIter reverse_copy(_BidirectionalIter __first,
_BidirectionalIter __last,
_OutputIter __result) {
do { void (*__x)( _BidirectionalIter ) = _BidirectionalIterator_concept_specification< _BidirectionalIter > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
while (__first != __last) {
--__last;
*__result = *__last;
++__result;
}
return __result;
}
template <class _EuclideanRingElement>
_EuclideanRingElement __gcd(_EuclideanRingElement __m,
_EuclideanRingElement __n)
{
while (__n != 0) {
_EuclideanRingElement __t = __m % __n;
__m = __n;
__n = __t;
}
return __m;
}
template <class _ForwardIter, class _Distance>
_ForwardIter __rotate(_ForwardIter __first,
_ForwardIter __middle,
_ForwardIter __last,
_Distance*,
forward_iterator_tag) {
if (__first == __middle)
return __last;
if (__last == __middle)
return __first;
_ForwardIter __first2 = __middle;
do {
swap(*__first++, *__first2++);
if (__first == __middle)
__middle = __first2;
} while (__first2 != __last);
_ForwardIter __new_middle = __first;
__first2 = __middle;
while (__first2 != __last) {
swap (*__first++, *__first2++);
if (__first == __middle)
__middle = __first2;
else if (__first2 == __last)
__first2 = __middle;
}
return __new_middle;
}
template <class _BidirectionalIter, class _Distance>
_BidirectionalIter __rotate(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last,
_Distance*,
bidirectional_iterator_tag) {
do { void (*__x)( _BidirectionalIter ) = _Mutable_BidirectionalIterator_concept_specification< _BidirectionalIter > ::_Mutable_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
if (__first == __middle)
return __last;
if (__last == __middle)
return __first;
__reverse(__first, __middle, bidirectional_iterator_tag());
__reverse(__middle, __last, bidirectional_iterator_tag());
while (__first != __middle && __middle != __last)
swap (*__first++, *--__last);
if (__first == __middle) {
__reverse(__middle, __last, bidirectional_iterator_tag());
return __last;
}
else {
__reverse(__first, __middle, bidirectional_iterator_tag());
return __first;
}
}
template <class _RandomAccessIter, class _Distance, class _Tp>
_RandomAccessIter __rotate(_RandomAccessIter __first,
_RandomAccessIter __middle,
_RandomAccessIter __last,
_Distance *, _Tp *) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
_Distance __n = __last - __first;
_Distance __k = __middle - __first;
_Distance __l = __n - __k;
_RandomAccessIter __result = __first + (__last - __middle);
if (__k == 0)
return __last;
else if (__k == __l) {
swap_ranges(__first, __middle, __middle);
return __result;
}
_Distance __d = __gcd(__n, __k);
for (_Distance __i = 0; __i < __d; __i++) {
_Tp __tmp = *__first;
_RandomAccessIter __p = __first;
if (__k < __l) {
for (_Distance __j = 0; __j < __l/__d; __j++) {
if (__p > __first + __l) {
*__p = *(__p - __l);
__p -= __l;
}
*__p = *(__p + __k);
__p += __k;
}
}
else {
for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
if (__p < __last - __k) {
*__p = *(__p + __k);
__p += __k;
}
*__p = * (__p - __l);
__p -= __l;
}
}
*__p = __tmp;
++__first;
}
return __result;
}
template <class _ForwardIter>
inline _ForwardIter rotate(_ForwardIter __first, _ForwardIter __middle,
_ForwardIter __last) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
return __rotate(__first, __middle, __last,
__distance_type(__first),
__iterator_category(__first));
}
template <class _ForwardIter, class _OutputIter>
_OutputIter rotate_copy(_ForwardIter __first, _ForwardIter __middle,
_ForwardIter __last, _OutputIter __result) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
return copy(__first, __middle, copy(__middle, __last, __result));
}
template <class _Distance>
inline _Distance __random_number(_Distance __n) {
return lrand48() % __n;
}
template <class _RandomAccessIter>
inline void random_shuffle(_RandomAccessIter __first,
_RandomAccessIter __last) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
if (__first == __last) return;
for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
iter_swap(__i, __first + __random_number((__i - __first) + 1));
}
template <class _RandomAccessIter, class _RandomNumberGenerator>
void random_shuffle(_RandomAccessIter __first, _RandomAccessIter __last,
_RandomNumberGenerator& __rand) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
if (__first == __last) return;
for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
iter_swap(__i, __first + __rand((__i - __first) + 1));
}
template <class _ForwardIter, class _OutputIter, class _Distance>
_OutputIter random_sample_n(_ForwardIter __first, _ForwardIter __last,
_OutputIter __out, const _Distance __n)
{
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
_Distance __remaining = 0;
distance(__first, __last, __remaining);
_Distance __m = min(__n, __remaining);
while (__m > 0) {
if (__random_number(__remaining) < __m) {
*__out = *__first;
++__out;
--__m;
}
--__remaining;
++__first;
}
return __out;
}
template <class _ForwardIter, class _OutputIter, class _Distance,
class _RandomNumberGenerator>
_OutputIter random_sample_n(_ForwardIter __first, _ForwardIter __last,
_OutputIter __out, const _Distance __n,
_RandomNumberGenerator& __rand)
{
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { _Distance (*__x)( _RandomNumberGenerator&, const _Distance& ) = _STL_UNARY_FUNCTION_ERROR< _RandomNumberGenerator, _Distance, _Distance>::__unary_function_requirement_violation; __x = __x; } while (0);
_Distance __remaining = 0;
distance(__first, __last, __remaining);
_Distance __m = min(__n, __remaining);
while (__m > 0) {
if (__rand(__remaining) < __m) {
*__out = *__first;
++__out;
--__m;
}
--__remaining;
++__first;
}
return __out;
}
template <class _InputIter, class _RandomAccessIter, class _Distance>
_RandomAccessIter __random_sample(_InputIter __first, _InputIter __last,
_RandomAccessIter __out,
const _Distance __n)
{
_Distance __m = 0;
_Distance __t = __n;
for ( ; __first != __last && __m < __n; ++__m, ++__first)
__out[__m] = *__first;
while (__first != __last) {
++__t;
_Distance __M = __random_number(__t);
if (__M < __n)
__out[__M] = *__first;
++__first;
}
return __out + __m;
}
template <class _InputIter, class _RandomAccessIter,
class _RandomNumberGenerator, class _Distance>
_RandomAccessIter __random_sample(_InputIter __first, _InputIter __last,
_RandomAccessIter __out,
_RandomNumberGenerator& __rand,
const _Distance __n)
{
do { _Distance (*__x)( _RandomNumberGenerator&, const _Distance& ) = _STL_UNARY_FUNCTION_ERROR< _RandomNumberGenerator, _Distance, _Distance>::__unary_function_requirement_violation; __x = __x; } while (0);
_Distance __m = 0;
_Distance __t = __n;
for ( ; __first != __last && __m < __n; ++__m, ++__first)
__out[__m] = *__first;
while (__first != __last) {
++__t;
_Distance __M = __rand(__t);
if (__M < __n)
__out[__M] = *__first;
++__first;
}
return __out + __m;
}
template <class _InputIter, class _RandomAccessIter>
inline _RandomAccessIter
random_sample(_InputIter __first, _InputIter __last,
_RandomAccessIter __out_first, _RandomAccessIter __out_last)
{
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
return __random_sample(__first, __last,
__out_first, __out_last - __out_first);
}
template <class _InputIter, class _RandomAccessIter,
class _RandomNumberGenerator>
inline _RandomAccessIter
random_sample(_InputIter __first, _InputIter __last,
_RandomAccessIter __out_first, _RandomAccessIter __out_last,
_RandomNumberGenerator& __rand)
{
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
return __random_sample(__first, __last,
__out_first, __rand,
__out_last - __out_first);
}
template <class _ForwardIter, class _Predicate>
_ForwardIter __partition(_ForwardIter __first,
_ForwardIter __last,
_Predicate __pred,
forward_iterator_tag) {
if (__first == __last) return __first;
while (__pred(*__first))
if (++__first == __last) return __first;
_ForwardIter __next = __first;
while (++__next != __last)
if (__pred(*__next)) {
swap(*__first, *__next);
++__first;
}
return __first;
}
template <class _BidirectionalIter, class _Predicate>
_BidirectionalIter __partition(_BidirectionalIter __first,
_BidirectionalIter __last,
_Predicate __pred,
bidirectional_iterator_tag) {
while (true) {
while (true)
if (__first == __last)
return __first;
else if (__pred(*__first))
++__first;
else
break;
--__last;
while (true)
if (__first == __last)
return __first;
else if (!__pred(*__last))
--__last;
else
break;
iter_swap(__first, __last);
++__first;
}
}
template <class _ForwardIter, class _Predicate>
inline _ForwardIter partition(_ForwardIter __first,
_ForwardIter __last,
_Predicate __pred) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_ForwardIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
return __partition(__first, __last, __pred, __iterator_category(__first));
}
template <class _ForwardIter, class _Predicate, class _Distance>
_ForwardIter __inplace_stable_partition(_ForwardIter __first,
_ForwardIter __last,
_Predicate __pred, _Distance __len) {
if (__len == 1)
return __pred(*__first) ? __last : __first;
_ForwardIter __middle = __first;
advance(__middle, __len / 2);
return rotate(__inplace_stable_partition(__first, __middle, __pred,
__len / 2),
__middle,
__inplace_stable_partition(__middle, __last, __pred,
__len - __len / 2));
}
template <class _ForwardIter, class _Pointer, class _Predicate,
class _Distance>
_ForwardIter __stable_partition_adaptive(_ForwardIter __first,
_ForwardIter __last,
_Predicate __pred, _Distance __len,
_Pointer __buffer,
_Distance __buffer_size)
{
if (__len <= __buffer_size) {
_ForwardIter __result1 = __first;
_Pointer __result2 = __buffer;
for ( ; __first != __last ; ++__first)
if (__pred(*__first)) {
*__result1 = *__first;
++__result1;
}
else {
*__result2 = *__first;
++__result2;
}
copy(__buffer, __result2, __result1);
return __result1;
}
else {
_ForwardIter __middle = __first;
advance(__middle, __len / 2);
return rotate(__stable_partition_adaptive(
__first, __middle, __pred,
__len / 2, __buffer, __buffer_size),
__middle,
__stable_partition_adaptive(
__middle, __last, __pred,
__len - __len / 2, __buffer, __buffer_size));
}
}
template <class _ForwardIter, class _Predicate, class _Tp, class _Distance>
inline _ForwardIter
__stable_partition_aux(_ForwardIter __first, _ForwardIter __last,
_Predicate __pred, _Tp*, _Distance*)
{
_Temporary_buffer<_ForwardIter, _Tp> __buf(__first, __last);
if (__buf.size() > 0)
return __stable_partition_adaptive(__first, __last, __pred,
_Distance(__buf.requested_size()),
__buf.begin(), __buf.size());
else
return __inplace_stable_partition(__first, __last, __pred,
_Distance(__buf.requested_size()));
}
template <class _ForwardIter, class _Predicate>
inline _ForwardIter stable_partition(_ForwardIter __first,
_ForwardIter __last,
_Predicate __pred) {
do { void (*__x)( _ForwardIter ) = _Mutable_ForwardIterator_concept_specification< _ForwardIter > ::_Mutable_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Predicate&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_UNARY_FUNCTION_ERROR< _Predicate, bool, typename iterator_traits<_ForwardIter>::value_type>::__unary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return __first;
else
return __stable_partition_aux(__first, __last, __pred,
__value_type(__first),
__distance_type(__first));
}
template <class _RandomAccessIter, class _Tp>
_RandomAccessIter __unguarded_partition(_RandomAccessIter __first,
_RandomAccessIter __last,
_Tp __pivot)
{
while (true) {
while (*__first < __pivot)
++__first;
--__last;
while (__pivot < *__last)
--__last;
if (!(__first < __last))
return __first;
iter_swap(__first, __last);
++__first;
}
}
template <class _RandomAccessIter, class _Tp, class _Compare>
_RandomAccessIter __unguarded_partition(_RandomAccessIter __first,
_RandomAccessIter __last,
_Tp __pivot, _Compare __comp)
{
while (true) {
while (__comp(*__first, __pivot))
++__first;
--__last;
while (__comp(__pivot, *__last))
--__last;
if (!(__first < __last))
return __first;
iter_swap(__first, __last);
++__first;
}
}
const int __stl_threshold = 16;
template <class _RandomAccessIter, class _Tp>
void __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val) {
_RandomAccessIter __next = __last;
--__next;
while (__val < *__next) {
*__last = *__next;
__last = __next;
--__next;
}
*__last = __val;
}
template <class _RandomAccessIter, class _Tp, class _Compare>
void __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val,
_Compare __comp) {
_RandomAccessIter __next = __last;
--__next;
while (__comp(__val, *__next)) {
*__last = *__next;
__last = __next;
--__next;
}
*__last = __val;
}
template <class _RandomAccessIter, class _Tp>
inline void __linear_insert(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*) {
_Tp __val = *__last;
if (__val < *__first) {
copy_backward(__first, __last, __last + 1);
*__first = __val;
}
else
__unguarded_linear_insert(__last, __val);
}
template <class _RandomAccessIter, class _Tp, class _Compare>
inline void __linear_insert(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*, _Compare __comp) {
_Tp __val = *__last;
if (__comp(__val, *__first)) {
copy_backward(__first, __last, __last + 1);
*__first = __val;
}
else
__unguarded_linear_insert(__last, __val, __comp);
}
template <class _RandomAccessIter>
void __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last) {
if (__first == __last) return;
for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
__linear_insert(__first, __i, __value_type(__first));
}
template <class _RandomAccessIter, class _Compare>
void __insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last, _Compare __comp) {
if (__first == __last) return;
for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
__linear_insert(__first, __i, __value_type(__first), __comp);
}
template <class _RandomAccessIter, class _Tp>
void __unguarded_insertion_sort_aux(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*) {
for (_RandomAccessIter __i = __first; __i != __last; ++__i)
__unguarded_linear_insert(__i, _Tp(*__i));
}
template <class _RandomAccessIter>
inline void __unguarded_insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last) {
__unguarded_insertion_sort_aux(__first, __last, __value_type(__first));
}
template <class _RandomAccessIter, class _Tp, class _Compare>
void __unguarded_insertion_sort_aux(_RandomAccessIter __first,
_RandomAccessIter __last,
_Tp*, _Compare __comp) {
for (_RandomAccessIter __i = __first; __i != __last; ++__i)
__unguarded_linear_insert(__i, _Tp(*__i), __comp);
}
template <class _RandomAccessIter, class _Compare>
inline void __unguarded_insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last,
_Compare __comp) {
__unguarded_insertion_sort_aux(__first, __last, __value_type(__first),
__comp);
}
template <class _RandomAccessIter>
void __final_insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last) {
if (__last - __first > __stl_threshold) {
__insertion_sort(__first, __first + __stl_threshold);
__unguarded_insertion_sort(__first + __stl_threshold, __last);
}
else
__insertion_sort(__first, __last);
}
template <class _RandomAccessIter, class _Compare>
void __final_insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last, _Compare __comp) {
if (__last - __first > __stl_threshold) {
__insertion_sort(__first, __first + __stl_threshold, __comp);
__unguarded_insertion_sort(__first + __stl_threshold, __last, __comp);
}
else
__insertion_sort(__first, __last, __comp);
}
template <class _Size>
inline _Size __lg(_Size __n) {
_Size __k;
for (__k = 0; __n != 1; __n >>= 1) ++__k;
return __k;
}
template <class _RandomAccessIter, class _Tp, class _Size>
void __introsort_loop(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*,
_Size __depth_limit)
{
while (__last - __first > __stl_threshold) {
if (__depth_limit == 0) {
partial_sort(__first, __last, __last);
return;
}
--__depth_limit;
_RandomAccessIter __cut =
__unguarded_partition(__first, __last,
_Tp(__median(*__first,
*(__first + (__last - __first)/2),
*(__last - 1))));
__introsort_loop(__cut, __last, (_Tp*) 0, __depth_limit);
__last = __cut;
}
}
template <class _RandomAccessIter, class _Tp, class _Size, class _Compare>
void __introsort_loop(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*,
_Size __depth_limit, _Compare __comp)
{
while (__last - __first > __stl_threshold) {
if (__depth_limit == 0) {
partial_sort(__first, __last, __last, __comp);
return;
}
--__depth_limit;
_RandomAccessIter __cut =
__unguarded_partition(__first, __last,
_Tp(__median(*__first,
*(__first + (__last - __first)/2),
*(__last - 1), __comp)),
__comp);
__introsort_loop(__cut, __last, (_Tp*) 0, __depth_limit, __comp);
__last = __cut;
}
}
template <class _RandomAccessIter>
inline void sort(_RandomAccessIter __first, _RandomAccessIter __last) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first != __last) {
__introsort_loop(__first, __last,
__value_type(__first),
__lg(__last - __first) * 2);
__final_insertion_sort(__first, __last);
}
}
template <class _RandomAccessIter, class _Compare>
inline void sort(_RandomAccessIter __first, _RandomAccessIter __last,
_Compare __comp) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_RandomAccessIter>::value_type&, const typename iterator_traits<_RandomAccessIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_RandomAccessIter>::value_type, typename iterator_traits<_RandomAccessIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first != __last) {
__introsort_loop(__first, __last,
__value_type(__first),
__lg(__last - __first) * 2,
__comp);
__final_insertion_sort(__first, __last, __comp);
}
}
template <class _RandomAccessIter>
void __inplace_stable_sort(_RandomAccessIter __first,
_RandomAccessIter __last) {
if (__last - __first < 15) {
__insertion_sort(__first, __last);
return;
}
_RandomAccessIter __middle = __first + (__last - __first) / 2;
__inplace_stable_sort(__first, __middle);
__inplace_stable_sort(__middle, __last);
__merge_without_buffer(__first, __middle, __last,
__middle - __first,
__last - __middle);
}
template <class _RandomAccessIter, class _Compare>
void __inplace_stable_sort(_RandomAccessIter __first,
_RandomAccessIter __last, _Compare __comp) {
if (__last - __first < 15) {
__insertion_sort(__first, __last, __comp);
return;
}
_RandomAccessIter __middle = __first + (__last - __first) / 2;
__inplace_stable_sort(__first, __middle, __comp);
__inplace_stable_sort(__middle, __last, __comp);
__merge_without_buffer(__first, __middle, __last,
__middle - __first,
__last - __middle,
__comp);
}
template <class _RandomAccessIter1, class _RandomAccessIter2,
class _Distance>
void __merge_sort_loop(_RandomAccessIter1 __first,
_RandomAccessIter1 __last,
_RandomAccessIter2 __result, _Distance __step_size) {
_Distance __two_step = 2 * __step_size;
while (__last - __first >= __two_step) {
__result = merge(__first, __first + __step_size,
__first + __step_size, __first + __two_step,
__result);
__first += __two_step;
}
__step_size = min(_Distance(__last - __first), __step_size);
merge(__first, __first + __step_size, __first + __step_size, __last,
__result);
}
template <class _RandomAccessIter1, class _RandomAccessIter2,
class _Distance, class _Compare>
void __merge_sort_loop(_RandomAccessIter1 __first,
_RandomAccessIter1 __last,
_RandomAccessIter2 __result, _Distance __step_size,
_Compare __comp) {
_Distance __two_step = 2 * __step_size;
while (__last - __first >= __two_step) {
__result = merge(__first, __first + __step_size,
__first + __step_size, __first + __two_step,
__result,
__comp);
__first += __two_step;
}
__step_size = min(_Distance(__last - __first), __step_size);
merge(__first, __first + __step_size,
__first + __step_size, __last,
__result,
__comp);
}
const int __stl_chunk_size = 7;
template <class _RandomAccessIter, class _Distance>
void __chunk_insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last, _Distance __chunk_size)
{
while (__last - __first >= __chunk_size) {
__insertion_sort(__first, __first + __chunk_size);
__first += __chunk_size;
}
__insertion_sort(__first, __last);
}
template <class _RandomAccessIter, class _Distance, class _Compare>
void __chunk_insertion_sort(_RandomAccessIter __first,
_RandomAccessIter __last,
_Distance __chunk_size, _Compare __comp)
{
while (__last - __first >= __chunk_size) {
__insertion_sort(__first, __first + __chunk_size, __comp);
__first += __chunk_size;
}
__insertion_sort(__first, __last, __comp);
}
template <class _RandomAccessIter, class _Pointer, class _Distance>
void __merge_sort_with_buffer(_RandomAccessIter __first,
_RandomAccessIter __last,
_Pointer __buffer, _Distance*) {
_Distance __len = __last - __first;
_Pointer __buffer_last = __buffer + __len;
_Distance __step_size = __stl_chunk_size;
__chunk_insertion_sort(__first, __last, __step_size);
while (__step_size < __len) {
__merge_sort_loop(__first, __last, __buffer, __step_size);
__step_size *= 2;
__merge_sort_loop(__buffer, __buffer_last, __first, __step_size);
__step_size *= 2;
}
}
template <class _RandomAccessIter, class _Pointer, class _Distance,
class _Compare>
void __merge_sort_with_buffer(_RandomAccessIter __first,
_RandomAccessIter __last, _Pointer __buffer,
_Distance*, _Compare __comp) {
_Distance __len = __last - __first;
_Pointer __buffer_last = __buffer + __len;
_Distance __step_size = __stl_chunk_size;
__chunk_insertion_sort(__first, __last, __step_size, __comp);
while (__step_size < __len) {
__merge_sort_loop(__first, __last, __buffer, __step_size, __comp);
__step_size *= 2;
__merge_sort_loop(__buffer, __buffer_last, __first, __step_size, __comp);
__step_size *= 2;
}
}
template <class _RandomAccessIter, class _Pointer, class _Distance>
void __stable_sort_adaptive(_RandomAccessIter __first,
_RandomAccessIter __last, _Pointer __buffer,
_Distance __buffer_size) {
_Distance __len = (__last - __first + 1) / 2;
_RandomAccessIter __middle = __first + __len;
if (__len > __buffer_size) {
__stable_sort_adaptive(__first, __middle, __buffer, __buffer_size);
__stable_sort_adaptive(__middle, __last, __buffer, __buffer_size);
}
else {
__merge_sort_with_buffer(__first, __middle, __buffer, (_Distance*)0);
__merge_sort_with_buffer(__middle, __last, __buffer, (_Distance*)0);
}
__merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
_Distance(__last - __middle), __buffer, __buffer_size);
}
template <class _RandomAccessIter, class _Pointer, class _Distance,
class _Compare>
void __stable_sort_adaptive(_RandomAccessIter __first,
_RandomAccessIter __last, _Pointer __buffer,
_Distance __buffer_size, _Compare __comp) {
_Distance __len = (__last - __first + 1) / 2;
_RandomAccessIter __middle = __first + __len;
if (__len > __buffer_size) {
__stable_sort_adaptive(__first, __middle, __buffer, __buffer_size,
__comp);
__stable_sort_adaptive(__middle, __last, __buffer, __buffer_size,
__comp);
}
else {
__merge_sort_with_buffer(__first, __middle, __buffer, (_Distance*)0,
__comp);
__merge_sort_with_buffer(__middle, __last, __buffer, (_Distance*)0,
__comp);
}
__merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
_Distance(__last - __middle), __buffer, __buffer_size,
__comp);
}
template <class _RandomAccessIter, class _Tp, class _Distance>
inline void __stable_sort_aux(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*, _Distance*) {
_Temporary_buffer<_RandomAccessIter, _Tp> buf(__first, __last);
if (buf.begin() == 0)
__inplace_stable_sort(__first, __last);
else
__stable_sort_adaptive(__first, __last, buf.begin(),
_Distance(buf.size()));
}
template <class _RandomAccessIter, class _Tp, class _Distance, class _Compare>
inline void __stable_sort_aux(_RandomAccessIter __first,
_RandomAccessIter __last, _Tp*, _Distance*,
_Compare __comp) {
_Temporary_buffer<_RandomAccessIter, _Tp> buf(__first, __last);
if (buf.begin() == 0)
__inplace_stable_sort(__first, __last, __comp);
else
__stable_sort_adaptive(__first, __last, buf.begin(),
_Distance(buf.size()),
__comp);
}
template <class _RandomAccessIter>
inline void stable_sort(_RandomAccessIter __first,
_RandomAccessIter __last) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
__stable_sort_aux(__first, __last,
__value_type(__first),
__distance_type(__first));
}
template <class _RandomAccessIter, class _Compare>
inline void stable_sort(_RandomAccessIter __first,
_RandomAccessIter __last, _Compare __comp) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_RandomAccessIter>::value_type&, const typename iterator_traits<_RandomAccessIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_RandomAccessIter>::value_type, typename iterator_traits<_RandomAccessIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
__stable_sort_aux(__first, __last,
__value_type(__first),
__distance_type(__first),
__comp);
}
template <class _RandomAccessIter, class _Tp>
void __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle,
_RandomAccessIter __last, _Tp*) {
make_heap(__first, __middle);
for (_RandomAccessIter __i = __middle; __i < __last; ++__i)
if (*__i < *__first)
__pop_heap(__first, __middle, __i, _Tp(*__i),
__distance_type(__first));
sort_heap(__first, __middle);
}
template <class _RandomAccessIter>
inline void partial_sort(_RandomAccessIter __first,
_RandomAccessIter __middle,
_RandomAccessIter __last) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
__partial_sort(__first, __middle, __last, __value_type(__first));
}
template <class _RandomAccessIter, class _Tp, class _Compare>
void __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle,
_RandomAccessIter __last, _Tp*, _Compare __comp) {
make_heap(__first, __middle, __comp);
for (_RandomAccessIter __i = __middle; __i < __last; ++__i)
if (__comp(*__i, *__first))
__pop_heap(__first, __middle, __i, _Tp(*__i), __comp,
__distance_type(__first));
sort_heap(__first, __middle, __comp);
}
template <class _RandomAccessIter, class _Compare>
inline void partial_sort(_RandomAccessIter __first,
_RandomAccessIter __middle,
_RandomAccessIter __last, _Compare __comp) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_RandomAccessIter>::value_type&, const typename iterator_traits<_RandomAccessIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_RandomAccessIter>::value_type, typename iterator_traits<_RandomAccessIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
__partial_sort(__first, __middle, __last, __value_type(__first), __comp);
}
template <class _InputIter, class _RandomAccessIter, class _Distance,
class _Tp>
_RandomAccessIter __partial_sort_copy(_InputIter __first,
_InputIter __last,
_RandomAccessIter __result_first,
_RandomAccessIter __result_last,
_Distance*, _Tp*) {
if (__result_first == __result_last) return __result_last;
_RandomAccessIter __result_real_last = __result_first;
while(__first != __last && __result_real_last != __result_last) {
*__result_real_last = *__first;
++__result_real_last;
++__first;
}
make_heap(__result_first, __result_real_last);
while (__first != __last) {
if (*__first < *__result_first)
__adjust_heap(__result_first, _Distance(0),
_Distance(__result_real_last - __result_first),
_Tp(*__first));
++__first;
}
sort_heap(__result_first, __result_real_last);
return __result_real_last;
}
template <class _InputIter, class _RandomAccessIter>
inline _RandomAccessIter
partial_sort_copy(_InputIter __first, _InputIter __last,
_RandomAccessIter __result_first,
_RandomAccessIter __result_last) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter>::value_type , typename iterator_traits<_RandomAccessIter>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_InputIter>::value_type , typename iterator_traits<_RandomAccessIter>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
return __partial_sort_copy(__first, __last, __result_first, __result_last,
__distance_type(__result_first),
__value_type(__first));
}
template <class _InputIter, class _RandomAccessIter, class _Compare,
class _Distance, class _Tp>
_RandomAccessIter __partial_sort_copy(_InputIter __first,
_InputIter __last,
_RandomAccessIter __result_first,
_RandomAccessIter __result_last,
_Compare __comp, _Distance*, _Tp*) {
if (__result_first == __result_last) return __result_last;
_RandomAccessIter __result_real_last = __result_first;
while(__first != __last && __result_real_last != __result_last) {
*__result_real_last = *__first;
++__result_real_last;
++__first;
}
make_heap(__result_first, __result_real_last, __comp);
while (__first != __last) {
if (__comp(*__first, *__result_first))
__adjust_heap(__result_first, _Distance(0),
_Distance(__result_real_last - __result_first),
_Tp(*__first),
__comp);
++__first;
}
sort_heap(__result_first, __result_real_last, __comp);
return __result_real_last;
}
template <class _InputIter, class _RandomAccessIter, class _Compare>
inline _RandomAccessIter
partial_sort_copy(_InputIter __first, _InputIter __last,
_RandomAccessIter __result_first,
_RandomAccessIter __result_last, _Compare __comp) {
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter>::value_type , typename iterator_traits<_RandomAccessIter>::value_type ) = _STL_CONVERT_ERROR< typename iterator_traits<_InputIter>::value_type , typename iterator_traits<_RandomAccessIter>::value_type >::__type_X_is_not_convertible_to_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_RandomAccessIter>::value_type&, const typename iterator_traits<_RandomAccessIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_RandomAccessIter>::value_type, typename iterator_traits<_RandomAccessIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
return __partial_sort_copy(__first, __last, __result_first, __result_last,
__comp,
__distance_type(__result_first),
__value_type(__first));
}
template <class _RandomAccessIter, class _Tp>
void __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
_RandomAccessIter __last, _Tp*) {
while (__last - __first > 3) {
_RandomAccessIter __cut =
__unguarded_partition(__first, __last,
_Tp(__median(*__first,
*(__first + (__last - __first)/2),
*(__last - 1))));
if (__cut <= __nth)
__first = __cut;
else
__last = __cut;
}
__insertion_sort(__first, __last);
}
template <class _RandomAccessIter>
inline void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
_RandomAccessIter __last) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
__nth_element(__first, __nth, __last, __value_type(__first));
}
template <class _RandomAccessIter, class _Tp, class _Compare>
void __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
_RandomAccessIter __last, _Tp*, _Compare __comp) {
while (__last - __first > 3) {
_RandomAccessIter __cut =
__unguarded_partition(__first, __last,
_Tp(__median(*__first,
*(__first + (__last - __first)/2),
*(__last - 1),
__comp)),
__comp);
if (__cut <= __nth)
__first = __cut;
else
__last = __cut;
}
__insertion_sort(__first, __last, __comp);
}
template <class _RandomAccessIter, class _Compare>
inline void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
_RandomAccessIter __last, _Compare __comp) {
do { void (*__x)( _RandomAccessIter ) = _Mutable_RandomAccessIterator_concept_specification< _RandomAccessIter > ::_Mutable_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_RandomAccessIter>::value_type&, const typename iterator_traits<_RandomAccessIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_RandomAccessIter>::value_type, typename iterator_traits<_RandomAccessIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
__nth_element(__first, __nth, __last, __value_type(__first), __comp);
}
template <class _ForwardIter, class _Tp, class _Distance>
_ForwardIter __lower_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val, _Distance*)
{
_Distance __len = 0;
distance(__first, __last, __len);
_Distance __half;
_ForwardIter __middle;
while (__len > 0) {
__half = __len >> 1;
__middle = __first;
advance(__middle, __half);
if (*__middle < __val) {
__first = __middle;
++__first;
__len = __len - __half - 1;
}
else
__len = __half;
}
return __first;
}
template <class _ForwardIter, class _Tp>
inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
return __lower_bound(__first, __last, __val,
__distance_type(__first));
}
template <class _ForwardIter, class _Tp, class _Compare, class _Distance>
_ForwardIter __lower_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val, _Compare __comp, _Distance*)
{
_Distance __len = 0;
distance(__first, __last, __len);
_Distance __half;
_ForwardIter __middle;
while (__len > 0) {
__half = __len >> 1;
__middle = __first;
advance(__middle, __half);
if (__comp(*__middle, __val)) {
__first = __middle;
++__first;
__len = __len - __half - 1;
}
else
__len = __half;
}
return __first;
}
template <class _ForwardIter, class _Tp, class _Compare>
inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val, _Compare __comp) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const _Tp&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, _Tp, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
return __lower_bound(__first, __last, __val, __comp,
__distance_type(__first));
}
template <class _ForwardIter, class _Tp, class _Distance>
_ForwardIter __upper_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val, _Distance*)
{
_Distance __len = 0;
distance(__first, __last, __len);
_Distance __half;
_ForwardIter __middle;
while (__len > 0) {
__half = __len >> 1;
__middle = __first;
advance(__middle, __half);
if (__val < *__middle)
__len = __half;
else {
__first = __middle;
++__first;
__len = __len - __half - 1;
}
}
return __first;
}
template <class _ForwardIter, class _Tp>
inline _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
return __upper_bound(__first, __last, __val,
__distance_type(__first));
}
template <class _ForwardIter, class _Tp, class _Compare, class _Distance>
_ForwardIter __upper_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val, _Compare __comp, _Distance*)
{
_Distance __len = 0;
distance(__first, __last, __len);
_Distance __half;
_ForwardIter __middle;
while (__len > 0) {
__half = __len >> 1;
__middle = __first;
advance(__middle, __half);
if (__comp(__val, *__middle))
__len = __half;
else {
__first = __middle;
++__first;
__len = __len - __half - 1;
}
}
return __first;
}
template <class _ForwardIter, class _Tp, class _Compare>
inline _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val, _Compare __comp) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const _Tp&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, _Tp, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
return __upper_bound(__first, __last, __val, __comp,
__distance_type(__first));
}
template <class _ForwardIter, class _Tp, class _Distance>
pair<_ForwardIter, _ForwardIter>
__equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
_Distance*)
{
_Distance __len = 0;
distance(__first, __last, __len);
_Distance __half;
_ForwardIter __middle, __left, __right;
while (__len > 0) {
__half = __len >> 1;
__middle = __first;
advance(__middle, __half);
if (*__middle < __val) {
__first = __middle;
++__first;
__len = __len - __half - 1;
}
else if (__val < *__middle)
__len = __half;
else {
__left = lower_bound(__first, __middle, __val);
advance(__first, __len);
__right = upper_bound(++__middle, __first, __val);
return pair<_ForwardIter, _ForwardIter>(__left, __right);
}
}
return pair<_ForwardIter, _ForwardIter>(__first, __first);
}
template <class _ForwardIter, class _Tp>
inline pair<_ForwardIter, _ForwardIter>
equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
return __equal_range(__first, __last, __val,
__distance_type(__first));
}
template <class _ForwardIter, class _Tp, class _Compare, class _Distance>
pair<_ForwardIter, _ForwardIter>
__equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
_Compare __comp, _Distance*)
{
_Distance __len = 0;
distance(__first, __last, __len);
_Distance __half;
_ForwardIter __middle, __left, __right;
while (__len > 0) {
__half = __len >> 1;
__middle = __first;
advance(__middle, __half);
if (__comp(*__middle, __val)) {
__first = __middle;
++__first;
__len = __len - __half - 1;
}
else if (__comp(__val, *__middle))
__len = __half;
else {
__left = lower_bound(__first, __middle, __val, __comp);
advance(__first, __len);
__right = upper_bound(++__middle, __first, __val, __comp);
return pair<_ForwardIter, _ForwardIter>(__left, __right);
}
}
return pair<_ForwardIter, _ForwardIter>(__first, __first);
}
template <class _ForwardIter, class _Tp, class _Compare>
inline pair<_ForwardIter, _ForwardIter>
equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
_Compare __comp) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const _Tp&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, _Tp, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
return __equal_range(__first, __last, __val, __comp,
__distance_type(__first));
}
template <class _ForwardIter, class _Tp>
bool binary_search(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( _Tp ) = _LessThanComparable_concept_specification< _Tp > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
_ForwardIter __i = lower_bound(__first, __last, __val);
return __i != __last && !(__val < *__i);
}
template <class _ForwardIter, class _Tp, class _Compare>
bool binary_search(_ForwardIter __first, _ForwardIter __last,
const _Tp& __val,
_Compare __comp) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _Tp , typename iterator_traits<_ForwardIter>::value_type ) = _STL_SAME_TYPE_ERROR< _Tp, typename iterator_traits<_ForwardIter>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const _Tp&, const _Tp& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, _Tp, _Tp>::__binary_function_requirement_violation; __x = __x; } while (0);
_ForwardIter __i = lower_bound(__first, __last, __val, __comp);
return __i != __last && !__comp(__val, *__i);
}
template <class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2) {
if (*__first2 < *__first1) {
*__result = *__first2;
++__first2;
}
else {
*__result = *__first1;
++__first1;
}
++__result;
}
return copy(__first2, __last2, copy(__first1, __last1, __result));
}
template <class _InputIter1, class _InputIter2, class _OutputIter,
class _Compare>
_OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result, _Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_InputIter1>::value_type&, const typename iterator_traits<_InputIter1>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter1>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2) {
if (__comp(*__first2, *__first1)) {
*__result = *__first2;
++__first2;
}
else {
*__result = *__first1;
++__first1;
}
++__result;
}
return copy(__first2, __last2, copy(__first1, __last1, __result));
}
template <class _BidirectionalIter, class _Distance>
void __merge_without_buffer(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last,
_Distance __len1, _Distance __len2) {
if (__len1 == 0 || __len2 == 0)
return;
if (__len1 + __len2 == 2) {
if (*__middle < *__first)
iter_swap(__first, __middle);
return;
}
_BidirectionalIter __first_cut = __first;
_BidirectionalIter __second_cut = __middle;
_Distance __len11 = 0;
_Distance __len22 = 0;
if (__len1 > __len2) {
__len11 = __len1 / 2;
advance(__first_cut, __len11);
__second_cut = lower_bound(__middle, __last, *__first_cut);
distance(__middle, __second_cut, __len22);
}
else {
__len22 = __len2 / 2;
advance(__second_cut, __len22);
__first_cut = upper_bound(__first, __middle, *__second_cut);
distance(__first, __first_cut, __len11);
}
_BidirectionalIter __new_middle
= rotate(__first_cut, __middle, __second_cut);
__merge_without_buffer(__first, __first_cut, __new_middle,
__len11, __len22);
__merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11,
__len2 - __len22);
}
template <class _BidirectionalIter, class _Distance, class _Compare>
void __merge_without_buffer(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last,
_Distance __len1, _Distance __len2,
_Compare __comp) {
if (__len1 == 0 || __len2 == 0)
return;
if (__len1 + __len2 == 2) {
if (__comp(*__middle, *__first))
iter_swap(__first, __middle);
return;
}
_BidirectionalIter __first_cut = __first;
_BidirectionalIter __second_cut = __middle;
_Distance __len11 = 0;
_Distance __len22 = 0;
if (__len1 > __len2) {
__len11 = __len1 / 2;
advance(__first_cut, __len11);
__second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
distance(__middle, __second_cut, __len22);
}
else {
__len22 = __len2 / 2;
advance(__second_cut, __len22);
__first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
distance(__first, __first_cut, __len11);
}
_BidirectionalIter __new_middle
= rotate(__first_cut, __middle, __second_cut);
__merge_without_buffer(__first, __first_cut, __new_middle, __len11, __len22,
__comp);
__merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11,
__len2 - __len22, __comp);
}
template <class _BidirectionalIter1, class _BidirectionalIter2,
class _Distance>
_BidirectionalIter1 __rotate_adaptive(_BidirectionalIter1 __first,
_BidirectionalIter1 __middle,
_BidirectionalIter1 __last,
_Distance __len1, _Distance __len2,
_BidirectionalIter2 __buffer,
_Distance __buffer_size) {
_BidirectionalIter2 __buffer_end;
if (__len1 > __len2 && __len2 <= __buffer_size) {
__buffer_end = copy(__middle, __last, __buffer);
copy_backward(__first, __middle, __last);
return copy(__buffer, __buffer_end, __first);
}
else if (__len1 <= __buffer_size) {
__buffer_end = copy(__first, __middle, __buffer);
copy(__middle, __last, __first);
return copy_backward(__buffer, __buffer_end, __last);
}
else
return rotate(__first, __middle, __last);
}
template <class _BidirectionalIter1, class _BidirectionalIter2,
class _BidirectionalIter3>
_BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
_BidirectionalIter1 __last1,
_BidirectionalIter2 __first2,
_BidirectionalIter2 __last2,
_BidirectionalIter3 __result) {
if (__first1 == __last1)
return copy_backward(__first2, __last2, __result);
if (__first2 == __last2)
return copy_backward(__first1, __last1, __result);
--__last1;
--__last2;
while (true) {
if (*__last2 < *__last1) {
*--__result = *__last1;
if (__first1 == __last1)
return copy_backward(__first2, ++__last2, __result);
--__last1;
}
else {
*--__result = *__last2;
if (__first2 == __last2)
return copy_backward(__first1, ++__last1, __result);
--__last2;
}
}
}
template <class _BidirectionalIter1, class _BidirectionalIter2,
class _BidirectionalIter3, class _Compare>
_BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
_BidirectionalIter1 __last1,
_BidirectionalIter2 __first2,
_BidirectionalIter2 __last2,
_BidirectionalIter3 __result,
_Compare __comp) {
if (__first1 == __last1)
return copy_backward(__first2, __last2, __result);
if (__first2 == __last2)
return copy_backward(__first1, __last1, __result);
--__last1;
--__last2;
while (true) {
if (__comp(*__last2, *__last1)) {
*--__result = *__last1;
if (__first1 == __last1)
return copy_backward(__first2, ++__last2, __result);
--__last1;
}
else {
*--__result = *__last2;
if (__first2 == __last2)
return copy_backward(__first1, ++__last1, __result);
--__last2;
}
}
}
template <class _BidirectionalIter, class _Distance, class _Pointer>
void __merge_adaptive(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last,
_Distance __len1, _Distance __len2,
_Pointer __buffer, _Distance __buffer_size) {
if (__len1 <= __len2 && __len1 <= __buffer_size) {
_Pointer __buffer_end = copy(__first, __middle, __buffer);
merge(__buffer, __buffer_end, __middle, __last, __first);
}
else if (__len2 <= __buffer_size) {
_Pointer __buffer_end = copy(__middle, __last, __buffer);
__merge_backward(__first, __middle, __buffer, __buffer_end, __last);
}
else {
_BidirectionalIter __first_cut = __first;
_BidirectionalIter __second_cut = __middle;
_Distance __len11 = 0;
_Distance __len22 = 0;
if (__len1 > __len2) {
__len11 = __len1 / 2;
advance(__first_cut, __len11);
__second_cut = lower_bound(__middle, __last, *__first_cut);
distance(__middle, __second_cut, __len22);
}
else {
__len22 = __len2 / 2;
advance(__second_cut, __len22);
__first_cut = upper_bound(__first, __middle, *__second_cut);
distance(__first, __first_cut, __len11);
}
_BidirectionalIter __new_middle =
__rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11,
__len22, __buffer, __buffer_size);
__merge_adaptive(__first, __first_cut, __new_middle, __len11,
__len22, __buffer, __buffer_size);
__merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11,
__len2 - __len22, __buffer, __buffer_size);
}
}
template <class _BidirectionalIter, class _Distance, class _Pointer,
class _Compare>
void __merge_adaptive(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last,
_Distance __len1, _Distance __len2,
_Pointer __buffer, _Distance __buffer_size,
_Compare __comp) {
if (__len1 <= __len2 && __len1 <= __buffer_size) {
_Pointer __buffer_end = copy(__first, __middle, __buffer);
merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
}
else if (__len2 <= __buffer_size) {
_Pointer __buffer_end = copy(__middle, __last, __buffer);
__merge_backward(__first, __middle, __buffer, __buffer_end, __last,
__comp);
}
else {
_BidirectionalIter __first_cut = __first;
_BidirectionalIter __second_cut = __middle;
_Distance __len11 = 0;
_Distance __len22 = 0;
if (__len1 > __len2) {
__len11 = __len1 / 2;
advance(__first_cut, __len11);
__second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
distance(__middle, __second_cut, __len22);
}
else {
__len22 = __len2 / 2;
advance(__second_cut, __len22);
__first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
distance(__first, __first_cut, __len11);
}
_BidirectionalIter __new_middle =
__rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11,
__len22, __buffer, __buffer_size);
__merge_adaptive(__first, __first_cut, __new_middle, __len11,
__len22, __buffer, __buffer_size, __comp);
__merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11,
__len2 - __len22, __buffer, __buffer_size, __comp);
}
}
template <class _BidirectionalIter, class _Tp, class _Distance>
inline void __inplace_merge_aux(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last, _Tp*, _Distance*) {
_Distance __len1 = 0;
distance(__first, __middle, __len1);
_Distance __len2 = 0;
distance(__middle, __last, __len2);
_Temporary_buffer<_BidirectionalIter, _Tp> __buf(__first, __last);
if (__buf.begin() == 0)
__merge_without_buffer(__first, __middle, __last, __len1, __len2);
else
__merge_adaptive(__first, __middle, __last, __len1, __len2,
__buf.begin(), _Distance(__buf.size()));
}
template <class _BidirectionalIter, class _Tp,
class _Distance, class _Compare>
inline void __inplace_merge_aux(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last, _Tp*, _Distance*,
_Compare __comp) {
_Distance __len1 = 0;
distance(__first, __middle, __len1);
_Distance __len2 = 0;
distance(__middle, __last, __len2);
_Temporary_buffer<_BidirectionalIter, _Tp> __buf(__first, __last);
if (__buf.begin() == 0)
__merge_without_buffer(__first, __middle, __last, __len1, __len2, __comp);
else
__merge_adaptive(__first, __middle, __last, __len1, __len2,
__buf.begin(), _Distance(__buf.size()),
__comp);
}
template <class _BidirectionalIter>
inline void inplace_merge(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last) {
do { void (*__x)( _BidirectionalIter ) = _Mutable_BidirectionalIterator_concept_specification< _BidirectionalIter > ::_Mutable_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_BidirectionalIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_BidirectionalIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first == __middle || __middle == __last)
return;
__inplace_merge_aux(__first, __middle, __last,
__value_type(__first), __distance_type(__first));
}
template <class _BidirectionalIter, class _Compare>
inline void inplace_merge(_BidirectionalIter __first,
_BidirectionalIter __middle,
_BidirectionalIter __last, _Compare __comp) {
do { void (*__x)( _BidirectionalIter ) = _Mutable_BidirectionalIterator_concept_specification< _BidirectionalIter > ::_Mutable_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_BidirectionalIter>::value_type&, const typename iterator_traits<_BidirectionalIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_BidirectionalIter>::value_type, typename iterator_traits<_BidirectionalIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __middle || __middle == __last)
return;
__inplace_merge_aux(__first, __middle, __last,
__value_type(__first), __distance_type(__first),
__comp);
}
template <class _InputIter1, class _InputIter2>
bool includes(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (*__first2 < *__first1)
return false;
else if(*__first1 < *__first2)
++__first1;
else
++__first1, ++__first2;
return __first2 == __last2;
}
template <class _InputIter1, class _InputIter2, class _Compare>
bool includes(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2, _Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_InputIter1>::value_type&, const typename iterator_traits<_InputIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (__comp(*__first2, *__first1))
return false;
else if(__comp(*__first1, *__first2))
++__first1;
else
++__first1, ++__first2;
return __first2 == __last2;
}
template <class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_union(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
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 copy(__first2, __last2, copy(__first1, __last1, __result));
}
template <class _InputIter1, class _InputIter2, class _OutputIter,
class _Compare>
_OutputIter set_union(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result, _Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_InputIter1>::value_type&, const typename iterator_traits<_InputIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
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 copy(__first2, __last2, copy(__first1, __last1, __result));
}
template <class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_intersection(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (*__first1 < *__first2)
++__first1;
else if (*__first2 < *__first1)
++__first2;
else {
*__result = *__first1;
++__first1;
++__first2;
++__result;
}
return __result;
}
template <class _InputIter1, class _InputIter2, class _OutputIter,
class _Compare>
_OutputIter set_intersection(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result, _Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_InputIter1>::value_type&, const typename iterator_traits<_InputIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (__comp(*__first1, *__first2))
++__first1;
else if (__comp(*__first2, *__first1))
++__first2;
else {
*__result = *__first1;
++__first1;
++__first2;
++__result;
}
return __result;
}
template <class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter set_difference(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (*__first1 < *__first2) {
*__result = *__first1;
++__first1;
++__result;
}
else if (*__first2 < *__first1)
++__first2;
else {
++__first1;
++__first2;
}
return copy(__first1, __last1, __result);
}
template <class _InputIter1, class _InputIter2, class _OutputIter,
class _Compare>
_OutputIter set_difference(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result, _Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_InputIter1>::value_type&, const typename iterator_traits<_InputIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (__comp(*__first1, *__first2)) {
*__result = *__first1;
++__first1;
++__result;
}
else if (__comp(*__first2, *__first1))
++__first2;
else {
++__first1;
++__first2;
}
return copy(__first1, __last1, __result);
}
template <class _InputIter1, class _InputIter2, class _OutputIter>
_OutputIter
set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_InputIter1>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
while (__first1 != __last1 && __first2 != __last2)
if (*__first1 < *__first2) {
*__result = *__first1;
++__first1;
++__result;
}
else if (*__first2 < *__first1) {
*__result = *__first2;
++__first2;
++__result;
}
else {
++__first1;
++__first2;
}
return copy(__first2, __last2, copy(__first1, __last1, __result));
}
template <class _InputIter1, class _InputIter2, class _OutputIter,
class _Compare>
_OutputIter
set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
_InputIter2 __first2, _InputIter2 __last2,
_OutputIter __result,
_Compare __comp) {
do { void (*__x)( _InputIter1 ) = _InputIterator_concept_specification< _InputIter1 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _InputIter2 ) = _InputIterator_concept_specification< _InputIter2 > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _OutputIter ) = _OutputIterator_concept_specification< _OutputIter > ::_OutputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_InputIter1>::value_type , typename iterator_traits<_InputIter2>::value_type ) = _STL_SAME_TYPE_ERROR< typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type >::__type_X_not_same_as_type_Y; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_InputIter1>::value_type&, const typename iterator_traits<_InputIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_InputIter1>::value_type, typename iterator_traits<_InputIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
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 copy(__first2, __last2, copy(__first1, __last1, __result));
}
template <class _ForwardIter>
_ForwardIter max_element(_ForwardIter __first, _ForwardIter __last) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_ForwardIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last) return __first;
_ForwardIter __result = __first;
while (++__first != __last)
if (*__result < *__first)
__result = __first;
return __result;
}
template <class _ForwardIter, class _Compare>
_ForwardIter max_element(_ForwardIter __first, _ForwardIter __last,
_Compare __comp) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_ForwardIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_ForwardIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last) return __first;
_ForwardIter __result = __first;
while (++__first != __last)
if (__comp(*__result, *__first)) __result = __first;
return __result;
}
template <class _ForwardIter>
_ForwardIter min_element(_ForwardIter __first, _ForwardIter __last) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_ForwardIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last) return __first;
_ForwardIter __result = __first;
while (++__first != __last)
if (*__first < *__result)
__result = __first;
return __result;
}
template <class _ForwardIter, class _Compare>
_ForwardIter min_element(_ForwardIter __first, _ForwardIter __last,
_Compare __comp) {
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_ForwardIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_ForwardIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last) return __first;
_ForwardIter __result = __first;
while (++__first != __last)
if (__comp(*__first, *__result))
__result = __first;
return __result;
}
template <class _BidirectionalIter>
bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last) {
do { void (*__x)( _BidirectionalIter ) = _BidirectionalIterator_concept_specification< _BidirectionalIter > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_BidirectionalIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_BidirectionalIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return false;
_BidirectionalIter __i = __first;
++__i;
if (__i == __last)
return false;
__i = __last;
--__i;
for(;;) {
_BidirectionalIter __ii = __i;
--__i;
if (*__i < *__ii) {
_BidirectionalIter __j = __last;
while (!(*__i < *--__j))
{}
iter_swap(__i, __j);
reverse(__ii, __last);
return true;
}
if (__i == __first) {
reverse(__first, __last);
return false;
}
}
}
template <class _BidirectionalIter, class _Compare>
bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
_Compare __comp) {
do { void (*__x)( _BidirectionalIter ) = _BidirectionalIterator_concept_specification< _BidirectionalIter > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_BidirectionalIter>::value_type&, const typename iterator_traits<_BidirectionalIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_BidirectionalIter>::value_type, typename iterator_traits<_BidirectionalIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return false;
_BidirectionalIter __i = __first;
++__i;
if (__i == __last)
return false;
__i = __last;
--__i;
for(;;) {
_BidirectionalIter __ii = __i;
--__i;
if (__comp(*__i, *__ii)) {
_BidirectionalIter __j = __last;
while (!__comp(*__i, *--__j))
{}
iter_swap(__i, __j);
reverse(__ii, __last);
return true;
}
if (__i == __first) {
reverse(__first, __last);
return false;
}
}
}
template <class _BidirectionalIter>
bool prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last) {
do { void (*__x)( _BidirectionalIter ) = _BidirectionalIterator_concept_specification< _BidirectionalIter > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_BidirectionalIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_BidirectionalIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return false;
_BidirectionalIter __i = __first;
++__i;
if (__i == __last)
return false;
__i = __last;
--__i;
for(;;) {
_BidirectionalIter __ii = __i;
--__i;
if (*__ii < *__i) {
_BidirectionalIter __j = __last;
while (!(*--__j < *__i))
{}
iter_swap(__i, __j);
reverse(__ii, __last);
return true;
}
if (__i == __first) {
reverse(__first, __last);
return false;
}
}
}
template <class _BidirectionalIter, class _Compare>
bool prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
_Compare __comp) {
do { void (*__x)( _BidirectionalIter ) = _BidirectionalIterator_concept_specification< _BidirectionalIter > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _Compare&, const typename iterator_traits<_BidirectionalIter>::value_type&, const typename iterator_traits<_BidirectionalIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _Compare, bool, typename iterator_traits<_BidirectionalIter>::value_type, typename iterator_traits<_BidirectionalIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return false;
_BidirectionalIter __i = __first;
++__i;
if (__i == __last)
return false;
__i = __last;
--__i;
for(;;) {
_BidirectionalIter __ii = __i;
--__i;
if (__comp(*__ii, *__i)) {
_BidirectionalIter __j = __last;
while (!__comp(*--__j, *__i))
{}
iter_swap(__i, __j);
reverse(__ii, __last);
return true;
}
if (__i == __first) {
reverse(__first, __last);
return false;
}
}
}
template <class _InputIter, class _ForwardIter>
_InputIter find_first_of(_InputIter __first1, _InputIter __last1,
_ForwardIter __first2, _ForwardIter __last2)
{
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_InputIter>::value_type&, typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_InputIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_InputIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
for ( ; __first1 != __last1; ++__first1)
for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter)
if (*__first1 == *__iter)
return __first1;
return __last1;
}
template <class _InputIter, class _ForwardIter, class _BinaryPredicate>
_InputIter find_first_of(_InputIter __first1, _InputIter __last1,
_ForwardIter __first2, _ForwardIter __last2,
_BinaryPredicate __comp)
{
do { void (*__x)( _InputIter ) = _InputIterator_concept_specification< _InputIter > ::_InputIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _BinaryPredicate&, const typename iterator_traits<_InputIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPredicate, bool, typename iterator_traits<_InputIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
for ( ; __first1 != __last1; ++__first1)
for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter)
if (__comp(*__first1, *__iter))
return __first1;
return __last1;
}
# 3052 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algo.h" 3
template <class _ForwardIter1, class _ForwardIter2>
_ForwardIter1 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2, _ForwardIter2 __last2,
forward_iterator_tag, forward_iterator_tag)
{
if (__first2 == __last2)
return __last1;
else {
_ForwardIter1 __result = __last1;
while (1) {
_ForwardIter1 __new_result
= search(__first1, __last1, __first2, __last2);
if (__new_result == __last1)
return __result;
else {
__result = __new_result;
__first1 = __new_result;
++__first1;
}
}
}
}
template <class _ForwardIter1, class _ForwardIter2,
class _BinaryPredicate>
_ForwardIter1 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2, _ForwardIter2 __last2,
forward_iterator_tag, forward_iterator_tag,
_BinaryPredicate __comp)
{
if (__first2 == __last2)
return __last1;
else {
_ForwardIter1 __result = __last1;
while (1) {
_ForwardIter1 __new_result
= search(__first1, __last1, __first2, __last2, __comp);
if (__new_result == __last1)
return __result;
else {
__result = __new_result;
__first1 = __new_result;
++__first1;
}
}
}
}
template <class _BidirectionalIter1, class _BidirectionalIter2>
_BidirectionalIter1
__find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1,
_BidirectionalIter2 __first2, _BidirectionalIter2 __last2,
bidirectional_iterator_tag, bidirectional_iterator_tag)
{
do { void (*__x)( _BidirectionalIter1 ) = _BidirectionalIterator_concept_specification< _BidirectionalIter1 > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _BidirectionalIter2 ) = _BidirectionalIterator_concept_specification< _BidirectionalIter2 > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
typedef reverse_iterator<_BidirectionalIter1> _RevIter1;
typedef reverse_iterator<_BidirectionalIter2> _RevIter2;
_RevIter1 __rlast1(__first1);
_RevIter2 __rlast2(__first2);
_RevIter1 __rresult = search(_RevIter1(__last1), __rlast1,
_RevIter2(__last2), __rlast2);
if (__rresult == __rlast1)
return __last1;
else {
_BidirectionalIter1 __result = __rresult.base();
advance(__result, -distance(__first2, __last2));
return __result;
}
}
template <class _BidirectionalIter1, class _BidirectionalIter2,
class _BinaryPredicate>
_BidirectionalIter1
__find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1,
_BidirectionalIter2 __first2, _BidirectionalIter2 __last2,
bidirectional_iterator_tag, bidirectional_iterator_tag,
_BinaryPredicate __comp)
{
do { void (*__x)( _BidirectionalIter1 ) = _BidirectionalIterator_concept_specification< _BidirectionalIter1 > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _BidirectionalIter2 ) = _BidirectionalIterator_concept_specification< _BidirectionalIter2 > ::_BidirectionalIterator_requirement_violation; __x = __x; } while (0);
typedef reverse_iterator<_BidirectionalIter1> _RevIter1;
typedef reverse_iterator<_BidirectionalIter2> _RevIter2;
_RevIter1 __rlast1(__first1);
_RevIter2 __rlast2(__first2);
_RevIter1 __rresult = search(_RevIter1(__last1), __rlast1,
_RevIter2(__last2), __rlast2,
__comp);
if (__rresult == __rlast1)
return __last1;
else {
_BidirectionalIter1 __result = __rresult.base();
advance(__result, -distance(__first2, __last2));
return __result;
}
}
template <class _ForwardIter1, class _ForwardIter2>
inline _ForwardIter1
find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2, _ForwardIter2 __last2)
{
do { void (*__x)( _ForwardIter1 ) = _ForwardIterator_concept_specification< _ForwardIter1 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter2 ) = _ForwardIterator_concept_specification< _ForwardIter2 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( typename iterator_traits<_ForwardIter1>::value_type&, typename iterator_traits<_ForwardIter2>::value_type& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter1>::value_type, typename iterator_traits<_ForwardIter2>::value_type>::__binary_operator_requirement_violation; bool (*__y)( const typename iterator_traits<_ForwardIter1>::value_type&, const typename iterator_traits<_ForwardIter2>::value_type& ) = _STL_BINARY_OP_EQUAL_ERROR< bool, typename iterator_traits<_ForwardIter1>::value_type, typename iterator_traits<_ForwardIter2>::value_type>:: __const_binary_operator_requirement_violation; __y = __y; __x = __x; } while (0);
return __find_end(__first1, __last1, __first2, __last2,
__iterator_category(__first1),
__iterator_category(__first2));
}
template <class _ForwardIter1, class _ForwardIter2,
class _BinaryPredicate>
inline _ForwardIter1
find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
_ForwardIter2 __first2, _ForwardIter2 __last2,
_BinaryPredicate __comp)
{
do { void (*__x)( _ForwardIter1 ) = _ForwardIterator_concept_specification< _ForwardIter1 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( _ForwardIter2 ) = _ForwardIterator_concept_specification< _ForwardIter2 > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _BinaryPredicate&, const typename iterator_traits<_ForwardIter1>::value_type&, const typename iterator_traits<_ForwardIter2>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _BinaryPredicate, bool, typename iterator_traits<_ForwardIter1>::value_type, typename iterator_traits<_ForwardIter2>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
return __find_end(__first1, __last1, __first2, __last2,
__iterator_category(__first1),
__iterator_category(__first2),
__comp);
}
template <class _RandomAccessIter, class _Distance>
bool __is_heap(_RandomAccessIter __first, _Distance __n)
{
_Distance __parent = 0;
for (_Distance __child = 1; __child < __n; ++__child) {
if (__first[__parent] < __first[__child])
return false;
if ((__child & 1) == 0)
++__parent;
}
return true;
}
template <class _RandomAccessIter, class _Distance, class _StrictWeakOrdering>
bool __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp,
_Distance __n)
{
_Distance __parent = 0;
for (_Distance __child = 1; __child < __n; ++__child) {
if (__comp(__first[__parent], __first[__child]))
return false;
if ((__child & 1) == 0)
++__parent;
}
return true;
}
template <class _RandomAccessIter>
inline bool is_heap(_RandomAccessIter __first, _RandomAccessIter __last)
{
do { void (*__x)( _RandomAccessIter ) = _RandomAccessIterator_concept_specification< _RandomAccessIter > ::_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_RandomAccessIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_RandomAccessIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
return __is_heap(__first, __last - __first);
}
template <class _RandomAccessIter, class _StrictWeakOrdering>
inline bool is_heap(_RandomAccessIter __first, _RandomAccessIter __last,
_StrictWeakOrdering __comp)
{
do { void (*__x)( _RandomAccessIter ) = _RandomAccessIterator_concept_specification< _RandomAccessIter > ::_RandomAccessIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _StrictWeakOrdering&, const typename iterator_traits<_RandomAccessIter>::value_type&, const typename iterator_traits<_RandomAccessIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _StrictWeakOrdering, bool, typename iterator_traits<_RandomAccessIter>::value_type, typename iterator_traits<_RandomAccessIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
return __is_heap(__first, __comp, __last - __first);
}
template <class _ForwardIter>
bool is_sorted(_ForwardIter __first, _ForwardIter __last)
{
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { void (*__x)( typename iterator_traits<_ForwardIter>::value_type ) = _LessThanComparable_concept_specification< typename iterator_traits<_ForwardIter>::value_type > ::_LessThanComparable_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return true;
_ForwardIter __next = __first;
for (++__next; __next != __last; __first = __next, ++__next) {
if (*__next < *__first)
return false;
}
return true;
}
template <class _ForwardIter, class _StrictWeakOrdering>
bool is_sorted(_ForwardIter __first, _ForwardIter __last,
_StrictWeakOrdering __comp)
{
do { void (*__x)( _ForwardIter ) = _ForwardIterator_concept_specification< _ForwardIter > ::_ForwardIterator_requirement_violation; __x = __x; } while (0);
do { bool (*__x)( _StrictWeakOrdering&, const typename iterator_traits<_ForwardIter>::value_type&, const typename iterator_traits<_ForwardIter>::value_type& ) = _STL_BINARY_FUNCTION_ERROR< _StrictWeakOrdering, bool, typename iterator_traits<_ForwardIter>::value_type, typename iterator_traits<_ForwardIter>::value_type>::__binary_function_requirement_violation; __x = __x; } while (0);
if (__first == __last)
return true;
_ForwardIter __next = __first;
for (++__next; __next != __last; __first = __next, ++__next) {
if (__comp(*__next, *__first))
return false;
}
return true;
}
}
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_algorithm.h" 2 3
# 50 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.tcc" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.tcc" 3
namespace std
{
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>::
_Rep::_S_max_size = (((npos - sizeof(_Rep))/sizeof(_CharT)) - 1) / 4;
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>::_S_empty_rep_storage[
(sizeof(_Rep) + sizeof(_CharT) + sizeof(size_type) - 1)/sizeof(size_type)];
template<typename _CharT, typename _Traits, typename _Alloc>
template<typename _InIter>
_CharT*
basic_string<_CharT, _Traits, _Alloc>::
_S_construct(_InIter __beg, _InIter __end, const _Alloc& __a,
input_iterator_tag)
{
if (__beg == __end && __a == _Alloc())
return _S_empty_rep()._M_refcopy();
_CharT __buf[100];
size_type __i = 0;
while (__beg != __end && __i < sizeof(__buf) / sizeof(_CharT))
{
__buf[__i++] = *__beg;
++__beg;
}
_Rep* __r = _Rep::_S_create(__i, __a);
traits_type::copy(__r->_M_refdata(), __buf, __i);
__r->_M_length = __i;
try
{
for (;;)
{
_CharT* __p = __r->_M_refdata() + __r->_M_length;
_CharT* __last = __r->_M_refdata() + __r->_M_capacity;
for (;;)
{
if (__beg == __end)
{
__r->_M_length = __p - __r->_M_refdata();
*__p = _Rep::_S_terminal;
return __r->_M_refdata();
}
if (__p == __last)
break;
*__p++ = *__beg;
++__beg;
}
size_type __len = __p - __r->_M_refdata();
_Rep* __another = _Rep::_S_create(__len + 1, __a);
traits_type::copy(__another->_M_refdata(),
__r->_M_refdata(), __len);
__r->_M_destroy(__a);
__r = __another;
__r->_M_length = __len;
}
}
catch(...)
{
__r->_M_destroy(__a);
throw;
}
return 0;
}
template<typename _CharT, typename _Traits, typename _Alloc>
template <class _InIter>
_CharT*
basic_string<_CharT,_Traits,_Alloc>::
_S_construct(_InIter __beg, _InIter __end, const _Alloc& __a,
forward_iterator_tag)
{
size_type __dnew = static_cast<size_type>(distance(__beg, __end));
if (__beg == __end && __a == _Alloc())
return _S_empty_rep()._M_refcopy();
_Rep* __r = _Rep::_S_create(__dnew, __a);
try
{ _S_copy_chars(__r->_M_refdata(), __beg, __end); }
catch(...)
{
__r->_M_destroy(__a);
throw;
}
__r->_M_length = __dnew;
__r->_M_refdata()[__dnew] = _Rep::_S_terminal;
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_refcopy();
_Rep* __r = _Rep::_S_create(__n, __a);
try
{
if (__n)
traits_type::assign(__r->_M_refdata(), __n, __c);
}
catch(...)
{
__r->_M_destroy(__a);
throw;
}
__r->_M_length = __n;
__r->_M_refdata()[__n] = _Rep::_S_terminal;
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())
{ }
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_check(__pos),
__str._M_fold(__pos, __n), _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_check(__pos),
__str._M_fold(__pos, __n), __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 + traits_type::length(__s), __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 _InputIter>
basic_string<_CharT, _Traits, _Alloc>::
basic_string(_InputIter __beg, _InputIter __end, const _Alloc& __a)
: _M_dataplus(_S_construct(__beg, __end, __a), __a)
{ }
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>&
basic_string<_CharT, _Traits, _Alloc>::assign(const basic_string& __str)
{
if (_M_rep() != __str._M_rep())
{
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>
void
basic_string<_CharT, _Traits, _Alloc>::_Rep::
_M_destroy(const _Alloc& __a) throw ()
{
size_type __size = sizeof(_Rep) + (_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()->_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)
{
size_type __old_size = this->size();
const size_type __new_size = __old_size + __len2 - __len1;
const _CharT* __src = _M_data() + __pos + __len1;
const size_type __how_much = __old_size - __pos - __len1;
if (_M_rep()->_M_is_shared() || __new_size > capacity())
{
allocator_type __a = get_allocator();
_Rep* __r = _Rep::_S_create(__new_size, __a);
try
{
if (__pos)
traits_type::copy(__r->_M_refdata(), _M_data(), __pos);
if (__how_much)
traits_type::copy(__r->_M_refdata() + __pos + __len2,
__src, __how_much);
}
catch(...)
{
__r->_M_dispose(get_allocator());
throw;
}
_M_rep()->_M_dispose(__a);
_M_data(__r->_M_refdata());
}
else if (__how_much && __len1 != __len2)
{
traits_type::move(_M_data() + __pos + __len2, __src, __how_much);
}
_M_rep()->_M_set_sharable();
_M_rep()->_M_length = __new_size;
_M_data()[__new_size] = _Rep::_S_terminal;
}
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->max_size())
__throw_length_error("basic_string::reserve");
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
{
basic_string __tmp1(_M_ibegin(), _M_iend(), __s.get_allocator());
basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
this->get_allocator());
*this = __tmp2;
__s = __tmp1;
}
}
# 356 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_string.tcc" 3
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>::_Rep*
basic_string<_CharT, _Traits, _Alloc>::_Rep::
_S_create(size_t __capacity, const _Alloc& __alloc)
{
typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
if (__capacity > _S_max_size)
__throw_length_error("basic_string::_S_create");
size_t __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();
__p->_M_length = 0;
return __p;
}
template<typename _CharT, typename _Traits, typename _Alloc>
_CharT*
basic_string<_CharT, _Traits, _Alloc>::_Rep::
_M_clone(const _Alloc& __alloc, size_type __res)
{
_Rep* __r = _Rep::_S_create(_M_length + __res, __alloc);
if (_M_length)
{
try
{ traits_type::copy(__r->_M_refdata(), _M_refdata(), _M_length); }
catch(...)
{
__r->_M_destroy(__alloc);
throw;
}
}
__r->_M_length = _M_length;
return __r->_M_refdata();
}
template<typename _CharT, typename _Traits, typename _Alloc>
inline bool
basic_string<_CharT, _Traits, _Alloc>::_Rep::
_S_excess_slop(size_t __s, size_t __r)
{
return 2 * (__s <= 16 ? 16 : __s) < __r;
}
template<typename _CharT, typename _Traits, typename _Alloc>
void
basic_string<_CharT, _Traits, _Alloc>::resize(size_type __n, _CharT __c)
{
if (__n > max_size())
__throw_length_error("basic_string::resize");
size_type __size = this->size();
if (__size < __n)
this->append(__n - __size, __c);
else if (__n < __size)
this->erase(__n);
}
template<typename _CharT, typename _Traits, typename _Alloc>
template<typename _InputIter>
basic_string<_CharT, _Traits, _Alloc>&
basic_string<_CharT, _Traits, _Alloc>::
_M_replace(iterator __i1, iterator __i2, _InputIter __k1,
_InputIter __k2, input_iterator_tag)
{
basic_string __s(__k1, __k2);
return this->replace(__i1, __i2, __s._M_ibegin(), __s._M_iend());
}
template<typename _CharT, typename _Traits, typename _Alloc>
template<typename _ForwardIter>
basic_string<_CharT, _Traits, _Alloc>&
basic_string<_CharT, _Traits, _Alloc>::
_M_replace(iterator __i1, iterator __i2, _ForwardIter __k1,
_ForwardIter __k2, forward_iterator_tag)
{
size_type __dold = __i2 - __i1;
size_type __dmax = this->max_size();
size_type __dnew = static_cast<size_type>(distance(__k1, __k2));
if (__dmax <= __dnew)
__throw_length_error("basic_string::_M_replace");
size_type __off = __i1 - _M_ibegin();
_M_mutate(__off, __dold, __dnew);
if (__dnew)
_S_copy_chars(_M_data() + __off, __k1, __k2);
return *this;
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>&
basic_string<_CharT, _Traits, _Alloc>::
replace(size_type __pos1, size_type __n1, const basic_string& __str,
size_type __pos2, size_type __n2)
{
return this->replace(_M_check(__pos1), _M_fold(__pos1, __n1),
__str._M_check(__pos2),
__str._M_fold(__pos2, __n2));
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT,_Traits,_Alloc>&
basic_string<_CharT,_Traits,_Alloc>::
append(const basic_string& __str)
{
size_type __size = __str.size();
size_type __len = __size + this->size();
if (__len > this->capacity())
this->reserve(__len);
return this->replace(_M_iend(), _M_iend(), __str._M_ibegin(),
__str._M_iend());
}
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)
{
size_type __len = min(__str.size() - __pos, __n) + this->size();
if (__len > this->capacity())
this->reserve(__len);
return this->replace(_M_iend(), _M_iend(), __str._M_check(__pos),
__str._M_fold(__pos, __n));
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT,_Traits,_Alloc>&
basic_string<_CharT,_Traits,_Alloc>::
append(const _CharT* __s, size_type __n)
{
size_type __len = __n + this->size();
if (__len > this->capacity())
this->reserve(__len);
return this->replace(_M_iend(), _M_iend(), __s, __s + __n);
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT,_Traits,_Alloc>&
basic_string<_CharT,_Traits,_Alloc>::
append(size_type __n, _CharT __c)
{
size_type __len = __n + this->size();
if (__len > this->capacity())
this->reserve(__len);
return this->replace(_M_iend(), _M_iend(), __n, __c);
}
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;
__size_type __len = _Traits::length(__lhs);
__string_type __str;
__str.reserve(__len + __rhs.size());
__str.append(__lhs, __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;
__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>
basic_string<_CharT, _Traits, _Alloc>&
basic_string<_CharT, _Traits, _Alloc>::
replace(iterator __i1, iterator __i2, size_type __n2, _CharT __c)
{
size_type __n1 = __i2 - __i1;
size_type __off1 = __i1 - _M_ibegin();
if (max_size() - (this->size() - __n1) <= __n2)
__throw_length_error("basic_string::replace");
_M_mutate (__off1, __n1, __n2);
if (__n2)
traits_type::assign(_M_data() + __off1, __n2, __c);
return *this;
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>::size_type
basic_string<_CharT, _Traits, _Alloc>::
copy(_CharT* __s, size_type __n, size_type __pos) const
{
if (__pos > this->size())
__throw_out_of_range("basic_string::copy");
if (__n > this->size() - __pos)
__n = this->size() - __pos;
traits_type::copy(__s, _M_data() + __pos, __n);
return __n;
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>::size_type
basic_string<_CharT, _Traits, _Alloc>::
find(const _CharT* __s, size_type __pos, size_type __n) const
{
size_type __size = this->size();
size_t __xpos = __pos;
const _CharT* __data = _M_data();
for (; __xpos + __n <= __size; ++__xpos)
if (traits_type::compare(__data + __xpos, __s, __n) == 0)
return __xpos;
return npos;
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>::size_type
basic_string<_CharT, _Traits, _Alloc>::
find(_CharT __c, size_type __pos) const
{
size_type __size = this->size();
size_type __ret = npos;
if (__pos < __size)
{
const _CharT* __data = _M_data();
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>
basic_string<_CharT, _Traits, _Alloc>::size_type
basic_string<_CharT, _Traits, _Alloc>::
rfind(const _CharT* __s, size_type __pos, size_type __n) const
{
size_type __size = this->size();
if (__n <= __size)
{
__pos = std::min(__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>
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)
{
size_t __xpos = __size - 1;
if (__xpos > __pos)
__xpos = __pos;
for (++__xpos; __xpos-- > 0; )
if (traits_type::eq(_M_data()[__xpos], __c))
return __xpos;
}
return npos;
}
template<typename _CharT, typename _Traits, typename _Alloc>
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>
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>
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
{
size_t __xpos = __pos;
for (; __n && __xpos < this->size(); ++__xpos)
if (!traits_type::find(__s, __n, _M_data()[__xpos]))
return __xpos;
return npos;
}
template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>::size_type
basic_string<_CharT, _Traits, _Alloc>::
find_first_not_of(_CharT __c, size_type __pos) const
{
size_t __xpos = __pos;
for (; __xpos < this->size(); ++__xpos)
if (!traits_type::eq(_M_data()[__xpos], __c))
return __xpos;
return npos;
}
template<typename _CharT, typename _Traits, typename _Alloc>
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 && __n)
{
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>
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
{
size_type __size = this->size();
size_type __osize = __str.size();
if (__pos > __size)
__throw_out_of_range("basic_string::compare");
size_type __rsize= min(__size - __pos, __n);
size_type __len = min(__rsize, __osize);
int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len);
if (!__r)
__r = __rsize - __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
{
size_type __size = this->size();
size_type __osize = __str.size();
if (__pos1 > __size || __pos2 > __osize)
__throw_out_of_range("basic_string::compare");
size_type __rsize = min(__size - __pos1, __n1);
size_type __rosize = min(__osize - __pos2, __n2);
size_type __len = min(__rsize, __rosize);
int __r = traits_type::compare(_M_data() + __pos1,
__str.data() + __pos2, __len);
if (!__r)
__r = __rsize - __rosize;
return __r;
}
template<typename _CharT, typename _Traits, typename _Alloc>
int
basic_string<_CharT, _Traits, _Alloc>::
compare(const _CharT* __s) const
{
size_type __size = this->size();
int __r = traits_type::compare(_M_data(), __s, __size);
if (!__r)
__r = __size - traits_type::length(__s);
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
{
size_type __size = this->size();
if (__pos > __size)
__throw_out_of_range("basic_string::compare");
size_type __osize = min(traits_type::length(__s), __n2);
size_type __rsize = min(__size - __pos, __n1);
size_type __len = min(__rsize, __osize);
int __r = traits_type::compare(_M_data() + __pos, __s, __len);
if (!__r)
__r = __rsize - __osize;
return __r;
}
template <class _CharT, class _Traits, class _Alloc>
void
_S_string_copy(const basic_string<_CharT, _Traits, _Alloc>& __str,
_CharT* __buf, typename _Alloc::size_type __bufsiz)
{
typedef typename _Alloc::size_type size_type;
size_type __strsize = __str.size();
size_type __bytes = min(__strsize, __bufsiz - 1);
_Traits::copy(__buf, __str.data(), __bytes);
__buf[__bytes] = _CharT();
}
}
# 51 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 2 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 2 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 3
# 1 "/usr/include/ctype.h" 1 3
# 26 "/usr/include/ctype.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/ctype.h" 2 3
# 1 "/usr/include/bits/types.h" 1 3
# 28 "/usr/include/ctype.h" 2 3
extern "C" {
# 40 "/usr/include/ctype.h" 3
# 1 "/usr/include/endian.h" 1 3
# 41 "/usr/include/ctype.h" 2 3
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))
};
# 75 "/usr/include/ctype.h" 3
extern __const unsigned short int *__ctype_b;
extern __const __int32_t *__ctype_tolower;
extern __const __int32_t *__ctype_toupper;
# 91 "/usr/include/ctype.h" 3
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 isblank (int) throw ();
extern int tolower (int __c) throw ();
extern int toupper (int __c) throw ();
extern int isascii (int __c) throw ();
extern int toascii (int __c) throw ();
extern int _toupper (int) throw ();
extern int _tolower (int) throw ();
# 213 "/usr/include/ctype.h" 3
# 1 "/usr/include/xlocale.h" 1 3
# 214 "/usr/include/ctype.h" 2 3
# 229 "/usr/include/ctype.h" 3
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 __toupper_l (int __c, __locale_t __l) throw ();
# 275 "/usr/include/ctype.h" 3
}
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 2 3
# 60 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 3
namespace std
{
extern "C" int isalnum(int __c);
extern "C" int isalpha(int __c);
extern "C" int isblank(int __c);
extern "C" int iscntrl(int __c);
extern "C" int isdigit(int __c);
extern "C" int isgraph(int __c);
extern "C" int islower(int __c);
extern "C" int isprint(int __c);
extern "C" int ispunct(int __c);
extern "C" int isspace(int __c);
extern "C" int isupper(int __c);
extern "C" int isxdigit(int __c);
extern "C" int tolower(int __c);
extern "C" int toupper(int __c);
}
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception_defines.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 2 3
namespace std
{
void
__throw_bad_exception(void);
void
__throw_bad_alloc(void);
void
__throw_bad_cast(void);
void
__throw_bad_typeid(void);
void
__throw_logic_error(const char* __s);
void
__throw_domain_error(const char* __s);
void
__throw_invalid_argument(const char* __s);
void
__throw_length_error(const char* __s);
void
__throw_out_of_range(const char* __s);
void
__throw_runtime_error(const char* __s);
void
__throw_range_error(const char* __s);
void
__throw_overflow_error(const char* __s);
void
__throw_underflow_error(const char* __s);
void
__throw_ios_failure(const char* __s);
}
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 2 3
namespace std
{
# 58 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 3
template<unsigned int _Num, int _Shift = (sizeof(unsigned) * 8)/2,
unsigned int _Mask = (~0u >> _Shift) >
struct _Count_ones;
template<unsigned int _Num, unsigned int _Mask>
struct _Count_ones<_Num, 0, _Mask>
{
enum
{
_M_count = _Num
};
};
template<unsigned int _Num, int _Shift, unsigned int _Mask>
struct _Count_ones
{
enum
{
_M_halfcount = _Count_ones<_Num, _Shift/2,
(_Mask^((~_Mask)>>(_Shift/2))) >::_M_count,
_M_count = (_M_halfcount&_Mask) + ((_M_halfcount>>_Shift)&_Mask)
};
};
template<typename _Tp, typename _Alloc>
class vector;
class locale;
template<typename _CharT>
inline bool
isspace(_CharT, const locale&);
template<typename _CharT>
inline bool
isprint(_CharT, const locale&);
template<typename _CharT>
inline bool
iscntrl(_CharT, const locale&);
template<typename _CharT>
inline bool
isupper(_CharT, const locale&);
template<typename _CharT>
inline bool
islower(_CharT, const locale&);
template<typename _CharT>
inline bool
isalpha(_CharT, const locale&);
template<typename _CharT>
inline bool
isdigit(_CharT, const locale&);
template<typename _CharT>
inline bool
ispunct(_CharT, const locale&);
template<typename _CharT>
inline bool
isxdigit(_CharT, const locale&);
template<typename _CharT>
inline bool
isalnum(_CharT, const locale&);
template<typename _CharT>
inline bool
isgraph(_CharT, const locale&);
template<typename _CharT>
inline _CharT
toupper(_CharT, const locale&);
template<typename _CharT>
inline _CharT
tolower(_CharT, const locale&);
class ctype_base;
template<typename _CharT>
class ctype;
template<> class ctype<char>;
template<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<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;
class locale
{
public:
typedef unsigned int category;
class facet;
class id;
class _Impl;
friend class facet;
friend class _Impl;
template<typename _Facet>
friend const _Facet&
use_facet(const locale&);
template<typename _Facet>
friend bool
has_facet(const locale&) throw();
static const category none = 0;
static const category ctype = 1L << 0;
static const category numeric = 1L << 1;
static const category collate = 1L << 2;
static const category time = 1L << 3;
static const category monetary = 1L << 4;
static const category messages = 1L << 5;
static const category all = (collate | ctype | monetary |
numeric | time | messages);
locale() throw();
locale(const locale& __other) throw();
explicit
locale(const char* __std_name);
locale(const locale& __base, const char* __s, category __cat);
locale(const locale& __base, const locale& __add, category __cat);
template<typename _Facet>
locale(const locale& __other, _Facet* __f);
~locale() throw();
const locale&
operator=(const locale& __other) throw();
template<typename _Facet>
locale
combine(const locale& __other);
string
name() const;
bool
operator==(const locale& __other) const throw ();
inline bool
operator!=(const locale& __other) const throw ()
{ return !(this->operator==(__other)); }
template<typename _Char, typename _Traits, typename _Alloc>
bool
operator()(const basic_string<_Char, _Traits, _Alloc>& __s1,
const basic_string<_Char, _Traits, _Alloc>& __s2) const;
static locale
global(const locale&);
static const locale&
classic();
private:
_Impl* _M_impl;
static _Impl* _S_classic;
static _Impl* _S_global;
static const size_t _S_num_categories = _Count_ones<all>::_M_count;
static const size_t _S_num_facets = 13;
explicit
locale(_Impl*) throw();
static inline void
_S_initialize()
{ if (!_S_classic) classic(); }
static category
_S_normalize_category(category);
void
_M_coalesce(const locale& __base, const locale& __add, category __cat);
};
class locale::_Impl
{
public:
typedef vector<facet*, allocator<facet*> > __vec_facet;
friend class locale;
friend class locale::facet;
template<typename _Facet>
friend const _Facet&
use_facet(const locale&);
template<typename _Facet>
friend bool
has_facet(const locale&) throw();
private:
size_t _M_references;
__vec_facet* _M_facets;
string _M_names[_S_num_categories];
__c_locale _M_c_locale;
static const locale::id* const _S_id_ctype[];
static const locale::id* const _S_id_numeric[];
static const locale::id* const _S_id_collate[];
static const locale::id* const _S_id_time[];
static const locale::id* const _S_id_monetary[];
static const locale::id* const _S_id_messages[];
static const locale::id* const* const _S_facet_categories[];
inline void
_M_add_reference() throw()
{ ++_M_references; }
inline void
_M_remove_reference() throw()
{
if (_M_references-- == 0)
{
try
{ delete this; }
catch(...)
{ }
}
}
_Impl(const _Impl&, size_t);
_Impl(string __name, size_t);
~_Impl() throw();
bool
_M_check_same_name()
{
bool __ret = true;
for (size_t i = 0; i < _S_num_categories - 1; ++i)
__ret &= _M_names[i] == _M_names[i + 1];
return __ret;
}
void
_M_replace_categories(const _Impl*, category);
void
_M_replace_category(const _Impl*, const locale::id* const*);
void
_M_replace_facet(const _Impl*, const locale::id*);
void
_M_install_facet(const locale::id*, facet*);
template<typename _Facet>
inline void
_M_init_facet(_Facet* __facet)
{ _M_install_facet(&_Facet::id, __facet); }
};
template<typename _Facet>
locale::locale(const locale& __other, _Facet* __f)
{
_M_impl = new _Impl(*__other._M_impl, 1);
_M_impl->_M_install_facet(&_Facet::id, __f);
for (size_t __i = 0; __i < _S_num_categories; ++__i)
_M_impl->_M_names[__i] = "*";
}
class locale::facet
{
friend class locale;
friend class locale::_Impl;
protected:
explicit
facet(size_t __refs = 0) throw();
virtual
~facet() { };
static void
_S_create_c_locale(__c_locale& __cloc, const char* __s);
static void
_S_destroy_c_locale(__c_locale& __cloc);
private:
size_t _M_references;
void
_M_add_reference() throw();
void
_M_remove_reference() throw();
facet(const facet&);
void
operator=(const facet&);
};
class locale::id
{
private:
friend class locale;
friend class locale::_Impl;
template<typename _Facet>
friend const _Facet&
use_facet(const locale&);
template<typename _Facet>
friend bool
has_facet(const locale&) throw ();
mutable size_t _M_index;
static size_t _S_highwater;
void
operator=(const id&);
id(const id&);
public:
id() { }
};
template<typename _Facet>
const _Facet&
use_facet(const locale& __loc);
template<typename _Facet>
bool
has_facet(const locale& __loc) throw();
}
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/ios_base.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/ios_base.h" 3
namespace std {
enum _Ios_Fmtflags { _M_ios_fmtflags_end = 1L << 16 };
inline _Ios_Fmtflags
operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
{ return _Ios_Fmtflags(static_cast<int>(__a) & static_cast<int>(__b)); }
inline _Ios_Fmtflags
operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
{ return _Ios_Fmtflags(static_cast<int>(__a) | static_cast<int>(__b)); }
inline _Ios_Fmtflags
operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
{ return _Ios_Fmtflags(static_cast<int>(__a) ^ static_cast<int>(__b)); }
inline _Ios_Fmtflags
operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
{ return __a = __a | __b; }
inline _Ios_Fmtflags
operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
{ return __a = __a & __b; }
inline _Ios_Fmtflags
operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
{ return __a = __a ^ __b; }
inline _Ios_Fmtflags
operator~(_Ios_Fmtflags __a)
{ return _Ios_Fmtflags(~static_cast<int>(__a)); }
enum _Ios_Openmode { _M_ios_openmode_end = 1L << 16 };
inline _Ios_Openmode
operator&(_Ios_Openmode __a, _Ios_Openmode __b)
{ return _Ios_Openmode(static_cast<int>(__a) & static_cast<int>(__b)); }
inline _Ios_Openmode
operator|(_Ios_Openmode __a, _Ios_Openmode __b)
{ return _Ios_Openmode(static_cast<int>(__a) | static_cast<int>(__b)); }
inline _Ios_Openmode
operator^(_Ios_Openmode __a, _Ios_Openmode __b)
{ return _Ios_Openmode(static_cast<int>(__a) ^ static_cast<int>(__b)); }
inline _Ios_Openmode
operator|=(_Ios_Openmode& __a, _Ios_Openmode __b)
{ return __a = __a | __b; }
inline _Ios_Openmode
operator&=(_Ios_Openmode& __a, _Ios_Openmode __b)
{ return __a = __a & __b; }
inline _Ios_Openmode
operator^=(_Ios_Openmode& __a, _Ios_Openmode __b)
{ return __a = __a ^ __b; }
inline _Ios_Openmode
operator~(_Ios_Openmode __a)
{ return _Ios_Openmode(~static_cast<int>(__a)); }
enum _Ios_Iostate { _M_ios_iostate_end = 1L << 16 };
inline _Ios_Iostate
operator&(_Ios_Iostate __a, _Ios_Iostate __b)
{ return _Ios_Iostate(static_cast<int>(__a) & static_cast<int>(__b)); }
inline _Ios_Iostate
operator|(_Ios_Iostate __a, _Ios_Iostate __b)
{ return _Ios_Iostate(static_cast<int>(__a) | static_cast<int>(__b)); }
inline _Ios_Iostate
operator^(_Ios_Iostate __a, _Ios_Iostate __b)
{ return _Ios_Iostate(static_cast<int>(__a) ^ static_cast<int>(__b)); }
inline _Ios_Iostate
operator|=(_Ios_Iostate& __a, _Ios_Iostate __b)
{ return __a = __a | __b; }
inline _Ios_Iostate
operator&=(_Ios_Iostate& __a, _Ios_Iostate __b)
{ return __a = __a & __b; }
inline _Ios_Iostate
operator^=(_Ios_Iostate& __a, _Ios_Iostate __b)
{ return __a = __a ^ __b; }
inline _Ios_Iostate
operator~(_Ios_Iostate __a)
{ return _Ios_Iostate(~static_cast<int>(__a)); }
enum _Ios_Seekdir { _M_ios_seekdir_end = 1L << 16 };
class ios_base
{
public:
class failure : public exception
{
public:
explicit
failure(const string& __str) throw();
virtual
~failure() throw();
virtual const char*
what() const throw();
private:
enum { _M_bufsize = 256 };
char _M_name[_M_bufsize];
};
typedef _Ios_Fmtflags fmtflags;
static const fmtflags boolalpha = fmtflags(__ios_flags::_S_boolalpha);
static const fmtflags dec = fmtflags(__ios_flags::_S_dec);
static const fmtflags fixed = fmtflags(__ios_flags::_S_fixed);
static const fmtflags hex = fmtflags(__ios_flags::_S_hex);
static const fmtflags internal = fmtflags(__ios_flags::_S_internal);
static const fmtflags left = fmtflags(__ios_flags::_S_left);
static const fmtflags oct = fmtflags(__ios_flags::_S_oct);
static const fmtflags right = fmtflags(__ios_flags::_S_right);
static const fmtflags scientific = fmtflags(__ios_flags::_S_scientific);
static const fmtflags showbase = fmtflags(__ios_flags::_S_showbase);
static const fmtflags showpoint = fmtflags(__ios_flags::_S_showpoint);
static const fmtflags showpos = fmtflags(__ios_flags::_S_showpos);
static const fmtflags skipws = fmtflags(__ios_flags::_S_skipws);
static const fmtflags unitbuf = fmtflags(__ios_flags::_S_unitbuf);
static const fmtflags uppercase = fmtflags(__ios_flags::_S_uppercase);
static const fmtflags adjustfield = fmtflags(__ios_flags::_S_adjustfield);
static const fmtflags basefield = fmtflags(__ios_flags::_S_basefield);
static const fmtflags floatfield = fmtflags(__ios_flags::_S_floatfield);
typedef _Ios_Iostate iostate;
static const iostate badbit = iostate(__ios_flags::_S_badbit);
static const iostate eofbit = iostate(__ios_flags::_S_eofbit);
static const iostate failbit = iostate(__ios_flags::_S_failbit);
static const iostate goodbit = iostate(0);
typedef _Ios_Openmode openmode;
static const openmode app = openmode(__ios_flags::_S_app);
static const openmode ate = openmode(__ios_flags::_S_ate);
static const openmode binary = openmode(__ios_flags::_S_bin);
static const openmode in = openmode(__ios_flags::_S_in);
static const openmode out = openmode(__ios_flags::_S_out);
static const openmode trunc = openmode(__ios_flags::_S_trunc);
typedef _Ios_Seekdir seekdir;
static const seekdir beg = seekdir(0);
static const seekdir cur = seekdir(1);
static const seekdir end = seekdir(2);
# 216 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/ios_base.h" 3
enum event
{
erase_event,
imbue_event,
copyfmt_event
};
typedef void (*event_callback) (event, ios_base&, int);
void
register_callback(event_callback __fn, int __index);
protected:
streamsize _M_precision;
streamsize _M_width;
fmtflags _M_flags;
struct _Callback_list
{
_Callback_list* _M_next;
ios_base::event_callback _M_fn;
int _M_index;
int _M_refcount;
_Callback_list(ios_base::event_callback __fn, int __index,
_Callback_list* __cb)
: _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { }
void
_M_add_reference() { ++_M_refcount; }
int
_M_remove_reference() { return _M_refcount--; }
};
_Callback_list* _M_callbacks;
void
_M_call_callbacks(event __ev) throw();
void
_M_dispose_callbacks(void);
struct _Words
{
void* _M_pword;
long _M_iword;
};
static const int _S_local_words = 8;
_Words _M_word_array[_S_local_words];
_Words _M_dummy;
_Words* _M_words;
int _M_word_limit;
_Words&
_M_grow_words(int __index);
locale _M_ios_locale;
void
_M_init();
public:
class Init
{
friend class ios_base;
public:
Init();
~Init();
private:
static int _S_ios_base_init;
static bool _S_synced_with_stdio;
filebuf* _M_cout;
filebuf* _M_cin;
filebuf* _M_cerr;
};
inline fmtflags
flags() const { return _M_flags; }
inline fmtflags
flags(fmtflags __fmtfl)
{
fmtflags __old = _M_flags;
_M_flags = __fmtfl;
return __old;
}
inline fmtflags
setf(fmtflags __fmtfl)
{
fmtflags __old = _M_flags;
_M_flags |= __fmtfl;
return __old;
}
inline fmtflags
setf(fmtflags __fmtfl, fmtflags __mask)
{
fmtflags __old = _M_flags;
_M_flags &= ~__mask;
_M_flags |= (__fmtfl & __mask);
return __old;
}
inline void
unsetf(fmtflags __mask) { _M_flags &= ~__mask; }
inline streamsize
precision() const { return _M_precision; }
inline streamsize
precision(streamsize __prec)
{
streamsize __old = _M_precision;
_M_precision = __prec;
return __old;
}
inline streamsize
width() const { return _M_width; }
inline streamsize
width(streamsize __wide)
{
streamsize __old = _M_width;
_M_width = __wide;
return __old;
}
static bool
sync_with_stdio(bool __sync = true);
locale
imbue(const locale& __loc);
inline locale
getloc() const { return _M_ios_locale; }
static int
xalloc() throw();
inline long&
iword(int __ix)
{
_Words& __word = (__ix < _M_word_limit)
? _M_words[__ix] : _M_grow_words(__ix);
return __word._M_iword;
}
inline void*&
pword(int __ix)
{
_Words& __word = (__ix < _M_word_limit)
? _M_words[__ix] : _M_grow_words(__ix);
return __word._M_pword;
}
~ios_base();
protected:
ios_base();
private:
ios_base(const ios_base&);
ios_base&
operator=(const ios_base&);
};
inline ios_base&
boolalpha(ios_base& __base)
{
__base.setf(ios_base::boolalpha);
return __base;
}
inline ios_base&
noboolalpha(ios_base& __base)
{
__base.unsetf(ios_base::boolalpha);
return __base;
}
inline ios_base&
showbase(ios_base& __base)
{
__base.setf(ios_base::showbase);
return __base;
}
inline ios_base&
noshowbase(ios_base& __base)
{
__base.unsetf(ios_base::showbase);
return __base;
}
inline ios_base&
showpoint(ios_base& __base)
{
__base.setf(ios_base::showpoint);
return __base;
}
inline ios_base&
noshowpoint(ios_base& __base)
{
__base.unsetf(ios_base::showpoint);
return __base;
}
inline ios_base&
showpos(ios_base& __base)
{
__base.setf(ios_base::showpos);
return __base;
}
inline ios_base&
noshowpos(ios_base& __base)
{
__base.unsetf(ios_base::showpos);
return __base;
}
inline ios_base&
skipws(ios_base& __base)
{
__base.setf(ios_base::skipws);
return __base;
}
inline ios_base&
noskipws(ios_base& __base)
{
__base.unsetf(ios_base::skipws);
return __base;
}
inline ios_base&
uppercase(ios_base& __base)
{
__base.setf(ios_base::uppercase);
return __base;
}
inline ios_base&
nouppercase(ios_base& __base)
{
__base.unsetf(ios_base::uppercase);
return __base;
}
inline ios_base&
unitbuf(ios_base& __base)
{
__base.setf(ios_base::unitbuf);
return __base;
}
inline ios_base&
nounitbuf(ios_base& __base)
{
__base.unsetf(ios_base::unitbuf);
return __base;
}
inline ios_base&
internal(ios_base& __base)
{
__base.setf(ios_base::internal, ios_base::adjustfield);
return __base;
}
inline ios_base&
left(ios_base& __base)
{
__base.setf(ios_base::left, ios_base::adjustfield);
return __base;
}
inline ios_base&
right(ios_base& __base)
{
__base.setf(ios_base::right, ios_base::adjustfield);
return __base;
}
inline ios_base&
dec(ios_base& __base)
{
__base.setf(ios_base::dec, ios_base::basefield);
return __base;
}
inline ios_base&
hex(ios_base& __base)
{
__base.setf(ios_base::hex, ios_base::basefield);
return __base;
}
inline ios_base&
oct(ios_base& __base)
{
__base.setf(ios_base::oct, ios_base::basefield);
return __base;
}
inline ios_base&
fixed(ios_base& __base)
{
__base.setf(ios_base::fixed, ios_base::floatfield);
return __base;
}
inline ios_base&
scientific(ios_base& __base)
{
__base.setf(ios_base::scientific, ios_base::floatfield);
return __base;
}
}
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdio.h" 1 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/ios_base.h" 1 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 2 3
namespace std {
template<typename _CharT, typename _Traits>
streamsize
__copy_streambufs(basic_ios<_CharT, _Traits>& _ios,
basic_streambuf<_CharT, _Traits>* __sbin,
basic_streambuf<_CharT, _Traits>* __sbout);
template<typename _CharT, typename _Traits>
class basic_streambuf
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef typename traits_type::int_type int_type;
typedef typename traits_type::pos_type pos_type;
typedef typename traits_type::off_type off_type;
typedef ctype<char_type> __ctype_type;
typedef basic_streambuf<char_type, traits_type> __streambuf_type;
friend class basic_ios<char_type, traits_type>;
friend class basic_istream<char_type, traits_type>;
friend class basic_ostream<char_type, traits_type>;
friend class istreambuf_iterator<char_type, traits_type>;
friend class ostreambuf_iterator<char_type, traits_type>;
friend streamsize
__copy_streambufs<>(basic_ios<char_type, traits_type>& __ios,
__streambuf_type* __sbin,__streambuf_type* __sbout);
protected:
char_type* _M_buf;
int_type _M_buf_size;
int_type _M_buf_size_opt;
bool _M_buf_unified;
char_type* _M_in_beg;
char_type* _M_in_cur;
char_type* _M_in_end;
char_type* _M_out_beg;
char_type* _M_out_cur;
char_type* _M_out_end;
ios_base::openmode _M_mode;
locale _M_buf_locale;
bool _M_buf_locale_init;
const __ctype_type* _M_buf_fctype;
int_type _M_pback_size;
char_type* _M_pback;
char_type* _M_pback_cur_save;
char_type* _M_pback_end_save;
bool _M_pback_init;
void
_M_pback_create()
{
if (!_M_pback_init)
{
int_type __dist = _M_in_end - _M_in_cur;
int_type __len = min(_M_pback_size, __dist);
traits_type::copy(_M_pback, _M_in_cur, __len);
_M_pback_cur_save = _M_in_cur;
_M_pback_end_save = _M_in_end;
this->setg(_M_pback, _M_pback, _M_pback + __len);
_M_pback_init = true;
}
}
void
_M_pback_destroy()
{
if (_M_pback_init)
{
int_type __off_cur = _M_in_cur - _M_pback;
int_type __off_end = 0;
int_type __pback_len = _M_in_end - _M_pback;
int_type __save_len = _M_pback_end_save - _M_buf;
if (__pback_len > __save_len)
__off_end = __pback_len - __save_len;
this->setg(_M_buf, _M_pback_cur_save + __off_cur,
_M_pback_end_save + __off_end);
_M_pback_cur_save = __null;
_M_pback_end_save = __null;
_M_pback_init = false;
}
}
void
_M_in_cur_move(off_type __n)
{
bool __testout = _M_out_cur;
_M_in_cur += __n;
if (__testout && _M_buf_unified)
_M_out_cur += __n;
}
# 196 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 3
void
_M_out_cur_move(off_type __n)
{
bool __testin = _M_in_cur;
_M_out_cur += __n;
if (__testin && _M_buf_unified)
_M_in_cur += __n;
if (_M_out_cur > _M_out_end)
{
_M_out_end = _M_out_cur;
if (__testin)
_M_in_end += __n;
}
}
off_type
_M_out_buf_size()
{
off_type __ret = 0;
if (_M_out_cur)
{
if (_M_out_beg == _M_buf)
__ret = _M_out_beg + _M_buf_size - _M_out_cur;
else
__ret = _M_out_end - _M_out_cur;
}
return __ret;
}
# 239 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 3
void
_M_set_indeterminate(void)
{
if (_M_mode & ios_base::in)
this->setg(_M_buf, _M_buf, _M_buf);
if (_M_mode & ios_base::out)
this->setp(_M_buf, _M_buf);
}
void
_M_set_determinate(off_type __off)
{
bool __testin = _M_mode & ios_base::in;
bool __testout = _M_mode & ios_base::out;
if (__testin)
this->setg(_M_buf, _M_buf, _M_buf + __off);
if (__testout)
this->setp(_M_buf, _M_buf + __off);
}
bool
_M_is_indeterminate(void)
{
bool __ret = false;
if (_M_mode & ios_base::in)
__ret = _M_in_beg == _M_in_cur && _M_in_cur == _M_in_end;
if (_M_mode & ios_base::out)
__ret = _M_out_beg == _M_out_cur && _M_out_cur == _M_out_end;
return __ret;
}
public:
virtual
~basic_streambuf()
{
_M_buf_unified = false;
_M_buf_size = 0;
_M_buf_size_opt = 0;
_M_mode = ios_base::openmode(0);
_M_buf_fctype = __null;
_M_buf_locale_init = false;
}
locale
pubimbue(const locale &__loc)
{
locale __tmp(this->getloc());
this->imbue(__loc);
return __tmp;
}
locale
getloc() const
{
if (_M_buf_locale_init)
return _M_buf_locale;
else
return locale();
}
__streambuf_type*
pubsetbuf(char_type* __s, streamsize __n)
{ return this->setbuf(__s, __n); }
pos_type
pubseekoff(off_type __off, ios_base::seekdir __way,
ios_base::openmode __mode = ios_base::in | ios_base::out)
{ return this->seekoff(__off, __way, __mode); }
pos_type
pubseekpos(pos_type __sp,
ios_base::openmode __mode = ios_base::in | ios_base::out)
{ return this->seekpos(__sp, __mode); }
int
pubsync() { return this->sync(); }
streamsize
in_avail()
{
streamsize __ret;
if (_M_in_cur && _M_in_cur < _M_in_end)
{
if (_M_pback_init)
{
int_type __save_len = _M_pback_end_save - _M_pback_cur_save;
int_type __pback_len = _M_in_cur - _M_pback;
__ret = __save_len - __pback_len;
}
else
__ret = this->egptr() - this->gptr();
}
else
__ret = this->showmanyc();
return __ret;
}
int_type
snextc()
{
int_type __eof = traits_type::eof();
return (this->sbumpc() == __eof ? __eof : this->sgetc());
}
int_type
sbumpc();
int_type
sgetc()
{
int_type __ret;
if (_M_in_cur && _M_in_cur < _M_in_end)
__ret = traits_type::to_int_type(*gptr());
else
__ret = this->underflow();
return __ret;
}
streamsize
sgetn(char_type* __s, streamsize __n)
{ return this->xsgetn(__s, __n); }
int_type
sputbackc(char_type __c);
int_type
sungetc();
int_type
sputc(char_type __c);
streamsize
sputn(const char_type* __s, streamsize __n)
{ return this->xsputn(__s, __n); }
protected:
basic_streambuf()
: _M_buf(__null), _M_buf_size(0),
_M_buf_size_opt(static_cast<int_type>(8192)), _M_buf_unified(false),
_M_in_beg(0), _M_in_cur(0), _M_in_end(0), _M_out_beg(0), _M_out_cur(0),
_M_out_end(0), _M_mode(ios_base::openmode(0)), _M_buf_locale(locale()),
_M_buf_locale_init(false), _M_pback_size(1), _M_pback(__null),
_M_pback_cur_save(__null), _M_pback_end_save(__null), _M_pback_init(false)
{ _M_buf_fctype = &use_facet<__ctype_type>(this->getloc()); }
char_type*
eback() const { return _M_in_beg; }
char_type*
gptr() const { return _M_in_cur; }
char_type*
egptr() const { return _M_in_end; }
void
gbump(int __n) { _M_in_cur += __n; }
void
setg(char_type* __gbeg, char_type* __gnext, char_type* __gend)
{
_M_in_beg = __gbeg;
_M_in_cur = __gnext;
_M_in_end = __gend;
if (!(_M_mode & ios_base::in) && __gbeg && __gnext && __gend)
_M_mode = _M_mode | ios_base::in;
}
char_type*
pbase() const { return _M_out_beg; }
char_type*
pptr() const { return _M_out_cur; }
char_type*
epptr() const { return _M_out_end; }
void
pbump(int __n) { _M_out_cur += __n; }
void
setp(char_type* __pbeg, char_type* __pend)
{
_M_out_beg = _M_out_cur = __pbeg;
_M_out_end = __pend;
if (!(_M_mode & ios_base::out) && __pbeg && __pend)
_M_mode = _M_mode | ios_base::out;
}
virtual void
imbue(const locale& __loc)
{
_M_buf_locale_init = true;
if (_M_buf_locale != __loc)
{
_M_buf_locale = __loc;
_M_buf_fctype = &use_facet<__ctype_type>(_M_buf_locale);
}
}
virtual basic_streambuf<char_type,_Traits>*
setbuf(char_type*, streamsize)
{ return this; }
virtual pos_type
seekoff(off_type, ios_base::seekdir,
ios_base::openmode = ios_base::in | ios_base::out)
{ return pos_type(off_type(-1)); }
virtual pos_type
seekpos(pos_type,
ios_base::openmode = ios_base::in | ios_base::out)
{ return pos_type(off_type(-1)); }
virtual int
sync() { return 0; }
virtual streamsize
showmanyc() { return 0; }
virtual streamsize
xsgetn(char_type* __s, streamsize __n);
virtual int_type
underflow()
{ return traits_type::eof(); }
virtual int_type
uflow()
{
int_type __ret = traits_type::eof();
bool __testeof = this->underflow() == __ret;
bool __testpending = _M_in_cur && _M_in_cur < _M_in_end;
if (!__testeof && __testpending)
{
__ret = traits_type::to_int_type(*_M_in_cur);
++_M_in_cur;
if (_M_buf_unified && _M_mode & ios_base::out)
++_M_out_cur;
}
return __ret;
}
virtual int_type
pbackfail(int_type = traits_type::eof())
{ return traits_type::eof(); }
virtual streamsize
xsputn(const char_type* __s, streamsize __n);
virtual int_type
overflow(int_type = traits_type::eof())
{ return traits_type::eof(); }
# 521 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_streambuf.h" 3
private:
basic_streambuf(const __streambuf_type&);
__streambuf_type&
operator=(const __streambuf_type&);
};
}
# 46 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/sbuf_iter.h" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/sbuf_iter.h" 3
namespace std
{
template<typename _CharT, typename _Traits>
class ostreambuf_iterator
: public output_iterator
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef basic_streambuf<_CharT, _Traits> streambuf_type;
typedef basic_ostream<_CharT, _Traits> ostream_type;
inline
ostreambuf_iterator(ostream_type& __s) throw ()
: _M_sbuf(__s.rdbuf()), _M_failed(false) { }
ostreambuf_iterator(streambuf_type* __s) throw ()
: _M_sbuf(__s), _M_failed(false) { }
ostreambuf_iterator&
operator=(_CharT __c);
ostreambuf_iterator&
operator*() throw()
{ return *this; }
ostreambuf_iterator&
operator++(int) throw()
{ return *this; }
ostreambuf_iterator&
operator++() throw()
{ return *this; }
bool
failed() const throw()
{ return _M_failed; }
private:
streambuf_type* _M_sbuf;
bool _M_failed;
# 96 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/sbuf_iter.h" 3
};
template<typename _CharT, typename _Traits>
inline ostreambuf_iterator<_CharT, _Traits>&
ostreambuf_iterator<_CharT, _Traits>::operator=(_CharT __c)
{
if (!_M_failed &&
_Traits::eq_int_type(_M_sbuf->sputc(__c),_Traits::eof()))
_M_failed = true;
return *this;
}
# 137 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/sbuf_iter.h" 3
template<class _CharT, class _Traits>
class istreambuf_iterator
: public iterator<input_iterator_tag, _CharT, typename _Traits::off_type,
_CharT*, _CharT&>
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef typename _Traits::int_type int_type;
typedef basic_streambuf<_CharT, _Traits> streambuf_type;
typedef basic_istream<_CharT, _Traits> istream_type;
typedef istreambuf_iterator<_CharT, _Traits> __istreambufiter_type;
istreambuf_iterator() throw()
: _M_istreambuf(__null), _M_c(-2) { }
istreambuf_iterator(istream_type& __s) throw()
: _M_istreambuf(__s.rdbuf()), _M_c(-2) { }
istreambuf_iterator(streambuf_type* __s) throw()
: _M_istreambuf(__s), _M_c(-2) { }
char_type
operator*() const
{
char_type __ret;
if (_M_istreambuf && _M_c != static_cast<int_type>(-2))
__ret = _M_c;
else if (_M_istreambuf)
__ret = traits_type::to_char_type(_M_istreambuf->sgetc());
else
__ret = static_cast<char_type>(traits_type::eof());
return __ret;
}
__istreambufiter_type&
operator++()
{
if (_M_istreambuf)
_M_istreambuf->sbumpc();
_M_c = -2;
return *this;
}
const __istreambufiter_type
operator++(int)
{
if (_M_istreambuf)
_M_c = _M_istreambuf->sbumpc();
return *this;
}
bool
equal(const __istreambufiter_type& __b)
{
int_type __eof = traits_type::eof();
bool __thiseof = !_M_istreambuf || _M_istreambuf->sgetc() == __eof;
bool __beof = !__b._M_istreambuf
|| __b._M_istreambuf->sgetc() == __eof;
return (__thiseof && __beof || (!__thiseof && !__beof));
}
bool
equal(const __istreambufiter_type& __b) const
{
int_type __eof = traits_type::eof();
bool __thiseof = !_M_istreambuf || _M_istreambuf->sgetc() == __eof;
bool __beof = !__b._M_istreambuf
|| __b._M_istreambuf->sgetc() == __eof;
return (__thiseof && __beof || (!__thiseof && !__beof));
}
private:
streambuf_type* _M_istreambuf;
int_type _M_c;
};
template<typename _CharT, typename _Traits>
inline bool
operator==(const istreambuf_iterator<_CharT, _Traits>& __a,
const istreambuf_iterator<_CharT, _Traits>& __b)
{ return __a.equal(__b); }
template<typename _CharT, typename _Traits>
inline bool
operator!=(const istreambuf_iterator<_CharT, _Traits>& __a,
const istreambuf_iterator<_CharT, _Traits>& __b)
{ return !__a.equal(__b); }
}
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstddef.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 2 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 3
# 1 "/usr/include/time.h" 1 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 2 3
# 56 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ctime.h" 3
namespace std
{
using ::clock_t;
using ::time_t;
using ::tm;
extern "C" clock_t clock(void);
extern "C" double difftime(time_t, time_t);
extern "C" time_t mktime(struct tm*);
extern "C" time_t time(time_t*);
extern "C" char* asctime(const struct tm*);
extern "C" char* ctime(const time_t*);
extern "C" struct tm* gmtime(const time_t*);
extern "C" struct tm* localtime(const time_t*);
extern "C" size_t strftime(char*, size_t, const char*, const struct tm*);
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 1 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 2 3
namespace std
{
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/ctype_base.h" 1 3
# 50 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/ctype_base.h" 3
struct ctype_base
{
typedef const int* __to_type;
typedef unsigned short mask;
static const mask upper = _ISupper;
static const mask lower = _ISlower;
static const mask alpha = _ISalpha;
static const mask digit = _ISdigit;
static const mask xdigit = _ISxdigit;
static const mask space = _ISspace;
static const mask print = _ISprint;
static const mask graph = _ISgraph;
static const mask cntrl = _IScntrl;
static const mask punct = _ISpunct;
static const mask alnum = _ISalnum;
};
# 54 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 2 3
template<typename _CharT>
class __ctype_abstract_base : public locale::facet, public ctype_base
{
public:
typedef _CharT char_type;
bool
is(mask __m, char_type __c) const
{ return this->do_is(__m, __c); }
const char_type*
is(const char_type *__lo, const char_type *__hi, mask *__vec) const
{ return this->do_is(__lo, __hi, __vec); }
const char_type*
scan_is(mask __m, const char_type* __lo, const char_type* __hi) const
{ return this->do_scan_is(__m, __lo, __hi); }
const char_type*
scan_not(mask __m, const char_type* __lo, const char_type* __hi) const
{ return this->do_scan_not(__m, __lo, __hi); }
char_type
toupper(char_type __c) const
{ return this->do_toupper(__c); }
const char_type*
toupper(char_type *__low, const char_type* __high) const
{ return this->do_toupper(__low, __high); }
char_type
tolower(char_type __c) const
{ return this->do_tolower(__c); }
const char_type*
tolower(char_type* __low, const char_type* __high) const
{ return this->do_tolower(__low, __high); }
char_type
widen(char __c) const
{ return this->do_widen(__c); }
const char*
widen(const char* __low, const char* __high, char_type* __to) const
{ return this->do_widen(__low, __high, __to); }
char
narrow(char_type __c, char __dfault) const
{ return this->do_narrow(__c, __dfault); }
const char_type*
narrow(const char_type* __low, const char_type* __high,
char __dfault, char *__to) const
{ return this->do_narrow(__low, __high, __dfault, __to); }
protected:
explicit
__ctype_abstract_base(size_t __refs = 0): locale::facet(__refs) { }
virtual
~__ctype_abstract_base() { }
virtual bool
do_is(mask __m, char_type __c) const = 0;
virtual const char_type*
do_is(const char_type* __lo, const char_type* __hi,
mask* __vec) const = 0;
virtual const char_type*
do_scan_is(mask __m, const char_type* __lo,
const char_type* __hi) const = 0;
virtual const char_type*
do_scan_not(mask __m, const char_type* __lo,
const char_type* __hi) const = 0;
virtual char_type
do_toupper(char_type) const = 0;
virtual const char_type*
do_toupper(char_type* __low, const char_type* __high) const = 0;
virtual char_type
do_tolower(char_type) const = 0;
virtual const char_type*
do_tolower(char_type* __low, const char_type* __high) const = 0;
virtual char_type
do_widen(char) const = 0;
virtual const char*
do_widen(const char* __low, const char* __high,
char_type* __dest) const = 0;
virtual char
do_narrow(char_type, char __dfault) const = 0;
virtual const char_type*
do_narrow(const char_type* __low, const char_type* __high,
char __dfault, char* __dest) const = 0;
};
template<typename _CharT>
class ctype : public __ctype_abstract_base<_CharT>
{
public:
typedef _CharT char_type;
typedef typename ctype::mask mask;
explicit
ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { }
static locale::id id;
protected:
virtual
~ctype() { }
};
template<typename _CharT>
locale::id ctype<_CharT>::id;
template<>
class ctype<char> : public __ctype_abstract_base<char>
{
public:
typedef char char_type;
private:
bool _M_del;
__to_type const& _M_toupper;
__to_type const& _M_tolower;
const mask* const& _M_ctable;
const mask* _M_table;
public:
static locale::id id;
static const size_t table_size = 1 + static_cast<unsigned char>(-1);
explicit
ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);
inline bool
is(mask __m, char __c) const;
inline const char*
is(const char* __low, const char* __high, mask* __vec) const;
inline const char*
scan_is(mask __m, const char* __low, const char* __high) const;
inline const char*
scan_not(mask __m, const char* __low, const char* __high) const;
protected:
virtual
~ctype();
const mask*
table() const throw()
{ return _M_table; }
const mask*
classic_table() throw()
{ return _M_ctable; }
virtual bool
do_is(mask __m, char_type __c) const;
virtual const char_type*
do_is(const char_type* __lo, const char_type* __hi,
mask* __vec) const;
virtual const char_type*
do_scan_is(mask __m, const char_type* __lo,
const char_type* __hi) const;
virtual const char_type*
do_scan_not(mask __m, const char_type* __lo,
const char_type* __hi) const;
virtual char_type
do_toupper(char_type) const;
virtual const char_type*
do_toupper(char_type* __low, const char_type* __high) const;
virtual char_type
do_tolower(char_type) const;
virtual const char_type*
do_tolower(char_type* __low, const char_type* __high) const;
virtual char_type
do_widen(char) const;
virtual const char*
do_widen(const char* __low, const char* __high,
char_type* __dest) const;
virtual char
do_narrow(char_type, char __dfault) const;
virtual const char_type*
do_narrow(const char_type* __low, const char_type* __high,
char __dfault, char* __dest) const;
};
template<>
const ctype<char>&
use_facet<ctype<char> >(const locale& __loc);
# 348 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/ctype_inline.h" 1 3
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/ctype_inline.h" 3
bool
ctype<char>::
is(mask __m, char __c) const
{ return _M_table[__c] & __m; }
const char*
ctype<char>::
is(const char* __low, const char* __high, mask* __vec) const
{
while (__low < __high)
*__vec++ = _M_table[*__low++];
return __high;
}
const char*
ctype<char>::
scan_is(mask __m, const char* __low, const char* __high) const
{
while (__low < __high && !(_M_table[*__low] & __m))
++__low;
return __low;
}
const char*
ctype<char>::
scan_not(mask __m, const char* __low, const char* __high) const
{
while (__low < __high
&& (_M_table[*__low] & __m) != 0)
++__low;
return __low;
}
# 349 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 2 3
template<typename _CharT>
class ctype_byname : public ctype<_CharT>
{
public:
typedef _CharT char_type;
explicit
ctype_byname(const char*, size_t __refs = 0);
protected:
virtual
~ctype_byname() { }
};
template<>
ctype_byname<char>::ctype_byname(const char*, size_t refs);
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/codecvt.h" 1 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/codecvt.h" 3
# 173 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/codecvt.h" 3
class codecvt_base
{
public:
enum result
{
ok,
partial,
error,
noconv
};
};
template<typename _InternT, typename _ExternT, typename _StateT>
class __codecvt_abstract_base
: public locale::facet, public codecvt_base
{
public:
typedef codecvt_base::result result;
typedef _InternT intern_type;
typedef _ExternT extern_type;
typedef _StateT state_type;
result
out(state_type& __state, const intern_type* __from,
const intern_type* __from_end, const intern_type*& __from_next,
extern_type* __to, extern_type* __to_end,
extern_type*& __to_next) const
{
return this->do_out(__state, __from, __from_end, __from_next,
__to, __to_end, __to_next);
}
result
unshift(state_type& __state, extern_type* __to, extern_type* __to_end,
extern_type*& __to_next) const
{ return this->do_unshift(__state, __to,__to_end,__to_next); }
result
in(state_type& __state, const extern_type* __from,
const extern_type* __from_end, const extern_type*& __from_next,
intern_type* __to, intern_type* __to_end,
intern_type*& __to_next) const
{
return this->do_in(__state, __from, __from_end, __from_next,
__to, __to_end, __to_next);
}
int
encoding() const throw()
{ return this->do_encoding(); }
bool
always_noconv() const throw()
{ return this->do_always_noconv(); }
int
length(const state_type& __state, const extern_type* __from,
const extern_type* __end, size_t __max) const
{ return this->do_length(__state, __from, __end, __max); }
int
max_length() const throw()
{ return this->do_max_length(); }
protected:
explicit
__codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { }
virtual
~__codecvt_abstract_base() { }
virtual result
do_out(state_type& __state, const intern_type* __from,
const intern_type* __from_end, const intern_type*& __from_next,
extern_type* __to, extern_type* __to_end,
extern_type*& __to_next) const = 0;
virtual result
do_unshift(state_type& __state, extern_type* __to,
extern_type* __to_end, extern_type*& __to_next) const = 0;
virtual result
do_in(state_type& __state, const extern_type* __from,
const extern_type* __from_end, const extern_type*& __from_next,
intern_type* __to, intern_type* __to_end,
intern_type*& __to_next) const = 0;
virtual int
do_encoding() const throw() = 0;
virtual bool
do_always_noconv() const throw() = 0;
virtual int
do_length(const state_type&, const extern_type* __from,
const extern_type* __end, size_t __max) const = 0;
virtual int
do_max_length() const throw() = 0;
};
template<typename _InternT, typename _ExternT, typename _StateT>
class codecvt
: public __codecvt_abstract_base<_InternT, _ExternT, _StateT>
{
public:
typedef codecvt_base::result result;
typedef _InternT intern_type;
typedef _ExternT extern_type;
typedef _StateT state_type;
static locale::id id;
explicit
codecvt(size_t __refs = 0)
: __codecvt_abstract_base<_InternT,_ExternT,_StateT> (__refs) { }
protected:
virtual
~codecvt() { }
};
template<typename _InternT, typename _ExternT, typename _StateT>
locale::id codecvt<_InternT, _ExternT, _StateT>::id;
# 594 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/codecvt.h" 3
template<>
class codecvt<char, char, mbstate_t>
: public __codecvt_abstract_base<char, char, mbstate_t>
{
public:
typedef char intern_type;
typedef char extern_type;
typedef mbstate_t state_type;
static locale::id id;
explicit
codecvt(size_t __refs = 0);
protected:
virtual
~codecvt();
virtual result
do_out(state_type& __state, const intern_type* __from,
const intern_type* __from_end, const intern_type*& __from_next,
extern_type* __to, extern_type* __to_end,
extern_type*& __to_next) const;
virtual result
do_unshift(state_type& __state, extern_type* __to,
extern_type* __to_end, extern_type*& __to_next) const;
virtual result
do_in(state_type& __state, const extern_type* __from,
const extern_type* __from_end, const extern_type*& __from_next,
intern_type* __to, intern_type* __to_end,
intern_type*& __to_next) const;
virtual int
do_encoding() const throw();
virtual bool
do_always_noconv() const throw();
virtual int
do_length(const state_type&, const extern_type* __from,
const extern_type* __end, size_t __max) const;
virtual int
do_max_length() const throw();
};
# 700 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/codecvt.h" 3
template<typename _InternT, typename _ExternT, typename _StateT>
class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>
{
public:
explicit
codecvt_byname(const char*, size_t __refs = 0)
: codecvt<_InternT, _ExternT, _StateT>(__refs) { }
protected:
virtual
~codecvt_byname() { }
};
# 372 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 2 3
template<typename _CharT, typename _InIter>
class _Numeric_get;
template<typename _CharT>
class _Format_cache
{
public:
typedef _CharT char_type;
typedef char_traits<_CharT> traits_type;
typedef basic_string<_CharT> string_type;
typedef typename string_type::size_type size_type;
friend class locale;
template<typename _Char, typename _InIter>
friend class _Numeric_get;
friend class num_get<_CharT>;
friend class num_put<_CharT>;
friend class time_get<_CharT>;
friend class money_get<_CharT>;
friend class time_put<_CharT>;
friend class money_put<_CharT>;
static int _S_pword_ix;
bool _M_valid;
static const char _S_literals[];
enum
{
_S_minus,
_S_plus,
_S_x,
_S_X,
_S_digits,
_S_digits_end = _S_digits + 16,
_S_udigits = _S_digits_end,
_S_udigits_end = _S_udigits + 16,
_S_ee = _S_digits + 14,
_S_Ee = _S_udigits + 14
};
char_type _M_decimal_point;
char_type _M_thousands_sep;
string_type _M_truename;
string_type _M_falsename;
bool _M_use_grouping;
string _M_grouping;
_Format_cache();
~_Format_cache() throw() { }
static _Format_cache<_CharT>*
_S_get(ios_base& __ios);
void
_M_populate(ios_base&);
static void
_S_callback(ios_base::event __event, ios_base& __ios, int __ix) throw();
};
template<typename _CharT>
int _Format_cache<_CharT>::_S_pword_ix;
template<typename _CharT>
const char _Format_cache<_CharT>::
_S_literals[] = "-+xX0123456789abcdef0123456789ABCDEF";
template<> _Format_cache<char>::_Format_cache();
template<typename _CharT, typename _InIter>
class _Numeric_get
{
public:
typedef _CharT char_type;
typedef _InIter iter_type;
template<typename _Char, typename _InIterT>
friend class num_get;
template<typename _Char, typename _InIterT>
friend class time_get;
template<typename _Char, typename _InIterT>
friend class money_get;
template<typename _Char, typename _InIterT>
friend class num_put;
template<typename _Char, typename _InIterT>
friend class time_put;
template<typename _Char, typename _InIterT>
friend class money_put;
private:
explicit
_Numeric_get() { }
virtual
~_Numeric_get() { }
iter_type
_M_get_digits(iter_type __in, iter_type __end) const;
};
template<typename _CharT, typename _InIter>
class num_get : public locale::facet
{
public:
typedef _CharT char_type;
typedef _InIter iter_type;
typedef char_traits<_CharT> __traits_type;
static locale::id id;
explicit
num_get(size_t __refs = 0) : locale::facet(__refs) { }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, bool& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, short& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, int& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, long& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
# 563 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, unsigned short& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, unsigned int& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, unsigned long& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
# 585 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, float& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, double& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, long double& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
iter_type
get(iter_type __in, iter_type __end, ios_base& __io,
ios_base::iostate& __err, void*& __v) const
{ return do_get(__in, __end, __io, __err, __v); }
protected:
virtual ~num_get() { }
void
_M_extract(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, char* __xtrc,
int& __base, bool __fp = true) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, short&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, int&) const;
virtual iter_type
do_get (iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
unsigned short&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&,
ios_base::iostate& __err, unsigned int&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&,
ios_base::iostate& __err, unsigned long&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
float&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
double&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&,
ios_base::iostate& __err, long double&) const;
virtual iter_type
do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
void*&) const;
};
template<typename _CharT, typename _InIter>
locale::id num_get<_CharT, _InIter>::id;
template<>
void
num_get<char, istreambuf_iterator<char> >::
_M_extract(istreambuf_iterator<char> __beg,
istreambuf_iterator<char> __end, ios_base& __io,
ios_base::iostate& __err, char* __xtrc,
int& __base, bool __fp) const;
template<typename _CharT, typename _OutIter>
class _Numeric_put
{
public:
typedef _CharT char_type;
typedef _OutIter iter_type;
protected:
explicit
_Numeric_put() { }
virtual
~_Numeric_put() { }
};
template<typename _CharT, typename _OutIter>
class num_put : public locale::facet
{
public:
typedef _CharT char_type;
typedef _OutIter iter_type;
static locale::id id;
explicit
num_put(size_t __refs = 0) : locale::facet(__refs) { }
iter_type
put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const
{ return do_put(__s, __f, __fill, __v); }
iter_type
put(iter_type __s, ios_base& __f, char_type __fill, long __v) const
{ return do_put(__s, __f, __fill, __v); }
iter_type
put(iter_type __s, ios_base& __f, char_type __fill,
unsigned long __v) const
{ return do_put(__s, __f, __fill, __v); }
# 729 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
iter_type
put(iter_type __s, ios_base& __f, char_type __fill, double __v) const
{ return do_put(__s, __f, __fill, __v); }
iter_type
put(iter_type __s, ios_base& __f, char_type __fill,
long double __v) const
{ return do_put(__s, __f, __fill, __v); }
iter_type
put(iter_type __s, ios_base& __f, char_type __fill,
const void* __v) const
{ return do_put(__s, __f, __fill, __v); }
protected:
virtual
~num_put() { };
virtual iter_type
do_put(iter_type, ios_base&, char_type __fill, bool __v) const;
virtual iter_type
do_put(iter_type, ios_base&, char_type __fill, long __v) const;
virtual iter_type
do_put(iter_type, ios_base&, char_type __fill, unsigned long) const;
virtual iter_type
do_put(iter_type, ios_base&, char_type __fill, double __v) const;
virtual iter_type
do_put(iter_type, ios_base&, char_type __fill, long double __v) const;
virtual iter_type
do_put(iter_type, ios_base&, char_type __fill, const void* __v) const;
};
template <typename _CharT, typename _OutIter>
locale::id num_put<_CharT, _OutIter>::id;
template<typename _CharT>
class numpunct : public locale::facet
{
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
static locale::id id;
private:
char_type _M_decimal_point;
char_type _M_thousands_sep;
string _M_grouping;
string_type _M_truename;
string_type _M_falsename;
public:
explicit
numpunct(size_t __refs = 0) : locale::facet(__refs)
{ _M_initialize_numpunct(); }
explicit
numpunct(__c_locale __cloc, size_t __refs = 0) : locale::facet(__refs)
{ _M_initialize_numpunct(__cloc); }
char_type
decimal_point() const
{ return do_decimal_point(); }
char_type
thousands_sep() const
{ return do_thousands_sep(); }
string
grouping() const
{ return do_grouping(); }
string_type
truename() const
{ return do_truename(); }
string_type
falsename() const
{ return do_falsename(); }
protected:
virtual
~numpunct() { }
virtual char_type
do_decimal_point() const
{ return _M_decimal_point; }
virtual char_type
do_thousands_sep() const
{ return _M_thousands_sep; }
virtual string
do_grouping() const
{ return _M_grouping; }
virtual string_type
do_truename() const
{ return _M_truename; }
virtual string_type
do_falsename() const
{ return _M_falsename; }
void
_M_initialize_numpunct(__c_locale __cloc = __null);
};
template<typename _CharT>
locale::id numpunct<_CharT>::id;
template<typename _CharT>
void
numpunct<_CharT>::_M_initialize_numpunct(__c_locale )
{
}
template<>
void
numpunct<char>::_M_initialize_numpunct(__c_locale __cloc);
template<typename _CharT>
class numpunct_byname : public numpunct<_CharT>
{
__c_locale _M_c_locale_numpunct;
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
explicit
numpunct_byname(const char* __s, size_t __refs = 0)
: numpunct<_CharT>(__refs)
{
_S_create_c_locale(_M_c_locale_numpunct, __s);
_M_initialize_numpunct(_M_c_locale_numpunct);
}
protected:
virtual
~numpunct_byname()
{ _S_destroy_c_locale(_M_c_locale_numpunct); }
};
template<typename _CharT>
class collate : public locale::facet
{
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
static locale::id id;
explicit
collate(size_t __refs = 0) : locale::facet(__refs) { }
int
compare(const _CharT* __lo1, const _CharT* __hi1,
const _CharT* __lo2, const _CharT* __hi2) const
{ return this->do_compare(__lo1, __hi1, __lo2, __hi2); }
string_type
transform(const _CharT* __lo, const _CharT* __hi) const
{ return this->do_transform(__lo, __hi); }
long
hash(const _CharT* __lo, const _CharT* __hi) const
{ return this->do_hash(__lo, __hi); }
protected:
~collate() { }
virtual int
do_compare(const _CharT* __lo1, const _CharT* __hi1,
const _CharT* __lo2, const _CharT* __hi2) const;
virtual string_type
do_transform(const _CharT* __lo, const _CharT* __hi) const;
virtual long
do_hash(const _CharT* __lo, const _CharT* __hi) const;
};
template<typename _CharT>
locale::id collate<_CharT>::id;
template<>
int
collate<char>::do_compare(const char* __lo1, const char* __hi1,
const char* __lo2, const char* __hi2) const;
template<>
string
collate<char>::do_transform(const char* __lo, const char* __hi) const;
template<>
long
collate<char>::do_hash(const char* __lo, const char* __hi) const;
# 970 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
template<typename _CharT>
class collate_byname : public collate<_CharT>
{
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
explicit
collate_byname(const char*, size_t __refs = 0);
protected:
virtual
~collate_byname() { }
};
template<>
collate_byname<char>::collate_byname(const char*, size_t __refs);
class time_base
{
public:
enum dateorder { no_order, dmy, mdy, ymd, ydm };
};
template<typename _CharT, typename _InIter>
class time_get : public locale::facet, public time_base
{
public:
typedef _CharT char_type;
typedef _InIter iter_type;
static locale::id id;
explicit
time_get(size_t __refs = 0)
: locale::facet (__refs), _M_daynames(0), _M_monthnames(0) { }
dateorder
date_order() const
{ return do_date_order(); }
iter_type
get_time(iter_type __s, iter_type __end, ios_base& __f,
ios_base::iostate& __err, tm* __t) const
{ return do_get_time(__s, __end, __f, __err, __t); }
iter_type
get_date(iter_type __s, iter_type __end, ios_base& __f,
ios_base::iostate& __err, tm* __t) const
{ return do_get_date(__s, __end, __f, __err, __t); }
iter_type
get_weekday(iter_type __s, iter_type __end, ios_base& __f,
ios_base::iostate& __err, tm* __t) const
{ return do_get_weekday(__s,__end,__f,__err,__t); }
iter_type
get_monthname(iter_type __s, iter_type __end, ios_base& __f,
ios_base::iostate& __err, tm* __t) const
{ return do_get_monthname(__s,__end,__f,__err,__t); }
iter_type
get_year(iter_type __s, iter_type __end, ios_base& __f,
ios_base::iostate& __err, tm* __t) const
{ return do_get_year(__s,__end,__f,__err,__t); }
protected:
virtual
~time_get()
{
delete [] _M_monthnames;
delete [] _M_daynames;
}
virtual dateorder
do_date_order() const
{ return time_base::ymd; }
virtual iter_type
do_get_time(iter_type __s, iter_type , ios_base&,
ios_base::iostate& , tm* ) const
{ return __s; }
virtual iter_type
do_get_date(iter_type __s, iter_type , ios_base&,
ios_base::iostate& , tm* ) const
{ return __s; }
virtual iter_type
do_get_weekday(iter_type __s, iter_type __end, ios_base&,
ios_base::iostate& __err, tm* __t) const;
virtual iter_type
do_get_monthname(iter_type __s, iter_type __end, ios_base&,
ios_base::iostate& __err, tm* __t) const;
virtual iter_type
do_get_year(iter_type __s, iter_type , ios_base&,
ios_base::iostate& , tm* ) const
{ return __s; }
mutable basic_string<_CharT>* _M_daynames;
mutable basic_string<_CharT>* _M_monthnames;
};
template<typename _CharT, typename _InIter>
locale::id time_get<_CharT, _InIter>::id;
template<typename _CharT, typename _InIter>
class time_get_byname : public time_get<_CharT, _InIter>
{
public:
typedef _CharT char_type;
typedef _InIter iter_type;
explicit
time_get_byname(const char*, size_t __refs = 0)
: time_get<_CharT, _InIter>(__refs) { }
protected:
virtual
~time_get_byname() { }
};
template<typename _CharT, typename _OutIter>
class time_put : public locale::facet, public time_base
{
public:
typedef _CharT char_type;
typedef _OutIter iter_type;
static locale::id id;
explicit
time_put(size_t __refs = 0) : locale::facet (__refs) { }
iter_type
put(iter_type __s, ios_base& , char_type ,
const tm* , const _CharT* ,
const _CharT* ) const
{ return __s; }
iter_type
put(iter_type __s, ios_base& __f, char_type __fill,
const tm* __tmb, char __format, char __modifier = 0) const
{ return do_put(__s, __f, __fill, __tmb, __format, __modifier); }
protected:
virtual
~time_put() { }
virtual iter_type
do_put(iter_type __s, ios_base&, char_type, const tm* ,
char , char ) const
{ return __s; }
};
template<typename _CharT, typename _OutIter>
locale::id time_put<_CharT, _OutIter>::id;
template<typename _CharT, typename _OutIter>
class time_put_byname : public time_put<_CharT, _OutIter>
{
public:
typedef _CharT char_type;
typedef _OutIter iter_type;
explicit
time_put_byname(const char*, size_t __refs = 0)
: time_put<_CharT, _OutIter> (__refs) { }
protected:
virtual
~time_put_byname() { }
};
template<typename _CharT, typename _InIter>
class money_get : public locale::facet
{
public:
typedef _CharT char_type;
typedef _InIter iter_type;
typedef basic_string<_CharT> string_type;
static locale::id id;
explicit
money_get(size_t __refs = 0) : locale::facet(__refs) { }
iter_type
get(iter_type __s, iter_type __end, bool __intl,
ios_base& __f, ios_base::iostate& __err, long double& __units) const
{ return do_get(__s, __end, __intl, __f, __err, __units); }
iter_type
get(iter_type __s, iter_type __end, bool __intl, ios_base& __f,
ios_base::iostate& __err, string_type& __digits) const
{ return do_get(__s, __end, __intl, __f, __err, __digits); }
protected:
virtual
~money_get() { }
virtual iter_type
do_get(iter_type __s, iter_type , bool ,
ios_base& , ios_base::iostate& ,
long double& ) const
{ return __s; }
virtual iter_type
do_get(iter_type __s, iter_type , bool ,
ios_base& , ios_base::iostate& ,
string_type& ) const
{ return __s; }
};
template<typename _CharT, typename _InIter>
locale::id money_get<_CharT, _InIter>::id;
template<typename _CharT, typename _OutIter>
class money_put : public locale::facet
{
public:
typedef _CharT char_type;
typedef _OutIter iter_type;
typedef basic_string<_CharT> string_type;
static locale::id id;
explicit
money_put(size_t __refs = 0) : locale::facet(__refs) { }
iter_type
put(iter_type __s, bool __intl, ios_base& __f,
char_type __fill, long double __units) const
{ return do_put(__s, __intl, __f, __fill, __units); }
iter_type
put(iter_type __s, bool __intl, ios_base& __f,
char_type __fill, const string_type& __digits) const
{ return do_put(__s, __intl, __f, __fill, __digits); }
protected:
virtual
~money_put() { }
virtual iter_type
do_put(iter_type __s, bool, ios_base& , char_type ,
long double ) const
{ return __s; }
virtual iter_type
do_put(iter_type __s, bool, ios_base& , char_type ,
const string_type& ) const
{ return __s; }
};
template<typename _CharT, typename _OutIter>
locale::id money_put<_CharT, _OutIter>::id;
struct money_base
{
enum part { none, space, symbol, sign, value };
struct pattern { char field[4]; };
static const pattern _S_default_pattern;
static pattern
_S_construct_pattern(char __preceeds, char __space, char __posn);
};
template<typename _CharT, bool _Intl>
class moneypunct : public locale::facet, public money_base
{
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
static const bool intl = _Intl;
static locale::id id;
private:
char_type _M_decimal_point;
char_type _M_thousands_sep;
string _M_grouping;
string_type _M_curr_symbol;
string_type _M_positive_sign;
string_type _M_negative_sign;
int _M_frac_digits;
pattern _M_pos_format;
pattern _M_neg_format;
public:
explicit
moneypunct(size_t __refs = 0) : locale::facet(__refs)
{ _M_initialize_moneypunct(); }
explicit
moneypunct(__c_locale __cloc, size_t __refs = 0) : locale::facet(__refs)
{ _M_initialize_moneypunct(__cloc); }
char_type
decimal_point() const
{ return this->do_decimal_point(); }
char_type
thousands_sep() const
{ return this->do_thousands_sep(); }
string
grouping() const
{ return this->do_grouping(); }
string_type
curr_symbol() const
{ return this->do_curr_symbol(); }
string_type
positive_sign() const
{ return this->do_positive_sign(); }
string_type
negative_sign() const
{ return this->do_negative_sign(); }
int
frac_digits() const
{ return this->do_frac_digits(); }
pattern
pos_format() const
{ return this->do_pos_format(); }
pattern
neg_format() const
{ return this->do_neg_format(); }
protected:
virtual
~moneypunct() { }
virtual char_type
do_decimal_point() const
{ return _M_decimal_point; }
virtual char_type
do_thousands_sep() const
{ return _M_thousands_sep; }
virtual string
do_grouping() const
{ return _M_grouping; }
virtual string_type
do_curr_symbol() const
{ return _M_curr_symbol; }
virtual string_type
do_positive_sign() const
{ return _M_positive_sign; }
virtual string_type
do_negative_sign() const
{ return _M_negative_sign; }
virtual int
do_frac_digits() const
{ return _M_frac_digits; }
virtual pattern
do_pos_format() const
{ return _M_pos_format; }
virtual pattern
do_neg_format() const
{ return _M_neg_format; }
void
_M_initialize_moneypunct(__c_locale __cloc = __null);
};
template<typename _CharT, bool _Intl>
locale::id moneypunct<_CharT, _Intl>::id;
template<typename _CharT, bool _Intl>
const bool moneypunct<_CharT, _Intl>::intl;
template<typename _CharT, bool _Intl>
void
moneypunct<_CharT, _Intl>::_M_initialize_moneypunct(__c_locale )
{
}
template<>
void
moneypunct<char>::_M_initialize_moneypunct(__c_locale __cloc);
template<typename _CharT, bool _Intl>
class moneypunct_byname : public moneypunct<_CharT, _Intl>
{
__c_locale _M_c_locale_moneypunct;
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
static const bool intl = _Intl;
explicit
moneypunct_byname(const char* __s, size_t __refs = 0)
: moneypunct<_CharT, _Intl>(__refs)
{
_S_create_c_locale(_M_c_locale_moneypunct, __s);
_M_initialize_moneypunct(_M_c_locale_moneypunct);
}
protected:
virtual
~moneypunct_byname()
{ _S_destroy_c_locale(_M_c_locale_moneypunct); }
};
template<typename _CharT, bool _Intl>
const bool moneypunct_byname<_CharT, _Intl>::intl;
struct messages_base
{
typedef int catalog;
};
template<typename _CharT>
class messages : public locale::facet, public messages_base
{
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
static locale::id id;
explicit
messages(size_t __refs = 0) : locale::facet(__refs) { }
catalog
open(const basic_string<char>& __s, const locale& __loc) const
{ return do_open(__s, __loc); }
string_type
get(catalog __c, int __set, int __msgid, const string_type& __s) const
{ return do_get(__c,__set,__msgid,__s); }
void
close(catalog __c) const
{ return do_close(__c); }
protected:
virtual
~messages() { }
virtual catalog
do_open(const basic_string<char>&, const locale&) const
{ return 0; }
virtual string_type
do_get(catalog, int, int , const string_type& __dfault) const
{ return __dfault; }
virtual void
do_close(catalog) const { }
};
template<typename _CharT>
locale::id messages<_CharT>::id;
template<typename _CharT>
class messages_byname : public messages<_CharT>
{
public:
typedef _CharT char_type;
typedef basic_string<_CharT> string_type;
explicit
messages_byname(const char*, size_t __refs = 0);
protected:
virtual
~messages_byname() { }
};
template<>
messages_byname<char>::messages_byname(const char*, size_t __refs);
# 1488 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 3
template<typename _CharT>
inline bool
isspace(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::space, __c); }
template<typename _CharT>
inline bool
isprint(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::print, __c); }
template<typename _CharT>
inline bool
iscntrl(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::cntrl, __c); }
template<typename _CharT>
inline bool
isupper(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::upper, __c); }
template<typename _CharT>
inline bool islower(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::lower, __c); }
template<typename _CharT>
inline bool
isalpha(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alpha, __c); }
template<typename _CharT>
inline bool
isdigit(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::digit, __c); }
template<typename _CharT>
inline bool
ispunct(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::punct, __c); }
template<typename _CharT>
inline bool
isxdigit(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::xdigit, __c); }
template<typename _CharT>
inline bool
isalnum(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alnum, __c); }
template<typename _CharT>
inline bool
isgraph(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).is(ctype_base::graph, __c); }
template<typename _CharT>
inline _CharT
toupper(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).toupper(__c); }
template<typename _CharT>
inline _CharT
tolower(_CharT __c, const locale& __loc)
{ return use_facet<ctype<_CharT> >(__loc).tolower(__c); }
}
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.h" 2 3
namespace std {
template<typename _CharT, typename _Traits>
class basic_ios : public ios_base
{
public:
typedef _CharT char_type;
typedef typename _Traits::int_type int_type;
typedef typename _Traits::pos_type pos_type;
typedef typename _Traits::off_type off_type;
typedef _Traits traits_type;
typedef ctype<_CharT> __ctype_type;
typedef ostreambuf_iterator<_CharT> __ostreambuf_iter;
typedef num_put<_CharT, __ostreambuf_iter> __numput_type;
typedef istreambuf_iterator<_CharT> __istreambuf_iter;
typedef num_get<_CharT, __istreambuf_iter> __numget_type;
private:
basic_ostream<_CharT, _Traits>* _M_tie;
char_type _M_fill;
iostate _M_exception;
protected:
basic_streambuf<_CharT, _Traits>* _M_streambuf;
iostate _M_streambuf_state;
const __ctype_type* _M_ios_fctype;
const __numput_type* _M_fnumput;
const __numget_type* _M_fnumget;
public:
inline const __ctype_type*
_M_get_fctype_ios(void)
{ return _M_ios_fctype; }
inline const __numget_type*
_M_get_fnumget(void)
{ return _M_fnumget; }
inline const __numput_type*
_M_get_fnumput(void)
{ return _M_fnumput; }
operator void*() const
{ return this->fail() ? 0 : const_cast<basic_ios*>(this); }
inline bool
operator!() const
{ return this->fail(); }
inline iostate
rdstate() const
{ return _M_streambuf_state; }
inline void
clear(iostate __state = goodbit)
{
if (this->rdbuf())
_M_streambuf_state = __state;
else
_M_streambuf_state = __state | badbit;
if ((this->rdstate() & this->exceptions()))
__throw_ios_failure("basic_ios::clear(iostate) caused exception");
}
inline void
setstate(iostate __state)
{ this->clear(this->rdstate() | __state); }
inline bool
good() const
{ return this->rdstate() == 0; }
inline bool
eof() const
{ return (this->rdstate() & eofbit) != 0; }
inline bool
fail() const
{ return (this->rdstate() & (badbit | failbit)) != 0; }
inline bool
bad() const
{ return (this->rdstate() & badbit) != 0; }
inline iostate
exceptions() const
{ return _M_exception; }
inline void
exceptions(iostate __except)
{
_M_exception = __except;
this->clear(_M_streambuf_state);
}
explicit
basic_ios(basic_streambuf<_CharT, _Traits>* __sb) : ios_base()
{ this->init(__sb); }
virtual
~basic_ios() { }
inline basic_ostream<_CharT, _Traits>*
tie() const
{ return _M_tie; }
inline basic_ostream<_CharT, _Traits>*
tie(basic_ostream<_CharT, _Traits>* __tiestr)
{
basic_ostream<_CharT, _Traits>* __old = _M_tie;
_M_tie = __tiestr;
return __old;
}
inline basic_streambuf<_CharT, _Traits>*
rdbuf() const
{ return _M_streambuf; }
basic_streambuf<_CharT, _Traits>*
rdbuf(basic_streambuf<_CharT, _Traits>* __sb);
basic_ios&
copyfmt(const basic_ios& __rhs);
inline char_type
fill() const
{ return _M_fill; }
inline char_type
fill(char_type __ch)
{
char_type __old = _M_fill;
_M_fill = __ch;
return __old;
}
locale
imbue(const locale& __loc);
char
narrow(char_type __c, char __dfault) const;
char_type
widen(char __c) const;
protected:
basic_ios() : ios_base()
{ }
void
init(basic_streambuf<_CharT, _Traits>* __sb);
};
}
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.tcc" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.tcc" 3
namespace std {
template<typename _CharT, typename _Traits>
basic_streambuf<_CharT, _Traits>*
basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb)
{
basic_streambuf<_CharT, _Traits>* __old = _M_streambuf;
_M_streambuf = __sb;
this->clear();
return __old;
}
template<typename _CharT, typename _Traits>
basic_ios<_CharT, _Traits>&
basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs)
{
_Words* __words = (__rhs._M_word_limit <= _S_local_words) ?
_M_word_array : new _Words[__rhs._M_word_limit];
# 63 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.tcc" 3
_Callback_list* __cb = __rhs._M_callbacks;
if (__cb)
__cb->_M_add_reference();
_M_call_callbacks(erase_event);
if (_M_words != _M_word_array)
delete [] _M_words;
_M_dispose_callbacks();
_M_callbacks = __cb;
for (int __i = 0; __i < __rhs._M_word_limit; ++__i)
__words[__i] = __rhs._M_words[__i];
if (_M_words != _M_word_array)
delete [] _M_words;
_M_words = __words;
_M_word_limit = __rhs._M_word_limit;
this->flags(__rhs.flags());
this->width(__rhs.width());
this->precision(__rhs.precision());
this->tie(__rhs.tie());
this->fill(__rhs.fill());
this->exceptions(__rhs.exceptions());
_M_call_callbacks(copyfmt_event);
return *this;
}
template<typename _CharT, typename _Traits>
char
basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const
{ return _M_ios_fctype->narrow(__c, __dfault); }
template<typename _CharT, typename _Traits>
_CharT
basic_ios<_CharT, _Traits>::widen(char __c) const
{ return _M_ios_fctype->widen(__c); }
template<typename _CharT, typename _Traits>
locale
basic_ios<_CharT, _Traits>::imbue(const locale& __loc)
{
locale __old(this->getloc());
ios_base::imbue(__loc);
_M_ios_fctype = &use_facet<__ctype_type>(__loc);
_M_fnumput = &use_facet<__numput_type>(__loc);
_M_fnumget = &use_facet<__numget_type>(__loc);
if (this->rdbuf() != 0)
this->rdbuf()->pubimbue(__loc);
return __old;
}
template<typename _CharT, typename _Traits>
void
basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb)
{
ios_base::_M_init();
_M_ios_fctype = &use_facet<__ctype_type>(_M_ios_locale);
_M_fnumput = &use_facet<__numput_type>(_M_ios_locale);
_M_fnumget = &use_facet<__numget_type>(_M_ios_locale);
_M_tie = 0;
_M_fill = this->widen(' ');
_M_exception = goodbit;
_M_streambuf = __sb;
_M_streambuf_state = __sb ? goodbit : badbit;
}
}
# 212 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_ios.h" 2 3
# 47 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 2 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ostream.h" 2 3
namespace std {
template<typename _CharT, typename _Traits>
class basic_ostream : virtual public basic_ios<_CharT, _Traits>
{
public:
typedef _CharT char_type;
typedef typename _Traits::int_type int_type;
typedef typename _Traits::pos_type pos_type;
typedef typename _Traits::off_type off_type;
typedef _Traits traits_type;
typedef basic_streambuf<_CharT, _Traits> __streambuf_type;
typedef basic_ios<_CharT, _Traits> __ios_type;
typedef basic_ostream<_CharT, _Traits> __ostream_type;
typedef ostreambuf_iterator<_CharT> __ostreambuf_iter;
typedef num_put<_CharT, __ostreambuf_iter> __numput_type;
typedef ctype<_CharT> __ctype_type;
explicit
basic_ostream(__streambuf_type* __sb)
{ this->init(__sb); }
virtual
~basic_ostream()
{ _M_fnumput = __null; }
class sentry;
friend class sentry;
__ostream_type&
operator<<(__ostream_type& (*__pf)(__ostream_type&));
__ostream_type&
operator<<(__ios_type& (*__pf)(__ios_type&));
__ostream_type&
operator<<(ios_base& (*__pf) (ios_base&));
__ostream_type&
operator<<(long __n);
__ostream_type&
operator<<(unsigned long __n);
__ostream_type&
operator<<(bool __n);
__ostream_type&
operator<<(short __n)
{
ios_base::fmtflags __fmt = this->flags() & ios_base::basefield;
if (__fmt & ios_base::oct || __fmt & ios_base::hex)
return this->operator<<(static_cast<unsigned long>
(static_cast<unsigned short>(__n)));
else
return this->operator<<(static_cast<long>(__n));
}
__ostream_type&
operator<<(unsigned short __n)
{ return this->operator<<(static_cast<unsigned long>(__n)); }
__ostream_type&
operator<<(int __n)
{
ios_base::fmtflags __fmt = this->flags() & ios_base::basefield;
if (__fmt & ios_base::oct || __fmt & ios_base::hex)
return this->operator<<(static_cast<unsigned long>
(static_cast<unsigned int>(__n)));
else
return this->operator<<(static_cast<long>(__n));
}
__ostream_type&
operator<<(unsigned int __n)
{ return this->operator<<(static_cast<unsigned long>(__n)); }
# 136 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ostream.h" 3
__ostream_type&
operator<<(double __f);
__ostream_type&
operator<<(float __f)
{ return this->operator<<(static_cast<double>(__f)); }
__ostream_type&
operator<<(long double __f);
__ostream_type&
operator<<(const void* __p);
__ostream_type&
operator<<(__streambuf_type* __sb);
__ostream_type&
put(char_type __c);
__ostream_type&
write(const char_type* __s, streamsize __n);
__ostream_type&
flush();
pos_type
tellp();
__ostream_type&
seekp(pos_type);
__ostream_type&
seekp(off_type, ios_base::seekdir);
private:
__ostream_type&
operator=(const __ostream_type&);
basic_ostream(const __ostream_type&);
};
template <typename _CharT, typename _Traits>
class basic_ostream<_CharT, _Traits>::sentry
{
bool _M_ok;
basic_ostream<_CharT,_Traits>& _M_os;
public:
explicit
sentry(basic_ostream<_CharT,_Traits>& __os);
~sentry()
{
if (_M_os.flags() & ios_base::unitbuf && !uncaught_exception())
{
if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1)
_M_os.setstate(ios_base::badbit);
}
}
operator bool()
{ return _M_ok; }
};
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c);
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __out, char __c)
{ return (__out << __out.widen(__c)); }
template <class _Traits>
basic_ostream<char, _Traits>&
operator<<(basic_ostream<char, _Traits>& __out, char __c);
template<class _Traits>
basic_ostream<char, _Traits>&
operator<<(basic_ostream<char, _Traits>& __out, signed char __c)
{ return (__out << static_cast<char>(__c)); }
template<class _Traits>
basic_ostream<char, _Traits>&
operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c)
{ return (__out << static_cast<char>(__c)); }
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s);
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits> &
operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s);
template<class _Traits>
basic_ostream<char, _Traits>&
operator<<(basic_ostream<char, _Traits>& __out, const char* __s);
template<class _Traits>
basic_ostream<char, _Traits>&
operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s)
{ return (__out << reinterpret_cast<const char*>(__s)); }
template<class _Traits>
basic_ostream<char, _Traits> &
operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s)
{ return (__out << reinterpret_cast<const char*>(__s)); }
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>&
endl(basic_ostream<_CharT, _Traits>& __os)
{ return flush(__os.put(__os.widen('\n'))); }
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>&
ends(basic_ostream<_CharT, _Traits>& __os)
{ return __os.put(_CharT()); }
template<typename _CharT, typename _Traits>
basic_ostream<_CharT, _Traits>&
flush(basic_ostream<_CharT, _Traits>& __os)
{ return __os.flush(); }
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iostream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/std_limits.h" 1 3
# 45 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/std_limits.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 46 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/std_limits.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cfloat.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cfloat.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/float.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cfloat.h" 2 3
# 47 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/std_limits.h" 2 3
namespace std {
enum float_round_style {
round_indeterminate = -1,
round_toward_zero = 0,
round_to_nearest = 1,
round_toward_infinity = 2,
round_toward_neg_infinity = 3
};
enum float_denorm_style {
denorm_indeterminate = -1,
denorm_absent = 0,
denorm_present = 1
};
template<typename _Tp> struct numeric_limits {
static const bool is_specialized = false;
static _Tp min() throw() { return static_cast<_Tp>(0); }
static _Tp max() throw() { return static_cast<_Tp>(0); }
static const int digits = 0;
static const int digits10 = 0;
static const bool is_signed = false;
static const bool is_integer = false;
static const bool is_exact = false;
static const int radix = 0;
static _Tp epsilon() throw() { return static_cast<_Tp>(0); }
static _Tp round_error() throw() { return static_cast<_Tp>(0); }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static _Tp infinity() throw() { return static_cast<_Tp>(0); }
static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); }
static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); }
static _Tp denorm_min() throw() { return static_cast<_Tp>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = false;
static const bool is_modulo = false;
static const bool traps = false;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<typename _Tp> _Tp __limits_infinity();
template<typename _Tp> _Tp __limits_quiet_NaN();
template<typename _Tp> _Tp __limits_signaling_NaN();
template<typename _Tp> _Tp __limits_denorm_min();
template<> struct numeric_limits<bool> {
static const bool is_specialized = true;
static bool min() throw()
{ return false; }
static bool max() throw()
{ return true; }
static const int digits = 8;
static const int digits10 = 2;
static const bool is_signed = false;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static bool epsilon() throw()
{ return 0; }
static bool round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static bool infinity() throw()
{ return static_cast<bool>(0); }
static bool quiet_NaN() throw()
{ return static_cast<bool>(0); }
static bool signaling_NaN() throw()
{ return static_cast<bool>(0); }
static bool denorm_min() throw()
{ return static_cast<bool>(0); }
static const bool is_iec559 = true;
static const bool is_bounded = true;
static const bool is_modulo = true;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<char> {
static const bool is_specialized = true;
static char min() throw()
{ return (-128); }
static char max() throw()
{ return 127; }
static const int digits = 7;
static const int digits10 = 2;
static const bool is_signed = true;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static char epsilon() throw()
{ return 0; }
static char round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static char infinity() throw()
{ return static_cast<char>(0); }
static char quiet_NaN() throw()
{ return static_cast<char>(0); }
static char signaling_NaN() throw()
{ return static_cast<char>(0); }
static char denorm_min() throw()
{ return static_cast<char>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<signed char> {
static const bool is_specialized = true;
static signed char min() throw()
{ return (-128); }
static signed char max() throw()
{ return 127; }
static const int digits = 7;
static const int digits10 = 2;
static const bool is_signed = true;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static signed char epsilon() throw()
{ return 0; }
static signed char round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static signed char infinity() throw()
{ return static_cast<signed char>(0); }
static signed char quiet_NaN() throw()
{ return static_cast<signed char>(0); }
static signed char signaling_NaN() throw()
{ return static_cast<signed char>(0); }
static signed char denorm_min() throw()
{ return static_cast<signed char>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<unsigned char> {
static const bool is_specialized = true;
static unsigned char min() throw()
{ return 0; }
static unsigned char max() throw()
{ return 255; }
static const int digits = 8;
static const int digits10 = 2;
static const bool is_signed = false;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static unsigned char epsilon() throw()
{ return 0; }
static unsigned char round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static unsigned char infinity() throw()
{ return static_cast<unsigned char>(0); }
static unsigned char quiet_NaN() throw()
{ return static_cast<unsigned char>(0); }
static unsigned char signaling_NaN() throw()
{ return static_cast<unsigned char>(0); }
static unsigned char denorm_min() throw()
{ return static_cast<unsigned char>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = true;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<short> {
static const bool is_specialized = true;
static short min() throw()
{ return (-32767-1); }
static short max() throw()
{ return 32767; }
static const int digits = 15;
static const int digits10 = 4;
static const bool is_signed = true;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static short epsilon() throw()
{ return 0; }
static short round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static short infinity() throw()
{ return static_cast<short>(0); }
static short quiet_NaN() throw()
{ return static_cast<short>(0); }
static short signaling_NaN() throw()
{ return static_cast<short>(0); }
static short denorm_min() throw()
{ return static_cast<short>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<unsigned short> {
static const bool is_specialized = true;
static unsigned short min() throw()
{ return 0; }
static unsigned short max() throw()
{ return 65535; }
static const int digits = 16;
static const int digits10 = 4;
static const bool is_signed = false;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static unsigned short epsilon() throw()
{ return 0; }
static unsigned short round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static unsigned short infinity() throw()
{ return static_cast<unsigned short>(0); }
static unsigned short quiet_NaN() throw()
{ return static_cast<unsigned short>(0); }
static unsigned short signaling_NaN() throw()
{ return static_cast<unsigned short>(0); }
static unsigned short denorm_min() throw()
{ return static_cast<unsigned short>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = true;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<int> {
static const bool is_specialized = true;
static int min() throw()
{ return (-2147483647-1); }
static int max() throw()
{ return 2147483647; }
static const int digits = 31;
static const int digits10 = 9;
static const bool is_signed = true;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static int epsilon() throw()
{ return 0; }
static int round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static int infinity() throw()
{ return static_cast<int>(0); }
static int quiet_NaN() throw()
{ return static_cast<int>(0); }
static int signaling_NaN() throw()
{ return static_cast<int>(0); }
static int denorm_min() throw()
{ return static_cast<int>(0); }
static const bool is_iec559 = true;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<unsigned int> {
static const bool is_specialized = true;
static unsigned int min() throw()
{ return 0; }
static unsigned int max() throw()
{ return (2147483647 * 2U + 1); }
static const int digits = 32;
static const int digits10 = 9;
static const bool is_signed = false;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static unsigned int epsilon() throw()
{ return 0; }
static unsigned int round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static unsigned int infinity() throw()
{ return static_cast<unsigned int>(0); }
static unsigned int quiet_NaN() throw()
{ return static_cast<unsigned int>(0); }
static unsigned int signaling_NaN() throw()
{ return static_cast<unsigned int>(0); }
static unsigned int denorm_min() throw()
{ return static_cast<unsigned int>(0); }
static const bool is_iec559 = true;
static const bool is_bounded = true;
static const bool is_modulo = true;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<long> {
static const bool is_specialized = true;
static long min() throw()
{ return (-2147483647L-1); }
static long max() throw()
{ return 2147483647L; }
static const int digits = 31;
static const int digits10 = 9;
static const bool is_signed = true;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static long epsilon() throw()
{ return 0; }
static long round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static long infinity() throw()
{ return static_cast<long>(0); }
static long quiet_NaN() throw()
{ return static_cast<long>(0); }
static long signaling_NaN() throw()
{ return static_cast<long>(0); }
static long denorm_min() throw()
{ return static_cast<long>(0); }
static const bool is_iec559 = true;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<unsigned long> {
static const bool is_specialized = true;
static unsigned long min() throw()
{ return 0; }
static unsigned long max() throw()
{ return (2147483647L * 2UL + 1); }
static const int digits = 32;
static const int digits10 = 9;
static const bool is_signed = false;
static const bool is_integer = true;
static const bool is_exact = true;
static const int radix = 2;
static unsigned long epsilon() throw()
{ return 0; }
static unsigned long round_error() throw()
{ return 0; }
static const int min_exponent = 0;
static const int min_exponent10 = 0;
static const int max_exponent = 0;
static const int max_exponent10 = 0;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static unsigned long infinity() throw()
{ return static_cast<unsigned long>(0); }
static unsigned long quiet_NaN() throw()
{ return static_cast<unsigned long>(0); }
static unsigned long signaling_NaN() throw()
{ return static_cast<unsigned long>(0); }
static unsigned long denorm_min() throw()
{ return static_cast<unsigned long>(0); }
static const bool is_iec559 = true;
static const bool is_bounded = true;
static const bool is_modulo = true;
static const bool traps = true;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<float> {
static const bool is_specialized = true;
static float min() throw()
{ return 1.17549435e-38F; }
static float max() throw()
{ return 3.40282347e+38F; }
static const int digits = 24;
static const int digits10 = 7;
static const bool is_signed = true;
static const bool is_integer = false;
static const bool is_exact = false;
static const int radix = 2;
static float epsilon() throw()
{ return 1.19209290e-07F; }
static float round_error() throw()
{ return 1.0f; }
static const int min_exponent = -125;
static const int min_exponent10 = -37;
static const int max_exponent = 128;
static const int max_exponent10 = 38;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static float infinity() throw()
{ return static_cast<float>(0); }
static float quiet_NaN() throw()
{ return static_cast<float>(0); }
static float signaling_NaN() throw()
{ return static_cast<float>(0); }
static float denorm_min() throw()
{ return static_cast<float>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = false;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<double> {
static const bool is_specialized = true;
static double min() throw()
{ return 2.2250738585072014e-308; }
static double max() throw()
{ return 1.7976931348623157e+308; }
static const int digits = 53;
static const int digits10 = 15;
static const bool is_signed = true;
static const bool is_integer = false;
static const bool is_exact = false;
static const int radix = 2;
static double epsilon() throw()
{ return 2.2204460492503131e-16; }
static double round_error() throw()
{ return 1.0; }
static const int min_exponent = -1021;
static const int min_exponent10 = -307;
static const int max_exponent = 1024;
static const int max_exponent10 = 308;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static double infinity() throw()
{ return static_cast<double>(0); }
static double quiet_NaN() throw()
{ return static_cast<double>(0); }
static double signaling_NaN() throw()
{ return static_cast<double>(0); }
static double denorm_min() throw()
{ return static_cast<double>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = false;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
template<> struct numeric_limits<long double> {
static const bool is_specialized = true;
static long double min() throw()
{ return 3.36210314311209350626e-4932L; }
static long double max() throw()
{ return 1.18973149535723176502e+4932L; }
static const int digits = 64;
static const int digits10 = 19;
static const bool is_signed = true;
static const bool is_integer = false;
static const bool is_exact = false;
static const int radix = 2;
static long double epsilon() throw()
{ return 1.08420217248550443401e-19L; }
static long double round_error() throw()
{ return 1.0L; }
static const int min_exponent = -16381;
static const int min_exponent10 = -4931;
static const int max_exponent = 16384;
static const int max_exponent10 = 4932;
static const bool has_infinity = false;
static const bool has_quiet_NaN = false;
static const bool has_signaling_NaN = false;
static const float_denorm_style has_denorm = denorm_absent;
static const bool has_denorm_loss = false;
static long double infinity() throw()
{ return static_cast<long double>(0); }
static long double quiet_NaN() throw()
{ return static_cast<long double>(0); }
static long double signaling_NaN() throw()
{ return static_cast<long double>(0); }
static long double denorm_min() throw()
{ return static_cast<long double>(0); }
static const bool is_iec559 = false;
static const bool is_bounded = true;
static const bool is_modulo = false;
static const bool traps = false;
static const bool tinyness_before = false;
static const float_round_style round_style = round_toward_zero;
};
}
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 2 3
namespace std {
template<typename _CharT, typename _Traits>
class basic_istream : virtual public basic_ios<_CharT, _Traits>
{
public:
typedef _CharT char_type;
typedef typename _Traits::int_type int_type;
typedef typename _Traits::pos_type pos_type;
typedef typename _Traits::off_type off_type;
typedef _Traits traits_type;
typedef basic_streambuf<_CharT, _Traits> __streambuf_type;
typedef basic_ios<_CharT, _Traits> __ios_type;
typedef basic_istream<_CharT, _Traits> __istream_type;
typedef istreambuf_iterator<_CharT> __istreambuf_iter;
typedef num_get<_CharT, __istreambuf_iter> __numget_type;
typedef ctype<_CharT> __ctype_type;
protected:
streamsize _M_gcount;
public:
explicit
basic_istream(__streambuf_type* __sb)
{
this->init(__sb);
_M_gcount = streamsize(0);
}
virtual
~basic_istream()
{
_M_gcount = streamsize(0);
_M_fnumget = __null;
}
class sentry;
friend class sentry;
__istream_type&
operator>>(__istream_type& (*__pf)(__istream_type&));
__istream_type&
operator>>(__ios_type& (*__pf)(__ios_type&));
__istream_type&
operator>>(ios_base& (*__pf)(ios_base&));
__istream_type&
operator>>(bool& __n);
__istream_type&
operator>>(short& __n);
__istream_type&
operator>>(unsigned short& __n);
__istream_type&
operator>>(int& __n);
__istream_type&
operator>>(unsigned int& __n);
__istream_type&
operator>>(long& __n);
__istream_type&
operator>>(unsigned long& __n);
# 130 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 3
__istream_type&
operator>>(float& __f);
__istream_type&
operator>>(double& __f);
__istream_type&
operator>>(long double& __f);
__istream_type&
operator>>(void*& __p);
__istream_type&
operator>>(__streambuf_type* __sb);
inline streamsize
gcount(void) const
{ return _M_gcount; }
int_type
get(void);
__istream_type&
get(char_type& __c);
__istream_type&
get(char_type* __s, streamsize __n, char_type __delim);
inline __istream_type&
get(char_type* __s, streamsize __n)
{ return get(__s, __n, this->widen('\n')); }
__istream_type&
get(__streambuf_type& __sb, char_type __delim);
inline __istream_type&
get(__streambuf_type& __sb)
{ return get(__sb, this->widen('\n')); }
__istream_type&
getline(char_type* __s, streamsize __n, char_type __delim);
inline __istream_type&
getline(char_type* __s, streamsize __n)
{ return getline(__s, __n, this->widen('\n')); }
__istream_type&
ignore(streamsize __n = 1, int_type __delim = traits_type::eof());
int_type
peek(void);
__istream_type&
read(char_type* __s, streamsize __n);
streamsize
readsome(char_type* __s, streamsize __n);
__istream_type&
putback(char_type __c);
__istream_type&
unget(void);
int
sync(void);
pos_type
tellg(void);
__istream_type&
seekg(pos_type);
__istream_type&
seekg(off_type, ios_base::seekdir);
private:
__istream_type&
operator=(const __istream_type&);
basic_istream(const __istream_type&);
};
template<typename _CharT, typename _Traits>
class basic_istream<_CharT, _Traits>::sentry
{
public:
typedef _Traits traits_type;
typedef basic_streambuf<_CharT, _Traits> __streambuf_type;
typedef basic_istream<_CharT, _Traits> __istream_type;
typedef __istream_type::__ctype_type __ctype_type;
typedef typename _Traits::int_type __int_type;
explicit
sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);
operator bool() { return _M_ok; }
private:
bool _M_ok;
};
template<typename _CharT, typename _Traits>
basic_istream<_CharT, _Traits>&
operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c);
template<class _Traits>
basic_istream<char, _Traits>&
operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
{ return (__in >> reinterpret_cast<char&>(__c)); }
template<class _Traits>
basic_istream<char, _Traits>&
operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
{ return (__in >> reinterpret_cast<char&>(__c)); }
template<typename _CharT, typename _Traits>
basic_istream<_CharT, _Traits>&
operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s);
template<class _Traits>
basic_istream<char,_Traits>&
operator>>(basic_istream<char,_Traits>& __in, unsigned char* __s)
{ return (__in >> reinterpret_cast<char*>(__s)); }
template<class _Traits>
basic_istream<char,_Traits>&
operator>>(basic_istream<char,_Traits>& __in, signed char* __s)
{ return (__in >> reinterpret_cast<char*>(__s)); }
template<typename _CharT, typename _Traits>
class basic_iostream
: public basic_istream<_CharT, _Traits>,
public basic_ostream<_CharT, _Traits>
{
public:
typedef basic_istream<_CharT, _Traits> __istream_type;
typedef basic_ostream<_CharT, _Traits> __ostream_type;
explicit
basic_iostream(basic_streambuf<_CharT, _Traits>* __sb)
: __istream_type(__sb), __ostream_type(__sb)
{ }
virtual
~basic_iostream() { }
};
template<typename _CharT, typename _Traits>
basic_istream<_CharT, _Traits>&
ws(basic_istream<_CharT, _Traits>& __is);
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iostream.h" 2 3
namespace std
{
extern istream cin;
extern ostream cout;
extern ostream cerr;
extern ostream clog;
# 57 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iostream.h" 3
static ios_base::Init __ioinit;
}
# 32 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/iostream.h" 2 3
using std::iostream;
using std::ostream;
using std::istream;
using std::ios;
using std::streambuf;
using std::cout;
using std::cin;
using std::cerr;
using std::clog;
using std::ws;
using std::endl;
using std::ends;
using std::flush;
# 413 "/home/st/andreas/ddd/ddd/strclass.h" 2
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream.h" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 1 3
# 26 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_iosfwd.h" 1 3
# 27 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 1 3
# 28 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 1 3
# 29 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ostream.h" 1 3
# 30 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_string.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream" 2 3
namespace std {
class strstreambuf : public basic_streambuf<char, char_traits<char> >
{
public:
typedef char_traits<char> _Traits;
typedef basic_streambuf<char, _Traits> _Base;
public:
explicit strstreambuf(streamsize __initial_capacity = 0);
strstreambuf(void* (*__alloc)(size_t), void (*__free)(void*));
strstreambuf(char* __get, streamsize __n, char* __put = 0);
strstreambuf(signed char* __get, streamsize __n, signed char* __put = 0);
strstreambuf(unsigned char* __get, streamsize __n, unsigned char* __put=0);
strstreambuf(const char* __get, streamsize __n);
strstreambuf(const signed char* __get, streamsize __n);
strstreambuf(const unsigned char* __get, streamsize __n);
virtual ~strstreambuf();
public:
void freeze(bool = true);
char* str();
int pcount() const;
protected:
virtual int_type overflow(int_type __c = _Traits::eof());
virtual int_type pbackfail(int_type __c = _Traits::eof());
virtual int_type underflow();
virtual _Base* setbuf(char* __buf, streamsize __n);
virtual pos_type seekoff(off_type __off, ios_base::seekdir __dir,
ios_base::openmode __mode
= ios_base::in | ios_base::out);
virtual pos_type seekpos(pos_type __pos, ios_base::openmode __mode
= ios_base::in | ios_base::out);
private:
char* _M_alloc(size_t);
void _M_free(char*);
void _M_setup(char* __get, char* __put, streamsize __n);
private:
void* (*_M_alloc_fun)(size_t);
void (*_M_free_fun)(void*);
bool _M_dynamic : 1;
bool _M_frozen : 1;
bool _M_constant : 1;
};
class istrstream : public basic_istream<char>
{
public:
explicit istrstream(char*);
explicit istrstream(const char*);
istrstream(char* , streamsize);
istrstream(const char*, streamsize);
virtual ~istrstream();
strstreambuf* rdbuf() const;
char* str();
private:
strstreambuf _M_buf;
};
class ostrstream : public basic_ostream<char>
{
public:
ostrstream();
ostrstream(char*, int, ios_base::openmode = ios_base::out);
virtual ~ostrstream();
strstreambuf* rdbuf() const;
void freeze(bool = true);
char* str();
int pcount() const;
private:
strstreambuf _M_buf;
};
class strstream : public basic_iostream<char>
{
public:
typedef char char_type;
typedef char_traits<char>::int_type int_type;
typedef char_traits<char>::pos_type pos_type;
typedef char_traits<char>::off_type off_type;
strstream();
strstream(char*, int, ios_base::openmode = ios_base::in | ios_base::out);
virtual ~strstream();
strstreambuf* rdbuf() const;
void freeze(bool = true);
int pcount() const;
char* str();
private:
strstreambuf _M_buf;
};
}
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/strstream.h" 2 3
using std::strstreambuf;
using std::istrstream;
using std::ostrstream;
using std::strstream;
# 414 "/home/st/andreas/ddd/ddd/strclass.h" 2
# 1 "/home/st/andreas/ddd/ddd/rxclass.h" 1
# 33 "/home/st/andreas/ddd/ddd/rxclass.h"
#pragma interface
# 1 "config.h" 1
# 37 "/home/st/andreas/ddd/ddd/rxclass.h" 2
# 1 "/home/st/andreas/ddd/ddd/bool.h" 1
# 32 "/home/st/andreas/ddd/ddd/bool.h"
# 1 "config.h" 1
# 33 "/home/st/andreas/ddd/ddd/bool.h" 2
# 38 "/home/st/andreas/ddd/ddd/rxclass.h" 2
# 96 "/home/st/andreas/ddd/ddd/rxclass.h"
typedef int (*rxmatchproc)(void *data, const char *s, int len, int pos);
class regex
{
protected:
# 119 "/home/st/andreas/ddd/ddd/rxclass.h"
rxmatchproc matcher;
void *data;
public:
regex(rxmatchproc p, void *data);
~regex();
int match(const char* s, int len, int pos = 0) const;
# 145 "/home/st/andreas/ddd/ddd/rxclass.h"
int search(const char* s, int len,
int& matchlen, int startpos = 0) const;
# 155 "/home/st/andreas/ddd/ddd/rxclass.h"
bool OK() const;
private:
regex(const regex&) :
matcher(0), data(0) {}
regex& operator = (const regex&) { return *this; }
};
# 415 "/home/st/andreas/ddd/ddd/strclass.h" 2
# 1 "config.h" 1
# 416 "/home/st/andreas/ddd/ddd/strclass.h" 2
# 1 "/home/st/andreas/ddd/ddd/bool.h" 1
# 417 "/home/st/andreas/ddd/ddd/strclass.h" 2
# 1 "/home/st/andreas/ddd/ddd/assert.h" 1
# 418 "/home/st/andreas/ddd/ddd/strclass.h" 2
struct strRep
{
unsigned int len;
unsigned int allocated;
char *s;
char mem[1];
};
strRep* string_Salloc(strRep*, const char*, int, int);
strRep* string_Scopy(strRep*, strRep*);
strRep* string_Scat(strRep*, const char*, int, const char*, int);
strRep* string_Scat(strRep*, const char*, int,
const char*,int, const char*,int);
strRep* string_Sprepend(strRep*, const char*, int);
strRep* string_Sreverse(strRep*, strRep*);
strRep* string_Supcase(strRep*, strRep*);
strRep* string_Sdowncase(strRep*, strRep*);
strRep* string_Scapitalize(strRep*, strRep*);
class string;
class subString;
class subString
{
friend class string;
protected:
string& S;
unsigned int pos;
unsigned int len;
void assign(strRep*, const char*, int = -1);
subString(string& x, int p, int l);
subString(const string& x, int p, int l);
public:
subString(const subString& x);
~subString();
subString& operator = (const string& y);
subString& operator = (const subString& y);
subString& operator = (const char* t);
subString& operator = (char* t);
subString& operator = (char c);
bool contains(char c) const;
bool contains(const string& y) const;
bool contains(const subString& y) const;
bool contains(const char* t) const;
bool contains(char* t) const;
bool contains(const regex& r) const;
bool matches(const regex& r) const;
friend inline ostream& operator<<(ostream& s, const subString& x);
unsigned int length() const;
bool empty() const;
const char* chars() const;
bool OK() const;
};
class string
{
friend class subString;
protected:
strRep* rep;
int search(int, int, const char*, int = -1) const;
int search(int, int, char) const;
int match(int, int, int, const char*, int = -1) const;
int _gsub(const char*, int, const char* ,int);
int _gsub(const regex&, const char*, int);
subString _substr(int, int);
const subString _substr(int, int) const;
private:
string(int) : rep(0)
{
error("init from int");
}
string& operator = (int) { error("int assign"); return *this; }
public:
string();
string(const string& x);
string(const subString& x);
string(const char* t);
string(const char* t, int len);
string(char c);
string(ostrstream& os);
~string();
void consuming(bool set);
bool consuming() const;
string& operator = (const string& y);
string& operator = (const char* y);
string& operator = (char* y);
string& operator = (char c);
string& operator = (const subString& y);
string& operator = (ostrstream& os);
string& operator += (const string& y);
string& operator += (const subString& y);
string& operator += (const char* t);
string& operator += (char* t);
string& operator += (char c);
string& prepend(const string& y);
string& prepend(const subString& y);
string& prepend(const char* t);
string& prepend(char* t);
string& prepend(char c);
friend inline void cat(const string&, const string&, string&);
friend inline void cat(const string&, const subString&, string&);
friend inline void cat(const string&, const char*, string&);
friend inline void cat(const string&, char*, string&);
friend inline void cat(const string&, char, string&);
friend inline void cat(const subString&, const string&, string&);
friend inline void cat(const subString&, const subString&, string&);
friend inline void cat(const subString&, const char*, string&);
friend inline void cat(const subString&, char*, string&);
friend inline void cat(const subString&, char, string&);
friend inline void cat(const char*, const string&, string&);
friend inline void cat(const char*, const subString&, string&);
friend inline void cat(const char*, const char*, string&);
friend inline void cat(const char*, char*, string&);
friend inline void cat(const char*, char, string&);
friend inline void cat(char*, const string&, string&);
friend inline void cat(char*, const subString&, string&);
friend inline void cat(char*, const char*, string&);
friend inline void cat(char*, char*, string&);
friend inline void cat(char*, char, string&);
friend inline void cat(char, const string&, string&);
friend inline void cat(char, const subString&, string&);
friend inline void cat(char, const char*, string&);
friend inline void cat(char, char*, string&);
friend inline void cat(char, char, string&);
int index(char c, int startpos = 0) const;
int index(const string& y, int startpos = 0) const;
int index(const subString& y, int startpos = 0) const;
int index(const char* t, int startpos = 0) const;
int index(char* t, int startpos = 0) const;
int index(const regex& r, int startpos = 0) const;
bool contains(char c) const;
bool contains(const string& y) const;
bool contains(const subString& y) const;
bool contains(const char* t) const;
bool contains(char* t) const;
bool contains(const regex& r) const;
bool contains(char c, int pos) const;
bool contains(const string& y, int pos) const;
bool contains(const subString& y, int pos) const;
bool contains(const char* t, int pos) const;
bool contains(char* t, int pos) const;
bool contains(const regex& r, int pos) const;
bool matches(char c, int pos = 0) const;
bool matches(const string& y, int pos = 0) const;
bool matches(const subString& y, int pos = 0) const;
bool matches(const char* t, int pos = 0) const;
bool matches(char* t, int pos = 0) const;
bool matches(const regex& r, int pos = 0) const;
int freq(char c) const;
int freq(const string& y) const;
int freq(const subString& y) const;
int freq(const char* t) const;
int freq(char* t) const;
subString at(int pos, int len);
subString operator() (int pos, int len);
subString at(const string& x, int startpos = 0);
subString at(const subString& x, int startpos = 0);
subString at(const char* t, int startpos = 0);
subString at(char* t, int startpos = 0);
subString at(char c, int startpos = 0);
subString at(const regex& r, int startpos = 0);
subString before(int pos);
subString before(const string& x, int startpos = 0);
subString before(const subString& x, int startpos = 0);
subString before(const char* t, int startpos = 0);
subString before(char* t, int startpos = 0);
subString before(char c, int startpos = 0);
subString before(const regex& r, int startpos = 0);
subString through(int pos);
subString through(const string& x, int startpos = 0);
subString through(const subString& x, int startpos = 0);
subString through(const char* t, int startpos = 0);
subString through(char* t, int startpos = 0);
subString through(char c, int startpos = 0);
subString through(const regex& r, int startpos = 0);
subString from(int pos);
subString from(const string& x, int startpos = 0);
subString from(const subString& x, int startpos = 0);
subString from(const char* t, int startpos = 0);
subString from(char* t, int startpos = 0);
subString from(char c, int startpos = 0);
subString from(const regex& r, int startpos = 0);
subString after(int pos);
subString after(const string& x, int startpos = 0);
subString after(const subString& x, int startpos = 0);
subString after(const char* t, int startpos = 0);
subString after(char* t, int startpos = 0);
subString after(char c, int startpos = 0);
subString after(const regex& r, int startpos = 0);
const subString at(int pos, int len) const;
const subString operator() (int pos, int len) const;
const subString at(const string& x, int startpos = 0) const;
const subString at(const subString& x, int startpos = 0) const;
const subString at(const char* t, int startpos = 0) const;
const subString at(char* t, int startpos = 0) const;
const subString at(char c, int startpos = 0) const;
const subString at(const regex& r, int startpos = 0) const;
const subString before(int pos) const;
const subString before(const string& x, int startpos = 0) const;
const subString before(const subString& x, int startpos = 0) const;
const subString before(const char* t, int startpos = 0) const;
const subString before(char* t, int startpos = 0) const;
const subString before(char c, int startpos = 0) const;
const subString before(const regex& r, int startpos = 0) const;
const subString through(int pos) const;
const subString through(const string& x, int startpos = 0) const;
const subString through(const subString& x, int startpos = 0) const;
const subString through(const char* t, int startpos = 0) const;
const subString through(char* t, int startpos = 0) const;
const subString through(char c, int startpos = 0) const;
const subString through(const regex& r, int startpos = 0) const;
const subString from(int pos) const;
const subString from(const string& x, int startpos = 0) const;
const subString from(const subString& x, int startpos = 0) const;
const subString from(const char* t, int startpos = 0) const;
const subString from(char* t, int startpos = 0) const;
const subString from(char c, int startpos = 0) const;
const subString from(const regex& r, int startpos = 0) const;
const subString after(int pos) const;
const subString after(const string& x, int startpos = 0) const;
const subString after(const subString& x, int startpos = 0) const;
const subString after(const char* t, int startpos = 0) const;
const subString after(char* t, int startpos = 0) const;
const subString after(char c, int startpos = 0) const;
const subString after(const regex& r, int startpos = 0) const;
void del(int pos, int len);
void del(const string& y, int startpos = 0);
void del(const subString& y, int startpos = 0);
void del(const char* t, int startpos = 0);
void del(char* t, int startpos = 0);
void del(char c, int startpos = 0);
void del(const regex& r, int startpos = 0);
int gsub(const string& pat, const string& repl);
int gsub(const subString& pat, const string& repl);
int gsub(const char* pat, const string& repl);
int gsub(const char* pat, const char* repl);
int gsub(const char* pat, char* repl);
int gsub(char* pat, const string& repl);
int gsub(char* pat, const char* repl);
int gsub(char* pat, char* repl);
int gsub(const regex& pat, const string& repl);
friend int split(const string& x, string *res, int maxn,
const string& sep);
friend int split(const string& x, string *res, int maxn,
const regex& sep);
friend string common_prefix(const string& x, const string& y,
int startpos = 0);
friend string common_suffix(const string& x, const string& y,
int startpos = -1);
friend string replicate(const string& y, int n);
friend string join(string *src, int n, const string& sep);
friend inline string reverse(const string& x);
friend inline string upcase(const string& x);
friend inline string downcase(const string& x);
friend inline string capitalize(const string& x);
void reverse();
void upcase();
void downcase();
void capitalize();
char& operator [] (char i);
char& operator [] (short i);
char& operator [] (unsigned short i);
char& operator [] (int i);
char& operator [] (unsigned int i);
char& operator [] (long i);
char& operator [] (unsigned long i);
char operator [] (char i) const;
char operator [] (unsigned short i) const;
char operator [] (short i) const;
char operator [] (int i) const;
char operator [] (unsigned int i) const;
char operator [] (long i) const;
char operator [] (unsigned long i) const;
char elem(int i) const;
char firstchar() const;
char lastchar() const;
operator const char*() const;
operator char*() const;
const char* chars() const;
friend inline ostream& operator<<(ostream& s, const string& x);
friend inline ostream& operator<<(ostream& s, const subString& x);
friend istream& operator>>(istream& s, string& x);
friend int readline(istream& s, string& x,
char terminator = '\n',
int discard_terminator = 1);
unsigned int length() const;
bool empty() const;
void alloc(int newsize);
int allocation() const;
void error(const char* msg) const;
bool OK() const;
};
int compare(const string& x, const string& y);
int compare(const string& x, const subString& y);
int compare(const string& x, const char* y);
int compare(const subString& x, const string& y);
int compare(const subString& x, const subString& y);
int compare(const subString& x, const char* y);
int compare(const char *x, const string& y);
int compare(const char *x, const subString& y);
int fcompare(const string& x, const string& y);
extern strRep _nilstrRep;
extern string _nilstring;
inline unsigned int string::length() const { return rep->len; }
inline bool string::empty() const { return rep->len == 0; }
inline const char* string::chars() const { return rep->s; }
inline int string::allocation() const { return rep->allocated; }
inline unsigned int subString::length() const { return len; }
inline bool subString::empty() const { return len == 0; }
inline const char* subString::chars() const { return S.rep->s + pos; }
inline void string::consuming(bool set)
{
(void) set;
}
inline bool string::consuming() const
{
return false;
}
inline string::string()
: rep(&_nilstrRep)
{}
inline string::string(const string& x)
: rep(string_Scopy(0, x.rep))
{}
inline string::string(const char* t)
: rep(string_Salloc(0, t, -1, -1))
{}
inline string::string(const char* t, int tlen)
: rep(string_Salloc(0, t, tlen, tlen))
{}
inline string::string(const subString& y)
: rep(string_Salloc(0, y.chars(), y.length(), y.length()))
{}
inline string::string(char c)
: rep(string_Salloc(0, &c, 1, 1))
{}
inline void string_DeleteRep(strRep *rep)
{
operator delete(rep);
}
inline string::~string()
{
if (rep != &_nilstrRep)
string_DeleteRep(rep);
}
inline subString::subString(const subString& x)
:S(x.S), pos(x.pos), len(x.len) {}
inline subString::subString(string& x, int first, int l)
:S(x), pos(first), len(l) {}
inline subString::subString(const string& x, int first, int l)
:S((string &)x), pos(first), len(l) {}
inline subString::~subString() {}
inline string& string::operator = (const string& y)
{
if (y.empty())
{
rep->s += rep->len;
rep->len = 0;
}
else
{
;
rep = string_Scopy(rep, y.rep);
}
return *this;
}
inline string& string::operator = (const char* t)
{
if (*t == '\0')
{
rep->s += rep->len;
rep->len = 0;
}
else if (t >= rep->s && t < rep->s + rep->len)
{
int len = t - rep->s;
rep->len -= len;
rep->s = (char *)t;
}
else if (t >= &(rep->mem[0]) && t < rep->s)
{
int len = (rep->s - t);
rep->len += len;
rep->s = (char *)t;
}
else
{
;
rep = string_Salloc(rep, t, -1, -1);
}
return *this;
}
inline string& string::operator = (char *t)
{
(void) operator = ((const char *)t);
return *this;
}
inline string& string::operator = (const subString& y)
{
if (y.empty())
{
rep->s += rep->len;
rep->len = 0;
}
else if (y.chars() >= &(rep->mem[0]) &&
y.chars() < &(rep->mem[0]) + rep->allocated)
{
rep->s = (char *)y.chars();
rep->len = y.length();
rep->s[rep->len] = '\0';
}
else
{
;
rep = string_Salloc(rep, y.chars(), y.length(), y.length());
}
return *this;
}
inline string& string::operator = (char c)
{
;
rep = string_Salloc(rep, &c, 1, 1); return *this;
}
inline string& string::operator = (ostrstream& os)
{
;
const int frozen = 0;
const char *str = os.str();
# 1071 "/home/st/andreas/ddd/ddd/strclass.h"
rep = string_Salloc(rep, str, os.pcount(), os.pcount());
os.rdbuf()->freeze(frozen);
return *this;
}
inline string::string(ostrstream& os)
: rep(&_nilstrRep)
{
operator=(os);
}
inline subString& subString::operator = (const char* ys)
{
assign(0, ys); return *this;
}
inline subString& subString::operator = (char* ys)
{
assign(0, ys); return *this;
}
inline subString& subString::operator = (char ch)
{
assign(0, &ch, 1); return *this;
}
inline subString& subString::operator = (const string& y)
{
assign(y.rep, y.chars(), y.length()); return *this;
}
inline subString& subString::operator = (const subString& y)
{
assign(y.S.rep, y.chars(), y.length()); return *this;
}
inline void cat(const string& x, const string& y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y.chars(), y.length());
}
inline void cat(const string& x, const subString& y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y.chars(), y.length());
}
inline void cat(const string& x, const char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y, -1);
}
inline void cat(const string& x, char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y, -1);
}
inline void cat(const string& x, char y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), &y, 1);
}
inline void cat(const subString& x, const string& y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y.chars(), y.length());
}
inline void cat(const subString& x, const subString& y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y.chars(), y.length());
}
inline void cat(const subString& x, const char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y, -1);
}
inline void cat(const subString& x, char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), y, -1);
}
inline void cat(const subString& x, char y, string& r)
{
;
r.rep = string_Scat(r.rep, x.chars(), x.length(), &y, 1);
}
inline void cat(const char* x, const string& y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y.chars(), y.length());
}
inline void cat(const char* x, const subString& y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y.chars(), y.length());
}
inline void cat(const char* x, const char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y, -1);
}
inline void cat(const char* x, char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y, -1);
}
inline void cat(const char* x, char y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, &y, 1);
}
inline void cat(char* x, const string& y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y.chars(), y.length());
}
inline void cat(char* x, const subString& y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y.chars(), y.length());
}
inline void cat(char* x, const char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y, -1);
}
inline void cat(char* x, char* y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, y, -1);
}
inline void cat(char* x, char y, string& r)
{
;
r.rep = string_Scat(r.rep, x, -1, &y, 1);
}
inline void cat(char x, const string& y, string& r)
{
;
r.rep = string_Scat(r.rep, &x, 1, y.chars(), y.length());
}
inline void cat(char x, const subString& y, string& r)
{
;
r.rep = string_Scat(r.rep, &x, 1, y.chars(), y.length());
}
inline void cat(char x, const char* y, string& r)
{
;
r.rep = string_Scat(r.rep, &x, 1, y, -1);
}
inline void cat(char x, char* y, string& r)
{
;
r.rep = string_Scat(r.rep, &x, 1, y, -1);
}
inline void cat(char x, char y, string& r)
{
;
r.rep = string_Scat(r.rep, &x, 1, &y, 1);
}
inline string& string::operator += (const string& y)
{
cat(*this, y, *this); return *this;
}
inline string& string::operator += (const subString& y)
{
cat(*this, y, *this); return *this;
}
inline string& string::operator += (const char* y)
{
cat(*this, y, *this); return *this;
}
inline string& string::operator += (char* y)
{
cat(*this, y, *this); return *this;
}
inline string& string:: operator +=(char y)
{
cat(*this, y, *this); return *this;
}
# 1404 "/home/st/andreas/ddd/ddd/strclass.h"
inline string operator + (const string& x, const string& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const string& x, const subString& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const string& x, const char* y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const string& x, char* y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const string& x, char y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const subString& x, const string& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const subString& x, const subString& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const subString& x, const char* y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const subString& x, char* y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const subString& x, char y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const char* x, const string& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (const char* x, const subString& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (char* x, const string& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (char* x, const subString& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (char x, const string& y)
{
string r; cat(x, y, r); return r;
}
inline string operator + (char x, const subString& y)
{
string r; cat(x, y, r); return r;
}
inline string reverse(const string& x)
{
string r; r.rep = string_Sreverse(x.rep, r.rep); return r;
}
inline string upcase(const string& x)
{
string r; r.rep = string_Supcase(x.rep, r.rep); return r;
}
inline string downcase(const string& x)
{
string r; r.rep = string_Sdowncase(x.rep, r.rep); return r;
}
inline string capitalize(const string& x)
{
string r; r.rep = string_Scapitalize(x.rep, r.rep); return r;
}
inline string& string::prepend(const string& y)
{
;
rep = string_Sprepend(rep, y.chars(), y.length()); return *this;
}
inline string& string::prepend(const char* y)
{
;
rep = string_Sprepend(rep, y, -1); return *this;
}
inline string& string::prepend(char* y)
{
;
rep = string_Sprepend(rep, y, -1); return *this;
}
inline string& string::prepend(char y)
{
;
rep = string_Sprepend(rep, &y, 1); return *this;
}
inline string& string::prepend(const subString& y)
{
;
rep = string_Sprepend(rep, y.chars(), y.length());return *this;
}
inline void string::reverse()
{
;
rep = string_Sreverse(rep, rep);
}
inline void string::upcase()
{
;
rep = string_Supcase(rep, rep);
}
inline void string::downcase()
{
;
rep = string_Sdowncase(rep, rep);
}
inline void string::capitalize()
{
;
rep = string_Scapitalize(rep, rep);
}
inline char& string::operator [] (unsigned int i)
{
return rep->s[i];
}
inline char string::operator [] (unsigned int i) const
{
return rep->s[i];
}
inline char& string::operator [] (int i)
{
return string::operator [] ((unsigned int) i);
}
inline char string::operator [] (int i) const
{
return string::operator [] ((unsigned int) i);
}
inline char& string::operator [] (char i)
{
return string::operator [] ((unsigned int) i);
}
inline char string::operator [] (char i) const
{
return string::operator [] ((unsigned int) i);
}
inline char& string::operator [] (short i)
{
return string::operator [] ((unsigned int) i);
}
inline char string::operator [] (short i) const
{
return string::operator [] ((unsigned int) i);
}
inline char& string::operator [] (unsigned short i)
{
return string::operator [] ((unsigned int) i);
}
inline char string::operator [] (unsigned short i) const
{
return string::operator [] ((unsigned int) i);
}
inline char& string::operator [] (long i)
{
return string::operator [] ((unsigned int) i);
}
inline char string::operator [] (long i) const
{
return string::operator [] ((unsigned int) i);
}
inline char& string::operator [] (unsigned long i)
{
return string::operator [] ((unsigned int) i);
}
inline char string::operator [] (unsigned long i) const
{
return string::operator [] ((unsigned int) i);
}
inline char string::elem (int i) const
{
return rep->s[i];
}
inline char string::firstchar() const
{
return elem(0);
}
inline char string::lastchar() const
{
return elem(length() - 1);
}
inline int string::index(char c, int startpos) const
{
return search(startpos, length(), c);
}
inline int string::index(const char* t, int startpos) const
{
return search(startpos, length(), t);
}
inline int string::index(char* t, int startpos) const
{
return search(startpos, length(), t);
}
inline int string::index(const string& y, int startpos) const
{
return search(startpos, length(), y.chars(), y.length());
}
inline int string::index(const subString& y, int startpos) const
{
return search(startpos, length(), y.chars(), y.length());
}
inline int string::index(const regex& r, int startpos) const
{
int unused; return r.search(chars(), length(), unused, startpos);
}
inline bool string::contains(char c) const
{
return search(0, length(), c) >= 0;
}
inline bool string::contains(const char* t) const
{
return search(0, length(), t) >= 0;
}
inline bool string::contains(char* t) const
{
return search(0, length(), t) >= 0;
}
inline bool string::contains(const string& y) const
{
return search(0, length(), y.chars(), y.length()) >= 0;
}
inline bool string::contains(const subString& y) const
{
return search(0, length(), y.chars(), y.length()) >= 0;
}
inline bool string::contains(char c, int p) const
{
return match(p, length(), 0, &c, 1) >= 0;
}
inline bool string::contains(const char* t, int p) const
{
return match(p, length(), 0, t) >= 0;
}
inline bool string::contains(char* t, int p) const
{
return match(p, length(), 0, t) >= 0;
}
inline bool string::contains(const string& y, int p) const
{
return match(p, length(), 0, y.chars(), y.length()) >= 0;
}
inline bool string::contains(const subString& y, int p) const
{
return match(p, length(), 0, y.chars(), y.length()) >= 0;
}
inline bool string::contains(const regex& r) const
{
int unused; return r.search(chars(), length(), unused, 0) >= 0;
}
inline bool string::contains(const regex& r, int p) const
{
return r.match(chars(), length(), p) >= 0;
}
inline bool string::matches(const subString& y, int p) const
{
return match(p, length(), 1, y.chars(), y.length()) >= 0;
}
inline bool string::matches(const string& y, int p) const
{
return match(p, length(), 1, y.chars(), y.length()) >= 0;
}
inline bool string::matches(const char* t, int p) const
{
return match(p, length(), 1, t) >= 0;
}
inline bool string::matches(char* t, int p) const
{
return match(p, length(), 1, t) >= 0;
}
inline bool string::matches(char c, int p) const
{
return match(p, length(), 1, &c, 1) >= 0;
}
inline bool string::matches(const regex& r, int p) const
{
int l = (p < 0)? -p : length() - p;
return r.match(chars(), length(), p) == l;
}
inline bool subString::contains(const char* t) const
{
return S.search(pos, pos+len, t) >= 0;
}
inline bool subString::contains(char* t) const
{
return S.search(pos, pos+len, t) >= 0;
}
inline bool subString::contains(const string& y) const
{
return S.search(pos, pos+len, y.chars(), y.length()) >= 0;
}
inline bool subString::contains(const subString& y) const
{
return S.search(pos, pos+len, y.chars(), y.length()) >= 0;
}
inline bool subString::contains(char c) const
{
return S.search(pos, pos+len, 0, c) >= 0;
}
inline bool subString::contains(const regex& r) const
{
int unused; return r.search(chars(), len, unused, 0) >= 0;
}
inline bool subString::matches(const regex& r) const
{
return unsigned(r.match(chars(), len, 0)) == len;
}
inline int string::gsub(const string& pat, const string& r)
{
return _gsub(pat.chars(), pat.length(), r.chars(), r.length());
}
inline int string::gsub(const subString& pat, const string& r)
{
return _gsub(pat.chars(), pat.length(), r.chars(), r.length());
}
inline int string::gsub(const regex& pat, const string& r)
{
return _gsub(pat, r.chars(), r.length());
}
inline int string::gsub(const char* pat, const string& r)
{
return _gsub(pat, -1, r.chars(), r.length());
}
inline int string::gsub(char* pat, const string& r)
{
return _gsub(pat, -1, r.chars(), r.length());
}
inline int string::gsub(const char* pat, const char* r)
{
return _gsub(pat, -1, r, -1);
}
inline int string::gsub(const char* pat, char* r)
{
return _gsub(pat, -1, r, -1);
}
inline int string::gsub(char* pat, const char* r)
{
return _gsub(pat, -1, r, -1);
}
inline int string::gsub(char* pat, char* r)
{
return _gsub(pat, -1, r, -1);
}
inline subString string::after(char* t, int startpos)
{
return after((const char *)t, startpos);
}
inline subString string::at(char* t, int startpos)
{
return at((const char *)t, startpos);
}
inline subString string::before(char* t, int startpos)
{
return before((const char *)t, startpos);
}
inline void string::del(char* t, int startpos)
{
del((const char *)t, startpos);
}
inline int string::freq(char* t) const
{
return freq((const char *)t);
}
inline subString string::from(char* t, int startpos)
{
return from((const char *)t, startpos);
}
inline subString string::through(char* t, int startpos)
{
return through((const char *)t, startpos);
}
inline int compare(const subString& x, char* y)
{
return compare(x, (const char*)y);
}
inline int compare(const string& x, char* y)
{
return compare(x, (const char*)y);
}
inline int compare(char *x, const subString& y)
{
return compare((const char*)x, y);
}
inline int compare(char *x, const string& y)
{
return compare((const char*)x, y);
}
inline int compare(const string& x, char y)
{
return x.length() == 1 ? *x.chars() - y : x.length() - 1;
}
inline int compare(char x, const string& y)
{
return -compare(y, x);
}
inline int compare(const subString& x, char y)
{
return x.length() == 1 ? *x.chars() - y : x.length() - 1;
}
inline int compare(char x, const subString& y)
{
return -compare(y, x);
}
inline const subString string::at(int pos, int len) const
{
return ((string *)this)->at(pos, len);
}
inline const subString string::operator() (int pos, int len) const
{
return ((string *)this)->operator()(pos, len);
}
inline const subString string::at(const string& x, int startpos) const
{
return ((string *)this)->at(x, startpos);
}
inline const subString string::at(const subString& x, int startpos) const
{
return ((string *)this)->at(x, startpos);
}
inline const subString string::at(const char* t, int startpos) const
{
return ((string *)this)->at(t, startpos);
}
inline const subString string::at(char* t, int startpos) const
{
return ((string *)this)->at(t, startpos);
}
inline const subString string::at(char c, int startpos) const
{
return ((string *)this)->at(c, startpos);
}
inline const subString string::at(const regex& r, int startpos) const
{
return ((string *)this)->at(r, startpos);
}
inline const subString string::before(int pos) const
{
return ((string *)this)->before(pos);
}
inline const subString string::before(const string& x, int startpos) const
{
return ((string *)this)->before(x, startpos);
}
inline const subString string::before(const subString& x, int startpos)
const
{
return ((string *)this)->before(x, startpos);
}
inline const subString string::before(const char* t, int startpos) const
{
return ((string *)this)->before(t, startpos);
}
inline const subString string::before(char* t, int startpos) const
{
return ((string *)this)->before(t, startpos);
}
inline const subString string::before(char c, int startpos) const
{
return ((string *)this)->before(c, startpos);
}
inline const subString string::before(const regex& r, int startpos) const
{
return ((string *)this)->before(r, startpos);
}
inline const subString string::through(int pos) const
{
return ((string *)this)->through(pos);
}
inline const subString string::through(const string& x, int startpos) const
{
return ((string *)this)->through(x, startpos);
}
inline const subString string::through(const subString& x, int startpos)
const
{
return ((string *)this)->through(x, startpos);
}
inline const subString string::through(const char* t, int startpos) const
{
return ((string *)this)->through(t, startpos);
}
inline const subString string::through(char* t, int startpos) const
{
return ((string *)this)->through(t, startpos);
}
inline const subString string::through(char c, int startpos) const
{
return ((string *)this)->through(c, startpos);
}
inline const subString string::through(const regex& r, int startpos) const
{
return ((string *)this)->through(r, startpos);
}
inline const subString string::from(int pos) const
{
return ((string *)this)->from(pos);
}
inline const subString string::from(const string& x, int startpos) const
{
return ((string *)this)->from(x, startpos);
}
inline const subString string::from(const subString& x, int startpos) const
{
return ((string *)this)->from(x, startpos);
}
inline const subString string::from(const char* t, int startpos) const
{
return ((string *)this)->from(t, startpos);
}
inline const subString string::from(char* t, int startpos) const
{
return ((string *)this)->from(t, startpos);
}
inline const subString string::from(char c, int startpos) const
{
return ((string *)this)->from(c, startpos);
}
inline const subString string::from(const regex& r, int startpos) const
{
return ((string *)this)->from(r, startpos);
}
inline const subString string::after(int pos) const
{
return ((string *)this)->after(pos);
}
inline const subString string::after(const string& x, int startpos) const
{
return ((string *)this)->after(x, startpos);
}
inline const subString string::after(const subString& x, int startpos)
const
{
return ((string *)this)->after(x, startpos);
}
inline const subString string::after(const char* t, int startpos) const
{
return ((string *)this)->after(t, startpos);
}
inline const subString string::after(char* t, int startpos) const
{
return ((string *)this)->after(t, startpos);
}
inline const subString string::after(char c, int startpos) const
{
return ((string *)this)->after(c, startpos);
}
inline const subString string::after(const regex& r, int startpos) const
{
return ((string *)this)->after(r, startpos);
}
inline ostream& operator<<(ostream& s, const string& x)
{
s.write(x.chars(), x.length()); return s;
}
inline ostream& operator<<(ostream& s, const subString& x)
{
s.write(x.chars(), x.length()); return s;
}
# 2168 "/home/st/andreas/ddd/ddd/strclass.h"
inline int operator ==(const string& x, const string& y) { return compare(x, y) == 0; } inline int operator !=(const string& x, const string& y) { return compare(x, y) != 0; } inline int operator <(const string& x, const string& y) { return compare(x, y) < 0; } inline int operator >(const string& x, const string& y) { return compare(x, y) > 0; } inline int operator <=(const string& x, const string& y) { return compare(x, y) <= 0; } inline int operator >=(const string& x, const string& y) { return compare(x, y) >= 0; }
inline int operator ==(const string& x, const subString& y) { return compare(x, y) == 0; } inline int operator !=(const string& x, const subString& y) { return compare(x, y) != 0; } inline int operator <(const string& x, const subString& y) { return compare(x, y) < 0; } inline int operator >(const string& x, const subString& y) { return compare(x, y) > 0; } inline int operator <=(const string& x, const subString& y) { return compare(x, y) <= 0; } inline int operator >=(const string& x, const subString& y) { return compare(x, y) >= 0; }
inline int operator ==(const string& x, const char * y) { return compare(x, y) == 0; } inline int operator !=(const string& x, const char * y) { return compare(x, y) != 0; } inline int operator <(const string& x, const char * y) { return compare(x, y) < 0; } inline int operator >(const string& x, const char * y) { return compare(x, y) > 0; } inline int operator <=(const string& x, const char * y) { return compare(x, y) <= 0; } inline int operator >=(const string& x, const char * y) { return compare(x, y) >= 0; }
inline int operator ==(const string& x, char * y) { return compare(x, y) == 0; } inline int operator !=(const string& x, char * y) { return compare(x, y) != 0; } inline int operator <(const string& x, char * y) { return compare(x, y) < 0; } inline int operator >(const string& x, char * y) { return compare(x, y) > 0; } inline int operator <=(const string& x, char * y) { return compare(x, y) <= 0; } inline int operator >=(const string& x, char * y) { return compare(x, y) >= 0; }
inline int operator ==(const string& x, char y) { return compare(x, y) == 0; } inline int operator !=(const string& x, char y) { return compare(x, y) != 0; } inline int operator <(const string& x, char y) { return compare(x, y) < 0; } inline int operator >(const string& x, char y) { return compare(x, y) > 0; } inline int operator <=(const string& x, char y) { return compare(x, y) <= 0; } inline int operator >=(const string& x, char y) { return compare(x, y) >= 0; }
inline int operator ==(const subString& x, const string& y) { return compare(x, y) == 0; } inline int operator !=(const subString& x, const string& y) { return compare(x, y) != 0; } inline int operator <(const subString& x, const string& y) { return compare(x, y) < 0; } inline int operator >(const subString& x, const string& y) { return compare(x, y) > 0; } inline int operator <=(const subString& x, const string& y) { return compare(x, y) <= 0; } inline int operator >=(const subString& x, const string& y) { return compare(x, y) >= 0; }
inline int operator ==(const subString& x, const subString& y) { return compare(x, y) == 0; } inline int operator !=(const subString& x, const subString& y) { return compare(x, y) != 0; } inline int operator <(const subString& x, const subString& y) { return compare(x, y) < 0; } inline int operator >(const subString& x, const subString& y) { return compare(x, y) > 0; } inline int operator <=(const subString& x, const subString& y) { return compare(x, y) <= 0; } inline int operator >=(const subString& x, const subString& y) { return compare(x, y) >= 0; }
inline int operator ==(const subString& x, const char * y) { return compare(x, y) == 0; } inline int operator !=(const subString& x, const char * y) { return compare(x, y) != 0; } inline int operator <(const subString& x, const char * y) { return compare(x, y) < 0; } inline int operator >(const subString& x, const char * y) { return compare(x, y) > 0; } inline int operator <=(const subString& x, const char * y) { return compare(x, y) <= 0; } inline int operator >=(const subString& x, const char * y) { return compare(x, y) >= 0; }
inline int operator ==(const subString& x, char * y) { return compare(x, y) == 0; } inline int operator !=(const subString& x, char * y) { return compare(x, y) != 0; } inline int operator <(const subString& x, char * y) { return compare(x, y) < 0; } inline int operator >(const subString& x, char * y) { return compare(x, y) > 0; } inline int operator <=(const subString& x, char * y) { return compare(x, y) <= 0; } inline int operator >=(const subString& x, char * y) { return compare(x, y) >= 0; }
inline int operator ==(const subString& x, char y) { return compare(x, y) == 0; } inline int operator !=(const subString& x, char y) { return compare(x, y) != 0; } inline int operator <(const subString& x, char y) { return compare(x, y) < 0; } inline int operator >(const subString& x, char y) { return compare(x, y) > 0; } inline int operator <=(const subString& x, char y) { return compare(x, y) <= 0; } inline int operator >=(const subString& x, char y) { return compare(x, y) >= 0; }
inline int operator ==(const char * x, const string& y) { return compare(x, y) == 0; } inline int operator !=(const char * x, const string& y) { return compare(x, y) != 0; } inline int operator <(const char * x, const string& y) { return compare(x, y) < 0; } inline int operator >(const char * x, const string& y) { return compare(x, y) > 0; } inline int operator <=(const char * x, const string& y) { return compare(x, y) <= 0; } inline int operator >=(const char * x, const string& y) { return compare(x, y) >= 0; }
inline int operator ==(const char * x, const subString& y) { return compare(x, y) == 0; } inline int operator !=(const char * x, const subString& y) { return compare(x, y) != 0; } inline int operator <(const char * x, const subString& y) { return compare(x, y) < 0; } inline int operator >(const char * x, const subString& y) { return compare(x, y) > 0; } inline int operator <=(const char * x, const subString& y) { return compare(x, y) <= 0; } inline int operator >=(const char * x, const subString& y) { return compare(x, y) >= 0; }
inline int operator ==(char * x, const string& y) { return compare(x, y) == 0; } inline int operator !=(char * x, const string& y) { return compare(x, y) != 0; } inline int operator <(char * x, const string& y) { return compare(x, y) < 0; } inline int operator >(char * x, const string& y) { return compare(x, y) > 0; } inline int operator <=(char * x, const string& y) { return compare(x, y) <= 0; } inline int operator >=(char * x, const string& y) { return compare(x, y) >= 0; }
inline int operator ==(char * x, const subString& y) { return compare(x, y) == 0; } inline int operator !=(char * x, const subString& y) { return compare(x, y) != 0; } inline int operator <(char * x, const subString& y) { return compare(x, y) < 0; } inline int operator >(char * x, const subString& y) { return compare(x, y) > 0; } inline int operator <=(char * x, const subString& y) { return compare(x, y) <= 0; } inline int operator >=(char * x, const subString& y) { return compare(x, y) >= 0; }
inline int operator ==(char x, const string& y) { return compare(x, y) == 0; } inline int operator !=(char x, const string& y) { return compare(x, y) != 0; } inline int operator <(char x, const string& y) { return compare(x, y) < 0; } inline int operator >(char x, const string& y) { return compare(x, y) > 0; } inline int operator <=(char x, const string& y) { return compare(x, y) <= 0; } inline int operator >=(char x, const string& y) { return compare(x, y) >= 0; }
inline int operator ==(char x, const subString& y) { return compare(x, y) == 0; } inline int operator !=(char x, const subString& y) { return compare(x, y) != 0; } inline int operator <(char x, const subString& y) { return compare(x, y) < 0; } inline int operator >(char x, const subString& y) { return compare(x, y) > 0; } inline int operator <=(char x, const subString& y) { return compare(x, y) <= 0; } inline int operator >=(char x, const subString& y) { return compare(x, y) >= 0; }
inline subString string::_substr(int first, int len)
{
if (first < 0 || len <= 0 || (unsigned)(first + len) > length())
return subString(_nilstring, 0, 0);
else
return subString(*this, first, len);
}
inline const subString string::_substr(int first, int len) const
{
if (first < 0 || len <= 0 || (unsigned)(first + len) > length())
return subString(_nilstring, 0, 0);
else
return subString(*this, first, len);
}
# 30 "/home/st/andreas/ddd/ddd/session.C" 2
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/fstream.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/fstream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_istream.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ostream.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_file.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_file.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_file.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_ios.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_file.h" 2 3
namespace std
{
template<typename _CharT>
struct __basic_file_base: public __c_file_type
{
virtual
~__basic_file_base() { };
virtual int
overflow(int __c = (-1)) = 0;
virtual int
underflow() = 0;
virtual int
uflow() = 0;
virtual int
pbackfail(int __c) = 0;
virtual streamsize
xsputn(const _CharT* __s, streamsize __n) = 0;
virtual streamsize
xsgetn(_CharT* __s, streamsize __n) = 0;
virtual streamoff
seekoff(streamoff __off, ios_base::seekdir __way,
ios_base::openmode __mode = ios_base::in | ios_base::out) = 0;
virtual streamoff
seekpos(streamoff __pos,
ios_base::openmode __mode = ios_base::in | ios_base::out) = 0;
virtual streambuf*
setbuf(_CharT* __b, int __len) = 0;
virtual int
sync() = 0;
virtual int
doallocate() = 0;
virtual streamsize
sys_read(_CharT* __s, streamsize __n) = 0;
virtual streamsize
sys_write(const _CharT* __s, streamsize __n) = 0;
virtual streamoff
sys_seek(streamoff __off, ios_base::seekdir __way) = 0;
virtual int
sys_close() = 0;
virtual int
sys_stat(void* __v) = 0;
virtual int
showmanyc() = 0;
virtual void
imbue(void* __v) = 0;
};
template<typename _CharT>
class __basic_file
{
int _M_fileno;
__c_file_type* _M_cfile;
public:
__basic_file(__c_lock* __lock = 0);
void
_M_open_mode(ios_base::openmode __mode, int& __p_mode, int& __rw_mode,
char* __c_mode);
__basic_file*
open(const char* __name, ios_base::openmode __mode, int __prot = 0664);
__basic_file*
sys_open(int __fd, ios_base::openmode __mode);
__basic_file*
close();
bool
is_open();
int get_fileno(void);
virtual
~__basic_file();
virtual int
overflow(int __c = (-1));
virtual int
underflow();
virtual int
uflow();
virtual int
pbackfail(int __c);
virtual streamsize
xsputn(const _CharT* __s, streamsize __n);
virtual streamsize
xsgetn(_CharT* __s, streamsize __n);
virtual streamoff
seekoff(streamoff __off, ios_base::seekdir __way,
ios_base::openmode __mode = ios_base::in | ios_base::out);
virtual streamoff
seekpos(streamoff __pos,
ios_base::openmode __mode = ios_base::in | ios_base::out);
virtual streambuf*
setbuf(_CharT* __b, int __len);
virtual int
sync();
virtual int
doallocate();
virtual streamsize
sys_read(_CharT* __s, streamsize __n);
virtual streamsize
sys_write(const _CharT* __s, streamsize __n);
virtual streamoff
sys_seek(streamoff __off, ios_base::seekdir __way);
virtual int
sys_close();
virtual int
sys_stat(void* __v);
virtual int
showmanyc();
virtual void
imbue(void* __v);
};
}
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/basic_file_model.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/basic_file_model.h" 3
# 1 "/usr/include/unistd.h" 1 3
# 26 "/usr/include/unistd.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/unistd.h" 2 3
extern "C" {
# 175 "/usr/include/unistd.h" 3
# 1 "/usr/include/bits/posix_opt.h" 1 3
# 176 "/usr/include/unistd.h" 2 3
# 1 "/usr/include/bits/environments.h" 1 3
# 23 "/usr/include/bits/environments.h" 3
# 1 "/usr/include/bits/wordsize.h" 1 3
# 24 "/usr/include/bits/environments.h" 2 3
# 180 "/usr/include/unistd.h" 2 3
# 190 "/usr/include/unistd.h" 3
# 1 "/usr/include/bits/types.h" 1 3
# 191 "/usr/include/unistd.h" 2 3
# 199 "/usr/include/unistd.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 200 "/usr/include/unistd.h" 2 3
# 235 "/usr/include/unistd.h" 3
typedef __intptr_t intptr_t;
# 248 "/usr/include/unistd.h" 3
extern int access (__const char *__name, int __type) throw ();
extern int euidaccess (__const char *__name, int __type) throw ();
# 277 "/usr/include/unistd.h" 3
extern __off_t __lseek (int __fd, __off_t __offset, int __whence) throw ();
extern __off_t lseek (int __fd, __off_t __offset, int __whence) throw ();
# 291 "/usr/include/unistd.h" 3
extern __off64_t lseek64 (int __fd, __off64_t __offset, int __whence) throw ();
extern int __close (int __fd) throw ();
extern int close (int __fd) throw ();
extern ssize_t __read (int __fd, void * __buf, size_t __nbytes) throw ();
extern ssize_t read (int __fd, void * __buf, size_t __nbytes) throw ();
extern ssize_t __write (int __fd, __const void * __buf, size_t __n) throw ();
extern ssize_t write (int __fd, __const void * __buf, size_t __n) throw ();
extern ssize_t __pread64 (int __fd, void * __buf, size_t __nbytes, __off64_t __offset) throw ();
extern ssize_t __pwrite64 (int __fd, __const void * __buf, size_t __n, __off64_t __offset) throw ();
extern ssize_t pread (int __fd, void * __buf, size_t __nbytes, __off_t __offset) throw ();
extern ssize_t pwrite (int __fd, __const void * __buf, size_t __n, __off_t __offset) throw ();
# 338 "/usr/include/unistd.h" 3
extern ssize_t pread64 (int __fd, void * __buf, size_t __nbytes, __off64_t __offset) throw ();
extern ssize_t pwrite64 (int __fd, __const void * __buf, size_t __n, __off64_t __offset) throw ();
# 349 "/usr/include/unistd.h" 3
extern int pipe (int __pipedes[2]) throw ();
# 358 "/usr/include/unistd.h" 3
extern unsigned int alarm (unsigned int __seconds) throw ();
# 367 "/usr/include/unistd.h" 3
extern unsigned int sleep (unsigned int __seconds) throw ();
extern unsigned int ualarm (unsigned int __value, unsigned int __interval) throw ();
extern void usleep (unsigned int __useconds) throw ();
extern int pause (void) throw ();
extern int chown (__const char *__file, __uid_t __owner, __gid_t __group) throw ();
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 ();
extern int chdir (__const char *__path) throw ();
extern int fchdir (int __fd) throw ();
# 419 "/usr/include/unistd.h" 3
extern char *getcwd (char *__buf, size_t __size) throw ();
extern char *get_current_dir_name (void) throw ();
extern char *getwd (char *__buf) throw ();
extern int dup (int __fd) throw ();
extern int dup2 (int __fd, int __fd2) throw ();
extern char **__environ;
extern char **environ;
extern int execve (__const char *__path, char *__const __argv[], char *__const __envp[]) throw ();
extern int fexecve (int __fd, char *__const __argv[], char *__const __envp[]) throw ();
extern int execv (__const char *__path, char *__const __argv[]) throw ();
extern int execle (__const char *__path, __const char *__arg, ...) throw ();
extern int execl (__const char *__path, __const char *__arg, ...) throw ();
extern int execvp (__const char *__file, char *__const __argv[]) throw ();
extern int execlp (__const char *__file, __const char *__arg, ...) throw ();
extern int nice (int __inc) throw ();
extern void _exit (int __status) __attribute__ ((__noreturn__));
# 1 "/usr/include/bits/confname.h" 1 3
# 25 "/usr/include/bits/confname.h" 3
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
};
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_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
};
enum
{
_CS_PATH
,
_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
};
# 498 "/usr/include/unistd.h" 2 3
extern long int pathconf (__const char *__path, int __name) throw ();
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 getpid (void) throw ();
extern __pid_t getppid (void) throw ();
extern __pid_t getpgrp (void) throw ();
# 534 "/usr/include/unistd.h" 3
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 ();
extern int setpgid (__pid_t __pid, __pid_t __pgid) throw ();
# 561 "/usr/include/unistd.h" 3
extern int setpgrp (void) throw ();
# 579 "/usr/include/unistd.h" 3
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 __pid_t __fork (void) 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 ();
extern int isatty (int __fd) throw ();
extern int ttyslot (void) throw ();
extern int link (__const char *__from, __const char *__to) throw ();
extern int symlink (__const char *__from, __const char *__to) throw ();
extern int readlink (__const char *__path, char *__buf, size_t __len) throw ();
extern int unlink (__const char *__name) throw ();
extern int rmdir (__const char *__path) throw ();
extern __pid_t tcgetpgrp (int __fd) throw ();
extern int tcsetpgrp (int __fd, __pid_t __pgrp_id) throw ();
extern char *getlogin (void) throw ();
# 715 "/usr/include/unistd.h" 3
extern int setlogin (__const char *__name) throw ();
# 724 "/usr/include/unistd.h" 3
# 1 "/usr/include/getopt.h" 1 3
# 27 "/usr/include/getopt.h" 3
extern "C" {
# 36 "/usr/include/getopt.h" 3
extern char *optarg;
# 50 "/usr/include/getopt.h" 3
extern int optind;
extern int opterr;
extern int optopt;
# 134 "/usr/include/getopt.h" 3
extern int getopt (int __argc, char *const *__argv, const char *__shortopts);
# 163 "/usr/include/getopt.h" 3
}
# 725 "/usr/include/unistd.h" 2 3
# 733 "/usr/include/unistd.h" 3
extern int gethostname (char *__name, size_t __len) throw ();
extern int sethostname (__const char *__name, size_t __len) throw ();
extern int sethostid (long int __id) throw ();
extern int getdomainname (char *__name, size_t __len) throw ();
extern int setdomainname (__const char *__name, size_t __len) throw ();
extern int fsync (int __fd) throw ();
extern int vhangup (void) throw ();
extern int revoke (__const char *__file) throw ();
extern int profil (unsigned short int *__sample_buffer, size_t __size, size_t __offset, unsigned int __scale) throw ();
extern int acct (__const char *__name) throw ();
extern int chroot (__const char *__path) throw ();
extern char *getusershell (void) throw ();
extern void endusershell (void) throw ();
extern void setusershell (void) throw ();
extern char *getpass (__const char *__prompt) throw ();
extern int daemon (int __nochdir, int __noclose) throw ();
extern long int gethostid (void) throw ();
extern int sync (void) throw ();
extern int __getpagesize (void) throw () __attribute__ ((__const__));
extern int getpagesize (void) throw () __attribute__ ((__const__));
extern int truncate (__const char *__file, __off_t __length) throw ();
# 829 "/usr/include/unistd.h" 3
extern int truncate64 (__const char *__file, __off64_t __length) throw ();
extern int __ftruncate (int __fd, __off_t __length) throw ();
extern int ftruncate (int __fd, __off_t __length) throw ();
# 845 "/usr/include/unistd.h" 3
extern int ftruncate64 (int __fd, __off64_t __length) throw ();
extern int getdtablesize (void) throw ();
# 860 "/usr/include/unistd.h" 3
extern int brk (void * __addr) throw ();
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 864 "/usr/include/unistd.h" 2 3
extern void * __sbrk (ptrdiff_t __delta) throw ();
extern void * sbrk (ptrdiff_t __delta) throw ();
# 885 "/usr/include/unistd.h" 3
extern long int syscall (long int __sysno, ...) throw ();
# 905 "/usr/include/unistd.h" 3
extern int lockf (int __fd, int __cmd, __off_t __len) throw ();
# 915 "/usr/include/unistd.h" 3
extern int lockf64 (int __fd, int __cmd, __off64_t __len) throw ();
# 938 "/usr/include/unistd.h" 3
extern int __libc_enable_secure;
extern int fdatasync (int __fildes) throw ();
extern char *crypt (__const char *__key, __const char *__salt) throw ();
extern void setkey (__const char *__key) throw ();
extern void encrypt (char *__block, int __edflag) throw ();
extern void swab (__const void * __from, void * __to, ssize_t __n) throw ();
extern char *ctermid (char *__s) throw ();
extern char *cuserid (char *__s) throw ();
extern int rename (__const char *__old, __const char *__new) throw ();
# 999 "/usr/include/unistd.h" 3
extern int pthread_atfork (void (*__prepare) (void), void (*__parent) (void), void (*__child) (void)) throw ();
}
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/basic_file_model.h" 2 3
namespace std
{
template<typename _CharT>
__basic_file<_CharT>::__basic_file(__c_lock* )
: _M_fileno(-1), _M_cfile(__null) { }
template<typename _CharT>
int
__basic_file<_CharT>::get_fileno(void)
{ return _M_fileno; }
template<typename _CharT>
__basic_file<_CharT>::~__basic_file()
{
if (this->is_open())
{
fflush(_M_cfile);
this->close();
}
}
template<typename _CharT>
void
__basic_file<_CharT>::_M_open_mode(ios_base::openmode __mode,
int& , int& ,
char* __c_mode)
{
bool __testb = __mode & ios_base::binary;
bool __testi = __mode & ios_base::in;
bool __testo = __mode & ios_base::out;
bool __testt = __mode & ios_base::trunc;
bool __testa = __mode & ios_base::app;
if (!__testi && __testo && !__testt && !__testa)
strcpy(__c_mode, "w");
if (!__testi && __testo && !__testt && __testa)
strcpy(__c_mode, "a");
if (!__testi && __testo && __testt && !__testa)
strcpy(__c_mode, "w");
if (__testi && !__testo && !__testt && !__testa)
strcpy(__c_mode, "r");
if (__testi && __testo && !__testt && !__testa)
strcpy(__c_mode, "r+");
if (__testi && __testo && __testt && !__testa)
strcpy(__c_mode, "w+");
if (__testb)
strcat(__c_mode, "b");
}
template<typename _CharT>
__basic_file<_CharT>*
__basic_file<_CharT>::sys_open(int __fd, ios_base::openmode __mode)
{
__basic_file* __ret = __null;
int __p_mode = 0;
int __rw_mode = 0;
char __c_mode[4];
_M_open_mode(__mode, __p_mode, __rw_mode, __c_mode);
int __dupfd = dup(__fd);
if (__dupfd != -1 && !this->is_open())
{
if ((_M_cfile = fdopen(__dupfd, __c_mode)))
{
_M_fileno = __dupfd;
__ret = this;
}
}
return __ret;
}
template<typename _CharT>
__basic_file<_CharT>*
__basic_file<_CharT>::open(const char* __name, ios_base::openmode __mode,
int )
{
__basic_file* __ret = __null;
int __p_mode = 0;
int __rw_mode = 0;
char __c_mode[4];
_M_open_mode(__mode, __p_mode, __rw_mode, __c_mode);
if (!this->is_open())
{
if ((_M_cfile = fopen(__name, __c_mode)))
{
_M_fileno = fileno(_M_cfile);
__ret = this;
}
}
return __ret;
}
template<typename _CharT>
bool
__basic_file<_CharT>::is_open() { return _M_fileno >= 0; }
template<typename _CharT>
__basic_file<_CharT>*
__basic_file<_CharT>::close()
{
__basic_file* __retval = static_cast<__basic_file*>(__null);
bool __testopen = fclose(_M_cfile);
if (!__testopen)
{
__retval = this;
_M_fileno = -1;
}
return __retval;
}
template<typename _CharT>
streamsize
__basic_file<_CharT>::xsgetn(_CharT* __s, streamsize __n)
{ return fread(__s, 1, __n, _M_cfile); }
template<typename _CharT>
streamsize
__basic_file<_CharT>::xsputn(const _CharT* __s, streamsize __n)
{ return fwrite(__s, 1, __n, _M_cfile); }
template<typename _CharT>
streamoff
__basic_file<_CharT>::seekoff(streamoff __off, ios_base::seekdir __way,
ios_base::openmode )
{ fseek(_M_cfile, __off, __way); return ftell(_M_cfile); }
template<typename _CharT>
streamoff
__basic_file<_CharT>::seekpos(streamoff __pos,
ios_base::openmode )
{ fseek(_M_cfile, __pos, ios_base::beg); return ftell(_M_cfile); }
template<typename _CharT>
int
__basic_file<_CharT>::sync()
{ return fflush(_M_cfile); }
template<typename _CharT>
int
__basic_file<_CharT>::overflow(int )
{ return (-1); }
template<typename _CharT>
int
__basic_file<_CharT>::underflow()
{ return (-1); }
template<typename _CharT>
int
__basic_file<_CharT>::uflow()
{ return (-1); }
template<typename _CharT>
int
__basic_file<_CharT>::pbackfail(int )
{ return (-1); }
template<typename _CharT>
streambuf*
__basic_file<_CharT>::setbuf(_CharT* , int )
{ return reinterpret_cast<streambuf*>(this); }
template<typename _CharT>
int
__basic_file<_CharT>::doallocate()
{ return (-1); }
template<typename _CharT>
streamsize
__basic_file<_CharT>::sys_read(_CharT* __s, streamsize __n)
{ return fread(__s, 1, __n, _M_cfile); }
template<typename _CharT>
streamsize
__basic_file<_CharT>::sys_write(const _CharT* __s, streamsize __n)
{ return fwrite(__s, 1, __n, _M_cfile); }
template<typename _CharT>
streamoff
__basic_file<_CharT>::sys_seek(streamoff __pos, ios_base::seekdir __way)
{
fseek(_M_cfile, __pos, __way);
return ftell(_M_cfile);
}
template<typename _CharT>
int
__basic_file<_CharT>::sys_close()
{ return fclose(_M_cfile); }
template<typename _CharT>
int
__basic_file<_CharT>::sys_stat(void* )
{ return (-1); }
template<typename _CharT>
int
__basic_file<_CharT>::showmanyc()
{ return (-1); }
template<typename _CharT>
void
__basic_file<_CharT>::imbue(void* ) { }
}
# 247 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/basic_file.h" 2 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_locale.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_locale.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/localefwd.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_locale.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_locale.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cerrno.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cerrno.h" 3
# 1 "/usr/include/errno.h" 1 3
# 29 "/usr/include/errno.h" 3
# 1 "/usr/include/features.h" 1 3
# 30 "/usr/include/errno.h" 2 3
extern "C" {
# 1 "/usr/include/bits/errno.h" 1 3
# 25 "/usr/include/bits/errno.h" 3
# 1 "/usr/include/linux/errno.h" 1 3
# 1 "/usr/include/asm/errno.h" 1 3
# 5 "/usr/include/linux/errno.h" 2 3
# 26 "/usr/include/bits/errno.h" 2 3
# 36 "/usr/include/bits/errno.h" 3
extern int errno;
extern int *__errno_location (void) throw () __attribute__ ((__const__));
# 37 "/usr/include/errno.h" 2 3
# 55 "/usr/include/errno.h" 3
extern char *program_invocation_name, *program_invocation_short_name;
}
# 69 "/usr/include/errno.h" 3
typedef int error_t;
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cerrno.h" 2 3
namespace std
{
extern "C" int (*__errno_location ());
}
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_clocale.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_clocale.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++config.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_clocale.h" 2 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_clocale.h" 3
# 1 "/usr/include/locale.h" 1 3
# 26 "/usr/include/locale.h" 3
# 1 "/usr/include/features.h" 1 3
# 27 "/usr/include/locale.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include/stddef.h" 1 3
# 30 "/usr/include/locale.h" 2 3
extern "C" {
# 45 "/usr/include/locale.h" 3
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;
};
extern char *setlocale (int __category, __const char *__locale) throw ();
extern struct lconv *localeconv (void) throw ();
# 109 "/usr/include/locale.h" 3
# 1 "/usr/include/xlocale.h" 1 3
# 110 "/usr/include/locale.h" 2 3
extern __locale_t __newlocale (int __category_mask, __const char *__locale, __locale_t __base) throw ();
extern __locale_t __duplocale (__locale_t __dataset) throw ();
extern void __freelocale (__locale_t __dataset) throw ();
}
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_clocale.h" 2 3
namespace std
{
using ::lconv;
extern "C" char* setlocale(int, const char*);
extern "C" struct lconv* localeconv(void);
}
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cstdlib.h" 1 3
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/std_limits.h" 1 3
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_memory.h" 1 3
# 40 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/sbuf_iter.h" 1 3
# 41 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_cctype.h" 1 3
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/typeinfo" 1 3
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/typeinfo" 3
#pragma interface "typeinfo"
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/typeinfo" 2 3
extern "C++" {
namespace __cxxabiv1
{
class __class_type_info;
}
# 52 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/typeinfo" 3
namespace std
{
class type_info
{
public:
virtual ~type_info();
private:
type_info& operator=(const type_info&);
type_info(const type_info&);
protected:
const char *__name;
protected:
explicit type_info(const char *__n): __name(__n) { }
public:
const char* name() const
{ return __name; }
# 88 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/typeinfo" 3
bool before(const type_info& __arg) const
{ return __name < __arg.__name; }
bool operator==(const type_info& __arg) const
{ return __name == __arg.__name; }
bool operator!=(const type_info& __arg) const
{ return !operator==(__arg); }
public:
virtual bool __is_pointer_p() const;
virtual bool __is_function_p() const;
virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj,
unsigned __outer) const;
virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target,
void **__obj_ptr) const;
};
class bad_cast : public exception
{
public:
bad_cast() throw() { }
virtual ~bad_cast() throw() { }
};
class bad_typeid : public exception
{
public:
bad_typeid () throw() { }
virtual ~bad_typeid () throw() { }
};
}
}
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 1 3
# 31 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception_defines.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 2 3
namespace std
{
void
__throw_bad_exception(void);
void
__throw_bad_alloc(void);
void
__throw_bad_cast(void);
void
__throw_bad_typeid(void);
void
__throw_logic_error(const char* __s);
void
__throw_domain_error(const char* __s);
void
__throw_invalid_argument(const char* __s);
void
__throw_length_error(const char* __s);
void
__throw_out_of_range(const char* __s);
void
__throw_runtime_error(const char* __s);
void
__throw_range_error(const char* __s);
void
__throw_overflow_error(const char* __s);
void
__throw_underflow_error(const char* __s);
void
__throw_ios_failure(const char* __s);
}
# 33 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_algobase.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_alloc.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_construct.h" 1 3
# 36 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_uninitialized.h" 1 3
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/exception_defines.h" 1 3
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/functexcept.h" 2 3
namespace std
{
void
__throw_bad_exception(void);
void
__throw_bad_alloc(void);
void
__throw_bad_cast(void);
void
__throw_bad_typeid(void);
void
__throw_logic_error(const char* __s);
void
__throw_domain_error(const char* __s);
void
__throw_invalid_argument(const char* __s);
void
__throw_length_error(const char* __s);
void
__throw_out_of_range(const char* __s);
void
__throw_runtime_error(const char* __s);
void
__throw_range_error(const char* __s);
void
__throw_overflow_error(const char* __s);
void
__throw_underflow_error(const char* __s);
void
__throw_ios_failure(const char* __s);
}
# 35 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/concept_checks.h" 1 3
# 37 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 2 3
namespace std {
# 54 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 3
template <class _Tp, class _Allocator, bool _IsStatic>
class _Vector_alloc_base {
public:
typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type
allocator_type;
allocator_type get_allocator() const { return _M_data_allocator; }
_Vector_alloc_base(const allocator_type& __a)
: _M_data_allocator(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)
{}
protected:
allocator_type _M_data_allocator;
_Tp* _M_start;
_Tp* _M_finish;
_Tp* _M_end_of_storage;
_Tp* _M_allocate(size_t __n)
{ return _M_data_allocator.allocate(__n); }
void _M_deallocate(_Tp* __p, size_t __n)
{ if (__p) _M_data_allocator.deallocate(__p, __n); }
};
template <class _Tp, class _Allocator>
class _Vector_alloc_base<_Tp, _Allocator, true> {
public:
typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type
allocator_type;
allocator_type get_allocator() const { return allocator_type(); }
_Vector_alloc_base(const allocator_type&)
: _M_start(0), _M_finish(0), _M_end_of_storage(0)
{}
protected:
_Tp* _M_start;
_Tp* _M_finish;
_Tp* _M_end_of_storage;
typedef typename _Alloc_traits<_Tp, _Allocator>::_Alloc_type _Alloc_type;
_Tp* _M_allocate(size_t __n)
{ return _Alloc_type::allocate(__n); }
void _M_deallocate(_Tp* __p, size_t __n)
{ _Alloc_type::deallocate(__p, __n);}
};
template <class _Tp, class _Alloc>
struct _Vector_base
: public _Vector_alloc_base<_Tp, _Alloc,
_Alloc_traits<_Tp, _Alloc>::_S_instanceless>
{
typedef _Vector_alloc_base<_Tp, _Alloc,
_Alloc_traits<_Tp, _Alloc>::_S_instanceless>
_Base;
typedef typename _Base::allocator_type allocator_type;
_Vector_base(const allocator_type& __a) : _Base(__a) {}
_Vector_base(size_t __n, const allocator_type& __a) : _Base(__a) {
_M_start = _M_allocate(__n);
_M_finish = _M_start;
_M_end_of_storage = _M_start + __n;
}
~_Vector_base() { _M_deallocate(_M_start, _M_end_of_storage - _M_start); }
};
# 156 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 3
template <class _Tp, class _Alloc = allocator<_Tp> >
class vector : protected _Vector_base<_Tp, _Alloc>
{
typedef void (* __func_Tp_Assignable)( _Tp ); template <__func_Tp_Assignable _Tp1> struct __dummy_struct__Tp_Assignable { }; static __dummy_struct__Tp_Assignable< _Assignable_concept_specification< _Tp>::_Assignable_requirement_violation> __dummy_ptr__Tp_Assignable;
private:
typedef _Vector_base<_Tp, _Alloc> _Base;
typedef vector<_Tp, _Alloc> vector_type;
public:
typedef _Tp value_type;
typedef value_type* pointer;
typedef const value_type* const_pointer;
typedef __normal_iterator<pointer, vector_type> iterator;
typedef __normal_iterator<const_pointer, vector_type> const_iterator;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef size_t size_type;
typedef ptrdiff_t difference_type;
typedef typename _Base::allocator_type allocator_type;
allocator_type get_allocator() const { return _Base::get_allocator(); }
typedef reverse_iterator<const_iterator> const_reverse_iterator;
typedef reverse_iterator<iterator> reverse_iterator;
protected:
using _Base::_M_allocate;
using _Base::_M_deallocate;
using _Base::_M_start;
using _Base::_M_finish;
using _Base::_M_end_of_storage;
protected:
void _M_insert_aux(iterator __position, const _Tp& __x);
void _M_insert_aux(iterator __position);
public:
iterator begin() { return iterator (_M_start); }
const_iterator begin() const
{ return const_iterator (_M_start); }
iterator end() { return iterator (_M_finish); }
const_iterator end() const { return const_iterator (_M_finish); }
reverse_iterator rbegin()
{ return reverse_iterator(end()); }
const_reverse_iterator rbegin() const
{ return const_reverse_iterator(end()); }
reverse_iterator rend()
{ return reverse_iterator(begin()); }
const_reverse_iterator rend() const
{ return const_reverse_iterator(begin()); }
size_type size() const
{ return size_type(end() - begin()); }
size_type max_size() const
{ return size_type(-1) / sizeof(_Tp); }
size_type capacity() const
{ return size_type(const_iterator(_M_end_of_storage) - begin()); }
bool empty() const
{ return begin() == end(); }
reference operator[](size_type __n) { return *(begin() + __n); }
const_reference operator[](size_type __n) const { return *(begin() + __n); }
void _M_range_check(size_type __n) const {
if (__n >= this->size())
__throw_out_of_range("vector");
}
reference at(size_type __n)
{ _M_range_check(__n); return (*this)[__n]; }
const_reference at(size_type __n) const
{ _M_range_check(__n); return (*this)[__n]; }
explicit vector(const allocator_type& __a = allocator_type())
: _Base(__a) {}
vector(size_type __n, const _Tp& __value,
const allocator_type& __a = allocator_type())
: _Base(__n, __a)
{ _M_finish = uninitialized_fill_n(_M_start, __n, __value); }
explicit vector(size_type __n)
: _Base(__n, allocator_type())
{ _M_finish = uninitialized_fill_n(_M_start, __n, _Tp()); }
vector(const vector<_Tp, _Alloc>& __x)
: _Base(__x.size(), __x.get_allocator())
{ _M_finish = uninitialized_copy(__x.begin(), __x.end(), _M_start); }
template <class _InputIterator>
vector(_InputIterator __first, _InputIterator __last,
const allocator_type& __a = allocator_type()) : _Base(__a) {
typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
_M_initialize_aux(__first, __last, _Integral());
}
template <class _Integer>
void _M_initialize_aux(_Integer __n, _Integer __value, __true_type) {
_M_start = _M_allocate(__n);
_M_end_of_storage = _M_start + __n;
_M_finish = uninitialized_fill_n(_M_start, __n, __value);
}
template <class _InputIterator>
void _M_initialize_aux(_InputIterator __first, _InputIterator __last,
__false_type) {
_M_range_initialize(__first, __last, __iterator_category(__first));
}
# 288 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 3
~vector() { destroy(_M_start, _M_finish); }
vector<_Tp, _Alloc>& operator=(const vector<_Tp, _Alloc>& __x);
void reserve(size_type __n) {
if (capacity() < __n) {
const size_type __old_size = size();
pointer __tmp = _M_allocate_and_copy(__n, _M_start, _M_finish);
destroy(_M_start, _M_finish);
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __tmp;
_M_finish = __tmp + __old_size;
_M_end_of_storage = _M_start + __n;
}
}
void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); }
void _M_fill_assign(size_type __n, const _Tp& __val);
template <class _InputIterator>
void assign(_InputIterator __first, _InputIterator __last) {
typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
_M_assign_dispatch(__first, __last, _Integral());
}
template <class _Integer>
void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
{ _M_fill_assign((size_type) __n, (_Tp) __val); }
template <class _InputIter>
void _M_assign_dispatch(_InputIter __first, _InputIter __last, __false_type)
{ _M_assign_aux(__first, __last, __iterator_category(__first)); }
template <class _InputIterator>
void _M_assign_aux(_InputIterator __first, _InputIterator __last,
input_iterator_tag);
template <class _ForwardIterator>
void _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
forward_iterator_tag);
reference front() { return *begin(); }
const_reference front() const { return *begin(); }
reference back() { return *(end() - 1); }
const_reference back() const { return *(end() - 1); }
void push_back(const _Tp& __x) {
if (_M_finish != _M_end_of_storage) {
construct(_M_finish, __x);
++_M_finish;
}
else
_M_insert_aux(end(), __x);
}
void push_back() {
if (_M_finish != _M_end_of_storage) {
construct(_M_finish);
++_M_finish;
}
else
_M_insert_aux(end());
}
void swap(vector<_Tp, _Alloc>& __x) {
std::swap(_M_start, __x._M_start);
std::swap(_M_finish, __x._M_finish);
std::swap(_M_end_of_storage, __x._M_end_of_storage);
}
iterator insert(iterator __position, const _Tp& __x) {
size_type __n = __position - begin();
if (_M_finish != _M_end_of_storage && __position == end()) {
construct(_M_finish, __x);
++_M_finish;
}
else
_M_insert_aux(iterator(__position), __x);
return begin() + __n;
}
iterator insert(iterator __position) {
size_type __n = __position - begin();
if (_M_finish != _M_end_of_storage && __position == end()) {
construct(_M_finish);
++_M_finish;
}
else
_M_insert_aux(iterator(__position));
return begin() + __n;
}
template <class _InputIterator>
void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
_M_insert_dispatch(__pos, __first, __last, _Integral());
}
template <class _Integer>
void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
__true_type)
{ _M_fill_insert(__pos, (size_type) __n, (_Tp) __val); }
template <class _InputIterator>
void _M_insert_dispatch(iterator __pos,
_InputIterator __first, _InputIterator __last,
__false_type) {
_M_range_insert(__pos, __first, __last, __iterator_category(__first));
}
void insert (iterator __pos, size_type __n, const _Tp& __x)
{ _M_fill_insert(__pos, __n, __x); }
void _M_fill_insert (iterator __pos, size_type __n, const _Tp& __x);
void pop_back() {
--_M_finish;
destroy(_M_finish);
}
iterator erase(iterator __position) {
if (__position + 1 != end())
copy(__position + 1, end(), __position);
--_M_finish;
destroy(_M_finish);
return __position;
}
iterator erase(iterator __first, iterator __last) {
iterator __i(copy(__last, end(), __first));
destroy(__i, end());
_M_finish = _M_finish - (__last - __first);
return __first;
}
void resize(size_type __new_size, const _Tp& __x) {
if (__new_size < size())
erase(begin() + __new_size, end());
else
insert(end(), __new_size - size(), __x);
}
void resize(size_type __new_size) { resize(__new_size, _Tp()); }
void clear() { erase(begin(), end()); }
protected:
template <class _ForwardIterator>
pointer _M_allocate_and_copy(size_type __n, _ForwardIterator __first,
_ForwardIterator __last)
{
pointer __result = _M_allocate(__n);
try {
uninitialized_copy(__first, __last, __result);
return __result;
}
catch(...) { _M_deallocate(__result, __n); throw; };
}
# 469 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 3
template <class _InputIterator>
void _M_range_initialize(_InputIterator __first,
_InputIterator __last, input_iterator_tag)
{
for ( ; __first != __last; ++__first)
push_back(*__first);
}
template <class _ForwardIterator>
void _M_range_initialize(_ForwardIterator __first,
_ForwardIterator __last, forward_iterator_tag)
{
size_type __n = 0;
distance(__first, __last, __n);
_M_start = _M_allocate(__n);
_M_end_of_storage = _M_start + __n;
_M_finish = uninitialized_copy(__first, __last, _M_start);
}
template <class _InputIterator>
void _M_range_insert(iterator __pos,
_InputIterator __first, _InputIterator __last,
input_iterator_tag);
template <class _ForwardIterator>
void _M_range_insert(iterator __pos,
_ForwardIterator __first, _ForwardIterator __last,
forward_iterator_tag);
};
template <class _Tp, class _Alloc>
inline bool
operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
{
return __x.size() == __y.size() &&
equal(__x.begin(), __x.end(), __y.begin());
}
template <class _Tp, class _Alloc>
inline bool
operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
{
return lexicographical_compare(__x.begin(), __x.end(),
__y.begin(), __y.end());
}
template <class _Tp, class _Alloc>
inline void swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)
{
__x.swap(__y);
}
template <class _Tp, class _Alloc>
inline bool
operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
return !(__x == __y);
}
template <class _Tp, class _Alloc>
inline bool
operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
return __y < __x;
}
template <class _Tp, class _Alloc>
inline bool
operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
return !(__y < __x);
}
template <class _Tp, class _Alloc>
inline bool
operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
return !(__x < __y);
}
template <class _Tp, class _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());
destroy(_M_start, _M_finish);
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __tmp;
_M_end_of_storage = _M_start + __xlen;
}
else if (size() >= __xlen) {
iterator __i(copy(__x.begin(), __x.end(), begin()));
destroy(__i, end());
}
else {
copy(__x.begin(), __x.begin() + size(), _M_start);
uninitialized_copy(__x.begin() + size(), __x.end(), _M_finish);
}
_M_finish = _M_start + __xlen;
}
return *this;
}
template <class _Tp, class _Alloc>
void vector<_Tp, _Alloc>::_M_fill_assign(size_t __n, const value_type& __val)
{
if (__n > capacity()) {
vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator());
__tmp.swap(*this);
}
else if (__n > size()) {
fill(begin(), end(), __val);
_M_finish = uninitialized_fill_n(_M_finish, __n - size(), __val);
}
else
erase(fill_n(begin(), __n, __val), end());
}
template <class _Tp, class _Alloc> template <class _InputIter>
void vector<_Tp, _Alloc>::_M_assign_aux(_InputIter __first, _InputIter __last,
input_iterator_tag) {
iterator __cur(begin());
for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
*__cur = *__first;
if (__first == __last)
erase(__cur, end());
else
insert(end(), __first, __last);
}
template <class _Tp, class _Alloc> template <class _ForwardIter>
void
vector<_Tp, _Alloc>::_M_assign_aux(_ForwardIter __first, _ForwardIter __last,
forward_iterator_tag) {
size_type __len = 0;
distance(__first, __last, __len);
if (__len > capacity()) {
pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
destroy(_M_start, _M_finish);
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __tmp;
_M_end_of_storage = _M_finish = _M_start + __len;
}
else if (size() >= __len) {
iterator __new_finish(copy(__first, __last, _M_start));
destroy(__new_finish, end());
_M_finish = __new_finish.base();
}
else {
_ForwardIter __mid = __first;
advance(__mid, size());
copy(__first, __mid, _M_start);
_M_finish = uninitialized_copy(__mid, __last, _M_finish);
}
}
template <class _Tp, class _Alloc>
void
vector<_Tp, _Alloc>::_M_insert_aux(iterator __position, const _Tp& __x)
{
if (_M_finish != _M_end_of_storage) {
construct(_M_finish, *(_M_finish - 1));
++_M_finish;
_Tp __x_copy = __x;
copy_backward(__position, iterator(_M_finish - 2), iterator(_M_finish- 1));
*__position = __x_copy;
}
else {
const size_type __old_size = size();
const size_type __len = __old_size != 0 ? 2 * __old_size : 1;
iterator __new_start(_M_allocate(__len));
iterator __new_finish(__new_start);
try {
__new_finish = uninitialized_copy(iterator(_M_start), __position,
__new_start);
construct(__new_finish.base(), __x);
++__new_finish;
__new_finish = uninitialized_copy(__position, iterator(_M_finish),
__new_finish);
}
catch(...) { (destroy(__new_start,__new_finish), _M_deallocate(__new_start.base(),__len)); throw; };
destroy(begin(), end());
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __new_start.base();
_M_finish = __new_finish.base();
_M_end_of_storage = __new_start.base() + __len;
}
}
template <class _Tp, class _Alloc>
void
vector<_Tp, _Alloc>::_M_insert_aux(iterator __position)
{
if (_M_finish != _M_end_of_storage) {
construct(_M_finish, *(_M_finish - 1));
++_M_finish;
copy_backward(__position, iterator(_M_finish - 2),
iterator(_M_finish - 1));
*__position = _Tp();
}
else {
const size_type __old_size = size();
const size_type __len = __old_size != 0 ? 2 * __old_size : 1;
pointer __new_start = _M_allocate(__len);
pointer __new_finish = __new_start;
try {
__new_finish = uninitialized_copy(iterator(_M_start), __position,
__new_start);
construct(__new_finish);
++__new_finish;
__new_finish = uninitialized_copy(__position, iterator(_M_finish),
__new_finish);
}
catch(...) { (destroy(__new_start,__new_finish), _M_deallocate(__new_start,__len)); throw; };
destroy(begin(), end());
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __new_start;
_M_finish = __new_finish;
_M_end_of_storage = __new_start + __len;
}
}
template <class _Tp, class _Alloc>
void vector<_Tp, _Alloc>::_M_fill_insert(iterator __position, size_type __n,
const _Tp& __x)
{
if (__n != 0) {
if (size_type(_M_end_of_storage - _M_finish) >= __n) {
_Tp __x_copy = __x;
const size_type __elems_after = end() - __position;
iterator __old_finish(_M_finish);
if (__elems_after > __n) {
uninitialized_copy(_M_finish - __n, _M_finish, _M_finish);
_M_finish += __n;
copy_backward(__position, __old_finish - __n, __old_finish);
fill(__position, __position + __n, __x_copy);
}
else {
uninitialized_fill_n(_M_finish, __n - __elems_after, __x_copy);
_M_finish += __n - __elems_after;
uninitialized_copy(__position, __old_finish, _M_finish);
_M_finish += __elems_after;
fill(__position, __old_finish, __x_copy);
}
}
else {
const size_type __old_size = size();
const size_type __len = __old_size + max(__old_size, __n);
iterator __new_start(_M_allocate(__len));
iterator __new_finish(__new_start);
try {
__new_finish = uninitialized_copy(begin(), __position, __new_start);
__new_finish = uninitialized_fill_n(__new_finish, __n, __x);
__new_finish
= uninitialized_copy(__position, end(), __new_finish);
}
catch(...) { (destroy(__new_start,__new_finish), _M_deallocate(__new_start.base(),__len)); throw; };
destroy(_M_start, _M_finish);
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __new_start.base();
_M_finish = __new_finish.base();
_M_end_of_storage = __new_start.base() + __len;
}
}
}
template <class _Tp, class _Alloc> template <class _InputIterator>
void
vector<_Tp, _Alloc>::_M_range_insert(iterator __pos,
_InputIterator __first,
_InputIterator __last,
input_iterator_tag)
{
for ( ; __first != __last; ++__first) {
__pos = insert(__pos, *__first);
++__pos;
}
}
template <class _Tp, class _Alloc> template <class _ForwardIterator>
void
vector<_Tp, _Alloc>::_M_range_insert(iterator __position,
_ForwardIterator __first,
_ForwardIterator __last,
forward_iterator_tag)
{
if (__first != __last) {
size_type __n = 0;
distance(__first, __last, __n);
if (size_type(_M_end_of_storage - _M_finish) >= __n) {
const size_type __elems_after = end() - __position;
iterator __old_finish(_M_finish);
if (__elems_after > __n) {
uninitialized_copy(_M_finish - __n, _M_finish, _M_finish);
_M_finish += __n;
copy_backward(__position, __old_finish - __n, __old_finish);
copy(__first, __last, __position);
}
else {
_ForwardIterator __mid = __first;
advance(__mid, __elems_after);
uninitialized_copy(__mid, __last, _M_finish);
_M_finish += __n - __elems_after;
uninitialized_copy(__position, __old_finish, _M_finish);
_M_finish += __elems_after;
copy(__first, __mid, __position);
}
}
else {
const size_type __old_size = size();
const size_type __len = __old_size + max(__old_size, __n);
iterator __new_start(_M_allocate(__len));
iterator __new_finish(__new_start);
try {
__new_finish = uninitialized_copy(iterator(_M_start),
__position, __new_start);
__new_finish = uninitialized_copy(__first, __last, __new_finish);
__new_finish
= uninitialized_copy(__position, iterator(_M_finish), __new_finish);
}
catch(...) { (destroy(__new_start,__new_finish), _M_deallocate(__new_start.base(),__len)); throw; };
destroy(_M_start, _M_finish);
_M_deallocate(_M_start, _M_end_of_storage - _M_start);
_M_start = __new_start.base();
_M_finish = __new_finish.base();
_M_end_of_storage = __new_start.base() + __len;
}
}
}
# 873 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 3
}
# 38 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 1 3
# 34 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
namespace std {
static const int __WORD_BIT = int(8*sizeof(unsigned int));
struct _Bit_reference {
unsigned int* _M_p;
unsigned int _M_mask;
_Bit_reference(unsigned int* __x, unsigned int __y)
: _M_p(__x), _M_mask(__y) {}
public:
_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; }
};
inline void swap(_Bit_reference __x, _Bit_reference __y)
{
bool __tmp = __x;
__x = __y;
__y = __tmp;
}
struct _Bit_iterator_base : public random_access_iterator<bool, ptrdiff_t>
{
unsigned int* _M_p;
unsigned int _M_offset;
_Bit_iterator_base(unsigned int* __x, unsigned int __y)
: _M_p(__x), _M_offset(__y) {}
void _M_bump_up() {
if (_M_offset++ == __WORD_BIT - 1) {
_M_offset = 0;
++_M_p;
}
}
void _M_bump_down() {
if (_M_offset-- == 0) {
_M_offset = __WORD_BIT - 1;
--_M_p;
}
}
void _M_incr(ptrdiff_t __i) {
difference_type __n = __i + _M_offset;
_M_p += __n / __WORD_BIT;
__n = __n % __WORD_BIT;
if (__n < 0) {
_M_offset = (unsigned int) __n + __WORD_BIT;
--_M_p;
} else
_M_offset = (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 __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(unsigned int* __x, unsigned int __y)
: _Bit_iterator_base(__x, __y) {}
reference operator*() const { return reference(_M_p, 1U << _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) { 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(unsigned int* __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, 1U << _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) {
return *(*this + __i);
}
};
inline _Bit_const_iterator
operator+(ptrdiff_t __n, const _Bit_const_iterator& __x) { return __x + __n; }
# 251 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
template <class _Allocator, bool __is_static>
class _Bvector_alloc_base {
public:
typedef typename _Alloc_traits<bool, _Allocator>::allocator_type
allocator_type;
allocator_type get_allocator() const { return _M_data_allocator; }
_Bvector_alloc_base(const allocator_type& __a)
: _M_data_allocator(__a), _M_start(), _M_finish(), _M_end_of_storage(0) {}
protected:
unsigned int* _M_bit_alloc(size_t __n)
{ return _M_data_allocator.allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
void _M_deallocate() {
if (_M_start._M_p)
_M_data_allocator.deallocate(_M_start._M_p,
_M_end_of_storage - _M_start._M_p);
}
typename _Alloc_traits<unsigned int, _Allocator>::allocator_type
_M_data_allocator;
_Bit_iterator _M_start;
_Bit_iterator _M_finish;
unsigned int* _M_end_of_storage;
};
template <class _Allocator>
class _Bvector_alloc_base<_Allocator, true> {
public:
typedef typename _Alloc_traits<bool, _Allocator>::allocator_type
allocator_type;
allocator_type get_allocator() const { return allocator_type(); }
_Bvector_alloc_base(const allocator_type&)
: _M_start(), _M_finish(), _M_end_of_storage(0) {}
protected:
typedef typename _Alloc_traits<unsigned int, _Allocator>::_Alloc_type
_Alloc_type;
unsigned int* _M_bit_alloc(size_t __n)
{ return _Alloc_type::allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
void _M_deallocate() {
if (_M_start._M_p)
_Alloc_type::deallocate(_M_start._M_p,
_M_end_of_storage - _M_start._M_p);
}
_Bit_iterator _M_start;
_Bit_iterator _M_finish;
unsigned int* _M_end_of_storage;
};
template <class _Alloc>
class _Bvector_base
: public _Bvector_alloc_base<_Alloc,
_Alloc_traits<bool, _Alloc>::_S_instanceless>
{
typedef _Bvector_alloc_base<_Alloc,
_Alloc_traits<bool, _Alloc>::_S_instanceless>
_Base;
public:
typedef typename _Base::allocator_type allocator_type;
_Bvector_base(const allocator_type& __a) : _Base(__a) {}
~_Bvector_base() { _Base::_M_deallocate(); }
};
# 362 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
}
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/stl_vector.h" 1 3
# 364 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 2 3
namespace std {
# 374 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
template <class _Alloc>
class vector<bool, _Alloc> : public _Bvector_base<_Alloc>
{
public:
typedef bool value_type;
typedef size_t size_type;
typedef ptrdiff_t difference_type;
typedef _Bit_reference reference;
typedef bool const_reference;
typedef _Bit_reference* pointer;
typedef const bool* const_pointer;
typedef _Bit_iterator iterator;
typedef _Bit_const_iterator const_iterator;
typedef reverse_iterator<const_iterator> const_reverse_iterator;
typedef reverse_iterator<iterator> reverse_iterator;
typedef typename _Bvector_base<_Alloc>::allocator_type allocator_type;
allocator_type get_allocator() const {
return _Bvector_base<_Alloc>::get_allocator();
}
protected:
using _Bvector_base<_Alloc>::_M_bit_alloc;
using _Bvector_base<_Alloc>::_M_deallocate;
using _Bvector_base<_Alloc>::_M_start;
using _Bvector_base<_Alloc>::_M_finish;
using _Bvector_base<_Alloc>::_M_end_of_storage;
protected:
void _M_initialize(size_type __n) {
unsigned int* __q = _M_bit_alloc(__n);
_M_end_of_storage = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
_M_start = iterator(__q, 0);
_M_finish = _M_start + difference_type(__n);
}
void _M_insert_aux(iterator __position, bool __x) {
if (_M_finish._M_p != _M_end_of_storage) {
copy_backward(__position, _M_finish, _M_finish + 1);
*__position = __x;
++_M_finish;
}
else {
size_type __len = size() ? 2 * size() : __WORD_BIT;
unsigned int* __q = _M_bit_alloc(__len);
iterator __i = copy(begin(), __position, iterator(__q, 0));
*__i++ = __x;
_M_finish = copy(__position, end(), __i);
_M_deallocate();
_M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
_M_start = iterator(__q, 0);
}
}
template <class _InputIterator>
void _M_initialize_range(_InputIterator __first, _InputIterator __last,
input_iterator_tag) {
_M_start = iterator();
_M_finish = iterator();
_M_end_of_storage = 0;
for ( ; __first != __last; ++__first)
push_back(*__first);
}
template <class _ForwardIterator>
void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
forward_iterator_tag) {
size_type __n = 0;
distance(__first, __last, __n);
_M_initialize(__n);
copy(__first, __last, _M_start);
}
template <class _InputIterator>
void _M_insert_range(iterator __pos,
_InputIterator __first, _InputIterator __last,
input_iterator_tag) {
for ( ; __first != __last; ++__first) {
__pos = insert(__pos, *__first);
++__pos;
}
}
template <class _ForwardIterator>
void _M_insert_range(iterator __position,
_ForwardIterator __first, _ForwardIterator __last,
forward_iterator_tag) {
if (__first != __last) {
size_type __n = 0;
distance(__first, __last, __n);
if (capacity() - size() >= __n) {
copy_backward(__position, end(), _M_finish + difference_type(__n));
copy(__first, __last, __position);
_M_finish += difference_type(__n);
}
else {
size_type __len = size() + max(size(), __n);
unsigned int* __q = _M_bit_alloc(__len);
iterator __i = copy(begin(), __position, iterator(__q, 0));
__i = copy(__first, __last, __i);
_M_finish = copy(__position, end(), __i);
_M_deallocate();
_M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
_M_start = iterator(__q, 0);
}
}
}
public:
iterator begin() { return _M_start; }
const_iterator begin() const { return _M_start; }
iterator end() { return _M_finish; }
const_iterator end() const { return _M_finish; }
reverse_iterator rbegin() { return reverse_iterator(end()); }
const_reverse_iterator rbegin() const {
return const_reverse_iterator(end());
}
reverse_iterator rend() { return reverse_iterator(begin()); }
const_reverse_iterator rend() const {
return const_reverse_iterator(begin());
}
size_type size() const { return size_type(end() - begin()); }
size_type max_size() const { return size_type(-1); }
size_type capacity() const {
return size_type(const_iterator(_M_end_of_storage, 0) - begin());
}
bool empty() const { return begin() == end(); }
reference operator[](size_type __n)
{ return *(begin() + difference_type(__n)); }
const_reference operator[](size_type __n) const
{ return *(begin() + difference_type(__n)); }
void _M_range_check(size_type __n) const {
if (__n >= this->size())
__throw_range_error("vector<bool>");
}
reference at(size_type __n)
{ _M_range_check(__n); return (*this)[__n]; }
const_reference at(size_type __n) const
{ _M_range_check(__n); return (*this)[__n]; }
explicit vector(const allocator_type& __a = allocator_type())
: _Bvector_base<_Alloc>(__a) {}
vector(size_type __n, bool __value,
const allocator_type& __a = allocator_type())
: _Bvector_base<_Alloc>(__a)
{
_M_initialize(__n);
fill(_M_start._M_p, _M_end_of_storage, __value ? ~0 : 0);
}
explicit vector(size_type __n)
: _Bvector_base<_Alloc>(allocator_type())
{
_M_initialize(__n);
fill(_M_start._M_p, _M_end_of_storage, 0);
}
vector(const vector& __x) : _Bvector_base<_Alloc>(__x.get_allocator()) {
_M_initialize(__x.size());
copy(__x.begin(), __x.end(), _M_start);
}
template <class _Integer>
void _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) {
_M_initialize(__n);
fill(_M_start._M_p, _M_end_of_storage, __x ? ~0 : 0);
}
template <class _InputIterator>
void _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
__false_type) {
_M_initialize_range(__first, __last, __iterator_category(__first));
}
template <class _InputIterator>
vector(_InputIterator __first, _InputIterator __last,
const allocator_type& __a = allocator_type())
: _Bvector_base<_Alloc>(__a)
{
typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
_M_initialize_dispatch(__first, __last, _Integral());
}
# 605 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
~vector() { }
vector& operator=(const vector& __x) {
if (&__x == this) return *this;
if (__x.size() > capacity()) {
_M_deallocate();
_M_initialize(__x.size());
}
copy(__x.begin(), __x.end(), begin());
_M_finish = begin() + difference_type(__x.size());
return *this;
}
void _M_fill_assign(size_t __n, bool __x) {
if (__n > size()) {
fill(_M_start._M_p, _M_end_of_storage, __x ? ~0 : 0);
insert(end(), __n - size(), __x);
}
else {
erase(begin() + __n, end());
fill(_M_start._M_p, _M_end_of_storage, __x ? ~0 : 0);
}
}
void assign(size_t __n, bool __x) { _M_fill_assign(__n, __x); }
template <class _InputIterator>
void assign(_InputIterator __first, _InputIterator __last) {
typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
_M_assign_dispatch(__first, __last, _Integral());
}
template <class _Integer>
void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
{ _M_fill_assign((size_t) __n, (bool) __val); }
template <class _InputIter>
void _M_assign_dispatch(_InputIter __first, _InputIter __last, __false_type)
{ _M_assign_aux(__first, __last, __iterator_category(__first)); }
template <class _InputIterator>
void _M_assign_aux(_InputIterator __first, _InputIterator __last,
input_iterator_tag) {
iterator __cur = begin();
for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
*__cur = *__first;
if (__first == __last)
erase(__cur, end());
else
insert(end(), __first, __last);
}
template <class _ForwardIterator>
void _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
forward_iterator_tag) {
size_type __len = 0;
distance(__first, __last, __len);
if (__len < size())
erase(copy(__first, __last, begin()), end());
else {
_ForwardIterator __mid = __first;
advance(__mid, size());
copy(__first, __mid, begin());
insert(end(), __mid, __last);
}
}
void reserve(size_type __n) {
if (capacity() < __n) {
unsigned int* __q = _M_bit_alloc(__n);
_M_finish = copy(begin(), end(), iterator(__q, 0));
_M_deallocate();
_M_start = iterator(__q, 0);
_M_end_of_storage = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
}
}
reference front() { return *begin(); }
const_reference front() const { return *begin(); }
reference back() { return *(end() - 1); }
const_reference back() const { return *(end() - 1); }
void push_back(bool __x) {
if (_M_finish._M_p != _M_end_of_storage)
*_M_finish++ = __x;
else
_M_insert_aux(end(), __x);
}
void swap(vector<bool, _Alloc>& __x) {
std::swap(_M_start, __x._M_start);
std::swap(_M_finish, __x._M_finish);
std::swap(_M_end_of_storage, __x._M_end_of_storage);
}
iterator insert(iterator __position, bool __x = bool()) {
difference_type __n = __position - begin();
if (_M_finish._M_p != _M_end_of_storage && __position == end())
*_M_finish++ = __x;
else
_M_insert_aux(__position, __x);
return begin() + __n;
}
template <class _Integer>
void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
__true_type) {
_M_fill_insert(__pos, __n, __x);
}
template <class _InputIterator>
void _M_insert_dispatch(iterator __pos,
_InputIterator __first, _InputIterator __last,
__false_type) {
_M_insert_range(__pos, __first, __last, __iterator_category(__first));
}
template <class _InputIterator>
void insert(iterator __position,
_InputIterator __first, _InputIterator __last) {
typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
_M_insert_dispatch(__position, __first, __last, _Integral());
}
# 783 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
void _M_fill_insert(iterator __position, size_type __n, bool __x) {
if (__n == 0) return;
if (capacity() - size() >= __n) {
copy_backward(__position, end(), _M_finish + difference_type(__n));
fill(__position, __position + difference_type(__n), __x);
_M_finish += difference_type(__n);
}
else {
size_type __len = size() + max(size(), __n);
unsigned int* __q = _M_bit_alloc(__len);
iterator __i = copy(begin(), __position, iterator(__q, 0));
fill_n(__i, __n, __x);
_M_finish = copy(__position, end(), __i + difference_type(__n));
_M_deallocate();
_M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
_M_start = iterator(__q, 0);
}
}
void insert(iterator __position, size_type __n, bool __x) {
_M_fill_insert(__position, __n, __x);
}
void pop_back() { --_M_finish; }
iterator erase(iterator __position) {
if (__position + 1 != end())
copy(__position + 1, end(), __position);
--_M_finish;
return __position;
}
iterator erase(iterator __first, iterator __last) {
_M_finish = copy(__last, end(), __first);
return __first;
}
void resize(size_type __new_size, bool __x = bool()) {
if (__new_size < size())
erase(begin() + difference_type(__new_size), end());
else
insert(end(), __new_size - size(), __x);
}
void flip() {
for (unsigned int* __p = _M_start._M_p; __p != _M_end_of_storage; ++__p)
*__p = ~*__p;
}
void clear() { erase(begin(), end()); }
};
typedef vector<bool, alloc> bit_vector;
# 890 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/ext/stl_bvector.h" 3
}
# 39 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_vector.h" 2 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 2 3
namespace std
{
template<typename _Facet>
locale
locale::combine(const locale& __other)
{
locale __copy(*this);
__copy._M_impl->_M_replace_facet(__other._M_impl, &_Facet::id);
return __copy;
}
template<typename _CharT, typename _Traits, typename _Alloc>
bool
locale::operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1,
const basic_string<_CharT, _Traits, _Alloc>& __s2) const
{
typedef std::collate<_CharT> __collate_type;
const __collate_type* __fcoll = &use_facet<__collate_type>(*this);
return (__fcoll->compare(__s1.data(), __s1.data() + __s1.length(),
__s2.data(), __s2.data() + __s2.length()) < 0);
}
template<typename _Facet>
const _Facet&
use_facet(const locale& __loc)
{
typedef locale::_Impl::__vec_facet __vec_facet;
locale::id& __id = _Facet::id;
size_t __i = __id._M_index;
__vec_facet* __facet = __loc._M_impl->_M_facets;
const locale::facet* __fp = (*__facet)[__i];
if (__fp == 0 || __i >= __facet->size())
__throw_bad_cast();
return static_cast<const _Facet&>(*__fp);
}
template<typename _Facet>
bool
has_facet(const locale& __loc) throw()
{
typedef locale::_Impl::__vec_facet __vec_facet;
locale::id& __id = _Facet::id;
size_t __i = __id._M_index;
__vec_facet* __facet = __loc._M_impl->_M_facets;
return (__i < __facet->size() && (*__facet)[__i] != 0);
}
template<typename _InIter, typename _CharT>
_InIter
__match_parallel(_InIter __s, _InIter __end, int __ntargs,
const basic_string<_CharT>* __targets,
int* __matches, int& __remain, bool& __eof)
{
typedef basic_string<_CharT> __string_type;
__eof = false;
for (int __ti = 0; __ti < __ntargs; ++__ti)
__matches[__ti] = __ti;
__remain = __ntargs;
size_t __pos = 0;
do
{
{
int __ti = 0;
for (;__ti < __remain &&
__pos == __targets[__matches[__ti]].size(); ++__ti)
{ }
if (__ti == __remain)
{
if (__pos == 0) __remain = 0;
return __s;
}
}
if (__s == __end)
__eof = true;
bool __matched = false;
for (int __ti = 0; __ti < __remain; )
{
const __string_type& __target = __targets[__matches[__ti]];
if (__pos < __target.size())
{
if (__eof || __target[__pos] != *__s)
{
__matches[__ti] = __matches[--__remain];
continue;
}
__matched = true;
}
++__ti;
}
if (__matched)
{
++__s;
++__pos;
}
for (int __ti = 0; __ti < __remain;)
{
if (__pos > __targets[__matches[__ti]].size())
{
__matches[__ti] = __matches[--__remain];
continue;
}
++__ti;
}
}
while (__remain);
return __s;
}
template<typename _CharT>
_Format_cache<_CharT>::_Format_cache()
: _M_valid(true), _M_use_grouping(false)
{ }
template<>
_Format_cache<char>::_Format_cache();
template<>
_Format_cache<wchar_t>::_Format_cache();
template<typename _CharT>
void
_Format_cache<_CharT>::_M_populate(ios_base& __io)
{
locale __loc = __io.getloc ();
numpunct<_CharT> const& __np = use_facet<numpunct<_CharT> >(__loc);
_M_truename = __np.truename();
_M_falsename = __np.falsename();
_M_thousands_sep = __np.thousands_sep();
_M_decimal_point = __np.decimal_point();
_M_grouping = __np.grouping();
_M_use_grouping = _M_grouping.size() != 0 && _M_grouping.data()[0] != 0;
_M_valid = true;
}
template<typename _CharT>
void
_Format_cache<_CharT>::
_S_callback(ios_base::event __ev, ios_base& __ios, int __ix) throw()
{
void*& __p = __ios.pword(__ix);
switch (__ev)
{
case ios_base::erase_event:
delete static_cast<_Format_cache<_CharT>*> (__p); __p = 0;
break;
case ios_base::copyfmt_event:
try {
__p = new _Format_cache<_CharT>;
}
catch(...) {
}
break;
case ios_base::imbue_event:
static_cast<_Format_cache<_CharT>*>(__p)->_M_valid = false;
break;
}
}
template<typename _CharT>
_Format_cache<_CharT>*
_Format_cache<_CharT>::_S_get(ios_base& __ios)
{
if (!_S_pword_ix)
_S_pword_ix = ios_base::xalloc();
void*& __p = __ios.pword(_S_pword_ix);
if (__p == 0)
{
auto_ptr<_Format_cache<_CharT> > __ap(new _Format_cache<_CharT>);
__ios.register_callback(&_Format_cache<_CharT>::_S_callback,
_S_pword_ix);
__p = __ap.release();
}
_Format_cache<_CharT>* __ncp = static_cast<_Format_cache<_CharT>*>(__p);
if (!__ncp->_M_valid)
__ncp->_M_populate(__ios);
return __ncp;
}
# 255 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _InIter>
void
num_get<_CharT, _InIter>::
_M_extract(_InIter , _InIter , ios_base& ,
ios_base::iostate& , char* ,
int& , bool ) const
{
}
template<>
void
num_get<char, istreambuf_iterator<char> >::
_M_extract(istreambuf_iterator<char> __beg,
istreambuf_iterator<char> __end, ios_base& __io,
ios_base::iostate& __err, char* __xtrc, int& __base,
bool __fp) const;
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, bool& __v) const
{
if (!(__io.flags() & ios_base::boolalpha))
{
char __xtrc[32] = {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
long __l = strtol(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __l <= 1
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __l;
else
__err |= ios_base::failbit;
}
else
{
typedef _Format_cache<char_type> __fcache_type;
__fcache_type* __fmt = __fcache_type::_S_get(__io);
const char_type* __true = __fmt->_M_truename.c_str();
const char_type* __false = __fmt->_M_falsename.c_str();
const size_t __truelen = __traits_type::length(__true) - 1;
const size_t __falselen = __traits_type::length(__false) - 1;
for (size_t __pos = 0; __beg != __end; ++__pos)
{
char_type __c = *__beg++;
bool __testf = __c == __false[__pos];
bool __testt = __c == __true[__pos];
if (!(__testf || __testt))
{
__err |= ios_base::failbit;
break;
}
else if (__testf && __pos == __falselen)
{
__v = 0;
break;
}
else if (__testt && __pos == __truelen)
{
__v = 1;
break;
}
}
if (__beg == __end)
__err |= ios_base::eofbit;
}
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, short& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
long __l = strtol(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0
&& __l >= (-32767-1) && __l <= 32767)
__v = static_cast<short>(__l);
else
__err |= ios_base::failbit;
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, int& __v) const
{
char __xtrc[32] = {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
long __l = strtol(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0
&& __l >= (-2147483647 -1) && __l <= 2147483647)
__v = static_cast<int>(__l);
else
__err |= ios_base::failbit;
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, long& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
long __l = strtol(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __l;
else
__err |= ios_base::failbit;
return __beg;
}
# 455 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, unsigned short& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
unsigned long __ul = strtoul(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0
&& __ul <= 65535)
__v = static_cast<unsigned short>(__ul);
else
__err |= ios_base::failbit;
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, unsigned int& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
unsigned long __ul = strtoul(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0
&& __ul <= (2147483647 * 2U + 1))
__v = static_cast<unsigned int>(__ul);
else
__err |= ios_base::failbit;
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, unsigned long& __v) const
{
char __xtrc[32] = {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
unsigned long __ul = strtoul(__xtrc, &__sanity, __base);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __ul;
else
__err |= ios_base::failbit;
return __beg;
}
# 563 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, float& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, true);
char* __sanity;
(*__errno_location ()) = 0;
float __f = strtof(__xtrc, &__sanity);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __f;
else
__err |= ios_base::failbit;
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, double& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, true);
char* __sanity;
(*__errno_location ()) = 0;
double __d = strtod(__xtrc, &__sanity);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __d;
else
__err |= ios_base::failbit;
return __beg;
}
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, long double& __v) const
{
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, true);
char* __sanity;
(*__errno_location ()) = 0;
long double __ld = strtold(__xtrc, &__sanity);
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __ld;
else
__err |= ios_base::failbit;
return __beg;
}
# 683 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _InIter>
_InIter
num_get<_CharT, _InIter>::
do_get(iter_type __beg, iter_type __end, ios_base& __io,
ios_base::iostate& __err, void*& __v) const
{
typedef ios_base::fmtflags fmtflags;
fmtflags __fmt = __io.flags();
fmtflags __fmtmask = ~(ios_base::showpos | ios_base::basefield
| ios_base::uppercase | ios_base::internal);
__io.flags(__fmt & __fmtmask | (ios_base::hex | ios_base::showbase));
char __xtrc[32]= {'\0'};
int __base;
_M_extract(__beg, __end, __io, __err, __xtrc, __base, false);
char* __sanity;
(*__errno_location ()) = 0;
void* __vp = reinterpret_cast<void*>(strtoul(__xtrc, &__sanity, __base));
if (!(__err & ios_base::failbit)
&& __sanity != __xtrc && *__sanity == '\0' && (*__errno_location ()) == 0)
__v = __vp;
else
__err |= ios_base::failbit;
__io.flags(__fmt);
return __beg;
}
template <typename _CharT, typename _OutIter>
inline _OutIter
__pad(_OutIter __s, _CharT __fill, int __padding);
template <typename _CharT, typename _RaIter>
_RaIter
__pad(_RaIter __s, _CharT __fill, int __padding,
random_access_iterator_tag)
{
fill_n(__s, __fill);
return __s + __padding;
}
template <typename _CharT, typename _OutIter, typename _Tag>
_OutIter
__pad(_OutIter __s, _CharT __fill, int __padding, _Tag)
{
while (--__padding >= 0) { *__s = __fill; ++__s; }
return __s;
}
template <typename _CharT, typename _OutIter>
inline _OutIter
__pad(_OutIter __s, _CharT __fill, int __padding)
{
return __pad(__s, __fill, __padding,
iterator_traits<_OutIter>::iterator_category());
}
template <typename _CharT, typename _OutIter>
_OutIter
__pad_numeric(_OutIter __s, ios_base::fmtflags ,
_CharT , int ,
_CharT const* , _CharT const* ,
_CharT const* )
{
return __s;
}
template <typename _CharT>
ostreambuf_iterator<_CharT>
__pad_numeric(ostreambuf_iterator<_CharT> __s, ios_base::fmtflags __flags,
_CharT __fill, int __width, _CharT const* __first,
_CharT const* __middle, _CharT const* __last)
{
typedef ostreambuf_iterator<_CharT> __out_iter;
int __padding = __width - (__last - __first);
if (__padding < 0)
__padding = 0;
ios_base::fmtflags __aflags = __flags & ios_base::adjustfield;
bool __testfield = __padding == 0 || __aflags == ios_base::left
|| __aflags == ios_base::internal;
if (__first != __middle)
{
if (!__testfield)
{
__pad(__s, __fill, __padding);
__padding = 0;
}
copy(__first, __middle, __s);
}
__out_iter __s2 = __s;
if (__padding && __aflags != ios_base::left)
{
__pad(__s2, __fill, __padding);
__padding = 0;
}
__out_iter __s3 = copy(__middle, __last, __s2);
if (__padding)
__pad(__s3, __fill, __padding);
return __s3;
}
template <typename _CharT, typename _OutIter>
_OutIter
num_put<_CharT, _OutIter>::
do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const
{
const _Format_cache<_CharT>* __fmt = _Format_cache<_CharT>::_S_get(__io);
ios_base::fmtflags __flags = __io.flags();
if ((__flags & ios_base::boolalpha) == 0)
{
unsigned long __uv = __v;
return __output_integer(__s, __io, __fill, false, __uv);
}
else
{
const char_type* __first;
const char_type* __last;
if (__v)
{
__first = __fmt->_M_truename.data();
__last = __first + __fmt->_M_truename.size();
}
else
{
__first = __fmt->_M_falsename.data();
__last = __first + __fmt->_M_falsename.size();
}
copy(__first, __last, __s);
}
return __s;
}
template <typename _CharT>
_CharT*
__group_digits(_CharT* __s, _CharT __grsep, char const* __grouping,
char const* __grend, _CharT const* __first,
_CharT const* __last)
{
if (__last - __first > *__grouping)
{
__s = __group_digits(__s, __grsep,
(__grouping + 1 == __grend ? __grouping : __grouping + 1),
__grend, __first, __last - *__grouping);
__first = __last - *__grouping;
*__s++ = __grsep;
}
do
{
*__s++ = *__first++;
}
while (__first != __last);
return __s;
}
template <typename _CharT, typename _OutIter, typename _ValueT>
_OutIter
__output_integer(_OutIter __s, ios_base& __io, _CharT __fill, bool __neg,
_ValueT __v)
{
const long _M_room = numeric_limits<_ValueT>::digits10 * 2 + 4;
_CharT __digits[_M_room];
_CharT* __front = __digits + _M_room;
ios_base::fmtflags __flags = __io.flags();
const _Format_cache<_CharT>* __fmt = _Format_cache<_CharT>::_S_get(__io);
char const* __table = __fmt->_S_literals + __fmt->_S_digits;
ios_base::fmtflags __basefield = (__flags & __io.basefield);
_CharT* __sign_end = __front;
if (__basefield == ios_base::hex)
{
if (__flags & ios_base::uppercase)
__table += 16;
do
*--__front = __table[__v & 15];
while ((__v >>= 4) != 0);
__sign_end = __front;
if (__flags & ios_base::showbase)
{
*--__front = __fmt->_S_literals[__fmt->_S_x +
((__flags & ios_base::uppercase) ? 1 : 0)];
*--__front = __table[0];
}
}
else if (__basefield == ios_base::oct)
{
do
*--__front = __table[__v & 7];
while ((__v >>= 3) != 0);
if (__flags & ios_base::showbase
&& static_cast<char>(*__front) != __table[0])
*--__front = __table[0];
__sign_end = __front;
}
else
{
do
*--__front = __table[__v % 10];
while ((__v /= 10) != 0);
__sign_end = __front;
if (__neg || (__flags & ios_base::showpos))
*--__front = __fmt->_S_literals[__fmt->_S_plus - __neg];
}
if (!__fmt->_M_use_grouping && !__io.width())
return copy(__front, __digits + _M_room, __s);
if (!__fmt->_M_use_grouping)
return __pad_numeric(__s, __flags, __fill, __io.width(0),
__front, __sign_end, __digits + _M_room);
_CharT* __p = __digits;
while (__front < __sign_end)
*__p++ = *__front++;
const char* __gr = __fmt->_M_grouping.data();
__front = __group_digits(__p, __fmt->_M_thousands_sep, __gr,
__gr + __fmt->_M_grouping.size(), __sign_end, __digits + _M_room);
return __pad_numeric(__s, __flags, __fill, __io.width(0),
__digits, __p, __front);
}
template <typename _CharT, typename _OutIter>
_OutIter
num_put<_CharT, _OutIter>::
do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const
{
unsigned long __uv = __v;
bool __neg = false;
if (__v < 0)
{
__neg = true;
__uv = -__uv;
}
return __output_integer(__s, __io, __fill, __neg, __uv);
}
template <typename _CharT, typename _OutIter>
_OutIter
num_put<_CharT, _OutIter>::
do_put(iter_type __s, ios_base& __io, char_type __fill,
unsigned long __v) const
{ return __output_integer(__s, __io, __fill, false, __v); }
# 972 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _OutIter>
_OutIter
__output_float(_OutIter __s, ios_base& __io, _CharT __fill,
const char* __sptr, size_t __slen)
{
return __s;
}
template<typename _CharT>
ostreambuf_iterator<_CharT>
__output_float(ostreambuf_iterator<_CharT> __s, ios_base& __io,
_CharT __fill, const char* __sptr, size_t __slen)
{
size_t __padding = __io.width() > streamsize(__slen) ?
__io.width() -__slen : 0;
locale __loc = __io.getloc();
ctype<_CharT> const& __ct = use_facet<ctype<_CharT> >(__loc);
ios_base::fmtflags __adjfield = __io.flags() & ios_base::adjustfield;
const char* const __eptr = __sptr + __slen;
if (__adjfield == ios_base::internal)
{
if (__sptr < __eptr && (*__sptr == '+' || *__sptr == '-'))
{
__s = __ct.widen(*__sptr);
++__s;
++__sptr;
}
__s = __pad(__s, __fill, __padding);
__padding = 0;
}
else if (__adjfield != ios_base::left)
{
__s = __pad(__s, __fill, __padding);
__padding = 0;
}
char __decimal_point = *(localeconv()->decimal_point);
const _Format_cache<_CharT>* __fmt = _Format_cache<_CharT>::_S_get(__io);
for (; __sptr != __eptr; ++__s, ++__sptr)
{
if (*__sptr == __decimal_point)
__s = __fmt->_M_decimal_point;
else
__s = __ct.widen(*__sptr);
}
if (__padding)
__pad(__s, __fill, __padding);
__io.width(0);
return __s;
}
bool
__build_float_format(ios_base& __io, char* __fptr, char __modifier,
streamsize __prec);
template <typename _CharT, typename _OutIter>
_OutIter
num_put<_CharT, _OutIter>::
do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const
{
const streamsize __max_prec = numeric_limits<double>::digits10 + 3;
streamsize __prec = __io.precision();
if (__prec > __max_prec)
__prec = __max_prec;
char __sbuf[__max_prec*2];
size_t __slen;
char __fbuf[16];
if (__build_float_format(__io, __fbuf, 0, __prec))
__slen = sprintf(__sbuf, __fbuf, __prec, __v);
else
__slen = sprintf(__sbuf, __fbuf, __v);
return __output_float(__s, __io, __fill, __sbuf, __slen);
}
template <typename _CharT, typename _OutIter>
_OutIter
num_put<_CharT, _OutIter>::
do_put(iter_type __s, ios_base& __io, char_type __fill,
long double __v) const
{
const streamsize __max_prec = numeric_limits<long double>::digits10 + 3;
streamsize __prec = __io.precision();
if (__prec > __max_prec)
__prec = __max_prec;
char __sbuf[__max_prec*2];
size_t __slen;
char __fbuf[16];
if (__build_float_format(__io, __fbuf, 'L', __prec))
__slen = sprintf(__sbuf, __fbuf, __prec, __v);
else
__slen = sprintf(__sbuf, __fbuf, __v);
return __output_float(__s, __io, __fill, __sbuf, __slen);
}
template <typename _CharT, typename _OutIter>
_OutIter
num_put<_CharT, _OutIter>::
do_put(iter_type __s, ios_base& __io, char_type __fill,
const void* __v) const
{
typedef ios_base::fmtflags fmtflags;
fmtflags __fmt = __io.flags();
fmtflags __fmtmask = ~(ios_base::showpos | ios_base::basefield
| ios_base::uppercase | ios_base::internal);
__io.flags(__fmt & __fmtmask | (ios_base::hex | ios_base::showbase));
try {
_OutIter __s2 = __output_integer(__s, __io, __fill, false,
reinterpret_cast<unsigned long>(__v));
__io.flags(__fmt);
return __s2;
}
catch (...) {
__io.flags(__fmt);
throw;
}
}
template<typename _CharT, typename _Dummy = int>
struct _Weekdaynames;
template<typename _Dummy>
struct _Weekdaynames<char, _Dummy>
{ static const char* const _S_names[14]; };
template<typename _Dummy>
const char* const
_Weekdaynames<char, _Dummy>::_S_names[14] =
{
"Sun", "Sunday",
"Mon", "Monday", "Tue", "Tuesday", "Wed", "Wednesday",
"Thu", "Thursday", "Fri", "Friday", "Sat", "Saturday"
};
# 1140 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _Dummy = int>
struct _Monthnames;
template<typename _Dummy>
struct _Monthnames<char,_Dummy>
{ static const char* const _S_names[24]; };
template<typename _Dummy>
const char* const
_Monthnames<char,_Dummy>::_S_names[24] =
{
"Jan", "January", "Feb", "February", "Mar", "March",
"Apr", "April", "May", "May", "Jun", "June",
"Jul", "July", "Aug", "August", "Sep", "September",
"Oct", "October", "Nov", "November", "Dec", "December"
};
# 1173 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/locale_facets.tcc" 3
template<typename _CharT, typename _InIter>
_InIter
time_get<_CharT, _InIter>::
do_get_weekday(iter_type __s, iter_type __end,
ios_base& __io, ios_base::iostate& __err, tm* __t) const
{
if (!_M_daynames)
{
_M_daynames = new basic_string<_CharT>[14];
for (int __i = 0; __i < 14; ++__i)
_M_daynames[__i] = _Weekdaynames<_CharT>::_S_names[__i];
}
bool __at_eof = false;
int __remain = 0;
int __matches[14];
iter_type __out = __match_parallel(__s, __end, 14, _M_daynames,
__matches, __remain, __at_eof);
__err = ios_base::iostate(0);
if (__at_eof) __err |= __io.eofbit;
if (__remain == 1 ||
__remain == 2 && (__matches[0]>>1) == (__matches[1]>>1))
__t->tm_wday = (__matches[0]>>1);
else
__err |= __io.failbit;
return __out;
}
template<typename _CharT, typename _InIter>
_InIter
time_get<_CharT, _InIter>::
do_get_monthname(iter_type __s, iter_type __end,
ios_base& __io, ios_base::iostate& __err, tm* __t) const
{
if (!_M_monthnames)
{
_M_monthnames = new basic_string<_CharT>[24];
for (int __i = 0; __i < 24; ++__i)
_M_monthnames[__i] = _Monthnames<_CharT>::_S_names[__i];
}
bool __at_eof = false;
int __remain = 0;
int __matches[24];
iter_type __out = __match_parallel( __s, __end, 24, _M_monthnames,
__matches, __remain, __at_eof);
__err = ios_base::iostate(0);
if (__at_eof) __err |= __io.eofbit;
if (__remain == 1 ||
__remain == 2 && (__matches[0]>>1) == (__matches[1]>>1))
__t->tm_mon = (__matches[0]>>1);
else
__err |= __io.failbit;
return __out;
}
}
# 42 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_locale.h" 2 3
# 43 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 2 3
# 1 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/i686-pc-linux-gnu/bits/c++threads.h" 1 3
# 44 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 2 3
namespace std {
template<typename _CharT, typename _Traits>
class basic_filebuf : public basic_streambuf<_CharT, _Traits>
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef typename traits_type::int_type int_type;
typedef typename traits_type::pos_type pos_type;
typedef typename traits_type::off_type off_type;
typedef basic_streambuf<char_type, traits_type> __streambuf_type;
typedef basic_filebuf<char_type, traits_type> __filebuf_type;
typedef __basic_file<char_type> __file_type;
typedef typename traits_type::state_type __state_type;
typedef codecvt<char_type, char, __state_type> __codecvt_type;
typedef typename __codecvt_type::result __res_type;
typedef ctype<char_type> __ctype_type;
friend class ios_base;
private:
__file_type* _M_file;
__state_type _M_state_cur;
__state_type _M_state_beg;
const __codecvt_type* _M_fcvt;
__c_lock _M_lock;
bool _M_last_overflowed;
public:
basic_filebuf();
basic_filebuf(int __fd, const char* __name, ios_base::openmode __mode);
virtual
~basic_filebuf()
{
this->close();
_M_fcvt = __null;
_M_last_overflowed = false;
}
bool
is_open(void) const { return _M_file ? _M_file->is_open() : false; }
__filebuf_type*
open(const char* __s, ios_base::openmode __mode);
__filebuf_type*
close(void);
protected:
void
_M_allocate_buffers();
void
_M_filebuf_init();
virtual streamsize
showmanyc(void);
virtual int_type
underflow(void);
virtual int_type
pbackfail(int_type __c = _Traits::eof());
# 143 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 3
virtual int_type
overflow(int_type __c = _Traits::eof());
# 153 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/bits/std_fstream.h" 3
int_type
_M_really_overflow(int_type __c = _Traits::eof());
virtual __streambuf_type*
setbuf(char_type* __s, streamsize __n)
{
if (!this->is_open() && __s == 0 && __n == 0)
{
_M_buf_size = 0;
_M_buf_size_opt = 0;
}
_M_last_overflowed = false;
return this;
}
virtual pos_type
seekoff(off_type __off, ios_base::seekdir __way,
ios_base::openmode __mode = ios_base::in | ios_base::out);
virtual pos_type
seekpos(pos_type __pos,
ios_base::openmode __mode = ios_base::in | ios_base::out);
virtual int
sync(void)
{
bool __testput = _M_out_cur && _M_out_beg < _M_out_end;
if (__testput)
{
_M_file->sync();
streamoff __cur = _M_file->seekoff(0, ios_base::cur);
off_type __off = _M_out_cur - _M_out_beg;
_M_really_overflow();
_M_file->seekpos(__cur + __off);
}
_M_last_overflowed = false;
return 0;
}
virtual void
imbue(const locale& __loc);
virtual streamsize
xsgetn(char_type* __s, streamsize __n)
{
streamsize __ret = 0;
if (_M_pback_init)
{
while (__ret < __n && _M_in_cur < _M_in_end)
{
*__s = *_M_in_cur;
++__ret;
++__s;
++_M_in_cur;
}
_M_pback_destroy();
}
if (__ret < __n)
__ret += __streambuf_type::xsgetn(__s, __n - __ret);
return __ret;
}
virtual streamsize
xsputn(const char_type* __s, streamsize __n)
{
_M_pback_destroy();
return __streambuf_type::xsputn(__s, __n);
}
void
_M_output_unshift();
};
template<typename _CharT, typename _Traits>
class basic_ifstream : public basic_istream<_CharT, _Traits>
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef typename traits_type::int_type int_type;
typedef typename traits_type::pos_type pos_type;
typedef typename traits_type::off_type off_type;
typedef basic_filebuf<char_type, traits_type> __filebuf_type;
typedef basic_istream<char_type, traits_type> __istream_type;
basic_ifstream()
: __istream_type(new __filebuf_type())
{ }
explicit
basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in)
: __istream_type(new __filebuf_type())
{ this->open(__s, __mode); }
~basic_ifstream()
{
delete _M_streambuf;
_M_streambuf = __null;
}
__filebuf_type*
rdbuf() const
{ return static_cast<__filebuf_type*>(_M_streambuf); }
bool
is_open(void) { return rdbuf()->is_open(); }
void
open(const char* __s, ios_base::openmode __mode = ios_base::in)
{
if (rdbuf()->open(__s, __mode | ios_base::in) == __null)
this->setstate(ios_base::failbit);
}
void
close(void)
{
if (!rdbuf()->close())
this->setstate(ios_base::failbit);
}
};
template<typename _CharT, typename _Traits>
class basic_ofstream : public basic_ostream<_CharT,_Traits>
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef typename traits_type::int_type int_type;
typedef typename traits_type::pos_type pos_type;
typedef typename traits_type::off_type off_type;
typedef basic_filebuf<char_type, traits_type> __filebuf_type;
typedef basic_ostream<char_type, traits_type> __ostream_type;
basic_ofstream()
: __ostream_type(new __filebuf_type())
{ }
explicit
basic_ofstream(const char* __s,
ios_base::openmode __mode = ios_base::out|ios_base::trunc)
: __ostream_type(new __filebuf_type())
{ this->open(__s, __mode); }
~basic_ofstream()
{
delete _M_streambuf;
_M_streambuf = __null;
}
__filebuf_type*
rdbuf(void) const
{ return static_cast<__filebuf_type*>(_M_streambuf); }
bool
is_open(void) { return rdbuf()->is_open(); }
void
open(const char* __s,
ios_base::openmode __mode = ios_base::out | ios_base::trunc)
{
if (!rdbuf()->open(__s, __mode | ios_base::out))
this->setstate(ios_base::failbit);
}
void
close(void)
{
if (!rdbuf()->close())
setstate(ios_base::failbit);
}
};
template<typename _CharT, typename _Traits>
class basic_fstream : public basic_iostream<_CharT, _Traits>
{
public:
typedef _CharT char_type;
typedef _Traits traits_type;
typedef typename traits_type::int_type int_type;
typedef typename traits_type::pos_type pos_type;
typedef typename traits_type::off_type off_type;
typedef basic_filebuf<char_type, traits_type> __filebuf_type;
typedef basic_ios<char_type, traits_type> __ios_type;
typedef basic_iostream<char_type, traits_type> __iostream_type;
basic_fstream()
: __iostream_type(new __filebuf_type())
{ }
explicit
basic_fstream(const char* __s,
ios_base::openmode __mode = ios_base::in | ios_base::out)
: __iostream_type(new __filebuf_type())
{ this->open(__s, __mode); }
~basic_fstream()
{
delete _M_streambuf;
_M_streambuf = __null;
}
__filebuf_type*
rdbuf(void) const
{ return static_cast<__filebuf_type*>(_M_streambuf); }
bool
is_open(void) { return rdbuf()->is_open(); }
void
open(const char* __s,
ios_base::openmode __mode = ios_base::in | ios_base::out)
{
if (!rdbuf()->open(__s, __mode))
setstate (ios_base::failbit);
}
void
close(void)
{
if (!rdbuf()->close())
setstate (ios_base::failbit);
}
};
}
# 32 "/public/packages/programming/gcc-current/lib/gcc-lib/i686-pc-linux-gnu/3.0/include-g++/fstream.h" 2 3
using std::ifstream;
using std::ofstream;
using std::fstream;
# 31 "/home/st/andreas/ddd/ddd/session.C" 2
bool lock_session_dir()
{
{
ifstream is("foo");
if (true)
{
string version;
is >> version;
if (true)
if (true)
return false;
}
}
return true;
}
void unlock_session_dir()
{
ifstream is("foo");
}
>Fix:
Compile without optimization.
>Release-Note:
>Audit-Trail:
>Unformatted:
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2001-03-30 5:56 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2001-03-30 5:56 optimization/2435: GCC 3.0 20010326 emits duplicate template instantiations with -O Andreas Zeller
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).