Created
November 27, 2020 16:35
-
-
Save mach-kernel/180d2b44a8245f77759be5d9dc89a9a1 to your computer and use it in GitHub Desktop.
This file has been truncated, but you can view the full file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # 1 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" | |
| # 1 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/build//" | |
| # 1 "<built-in>" | |
| # 1 "<command-line>" | |
| # 1 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" | |
| # 52 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" | |
| # 1 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/build/config.h" 1 | |
| # 53 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/build/poppler/poppler-config.h" 1 | |
| # 141 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/build/poppler/poppler-config.h" | |
| # 1 "/usr/sgug/include/libdicl-0.1/stdio.h" 1 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/stdio.h" 1 3 4 | |
| # 14 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/stdio.h" 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stdarg.h" 1 3 4 | |
| # 40 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stdarg.h" 3 4 | |
| # 40 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stdarg.h" 3 4 | |
| typedef __builtin_va_list __gnuc_va_list; | |
| # 15 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/stdio.h" 2 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 1 3 4 | |
| # 12 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| #ident "$Revision: 1.13 $" | |
| # 42 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| # 1 "/usr/include/standards.h" 1 3 4 | |
| # 19 "/usr/include/standards.h" 3 4 | |
| #ident "$Id: standards.h,v 1.22 2002/08/07 14:51:48 raji Exp $" | |
| # 43 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 2 3 4 | |
| # 1 "/usr/include/sgidefs.h" 1 3 4 | |
| # 16 "/usr/include/sgidefs.h" 3 4 | |
| extern "C" { | |
| #ident "$Revision: 1.11 $" | |
| # 136 "/usr/include/sgidefs.h" 3 4 | |
| typedef int __int32_t; | |
| typedef unsigned __uint32_t; | |
| # 183 "/usr/include/sgidefs.h" 3 4 | |
| typedef long long __int64_t; | |
| typedef unsigned long long __uint64_t; | |
| # 219 "/usr/include/sgidefs.h" 3 4 | |
| typedef __int32_t __psint_t; | |
| typedef __uint32_t __psunsigned_t; | |
| # 241 "/usr/include/sgidefs.h" 3 4 | |
| typedef __int32_t __scint_t; | |
| typedef __uint32_t __scunsigned_t; | |
| } | |
| # 44 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 2 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/sgimacros.h" 1 3 4 | |
| # 45 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 2 3 4 | |
| extern "C" { | |
| typedef unsigned int size_t; | |
| typedef int ssize_t; | |
| typedef __int64_t fpos_t; | |
| typedef __int64_t off64_t; | |
| # 97 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| typedef __int64_t off_t; | |
| # 109 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| typedef __int64_t fpos64_t; | |
| typedef char *va_list; | |
| # 219 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| typedef struct | |
| # 229 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| __file_s | |
| { | |
| int _cnt; | |
| unsigned char *_ptr; | |
| unsigned char *_base; | |
| unsigned char _flag; | |
| unsigned char _xflag; | |
| unsigned short _file; | |
| } FILE; | |
| extern FILE __iob[100]; | |
| extern FILE *_lastbuf; | |
| extern unsigned char *_bufendtab[]; | |
| extern unsigned char _sibuf[], _sobuf[]; | |
| extern int remove(const char *); | |
| extern int rename(const char *, const char *); | |
| extern FILE *tmpfile(void); | |
| extern char *tmpnam(char *); | |
| extern int fclose(FILE *); | |
| extern int fflush(FILE *); | |
| extern FILE *fopen(const char * __restrict, const char * __restrict); | |
| extern FILE *freopen(const char * __restrict, const char * __restrict, FILE * __restrict); | |
| extern void setbuf(FILE * __restrict, char * __restrict); | |
| extern int setvbuf(FILE * __restrict, char * __restrict, int, size_t); | |
| extern int fprintf(FILE * __restrict, const char * __restrict, ...); | |
| extern int fscanf(FILE * __restrict, const char * __restrict, ...); | |
| extern int printf(const char * __restrict, ...); | |
| extern int scanf(const char * __restrict, ...); | |
| extern int vsnprintf(char * __restrict, | |
| size_t, | |
| const char * __restrict, __gnuc_va_list); | |
| # 306 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| extern int snprintf(char * __restrict, | |
| size_t, | |
| const char * __restrict, ...); | |
| # 332 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| extern int sprintf(char * __restrict, const char * __restrict, ...); | |
| extern int sscanf(const char * __restrict, const char * __restrict, ...); | |
| extern int vfprintf(FILE * __restrict, const char * __restrict, __gnuc_va_list); | |
| extern int vprintf(const char * __restrict, __gnuc_va_list); | |
| extern int vsprintf(char * __restrict, const char * __restrict, __gnuc_va_list); | |
| extern int vsscanf(const char * __restrict, const char * __restrict, __gnuc_va_list); | |
| # 358 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| extern int fgetc(FILE *); | |
| extern char *fgets(char * __restrict, int, FILE * __restrict); | |
| extern int fputc(int, FILE *); | |
| extern int fputs(const char * __restrict, FILE * __restrict); | |
| extern int getc(FILE *); | |
| extern int getchar(void); | |
| extern char *gets(char *); | |
| extern int putc(int, FILE *); | |
| extern int putchar(int); | |
| extern int puts(const char *); | |
| extern int ungetc(int, FILE *); | |
| extern size_t fread(void * __restrict, size_t, size_t, FILE * __restrict); | |
| #pragma int_to_unsigned fread | |
| extern size_t fwrite(const void * __restrict, size_t, size_t, FILE * __restrict); | |
| #pragma int_to_unsigned fwrite | |
| extern int fgetpos(FILE * __restrict, fpos_t * __restrict); | |
| extern int fseek(FILE *, long, int); | |
| extern int fsetpos(FILE *, const fpos_t *); | |
| extern long ftell(FILE *); | |
| extern void rewind(FILE *); | |
| extern void clearerr(FILE *); | |
| extern int feof(FILE *); | |
| extern int ferror(FILE *); | |
| extern void perror(const char *); | |
| extern int vfscanf(FILE * __restrict, const char * __restrict, va_list); | |
| extern int vscanf(const char * __restrict, va_list); | |
| extern int vsscanf(const char * __restrict, const char * __restrict, va_list); | |
| #pragma optional vfscanf | |
| #pragma optional vscanf | |
| #pragma optional vsscanf | |
| extern int __filbuf(FILE *); | |
| extern int __flsbuf(int, FILE *); | |
| extern FILE *fdopen(int, const char *); | |
| extern int fileno(FILE *); | |
| extern void flockfile(FILE *); | |
| extern int ftrylockfile(FILE *); | |
| extern void funlockfile(FILE *); | |
| extern int getc_unlocked(FILE *); | |
| extern int putc_unlocked(int, FILE *); | |
| extern int getchar_unlocked(void); | |
| extern int putchar_unlocked(int); | |
| extern FILE *popen(const char *, const char *); | |
| extern int pclose(FILE *); | |
| } | |
| # 1 "/usr/sgug/include/libdicl-0.1/getopt.h" 1 3 4 | |
| # 25 "/usr/sgug/include/libdicl-0.1/getopt.h" 3 4 | |
| # 26 "/usr/sgug/include/libdicl-0.1/getopt.h" 3 | |
| # 35 "/usr/sgug/include/libdicl-0.1/getopt.h" 3 | |
| # 1 "/usr/include/getopt.h" 1 3 4 | |
| #ident "$Revision: 1.13 $" | |
| # 27 "/usr/include/getopt.h" 3 4 | |
| extern "C" { | |
| extern int getopt(int, char *const *, const char *); | |
| extern char *optarg; | |
| extern int opterr; | |
| extern int optind; | |
| extern int optopt; | |
| # 44 "/usr/include/getopt.h" 3 4 | |
| #pragma section_non_gp (optarg) | |
| #pragma section_non_gp (opterr) | |
| #pragma section_non_gp (optind) | |
| #pragma section_non_gp (optopt) | |
| # 67 "/usr/include/getopt.h" 3 4 | |
| extern int getsubopt(char **, char *const *, char **); | |
| extern void getoptreset(void); | |
| } | |
| # 36 "/usr/sgug/include/libdicl-0.1/getopt.h" 2 3 | |
| # 425 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 2 3 4 | |
| extern "C" { | |
| extern char *ctermid(char *); | |
| extern char *cuserid(char *); | |
| extern char *tempnam(const char *, const char *); | |
| extern int getw(FILE *); | |
| extern int putw(int, FILE *); | |
| extern char *mktemp(char *); | |
| extern int mkstemp(char *); | |
| extern int setbuffer(FILE *, char *, int); | |
| extern int setlinebuf(FILE *); | |
| extern int system(const char *); | |
| extern off_t ftello(FILE *); | |
| extern int fseeko(FILE *, off_t, int); | |
| extern int fgetpos64(FILE *, fpos64_t *); | |
| extern FILE *fopen64(const char *, const char *); | |
| extern FILE *freopen64(const char *, const char *, FILE *); | |
| extern int fseek64(FILE *, __int64_t, int); | |
| extern int fseeko64(FILE *, off64_t, int); | |
| extern int fsetpos64(FILE *, const fpos64_t *); | |
| extern __int64_t ftell64(FILE *); | |
| extern off64_t ftello64(FILE *); | |
| extern FILE *tmpfile64(void); | |
| extern int __semputc(int, FILE *); | |
| extern int __semgetc(FILE *); | |
| extern int __us_rsthread_stdio; | |
| extern char *ctermid_r(char *); | |
| # 572 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/stdio_core.h" 3 4 | |
| } | |
| # 19 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/stdio.h" 2 3 4 | |
| # 6 "/usr/sgug/include/libdicl-0.1/stdio.h" 2 | |
| # 11 "/usr/sgug/include/libdicl-0.1/stdio.h" | |
| extern "C" { | |
| extern int asprintf(char **,const char *, ...) | |
| __attribute__ ((format (__printf__, 2, 3))) | |
| ; | |
| extern int rpl_sprintf(char *,const char *, ...) | |
| __attribute__ ((format (__printf__, 2, 3))) | |
| ; | |
| extern int rpl_printf(const char *, ...) | |
| __attribute__ ((format (__printf__, 1, 2))) | |
| ; | |
| extern int rpl_fprintf(FILE *, const char *, ...) | |
| __attribute__ ((format (__printf__, 2, 3))) | |
| ; | |
| extern int rpl_vfprintf(FILE *, const char *, va_list) | |
| __attribute__ ((format (__printf__, 2, 0))) | |
| ; | |
| extern int rpl_vsprintf(char *,const char *, va_list) | |
| __attribute__ ((format (__printf__, 2, 0))) | |
| ; | |
| extern int rpl_vsnprintf(char *,size_t,const char *, va_list) | |
| __attribute__ ((format (__printf__, 3, 0))) | |
| ; | |
| extern int vasprintf(char**, const char*, va_list) | |
| __attribute__ ((format (__printf__, 2, 0))) | |
| ; | |
| # 87 "/usr/sgug/include/libdicl-0.1/stdio.h" | |
| ssize_t getdelim(char **lineptr, size_t *n, int delim, FILE *stream); | |
| } | |
| # 142 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/build/poppler/poppler-config.h" 2 | |
| # 54 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/include/ctype.h" 1 3 4 | |
| # 1 "/usr/include/internal/ctype_core.h" 1 3 4 | |
| #ident "$Revision: 1.4 $" | |
| # 63 "/usr/include/internal/ctype_core.h" 3 4 | |
| # 63 "/usr/include/internal/ctype_core.h" 3 4 | |
| extern "C" { | |
| extern int isalnum(int); | |
| extern int isalpha(int); | |
| extern int isblank(int); | |
| #pragma optional isblank | |
| extern int __isblank(int); | |
| extern int iscntrl(int); | |
| extern int isdigit(int); | |
| extern int isgraph(int); | |
| extern int islower(int); | |
| extern int isprint(int); | |
| extern int ispunct(int); | |
| extern int isspace(int); | |
| extern int isupper(int); | |
| extern int isxdigit(int); | |
| extern int tolower(int); | |
| extern int toupper(int); | |
| extern int isascii(int); | |
| extern int toascii(int); | |
| extern int _tolower(int); | |
| extern int _toupper(int); | |
| } | |
| # 1 "/usr/include/internal/locale_attr_core.h" 1 3 4 | |
| # 19 "/usr/include/internal/locale_attr_core.h" 3 4 | |
| #ident "$Revision: 1.2 $" | |
| # 43 "/usr/include/internal/locale_attr_core.h" 3 4 | |
| extern "C" { | |
| typedef struct { | |
| unsigned int _class [ 257 ]; | |
| signed short _lower [ 257 ]; | |
| signed short _upper [ 257 ]; | |
| char _cswidth [ 7 ]; | |
| char _fill [ 1 ]; | |
| } __ctype_t; | |
| typedef int (*__isset_func_t)(int); | |
| typedef long wint_t; | |
| typedef int (*__iscodeset_func_t)(int, wint_t); | |
| typedef struct __attr { | |
| __ctype_t * _ctype_tbl; | |
| struct _csinfo { | |
| unsigned char _eucwidth[3]; | |
| unsigned char _scrwidth[3]; | |
| unsigned char _mb_cur_max; | |
| } _csinfo; | |
| struct _euc_func { | |
| int _is_euc; | |
| __isset_func_t _isset2; | |
| __isset_func_t _isset3; | |
| __iscodeset_func_t _iscodeset; | |
| } _euc_func; | |
| struct _collate_res { | |
| unsigned char _coll_as_cmp; | |
| } _collate_res; | |
| void * _fill[15]; | |
| } __attr_t; | |
| extern __attr_t __libc_attr; | |
| } | |
| # 103 "/usr/include/internal/ctype_core.h" 2 3 4 | |
| # 5 "/usr/include/ctype.h" 2 3 4 | |
| # 56 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/include/locale.h" 1 3 4 | |
| # 1 "/usr/include/internal/locale_core.h" 1 3 4 | |
| #ident "$Revision: 1.2 $" | |
| # 36 "/usr/include/internal/locale_core.h" 3 4 | |
| struct lconv { | |
| char *decimal_point; | |
| char *thousands_sep; | |
| char *grouping; | |
| char *int_curr_symbol; | |
| char *currency_symbol; | |
| char *mon_decimal_point; | |
| char *mon_thousands_sep; | |
| char *mon_grouping; | |
| char *positive_sign; | |
| char *negative_sign; | |
| char int_frac_digits; | |
| char frac_digits; | |
| char p_cs_precedes; | |
| char p_sep_by_space; | |
| char n_cs_precedes; | |
| char n_sep_by_space; | |
| char p_sign_posn; | |
| char n_sign_posn; | |
| # 63 "/usr/include/internal/locale_core.h" 3 4 | |
| }; | |
| # 77 "/usr/include/internal/locale_core.h" 3 4 | |
| extern "C" { | |
| extern char *setlocale(int, const char *); | |
| extern struct lconv *localeconv(void); | |
| } | |
| # 5 "/usr/include/locale.h" 2 3 4 | |
| # 57 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/include/errno.h" 1 3 4 | |
| # 1 "/usr/include/internal/errno_core.h" 1 3 4 | |
| #ident "$Revision: 1.2 $" | |
| # 35 "/usr/include/internal/errno_core.h" 3 4 | |
| # 1 "/usr/include/sys/errno.h" 1 3 4 | |
| # 13 "/usr/include/sys/errno.h" 3 4 | |
| #ident "$Revision: 3.50 $" | |
| # 36 "/usr/include/internal/errno_core.h" 2 3 4 | |
| extern "C" { | |
| extern char * sys_errlist[]; | |
| extern int sys_nerr; | |
| extern int oserror(void); | |
| extern int setoserror(int); | |
| extern int goserror(void); | |
| # 58 "/usr/include/internal/errno_core.h" 3 4 | |
| extern int *__oserror(void); | |
| # 67 "/usr/include/internal/errno_core.h" 3 4 | |
| } | |
| # 5 "/usr/include/errno.h" 2 3 4 | |
| # 59 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/limits.h" 1 3 4 | |
| # 34 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/limits.h" 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/syslimits.h" 1 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/limits.h" 1 3 4 | |
| # 194 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/limits.h" 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/limits.h" 1 3 4 | |
| # 194 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/limits.h" 3 4 | |
| # 1 "/usr/include/limits.h" 1 3 4 | |
| # 1 "/usr/include/internal/limits_core.h" 1 3 4 | |
| # 27 "/usr/include/internal/limits_core.h" 3 4 | |
| #ident "$Revision: 1.3 $" | |
| extern "C" { | |
| # 152 "/usr/include/internal/limits_core.h" 3 4 | |
| extern long _sysconf(int); | |
| # 326 "/usr/include/internal/limits_core.h" 3 4 | |
| typedef union _h_val { | |
| unsigned long i[2]; | |
| double d; | |
| } _h_val; | |
| extern const _h_val __huge_val; | |
| } | |
| # 5 "/usr/include/limits.h" 2 3 4 | |
| # 195 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/limits.h" 2 3 4 | |
| # 195 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/limits.h" 2 3 4 | |
| # 8 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/syslimits.h" 2 3 4 | |
| # 35 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/limits.h" 2 3 4 | |
| # 60 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/sgug/include/libdicl-0.1/stdlib.h" 1 | |
| # 1 "/usr/sgug/include/c++/9/stdlib.h" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/stdlib.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/cstdlib" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 40 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++config.h" 1 3 | |
| # 252 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++config.h" 3 | |
| namespace std | |
| { | |
| typedef unsigned int size_t; | |
| typedef int ptrdiff_t; | |
| typedef decltype(nullptr) nullptr_t; | |
| } | |
| # 274 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++config.h" 3 | |
| namespace std | |
| { | |
| inline namespace __cxx11 __attribute__((__abi_tag__ ("cxx11"))) { } | |
| } | |
| namespace __gnu_cxx | |
| { | |
| inline namespace __cxx11 __attribute__((__abi_tag__ ("cxx11"))) { } | |
| } | |
| # 524 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++config.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/os_defines.h" 1 3 | |
| # 525 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++config.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/cpu_defines.h" 1 3 | |
| # 528 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++config.h" 2 3 | |
| # 42 "/usr/sgug/include/c++/9/cstdlib" 2 3 | |
| # 75 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 1 "/usr/include/stdlib.h" 1 3 4 | |
| # 1 "/usr/include/internal/stdlib_core.h" 1 3 4 | |
| #ident "$Revision: 1.6 $" | |
| # 89 "/usr/include/internal/stdlib_core.h" 3 4 | |
| extern "C" { | |
| # 106 "/usr/include/internal/stdlib_core.h" 3 4 | |
| typedef long wchar_t; | |
| typedef struct { | |
| int quot; | |
| int rem; | |
| } div_t; | |
| typedef struct { | |
| long quot; | |
| long rem; | |
| } ldiv_t; | |
| typedef struct { | |
| long long quot; | |
| long long rem; | |
| } lldiv_t; | |
| # 147 "/usr/include/internal/stdlib_core.h" 3 4 | |
| } | |
| extern "C" { | |
| # 159 "/usr/include/internal/stdlib_core.h" 3 4 | |
| extern double atof(const char *); | |
| extern int atoi(const char *); | |
| extern long int atol(const char *); | |
| extern long long atoll(const char *); | |
| extern double strtod(const char * __restrict, char ** __restrict); | |
| extern float strtof(const char * __restrict, char ** __restrict); | |
| #pragma optional strtof | |
| extern long double strtold(const char * __restrict, char ** __restrict); | |
| extern long int strtol(const char * __restrict, char ** __restrict, int); | |
| extern long long strtoll(const char * __restrict, char ** __restrict, int); | |
| extern unsigned long int strtoul(const char * __restrict, char ** __restrict, int); | |
| extern unsigned long long strtoull(const char * __restrict, char ** __restrict, int); | |
| extern int rand(void); | |
| extern void srand(unsigned int); | |
| extern void *calloc(size_t, size_t); | |
| extern void free(void *); | |
| extern void *malloc(size_t); | |
| extern void *realloc(void *, size_t); | |
| # 219 "/usr/include/internal/stdlib_core.h" 3 4 | |
| extern void abort(void); | |
| extern int atexit(void (*)(void)); | |
| extern void exit(int); | |
| extern void _Exit(int); | |
| extern char *getenv(const char *); | |
| extern int system(const char *); | |
| extern void *bsearch(const void *, const void *, size_t, size_t, | |
| int (*)(const void *, const void *)); | |
| extern void qsort(void *, size_t, size_t, | |
| int (*)(const void *, const void *)); | |
| inline int abs(int x) {return x > 0 ? x : -x;} | |
| extern long int labs(long); | |
| extern long long llabs(long long); | |
| # 270 "/usr/include/internal/stdlib_core.h" 3 4 | |
| extern div_t div(int, int); | |
| extern ldiv_t ldiv(long, long); | |
| extern lldiv_t lldiv(long long, long long); | |
| extern int mblen(const char *, size_t); | |
| extern int mbtowc(wchar_t * __restrict, const char * __restrict, size_t); | |
| extern int wctomb(char *, wchar_t); | |
| extern size_t mbstowcs(wchar_t * __restrict, const char * __restrict, size_t); | |
| extern size_t wcstombs(char * __restrict, const wchar_t * __restrict, size_t); | |
| extern int putenv(const char *); | |
| extern double drand48(void); | |
| extern double erand48(unsigned short [3]); | |
| extern long lrand48(void); | |
| extern long nrand48(unsigned short [3]); | |
| extern long mrand48(void); | |
| extern long jrand48(unsigned short [3]); | |
| extern void srand48(long); | |
| extern void lcong48(unsigned short int [7]); | |
| extern void setkey(const char *); | |
| extern unsigned short * seed48(unsigned short int [3]); | |
| extern long a64l(const char *); | |
| extern char *ecvt(double, int, int *, int *); | |
| extern char *fcvt(double, int, int *, int *); | |
| extern char *gcvt(double, int, char *); | |
| extern int getsubopt(char **, char * const *, char **); | |
| extern int grantpt(int); | |
| extern char *initstate(unsigned int, char *, size_t); | |
| extern char *l64a(long); | |
| extern char *mktemp(char *); | |
| extern int mkstemp(char *); | |
| extern char *ptsname(int); | |
| extern long random(void); | |
| extern char *realpath(const char *, char *); | |
| extern char *setstate(const char *); | |
| extern void srandom(unsigned); | |
| extern int ttyslot(void); | |
| extern int unlockpt(int); | |
| extern void *valloc( size_t); | |
| extern int rand_r(unsigned int *); | |
| } | |
| extern "C" { | |
| extern int atcheckpoint(void (*)(void)); | |
| extern int atrestart(void (*)(void)); | |
| extern int dup2(int, int); | |
| extern int getpw(int, char *); | |
| extern char *getcwd(char *, size_t); | |
| extern char *getlogin(void); | |
| extern char *getpass(const char *); | |
| extern int isatty(int); | |
| extern void l3tol(long *, const char *, int); | |
| extern void ltol3(char *, const long *, int); | |
| extern void *memalign( size_t, size_t); | |
| # 366 "/usr/include/internal/stdlib_core.h" 3 4 | |
| extern long double atold(const char *); | |
| extern char *qecvt(long double, int, int *, int *); | |
| extern char *qfcvt(long double, int, int *, int *); | |
| extern char *qgcvt(long double, int, char *); | |
| extern char *ecvtl(long double, int, int *, int *); | |
| extern char *fcvtl(long double, int, int *, int *); | |
| extern char *gcvtl(long double, int, char *); | |
| # 383 "/usr/include/internal/stdlib_core.h" 3 4 | |
| extern char *ecvt_r(double, int, int *, int *, char *); | |
| extern char *fcvt_r(double, int, int *, int *, char *); | |
| extern char *qecvt_r(long double, int, int *, int *, char *); | |
| extern char *qfcvt_r(long double, int, int *, int *, char *); | |
| extern char *ecvtl_r(long double, int, int *, int *, char *); | |
| extern char *fcvtl_r(long double, int, int *, int *, char *); | |
| } | |
| # 5 "/usr/include/stdlib.h" 2 3 4 | |
| # 76 "/usr/sgug/include/c++/9/cstdlib" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/std_abs.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/std_abs.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/std_abs.h" 3 | |
| # 46 "/usr/sgug/include/c++/9/bits/std_abs.h" 3 | |
| extern "C++" | |
| { | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| using ::abs; | |
| inline long | |
| abs(long __i) { return __builtin_labs(__i); } | |
| inline long long | |
| abs(long long __x) { return __builtin_llabs (__x); } | |
| # 70 "/usr/sgug/include/c++/9/bits/std_abs.h" 3 | |
| inline constexpr double | |
| abs(double __x) | |
| { return __builtin_fabs(__x); } | |
| inline constexpr float | |
| abs(float __x) | |
| { return __builtin_fabsf(__x); } | |
| inline constexpr long double | |
| abs(long double __x) | |
| { return __builtin_fabsl(__x); } | |
| # 107 "/usr/sgug/include/c++/9/bits/std_abs.h" 3 | |
| } | |
| } | |
| # 78 "/usr/sgug/include/c++/9/cstdlib" 2 3 | |
| # 121 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| extern "C++" | |
| { | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| using ::div_t; | |
| using ::ldiv_t; | |
| using ::abort; | |
| using ::atexit; | |
| using ::atof; | |
| using ::atoi; | |
| using ::atol; | |
| using ::bsearch; | |
| using ::calloc; | |
| using ::div; | |
| using ::exit; | |
| using ::free; | |
| using ::getenv; | |
| using ::labs; | |
| using ::ldiv; | |
| using ::malloc; | |
| using ::mblen; | |
| using ::mbstowcs; | |
| using ::mbtowc; | |
| using ::qsort; | |
| using ::rand; | |
| using ::realloc; | |
| using ::srand; | |
| using ::strtod; | |
| using ::strtol; | |
| using ::strtoul; | |
| using ::system; | |
| using ::wcstombs; | |
| using ::wctomb; | |
| inline ldiv_t | |
| div(long __i, long __j) { return ldiv(__i, __j); } | |
| } | |
| # 195 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| using ::lldiv_t; | |
| using ::_Exit; | |
| using ::llabs; | |
| inline lldiv_t | |
| div(long long __n, long long __d) | |
| { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; } | |
| using ::lldiv; | |
| # 227 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| using ::atoll; | |
| using ::strtoll; | |
| using ::strtoull; | |
| using ::strtof; | |
| using ::strtold; | |
| } | |
| namespace std | |
| { | |
| using ::__gnu_cxx::lldiv_t; | |
| using ::__gnu_cxx::_Exit; | |
| using ::__gnu_cxx::llabs; | |
| using ::__gnu_cxx::div; | |
| using ::__gnu_cxx::lldiv; | |
| using ::__gnu_cxx::atoll; | |
| using ::__gnu_cxx::strtof; | |
| using ::__gnu_cxx::strtoll; | |
| using ::__gnu_cxx::strtoull; | |
| using ::__gnu_cxx::strtold; | |
| } | |
| } | |
| # 37 "/usr/sgug/include/c++/9/stdlib.h" 2 3 | |
| using std::abort; | |
| using std::atexit; | |
| using std::exit; | |
| # 51 "/usr/sgug/include/c++/9/stdlib.h" 3 | |
| using std::div_t; | |
| using std::ldiv_t; | |
| using std::abs; | |
| using std::atof; | |
| using std::atoi; | |
| using std::atol; | |
| using std::bsearch; | |
| using std::calloc; | |
| using std::div; | |
| using std::free; | |
| using std::getenv; | |
| using std::labs; | |
| using std::ldiv; | |
| using std::malloc; | |
| using std::mblen; | |
| using std::mbstowcs; | |
| using std::mbtowc; | |
| using std::qsort; | |
| using std::rand; | |
| using std::realloc; | |
| using std::srand; | |
| using std::strtod; | |
| using std::strtol; | |
| using std::strtoul; | |
| using std::system; | |
| using std::wcstombs; | |
| using std::wctomb; | |
| # 6 "/usr/sgug/include/libdicl-0.1/stdlib.h" 2 | |
| # 11 "/usr/sgug/include/libdicl-0.1/stdlib.h" | |
| extern "C" { | |
| extern double ld_strtod(const char *, char **); | |
| extern long double ld_strtold(const char *, char **); | |
| extern long int ld_strtol(const char *, char **, int ); | |
| extern long long int ld_strtoll(const char *, char **, int ); | |
| extern unsigned long int ld_strtoul(const char *, char **, int ); | |
| extern unsigned long long int ld_strtoull(const char *, char **, int ); | |
| int setenv(const char *name, const char*value, int overwrite); | |
| int unsetenv(const char *name); | |
| const char *getprogname(void); | |
| void setprogname(const char *progname); | |
| char *mkdtemp(char *ftemplate); | |
| void qsort_r(void *, size_t, size_t, | |
| int(*)(const void*,const void*, void*), | |
| void *); | |
| } | |
| namespace std { | |
| double ld_strtod(const char *, char **); | |
| long double ld_strtold(const char *, char **); | |
| long int ld_strtol(const char *, char **, int ); | |
| long long int ld_strtoll(const char *, char **, int ); | |
| unsigned long int ld_strtoul(const char *, char **, int ); | |
| unsigned long long int ld_strtoull(const char *, char **, int ); | |
| } | |
| # 61 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stddef.h" 1 3 4 | |
| # 143 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stddef.h" 3 4 | |
| # 143 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stddef.h" 3 4 | |
| typedef int ptrdiff_t; | |
| # 415 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stddef.h" 3 4 | |
| typedef struct { | |
| long long __max_align_ll __attribute__((__aligned__(__alignof__(long long)))); | |
| long double __max_align_ld __attribute__((__aligned__(__alignof__(long double)))); | |
| # 426 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stddef.h" 3 4 | |
| } max_align_t; | |
| typedef decltype(nullptr) nullptr_t; | |
| # 62 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/sgug/include/libdicl-0.1/string.h" 1 | |
| # 1 "/usr/include/string.h" 1 3 4 | |
| # 1 "/usr/include/internal/string_core.h" 1 3 4 | |
| #ident "$Revision: 1.5 $" | |
| # 38 "/usr/include/internal/string_core.h" 3 4 | |
| extern "C" { | |
| # 61 "/usr/include/internal/string_core.h" 3 4 | |
| extern void *memcpy(void * __restrict, const void * __restrict, size_t); | |
| extern void *memmove(void *, const void *, size_t); | |
| extern char *strcpy(char * __restrict, const char * __restrict); | |
| extern char *strncpy(char * __restrict, const char * __restrict, size_t); | |
| extern char *strcat(char * __restrict, const char * __restrict); | |
| extern char *strncat(char * __restrict, const char * __restrict, size_t); | |
| extern void *memccpy(void *, const void *, int, size_t); | |
| extern int memcmp(const void *, const void *, size_t); | |
| extern int strcmp(const char *, const char *); | |
| extern int strcoll(const char *, const char *); | |
| extern int strncmp(const char *, const char *, size_t); | |
| extern size_t strxfrm(char * __restrict, const char * __restrict, size_t); | |
| extern void *memchr(const void *, int, size_t); | |
| extern char *strchr(const char *, int); | |
| extern size_t strcspn(const char *, const char *); | |
| #pragma int_to_unsigned strcspn | |
| extern char *strpbrk(const char *, const char *); | |
| extern char *strrchr(const char *, int); | |
| extern size_t strspn(const char *, const char *); | |
| #pragma int_to_unsigned strspn | |
| extern char *strstr(const char *, const char *); | |
| extern char *strtok(char * __restrict, const char * __restrict); | |
| extern void *memset(void *, int, size_t); | |
| extern char *strerror(int); | |
| extern size_t strlen(const char *); | |
| #pragma int_to_unsigned strlen | |
| extern int ffs(int); | |
| extern int strcasecmp(const char *, const char *); | |
| extern int strncasecmp(const char *, const char *, | |
| size_t); | |
| extern size_t strlcat(char *, const char *, | |
| size_t); | |
| extern size_t strlcpy(char *, const char *, | |
| size_t); | |
| #pragma optional strlcat | |
| #pragma optional strlcpy | |
| extern char *strdup(const char *); | |
| extern char *strtok_r(char *, const char *, char **); | |
| # 160 "/usr/include/internal/string_core.h" 3 4 | |
| } | |
| # 5 "/usr/include/string.h" 2 3 4 | |
| # 6 "/usr/sgug/include/libdicl-0.1/string.h" 2 | |
| # 11 "/usr/sgug/include/libdicl-0.1/string.h" | |
| extern "C" { | |
| char *rpl_strstr(const char*, const char*); | |
| void *mempcpy(void *, const void* ,size_t); | |
| char *stpcpy(char *, const char*); | |
| char *stpncpy(char *, const char*, size_t); | |
| char * strchrnul(const char *, int); | |
| int strerror_r(int, char*, size_t); | |
| char *strndup(const char*, size_t); | |
| char *strsep(char **, char*); | |
| char *strcasestr(const char*, const char*); | |
| char *strsignal(int sig); | |
| size_t strnlen(const char*, size_t); | |
| } | |
| # 63 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/sgug/include/libdicl-0.1/time.h" 1 | |
| # 1 "/usr/include/time.h" 1 3 4 | |
| # 1 "/usr/include/internal/time_core.h" 1 3 4 | |
| #ident "$Revision: 1.7 $" | |
| # 34 "/usr/include/internal/time_core.h" 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 1 3 4 | |
| # 36 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| #ident "$Revision: 3.148 $" | |
| # 43 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef unsigned char uchar_t; | |
| typedef unsigned short ushort_t; | |
| typedef unsigned int uint_t; | |
| typedef unsigned long ulong_t; | |
| # 1 "/usr/include/sys/pthread.h" 1 3 4 | |
| extern "C" { | |
| typedef unsigned int pthread_t; | |
| typedef struct { long __D[5]; } pthread_attr_t; | |
| typedef struct { long __D[8]; } pthread_mutex_t; | |
| typedef struct { long __D[2]; } pthread_mutexattr_t; | |
| typedef struct { long __D[8]; } pthread_cond_t; | |
| typedef struct { long __D[2]; } pthread_condattr_t; | |
| typedef struct { long __D[16]; } pthread_rwlock_t; | |
| typedef struct { long __D[4]; } pthread_rwlockattr_t; | |
| typedef int pthread_key_t; | |
| typedef int pthread_once_t; | |
| typedef struct { long __D[2]; } pthread_barrierattr_t; | |
| typedef struct { long __D[16]; } pthread_barrier_t; | |
| typedef struct { long __D[4]; } pthread_spinlock_t; | |
| } | |
| # 51 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 2 3 4 | |
| typedef long blksize_t; | |
| typedef long suseconds_t; | |
| typedef long xtiscalar_t; | |
| typedef unsigned long xtiuscalar_t; | |
| typedef xtiscalar_t t_scalar_t; | |
| typedef xtiuscalar_t t_uscalar_t; | |
| typedef char * addr_t; | |
| typedef char * caddr_t; | |
| typedef __int64_t daddr_t; | |
| typedef long pgno_t; | |
| typedef __uint32_t pfn_t; | |
| typedef short cnt_t; | |
| typedef unsigned long basictime_t; | |
| typedef __int64_t micro_t; | |
| typedef __int32_t pgcnt_t; | |
| typedef enum { B_FALSE, B_TRUE } boolean_t; | |
| # 101 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef long id_t; | |
| # 114 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef ulong_t major_t; | |
| typedef ulong_t minor_t; | |
| # 133 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef ushort_t o_mode_t; | |
| typedef short o_dev_t; | |
| typedef ushort_t o_uid_t; | |
| typedef o_uid_t o_gid_t; | |
| typedef short o_nlink_t; | |
| typedef short o_pid_t; | |
| typedef __uint32_t o_ino_t; | |
| typedef unsigned long mode_t; | |
| typedef unsigned long dev_t; | |
| typedef long uid_t; | |
| typedef long gid_t; | |
| typedef unsigned long nlink_t; | |
| typedef long pid_t; | |
| # 158 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef int tid_t; | |
| typedef dev_t vertex_hdl_t; | |
| typedef __uint64_t ino_t; | |
| typedef __uint64_t ino64_t; | |
| # 187 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef __scint_t __scoff_t; | |
| typedef __scoff_t scoff_t; | |
| typedef __int64_t blkcnt64_t; | |
| typedef __uint64_t fsblkcnt64_t; | |
| typedef __uint64_t fsfilcnt64_t; | |
| typedef __int64_t blkcnt_t; | |
| typedef __uint64_t fsblkcnt_t; | |
| typedef __uint64_t fsfilcnt_t; | |
| typedef long swblk_t; | |
| typedef unsigned long paddr_t; | |
| typedef unsigned long iopaddr_t; | |
| typedef int key_t; | |
| typedef unsigned char use_t; | |
| typedef long sysid_t; | |
| typedef short index_t; | |
| typedef signed short nasid_t; | |
| typedef signed short cnodeid_t; | |
| typedef signed char partid_t; | |
| typedef signed short moduleid_t; | |
| typedef signed short cmoduleid_t; | |
| typedef uchar_t clusterid_t; | |
| typedef unsigned int lock_t; | |
| typedef signed short cpuid_t; | |
| typedef unsigned char pri_t; | |
| typedef __uint64_t accum_t; | |
| typedef __int64_t prid_t; | |
| typedef __int64_t ash_t; | |
| typedef short cell_t; | |
| typedef int credid_t; | |
| typedef __int64_t jid_t; | |
| typedef __int32_t ncpus_t; | |
| typedef __uint64_t id_type_t; | |
| # 257 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| # 270 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef long time_t; | |
| # 285 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef long clock_t; | |
| # 320 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef int clockid_t; | |
| typedef int timer_t; | |
| # 333 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef unsigned int useconds_t; | |
| typedef __scunsigned_t bitnum_t; | |
| typedef __scunsigned_t bitlen_t; | |
| typedef int processorid_t; | |
| typedef int toid_t; | |
| typedef long *qaddr_t; | |
| typedef __uint32_t inst_t; | |
| # 356 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef __uint64_t machreg_t; | |
| # 366 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef __uint64_t fpreg_t; | |
| # 377 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef signed char int8_t; | |
| typedef unsigned char uint8_t; | |
| typedef signed short int16_t; | |
| typedef unsigned short uint16_t; | |
| typedef signed int int32_t; | |
| typedef unsigned int uint32_t; | |
| typedef __int64_t int64_t; | |
| typedef __uint64_t uint64_t; | |
| typedef __int64_t intmax_t; | |
| typedef __uint64_t uintmax_t; | |
| typedef signed long int intptr_t; | |
| typedef unsigned long int uintptr_t; | |
| typedef unsigned char u_int8_t; | |
| typedef unsigned short u_int16_t; | |
| typedef __uint32_t u_int32_t; | |
| # 420 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| typedef long hostid_t; | |
| # 435 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 3 4 | |
| # 1 "/usr/include/sys/bsd_types.h" 1 3 4 | |
| # 21 "/usr/include/sys/bsd_types.h" 3 4 | |
| #ident "$Revision: 1.2 $" | |
| typedef struct { int r[1]; } * physadr; | |
| typedef unsigned char unchar; | |
| typedef unsigned char u_char; | |
| typedef unsigned short ushort; | |
| typedef unsigned short u_short; | |
| typedef unsigned int uint; | |
| typedef unsigned int u_int; | |
| typedef unsigned long ulong; | |
| typedef unsigned long u_long; | |
| typedef struct _quad { long val[2]; } quad; | |
| # 1 "/usr/include/sys/select.h" 1 3 4 | |
| # 29 "/usr/include/sys/select.h" 3 4 | |
| #ident "$Revision: 1.18 $" | |
| extern "C" { | |
| # 55 "/usr/include/sys/select.h" 3 4 | |
| typedef long fd_mask_t; | |
| typedef unsigned long ufd_mask_t; | |
| # 67 "/usr/include/sys/select.h" 3 4 | |
| typedef struct fd_set { | |
| fd_mask_t fds_bits[(((1024)+(((int)(sizeof(fd_mask_t) * 8))-1))/((int)(sizeof(fd_mask_t) * 8)))]; | |
| } fd_set; | |
| # 83 "/usr/include/sys/select.h" 3 4 | |
| # 95 "/usr/include/sys/select.h" 3 4 | |
| # 123 "/usr/include/sys/select.h" 3 4 | |
| typedef long fd_mask; | |
| # 132 "/usr/include/sys/select.h" 3 4 | |
| } | |
| # 45 "/usr/include/sys/bsd_types.h" 2 3 4 | |
| # 436 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/types.h" 2 3 4 | |
| typedef __uint64_t k_sigset_t; | |
| # 35 "/usr/include/internal/time_core.h" 2 3 4 | |
| extern "C" { | |
| # 74 "/usr/include/internal/time_core.h" 3 4 | |
| } | |
| # 1 "/usr/include/sys/ptimers.h" 1 3 4 | |
| # 19 "/usr/include/sys/ptimers.h" 3 4 | |
| #ident "$Id: ptimers.h,v 1.5 2002/08/07 15:19:38 murthy Exp $" | |
| # 1 "/usr/include/sys/timespec.h" 1 3 4 | |
| # 19 "/usr/include/sys/timespec.h" 3 4 | |
| #ident "$Revision: 1.11 $" | |
| # 54 "/usr/include/sys/timespec.h" 3 4 | |
| typedef struct timespec { | |
| time_t tv_sec; | |
| long tv_nsec; | |
| } timespec_t; | |
| # 26 "/usr/include/sys/ptimers.h" 2 3 4 | |
| typedef struct itimerspec { | |
| timespec_t it_interval; | |
| timespec_t it_value; | |
| } itimerspec_t; | |
| # 82 "/usr/include/internal/time_core.h" 2 3 4 | |
| # 110 "/usr/include/internal/time_core.h" 3 4 | |
| extern "C" { | |
| 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; | |
| }; | |
| extern clock_t clock(void); | |
| extern double difftime(time_t, time_t); | |
| extern time_t mktime(struct tm *); | |
| extern time_t time(time_t *); | |
| extern char *asctime(const struct tm *); | |
| extern char *ctime (const time_t *); | |
| extern struct tm *gmtime(const time_t *); | |
| extern struct tm *localtime(const time_t *); | |
| extern size_t strftime(char * __restrict, size_t, const char * __restrict, const struct tm * __restrict); | |
| extern uint64_t rdrtc(void); | |
| #pragma optional rdrtc | |
| extern void tzset(void); | |
| extern char *tzname[2]; | |
| # 170 "/usr/include/internal/time_core.h" 3 4 | |
| } | |
| extern "C" { | |
| struct sigevent; | |
| extern int clock_settime(clockid_t, const timespec_t *); | |
| extern int clock_gettime(clockid_t, timespec_t *); | |
| extern int clock_getres(clockid_t, timespec_t *); | |
| extern int nanosleep(const timespec_t *, timespec_t *); | |
| extern int timer_create(clockid_t, struct sigevent *, timer_t *); | |
| extern int timer_delete(timer_t); | |
| extern int timer_settime(timer_t, int, const struct itimerspec *, struct itimerspec *); | |
| extern int timer_gettime(timer_t, struct itimerspec *); | |
| extern int timer_getoverrun(timer_t); | |
| } | |
| #pragma optional nanosleep | |
| extern "C" { | |
| extern time_t timezone; | |
| extern int daylight; | |
| extern char *strptime(const char *, const char *, struct tm *); | |
| extern struct tm *getdate(const char *); | |
| extern int getdate_err; | |
| extern int cftime(char *, char *, const time_t *); | |
| extern int ascftime(char *, const char *, const struct tm *); | |
| extern time_t altzone; | |
| extern char *asctime_r(const struct tm *, char *); | |
| extern char *ctime_r(const time_t *, char *); | |
| extern struct tm *gmtime_r(const time_t *, | |
| struct tm *); | |
| extern struct tm *localtime_r(const time_t *, | |
| struct tm *); | |
| } | |
| # 5 "/usr/include/time.h" 2 3 4 | |
| # 6 "/usr/sgug/include/libdicl-0.1/time.h" 2 | |
| # 11 "/usr/sgug/include/libdicl-0.1/time.h" | |
| extern "C" { | |
| time_t timegm(struct tm *tm); | |
| } | |
| # 64 "/usr/people/mach/rpmbuild/BUILD/poppler-0.73.0/poppler/PDFDoc.cc" 2 | |
| # 1 "/usr/sgug/include/c++/9/regex" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/regex" 3 | |
| # 33 "/usr/sgug/include/c++/9/regex" 3 | |
| # 1 "/usr/sgug/include/c++/9/algorithm" 1 3 | |
| # 58 "/usr/sgug/include/c++/9/algorithm" 3 | |
| # 59 "/usr/sgug/include/c++/9/algorithm" 3 | |
| # 1 "/usr/sgug/include/c++/9/utility" 1 3 | |
| # 58 "/usr/sgug/include/c++/9/utility" 3 | |
| # 59 "/usr/sgug/include/c++/9/utility" 3 | |
| # 69 "/usr/sgug/include/c++/9/utility" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_relops.h" 1 3 | |
| # 67 "/usr/sgug/include/c++/9/bits/stl_relops.h" 3 | |
| # 67 "/usr/sgug/include/c++/9/bits/stl_relops.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| namespace rel_ops | |
| { | |
| # 85 "/usr/sgug/include/c++/9/bits/stl_relops.h" 3 | |
| template <class _Tp> | |
| inline bool | |
| operator!=(const _Tp& __x, const _Tp& __y) | |
| { return !(__x == __y); } | |
| # 98 "/usr/sgug/include/c++/9/bits/stl_relops.h" 3 | |
| template <class _Tp> | |
| inline bool | |
| operator>(const _Tp& __x, const _Tp& __y) | |
| { return __y < __x; } | |
| # 111 "/usr/sgug/include/c++/9/bits/stl_relops.h" 3 | |
| template <class _Tp> | |
| inline bool | |
| operator<=(const _Tp& __x, const _Tp& __y) | |
| { return !(__y < __x); } | |
| # 124 "/usr/sgug/include/c++/9/bits/stl_relops.h" 3 | |
| template <class _Tp> | |
| inline bool | |
| operator>=(const _Tp& __x, const _Tp& __y) | |
| { return !(__x < __y); } | |
| } | |
| } | |
| # 70 "/usr/sgug/include/c++/9/utility" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_pair.h" 1 3 | |
| # 59 "/usr/sgug/include/c++/9/bits/stl_pair.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/move.h" 1 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/move.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/concept_check.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/concept_check.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/concept_check.h" 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/move.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Tp> | |
| inline constexpr _Tp* | |
| __addressof(_Tp& __r) noexcept | |
| { return __builtin_addressof(__r); } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/type_traits" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/type_traits" 3 | |
| # 33 "/usr/sgug/include/c++/9/type_traits" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 56 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp, _Tp __v> | |
| struct integral_constant | |
| { | |
| static constexpr _Tp value = __v; | |
| typedef _Tp value_type; | |
| typedef integral_constant<_Tp, __v> type; | |
| constexpr operator value_type() const noexcept { return value; } | |
| constexpr value_type operator()() const noexcept { return value; } | |
| }; | |
| template<typename _Tp, _Tp __v> | |
| constexpr _Tp integral_constant<_Tp, __v>::value; | |
| typedef integral_constant<bool, true> true_type; | |
| typedef integral_constant<bool, false> false_type; | |
| template<bool __v> | |
| using __bool_constant = integral_constant<bool, __v>; | |
| # 91 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<bool, typename, typename> | |
| struct conditional; | |
| template<typename...> | |
| struct __or_; | |
| template<> | |
| struct __or_<> | |
| : public false_type | |
| { }; | |
| template<typename _B1> | |
| struct __or_<_B1> | |
| : public _B1 | |
| { }; | |
| template<typename _B1, typename _B2> | |
| struct __or_<_B1, _B2> | |
| : public conditional<_B1::value, _B1, _B2>::type | |
| { }; | |
| template<typename _B1, typename _B2, typename _B3, typename... _Bn> | |
| struct __or_<_B1, _B2, _B3, _Bn...> | |
| : public conditional<_B1::value, _B1, __or_<_B2, _B3, _Bn...>>::type | |
| { }; | |
| template<typename...> | |
| struct __and_; | |
| template<> | |
| struct __and_<> | |
| : public true_type | |
| { }; | |
| template<typename _B1> | |
| struct __and_<_B1> | |
| : public _B1 | |
| { }; | |
| template<typename _B1, typename _B2> | |
| struct __and_<_B1, _B2> | |
| : public conditional<_B1::value, _B2, _B1>::type | |
| { }; | |
| template<typename _B1, typename _B2, typename _B3, typename... _Bn> | |
| struct __and_<_B1, _B2, _B3, _Bn...> | |
| : public conditional<_B1::value, __and_<_B2, _B3, _Bn...>, _B1>::type | |
| { }; | |
| template<typename _Pp> | |
| struct __not_ | |
| : public __bool_constant<!bool(_Pp::value)> | |
| { }; | |
| # 185 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp> | |
| struct __success_type | |
| { typedef _Tp type; }; | |
| struct __failure_type | |
| { }; | |
| template<typename> | |
| struct remove_cv; | |
| template<typename> | |
| struct __is_void_helper | |
| : public false_type { }; | |
| template<> | |
| struct __is_void_helper<void> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_void | |
| : public __is_void_helper<typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename> | |
| struct __is_integral_helper | |
| : public false_type { }; | |
| template<> | |
| struct __is_integral_helper<bool> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<char> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<signed char> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<unsigned char> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<wchar_t> | |
| : public true_type { }; | |
| # 243 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<> | |
| struct __is_integral_helper<char16_t> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<char32_t> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<short> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<unsigned short> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<int> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<unsigned int> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<long> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<unsigned long> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<long long> | |
| : public true_type { }; | |
| template<> | |
| struct __is_integral_helper<unsigned long long> | |
| : public true_type { }; | |
| # 323 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp> | |
| struct is_integral | |
| : public __is_integral_helper<typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename> | |
| struct __is_floating_point_helper | |
| : public false_type { }; | |
| template<> | |
| struct __is_floating_point_helper<float> | |
| : public true_type { }; | |
| template<> | |
| struct __is_floating_point_helper<double> | |
| : public true_type { }; | |
| template<> | |
| struct __is_floating_point_helper<long double> | |
| : public true_type { }; | |
| # 351 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp> | |
| struct is_floating_point | |
| : public __is_floating_point_helper<typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename> | |
| struct is_array | |
| : public false_type { }; | |
| template<typename _Tp, std::size_t _Size> | |
| struct is_array<_Tp[_Size]> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_array<_Tp[]> | |
| : public true_type { }; | |
| template<typename> | |
| struct __is_pointer_helper | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_pointer_helper<_Tp*> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_pointer | |
| : public __is_pointer_helper<typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename> | |
| struct is_lvalue_reference | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct is_lvalue_reference<_Tp&> | |
| : public true_type { }; | |
| template<typename> | |
| struct is_rvalue_reference | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct is_rvalue_reference<_Tp&&> | |
| : public true_type { }; | |
| template<typename> | |
| struct is_function; | |
| template<typename> | |
| struct __is_member_object_pointer_helper | |
| : public false_type { }; | |
| template<typename _Tp, typename _Cp> | |
| struct __is_member_object_pointer_helper<_Tp _Cp::*> | |
| : public __not_<is_function<_Tp>>::type { }; | |
| template<typename _Tp> | |
| struct is_member_object_pointer | |
| : public __is_member_object_pointer_helper< | |
| typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename> | |
| struct __is_member_function_pointer_helper | |
| : public false_type { }; | |
| template<typename _Tp, typename _Cp> | |
| struct __is_member_function_pointer_helper<_Tp _Cp::*> | |
| : public is_function<_Tp>::type { }; | |
| template<typename _Tp> | |
| struct is_member_function_pointer | |
| : public __is_member_function_pointer_helper< | |
| typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename _Tp> | |
| struct is_enum | |
| : public integral_constant<bool, __is_enum(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_union | |
| : public integral_constant<bool, __is_union(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_class | |
| : public integral_constant<bool, __is_class(_Tp)> | |
| { }; | |
| template<typename> | |
| struct is_function | |
| : public false_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) const > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) const & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) const && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) const > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) const & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) const && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) volatile > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) volatile & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) volatile && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) volatile > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) volatile & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) volatile && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) const volatile > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) const volatile & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes...) const volatile && > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) const volatile > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) const volatile & > | |
| : public true_type { }; | |
| template<typename _Res, typename... _ArgTypes > | |
| struct is_function<_Res(_ArgTypes......) const volatile && > | |
| : public true_type { }; | |
| template<typename> | |
| struct __is_null_pointer_helper | |
| : public false_type { }; | |
| template<> | |
| struct __is_null_pointer_helper<std::nullptr_t> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_null_pointer | |
| : public __is_null_pointer_helper<typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_nullptr_t | |
| : public is_null_pointer<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| struct is_reference | |
| : public __or_<is_lvalue_reference<_Tp>, | |
| is_rvalue_reference<_Tp>>::type | |
| { }; | |
| template<typename _Tp> | |
| struct is_arithmetic | |
| : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type | |
| { }; | |
| template<typename _Tp> | |
| struct is_fundamental | |
| : public __or_<is_arithmetic<_Tp>, is_void<_Tp>, | |
| is_null_pointer<_Tp>>::type | |
| { }; | |
| template<typename _Tp> | |
| struct is_object | |
| : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>, | |
| is_void<_Tp>>>::type | |
| { }; | |
| template<typename> | |
| struct is_member_pointer; | |
| template<typename _Tp> | |
| struct is_scalar | |
| : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>, | |
| is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type | |
| { }; | |
| template<typename _Tp> | |
| struct is_compound | |
| : public __not_<is_fundamental<_Tp>>::type { }; | |
| template<typename _Tp> | |
| struct __is_member_pointer_helper | |
| : public false_type { }; | |
| template<typename _Tp, typename _Cp> | |
| struct __is_member_pointer_helper<_Tp _Cp::*> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_member_pointer | |
| : public __is_member_pointer_helper<typename remove_cv<_Tp>::type>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_referenceable | |
| : public __or_<is_object<_Tp>, is_reference<_Tp>>::type | |
| { }; | |
| template<typename _Res, typename... _Args > | |
| struct __is_referenceable<_Res(_Args...) > | |
| : public true_type | |
| { }; | |
| template<typename _Res, typename... _Args > | |
| struct __is_referenceable<_Res(_Args......) > | |
| : public true_type | |
| { }; | |
| template<typename> | |
| struct is_const | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct is_const<_Tp const> | |
| : public true_type { }; | |
| template<typename> | |
| struct is_volatile | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct is_volatile<_Tp volatile> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_trivial | |
| : public integral_constant<bool, __is_trivial(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_copyable | |
| : public integral_constant<bool, __is_trivially_copyable(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_standard_layout | |
| : public integral_constant<bool, __is_standard_layout(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_pod | |
| : public integral_constant<bool, __is_pod(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_literal_type | |
| : public integral_constant<bool, __is_literal_type(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_empty | |
| : public integral_constant<bool, __is_empty(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_polymorphic | |
| : public integral_constant<bool, __is_polymorphic(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_final | |
| : public integral_constant<bool, __is_final(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_abstract | |
| : public integral_constant<bool, __is_abstract(_Tp)> | |
| { }; | |
| template<typename _Tp, | |
| bool = is_arithmetic<_Tp>::value> | |
| struct __is_signed_helper | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_signed_helper<_Tp, true> | |
| : public integral_constant<bool, _Tp(-1) < _Tp(0)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_signed | |
| : public __is_signed_helper<_Tp>::type | |
| { }; | |
| template<typename _Tp> | |
| struct is_unsigned | |
| : public __and_<is_arithmetic<_Tp>, __not_<is_signed<_Tp>>> | |
| { }; | |
| # 758 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp, typename _Up = _Tp&&> | |
| _Up | |
| __declval(int); | |
| template<typename _Tp> | |
| _Tp | |
| __declval(long); | |
| template<typename _Tp> | |
| auto declval() noexcept -> decltype(__declval<_Tp>(0)); | |
| template<typename, unsigned = 0> | |
| struct extent; | |
| template<typename> | |
| struct remove_all_extents; | |
| template<typename _Tp> | |
| struct __is_array_known_bounds | |
| : public integral_constant<bool, (extent<_Tp>::value > 0)> | |
| { }; | |
| template<typename _Tp> | |
| struct __is_array_unknown_bounds | |
| : public __and_<is_array<_Tp>, __not_<extent<_Tp>>> | |
| { }; | |
| struct __do_is_destructible_impl | |
| { | |
| template<typename _Tp, typename = decltype(declval<_Tp&>().~_Tp())> | |
| static true_type __test(int); | |
| template<typename> | |
| static false_type __test(...); | |
| }; | |
| template<typename _Tp> | |
| struct __is_destructible_impl | |
| : public __do_is_destructible_impl | |
| { | |
| typedef decltype(__test<_Tp>(0)) type; | |
| }; | |
| template<typename _Tp, | |
| bool = __or_<is_void<_Tp>, | |
| __is_array_unknown_bounds<_Tp>, | |
| is_function<_Tp>>::value, | |
| bool = __or_<is_reference<_Tp>, is_scalar<_Tp>>::value> | |
| struct __is_destructible_safe; | |
| template<typename _Tp> | |
| struct __is_destructible_safe<_Tp, false, false> | |
| : public __is_destructible_impl<typename | |
| remove_all_extents<_Tp>::type>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_destructible_safe<_Tp, true, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_destructible_safe<_Tp, false, true> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_destructible | |
| : public __is_destructible_safe<_Tp>::type | |
| { }; | |
| struct __do_is_nt_destructible_impl | |
| { | |
| template<typename _Tp> | |
| static __bool_constant<noexcept(declval<_Tp&>().~_Tp())> | |
| __test(int); | |
| template<typename> | |
| static false_type __test(...); | |
| }; | |
| template<typename _Tp> | |
| struct __is_nt_destructible_impl | |
| : public __do_is_nt_destructible_impl | |
| { | |
| typedef decltype(__test<_Tp>(0)) type; | |
| }; | |
| template<typename _Tp, | |
| bool = __or_<is_void<_Tp>, | |
| __is_array_unknown_bounds<_Tp>, | |
| is_function<_Tp>>::value, | |
| bool = __or_<is_reference<_Tp>, is_scalar<_Tp>>::value> | |
| struct __is_nt_destructible_safe; | |
| template<typename _Tp> | |
| struct __is_nt_destructible_safe<_Tp, false, false> | |
| : public __is_nt_destructible_impl<typename | |
| remove_all_extents<_Tp>::type>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_nt_destructible_safe<_Tp, true, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_nt_destructible_safe<_Tp, false, true> | |
| : public true_type { }; | |
| template<typename _Tp> | |
| struct is_nothrow_destructible | |
| : public __is_nt_destructible_safe<_Tp>::type | |
| { }; | |
| template<typename _Tp, typename... _Args> | |
| struct is_constructible | |
| : public __bool_constant<__is_constructible(_Tp, _Args...)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_default_constructible | |
| : public is_constructible<_Tp>::type | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_copy_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_copy_constructible_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_copy_constructible_impl<_Tp, true> | |
| : public is_constructible<_Tp, const _Tp&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_copy_constructible | |
| : public __is_copy_constructible_impl<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_move_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_move_constructible_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_move_constructible_impl<_Tp, true> | |
| : public is_constructible<_Tp, _Tp&&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_move_constructible | |
| : public __is_move_constructible_impl<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| struct __is_nt_default_constructible_atom | |
| : public integral_constant<bool, noexcept(_Tp())> | |
| { }; | |
| template<typename _Tp, bool = is_array<_Tp>::value> | |
| struct __is_nt_default_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_nt_default_constructible_impl<_Tp, true> | |
| : public __and_<__is_array_known_bounds<_Tp>, | |
| __is_nt_default_constructible_atom<typename | |
| remove_all_extents<_Tp>::type>> | |
| { }; | |
| template<typename _Tp> | |
| struct __is_nt_default_constructible_impl<_Tp, false> | |
| : public __is_nt_default_constructible_atom<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| struct is_nothrow_default_constructible | |
| : public __and_<is_default_constructible<_Tp>, | |
| __is_nt_default_constructible_impl<_Tp>> | |
| { }; | |
| template<typename _Tp, typename... _Args> | |
| struct __is_nt_constructible_impl | |
| : public integral_constant<bool, noexcept(_Tp(declval<_Args>()...))> | |
| { }; | |
| template<typename _Tp, typename _Arg> | |
| struct __is_nt_constructible_impl<_Tp, _Arg> | |
| : public integral_constant<bool, | |
| noexcept(static_cast<_Tp>(declval<_Arg>()))> | |
| { }; | |
| template<typename _Tp> | |
| struct __is_nt_constructible_impl<_Tp> | |
| : public is_nothrow_default_constructible<_Tp> | |
| { }; | |
| template<typename _Tp, typename... _Args> | |
| struct is_nothrow_constructible | |
| : public __and_<is_constructible<_Tp, _Args...>, | |
| __is_nt_constructible_impl<_Tp, _Args...>> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_nothrow_copy_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_nothrow_copy_constructible_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_nothrow_copy_constructible_impl<_Tp, true> | |
| : public is_nothrow_constructible<_Tp, const _Tp&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_nothrow_copy_constructible | |
| : public __is_nothrow_copy_constructible_impl<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_nothrow_move_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_nothrow_move_constructible_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_nothrow_move_constructible_impl<_Tp, true> | |
| : public is_nothrow_constructible<_Tp, _Tp&&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_nothrow_move_constructible | |
| : public __is_nothrow_move_constructible_impl<_Tp> | |
| { }; | |
| template<typename _Tp, typename _Up> | |
| struct is_assignable | |
| : public __bool_constant<__is_assignable(_Tp, _Up)> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_copy_assignable_impl; | |
| template<typename _Tp> | |
| struct __is_copy_assignable_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_copy_assignable_impl<_Tp, true> | |
| : public is_assignable<_Tp&, const _Tp&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_copy_assignable | |
| : public __is_copy_assignable_impl<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_move_assignable_impl; | |
| template<typename _Tp> | |
| struct __is_move_assignable_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_move_assignable_impl<_Tp, true> | |
| : public is_assignable<_Tp&, _Tp&&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_move_assignable | |
| : public __is_move_assignable_impl<_Tp> | |
| { }; | |
| template<typename _Tp, typename _Up> | |
| struct __is_nt_assignable_impl | |
| : public integral_constant<bool, noexcept(declval<_Tp>() = declval<_Up>())> | |
| { }; | |
| template<typename _Tp, typename _Up> | |
| struct is_nothrow_assignable | |
| : public __and_<is_assignable<_Tp, _Up>, | |
| __is_nt_assignable_impl<_Tp, _Up>> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_nt_copy_assignable_impl; | |
| template<typename _Tp> | |
| struct __is_nt_copy_assignable_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_nt_copy_assignable_impl<_Tp, true> | |
| : public is_nothrow_assignable<_Tp&, const _Tp&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_nothrow_copy_assignable | |
| : public __is_nt_copy_assignable_impl<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_nt_move_assignable_impl; | |
| template<typename _Tp> | |
| struct __is_nt_move_assignable_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_nt_move_assignable_impl<_Tp, true> | |
| : public is_nothrow_assignable<_Tp&, _Tp&&> | |
| { }; | |
| template<typename _Tp> | |
| struct is_nothrow_move_assignable | |
| : public __is_nt_move_assignable_impl<_Tp> | |
| { }; | |
| template<typename _Tp, typename... _Args> | |
| struct is_trivially_constructible | |
| : public __bool_constant<__is_trivially_constructible(_Tp, _Args...)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_default_constructible | |
| : public is_trivially_constructible<_Tp>::type | |
| { }; | |
| struct __do_is_implicitly_default_constructible_impl | |
| { | |
| template <typename _Tp> | |
| static void __helper(const _Tp&); | |
| template <typename _Tp> | |
| static true_type __test(const _Tp&, | |
| decltype(__helper<const _Tp&>({}))* = 0); | |
| static false_type __test(...); | |
| }; | |
| template<typename _Tp> | |
| struct __is_implicitly_default_constructible_impl | |
| : public __do_is_implicitly_default_constructible_impl | |
| { | |
| typedef decltype(__test(declval<_Tp>())) type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_implicitly_default_constructible_safe | |
| : public __is_implicitly_default_constructible_impl<_Tp>::type | |
| { }; | |
| template <typename _Tp> | |
| struct __is_implicitly_default_constructible | |
| : public __and_<is_default_constructible<_Tp>, | |
| __is_implicitly_default_constructible_safe<_Tp>> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_trivially_copy_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_trivially_copy_constructible_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_trivially_copy_constructible_impl<_Tp, true> | |
| : public __and_<is_copy_constructible<_Tp>, | |
| integral_constant<bool, | |
| __is_trivially_constructible(_Tp, const _Tp&)>> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_copy_constructible | |
| : public __is_trivially_copy_constructible_impl<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_trivially_move_constructible_impl; | |
| template<typename _Tp> | |
| struct __is_trivially_move_constructible_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_trivially_move_constructible_impl<_Tp, true> | |
| : public __and_<is_move_constructible<_Tp>, | |
| integral_constant<bool, | |
| __is_trivially_constructible(_Tp, _Tp&&)>> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_move_constructible | |
| : public __is_trivially_move_constructible_impl<_Tp> | |
| { }; | |
| template<typename _Tp, typename _Up> | |
| struct is_trivially_assignable | |
| : public __bool_constant<__is_trivially_assignable(_Tp, _Up)> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_trivially_copy_assignable_impl; | |
| template<typename _Tp> | |
| struct __is_trivially_copy_assignable_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_trivially_copy_assignable_impl<_Tp, true> | |
| : public __bool_constant<__is_trivially_assignable(_Tp&, const _Tp&)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_copy_assignable | |
| : public __is_trivially_copy_assignable_impl<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __is_trivially_move_assignable_impl; | |
| template<typename _Tp> | |
| struct __is_trivially_move_assignable_impl<_Tp, false> | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct __is_trivially_move_assignable_impl<_Tp, true> | |
| : public __bool_constant<__is_trivially_assignable(_Tp&, _Tp&&)> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_move_assignable | |
| : public __is_trivially_move_assignable_impl<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| struct is_trivially_destructible | |
| : public __and_<is_destructible<_Tp>, | |
| __bool_constant<__has_trivial_destructor(_Tp)>> | |
| { }; | |
| template<typename _Tp> | |
| struct has_virtual_destructor | |
| : public integral_constant<bool, __has_virtual_destructor(_Tp)> | |
| { }; | |
| template<typename _Tp> | |
| struct alignment_of | |
| : public integral_constant<std::size_t, alignof(_Tp)> { }; | |
| template<typename> | |
| struct rank | |
| : public integral_constant<std::size_t, 0> { }; | |
| template<typename _Tp, std::size_t _Size> | |
| struct rank<_Tp[_Size]> | |
| : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { }; | |
| template<typename _Tp> | |
| struct rank<_Tp[]> | |
| : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { }; | |
| template<typename, unsigned _Uint> | |
| struct extent | |
| : public integral_constant<std::size_t, 0> { }; | |
| template<typename _Tp, unsigned _Uint, std::size_t _Size> | |
| struct extent<_Tp[_Size], _Uint> | |
| : public integral_constant<std::size_t, | |
| _Uint == 0 ? _Size : extent<_Tp, | |
| _Uint - 1>::value> | |
| { }; | |
| template<typename _Tp, unsigned _Uint> | |
| struct extent<_Tp[], _Uint> | |
| : public integral_constant<std::size_t, | |
| _Uint == 0 ? 0 : extent<_Tp, | |
| _Uint - 1>::value> | |
| { }; | |
| template<typename, typename> | |
| struct is_same | |
| : public false_type { }; | |
| template<typename _Tp> | |
| struct is_same<_Tp, _Tp> | |
| : public true_type { }; | |
| template<typename _Base, typename _Derived> | |
| struct is_base_of | |
| : public integral_constant<bool, __is_base_of(_Base, _Derived)> | |
| { }; | |
| template<typename _From, typename _To, | |
| bool = __or_<is_void<_From>, is_function<_To>, | |
| is_array<_To>>::value> | |
| struct __is_convertible_helper | |
| { | |
| typedef typename is_void<_To>::type type; | |
| }; | |
| template<typename _From, typename _To> | |
| class __is_convertible_helper<_From, _To, false> | |
| { | |
| template<typename _To1> | |
| static void __test_aux(_To1) noexcept; | |
| template<typename _From1, typename _To1, | |
| typename = decltype(__test_aux<_To1>(std::declval<_From1>()))> | |
| static true_type | |
| __test(int); | |
| template<typename, typename> | |
| static false_type | |
| __test(...); | |
| public: | |
| typedef decltype(__test<_From, _To>(0)) type; | |
| }; | |
| template<typename _From, typename _To> | |
| struct is_convertible | |
| : public __is_convertible_helper<_From, _To>::type | |
| { }; | |
| # 1380 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp> | |
| struct remove_const | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_const<_Tp const> | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_volatile | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_volatile<_Tp volatile> | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_cv | |
| { | |
| typedef typename | |
| remove_const<typename remove_volatile<_Tp>::type>::type type; | |
| }; | |
| template<typename _Tp> | |
| struct add_const | |
| { typedef _Tp const type; }; | |
| template<typename _Tp> | |
| struct add_volatile | |
| { typedef _Tp volatile type; }; | |
| template<typename _Tp> | |
| struct add_cv | |
| { | |
| typedef typename | |
| add_const<typename add_volatile<_Tp>::type>::type type; | |
| }; | |
| template<typename _Tp> | |
| using remove_const_t = typename remove_const<_Tp>::type; | |
| template<typename _Tp> | |
| using remove_volatile_t = typename remove_volatile<_Tp>::type; | |
| template<typename _Tp> | |
| using remove_cv_t = typename remove_cv<_Tp>::type; | |
| template<typename _Tp> | |
| using add_const_t = typename add_const<_Tp>::type; | |
| template<typename _Tp> | |
| using add_volatile_t = typename add_volatile<_Tp>::type; | |
| template<typename _Tp> | |
| using add_cv_t = typename add_cv<_Tp>::type; | |
| template<typename _Tp> | |
| struct remove_reference | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_reference<_Tp&> | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_reference<_Tp&&> | |
| { typedef _Tp type; }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __add_lvalue_reference_helper | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct __add_lvalue_reference_helper<_Tp, true> | |
| { typedef _Tp& type; }; | |
| template<typename _Tp> | |
| struct add_lvalue_reference | |
| : public __add_lvalue_reference_helper<_Tp> | |
| { }; | |
| template<typename _Tp, bool = __is_referenceable<_Tp>::value> | |
| struct __add_rvalue_reference_helper | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct __add_rvalue_reference_helper<_Tp, true> | |
| { typedef _Tp&& type; }; | |
| template<typename _Tp> | |
| struct add_rvalue_reference | |
| : public __add_rvalue_reference_helper<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| using remove_reference_t = typename remove_reference<_Tp>::type; | |
| template<typename _Tp> | |
| using add_lvalue_reference_t = typename add_lvalue_reference<_Tp>::type; | |
| template<typename _Tp> | |
| using add_rvalue_reference_t = typename add_rvalue_reference<_Tp>::type; | |
| template<typename _Unqualified, bool _IsConst, bool _IsVol> | |
| struct __cv_selector; | |
| template<typename _Unqualified> | |
| struct __cv_selector<_Unqualified, false, false> | |
| { typedef _Unqualified __type; }; | |
| template<typename _Unqualified> | |
| struct __cv_selector<_Unqualified, false, true> | |
| { typedef volatile _Unqualified __type; }; | |
| template<typename _Unqualified> | |
| struct __cv_selector<_Unqualified, true, false> | |
| { typedef const _Unqualified __type; }; | |
| template<typename _Unqualified> | |
| struct __cv_selector<_Unqualified, true, true> | |
| { typedef const volatile _Unqualified __type; }; | |
| template<typename _Qualified, typename _Unqualified, | |
| bool _IsConst = is_const<_Qualified>::value, | |
| bool _IsVol = is_volatile<_Qualified>::value> | |
| class __match_cv_qualifiers | |
| { | |
| typedef __cv_selector<_Unqualified, _IsConst, _IsVol> __match; | |
| public: | |
| typedef typename __match::__type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __make_unsigned | |
| { typedef _Tp __type; }; | |
| template<> | |
| struct __make_unsigned<char> | |
| { typedef unsigned char __type; }; | |
| template<> | |
| struct __make_unsigned<signed char> | |
| { typedef unsigned char __type; }; | |
| template<> | |
| struct __make_unsigned<short> | |
| { typedef unsigned short __type; }; | |
| template<> | |
| struct __make_unsigned<int> | |
| { typedef unsigned int __type; }; | |
| template<> | |
| struct __make_unsigned<long> | |
| { typedef unsigned long __type; }; | |
| template<> | |
| struct __make_unsigned<long long> | |
| { typedef unsigned long long __type; }; | |
| # 1593 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp, | |
| bool _IsInt = is_integral<_Tp>::value, | |
| bool _IsEnum = is_enum<_Tp>::value> | |
| class __make_unsigned_selector; | |
| template<typename _Tp> | |
| class __make_unsigned_selector<_Tp, true, false> | |
| { | |
| using __unsigned_type | |
| = typename __make_unsigned<typename remove_cv<_Tp>::type>::__type; | |
| public: | |
| using __type | |
| = typename __match_cv_qualifiers<_Tp, __unsigned_type>::__type; | |
| }; | |
| class __make_unsigned_selector_base | |
| { | |
| protected: | |
| template<typename...> struct _List { }; | |
| template<typename _Tp, typename... _Up> | |
| struct _List<_Tp, _Up...> : _List<_Up...> | |
| { static constexpr size_t __size = sizeof(_Tp); }; | |
| template<size_t _Sz, typename _Tp, bool = (_Sz <= _Tp::__size)> | |
| struct __select; | |
| template<size_t _Sz, typename _Uint, typename... _UInts> | |
| struct __select<_Sz, _List<_Uint, _UInts...>, true> | |
| { using __type = _Uint; }; | |
| template<size_t _Sz, typename _Uint, typename... _UInts> | |
| struct __select<_Sz, _List<_Uint, _UInts...>, false> | |
| : __select<_Sz, _List<_UInts...>> | |
| { }; | |
| }; | |
| template<typename _Tp> | |
| class __make_unsigned_selector<_Tp, false, true> | |
| : __make_unsigned_selector_base | |
| { | |
| using _UInts = _List<unsigned char, unsigned short, unsigned int, | |
| unsigned long, unsigned long long>; | |
| using __unsigned_type = typename __select<sizeof(_Tp), _UInts>::__type; | |
| public: | |
| using __type | |
| = typename __match_cv_qualifiers<_Tp, __unsigned_type>::__type; | |
| }; | |
| template<> | |
| struct __make_unsigned<wchar_t> | |
| { | |
| using __type | |
| = typename __make_unsigned_selector<wchar_t, false, true>::__type; | |
| }; | |
| # 1669 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<> | |
| struct __make_unsigned<char16_t> | |
| { | |
| using __type | |
| = typename __make_unsigned_selector<char16_t, false, true>::__type; | |
| }; | |
| template<> | |
| struct __make_unsigned<char32_t> | |
| { | |
| using __type | |
| = typename __make_unsigned_selector<char32_t, false, true>::__type; | |
| }; | |
| template<typename _Tp> | |
| struct make_unsigned | |
| { typedef typename __make_unsigned_selector<_Tp>::__type type; }; | |
| template<> | |
| struct make_unsigned<bool>; | |
| template<typename _Tp> | |
| struct __make_signed | |
| { typedef _Tp __type; }; | |
| template<> | |
| struct __make_signed<char> | |
| { typedef signed char __type; }; | |
| template<> | |
| struct __make_signed<unsigned char> | |
| { typedef signed char __type; }; | |
| template<> | |
| struct __make_signed<unsigned short> | |
| { typedef signed short __type; }; | |
| template<> | |
| struct __make_signed<unsigned int> | |
| { typedef signed int __type; }; | |
| template<> | |
| struct __make_signed<unsigned long> | |
| { typedef signed long __type; }; | |
| template<> | |
| struct __make_signed<unsigned long long> | |
| { typedef signed long long __type; }; | |
| # 1747 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Tp, | |
| bool _IsInt = is_integral<_Tp>::value, | |
| bool _IsEnum = is_enum<_Tp>::value> | |
| class __make_signed_selector; | |
| template<typename _Tp> | |
| class __make_signed_selector<_Tp, true, false> | |
| { | |
| using __signed_type | |
| = typename __make_signed<typename remove_cv<_Tp>::type>::__type; | |
| public: | |
| using __type | |
| = typename __match_cv_qualifiers<_Tp, __signed_type>::__type; | |
| }; | |
| template<typename _Tp> | |
| class __make_signed_selector<_Tp, false, true> | |
| { | |
| typedef typename __make_unsigned_selector<_Tp>::__type __unsigned_type; | |
| public: | |
| typedef typename __make_signed_selector<__unsigned_type>::__type __type; | |
| }; | |
| template<> | |
| struct __make_signed<wchar_t> | |
| { | |
| using __type | |
| = typename __make_signed_selector<wchar_t, false, true>::__type; | |
| }; | |
| # 1795 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<> | |
| struct __make_signed<char16_t> | |
| { | |
| using __type | |
| = typename __make_signed_selector<char16_t, false, true>::__type; | |
| }; | |
| template<> | |
| struct __make_signed<char32_t> | |
| { | |
| using __type | |
| = typename __make_signed_selector<char32_t, false, true>::__type; | |
| }; | |
| template<typename _Tp> | |
| struct make_signed | |
| { typedef typename __make_signed_selector<_Tp>::__type type; }; | |
| template<> | |
| struct make_signed<bool>; | |
| template<typename _Tp> | |
| using make_signed_t = typename make_signed<_Tp>::type; | |
| template<typename _Tp> | |
| using make_unsigned_t = typename make_unsigned<_Tp>::type; | |
| template<typename _Tp> | |
| struct remove_extent | |
| { typedef _Tp type; }; | |
| template<typename _Tp, std::size_t _Size> | |
| struct remove_extent<_Tp[_Size]> | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_extent<_Tp[]> | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct remove_all_extents | |
| { typedef _Tp type; }; | |
| template<typename _Tp, std::size_t _Size> | |
| struct remove_all_extents<_Tp[_Size]> | |
| { typedef typename remove_all_extents<_Tp>::type type; }; | |
| template<typename _Tp> | |
| struct remove_all_extents<_Tp[]> | |
| { typedef typename remove_all_extents<_Tp>::type type; }; | |
| template<typename _Tp> | |
| using remove_extent_t = typename remove_extent<_Tp>::type; | |
| template<typename _Tp> | |
| using remove_all_extents_t = typename remove_all_extents<_Tp>::type; | |
| template<typename _Tp, typename> | |
| struct __remove_pointer_helper | |
| { typedef _Tp type; }; | |
| template<typename _Tp, typename _Up> | |
| struct __remove_pointer_helper<_Tp, _Up*> | |
| { typedef _Up type; }; | |
| template<typename _Tp> | |
| struct remove_pointer | |
| : public __remove_pointer_helper<_Tp, typename remove_cv<_Tp>::type> | |
| { }; | |
| template<typename _Tp, bool = __or_<__is_referenceable<_Tp>, | |
| is_void<_Tp>>::value> | |
| struct __add_pointer_helper | |
| { typedef _Tp type; }; | |
| template<typename _Tp> | |
| struct __add_pointer_helper<_Tp, true> | |
| { typedef typename remove_reference<_Tp>::type* type; }; | |
| template<typename _Tp> | |
| struct add_pointer | |
| : public __add_pointer_helper<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| using remove_pointer_t = typename remove_pointer<_Tp>::type; | |
| template<typename _Tp> | |
| using add_pointer_t = typename add_pointer<_Tp>::type; | |
| template<std::size_t _Len> | |
| struct __aligned_storage_msa | |
| { | |
| union __type | |
| { | |
| unsigned char __data[_Len]; | |
| struct __attribute__((__aligned__)) { } __align; | |
| }; | |
| }; | |
| # 1930 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<std::size_t _Len, std::size_t _Align = | |
| __alignof__(typename __aligned_storage_msa<_Len>::__type)> | |
| struct aligned_storage | |
| { | |
| union type | |
| { | |
| unsigned char __data[_Len]; | |
| struct __attribute__((__aligned__((_Align)))) { } __align; | |
| }; | |
| }; | |
| template <typename... _Types> | |
| struct __strictest_alignment | |
| { | |
| static const size_t _S_alignment = 0; | |
| static const size_t _S_size = 0; | |
| }; | |
| template <typename _Tp, typename... _Types> | |
| struct __strictest_alignment<_Tp, _Types...> | |
| { | |
| static const size_t _S_alignment = | |
| alignof(_Tp) > __strictest_alignment<_Types...>::_S_alignment | |
| ? alignof(_Tp) : __strictest_alignment<_Types...>::_S_alignment; | |
| static const size_t _S_size = | |
| sizeof(_Tp) > __strictest_alignment<_Types...>::_S_size | |
| ? sizeof(_Tp) : __strictest_alignment<_Types...>::_S_size; | |
| }; | |
| # 1969 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template <size_t _Len, typename... _Types> | |
| struct aligned_union | |
| { | |
| private: | |
| static_assert(sizeof...(_Types) != 0, "At least one type is required"); | |
| using __strictest = __strictest_alignment<_Types...>; | |
| static const size_t _S_len = _Len > __strictest::_S_size | |
| ? _Len : __strictest::_S_size; | |
| public: | |
| static const size_t alignment_value = __strictest::_S_alignment; | |
| typedef typename aligned_storage<_S_len, alignment_value>::type type; | |
| }; | |
| template <size_t _Len, typename... _Types> | |
| const size_t aligned_union<_Len, _Types...>::alignment_value; | |
| template<typename _Up, | |
| bool _IsArray = is_array<_Up>::value, | |
| bool _IsFunction = is_function<_Up>::value> | |
| struct __decay_selector; | |
| template<typename _Up> | |
| struct __decay_selector<_Up, false, false> | |
| { typedef typename remove_cv<_Up>::type __type; }; | |
| template<typename _Up> | |
| struct __decay_selector<_Up, true, false> | |
| { typedef typename remove_extent<_Up>::type* __type; }; | |
| template<typename _Up> | |
| struct __decay_selector<_Up, false, true> | |
| { typedef typename add_pointer<_Up>::type __type; }; | |
| template<typename _Tp> | |
| class decay | |
| { | |
| typedef typename remove_reference<_Tp>::type __remove_type; | |
| public: | |
| typedef typename __decay_selector<__remove_type>::__type type; | |
| }; | |
| template<typename _Tp> | |
| class reference_wrapper; | |
| template<typename _Tp> | |
| struct __strip_reference_wrapper | |
| { | |
| typedef _Tp __type; | |
| }; | |
| template<typename _Tp> | |
| struct __strip_reference_wrapper<reference_wrapper<_Tp> > | |
| { | |
| typedef _Tp& __type; | |
| }; | |
| template<typename _Tp> | |
| struct __decay_and_strip | |
| { | |
| typedef typename __strip_reference_wrapper< | |
| typename decay<_Tp>::type>::__type __type; | |
| }; | |
| template<bool, typename _Tp = void> | |
| struct enable_if | |
| { }; | |
| template<typename _Tp> | |
| struct enable_if<true, _Tp> | |
| { typedef _Tp type; }; | |
| template<typename... _Cond> | |
| using _Require = typename enable_if<__and_<_Cond...>::value>::type; | |
| template<bool _Cond, typename _Iftrue, typename _Iffalse> | |
| struct conditional | |
| { typedef _Iftrue type; }; | |
| template<typename _Iftrue, typename _Iffalse> | |
| struct conditional<false, _Iftrue, _Iffalse> | |
| { typedef _Iffalse type; }; | |
| template<typename... _Tp> | |
| struct common_type; | |
| struct __do_common_type_impl | |
| { | |
| template<typename _Tp, typename _Up> | |
| static __success_type<typename decay<decltype | |
| (true ? std::declval<_Tp>() | |
| : std::declval<_Up>())>::type> _S_test(int); | |
| template<typename, typename> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _Tp, typename _Up> | |
| struct __common_type_impl | |
| : private __do_common_type_impl | |
| { | |
| typedef decltype(_S_test<_Tp, _Up>(0)) type; | |
| }; | |
| struct __do_member_type_wrapper | |
| { | |
| template<typename _Tp> | |
| static __success_type<typename _Tp::type> _S_test(int); | |
| template<typename> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _Tp> | |
| struct __member_type_wrapper | |
| : private __do_member_type_wrapper | |
| { | |
| typedef decltype(_S_test<_Tp>(0)) type; | |
| }; | |
| template<typename _CTp, typename... _Args> | |
| struct __expanded_common_type_wrapper | |
| { | |
| typedef common_type<typename _CTp::type, _Args...> type; | |
| }; | |
| template<typename... _Args> | |
| struct __expanded_common_type_wrapper<__failure_type, _Args...> | |
| { typedef __failure_type type; }; | |
| template<> | |
| struct common_type<> | |
| { }; | |
| template<typename _Tp> | |
| struct common_type<_Tp> | |
| : common_type<_Tp, _Tp> | |
| { }; | |
| template<typename _Tp, typename _Up> | |
| struct common_type<_Tp, _Up> | |
| : public __common_type_impl<_Tp, _Up>::type | |
| { }; | |
| template<typename _Tp, typename _Up, typename... _Vp> | |
| struct common_type<_Tp, _Up, _Vp...> | |
| : public __expanded_common_type_wrapper<typename __member_type_wrapper< | |
| common_type<_Tp, _Up>>::type, _Vp...>::type | |
| { }; | |
| template<typename _Tp, bool = is_enum<_Tp>::value> | |
| struct __underlying_type_impl | |
| { | |
| using type = __underlying_type(_Tp); | |
| }; | |
| template<typename _Tp> | |
| struct __underlying_type_impl<_Tp, false> | |
| { }; | |
| template<typename _Tp> | |
| struct underlying_type | |
| : public __underlying_type_impl<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| struct __declval_protector | |
| { | |
| static const bool __stop = false; | |
| }; | |
| template<typename _Tp> | |
| auto declval() noexcept -> decltype(__declval<_Tp>(0)) | |
| { | |
| static_assert(__declval_protector<_Tp>::__stop, | |
| "declval() must not be used!"); | |
| return __declval<_Tp>(0); | |
| } | |
| template<typename _Tp> | |
| using __remove_cvref_t | |
| = typename remove_cv<typename remove_reference<_Tp>::type>::type; | |
| template<typename _Signature> | |
| class result_of; | |
| struct __invoke_memfun_ref { }; | |
| struct __invoke_memfun_deref { }; | |
| struct __invoke_memobj_ref { }; | |
| struct __invoke_memobj_deref { }; | |
| struct __invoke_other { }; | |
| template<typename _Tp, typename _Tag> | |
| struct __result_of_success : __success_type<_Tp> | |
| { using __invoke_type = _Tag; }; | |
| struct __result_of_memfun_ref_impl | |
| { | |
| template<typename _Fp, typename _Tp1, typename... _Args> | |
| static __result_of_success<decltype( | |
| (std::declval<_Tp1>().*std::declval<_Fp>())(std::declval<_Args>()...) | |
| ), __invoke_memfun_ref> _S_test(int); | |
| template<typename...> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _MemPtr, typename _Arg, typename... _Args> | |
| struct __result_of_memfun_ref | |
| : private __result_of_memfun_ref_impl | |
| { | |
| typedef decltype(_S_test<_MemPtr, _Arg, _Args...>(0)) type; | |
| }; | |
| struct __result_of_memfun_deref_impl | |
| { | |
| template<typename _Fp, typename _Tp1, typename... _Args> | |
| static __result_of_success<decltype( | |
| ((*std::declval<_Tp1>()).*std::declval<_Fp>())(std::declval<_Args>()...) | |
| ), __invoke_memfun_deref> _S_test(int); | |
| template<typename...> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _MemPtr, typename _Arg, typename... _Args> | |
| struct __result_of_memfun_deref | |
| : private __result_of_memfun_deref_impl | |
| { | |
| typedef decltype(_S_test<_MemPtr, _Arg, _Args...>(0)) type; | |
| }; | |
| struct __result_of_memobj_ref_impl | |
| { | |
| template<typename _Fp, typename _Tp1> | |
| static __result_of_success<decltype( | |
| std::declval<_Tp1>().*std::declval<_Fp>() | |
| ), __invoke_memobj_ref> _S_test(int); | |
| template<typename, typename> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _MemPtr, typename _Arg> | |
| struct __result_of_memobj_ref | |
| : private __result_of_memobj_ref_impl | |
| { | |
| typedef decltype(_S_test<_MemPtr, _Arg>(0)) type; | |
| }; | |
| struct __result_of_memobj_deref_impl | |
| { | |
| template<typename _Fp, typename _Tp1> | |
| static __result_of_success<decltype( | |
| (*std::declval<_Tp1>()).*std::declval<_Fp>() | |
| ), __invoke_memobj_deref> _S_test(int); | |
| template<typename, typename> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _MemPtr, typename _Arg> | |
| struct __result_of_memobj_deref | |
| : private __result_of_memobj_deref_impl | |
| { | |
| typedef decltype(_S_test<_MemPtr, _Arg>(0)) type; | |
| }; | |
| template<typename _MemPtr, typename _Arg> | |
| struct __result_of_memobj; | |
| template<typename _Res, typename _Class, typename _Arg> | |
| struct __result_of_memobj<_Res _Class::*, _Arg> | |
| { | |
| typedef __remove_cvref_t<_Arg> _Argval; | |
| typedef _Res _Class::* _MemPtr; | |
| typedef typename conditional<__or_<is_same<_Argval, _Class>, | |
| is_base_of<_Class, _Argval>>::value, | |
| __result_of_memobj_ref<_MemPtr, _Arg>, | |
| __result_of_memobj_deref<_MemPtr, _Arg> | |
| >::type::type type; | |
| }; | |
| template<typename _MemPtr, typename _Arg, typename... _Args> | |
| struct __result_of_memfun; | |
| template<typename _Res, typename _Class, typename _Arg, typename... _Args> | |
| struct __result_of_memfun<_Res _Class::*, _Arg, _Args...> | |
| { | |
| typedef typename remove_reference<_Arg>::type _Argval; | |
| typedef _Res _Class::* _MemPtr; | |
| typedef typename conditional<is_base_of<_Class, _Argval>::value, | |
| __result_of_memfun_ref<_MemPtr, _Arg, _Args...>, | |
| __result_of_memfun_deref<_MemPtr, _Arg, _Args...> | |
| >::type::type type; | |
| }; | |
| template<typename _Tp, typename _Up = __remove_cvref_t<_Tp>> | |
| struct __inv_unwrap | |
| { | |
| using type = _Tp; | |
| }; | |
| template<typename _Tp, typename _Up> | |
| struct __inv_unwrap<_Tp, reference_wrapper<_Up>> | |
| { | |
| using type = _Up&; | |
| }; | |
| template<bool, bool, typename _Functor, typename... _ArgTypes> | |
| struct __result_of_impl | |
| { | |
| typedef __failure_type type; | |
| }; | |
| template<typename _MemPtr, typename _Arg> | |
| struct __result_of_impl<true, false, _MemPtr, _Arg> | |
| : public __result_of_memobj<typename decay<_MemPtr>::type, | |
| typename __inv_unwrap<_Arg>::type> | |
| { }; | |
| template<typename _MemPtr, typename _Arg, typename... _Args> | |
| struct __result_of_impl<false, true, _MemPtr, _Arg, _Args...> | |
| : public __result_of_memfun<typename decay<_MemPtr>::type, | |
| typename __inv_unwrap<_Arg>::type, _Args...> | |
| { }; | |
| struct __result_of_other_impl | |
| { | |
| template<typename _Fn, typename... _Args> | |
| static __result_of_success<decltype( | |
| std::declval<_Fn>()(std::declval<_Args>()...) | |
| ), __invoke_other> _S_test(int); | |
| template<typename...> | |
| static __failure_type _S_test(...); | |
| }; | |
| template<typename _Functor, typename... _ArgTypes> | |
| struct __result_of_impl<false, false, _Functor, _ArgTypes...> | |
| : private __result_of_other_impl | |
| { | |
| typedef decltype(_S_test<_Functor, _ArgTypes...>(0)) type; | |
| }; | |
| template<typename _Functor, typename... _ArgTypes> | |
| struct __invoke_result | |
| : public __result_of_impl< | |
| is_member_object_pointer< | |
| typename remove_reference<_Functor>::type | |
| >::value, | |
| is_member_function_pointer< | |
| typename remove_reference<_Functor>::type | |
| >::value, | |
| _Functor, _ArgTypes... | |
| >::type | |
| { }; | |
| template<typename _Functor, typename... _ArgTypes> | |
| struct result_of<_Functor(_ArgTypes...)> | |
| : public __invoke_result<_Functor, _ArgTypes...> | |
| { }; | |
| template<size_t _Len, size_t _Align = | |
| __alignof__(typename __aligned_storage_msa<_Len>::__type)> | |
| using aligned_storage_t = typename aligned_storage<_Len, _Align>::type; | |
| template <size_t _Len, typename... _Types> | |
| using aligned_union_t = typename aligned_union<_Len, _Types...>::type; | |
| template<typename _Tp> | |
| using decay_t = typename decay<_Tp>::type; | |
| template<bool _Cond, typename _Tp = void> | |
| using enable_if_t = typename enable_if<_Cond, _Tp>::type; | |
| template<bool _Cond, typename _Iftrue, typename _Iffalse> | |
| using conditional_t = typename conditional<_Cond, _Iftrue, _Iffalse>::type; | |
| template<typename... _Tp> | |
| using common_type_t = typename common_type<_Tp...>::type; | |
| template<typename _Tp> | |
| using underlying_type_t = typename underlying_type<_Tp>::type; | |
| template<typename _Tp> | |
| using result_of_t = typename result_of<_Tp>::type; | |
| template<bool _Cond, typename _Tp = void> | |
| using __enable_if_t = typename enable_if<_Cond, _Tp>::type; | |
| template<typename...> using __void_t = void; | |
| # 2417 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Default, typename _AlwaysVoid, | |
| template<typename...> class _Op, typename... _Args> | |
| struct __detector | |
| { | |
| using value_t = false_type; | |
| using type = _Default; | |
| }; | |
| template<typename _Default, template<typename...> class _Op, | |
| typename... _Args> | |
| struct __detector<_Default, __void_t<_Op<_Args...>>, _Op, _Args...> | |
| { | |
| using value_t = true_type; | |
| using type = _Op<_Args...>; | |
| }; | |
| template<typename _Default, template<typename...> class _Op, | |
| typename... _Args> | |
| using __detected_or = __detector<_Default, void, _Op, _Args...>; | |
| template<typename _Default, template<typename...> class _Op, | |
| typename... _Args> | |
| using __detected_or_t | |
| = typename __detected_or<_Default, _Op, _Args...>::type; | |
| # 2461 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template <typename _Tp> | |
| struct __is_swappable; | |
| template <typename _Tp> | |
| struct __is_nothrow_swappable; | |
| template<typename... _Elements> | |
| class tuple; | |
| template<typename> | |
| struct __is_tuple_like_impl : false_type | |
| { }; | |
| template<typename... _Tps> | |
| struct __is_tuple_like_impl<tuple<_Tps...>> : true_type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_tuple_like | |
| : public __is_tuple_like_impl<__remove_cvref_t<_Tp>>::type | |
| { }; | |
| template<typename _Tp> | |
| inline | |
| typename enable_if<__and_<__not_<__is_tuple_like<_Tp>>, | |
| is_move_constructible<_Tp>, | |
| is_move_assignable<_Tp>>::value>::type | |
| swap(_Tp&, _Tp&) | |
| noexcept(__and_<is_nothrow_move_constructible<_Tp>, | |
| is_nothrow_move_assignable<_Tp>>::value); | |
| template<typename _Tp, size_t _Nm> | |
| inline | |
| typename enable_if<__is_swappable<_Tp>::value>::type | |
| swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) | |
| noexcept(__is_nothrow_swappable<_Tp>::value); | |
| namespace __swappable_details { | |
| using std::swap; | |
| struct __do_is_swappable_impl | |
| { | |
| template<typename _Tp, typename | |
| = decltype(swap(std::declval<_Tp&>(), std::declval<_Tp&>()))> | |
| static true_type __test(int); | |
| template<typename> | |
| static false_type __test(...); | |
| }; | |
| struct __do_is_nothrow_swappable_impl | |
| { | |
| template<typename _Tp> | |
| static __bool_constant< | |
| noexcept(swap(std::declval<_Tp&>(), std::declval<_Tp&>())) | |
| > __test(int); | |
| template<typename> | |
| static false_type __test(...); | |
| }; | |
| } | |
| template<typename _Tp> | |
| struct __is_swappable_impl | |
| : public __swappable_details::__do_is_swappable_impl | |
| { | |
| typedef decltype(__test<_Tp>(0)) type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_nothrow_swappable_impl | |
| : public __swappable_details::__do_is_nothrow_swappable_impl | |
| { | |
| typedef decltype(__test<_Tp>(0)) type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_swappable | |
| : public __is_swappable_impl<_Tp>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_nothrow_swappable | |
| : public __is_nothrow_swappable_impl<_Tp>::type | |
| { }; | |
| # 2665 "/usr/sgug/include/c++/9/type_traits" 3 | |
| template<typename _Result, typename _Ret, typename = void> | |
| struct __is_invocable_impl : false_type { }; | |
| template<typename _Result, typename _Ret> | |
| struct __is_invocable_impl<_Result, _Ret, __void_t<typename _Result::type>> | |
| : __or_<is_void<_Ret>, is_convertible<typename _Result::type, _Ret>>::type | |
| { }; | |
| template<typename _Fn, typename... _ArgTypes> | |
| struct __is_invocable | |
| : __is_invocable_impl<__invoke_result<_Fn, _ArgTypes...>, void>::type | |
| { }; | |
| template<typename _Fn, typename _Tp, typename... _Args> | |
| constexpr bool __call_is_nt(__invoke_memfun_ref) | |
| { | |
| using _Up = typename __inv_unwrap<_Tp>::type; | |
| return noexcept((std::declval<_Up>().*std::declval<_Fn>())( | |
| std::declval<_Args>()...)); | |
| } | |
| template<typename _Fn, typename _Tp, typename... _Args> | |
| constexpr bool __call_is_nt(__invoke_memfun_deref) | |
| { | |
| return noexcept(((*std::declval<_Tp>()).*std::declval<_Fn>())( | |
| std::declval<_Args>()...)); | |
| } | |
| template<typename _Fn, typename _Tp> | |
| constexpr bool __call_is_nt(__invoke_memobj_ref) | |
| { | |
| using _Up = typename __inv_unwrap<_Tp>::type; | |
| return noexcept(std::declval<_Up>().*std::declval<_Fn>()); | |
| } | |
| template<typename _Fn, typename _Tp> | |
| constexpr bool __call_is_nt(__invoke_memobj_deref) | |
| { | |
| return noexcept((*std::declval<_Tp>()).*std::declval<_Fn>()); | |
| } | |
| template<typename _Fn, typename... _Args> | |
| constexpr bool __call_is_nt(__invoke_other) | |
| { | |
| return noexcept(std::declval<_Fn>()(std::declval<_Args>()...)); | |
| } | |
| template<typename _Result, typename _Fn, typename... _Args> | |
| struct __call_is_nothrow | |
| : __bool_constant< | |
| std::__call_is_nt<_Fn, _Args...>(typename _Result::__invoke_type{}) | |
| > | |
| { }; | |
| template<typename _Fn, typename... _Args> | |
| using __call_is_nothrow_ | |
| = __call_is_nothrow<__invoke_result<_Fn, _Args...>, _Fn, _Args...>; | |
| template<typename _Fn, typename... _Args> | |
| struct __is_nothrow_invocable | |
| : __and_<__is_invocable<_Fn, _Args...>, | |
| __call_is_nothrow_<_Fn, _Args...>>::type | |
| { }; | |
| struct __nonesuch { | |
| __nonesuch() = delete; | |
| ~__nonesuch() = delete; | |
| __nonesuch(__nonesuch const&) = delete; | |
| void operator=(__nonesuch const&) = delete; | |
| }; | |
| # 3062 "/usr/sgug/include/c++/9/type_traits" 3 | |
| } | |
| # 56 "/usr/sgug/include/c++/9/bits/move.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 72 "/usr/sgug/include/c++/9/bits/move.h" 3 | |
| template<typename _Tp> | |
| constexpr _Tp&& | |
| forward(typename std::remove_reference<_Tp>::type& __t) noexcept | |
| { return static_cast<_Tp&&>(__t); } | |
| template<typename _Tp> | |
| constexpr _Tp&& | |
| forward(typename std::remove_reference<_Tp>::type&& __t) noexcept | |
| { | |
| static_assert(!std::is_lvalue_reference<_Tp>::value, "template argument" | |
| " substituting _Tp is an lvalue reference type"); | |
| return static_cast<_Tp&&>(__t); | |
| } | |
| template<typename _Tp> | |
| constexpr typename std::remove_reference<_Tp>::type&& | |
| move(_Tp&& __t) noexcept | |
| { return static_cast<typename std::remove_reference<_Tp>::type&&>(__t); } | |
| template<typename _Tp> | |
| struct __move_if_noexcept_cond | |
| : public __and_<__not_<is_nothrow_move_constructible<_Tp>>, | |
| is_copy_constructible<_Tp>>::type { }; | |
| # 116 "/usr/sgug/include/c++/9/bits/move.h" 3 | |
| template<typename _Tp> | |
| constexpr typename | |
| conditional<__move_if_noexcept_cond<_Tp>::value, const _Tp&, _Tp&&>::type | |
| move_if_noexcept(_Tp& __x) noexcept | |
| { return std::move(__x); } | |
| # 136 "/usr/sgug/include/c++/9/bits/move.h" 3 | |
| template<typename _Tp> | |
| inline _Tp* | |
| addressof(_Tp& __r) noexcept | |
| { return std::__addressof(__r); } | |
| template<typename _Tp> | |
| const _Tp* addressof(const _Tp&&) = delete; | |
| template <typename _Tp, typename _Up = _Tp> | |
| inline _Tp | |
| __exchange(_Tp& __obj, _Up&& __new_val) | |
| { | |
| _Tp __old_val = std::move(__obj); | |
| __obj = std::forward<_Up>(__new_val); | |
| return __old_val; | |
| } | |
| # 176 "/usr/sgug/include/c++/9/bits/move.h" 3 | |
| template<typename _Tp> | |
| inline | |
| typename enable_if<__and_<__not_<__is_tuple_like<_Tp>>, | |
| is_move_constructible<_Tp>, | |
| is_move_assignable<_Tp>>::value>::type | |
| swap(_Tp& __a, _Tp& __b) | |
| noexcept(__and_<is_nothrow_move_constructible<_Tp>, | |
| is_nothrow_move_assignable<_Tp>>::value) | |
| { | |
| _Tp __tmp = std::move(__a); | |
| __a = std::move(__b); | |
| __b = std::move(__tmp); | |
| } | |
| template<typename _Tp, size_t _Nm> | |
| inline | |
| typename enable_if<__is_swappable<_Tp>::value>::type | |
| swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) | |
| noexcept(__is_nothrow_swappable<_Tp>::value) | |
| { | |
| for (size_t __n = 0; __n < _Nm; ++__n) | |
| swap(__a[__n], __b[__n]); | |
| } | |
| } | |
| # 60 "/usr/sgug/include/c++/9/bits/stl_pair.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 76 "/usr/sgug/include/c++/9/bits/stl_pair.h" 3 | |
| struct piecewise_construct_t { explicit piecewise_construct_t() = default; }; | |
| constexpr piecewise_construct_t piecewise_construct = | |
| piecewise_construct_t(); | |
| template<typename...> | |
| class tuple; | |
| template<std::size_t...> | |
| struct _Index_tuple; | |
| template <bool, typename _T1, typename _T2> | |
| struct _PCC | |
| { | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _ConstructiblePair() | |
| { | |
| return __and_<is_constructible<_T1, const _U1&>, | |
| is_constructible<_T2, const _U2&>>::value; | |
| } | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _ImplicitlyConvertiblePair() | |
| { | |
| return __and_<is_convertible<const _U1&, _T1>, | |
| is_convertible<const _U2&, _T2>>::value; | |
| } | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _MoveConstructiblePair() | |
| { | |
| return __and_<is_constructible<_T1, _U1&&>, | |
| is_constructible<_T2, _U2&&>>::value; | |
| } | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _ImplicitlyMoveConvertiblePair() | |
| { | |
| return __and_<is_convertible<_U1&&, _T1>, | |
| is_convertible<_U2&&, _T2>>::value; | |
| } | |
| template <bool __implicit, typename _U1, typename _U2> | |
| static constexpr bool _CopyMovePair() | |
| { | |
| using __do_converts = __and_<is_convertible<const _U1&, _T1>, | |
| is_convertible<_U2&&, _T2>>; | |
| using __converts = typename conditional<__implicit, | |
| __do_converts, | |
| __not_<__do_converts>>::type; | |
| return __and_<is_constructible<_T1, const _U1&>, | |
| is_constructible<_T2, _U2&&>, | |
| __converts | |
| >::value; | |
| } | |
| template <bool __implicit, typename _U1, typename _U2> | |
| static constexpr bool _MoveCopyPair() | |
| { | |
| using __do_converts = __and_<is_convertible<_U1&&, _T1>, | |
| is_convertible<const _U2&, _T2>>; | |
| using __converts = typename conditional<__implicit, | |
| __do_converts, | |
| __not_<__do_converts>>::type; | |
| return __and_<is_constructible<_T1, _U1&&>, | |
| is_constructible<_T2, const _U2&&>, | |
| __converts | |
| >::value; | |
| } | |
| }; | |
| template <typename _T1, typename _T2> | |
| struct _PCC<false, _T1, _T2> | |
| { | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _ConstructiblePair() | |
| { | |
| return false; | |
| } | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _ImplicitlyConvertiblePair() | |
| { | |
| return false; | |
| } | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _MoveConstructiblePair() | |
| { | |
| return false; | |
| } | |
| template <typename _U1, typename _U2> | |
| static constexpr bool _ImplicitlyMoveConvertiblePair() | |
| { | |
| return false; | |
| } | |
| }; | |
| struct __nonesuch_no_braces : std::__nonesuch { | |
| explicit __nonesuch_no_braces(const __nonesuch&) = delete; | |
| }; | |
| template<typename _U1, typename _U2> class __pair_base | |
| { | |
| template<typename _T1, typename _T2> friend struct pair; | |
| __pair_base() = default; | |
| ~__pair_base() = default; | |
| __pair_base(const __pair_base&) = default; | |
| __pair_base& operator=(const __pair_base&) = delete; | |
| }; | |
| template<typename _T1, typename _T2> | |
| struct pair | |
| : private __pair_base<_T1, _T2> | |
| { | |
| typedef _T1 first_type; | |
| typedef _T2 second_type; | |
| _T1 first; | |
| _T2 second; | |
| template <typename _U1 = _T1, | |
| typename _U2 = _T2, | |
| typename enable_if<__and_< | |
| __is_implicitly_default_constructible<_U1>, | |
| __is_implicitly_default_constructible<_U2>> | |
| ::value, bool>::type = true> | |
| constexpr pair() | |
| : first(), second() { } | |
| template <typename _U1 = _T1, | |
| typename _U2 = _T2, | |
| typename enable_if<__and_< | |
| is_default_constructible<_U1>, | |
| is_default_constructible<_U2>, | |
| __not_< | |
| __and_<__is_implicitly_default_constructible<_U1>, | |
| __is_implicitly_default_constructible<_U2>>>> | |
| ::value, bool>::type = false> | |
| explicit constexpr pair() | |
| : first(), second() { } | |
| # 252 "/usr/sgug/include/c++/9/bits/stl_pair.h" 3 | |
| using _PCCP = _PCC<true, _T1, _T2>; | |
| template<typename _U1 = _T1, typename _U2=_T2, typename | |
| enable_if<_PCCP::template | |
| _ConstructiblePair<_U1, _U2>() | |
| && _PCCP::template | |
| _ImplicitlyConvertiblePair<_U1, _U2>(), | |
| bool>::type=true> | |
| constexpr pair(const _T1& __a, const _T2& __b) | |
| : first(__a), second(__b) { } | |
| template<typename _U1 = _T1, typename _U2=_T2, typename | |
| enable_if<_PCCP::template | |
| _ConstructiblePair<_U1, _U2>() | |
| && !_PCCP::template | |
| _ImplicitlyConvertiblePair<_U1, _U2>(), | |
| bool>::type=false> | |
| explicit constexpr pair(const _T1& __a, const _T2& __b) | |
| : first(__a), second(__b) { } | |
| # 280 "/usr/sgug/include/c++/9/bits/stl_pair.h" 3 | |
| template <typename _U1, typename _U2> | |
| using _PCCFP = _PCC<!is_same<_T1, _U1>::value | |
| || !is_same<_T2, _U2>::value, | |
| _T1, _T2>; | |
| template<typename _U1, typename _U2, typename | |
| enable_if<_PCCFP<_U1, _U2>::template | |
| _ConstructiblePair<_U1, _U2>() | |
| && _PCCFP<_U1, _U2>::template | |
| _ImplicitlyConvertiblePair<_U1, _U2>(), | |
| bool>::type=true> | |
| constexpr pair(const pair<_U1, _U2>& __p) | |
| : first(__p.first), second(__p.second) { } | |
| template<typename _U1, typename _U2, typename | |
| enable_if<_PCCFP<_U1, _U2>::template | |
| _ConstructiblePair<_U1, _U2>() | |
| && !_PCCFP<_U1, _U2>::template | |
| _ImplicitlyConvertiblePair<_U1, _U2>(), | |
| bool>::type=false> | |
| explicit constexpr pair(const pair<_U1, _U2>& __p) | |
| : first(__p.first), second(__p.second) { } | |
| constexpr pair(const pair&) = default; | |
| constexpr pair(pair&&) = default; | |
| template<typename _U1, typename | |
| enable_if<_PCCP::template | |
| _MoveCopyPair<true, _U1, _T2>(), | |
| bool>::type=true> | |
| constexpr pair(_U1&& __x, const _T2& __y) | |
| : first(std::forward<_U1>(__x)), second(__y) { } | |
| template<typename _U1, typename | |
| enable_if<_PCCP::template | |
| _MoveCopyPair<false, _U1, _T2>(), | |
| bool>::type=false> | |
| explicit constexpr pair(_U1&& __x, const _T2& __y) | |
| : first(std::forward<_U1>(__x)), second(__y) { } | |
| template<typename _U2, typename | |
| enable_if<_PCCP::template | |
| _CopyMovePair<true, _T1, _U2>(), | |
| bool>::type=true> | |
| constexpr pair(const _T1& __x, _U2&& __y) | |
| : first(__x), second(std::forward<_U2>(__y)) { } | |
| template<typename _U2, typename | |
| enable_if<_PCCP::template | |
| _CopyMovePair<false, _T1, _U2>(), | |
| bool>::type=false> | |
| explicit pair(const _T1& __x, _U2&& __y) | |
| : first(__x), second(std::forward<_U2>(__y)) { } | |
| template<typename _U1, typename _U2, typename | |
| enable_if<_PCCP::template | |
| _MoveConstructiblePair<_U1, _U2>() | |
| && _PCCP::template | |
| _ImplicitlyMoveConvertiblePair<_U1, _U2>(), | |
| bool>::type=true> | |
| constexpr pair(_U1&& __x, _U2&& __y) | |
| : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { } | |
| template<typename _U1, typename _U2, typename | |
| enable_if<_PCCP::template | |
| _MoveConstructiblePair<_U1, _U2>() | |
| && !_PCCP::template | |
| _ImplicitlyMoveConvertiblePair<_U1, _U2>(), | |
| bool>::type=false> | |
| explicit constexpr pair(_U1&& __x, _U2&& __y) | |
| : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { } | |
| template<typename _U1, typename _U2, typename | |
| enable_if<_PCCFP<_U1, _U2>::template | |
| _MoveConstructiblePair<_U1, _U2>() | |
| && _PCCFP<_U1, _U2>::template | |
| _ImplicitlyMoveConvertiblePair<_U1, _U2>(), | |
| bool>::type=true> | |
| constexpr pair(pair<_U1, _U2>&& __p) | |
| : first(std::forward<_U1>(__p.first)), | |
| second(std::forward<_U2>(__p.second)) { } | |
| template<typename _U1, typename _U2, typename | |
| enable_if<_PCCFP<_U1, _U2>::template | |
| _MoveConstructiblePair<_U1, _U2>() | |
| && !_PCCFP<_U1, _U2>::template | |
| _ImplicitlyMoveConvertiblePair<_U1, _U2>(), | |
| bool>::type=false> | |
| explicit constexpr pair(pair<_U1, _U2>&& __p) | |
| : first(std::forward<_U1>(__p.first)), | |
| second(std::forward<_U2>(__p.second)) { } | |
| template<typename... _Args1, typename... _Args2> | |
| pair(piecewise_construct_t, tuple<_Args1...>, tuple<_Args2...>); | |
| pair& | |
| operator=(typename conditional< | |
| __and_<is_copy_assignable<_T1>, | |
| is_copy_assignable<_T2>>::value, | |
| const pair&, const __nonesuch_no_braces&>::type __p) | |
| { | |
| first = __p.first; | |
| second = __p.second; | |
| return *this; | |
| } | |
| pair& | |
| operator=(typename conditional< | |
| __and_<is_move_assignable<_T1>, | |
| is_move_assignable<_T2>>::value, | |
| pair&&, __nonesuch_no_braces&&>::type __p) | |
| noexcept(__and_<is_nothrow_move_assignable<_T1>, | |
| is_nothrow_move_assignable<_T2>>::value) | |
| { | |
| first = std::forward<first_type>(__p.first); | |
| second = std::forward<second_type>(__p.second); | |
| return *this; | |
| } | |
| template<typename _U1, typename _U2> | |
| typename enable_if<__and_<is_assignable<_T1&, const _U1&>, | |
| is_assignable<_T2&, const _U2&>>::value, | |
| pair&>::type | |
| operator=(const pair<_U1, _U2>& __p) | |
| { | |
| first = __p.first; | |
| second = __p.second; | |
| return *this; | |
| } | |
| template<typename _U1, typename _U2> | |
| typename enable_if<__and_<is_assignable<_T1&, _U1&&>, | |
| is_assignable<_T2&, _U2&&>>::value, | |
| pair&>::type | |
| operator=(pair<_U1, _U2>&& __p) | |
| { | |
| first = std::forward<_U1>(__p.first); | |
| second = std::forward<_U2>(__p.second); | |
| return *this; | |
| } | |
| void | |
| swap(pair& __p) | |
| noexcept(__and_<__is_nothrow_swappable<_T1>, | |
| __is_nothrow_swappable<_T2>>::value) | |
| { | |
| using std::swap; | |
| swap(first, __p.first); | |
| swap(second, __p.second); | |
| } | |
| private: | |
| template<typename... _Args1, std::size_t... _Indexes1, | |
| typename... _Args2, std::size_t... _Indexes2> | |
| pair(tuple<_Args1...>&, tuple<_Args2...>&, | |
| _Index_tuple<_Indexes1...>, _Index_tuple<_Indexes2...>); | |
| }; | |
| template<typename _T1, typename _T2> | |
| inline constexpr bool | |
| operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | |
| { return __x.first == __y.first && __x.second == __y.second; } | |
| template<typename _T1, typename _T2> | |
| inline constexpr 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<typename _T1, typename _T2> | |
| inline constexpr bool | |
| operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | |
| { return !(__x == __y); } | |
| template<typename _T1, typename _T2> | |
| inline constexpr bool | |
| operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | |
| { return __y < __x; } | |
| template<typename _T1, typename _T2> | |
| inline constexpr bool | |
| operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | |
| { return !(__y < __x); } | |
| template<typename _T1, typename _T2> | |
| inline constexpr bool | |
| operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | |
| { return !(__x < __y); } | |
| template<typename _T1, typename _T2> | |
| inline | |
| void | |
| swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) | |
| noexcept(noexcept(__x.swap(__y))) | |
| { __x.swap(__y); } | |
| # 521 "/usr/sgug/include/c++/9/bits/stl_pair.h" 3 | |
| template<typename _T1, typename _T2> | |
| constexpr pair<typename __decay_and_strip<_T1>::__type, | |
| typename __decay_and_strip<_T2>::__type> | |
| make_pair(_T1&& __x, _T2&& __y) | |
| { | |
| typedef typename __decay_and_strip<_T1>::__type __ds_type1; | |
| typedef typename __decay_and_strip<_T2>::__type __ds_type2; | |
| typedef pair<__ds_type1, __ds_type2> __pair_type; | |
| return __pair_type(std::forward<_T1>(__x), std::forward<_T2>(__y)); | |
| } | |
| # 540 "/usr/sgug/include/c++/9/bits/stl_pair.h" 3 | |
| } | |
| # 71 "/usr/sgug/include/c++/9/utility" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/initializer_list" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/initializer_list" 3 | |
| # 34 "/usr/sgug/include/c++/9/initializer_list" 3 | |
| #pragma GCC visibility push(default) | |
| namespace std | |
| { | |
| template<class _E> | |
| class initializer_list | |
| { | |
| public: | |
| typedef _E value_type; | |
| typedef const _E& reference; | |
| typedef const _E& const_reference; | |
| typedef size_t size_type; | |
| typedef const _E* iterator; | |
| typedef const _E* const_iterator; | |
| private: | |
| iterator _M_array; | |
| size_type _M_len; | |
| constexpr initializer_list(const_iterator __a, size_type __l) | |
| : _M_array(__a), _M_len(__l) { } | |
| public: | |
| constexpr initializer_list() noexcept | |
| : _M_array(0), _M_len(0) { } | |
| constexpr size_type | |
| size() const noexcept { return _M_len; } | |
| constexpr const_iterator | |
| begin() const noexcept { return _M_array; } | |
| constexpr const_iterator | |
| end() const noexcept { return begin() + size(); } | |
| }; | |
| template<class _Tp> | |
| constexpr const _Tp* | |
| begin(initializer_list<_Tp> __ils) noexcept | |
| { return __ils.begin(); } | |
| template<class _Tp> | |
| constexpr const _Tp* | |
| end(initializer_list<_Tp> __ils) noexcept | |
| { return __ils.end(); } | |
| } | |
| #pragma GCC visibility pop | |
| # 77 "/usr/sgug/include/c++/9/utility" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Tp> | |
| struct tuple_size; | |
| template<typename _Tp, | |
| typename _Up = typename remove_cv<_Tp>::type, | |
| typename = typename enable_if<is_same<_Tp, _Up>::value>::type, | |
| size_t = tuple_size<_Tp>::value> | |
| using __enable_if_has_tuple_size = _Tp; | |
| template<typename _Tp> | |
| struct tuple_size<const __enable_if_has_tuple_size<_Tp>> | |
| : public tuple_size<_Tp> { }; | |
| template<typename _Tp> | |
| struct tuple_size<volatile __enable_if_has_tuple_size<_Tp>> | |
| : public tuple_size<_Tp> { }; | |
| template<typename _Tp> | |
| struct tuple_size<const volatile __enable_if_has_tuple_size<_Tp>> | |
| : public tuple_size<_Tp> { }; | |
| template<std::size_t __i, typename _Tp> | |
| struct tuple_element; | |
| template<std::size_t __i, typename _Tp> | |
| using __tuple_element_t = typename tuple_element<__i, _Tp>::type; | |
| template<std::size_t __i, typename _Tp> | |
| struct tuple_element<__i, const _Tp> | |
| { | |
| typedef typename add_const<__tuple_element_t<__i, _Tp>>::type type; | |
| }; | |
| template<std::size_t __i, typename _Tp> | |
| struct tuple_element<__i, volatile _Tp> | |
| { | |
| typedef typename add_volatile<__tuple_element_t<__i, _Tp>>::type type; | |
| }; | |
| template<std::size_t __i, typename _Tp> | |
| struct tuple_element<__i, const volatile _Tp> | |
| { | |
| typedef typename add_cv<__tuple_element_t<__i, _Tp>>::type type; | |
| }; | |
| template<std::size_t __i, typename _Tp> | |
| using tuple_element_t = typename tuple_element<__i, _Tp>::type; | |
| template<typename _T1, typename _T2> | |
| struct __is_tuple_like_impl<std::pair<_T1, _T2>> : true_type | |
| { }; | |
| template<class _Tp1, class _Tp2> | |
| struct tuple_size<std::pair<_Tp1, _Tp2>> | |
| : public integral_constant<std::size_t, 2> { }; | |
| template<class _Tp1, class _Tp2> | |
| struct tuple_element<0, std::pair<_Tp1, _Tp2>> | |
| { typedef _Tp1 type; }; | |
| template<class _Tp1, class _Tp2> | |
| struct tuple_element<1, std::pair<_Tp1, _Tp2>> | |
| { typedef _Tp2 type; }; | |
| template<std::size_t _Int> | |
| struct __pair_get; | |
| template<> | |
| struct __pair_get<0> | |
| { | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr _Tp1& | |
| __get(std::pair<_Tp1, _Tp2>& __pair) noexcept | |
| { return __pair.first; } | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr _Tp1&& | |
| __move_get(std::pair<_Tp1, _Tp2>&& __pair) noexcept | |
| { return std::forward<_Tp1>(__pair.first); } | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr const _Tp1& | |
| __const_get(const std::pair<_Tp1, _Tp2>& __pair) noexcept | |
| { return __pair.first; } | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr const _Tp1&& | |
| __const_move_get(const std::pair<_Tp1, _Tp2>&& __pair) noexcept | |
| { return std::forward<const _Tp1>(__pair.first); } | |
| }; | |
| template<> | |
| struct __pair_get<1> | |
| { | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr _Tp2& | |
| __get(std::pair<_Tp1, _Tp2>& __pair) noexcept | |
| { return __pair.second; } | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr _Tp2&& | |
| __move_get(std::pair<_Tp1, _Tp2>&& __pair) noexcept | |
| { return std::forward<_Tp2>(__pair.second); } | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr const _Tp2& | |
| __const_get(const std::pair<_Tp1, _Tp2>& __pair) noexcept | |
| { return __pair.second; } | |
| template<typename _Tp1, typename _Tp2> | |
| static constexpr const _Tp2&& | |
| __const_move_get(const std::pair<_Tp1, _Tp2>&& __pair) noexcept | |
| { return std::forward<const _Tp2>(__pair.second); } | |
| }; | |
| template<std::size_t _Int, class _Tp1, class _Tp2> | |
| constexpr typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type& | |
| get(std::pair<_Tp1, _Tp2>& __in) noexcept | |
| { return __pair_get<_Int>::__get(__in); } | |
| template<std::size_t _Int, class _Tp1, class _Tp2> | |
| constexpr typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&& | |
| get(std::pair<_Tp1, _Tp2>&& __in) noexcept | |
| { return __pair_get<_Int>::__move_get(std::move(__in)); } | |
| template<std::size_t _Int, class _Tp1, class _Tp2> | |
| constexpr const typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type& | |
| get(const std::pair<_Tp1, _Tp2>& __in) noexcept | |
| { return __pair_get<_Int>::__const_get(__in); } | |
| template<std::size_t _Int, class _Tp1, class _Tp2> | |
| constexpr const typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&& | |
| get(const std::pair<_Tp1, _Tp2>&& __in) noexcept | |
| { return __pair_get<_Int>::__const_move_get(std::move(__in)); } | |
| template <typename _Tp, typename _Up> | |
| constexpr _Tp& | |
| get(pair<_Tp, _Up>& __p) noexcept | |
| { return __p.first; } | |
| template <typename _Tp, typename _Up> | |
| constexpr const _Tp& | |
| get(const pair<_Tp, _Up>& __p) noexcept | |
| { return __p.first; } | |
| template <typename _Tp, typename _Up> | |
| constexpr _Tp&& | |
| get(pair<_Tp, _Up>&& __p) noexcept | |
| { return std::move(__p.first); } | |
| template <typename _Tp, typename _Up> | |
| constexpr const _Tp&& | |
| get(const pair<_Tp, _Up>&& __p) noexcept | |
| { return std::move(__p.first); } | |
| template <typename _Tp, typename _Up> | |
| constexpr _Tp& | |
| get(pair<_Up, _Tp>& __p) noexcept | |
| { return __p.second; } | |
| template <typename _Tp, typename _Up> | |
| constexpr const _Tp& | |
| get(const pair<_Up, _Tp>& __p) noexcept | |
| { return __p.second; } | |
| template <typename _Tp, typename _Up> | |
| constexpr _Tp&& | |
| get(pair<_Up, _Tp>&& __p) noexcept | |
| { return std::move(__p.second); } | |
| template <typename _Tp, typename _Up> | |
| constexpr const _Tp&& | |
| get(const pair<_Up, _Tp>&& __p) noexcept | |
| { return std::move(__p.second); } | |
| template <typename _Tp, typename _Up = _Tp> | |
| inline _Tp | |
| exchange(_Tp& __obj, _Up&& __new_val) | |
| { return std::__exchange(__obj, std::forward<_Up>(__new_val)); } | |
| template<size_t... _Indexes> struct _Index_tuple { }; | |
| # 301 "/usr/sgug/include/c++/9/utility" 3 | |
| template<size_t _Num> | |
| struct _Build_index_tuple | |
| { | |
| using __type = _Index_tuple<__integer_pack(_Num)...>; | |
| }; | |
| template<typename _Tp, _Tp... _Idx> | |
| struct integer_sequence | |
| { | |
| typedef _Tp value_type; | |
| static constexpr size_t size() noexcept { return sizeof...(_Idx); } | |
| }; | |
| template<typename _Tp, _Tp _Num> | |
| using make_integer_sequence | |
| = integer_sequence<_Tp, __integer_pack(_Num)...>; | |
| template<size_t... _Idx> | |
| using index_sequence = integer_sequence<size_t, _Idx...>; | |
| template<size_t _Num> | |
| using make_index_sequence = make_integer_sequence<size_t, _Num>; | |
| template<typename... _Types> | |
| using index_sequence_for = make_index_sequence<sizeof...(_Types)>; | |
| # 396 "/usr/sgug/include/c++/9/utility" 3 | |
| } | |
| # 61 "/usr/sgug/include/c++/9/algorithm" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 1 3 | |
| # 60 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/functexcept.h" 1 3 | |
| # 40 "/usr/sgug/include/c++/9/bits/functexcept.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/exception_defines.h" 1 3 | |
| # 41 "/usr/sgug/include/c++/9/bits/functexcept.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| void | |
| __throw_bad_exception(void) __attribute__((__noreturn__)); | |
| void | |
| __throw_bad_alloc(void) __attribute__((__noreturn__)); | |
| void | |
| __throw_bad_cast(void) __attribute__((__noreturn__)); | |
| void | |
| __throw_bad_typeid(void) __attribute__((__noreturn__)); | |
| void | |
| __throw_logic_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_domain_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_invalid_argument(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_length_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_out_of_range(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_out_of_range_fmt(const char*, ...) __attribute__((__noreturn__)) | |
| __attribute__((__format__(__gnu_printf__, 1, 2))); | |
| void | |
| __throw_runtime_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_range_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_overflow_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_underflow_error(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_ios_failure(const char*) __attribute__((__noreturn__)); | |
| void | |
| __throw_ios_failure(const char*, int) __attribute__((__noreturn__)); | |
| void | |
| __throw_system_error(int) __attribute__((__noreturn__)); | |
| void | |
| __throw_future_error(int) __attribute__((__noreturn__)); | |
| void | |
| __throw_bad_function_call() __attribute__((__noreturn__)); | |
| } | |
| # 61 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 1 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 3 | |
| # 36 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 3 | |
| # 67 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 3 | |
| extern "C++" { | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| struct __true_type { }; | |
| struct __false_type { }; | |
| template<bool> | |
| struct __truth_type | |
| { typedef __false_type __type; }; | |
| template<> | |
| struct __truth_type<true> | |
| { typedef __true_type __type; }; | |
| template<class _Sp, class _Tp> | |
| struct __traitor | |
| { | |
| enum { __value = bool(_Sp::__value) || bool(_Tp::__value) }; | |
| typedef typename __truth_type<__value>::__type __type; | |
| }; | |
| template<typename, typename> | |
| struct __are_same | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __are_same<_Tp, _Tp> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_void | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<> | |
| struct __is_void<void> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_integer | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<bool> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<signed char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<unsigned char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<wchar_t> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| # 184 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 3 | |
| template<> | |
| struct __is_integer<char16_t> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<char32_t> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<short> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<unsigned short> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<int> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<unsigned int> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<long> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<unsigned long> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<long long> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_integer<unsigned long long> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| # 287 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 3 | |
| template<typename _Tp> | |
| struct __is_floating | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<> | |
| struct __is_floating<float> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_floating<double> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_floating<long double> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_pointer | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_pointer<_Tp*> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_arithmetic | |
| : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> > | |
| { }; | |
| template<typename _Tp> | |
| struct __is_scalar | |
| : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> > | |
| { }; | |
| template<typename _Tp> | |
| struct __is_char | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<> | |
| struct __is_char<char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_char<wchar_t> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<typename _Tp> | |
| struct __is_byte | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<> | |
| struct __is_byte<char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_byte<signed char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<> | |
| struct __is_byte<unsigned char> | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| # 417 "/usr/sgug/include/c++/9/bits/cpp_type_traits.h" 3 | |
| template<typename _Tp> | |
| struct __is_move_iterator | |
| { | |
| enum { __value = 0 }; | |
| typedef __false_type __type; | |
| }; | |
| template<typename _Iterator> | |
| inline _Iterator | |
| __miter_base(_Iterator __it) | |
| { return __it; } | |
| } | |
| } | |
| # 62 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/ext/type_traits.h" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/ext/type_traits.h" 3 | |
| # 33 "/usr/sgug/include/c++/9/ext/type_traits.h" 3 | |
| extern "C++" { | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<bool, typename> | |
| struct __enable_if | |
| { }; | |
| template<typename _Tp> | |
| struct __enable_if<true, _Tp> | |
| { typedef _Tp __type; }; | |
| template<bool _Cond, typename _Iftrue, typename _Iffalse> | |
| struct __conditional_type | |
| { typedef _Iftrue __type; }; | |
| template<typename _Iftrue, typename _Iffalse> | |
| struct __conditional_type<false, _Iftrue, _Iffalse> | |
| { typedef _Iffalse __type; }; | |
| template<typename _Tp> | |
| struct __add_unsigned | |
| { | |
| private: | |
| typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; | |
| public: | |
| typedef typename __if_type::__type __type; | |
| }; | |
| template<> | |
| struct __add_unsigned<char> | |
| { typedef unsigned char __type; }; | |
| template<> | |
| struct __add_unsigned<signed char> | |
| { typedef unsigned char __type; }; | |
| template<> | |
| struct __add_unsigned<short> | |
| { typedef unsigned short __type; }; | |
| template<> | |
| struct __add_unsigned<int> | |
| { typedef unsigned int __type; }; | |
| template<> | |
| struct __add_unsigned<long> | |
| { typedef unsigned long __type; }; | |
| template<> | |
| struct __add_unsigned<long long> | |
| { typedef unsigned long long __type; }; | |
| template<> | |
| struct __add_unsigned<bool>; | |
| template<> | |
| struct __add_unsigned<wchar_t>; | |
| template<typename _Tp> | |
| struct __remove_unsigned | |
| { | |
| private: | |
| typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; | |
| public: | |
| typedef typename __if_type::__type __type; | |
| }; | |
| template<> | |
| struct __remove_unsigned<char> | |
| { typedef signed char __type; }; | |
| template<> | |
| struct __remove_unsigned<unsigned char> | |
| { typedef signed char __type; }; | |
| template<> | |
| struct __remove_unsigned<unsigned short> | |
| { typedef short __type; }; | |
| template<> | |
| struct __remove_unsigned<unsigned int> | |
| { typedef int __type; }; | |
| template<> | |
| struct __remove_unsigned<unsigned long> | |
| { typedef long __type; }; | |
| template<> | |
| struct __remove_unsigned<unsigned long long> | |
| { typedef long long __type; }; | |
| template<> | |
| struct __remove_unsigned<bool>; | |
| template<> | |
| struct __remove_unsigned<wchar_t>; | |
| template<typename _Type> | |
| inline bool | |
| __is_null_pointer(_Type* __ptr) | |
| { return __ptr == 0; } | |
| template<typename _Type> | |
| inline bool | |
| __is_null_pointer(_Type) | |
| { return false; } | |
| inline bool | |
| __is_null_pointer(std::nullptr_t) | |
| { return true; } | |
| template<typename _Tp, bool = std::__is_integer<_Tp>::__value> | |
| struct __promote | |
| { typedef double __type; }; | |
| template<typename _Tp> | |
| struct __promote<_Tp, false> | |
| { }; | |
| template<> | |
| struct __promote<long double> | |
| { typedef long double __type; }; | |
| template<> | |
| struct __promote<double> | |
| { typedef double __type; }; | |
| template<> | |
| struct __promote<float> | |
| { typedef float __type; }; | |
| template<typename _Tp, typename _Up, | |
| typename _Tp2 = typename __promote<_Tp>::__type, | |
| typename _Up2 = typename __promote<_Up>::__type> | |
| struct __promote_2 | |
| { | |
| typedef __typeof__(_Tp2() + _Up2()) __type; | |
| }; | |
| template<typename _Tp, typename _Up, typename _Vp, | |
| typename _Tp2 = typename __promote<_Tp>::__type, | |
| typename _Up2 = typename __promote<_Up>::__type, | |
| typename _Vp2 = typename __promote<_Vp>::__type> | |
| struct __promote_3 | |
| { | |
| typedef __typeof__(_Tp2() + _Up2() + _Vp2()) __type; | |
| }; | |
| template<typename _Tp, typename _Up, typename _Vp, typename _Wp, | |
| typename _Tp2 = typename __promote<_Tp>::__type, | |
| typename _Up2 = typename __promote<_Up>::__type, | |
| typename _Vp2 = typename __promote<_Vp>::__type, | |
| typename _Wp2 = typename __promote<_Wp>::__type> | |
| struct __promote_4 | |
| { | |
| typedef __typeof__(_Tp2() + _Up2() + _Vp2() + _Wp2()) __type; | |
| }; | |
| } | |
| } | |
| # 63 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/ext/numeric_traits.h" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/ext/numeric_traits.h" 3 | |
| # 33 "/usr/sgug/include/c++/9/ext/numeric_traits.h" 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 54 "/usr/sgug/include/c++/9/ext/numeric_traits.h" 3 | |
| template<typename _Value> | |
| struct __numeric_traits_integer | |
| { | |
| static const _Value __min = (((_Value)(-1) < 0) ? (_Value)1 << (sizeof(_Value) * 8 - ((_Value)(-1) < 0)) : (_Value)0); | |
| static const _Value __max = (((_Value)(-1) < 0) ? (((((_Value)1 << ((sizeof(_Value) * 8 - ((_Value)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(_Value)0); | |
| static const bool __is_signed = ((_Value)(-1) < 0); | |
| static const int __digits = (sizeof(_Value) * 8 - ((_Value)(-1) < 0)); | |
| }; | |
| template<typename _Value> | |
| const _Value __numeric_traits_integer<_Value>::__min; | |
| template<typename _Value> | |
| const _Value __numeric_traits_integer<_Value>::__max; | |
| template<typename _Value> | |
| const bool __numeric_traits_integer<_Value>::__is_signed; | |
| template<typename _Value> | |
| const int __numeric_traits_integer<_Value>::__digits; | |
| # 99 "/usr/sgug/include/c++/9/ext/numeric_traits.h" 3 | |
| template<typename _Value> | |
| struct __numeric_traits_floating | |
| { | |
| static const int __max_digits10 = (2 + (std::__are_same<_Value, float>::__value ? 24 : std::__are_same<_Value, double>::__value ? 53 : 106) * 643L / 2136); | |
| static const bool __is_signed = true; | |
| static const int __digits10 = (std::__are_same<_Value, float>::__value ? 6 : std::__are_same<_Value, double>::__value ? 15 : 31); | |
| static const int __max_exponent10 = (std::__are_same<_Value, float>::__value ? 38 : std::__are_same<_Value, double>::__value ? 308 : 308); | |
| }; | |
| template<typename _Value> | |
| const int __numeric_traits_floating<_Value>::__max_digits10; | |
| template<typename _Value> | |
| const bool __numeric_traits_floating<_Value>::__is_signed; | |
| template<typename _Value> | |
| const int __numeric_traits_floating<_Value>::__digits10; | |
| template<typename _Value> | |
| const int __numeric_traits_floating<_Value>::__max_exponent10; | |
| template<typename _Value> | |
| struct __numeric_traits | |
| : public __conditional_type<std::__is_integer<_Value>::__value, | |
| __numeric_traits_integer<_Value>, | |
| __numeric_traits_floating<_Value> >::__type | |
| { }; | |
| } | |
| # 64 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 1 3 | |
| # 62 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| # 63 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 89 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| struct input_iterator_tag { }; | |
| struct output_iterator_tag { }; | |
| struct forward_iterator_tag : public input_iterator_tag { }; | |
| struct bidirectional_iterator_tag : public forward_iterator_tag { }; | |
| struct random_access_iterator_tag : public bidirectional_iterator_tag { }; | |
| # 116 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t, | |
| typename _Pointer = _Tp*, typename _Reference = _Tp&> | |
| struct iterator | |
| { | |
| typedef _Category iterator_category; | |
| typedef _Tp value_type; | |
| typedef _Distance difference_type; | |
| typedef _Pointer pointer; | |
| typedef _Reference reference; | |
| }; | |
| # 143 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| template<typename _Iterator, typename = __void_t<>> | |
| struct __iterator_traits { }; | |
| template<typename _Iterator> | |
| struct __iterator_traits<_Iterator, | |
| __void_t<typename _Iterator::iterator_category, | |
| typename _Iterator::value_type, | |
| typename _Iterator::difference_type, | |
| typename _Iterator::pointer, | |
| typename _Iterator::reference>> | |
| { | |
| typedef typename _Iterator::iterator_category iterator_category; | |
| typedef typename _Iterator::value_type value_type; | |
| typedef typename _Iterator::difference_type difference_type; | |
| typedef typename _Iterator::pointer pointer; | |
| typedef typename _Iterator::reference reference; | |
| }; | |
| template<typename _Iterator> | |
| struct iterator_traits | |
| : public __iterator_traits<_Iterator> { }; | |
| # 177 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| template<typename _Tp> | |
| struct iterator_traits<_Tp*> | |
| { | |
| typedef random_access_iterator_tag iterator_category; | |
| typedef _Tp value_type; | |
| typedef ptrdiff_t difference_type; | |
| typedef _Tp* pointer; | |
| typedef _Tp& reference; | |
| }; | |
| template<typename _Tp> | |
| struct iterator_traits<const _Tp*> | |
| { | |
| typedef random_access_iterator_tag iterator_category; | |
| typedef _Tp value_type; | |
| typedef ptrdiff_t difference_type; | |
| typedef const _Tp* pointer; | |
| typedef const _Tp& reference; | |
| }; | |
| template<typename _Iter> | |
| inline constexpr | |
| typename iterator_traits<_Iter>::iterator_category | |
| __iterator_category(const _Iter&) | |
| { return typename iterator_traits<_Iter>::iterator_category(); } | |
| # 231 "/usr/sgug/include/c++/9/bits/stl_iterator_base_types.h" 3 | |
| template<typename _InIter> | |
| using _RequireInputIter = typename | |
| enable_if<is_convertible<typename | |
| iterator_traits<_InIter>::iterator_category, | |
| input_iterator_tag>::value>::type; | |
| } | |
| # 66 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_iterator_base_funcs.h" 1 3 | |
| # 62 "/usr/sgug/include/c++/9/bits/stl_iterator_base_funcs.h" 3 | |
| # 63 "/usr/sgug/include/c++/9/bits/stl_iterator_base_funcs.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/debug/assertions.h" 1 3 | |
| # 66 "/usr/sgug/include/c++/9/bits/stl_iterator_base_funcs.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template <typename> struct _List_iterator; | |
| template <typename> struct _List_const_iterator; | |
| template<typename _InputIterator> | |
| inline constexpr | |
| typename iterator_traits<_InputIterator>::difference_type | |
| __distance(_InputIterator __first, _InputIterator __last, | |
| input_iterator_tag) | |
| { | |
| typename iterator_traits<_InputIterator>::difference_type __n = 0; | |
| while (__first != __last) | |
| { | |
| ++__first; | |
| ++__n; | |
| } | |
| return __n; | |
| } | |
| template<typename _RandomAccessIterator> | |
| inline constexpr | |
| typename iterator_traits<_RandomAccessIterator>::difference_type | |
| __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| random_access_iterator_tag) | |
| { | |
| return __last - __first; | |
| } | |
| template<typename _Tp> | |
| ptrdiff_t | |
| __distance(std::_List_iterator<_Tp>, | |
| std::_List_iterator<_Tp>, | |
| input_iterator_tag); | |
| template<typename _Tp> | |
| ptrdiff_t | |
| __distance(std::_List_const_iterator<_Tp>, | |
| std::_List_const_iterator<_Tp>, | |
| input_iterator_tag); | |
| # 135 "/usr/sgug/include/c++/9/bits/stl_iterator_base_funcs.h" 3 | |
| template<typename _InputIterator> | |
| inline | |
| typename iterator_traits<_InputIterator>::difference_type | |
| distance(_InputIterator __first, _InputIterator __last) | |
| { | |
| return std::__distance(__first, __last, | |
| std::__iterator_category(__first)); | |
| } | |
| template<typename _InputIterator, typename _Distance> | |
| inline constexpr void | |
| __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) | |
| { | |
| ; | |
| while (__n--) | |
| ++__i; | |
| } | |
| template<typename _BidirectionalIterator, typename _Distance> | |
| inline constexpr void | |
| __advance(_BidirectionalIterator& __i, _Distance __n, | |
| bidirectional_iterator_tag) | |
| { | |
| if (__n > 0) | |
| while (__n--) | |
| ++__i; | |
| else | |
| while (__n++) | |
| --__i; | |
| } | |
| template<typename _RandomAccessIterator, typename _Distance> | |
| inline constexpr void | |
| __advance(_RandomAccessIterator& __i, _Distance __n, | |
| random_access_iterator_tag) | |
| { | |
| if (__builtin_constant_p(__n) && __n == 1) | |
| ++__i; | |
| else if (__builtin_constant_p(__n) && __n == -1) | |
| --__i; | |
| else | |
| __i += __n; | |
| } | |
| # 200 "/usr/sgug/include/c++/9/bits/stl_iterator_base_funcs.h" 3 | |
| template<typename _InputIterator, typename _Distance> | |
| inline void | |
| advance(_InputIterator& __i, _Distance __n) | |
| { | |
| typename iterator_traits<_InputIterator>::difference_type __d = __n; | |
| std::__advance(__i, __d, std::__iterator_category(__i)); | |
| } | |
| template<typename _InputIterator> | |
| inline _InputIterator | |
| next(_InputIterator __x, typename | |
| iterator_traits<_InputIterator>::difference_type __n = 1) | |
| { | |
| std::advance(__x, __n); | |
| return __x; | |
| } | |
| template<typename _BidirectionalIterator> | |
| inline _BidirectionalIterator | |
| prev(_BidirectionalIterator __x, typename | |
| iterator_traits<_BidirectionalIterator>::difference_type __n = 1) | |
| { | |
| std::advance(__x, -__n); | |
| return __x; | |
| } | |
| } | |
| # 67 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 1 3 | |
| # 66 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/ptr_traits.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/ptr_traits.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| class __undefined; | |
| template<typename _Tp> | |
| struct __get_first_arg | |
| { using type = __undefined; }; | |
| template<template<typename, typename...> class _Template, typename _Tp, | |
| typename... _Types> | |
| struct __get_first_arg<_Template<_Tp, _Types...>> | |
| { using type = _Tp; }; | |
| template<typename _Tp> | |
| using __get_first_arg_t = typename __get_first_arg<_Tp>::type; | |
| template<typename _Tp, typename _Up> | |
| struct __replace_first_arg | |
| { }; | |
| template<template<typename, typename...> class _Template, typename _Up, | |
| typename _Tp, typename... _Types> | |
| struct __replace_first_arg<_Template<_Tp, _Types...>, _Up> | |
| { using type = _Template<_Up, _Types...>; }; | |
| template<typename _Tp, typename _Up> | |
| using __replace_first_arg_t = typename __replace_first_arg<_Tp, _Up>::type; | |
| template<typename _Tp> | |
| using __make_not_void | |
| = typename conditional<is_void<_Tp>::value, __undefined, _Tp>::type; | |
| template<typename _Ptr> | |
| struct pointer_traits | |
| { | |
| private: | |
| template<typename _Tp> | |
| using __element_type = typename _Tp::element_type; | |
| template<typename _Tp> | |
| using __difference_type = typename _Tp::difference_type; | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __rebind : __replace_first_arg<_Tp, _Up> { }; | |
| template<typename _Tp, typename _Up> | |
| struct __rebind<_Tp, _Up, __void_t<typename _Tp::template rebind<_Up>>> | |
| { using type = typename _Tp::template rebind<_Up>; }; | |
| public: | |
| using pointer = _Ptr; | |
| using element_type | |
| = __detected_or_t<__get_first_arg_t<_Ptr>, __element_type, _Ptr>; | |
| using difference_type | |
| = __detected_or_t<ptrdiff_t, __difference_type, _Ptr>; | |
| template<typename _Up> | |
| using rebind = typename __rebind<_Ptr, _Up>::type; | |
| static _Ptr | |
| pointer_to(__make_not_void<element_type>& __e) | |
| { return _Ptr::pointer_to(__e); } | |
| static_assert(!is_same<element_type, __undefined>::value, | |
| "pointer type defines element_type or is like SomePointer<T, Args>"); | |
| }; | |
| template<typename _Tp> | |
| struct pointer_traits<_Tp*> | |
| { | |
| typedef _Tp* pointer; | |
| typedef _Tp element_type; | |
| typedef ptrdiff_t difference_type; | |
| template<typename _Up> | |
| using rebind = _Up*; | |
| static pointer | |
| pointer_to(__make_not_void<element_type>& __r) noexcept | |
| { return std::addressof(__r); } | |
| }; | |
| template<typename _Ptr, typename _Tp> | |
| using __ptr_rebind = typename pointer_traits<_Ptr>::template rebind<_Tp>; | |
| template<typename _Tp> | |
| constexpr _Tp* | |
| __to_address(_Tp* __ptr) noexcept | |
| { | |
| static_assert(!std::is_function<_Tp>::value, "not a function pointer"); | |
| return __ptr; | |
| } | |
| template<typename _Ptr> | |
| constexpr typename std::pointer_traits<_Ptr>::element_type* | |
| __to_address(const _Ptr& __ptr) | |
| { return std::__to_address(__ptr.operator->()); } | |
| # 198 "/usr/sgug/include/c++/9/bits/ptr_traits.h" 3 | |
| } | |
| # 67 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 2 3 | |
| # 76 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 104 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Iterator> | |
| class reverse_iterator | |
| : public iterator<typename iterator_traits<_Iterator>::iterator_category, | |
| typename iterator_traits<_Iterator>::value_type, | |
| typename iterator_traits<_Iterator>::difference_type, | |
| typename iterator_traits<_Iterator>::pointer, | |
| typename iterator_traits<_Iterator>::reference> | |
| { | |
| protected: | |
| _Iterator current; | |
| typedef iterator_traits<_Iterator> __traits_type; | |
| public: | |
| typedef _Iterator iterator_type; | |
| typedef typename __traits_type::difference_type difference_type; | |
| typedef typename __traits_type::pointer pointer; | |
| typedef typename __traits_type::reference reference; | |
| # 130 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| reverse_iterator() : current() { } | |
| explicit | |
| reverse_iterator(iterator_type __x) : current(__x) { } | |
| reverse_iterator(const reverse_iterator& __x) | |
| : current(__x.current) { } | |
| reverse_iterator& operator=(const reverse_iterator&) = default; | |
| template<typename _Iter> | |
| reverse_iterator(const reverse_iterator<_Iter>& __x) | |
| : current(__x.base()) { } | |
| iterator_type | |
| base() const | |
| { return current; } | |
| # 176 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| reference | |
| operator*() const | |
| { | |
| _Iterator __tmp = current; | |
| return *--__tmp; | |
| } | |
| pointer | |
| operator->() const | |
| { | |
| _Iterator __tmp = current; | |
| --__tmp; | |
| return _S_to_pointer(__tmp); | |
| } | |
| reverse_iterator& | |
| operator++() | |
| { | |
| --current; | |
| return *this; | |
| } | |
| reverse_iterator | |
| operator++(int) | |
| { | |
| reverse_iterator __tmp = *this; | |
| --current; | |
| return __tmp; | |
| } | |
| reverse_iterator& | |
| operator--() | |
| { | |
| ++current; | |
| return *this; | |
| } | |
| reverse_iterator | |
| operator--(int) | |
| { | |
| reverse_iterator __tmp = *this; | |
| ++current; | |
| return __tmp; | |
| } | |
| reverse_iterator | |
| operator+(difference_type __n) const | |
| { return reverse_iterator(current - __n); } | |
| reverse_iterator& | |
| operator+=(difference_type __n) | |
| { | |
| current -= __n; | |
| return *this; | |
| } | |
| reverse_iterator | |
| operator-(difference_type __n) const | |
| { return reverse_iterator(current + __n); } | |
| reverse_iterator& | |
| operator-=(difference_type __n) | |
| { | |
| current += __n; | |
| return *this; | |
| } | |
| reference | |
| operator[](difference_type __n) const | |
| { return *(*this + __n); } | |
| private: | |
| template<typename _Tp> | |
| static _Tp* | |
| _S_to_pointer(_Tp* __p) | |
| { return __p; } | |
| template<typename _Tp> | |
| static pointer | |
| _S_to_pointer(_Tp __t) | |
| { return __t.operator->(); } | |
| }; | |
| # 323 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Iterator> | |
| inline bool | |
| operator==(const reverse_iterator<_Iterator>& __x, | |
| const reverse_iterator<_Iterator>& __y) | |
| { return __x.base() == __y.base(); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator<(const reverse_iterator<_Iterator>& __x, | |
| const reverse_iterator<_Iterator>& __y) | |
| { return __y.base() < __x.base(); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator!=(const reverse_iterator<_Iterator>& __x, | |
| const reverse_iterator<_Iterator>& __y) | |
| { return !(__x == __y); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator>(const reverse_iterator<_Iterator>& __x, | |
| const reverse_iterator<_Iterator>& __y) | |
| { return __y < __x; } | |
| template<typename _Iterator> | |
| inline bool | |
| operator<=(const reverse_iterator<_Iterator>& __x, | |
| const reverse_iterator<_Iterator>& __y) | |
| { return !(__y < __x); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator>=(const reverse_iterator<_Iterator>& __x, | |
| const reverse_iterator<_Iterator>& __y) | |
| { return !(__x < __y); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator==(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| { return __x.base() == __y.base(); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator<(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| { return __y.base() < __x.base(); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator!=(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| { return !(__x == __y); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator>(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| { return __y < __x; } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator<=(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| { return !(__y < __x); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator>=(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| { return !(__x < __y); } | |
| # 413 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline auto | |
| operator-(const reverse_iterator<_IteratorL>& __x, | |
| const reverse_iterator<_IteratorR>& __y) | |
| -> decltype(__y.base() - __x.base()) | |
| { return __y.base() - __x.base(); } | |
| template<typename _Iterator> | |
| inline reverse_iterator<_Iterator> | |
| operator+(typename reverse_iterator<_Iterator>::difference_type __n, | |
| const reverse_iterator<_Iterator>& __x) | |
| { return reverse_iterator<_Iterator>(__x.base() - __n); } | |
| template<typename _Iterator> | |
| inline reverse_iterator<_Iterator> | |
| __make_reverse_iterator(_Iterator __i) | |
| { return reverse_iterator<_Iterator>(__i); } | |
| template<typename _Iterator> | |
| inline reverse_iterator<_Iterator> | |
| make_reverse_iterator(_Iterator __i) | |
| { return reverse_iterator<_Iterator>(__i); } | |
| template<typename _Iterator> | |
| auto | |
| __niter_base(reverse_iterator<_Iterator> __it) | |
| -> decltype(__make_reverse_iterator(__niter_base(__it.base()))) | |
| { return __make_reverse_iterator(__niter_base(__it.base())); } | |
| template<typename _Iterator> | |
| struct __is_move_iterator<reverse_iterator<_Iterator> > | |
| : __is_move_iterator<_Iterator> | |
| { }; | |
| template<typename _Iterator> | |
| auto | |
| __miter_base(reverse_iterator<_Iterator> __it) | |
| -> decltype(__make_reverse_iterator(__miter_base(__it.base()))) | |
| { return __make_reverse_iterator(__miter_base(__it.base())); } | |
| # 477 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Container> | |
| class back_insert_iterator | |
| : public iterator<output_iterator_tag, void, void, void, void> | |
| { | |
| protected: | |
| _Container* container; | |
| public: | |
| typedef _Container container_type; | |
| explicit | |
| back_insert_iterator(_Container& __x) | |
| : container(std::__addressof(__x)) { } | |
| # 512 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| back_insert_iterator& | |
| operator=(const typename _Container::value_type& __value) | |
| { | |
| container->push_back(__value); | |
| return *this; | |
| } | |
| back_insert_iterator& | |
| operator=(typename _Container::value_type&& __value) | |
| { | |
| container->push_back(std::move(__value)); | |
| return *this; | |
| } | |
| back_insert_iterator& | |
| operator*() | |
| { return *this; } | |
| back_insert_iterator& | |
| operator++() | |
| { return *this; } | |
| back_insert_iterator | |
| operator++(int) | |
| { return *this; } | |
| }; | |
| # 554 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Container> | |
| inline back_insert_iterator<_Container> | |
| back_inserter(_Container& __x) | |
| { return back_insert_iterator<_Container>(__x); } | |
| # 569 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Container> | |
| class front_insert_iterator | |
| : public iterator<output_iterator_tag, void, void, void, void> | |
| { | |
| protected: | |
| _Container* container; | |
| public: | |
| typedef _Container container_type; | |
| explicit front_insert_iterator(_Container& __x) | |
| : container(std::__addressof(__x)) { } | |
| # 603 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| front_insert_iterator& | |
| operator=(const typename _Container::value_type& __value) | |
| { | |
| container->push_front(__value); | |
| return *this; | |
| } | |
| front_insert_iterator& | |
| operator=(typename _Container::value_type&& __value) | |
| { | |
| container->push_front(std::move(__value)); | |
| return *this; | |
| } | |
| front_insert_iterator& | |
| operator*() | |
| { return *this; } | |
| front_insert_iterator& | |
| operator++() | |
| { return *this; } | |
| front_insert_iterator | |
| operator++(int) | |
| { return *this; } | |
| }; | |
| # 645 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Container> | |
| inline front_insert_iterator<_Container> | |
| front_inserter(_Container& __x) | |
| { return front_insert_iterator<_Container>(__x); } | |
| # 664 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Container> | |
| class insert_iterator | |
| : public iterator<output_iterator_tag, void, void, void, void> | |
| { | |
| protected: | |
| _Container* container; | |
| typename _Container::iterator iter; | |
| public: | |
| typedef _Container container_type; | |
| insert_iterator(_Container& __x, typename _Container::iterator __i) | |
| : container(std::__addressof(__x)), iter(__i) {} | |
| # 715 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| insert_iterator& | |
| operator=(const typename _Container::value_type& __value) | |
| { | |
| iter = container->insert(iter, __value); | |
| ++iter; | |
| return *this; | |
| } | |
| insert_iterator& | |
| operator=(typename _Container::value_type&& __value) | |
| { | |
| iter = container->insert(iter, std::move(__value)); | |
| ++iter; | |
| return *this; | |
| } | |
| insert_iterator& | |
| operator*() | |
| { return *this; } | |
| insert_iterator& | |
| operator++() | |
| { return *this; } | |
| insert_iterator& | |
| operator++(int) | |
| { return *this; } | |
| }; | |
| # 760 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Container, typename _Iterator> | |
| inline insert_iterator<_Container> | |
| inserter(_Container& __x, _Iterator __i) | |
| { | |
| return insert_iterator<_Container>(__x, | |
| typename _Container::iterator(__i)); | |
| } | |
| } | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 784 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| using std::iterator_traits; | |
| using std::iterator; | |
| template<typename _Iterator, typename _Container> | |
| class __normal_iterator | |
| { | |
| protected: | |
| _Iterator _M_current; | |
| typedef iterator_traits<_Iterator> __traits_type; | |
| public: | |
| typedef _Iterator iterator_type; | |
| typedef typename __traits_type::iterator_category iterator_category; | |
| typedef typename __traits_type::value_type value_type; | |
| typedef typename __traits_type::difference_type difference_type; | |
| typedef typename __traits_type::reference reference; | |
| typedef typename __traits_type::pointer pointer; | |
| constexpr __normal_iterator() noexcept | |
| : _M_current(_Iterator()) { } | |
| explicit | |
| __normal_iterator(const _Iterator& __i) noexcept | |
| : _M_current(__i) { } | |
| template<typename _Iter> | |
| __normal_iterator(const __normal_iterator<_Iter, | |
| typename __enable_if< | |
| (std::__are_same<_Iter, typename _Container::pointer>::__value), | |
| _Container>::__type>& __i) noexcept | |
| : _M_current(__i.base()) { } | |
| reference | |
| operator*() const noexcept | |
| { return *_M_current; } | |
| pointer | |
| operator->() const noexcept | |
| { return _M_current; } | |
| __normal_iterator& | |
| operator++() noexcept | |
| { | |
| ++_M_current; | |
| return *this; | |
| } | |
| __normal_iterator | |
| operator++(int) noexcept | |
| { return __normal_iterator(_M_current++); } | |
| __normal_iterator& | |
| operator--() noexcept | |
| { | |
| --_M_current; | |
| return *this; | |
| } | |
| __normal_iterator | |
| operator--(int) noexcept | |
| { return __normal_iterator(_M_current--); } | |
| reference | |
| operator[](difference_type __n) const noexcept | |
| { return _M_current[__n]; } | |
| __normal_iterator& | |
| operator+=(difference_type __n) noexcept | |
| { _M_current += __n; return *this; } | |
| __normal_iterator | |
| operator+(difference_type __n) const noexcept | |
| { return __normal_iterator(_M_current + __n); } | |
| __normal_iterator& | |
| operator-=(difference_type __n) noexcept | |
| { _M_current -= __n; return *this; } | |
| __normal_iterator | |
| operator-(difference_type __n) const noexcept | |
| { return __normal_iterator(_M_current - __n); } | |
| const _Iterator& | |
| base() const noexcept | |
| { return _M_current; } | |
| }; | |
| # 884 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _IteratorL, typename _IteratorR, typename _Container> | |
| inline bool | |
| operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, | |
| const __normal_iterator<_IteratorR, _Container>& __rhs) | |
| noexcept | |
| { return __lhs.base() == __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline bool | |
| operator==(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { 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) | |
| noexcept | |
| { return __lhs.base() != __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline bool | |
| operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { 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) | |
| noexcept | |
| { return __lhs.base() < __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline bool | |
| operator<(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { 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) | |
| noexcept | |
| { return __lhs.base() > __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline bool | |
| operator>(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { 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) | |
| noexcept | |
| { return __lhs.base() <= __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline bool | |
| operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { 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) | |
| noexcept | |
| { return __lhs.base() >= __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline bool | |
| operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { return __lhs.base() >= __rhs.base(); } | |
| template<typename _IteratorL, typename _IteratorR, typename _Container> | |
| inline auto | |
| operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, | |
| const __normal_iterator<_IteratorR, _Container>& __rhs) noexcept | |
| -> decltype(__lhs.base() - __rhs.base()) | |
| { return __lhs.base() - __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline typename __normal_iterator<_Iterator, _Container>::difference_type | |
| operator-(const __normal_iterator<_Iterator, _Container>& __lhs, | |
| const __normal_iterator<_Iterator, _Container>& __rhs) | |
| noexcept | |
| { return __lhs.base() - __rhs.base(); } | |
| template<typename _Iterator, typename _Container> | |
| inline __normal_iterator<_Iterator, _Container> | |
| operator+(typename __normal_iterator<_Iterator, _Container>::difference_type | |
| __n, const __normal_iterator<_Iterator, _Container>& __i) | |
| noexcept | |
| { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } | |
| } | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Iterator, typename _Container> | |
| _Iterator | |
| __niter_base(__gnu_cxx::__normal_iterator<_Iterator, _Container> __it) | |
| noexcept(std::is_nothrow_copy_constructible<_Iterator>::value) | |
| { return __it.base(); } | |
| # 1030 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| template<typename _Iterator> | |
| class move_iterator | |
| { | |
| protected: | |
| _Iterator _M_current; | |
| typedef iterator_traits<_Iterator> __traits_type; | |
| typedef typename __traits_type::reference __base_ref; | |
| public: | |
| typedef _Iterator iterator_type; | |
| typedef typename __traits_type::iterator_category iterator_category; | |
| typedef typename __traits_type::value_type value_type; | |
| typedef typename __traits_type::difference_type difference_type; | |
| typedef _Iterator pointer; | |
| typedef typename conditional<is_reference<__base_ref>::value, | |
| typename remove_reference<__base_ref>::type&&, | |
| __base_ref>::type reference; | |
| move_iterator() | |
| : _M_current() { } | |
| explicit | |
| move_iterator(iterator_type __i) | |
| : _M_current(__i) { } | |
| template<typename _Iter> | |
| move_iterator(const move_iterator<_Iter>& __i) | |
| : _M_current(__i.base()) { } | |
| iterator_type | |
| base() const | |
| { return _M_current; } | |
| reference | |
| operator*() const | |
| { return static_cast<reference>(*_M_current); } | |
| pointer | |
| operator->() const | |
| { return _M_current; } | |
| move_iterator& | |
| operator++() | |
| { | |
| ++_M_current; | |
| return *this; | |
| } | |
| move_iterator | |
| operator++(int) | |
| { | |
| move_iterator __tmp = *this; | |
| ++_M_current; | |
| return __tmp; | |
| } | |
| move_iterator& | |
| operator--() | |
| { | |
| --_M_current; | |
| return *this; | |
| } | |
| move_iterator | |
| operator--(int) | |
| { | |
| move_iterator __tmp = *this; | |
| --_M_current; | |
| return __tmp; | |
| } | |
| move_iterator | |
| operator+(difference_type __n) const | |
| { return move_iterator(_M_current + __n); } | |
| move_iterator& | |
| operator+=(difference_type __n) | |
| { | |
| _M_current += __n; | |
| return *this; | |
| } | |
| move_iterator | |
| operator-(difference_type __n) const | |
| { return move_iterator(_M_current - __n); } | |
| move_iterator& | |
| operator-=(difference_type __n) | |
| { | |
| _M_current -= __n; | |
| return *this; | |
| } | |
| reference | |
| operator[](difference_type __n) const | |
| { return std::move(_M_current[__n]); } | |
| }; | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator==(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| { return __x.base() == __y.base(); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator==(const move_iterator<_Iterator>& __x, | |
| const move_iterator<_Iterator>& __y) | |
| { return __x.base() == __y.base(); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator!=(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| { return !(__x == __y); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator!=(const move_iterator<_Iterator>& __x, | |
| const move_iterator<_Iterator>& __y) | |
| { return !(__x == __y); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator<(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| { return __x.base() < __y.base(); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator<(const move_iterator<_Iterator>& __x, | |
| const move_iterator<_Iterator>& __y) | |
| { return __x.base() < __y.base(); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator<=(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| { return !(__y < __x); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator<=(const move_iterator<_Iterator>& __x, | |
| const move_iterator<_Iterator>& __y) | |
| { return !(__y < __x); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator>(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| { return __y < __x; } | |
| template<typename _Iterator> | |
| inline bool | |
| operator>(const move_iterator<_Iterator>& __x, | |
| const move_iterator<_Iterator>& __y) | |
| { return __y < __x; } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline bool | |
| operator>=(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| { return !(__x < __y); } | |
| template<typename _Iterator> | |
| inline bool | |
| operator>=(const move_iterator<_Iterator>& __x, | |
| const move_iterator<_Iterator>& __y) | |
| { return !(__x < __y); } | |
| template<typename _IteratorL, typename _IteratorR> | |
| inline auto | |
| operator-(const move_iterator<_IteratorL>& __x, | |
| const move_iterator<_IteratorR>& __y) | |
| -> decltype(__x.base() - __y.base()) | |
| { return __x.base() - __y.base(); } | |
| template<typename _Iterator> | |
| inline move_iterator<_Iterator> | |
| operator+(typename move_iterator<_Iterator>::difference_type __n, | |
| const move_iterator<_Iterator>& __x) | |
| { return __x + __n; } | |
| template<typename _Iterator> | |
| inline move_iterator<_Iterator> | |
| make_move_iterator(_Iterator __i) | |
| { return move_iterator<_Iterator>(__i); } | |
| template<typename _Iterator, typename _ReturnType | |
| = typename conditional<__move_if_noexcept_cond | |
| <typename iterator_traits<_Iterator>::value_type>::value, | |
| _Iterator, move_iterator<_Iterator>>::type> | |
| inline _ReturnType | |
| __make_move_if_noexcept_iterator(_Iterator __i) | |
| { return _ReturnType(__i); } | |
| template<typename _Tp, typename _ReturnType | |
| = typename conditional<__move_if_noexcept_cond<_Tp>::value, | |
| const _Tp*, move_iterator<_Tp*>>::type> | |
| inline _ReturnType | |
| __make_move_if_noexcept_iterator(_Tp* __i) | |
| { return _ReturnType(__i); } | |
| template<typename _Iterator> | |
| auto | |
| __niter_base(move_iterator<_Iterator> __it) | |
| -> decltype(make_move_iterator(__niter_base(__it.base()))) | |
| { return make_move_iterator(__niter_base(__it.base())); } | |
| template<typename _Iterator> | |
| struct __is_move_iterator<move_iterator<_Iterator> > | |
| { | |
| enum { __value = 1 }; | |
| typedef __true_type __type; | |
| }; | |
| template<typename _Iterator> | |
| auto | |
| __miter_base(move_iterator<_Iterator> __it) | |
| -> decltype(__miter_base(__it.base())) | |
| { return __miter_base(__it.base()); } | |
| # 1295 "/usr/sgug/include/c++/9/bits/stl_iterator.h" 3 | |
| } | |
| # 68 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/debug/debug.h" 1 3 | |
| # 48 "/usr/sgug/include/c++/9/debug/debug.h" 3 | |
| namespace std | |
| { | |
| namespace __debug { } | |
| } | |
| namespace __gnu_debug | |
| { | |
| using namespace std::__debug; | |
| } | |
| # 70 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/predefined_ops.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/predefined_ops.h" 3 | |
| namespace __gnu_cxx | |
| { | |
| namespace __ops | |
| { | |
| struct _Iter_less_iter | |
| { | |
| template<typename _Iterator1, typename _Iterator2> | |
| constexpr | |
| bool | |
| operator()(_Iterator1 __it1, _Iterator2 __it2) const | |
| { return *__it1 < *__it2; } | |
| }; | |
| constexpr | |
| inline _Iter_less_iter | |
| __iter_less_iter() | |
| { return _Iter_less_iter(); } | |
| struct _Iter_less_val | |
| { | |
| constexpr _Iter_less_val() = default; | |
| explicit | |
| _Iter_less_val(_Iter_less_iter) { } | |
| template<typename _Iterator, typename _Value> | |
| bool | |
| operator()(_Iterator __it, _Value& __val) const | |
| { return *__it < __val; } | |
| }; | |
| inline _Iter_less_val | |
| __iter_less_val() | |
| { return _Iter_less_val(); } | |
| inline _Iter_less_val | |
| __iter_comp_val(_Iter_less_iter) | |
| { return _Iter_less_val(); } | |
| struct _Val_less_iter | |
| { | |
| constexpr _Val_less_iter() = default; | |
| explicit | |
| _Val_less_iter(_Iter_less_iter) { } | |
| template<typename _Value, typename _Iterator> | |
| bool | |
| operator()(_Value& __val, _Iterator __it) const | |
| { return __val < *__it; } | |
| }; | |
| inline _Val_less_iter | |
| __val_less_iter() | |
| { return _Val_less_iter(); } | |
| inline _Val_less_iter | |
| __val_comp_iter(_Iter_less_iter) | |
| { return _Val_less_iter(); } | |
| struct _Iter_equal_to_iter | |
| { | |
| template<typename _Iterator1, typename _Iterator2> | |
| bool | |
| operator()(_Iterator1 __it1, _Iterator2 __it2) const | |
| { return *__it1 == *__it2; } | |
| }; | |
| inline _Iter_equal_to_iter | |
| __iter_equal_to_iter() | |
| { return _Iter_equal_to_iter(); } | |
| struct _Iter_equal_to_val | |
| { | |
| template<typename _Iterator, typename _Value> | |
| bool | |
| operator()(_Iterator __it, _Value& __val) const | |
| { return *__it == __val; } | |
| }; | |
| inline _Iter_equal_to_val | |
| __iter_equal_to_val() | |
| { return _Iter_equal_to_val(); } | |
| inline _Iter_equal_to_val | |
| __iter_comp_val(_Iter_equal_to_iter) | |
| { return _Iter_equal_to_val(); } | |
| template<typename _Compare> | |
| struct _Iter_comp_iter | |
| { | |
| _Compare _M_comp; | |
| explicit constexpr | |
| _Iter_comp_iter(_Compare __comp) | |
| : _M_comp(std::move(__comp)) | |
| { } | |
| template<typename _Iterator1, typename _Iterator2> | |
| constexpr | |
| bool | |
| operator()(_Iterator1 __it1, _Iterator2 __it2) | |
| { return bool(_M_comp(*__it1, *__it2)); } | |
| }; | |
| template<typename _Compare> | |
| constexpr | |
| inline _Iter_comp_iter<_Compare> | |
| __iter_comp_iter(_Compare __comp) | |
| { return _Iter_comp_iter<_Compare>(std::move(__comp)); } | |
| template<typename _Compare> | |
| struct _Iter_comp_val | |
| { | |
| _Compare _M_comp; | |
| explicit | |
| _Iter_comp_val(_Compare __comp) | |
| : _M_comp(std::move(__comp)) | |
| { } | |
| explicit | |
| _Iter_comp_val(const _Iter_comp_iter<_Compare>& __comp) | |
| : _M_comp(__comp._M_comp) | |
| { } | |
| explicit | |
| _Iter_comp_val(_Iter_comp_iter<_Compare>&& __comp) | |
| : _M_comp(std::move(__comp._M_comp)) | |
| { } | |
| template<typename _Iterator, typename _Value> | |
| bool | |
| operator()(_Iterator __it, _Value& __val) | |
| { return bool(_M_comp(*__it, __val)); } | |
| }; | |
| template<typename _Compare> | |
| inline _Iter_comp_val<_Compare> | |
| __iter_comp_val(_Compare __comp) | |
| { return _Iter_comp_val<_Compare>(std::move(__comp)); } | |
| template<typename _Compare> | |
| inline _Iter_comp_val<_Compare> | |
| __iter_comp_val(_Iter_comp_iter<_Compare> __comp) | |
| { return _Iter_comp_val<_Compare>(std::move(__comp)); } | |
| template<typename _Compare> | |
| struct _Val_comp_iter | |
| { | |
| _Compare _M_comp; | |
| explicit | |
| _Val_comp_iter(_Compare __comp) | |
| : _M_comp(std::move(__comp)) | |
| { } | |
| explicit | |
| _Val_comp_iter(const _Iter_comp_iter<_Compare>& __comp) | |
| : _M_comp(__comp._M_comp) | |
| { } | |
| explicit | |
| _Val_comp_iter(_Iter_comp_iter<_Compare>&& __comp) | |
| : _M_comp(std::move(__comp._M_comp)) | |
| { } | |
| template<typename _Value, typename _Iterator> | |
| bool | |
| operator()(_Value& __val, _Iterator __it) | |
| { return bool(_M_comp(__val, *__it)); } | |
| }; | |
| template<typename _Compare> | |
| inline _Val_comp_iter<_Compare> | |
| __val_comp_iter(_Compare __comp) | |
| { return _Val_comp_iter<_Compare>(std::move(__comp)); } | |
| template<typename _Compare> | |
| inline _Val_comp_iter<_Compare> | |
| __val_comp_iter(_Iter_comp_iter<_Compare> __comp) | |
| { return _Val_comp_iter<_Compare>(std::move(__comp)); } | |
| template<typename _Value> | |
| struct _Iter_equals_val | |
| { | |
| _Value& _M_value; | |
| explicit | |
| _Iter_equals_val(_Value& __value) | |
| : _M_value(__value) | |
| { } | |
| template<typename _Iterator> | |
| bool | |
| operator()(_Iterator __it) | |
| { return *__it == _M_value; } | |
| }; | |
| template<typename _Value> | |
| inline _Iter_equals_val<_Value> | |
| __iter_equals_val(_Value& __val) | |
| { return _Iter_equals_val<_Value>(__val); } | |
| template<typename _Iterator1> | |
| struct _Iter_equals_iter | |
| { | |
| _Iterator1 _M_it1; | |
| explicit | |
| _Iter_equals_iter(_Iterator1 __it1) | |
| : _M_it1(__it1) | |
| { } | |
| template<typename _Iterator2> | |
| bool | |
| operator()(_Iterator2 __it2) | |
| { return *__it2 == *_M_it1; } | |
| }; | |
| template<typename _Iterator> | |
| inline _Iter_equals_iter<_Iterator> | |
| __iter_comp_iter(_Iter_equal_to_iter, _Iterator __it) | |
| { return _Iter_equals_iter<_Iterator>(__it); } | |
| template<typename _Predicate> | |
| struct _Iter_pred | |
| { | |
| _Predicate _M_pred; | |
| explicit | |
| _Iter_pred(_Predicate __pred) | |
| : _M_pred(std::move(__pred)) | |
| { } | |
| template<typename _Iterator> | |
| bool | |
| operator()(_Iterator __it) | |
| { return bool(_M_pred(*__it)); } | |
| }; | |
| template<typename _Predicate> | |
| inline _Iter_pred<_Predicate> | |
| __pred_iter(_Predicate __pred) | |
| { return _Iter_pred<_Predicate>(std::move(__pred)); } | |
| template<typename _Compare, typename _Value> | |
| struct _Iter_comp_to_val | |
| { | |
| _Compare _M_comp; | |
| _Value& _M_value; | |
| _Iter_comp_to_val(_Compare __comp, _Value& __value) | |
| : _M_comp(std::move(__comp)), _M_value(__value) | |
| { } | |
| template<typename _Iterator> | |
| bool | |
| operator()(_Iterator __it) | |
| { return bool(_M_comp(*__it, _M_value)); } | |
| }; | |
| template<typename _Compare, typename _Value> | |
| _Iter_comp_to_val<_Compare, _Value> | |
| __iter_comp_val(_Compare __comp, _Value &__val) | |
| { | |
| return _Iter_comp_to_val<_Compare, _Value>(std::move(__comp), __val); | |
| } | |
| template<typename _Compare, typename _Iterator1> | |
| struct _Iter_comp_to_iter | |
| { | |
| _Compare _M_comp; | |
| _Iterator1 _M_it1; | |
| _Iter_comp_to_iter(_Compare __comp, _Iterator1 __it1) | |
| : _M_comp(std::move(__comp)), _M_it1(__it1) | |
| { } | |
| template<typename _Iterator2> | |
| bool | |
| operator()(_Iterator2 __it2) | |
| { return bool(_M_comp(*__it2, *_M_it1)); } | |
| }; | |
| template<typename _Compare, typename _Iterator> | |
| inline _Iter_comp_to_iter<_Compare, _Iterator> | |
| __iter_comp_iter(_Iter_comp_iter<_Compare> __comp, _Iterator __it) | |
| { | |
| return _Iter_comp_to_iter<_Compare, _Iterator>( | |
| std::move(__comp._M_comp), __it); | |
| } | |
| template<typename _Predicate> | |
| struct _Iter_negate | |
| { | |
| _Predicate _M_pred; | |
| explicit | |
| _Iter_negate(_Predicate __pred) | |
| : _M_pred(std::move(__pred)) | |
| { } | |
| template<typename _Iterator> | |
| bool | |
| operator()(_Iterator __it) | |
| { return !bool(_M_pred(*__it)); } | |
| }; | |
| template<typename _Predicate> | |
| inline _Iter_negate<_Predicate> | |
| __negate(_Iter_pred<_Predicate> __pred) | |
| { return _Iter_negate<_Predicate>(std::move(__pred._M_pred)); } | |
| } | |
| } | |
| # 72 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 121 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2> | |
| inline void | |
| iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) | |
| { | |
| # 151 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| swap(*__a, *__b); | |
| } | |
| # 167 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2> | |
| _ForwardIterator2 | |
| swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2) | |
| { | |
| ; | |
| for (; __first1 != __last1; ++__first1, (void)++__first2) | |
| std::iter_swap(__first1, __first2); | |
| return __first2; | |
| } | |
| # 195 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _Tp> | |
| constexpr | |
| inline const _Tp& | |
| min(const _Tp& __a, const _Tp& __b) | |
| { | |
| if (__b < __a) | |
| return __b; | |
| return __a; | |
| } | |
| # 219 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _Tp> | |
| constexpr | |
| inline const _Tp& | |
| max(const _Tp& __a, const _Tp& __b) | |
| { | |
| if (__a < __b) | |
| return __b; | |
| return __a; | |
| } | |
| # 243 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| inline const _Tp& | |
| min(const _Tp& __a, const _Tp& __b, _Compare __comp) | |
| { | |
| if (__comp(__b, __a)) | |
| return __b; | |
| return __a; | |
| } | |
| # 265 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| inline const _Tp& | |
| max(const _Tp& __a, const _Tp& __b, _Compare __comp) | |
| { | |
| if (__comp(__a, __b)) | |
| return __b; | |
| return __a; | |
| } | |
| template<typename _Iterator> | |
| inline _Iterator | |
| __niter_base(_Iterator __it) | |
| noexcept(std::is_nothrow_copy_constructible<_Iterator>::value) | |
| { return __it; } | |
| template<typename _From, typename _To> | |
| inline _From | |
| __niter_wrap(_From __from, _To __res) | |
| { return __from + (__res - std::__niter_base(__from)); } | |
| template<typename _Iterator> | |
| inline _Iterator | |
| __niter_wrap(const _Iterator&, _Iterator __res) | |
| { return __res; } | |
| template<bool, bool, typename> | |
| struct __copy_move | |
| { | |
| template<typename _II, typename _OI> | |
| static _OI | |
| __copy_m(_II __first, _II __last, _OI __result) | |
| { | |
| for (; __first != __last; ++__result, (void)++__first) | |
| *__result = *__first; | |
| return __result; | |
| } | |
| }; | |
| template<typename _Category> | |
| struct __copy_move<true, false, _Category> | |
| { | |
| template<typename _II, typename _OI> | |
| static _OI | |
| __copy_m(_II __first, _II __last, _OI __result) | |
| { | |
| for (; __first != __last; ++__result, (void)++__first) | |
| *__result = std::move(*__first); | |
| return __result; | |
| } | |
| }; | |
| template<> | |
| struct __copy_move<false, false, random_access_iterator_tag> | |
| { | |
| template<typename _II, typename _OI> | |
| static _OI | |
| __copy_m(_II __first, _II __last, _OI __result) | |
| { | |
| typedef typename iterator_traits<_II>::difference_type _Distance; | |
| for(_Distance __n = __last - __first; __n > 0; --__n) | |
| { | |
| *__result = *__first; | |
| ++__first; | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| }; | |
| template<> | |
| struct __copy_move<true, false, random_access_iterator_tag> | |
| { | |
| template<typename _II, typename _OI> | |
| static _OI | |
| __copy_m(_II __first, _II __last, _OI __result) | |
| { | |
| typedef typename iterator_traits<_II>::difference_type _Distance; | |
| for(_Distance __n = __last - __first; __n > 0; --__n) | |
| { | |
| *__result = std::move(*__first); | |
| ++__first; | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| }; | |
| template<bool _IsMove> | |
| struct __copy_move<_IsMove, true, random_access_iterator_tag> | |
| { | |
| template<typename _Tp> | |
| static _Tp* | |
| __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result) | |
| { | |
| using __assignable = conditional<_IsMove, | |
| is_move_assignable<_Tp>, | |
| is_copy_assignable<_Tp>>; | |
| static_assert( __assignable::type::value, "type is not assignable" ); | |
| const ptrdiff_t _Num = __last - __first; | |
| if (_Num) | |
| __builtin_memmove(__result, __first, sizeof(_Tp) * _Num); | |
| return __result + _Num; | |
| } | |
| }; | |
| template<bool _IsMove, typename _II, typename _OI> | |
| inline _OI | |
| __copy_move_a(_II __first, _II __last, _OI __result) | |
| { | |
| typedef typename iterator_traits<_II>::value_type _ValueTypeI; | |
| typedef typename iterator_traits<_OI>::value_type _ValueTypeO; | |
| typedef typename iterator_traits<_II>::iterator_category _Category; | |
| const bool __simple = (__is_trivially_copyable(_ValueTypeI) | |
| && __is_pointer<_II>::__value | |
| && __is_pointer<_OI>::__value | |
| && __are_same<_ValueTypeI, _ValueTypeO>::__value); | |
| return std::__copy_move<_IsMove, __simple, | |
| _Category>::__copy_m(__first, __last, __result); | |
| } | |
| template<typename _CharT> | |
| struct char_traits; | |
| template<typename _CharT, typename _Traits> | |
| class istreambuf_iterator; | |
| template<typename _CharT, typename _Traits> | |
| class ostreambuf_iterator; | |
| template<bool _IsMove, typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type | |
| __copy_move_a2(_CharT*, _CharT*, | |
| ostreambuf_iterator<_CharT, char_traits<_CharT> >); | |
| template<bool _IsMove, typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type | |
| __copy_move_a2(const _CharT*, const _CharT*, | |
| ostreambuf_iterator<_CharT, char_traits<_CharT> >); | |
| template<bool _IsMove, typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| _CharT*>::__type | |
| __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >, | |
| istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*); | |
| template<bool _IsMove, typename _II, typename _OI> | |
| inline _OI | |
| __copy_move_a2(_II __first, _II __last, _OI __result) | |
| { | |
| return std::__niter_wrap(__result, | |
| std::__copy_move_a<_IsMove>(std::__niter_base(__first), | |
| std::__niter_base(__last), | |
| std::__niter_base(__result))); | |
| } | |
| # 463 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _II, typename _OI> | |
| inline _OI | |
| copy(_II __first, _II __last, _OI __result) | |
| { | |
| ; | |
| return std::__copy_move_a2<__is_move_iterator<_II>::__value> | |
| (std::__miter_base(__first), std::__miter_base(__last), __result); | |
| } | |
| # 495 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _II, typename _OI> | |
| inline _OI | |
| move(_II __first, _II __last, _OI __result) | |
| { | |
| ; | |
| return std::__copy_move_a2<true>(std::__miter_base(__first), | |
| std::__miter_base(__last), __result); | |
| } | |
| template<bool, bool, typename> | |
| struct __copy_move_backward | |
| { | |
| template<typename _BI1, typename _BI2> | |
| static _BI2 | |
| __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| while (__first != __last) | |
| *--__result = *--__last; | |
| return __result; | |
| } | |
| }; | |
| template<typename _Category> | |
| struct __copy_move_backward<true, false, _Category> | |
| { | |
| template<typename _BI1, typename _BI2> | |
| static _BI2 | |
| __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| while (__first != __last) | |
| *--__result = std::move(*--__last); | |
| return __result; | |
| } | |
| }; | |
| template<> | |
| struct __copy_move_backward<false, false, random_access_iterator_tag> | |
| { | |
| template<typename _BI1, typename _BI2> | |
| static _BI2 | |
| __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| typename iterator_traits<_BI1>::difference_type __n; | |
| for (__n = __last - __first; __n > 0; --__n) | |
| *--__result = *--__last; | |
| return __result; | |
| } | |
| }; | |
| template<> | |
| struct __copy_move_backward<true, false, random_access_iterator_tag> | |
| { | |
| template<typename _BI1, typename _BI2> | |
| static _BI2 | |
| __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| typename iterator_traits<_BI1>::difference_type __n; | |
| for (__n = __last - __first; __n > 0; --__n) | |
| *--__result = std::move(*--__last); | |
| return __result; | |
| } | |
| }; | |
| template<bool _IsMove> | |
| struct __copy_move_backward<_IsMove, true, random_access_iterator_tag> | |
| { | |
| template<typename _Tp> | |
| static _Tp* | |
| __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result) | |
| { | |
| using __assignable = conditional<_IsMove, | |
| is_move_assignable<_Tp>, | |
| is_copy_assignable<_Tp>>; | |
| static_assert( __assignable::type::value, "type is not assignable" ); | |
| const ptrdiff_t _Num = __last - __first; | |
| if (_Num) | |
| __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num); | |
| return __result - _Num; | |
| } | |
| }; | |
| template<bool _IsMove, typename _BI1, typename _BI2> | |
| inline _BI2 | |
| __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| typedef typename iterator_traits<_BI1>::value_type _ValueType1; | |
| typedef typename iterator_traits<_BI2>::value_type _ValueType2; | |
| typedef typename iterator_traits<_BI1>::iterator_category _Category; | |
| const bool __simple = (__is_trivially_copyable(_ValueType1) | |
| && __is_pointer<_BI1>::__value | |
| && __is_pointer<_BI2>::__value | |
| && __are_same<_ValueType1, _ValueType2>::__value); | |
| return std::__copy_move_backward<_IsMove, __simple, | |
| _Category>::__copy_move_b(__first, | |
| __last, | |
| __result); | |
| } | |
| template<bool _IsMove, typename _BI1, typename _BI2> | |
| inline _BI2 | |
| __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| return std::__niter_wrap(__result, | |
| std::__copy_move_backward_a<_IsMove> | |
| (std::__niter_base(__first), std::__niter_base(__last), | |
| std::__niter_base(__result))); | |
| } | |
| # 639 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _BI1, typename _BI2> | |
| inline _BI2 | |
| copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| ; | |
| return std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value> | |
| (std::__miter_base(__first), std::__miter_base(__last), __result); | |
| } | |
| # 674 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _BI1, typename _BI2> | |
| inline _BI2 | |
| move_backward(_BI1 __first, _BI1 __last, _BI2 __result) | |
| { | |
| ; | |
| return std::__copy_move_backward_a2<true>(std::__miter_base(__first), | |
| std::__miter_base(__last), | |
| __result); | |
| } | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline typename | |
| __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type | |
| __fill_a(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __value) | |
| { | |
| for (; __first != __last; ++__first) | |
| *__first = __value; | |
| } | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline typename | |
| __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type | |
| __fill_a(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __value) | |
| { | |
| const _Tp __tmp = __value; | |
| for (; __first != __last; ++__first) | |
| *__first = __tmp; | |
| } | |
| template<typename _Tp> | |
| inline typename | |
| __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type | |
| __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c) | |
| { | |
| const _Tp __tmp = __c; | |
| if (const size_t __len = __last - __first) | |
| __builtin_memset(__first, static_cast<unsigned char>(__tmp), __len); | |
| } | |
| # 740 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline void | |
| fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) | |
| { | |
| ; | |
| std::__fill_a(std::__niter_base(__first), std::__niter_base(__last), | |
| __value); | |
| } | |
| template<typename _OutputIterator, typename _Size, typename _Tp> | |
| inline typename | |
| __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type | |
| __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) | |
| { | |
| for (__decltype(__n + 0) __niter = __n; | |
| __niter > 0; --__niter, (void) ++__first) | |
| *__first = __value; | |
| return __first; | |
| } | |
| template<typename _OutputIterator, typename _Size, typename _Tp> | |
| inline typename | |
| __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type | |
| __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) | |
| { | |
| const _Tp __tmp = __value; | |
| for (__decltype(__n + 0) __niter = __n; | |
| __niter > 0; --__niter, (void) ++__first) | |
| *__first = __tmp; | |
| return __first; | |
| } | |
| template<typename _Size, typename _Tp> | |
| inline typename | |
| __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type | |
| __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c) | |
| { | |
| std::__fill_a(__first, __first + __n, __c); | |
| return __first + __n; | |
| } | |
| # 800 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _OI, typename _Size, typename _Tp> | |
| inline _OI | |
| fill_n(_OI __first, _Size __n, const _Tp& __value) | |
| { | |
| ; | |
| return std::__niter_wrap(__first, | |
| std::__fill_n_a(std::__niter_base(__first), __n, __value)); | |
| } | |
| template<bool _BoolType> | |
| struct __equal | |
| { | |
| template<typename _II1, typename _II2> | |
| static bool | |
| equal(_II1 __first1, _II1 __last1, _II2 __first2) | |
| { | |
| for (; __first1 != __last1; ++__first1, (void) ++__first2) | |
| if (!(*__first1 == *__first2)) | |
| return false; | |
| return true; | |
| } | |
| }; | |
| template<> | |
| struct __equal<true> | |
| { | |
| template<typename _Tp> | |
| static bool | |
| equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2) | |
| { | |
| if (const size_t __len = (__last1 - __first1)) | |
| return !__builtin_memcmp(__first1, __first2, sizeof(_Tp) * __len); | |
| return true; | |
| } | |
| }; | |
| template<typename _II1, typename _II2> | |
| inline bool | |
| __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2) | |
| { | |
| typedef typename iterator_traits<_II1>::value_type _ValueType1; | |
| typedef typename iterator_traits<_II2>::value_type _ValueType2; | |
| const bool __simple = ((__is_integer<_ValueType1>::__value | |
| || __is_pointer<_ValueType1>::__value) | |
| && __is_pointer<_II1>::__value | |
| && __is_pointer<_II2>::__value | |
| && __are_same<_ValueType1, _ValueType2>::__value); | |
| return std::__equal<__simple>::equal(__first1, __last1, __first2); | |
| } | |
| template<typename, typename> | |
| struct __lc_rai | |
| { | |
| template<typename _II1, typename _II2> | |
| static _II1 | |
| __newlast1(_II1, _II1 __last1, _II2, _II2) | |
| { return __last1; } | |
| template<typename _II> | |
| static bool | |
| __cnd2(_II __first, _II __last) | |
| { return __first != __last; } | |
| }; | |
| template<> | |
| struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag> | |
| { | |
| template<typename _RAI1, typename _RAI2> | |
| static _RAI1 | |
| __newlast1(_RAI1 __first1, _RAI1 __last1, | |
| _RAI2 __first2, _RAI2 __last2) | |
| { | |
| const typename iterator_traits<_RAI1>::difference_type | |
| __diff1 = __last1 - __first1; | |
| const typename iterator_traits<_RAI2>::difference_type | |
| __diff2 = __last2 - __first2; | |
| return __diff2 < __diff1 ? __first1 + __diff2 : __last1; | |
| } | |
| template<typename _RAI> | |
| static bool | |
| __cnd2(_RAI, _RAI) | |
| { return true; } | |
| }; | |
| template<typename _II1, typename _II2, typename _Compare> | |
| bool | |
| __lexicographical_compare_impl(_II1 __first1, _II1 __last1, | |
| _II2 __first2, _II2 __last2, | |
| _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_II1>::iterator_category _Category1; | |
| typedef typename iterator_traits<_II2>::iterator_category _Category2; | |
| typedef std::__lc_rai<_Category1, _Category2> __rai_type; | |
| __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); | |
| for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); | |
| ++__first1, (void)++__first2) | |
| { | |
| if (__comp(__first1, __first2)) | |
| return true; | |
| if (__comp(__first2, __first1)) | |
| return false; | |
| } | |
| return __first1 == __last1 && __first2 != __last2; | |
| } | |
| template<bool _BoolType> | |
| struct __lexicographical_compare | |
| { | |
| template<typename _II1, typename _II2> | |
| static bool __lc(_II1, _II1, _II2, _II2); | |
| }; | |
| template<bool _BoolType> | |
| template<typename _II1, typename _II2> | |
| bool | |
| __lexicographical_compare<_BoolType>:: | |
| __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) | |
| { | |
| return std::__lexicographical_compare_impl(__first1, __last1, | |
| __first2, __last2, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| template<> | |
| struct __lexicographical_compare<true> | |
| { | |
| template<typename _Tp, typename _Up> | |
| static bool | |
| __lc(const _Tp* __first1, const _Tp* __last1, | |
| const _Up* __first2, const _Up* __last2) | |
| { | |
| const size_t __len1 = __last1 - __first1; | |
| const size_t __len2 = __last2 - __first2; | |
| if (const size_t __len = std::min(__len1, __len2)) | |
| if (int __result = __builtin_memcmp(__first1, __first2, __len)) | |
| return __result < 0; | |
| return __len1 < __len2; | |
| } | |
| }; | |
| template<typename _II1, typename _II2> | |
| inline bool | |
| __lexicographical_compare_aux(_II1 __first1, _II1 __last1, | |
| _II2 __first2, _II2 __last2) | |
| { | |
| typedef typename iterator_traits<_II1>::value_type _ValueType1; | |
| typedef typename iterator_traits<_II2>::value_type _ValueType2; | |
| const bool __simple = | |
| (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value | |
| && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed | |
| && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed | |
| && __is_pointer<_II1>::__value | |
| && __is_pointer<_II2>::__value); | |
| return std::__lexicographical_compare<__simple>::__lc(__first1, __last1, | |
| __first2, __last2); | |
| } | |
| template<typename _ForwardIterator, typename _Tp, typename _Compare> | |
| _ForwardIterator | |
| __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_ForwardIterator>::difference_type | |
| _DistanceType; | |
| _DistanceType __len = std::distance(__first, __last); | |
| while (__len > 0) | |
| { | |
| _DistanceType __half = __len >> 1; | |
| _ForwardIterator __middle = __first; | |
| std::advance(__middle, __half); | |
| if (__comp(__middle, __val)) | |
| { | |
| __first = __middle; | |
| ++__first; | |
| __len = __len - __half - 1; | |
| } | |
| else | |
| __len = __half; | |
| } | |
| return __first; | |
| } | |
| # 1002 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline _ForwardIterator | |
| lower_bound(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val) | |
| { | |
| ; | |
| return std::__lower_bound(__first, __last, __val, | |
| __gnu_cxx::__ops::__iter_less_val()); | |
| } | |
| inline constexpr int | |
| __lg(int __n) | |
| { return (int)sizeof(int) * 8 - 1 - __builtin_clz(__n); } | |
| inline constexpr unsigned | |
| __lg(unsigned __n) | |
| { return (int)sizeof(int) * 8 - 1 - __builtin_clz(__n); } | |
| inline constexpr long | |
| __lg(long __n) | |
| { return (int)sizeof(long) * 8 - 1 - __builtin_clzl(__n); } | |
| inline constexpr unsigned long | |
| __lg(unsigned long __n) | |
| { return (int)sizeof(long) * 8 - 1 - __builtin_clzl(__n); } | |
| inline constexpr long long | |
| __lg(long long __n) | |
| { return (int)sizeof(long long) * 8 - 1 - __builtin_clzll(__n); } | |
| inline constexpr unsigned long long | |
| __lg(unsigned long long __n) | |
| { return (int)sizeof(long long) * 8 - 1 - __builtin_clzll(__n); } | |
| # 1057 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _II1, typename _II2> | |
| inline bool | |
| equal(_II1 __first1, _II1 __last1, _II2 __first2) | |
| { | |
| ; | |
| return std::__equal_aux(std::__niter_base(__first1), | |
| std::__niter_base(__last1), | |
| std::__niter_base(__first2)); | |
| } | |
| # 1089 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> | |
| inline bool | |
| equal(_IIter1 __first1, _IIter1 __last1, | |
| _IIter2 __first2, _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| for (; __first1 != __last1; ++__first1, (void)++__first2) | |
| if (!bool(__binary_pred(*__first1, *__first2))) | |
| return false; | |
| return true; | |
| } | |
| template<typename _II1, typename _II2> | |
| inline bool | |
| __equal4(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) | |
| { | |
| using _RATag = random_access_iterator_tag; | |
| using _Cat1 = typename iterator_traits<_II1>::iterator_category; | |
| using _Cat2 = typename iterator_traits<_II2>::iterator_category; | |
| using _RAIters = __and_<is_same<_Cat1, _RATag>, is_same<_Cat2, _RATag>>; | |
| if (_RAIters()) | |
| { | |
| auto __d1 = std::distance(__first1, __last1); | |
| auto __d2 = std::distance(__first2, __last2); | |
| if (__d1 != __d2) | |
| return false; | |
| return std::equal(__first1, __last1, __first2); | |
| } | |
| for (; __first1 != __last1 && __first2 != __last2; | |
| ++__first1, (void)++__first2) | |
| if (!(*__first1 == *__first2)) | |
| return false; | |
| return __first1 == __last1 && __first2 == __last2; | |
| } | |
| template<typename _II1, typename _II2, typename _BinaryPredicate> | |
| inline bool | |
| __equal4(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| using _RATag = random_access_iterator_tag; | |
| using _Cat1 = typename iterator_traits<_II1>::iterator_category; | |
| using _Cat2 = typename iterator_traits<_II2>::iterator_category; | |
| using _RAIters = __and_<is_same<_Cat1, _RATag>, is_same<_Cat2, _RATag>>; | |
| if (_RAIters()) | |
| { | |
| auto __d1 = std::distance(__first1, __last1); | |
| auto __d2 = std::distance(__first2, __last2); | |
| if (__d1 != __d2) | |
| return false; | |
| return std::equal(__first1, __last1, __first2, | |
| __binary_pred); | |
| } | |
| for (; __first1 != __last1 && __first2 != __last2; | |
| ++__first1, (void)++__first2) | |
| if (!bool(__binary_pred(*__first1, *__first2))) | |
| return false; | |
| return __first1 == __last1 && __first2 == __last2; | |
| } | |
| # 1176 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _II1, typename _II2> | |
| inline bool | |
| equal(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) | |
| { | |
| ; | |
| ; | |
| return std::__equal4(__first1, __last1, __first2, __last2); | |
| } | |
| # 1208 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> | |
| inline bool | |
| equal(_IIter1 __first1, _IIter1 __last1, | |
| _IIter2 __first2, _IIter2 __last2, _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| ; | |
| return std::__equal4(__first1, __last1, __first2, __last2, | |
| __binary_pred); | |
| } | |
| # 1239 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _II1, typename _II2> | |
| inline bool | |
| lexicographical_compare(_II1 __first1, _II1 __last1, | |
| _II2 __first2, _II2 __last2) | |
| { | |
| ; | |
| ; | |
| return std::__lexicographical_compare_aux(std::__niter_base(__first1), | |
| std::__niter_base(__last1), | |
| std::__niter_base(__first2), | |
| std::__niter_base(__last2)); | |
| } | |
| # 1275 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _II1, typename _II2, typename _Compare> | |
| inline bool | |
| lexicographical_compare(_II1 __first1, _II1 __last1, | |
| _II2 __first2, _II2 __last2, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__lexicographical_compare_impl | |
| (__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _BinaryPredicate> | |
| pair<_InputIterator1, _InputIterator2> | |
| __mismatch(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _BinaryPredicate __binary_pred) | |
| { | |
| while (__first1 != __last1 && __binary_pred(__first1, __first2)) | |
| { | |
| ++__first1; | |
| ++__first2; | |
| } | |
| return pair<_InputIterator1, _InputIterator2>(__first1, __first2); | |
| } | |
| # 1318 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2> | |
| inline pair<_InputIterator1, _InputIterator2> | |
| mismatch(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2) | |
| { | |
| ; | |
| return std::__mismatch(__first1, __last1, __first2, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 1351 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _BinaryPredicate> | |
| inline pair<_InputIterator1, _InputIterator2> | |
| mismatch(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| return std::__mismatch(__first1, __last1, __first2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__binary_pred)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _BinaryPredicate> | |
| pair<_InputIterator1, _InputIterator2> | |
| __mismatch(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2 | |
| && __binary_pred(__first1, __first2)) | |
| { | |
| ++__first1; | |
| ++__first2; | |
| } | |
| return pair<_InputIterator1, _InputIterator2>(__first1, __first2); | |
| } | |
| # 1398 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2> | |
| inline pair<_InputIterator1, _InputIterator2> | |
| mismatch(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2) | |
| { | |
| ; | |
| ; | |
| return std::__mismatch(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 1433 "/usr/sgug/include/c++/9/bits/stl_algobase.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _BinaryPredicate> | |
| inline pair<_InputIterator1, _InputIterator2> | |
| mismatch(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| ; | |
| return std::__mismatch(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__binary_pred)); | |
| } | |
| } | |
| # 62 "/usr/sgug/include/c++/9/algorithm" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_algo.h" 1 3 | |
| # 59 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/cstdlib" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 40 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 60 "/usr/sgug/include/c++/9/bits/stl_algo.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| # 42 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 195 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| template<typename _IIter, typename _Predicate> | |
| bool | |
| all_of(_IIter, _IIter, _Predicate); | |
| template<typename _IIter, typename _Predicate> | |
| bool | |
| any_of(_IIter, _IIter, _Predicate); | |
| template<typename _FIter, typename _Tp> | |
| bool | |
| binary_search(_FIter, _FIter, const _Tp&); | |
| template<typename _FIter, typename _Tp, typename _Compare> | |
| bool | |
| binary_search(_FIter, _FIter, const _Tp&, _Compare); | |
| # 224 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| template<typename _IIter, typename _OIter> | |
| _OIter | |
| copy(_IIter, _IIter, _OIter); | |
| template<typename _BIter1, typename _BIter2> | |
| _BIter2 | |
| copy_backward(_BIter1, _BIter1, _BIter2); | |
| template<typename _IIter, typename _OIter, typename _Predicate> | |
| _OIter | |
| copy_if(_IIter, _IIter, _OIter, _Predicate); | |
| template<typename _IIter, typename _Size, typename _OIter> | |
| _OIter | |
| copy_n(_IIter, _Size, _OIter); | |
| template<typename _FIter, typename _Tp> | |
| pair<_FIter, _FIter> | |
| equal_range(_FIter, _FIter, const _Tp&); | |
| template<typename _FIter, typename _Tp, typename _Compare> | |
| pair<_FIter, _FIter> | |
| equal_range(_FIter, _FIter, const _Tp&, _Compare); | |
| template<typename _FIter, typename _Tp> | |
| void | |
| fill(_FIter, _FIter, const _Tp&); | |
| template<typename _OIter, typename _Size, typename _Tp> | |
| _OIter | |
| fill_n(_OIter, _Size, const _Tp&); | |
| template<typename _FIter1, typename _FIter2> | |
| _FIter1 | |
| find_end(_FIter1, _FIter1, _FIter2, _FIter2); | |
| template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> | |
| _FIter1 | |
| find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); | |
| template<typename _IIter, typename _Predicate> | |
| _IIter | |
| find_if_not(_IIter, _IIter, _Predicate); | |
| template<typename _IIter1, typename _IIter2> | |
| bool | |
| includes(_IIter1, _IIter1, _IIter2, _IIter2); | |
| template<typename _IIter1, typename _IIter2, typename _Compare> | |
| bool | |
| includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); | |
| template<typename _BIter> | |
| void | |
| inplace_merge(_BIter, _BIter, _BIter); | |
| template<typename _BIter, typename _Compare> | |
| void | |
| inplace_merge(_BIter, _BIter, _BIter, _Compare); | |
| template<typename _RAIter> | |
| bool | |
| is_heap(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| bool | |
| is_heap(_RAIter, _RAIter, _Compare); | |
| template<typename _RAIter> | |
| _RAIter | |
| is_heap_until(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| _RAIter | |
| is_heap_until(_RAIter, _RAIter, _Compare); | |
| template<typename _IIter, typename _Predicate> | |
| bool | |
| is_partitioned(_IIter, _IIter, _Predicate); | |
| template<typename _FIter1, typename _FIter2> | |
| bool | |
| is_permutation(_FIter1, _FIter1, _FIter2); | |
| template<typename _FIter1, typename _FIter2, | |
| typename _BinaryPredicate> | |
| bool | |
| is_permutation(_FIter1, _FIter1, _FIter2, _BinaryPredicate); | |
| template<typename _FIter> | |
| bool | |
| is_sorted(_FIter, _FIter); | |
| template<typename _FIter, typename _Compare> | |
| bool | |
| is_sorted(_FIter, _FIter, _Compare); | |
| template<typename _FIter> | |
| _FIter | |
| is_sorted_until(_FIter, _FIter); | |
| template<typename _FIter, typename _Compare> | |
| _FIter | |
| is_sorted_until(_FIter, _FIter, _Compare); | |
| template<typename _FIter1, typename _FIter2> | |
| void | |
| iter_swap(_FIter1, _FIter2); | |
| template<typename _FIter, typename _Tp> | |
| _FIter | |
| lower_bound(_FIter, _FIter, const _Tp&); | |
| template<typename _FIter, typename _Tp, typename _Compare> | |
| _FIter | |
| lower_bound(_FIter, _FIter, const _Tp&, _Compare); | |
| template<typename _RAIter> | |
| void | |
| make_heap(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| make_heap(_RAIter, _RAIter, _Compare); | |
| template<typename _Tp> | |
| constexpr | |
| const _Tp& | |
| max(const _Tp&, const _Tp&); | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| const _Tp& | |
| max(const _Tp&, const _Tp&, _Compare); | |
| template<typename _Tp> | |
| constexpr | |
| const _Tp& | |
| min(const _Tp&, const _Tp&); | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| const _Tp& | |
| min(const _Tp&, const _Tp&, _Compare); | |
| template<typename _Tp> | |
| constexpr | |
| pair<const _Tp&, const _Tp&> | |
| minmax(const _Tp&, const _Tp&); | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| pair<const _Tp&, const _Tp&> | |
| minmax(const _Tp&, const _Tp&, _Compare); | |
| template<typename _FIter> | |
| constexpr | |
| pair<_FIter, _FIter> | |
| minmax_element(_FIter, _FIter); | |
| template<typename _FIter, typename _Compare> | |
| constexpr | |
| pair<_FIter, _FIter> | |
| minmax_element(_FIter, _FIter, _Compare); | |
| template<typename _Tp> | |
| constexpr | |
| _Tp | |
| min(initializer_list<_Tp>); | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| _Tp | |
| min(initializer_list<_Tp>, _Compare); | |
| template<typename _Tp> | |
| constexpr | |
| _Tp | |
| max(initializer_list<_Tp>); | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| _Tp | |
| max(initializer_list<_Tp>, _Compare); | |
| template<typename _Tp> | |
| constexpr | |
| pair<_Tp, _Tp> | |
| minmax(initializer_list<_Tp>); | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| pair<_Tp, _Tp> | |
| minmax(initializer_list<_Tp>, _Compare); | |
| template<typename _BIter> | |
| bool | |
| next_permutation(_BIter, _BIter); | |
| template<typename _BIter, typename _Compare> | |
| bool | |
| next_permutation(_BIter, _BIter, _Compare); | |
| template<typename _IIter, typename _Predicate> | |
| bool | |
| none_of(_IIter, _IIter, _Predicate); | |
| template<typename _IIter, typename _RAIter> | |
| _RAIter | |
| partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter); | |
| template<typename _IIter, typename _RAIter, typename _Compare> | |
| _RAIter | |
| partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare); | |
| template<typename _IIter, typename _OIter1, | |
| typename _OIter2, typename _Predicate> | |
| pair<_OIter1, _OIter2> | |
| partition_copy(_IIter, _IIter, _OIter1, _OIter2, _Predicate); | |
| template<typename _FIter, typename _Predicate> | |
| _FIter | |
| partition_point(_FIter, _FIter, _Predicate); | |
| template<typename _RAIter> | |
| void | |
| pop_heap(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| pop_heap(_RAIter, _RAIter, _Compare); | |
| template<typename _BIter> | |
| bool | |
| prev_permutation(_BIter, _BIter); | |
| template<typename _BIter, typename _Compare> | |
| bool | |
| prev_permutation(_BIter, _BIter, _Compare); | |
| template<typename _RAIter> | |
| void | |
| push_heap(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| push_heap(_RAIter, _RAIter, _Compare); | |
| template<typename _FIter, typename _Tp> | |
| _FIter | |
| remove(_FIter, _FIter, const _Tp&); | |
| template<typename _FIter, typename _Predicate> | |
| _FIter | |
| remove_if(_FIter, _FIter, _Predicate); | |
| template<typename _IIter, typename _OIter, typename _Tp> | |
| _OIter | |
| remove_copy(_IIter, _IIter, _OIter, const _Tp&); | |
| template<typename _IIter, typename _OIter, typename _Predicate> | |
| _OIter | |
| remove_copy_if(_IIter, _IIter, _OIter, _Predicate); | |
| template<typename _IIter, typename _OIter, typename _Tp> | |
| _OIter | |
| replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&); | |
| template<typename _Iter, typename _OIter, typename _Predicate, typename _Tp> | |
| _OIter | |
| replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&); | |
| template<typename _BIter> | |
| void | |
| reverse(_BIter, _BIter); | |
| template<typename _BIter, typename _OIter> | |
| _OIter | |
| reverse_copy(_BIter, _BIter, _OIter); | |
| inline namespace _V2 | |
| { | |
| template<typename _FIter> | |
| _FIter | |
| rotate(_FIter, _FIter, _FIter); | |
| } | |
| template<typename _FIter, typename _OIter> | |
| _OIter | |
| rotate_copy(_FIter, _FIter, _FIter, _OIter); | |
| # 565 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| template<typename _RAIter, typename _UGenerator> | |
| void | |
| shuffle(_RAIter, _RAIter, _UGenerator&&); | |
| template<typename _RAIter> | |
| void | |
| sort_heap(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| sort_heap(_RAIter, _RAIter, _Compare); | |
| template<typename _BIter, typename _Predicate> | |
| _BIter | |
| stable_partition(_BIter, _BIter, _Predicate); | |
| # 594 "/usr/sgug/include/c++/9/bits/algorithmfwd.h" 3 | |
| template<typename _FIter1, typename _FIter2> | |
| _FIter2 | |
| swap_ranges(_FIter1, _FIter1, _FIter2); | |
| template<typename _FIter> | |
| _FIter | |
| unique(_FIter, _FIter); | |
| template<typename _FIter, typename _BinaryPredicate> | |
| _FIter | |
| unique(_FIter, _FIter, _BinaryPredicate); | |
| template<typename _FIter, typename _Tp> | |
| _FIter | |
| upper_bound(_FIter, _FIter, const _Tp&); | |
| template<typename _FIter, typename _Tp, typename _Compare> | |
| _FIter | |
| upper_bound(_FIter, _FIter, const _Tp&, _Compare); | |
| template<typename _FIter> | |
| _FIter | |
| adjacent_find(_FIter, _FIter); | |
| template<typename _FIter, typename _BinaryPredicate> | |
| _FIter | |
| adjacent_find(_FIter, _FIter, _BinaryPredicate); | |
| template<typename _IIter, typename _Tp> | |
| typename iterator_traits<_IIter>::difference_type | |
| count(_IIter, _IIter, const _Tp&); | |
| template<typename _IIter, typename _Predicate> | |
| typename iterator_traits<_IIter>::difference_type | |
| count_if(_IIter, _IIter, _Predicate); | |
| template<typename _IIter1, typename _IIter2> | |
| bool | |
| equal(_IIter1, _IIter1, _IIter2); | |
| template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> | |
| bool | |
| equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate); | |
| template<typename _IIter, typename _Tp> | |
| _IIter | |
| find(_IIter, _IIter, const _Tp&); | |
| template<typename _FIter1, typename _FIter2> | |
| _FIter1 | |
| find_first_of(_FIter1, _FIter1, _FIter2, _FIter2); | |
| template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> | |
| _FIter1 | |
| find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); | |
| template<typename _IIter, typename _Predicate> | |
| _IIter | |
| find_if(_IIter, _IIter, _Predicate); | |
| template<typename _IIter, typename _Funct> | |
| _Funct | |
| for_each(_IIter, _IIter, _Funct); | |
| template<typename _FIter, typename _Generator> | |
| void | |
| generate(_FIter, _FIter, _Generator); | |
| template<typename _OIter, typename _Size, typename _Generator> | |
| _OIter | |
| generate_n(_OIter, _Size, _Generator); | |
| template<typename _IIter1, typename _IIter2> | |
| bool | |
| lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2); | |
| template<typename _IIter1, typename _IIter2, typename _Compare> | |
| bool | |
| lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); | |
| template<typename _FIter> | |
| constexpr | |
| _FIter | |
| max_element(_FIter, _FIter); | |
| template<typename _FIter, typename _Compare> | |
| constexpr | |
| _FIter | |
| max_element(_FIter, _FIter, _Compare); | |
| template<typename _IIter1, typename _IIter2, typename _OIter> | |
| _OIter | |
| merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); | |
| template<typename _IIter1, typename _IIter2, typename _OIter, | |
| typename _Compare> | |
| _OIter | |
| merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); | |
| template<typename _FIter> | |
| constexpr | |
| _FIter | |
| min_element(_FIter, _FIter); | |
| template<typename _FIter, typename _Compare> | |
| constexpr | |
| _FIter | |
| min_element(_FIter, _FIter, _Compare); | |
| template<typename _IIter1, typename _IIter2> | |
| pair<_IIter1, _IIter2> | |
| mismatch(_IIter1, _IIter1, _IIter2); | |
| template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> | |
| pair<_IIter1, _IIter2> | |
| mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate); | |
| template<typename _RAIter> | |
| void | |
| nth_element(_RAIter, _RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| nth_element(_RAIter, _RAIter, _RAIter, _Compare); | |
| template<typename _RAIter> | |
| void | |
| partial_sort(_RAIter, _RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| partial_sort(_RAIter, _RAIter, _RAIter, _Compare); | |
| template<typename _BIter, typename _Predicate> | |
| _BIter | |
| partition(_BIter, _BIter, _Predicate); | |
| template<typename _RAIter> | |
| void | |
| random_shuffle(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Generator> | |
| void | |
| random_shuffle(_RAIter, _RAIter, | |
| _Generator&&); | |
| template<typename _FIter, typename _Tp> | |
| void | |
| replace(_FIter, _FIter, const _Tp&, const _Tp&); | |
| template<typename _FIter, typename _Predicate, typename _Tp> | |
| void | |
| replace_if(_FIter, _FIter, _Predicate, const _Tp&); | |
| template<typename _FIter1, typename _FIter2> | |
| _FIter1 | |
| search(_FIter1, _FIter1, _FIter2, _FIter2); | |
| template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> | |
| _FIter1 | |
| search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); | |
| template<typename _FIter, typename _Size, typename _Tp> | |
| _FIter | |
| search_n(_FIter, _FIter, _Size, const _Tp&); | |
| template<typename _FIter, typename _Size, typename _Tp, | |
| typename _BinaryPredicate> | |
| _FIter | |
| search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate); | |
| template<typename _IIter1, typename _IIter2, typename _OIter> | |
| _OIter | |
| set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); | |
| template<typename _IIter1, typename _IIter2, typename _OIter, | |
| typename _Compare> | |
| _OIter | |
| set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); | |
| template<typename _IIter1, typename _IIter2, typename _OIter> | |
| _OIter | |
| set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); | |
| template<typename _IIter1, typename _IIter2, typename _OIter, | |
| typename _Compare> | |
| _OIter | |
| set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); | |
| template<typename _IIter1, typename _IIter2, typename _OIter> | |
| _OIter | |
| set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); | |
| template<typename _IIter1, typename _IIter2, typename _OIter, | |
| typename _Compare> | |
| _OIter | |
| set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, | |
| _OIter, _Compare); | |
| template<typename _IIter1, typename _IIter2, typename _OIter> | |
| _OIter | |
| set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); | |
| template<typename _IIter1, typename _IIter2, typename _OIter, | |
| typename _Compare> | |
| _OIter | |
| set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); | |
| template<typename _RAIter> | |
| void | |
| sort(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| sort(_RAIter, _RAIter, _Compare); | |
| template<typename _RAIter> | |
| void | |
| stable_sort(_RAIter, _RAIter); | |
| template<typename _RAIter, typename _Compare> | |
| void | |
| stable_sort(_RAIter, _RAIter, _Compare); | |
| template<typename _IIter, typename _OIter, typename _UnaryOperation> | |
| _OIter | |
| transform(_IIter, _IIter, _OIter, _UnaryOperation); | |
| template<typename _IIter1, typename _IIter2, typename _OIter, | |
| typename _BinaryOperation> | |
| _OIter | |
| transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation); | |
| template<typename _IIter, typename _OIter> | |
| _OIter | |
| unique_copy(_IIter, _IIter, _OIter); | |
| template<typename _IIter, typename _OIter, typename _BinaryPredicate> | |
| _OIter | |
| unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate); | |
| } | |
| # 61 "/usr/sgug/include/c++/9/bits/stl_algo.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_heap.h" 1 3 | |
| # 62 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _RandomAccessIterator, typename _Distance, | |
| typename _Compare> | |
| _Distance | |
| __is_heap_until(_RandomAccessIterator __first, _Distance __n, | |
| _Compare& __comp) | |
| { | |
| _Distance __parent = 0; | |
| for (_Distance __child = 1; __child < __n; ++__child) | |
| { | |
| if (__comp(__first + __parent, __first + __child)) | |
| return __child; | |
| if ((__child & 1) == 0) | |
| ++__parent; | |
| } | |
| return __n; | |
| } | |
| template<typename _RandomAccessIterator, typename _Distance> | |
| inline bool | |
| __is_heap(_RandomAccessIterator __first, _Distance __n) | |
| { | |
| __gnu_cxx::__ops::_Iter_less_iter __comp; | |
| return std::__is_heap_until(__first, __n, __comp) == __n; | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare, | |
| typename _Distance> | |
| inline bool | |
| __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) | |
| { | |
| typedef __decltype(__comp) _Cmp; | |
| __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(std::move(__comp)); | |
| return std::__is_heap_until(__first, __n, __cmp) == __n; | |
| } | |
| template<typename _RandomAccessIterator> | |
| inline bool | |
| __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { return std::__is_heap(__first, std::distance(__first, __last)); } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline bool | |
| __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| return std::__is_heap(__first, std::move(__comp), | |
| std::distance(__first, __last)); | |
| } | |
| template<typename _RandomAccessIterator, typename _Distance, typename _Tp, | |
| typename _Compare> | |
| void | |
| __push_heap(_RandomAccessIterator __first, | |
| _Distance __holeIndex, _Distance __topIndex, _Tp __value, | |
| _Compare& __comp) | |
| { | |
| _Distance __parent = (__holeIndex - 1) / 2; | |
| while (__holeIndex > __topIndex && __comp(__first + __parent, __value)) | |
| { | |
| *(__first + __holeIndex) = std::move(*(__first + __parent)); | |
| __holeIndex = __parent; | |
| __parent = (__holeIndex - 1) / 2; | |
| } | |
| *(__first + __holeIndex) = std::move(__value); | |
| } | |
| # 152 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| typedef typename iterator_traits<_RandomAccessIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _DistanceType; | |
| ; | |
| ; | |
| ; | |
| __gnu_cxx::__ops::_Iter_less_val __comp; | |
| _ValueType __value = std::move(*(__last - 1)); | |
| std::__push_heap(__first, _DistanceType((__last - __first) - 1), | |
| _DistanceType(0), std::move(__value), __comp); | |
| } | |
| # 187 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_RandomAccessIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _DistanceType; | |
| ; | |
| ; | |
| ; | |
| __decltype(__gnu_cxx::__ops::__iter_comp_val(std::move(__comp))) | |
| __cmp(std::move(__comp)); | |
| _ValueType __value = std::move(*(__last - 1)); | |
| std::__push_heap(__first, _DistanceType((__last - __first) - 1), | |
| _DistanceType(0), std::move(__value), __cmp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Distance, | |
| typename _Tp, typename _Compare> | |
| void | |
| __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | |
| _Distance __len, _Tp __value, _Compare __comp) | |
| { | |
| const _Distance __topIndex = __holeIndex; | |
| _Distance __secondChild = __holeIndex; | |
| while (__secondChild < (__len - 1) / 2) | |
| { | |
| __secondChild = 2 * (__secondChild + 1); | |
| if (__comp(__first + __secondChild, | |
| __first + (__secondChild - 1))) | |
| __secondChild--; | |
| *(__first + __holeIndex) = std::move(*(__first + __secondChild)); | |
| __holeIndex = __secondChild; | |
| } | |
| if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) | |
| { | |
| __secondChild = 2 * (__secondChild + 1); | |
| *(__first + __holeIndex) = std::move(*(__first + (__secondChild - 1))) | |
| ; | |
| __holeIndex = __secondChild - 1; | |
| } | |
| __decltype(__gnu_cxx::__ops::__iter_comp_val(std::move(__comp))) | |
| __cmp(std::move(__comp)); | |
| std::__push_heap(__first, __holeIndex, __topIndex, | |
| std::move(__value), __cmp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _RandomAccessIterator __result, _Compare& __comp) | |
| { | |
| typedef typename iterator_traits<_RandomAccessIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _DistanceType; | |
| _ValueType __value = std::move(*__result); | |
| *__result = std::move(*__first); | |
| std::__adjust_heap(__first, _DistanceType(0), | |
| _DistanceType(__last - __first), | |
| std::move(__value), __comp); | |
| } | |
| # 269 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| if (__last - __first > 1) | |
| { | |
| --__last; | |
| __gnu_cxx::__ops::_Iter_less_iter __comp; | |
| std::__pop_heap(__first, __last, __last, __comp); | |
| } | |
| } | |
| # 302 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| pop_heap(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| if (__last - __first > 1) | |
| { | |
| typedef __decltype(__comp) _Cmp; | |
| __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(std::move(__comp)); | |
| --__last; | |
| std::__pop_heap(__first, __last, __last, __cmp); | |
| } | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare& __comp) | |
| { | |
| typedef typename iterator_traits<_RandomAccessIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _DistanceType; | |
| if (__last - __first < 2) | |
| return; | |
| const _DistanceType __len = __last - __first; | |
| _DistanceType __parent = (__len - 2) / 2; | |
| while (true) | |
| { | |
| _ValueType __value = std::move(*(__first + __parent)); | |
| std::__adjust_heap(__first, __parent, __len, std::move(__value), | |
| __comp); | |
| if (__parent == 0) | |
| return; | |
| __parent--; | |
| } | |
| } | |
| # 358 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| __gnu_cxx::__ops::_Iter_less_iter __comp; | |
| std::__make_heap(__first, __last, __comp); | |
| } | |
| # 384 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| typedef __decltype(__comp) _Cmp; | |
| __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(std::move(__comp)); | |
| std::__make_heap(__first, __last, __cmp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare& __comp) | |
| { | |
| while (__last - __first > 1) | |
| { | |
| --__last; | |
| std::__pop_heap(__first, __last, __last, __comp); | |
| } | |
| } | |
| # 420 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| ; | |
| __gnu_cxx::__ops::_Iter_less_iter __comp; | |
| std::__sort_heap(__first, __last, __comp); | |
| } | |
| # 447 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| typedef __decltype(__comp) _Cmp; | |
| __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(std::move(__comp)); | |
| std::__sort_heap(__first, __last, __cmp); | |
| } | |
| # 475 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline _RandomAccessIterator | |
| is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| __gnu_cxx::__ops::_Iter_less_iter __comp; | |
| return __first + | |
| std::__is_heap_until(__first, std::distance(__first, __last), __comp); | |
| } | |
| # 503 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline _RandomAccessIterator | |
| is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| typedef __decltype(__comp) _Cmp; | |
| __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(std::move(__comp)); | |
| return __first | |
| + std::__is_heap_until(__first, std::distance(__first, __last), __cmp); | |
| } | |
| # 527 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline bool | |
| is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { return std::is_heap_until(__first, __last) == __last; } | |
| # 540 "/usr/sgug/include/c++/9/bits/stl_heap.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline bool | |
| is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| const auto __dist = std::distance(__first, __last); | |
| typedef __decltype(__comp) _Cmp; | |
| __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(std::move(__comp)); | |
| return std::__is_heap_until(__first, __dist, __cmp) == __dist; | |
| } | |
| } | |
| # 62 "/usr/sgug/include/c++/9/bits/stl_algo.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_tempbuf.h" 1 3 | |
| # 60 "/usr/sgug/include/c++/9/bits/stl_tempbuf.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_construct.h" 1 3 | |
| # 59 "/usr/sgug/include/c++/9/bits/stl_construct.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/new" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/new" 3 | |
| # 38 "/usr/sgug/include/c++/9/new" 3 | |
| # 1 "/usr/sgug/include/c++/9/exception" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/exception" 3 | |
| # 34 "/usr/sgug/include/c++/9/exception" 3 | |
| #pragma GCC visibility push(default) | |
| # 1 "/usr/sgug/include/c++/9/bits/exception.h" 1 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/exception.h" 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/exception.h" 3 | |
| #pragma GCC visibility push(default) | |
| extern "C++" { | |
| namespace std | |
| { | |
| # 60 "/usr/sgug/include/c++/9/bits/exception.h" 3 | |
| class exception | |
| { | |
| public: | |
| exception() noexcept { } | |
| virtual ~exception() noexcept; | |
| exception(const exception&) = default; | |
| exception& operator=(const exception&) = default; | |
| exception(exception&&) = default; | |
| exception& operator=(exception&&) = default; | |
| virtual const char* | |
| what() const noexcept; | |
| }; | |
| } | |
| } | |
| #pragma GCC visibility pop | |
| # 39 "/usr/sgug/include/c++/9/exception" 2 3 | |
| extern "C++" { | |
| namespace std | |
| { | |
| class bad_exception : public exception | |
| { | |
| public: | |
| bad_exception() noexcept { } | |
| virtual ~bad_exception() noexcept; | |
| virtual const char* | |
| what() const noexcept; | |
| }; | |
| typedef void (*terminate_handler) (); | |
| typedef void (*unexpected_handler) (); | |
| terminate_handler set_terminate(terminate_handler) noexcept; | |
| terminate_handler get_terminate() noexcept; | |
| void terminate() noexcept __attribute__ ((__noreturn__)); | |
| unexpected_handler set_unexpected(unexpected_handler) noexcept; | |
| unexpected_handler get_unexpected() noexcept; | |
| void unexpected() __attribute__ ((__noreturn__)); | |
| # 101 "/usr/sgug/include/c++/9/exception" 3 | |
| bool uncaught_exception() noexcept __attribute__ ((__pure__)); | |
| # 111 "/usr/sgug/include/c++/9/exception" 3 | |
| } | |
| namespace __gnu_cxx | |
| { | |
| # 133 "/usr/sgug/include/c++/9/exception" 3 | |
| void __verbose_terminate_handler(); | |
| } | |
| } | |
| #pragma GCC visibility pop | |
| # 1 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 1 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 3 | |
| #pragma GCC visibility push(default) | |
| # 1 "/usr/sgug/include/c++/9/bits/cxxabi_init_exception.h" 1 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/cxxabi_init_exception.h" 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/cxxabi_init_exception.h" 3 | |
| #pragma GCC visibility push(default) | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stddef.h" 1 3 4 | |
| # 39 "/usr/sgug/include/c++/9/bits/cxxabi_init_exception.h" 2 3 | |
| # 50 "/usr/sgug/include/c++/9/bits/cxxabi_init_exception.h" 3 | |
| namespace std | |
| { | |
| class type_info; | |
| } | |
| namespace __cxxabiv1 | |
| { | |
| struct __cxa_refcounted_exception; | |
| extern "C" | |
| { | |
| void* | |
| __cxa_allocate_exception(size_t) noexcept; | |
| void | |
| __cxa_free_exception(void*) noexcept; | |
| __cxa_refcounted_exception* | |
| __cxa_init_primary_exception(void *object, std::type_info *tinfo, | |
| void ( *dest) (void *)) noexcept; | |
| } | |
| } | |
| #pragma GCC visibility pop | |
| # 39 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/typeinfo" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/typeinfo" 3 | |
| # 33 "/usr/sgug/include/c++/9/typeinfo" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/hash_bytes.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/hash_bytes.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/hash_bytes.h" 3 | |
| namespace std | |
| { | |
| size_t | |
| _Hash_bytes(const void* __ptr, size_t __len, size_t __seed); | |
| size_t | |
| _Fnv_hash_bytes(const void* __ptr, size_t __len, size_t __seed); | |
| } | |
| # 37 "/usr/sgug/include/c++/9/typeinfo" 2 3 | |
| #pragma GCC visibility push(default) | |
| extern "C++" { | |
| namespace __cxxabiv1 | |
| { | |
| class __class_type_info; | |
| } | |
| # 80 "/usr/sgug/include/c++/9/typeinfo" 3 | |
| namespace std | |
| { | |
| class type_info | |
| { | |
| public: | |
| virtual ~type_info(); | |
| const char* name() const noexcept | |
| { return __name[0] == '*' ? __name + 1 : __name; } | |
| # 115 "/usr/sgug/include/c++/9/typeinfo" 3 | |
| bool before(const type_info& __arg) const noexcept | |
| { return (__name[0] == '*' && __arg.__name[0] == '*') | |
| ? __name < __arg.__name | |
| : __builtin_strcmp (__name, __arg.__name) < 0; } | |
| bool operator==(const type_info& __arg) const noexcept | |
| { | |
| return ((__name == __arg.__name) | |
| || (__name[0] != '*' && | |
| __builtin_strcmp (__name, __arg.__name) == 0)); | |
| } | |
| # 136 "/usr/sgug/include/c++/9/typeinfo" 3 | |
| bool operator!=(const type_info& __arg) const noexcept | |
| { return !operator==(__arg); } | |
| size_t hash_code() const noexcept | |
| { | |
| return _Hash_bytes(name(), __builtin_strlen(name()), | |
| static_cast<size_t>(0xc70f6907UL)); | |
| } | |
| 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; | |
| protected: | |
| const char *__name; | |
| explicit type_info(const char *__n): __name(__n) { } | |
| private: | |
| type_info& operator=(const type_info&); | |
| type_info(const type_info&); | |
| }; | |
| class bad_cast : public exception | |
| { | |
| public: | |
| bad_cast() noexcept { } | |
| virtual ~bad_cast() noexcept; | |
| virtual const char* what() const noexcept; | |
| }; | |
| class bad_typeid : public exception | |
| { | |
| public: | |
| bad_typeid () noexcept { } | |
| virtual ~bad_typeid() noexcept; | |
| virtual const char* what() const noexcept; | |
| }; | |
| } | |
| } | |
| #pragma GCC visibility pop | |
| # 40 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/new" 1 3 | |
| # 41 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 2 3 | |
| extern "C++" { | |
| namespace std | |
| { | |
| class type_info; | |
| namespace __exception_ptr | |
| { | |
| class exception_ptr; | |
| } | |
| using __exception_ptr::exception_ptr; | |
| exception_ptr current_exception() noexcept; | |
| template<typename _Ex> | |
| exception_ptr make_exception_ptr(_Ex) noexcept; | |
| void rethrow_exception(exception_ptr) __attribute__ ((__noreturn__)); | |
| namespace __exception_ptr | |
| { | |
| using std::rethrow_exception; | |
| class exception_ptr | |
| { | |
| void* _M_exception_object; | |
| explicit exception_ptr(void* __e) noexcept; | |
| void _M_addref() noexcept; | |
| void _M_release() noexcept; | |
| void *_M_get() const noexcept __attribute__ ((__pure__)); | |
| friend exception_ptr std::current_exception() noexcept; | |
| friend void std::rethrow_exception(exception_ptr); | |
| template<typename _Ex> | |
| friend exception_ptr std::make_exception_ptr(_Ex) noexcept; | |
| public: | |
| exception_ptr() noexcept; | |
| exception_ptr(const exception_ptr&) noexcept; | |
| exception_ptr(nullptr_t) noexcept | |
| : _M_exception_object(0) | |
| { } | |
| exception_ptr(exception_ptr&& __o) noexcept | |
| : _M_exception_object(__o._M_exception_object) | |
| { __o._M_exception_object = 0; } | |
| # 117 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 3 | |
| exception_ptr& | |
| operator=(const exception_ptr&) noexcept; | |
| exception_ptr& | |
| operator=(exception_ptr&& __o) noexcept | |
| { | |
| exception_ptr(static_cast<exception_ptr&&>(__o)).swap(*this); | |
| return *this; | |
| } | |
| ~exception_ptr() noexcept; | |
| void | |
| swap(exception_ptr&) noexcept; | |
| # 144 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 3 | |
| explicit operator bool() const | |
| { return _M_exception_object; } | |
| friend bool | |
| operator==(const exception_ptr&, const exception_ptr&) | |
| noexcept __attribute__ ((__pure__)); | |
| const class std::type_info* | |
| __cxa_exception_type() const noexcept | |
| __attribute__ ((__pure__)); | |
| }; | |
| bool | |
| operator==(const exception_ptr&, const exception_ptr&) | |
| noexcept __attribute__ ((__pure__)); | |
| bool | |
| operator!=(const exception_ptr&, const exception_ptr&) | |
| noexcept __attribute__ ((__pure__)); | |
| inline void | |
| swap(exception_ptr& __lhs, exception_ptr& __rhs) | |
| { __lhs.swap(__rhs); } | |
| template<typename _Ex> | |
| inline void | |
| __dest_thunk(void* __x) | |
| { static_cast<_Ex*>(__x)->~_Ex(); } | |
| } | |
| template<typename _Ex> | |
| exception_ptr | |
| make_exception_ptr(_Ex __ex) noexcept | |
| { | |
| # 206 "/usr/sgug/include/c++/9/bits/exception_ptr.h" 3 | |
| return exception_ptr(); | |
| } | |
| } | |
| } | |
| #pragma GCC visibility pop | |
| # 144 "/usr/sgug/include/c++/9/exception" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/nested_exception.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/nested_exception.h" 3 | |
| #pragma GCC visibility push(default) | |
| # 42 "/usr/sgug/include/c++/9/bits/nested_exception.h" 3 | |
| extern "C++" { | |
| namespace std | |
| { | |
| class nested_exception | |
| { | |
| exception_ptr _M_ptr; | |
| public: | |
| nested_exception() noexcept : _M_ptr(current_exception()) { } | |
| nested_exception(const nested_exception&) noexcept = default; | |
| nested_exception& operator=(const nested_exception&) noexcept = default; | |
| virtual ~nested_exception() noexcept; | |
| [[noreturn]] | |
| void | |
| rethrow_nested() const | |
| { | |
| if (_M_ptr) | |
| rethrow_exception(_M_ptr); | |
| std::terminate(); | |
| } | |
| exception_ptr | |
| nested_ptr() const noexcept | |
| { return _M_ptr; } | |
| }; | |
| template<typename _Except> | |
| struct _Nested_exception : public _Except, public nested_exception | |
| { | |
| explicit _Nested_exception(const _Except& __ex) | |
| : _Except(__ex) | |
| { } | |
| explicit _Nested_exception(_Except&& __ex) | |
| : _Except(static_cast<_Except&&>(__ex)) | |
| { } | |
| }; | |
| template<typename _Tp> | |
| [[noreturn]] | |
| inline void | |
| __throw_with_nested_impl(_Tp&& __t, true_type) | |
| { | |
| using _Up = typename remove_reference<_Tp>::type; | |
| throw _Nested_exception<_Up>{std::forward<_Tp>(__t)}; | |
| } | |
| template<typename _Tp> | |
| [[noreturn]] | |
| inline void | |
| __throw_with_nested_impl(_Tp&& __t, false_type) | |
| { throw std::forward<_Tp>(__t); } | |
| template<typename _Tp> | |
| [[noreturn]] | |
| inline void | |
| throw_with_nested(_Tp&& __t) | |
| { | |
| using _Up = typename decay<_Tp>::type; | |
| using _CopyConstructible | |
| = __and_<is_copy_constructible<_Up>, is_move_constructible<_Up>>; | |
| static_assert(_CopyConstructible::value, | |
| "throw_with_nested argument must be CopyConstructible"); | |
| using __nest = __and_<is_class<_Up>, __bool_constant<!__is_final(_Up)>, | |
| __not_<is_base_of<nested_exception, _Up>>>; | |
| std::__throw_with_nested_impl(std::forward<_Tp>(__t), __nest{}); | |
| } | |
| template<typename _Tp> | |
| using __rethrow_if_nested_cond = typename enable_if< | |
| __and_<is_polymorphic<_Tp>, | |
| __or_<__not_<is_base_of<nested_exception, _Tp>>, | |
| is_convertible<_Tp*, nested_exception*>>>::value | |
| >::type; | |
| template<typename _Ex> | |
| inline __rethrow_if_nested_cond<_Ex> | |
| __rethrow_if_nested_impl(const _Ex* __ptr) | |
| { | |
| if (auto __ne_ptr = dynamic_cast<const nested_exception*>(__ptr)) | |
| __ne_ptr->rethrow_nested(); | |
| } | |
| inline void | |
| __rethrow_if_nested_impl(const void*) | |
| { } | |
| template<typename _Ex> | |
| inline void | |
| rethrow_if_nested(const _Ex& __ex) | |
| { std::__rethrow_if_nested_impl(std::__addressof(__ex)); } | |
| } | |
| } | |
| #pragma GCC visibility pop | |
| # 145 "/usr/sgug/include/c++/9/exception" 2 3 | |
| # 41 "/usr/sgug/include/c++/9/new" 2 3 | |
| #pragma GCC visibility push(default) | |
| extern "C++" { | |
| namespace std | |
| { | |
| class bad_alloc : public exception | |
| { | |
| public: | |
| bad_alloc() throw() { } | |
| bad_alloc(const bad_alloc&) = default; | |
| bad_alloc& operator=(const bad_alloc&) = default; | |
| virtual ~bad_alloc() throw(); | |
| virtual const char* what() const throw(); | |
| }; | |
| class bad_array_new_length : public bad_alloc | |
| { | |
| public: | |
| bad_array_new_length() throw() { } | |
| virtual ~bad_array_new_length() throw(); | |
| virtual const char* what() const throw(); | |
| }; | |
| struct nothrow_t | |
| { | |
| explicit nothrow_t() = default; | |
| }; | |
| extern const nothrow_t nothrow; | |
| typedef void (*new_handler)(); | |
| new_handler set_new_handler(new_handler) throw(); | |
| new_handler get_new_handler() noexcept; | |
| } | |
| # 125 "/usr/sgug/include/c++/9/new" 3 | |
| void* operator new(std::size_t) | |
| __attribute__((__externally_visible__)); | |
| void* operator new[](std::size_t) | |
| __attribute__((__externally_visible__)); | |
| void operator delete(void*) noexcept | |
| __attribute__((__externally_visible__)); | |
| void operator delete[](void*) noexcept | |
| __attribute__((__externally_visible__)); | |
| void operator delete(void*, std::size_t) noexcept | |
| __attribute__((__externally_visible__)); | |
| void operator delete[](void*, std::size_t) noexcept | |
| __attribute__((__externally_visible__)); | |
| void* operator new(std::size_t, const std::nothrow_t&) noexcept | |
| __attribute__((__externally_visible__, __malloc__)); | |
| void* operator new[](std::size_t, const std::nothrow_t&) noexcept | |
| __attribute__((__externally_visible__, __malloc__)); | |
| void operator delete(void*, const std::nothrow_t&) noexcept | |
| __attribute__((__externally_visible__)); | |
| void operator delete[](void*, const std::nothrow_t&) noexcept | |
| __attribute__((__externally_visible__)); | |
| # 173 "/usr/sgug/include/c++/9/new" 3 | |
| inline void* operator new(std::size_t, void* __p) noexcept | |
| { return __p; } | |
| inline void* operator new[](std::size_t, void* __p) noexcept | |
| { return __p; } | |
| inline void operator delete (void*, void*) noexcept { } | |
| inline void operator delete[](void*, void*) noexcept { } | |
| } | |
| # 226 "/usr/sgug/include/c++/9/new" 3 | |
| #pragma GCC visibility pop | |
| # 60 "/usr/sgug/include/c++/9/bits/stl_construct.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/ext/alloc_traits.h" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/ext/alloc_traits.h" 3 | |
| # 33 "/usr/sgug/include/c++/9/ext/alloc_traits.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 1 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/memoryfwd.h" 1 3 | |
| # 46 "/usr/sgug/include/c++/9/bits/memoryfwd.h" 3 | |
| # 47 "/usr/sgug/include/c++/9/bits/memoryfwd.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 63 "/usr/sgug/include/c++/9/bits/memoryfwd.h" 3 | |
| template<typename> | |
| class allocator; | |
| template<> | |
| class allocator<void>; | |
| template<typename, typename> | |
| struct uses_allocator; | |
| } | |
| # 36 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| struct __allocator_traits_base | |
| { | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __rebind : __replace_first_arg<_Tp, _Up> { }; | |
| template<typename _Tp, typename _Up> | |
| struct __rebind<_Tp, _Up, | |
| __void_t<typename _Tp::template rebind<_Up>::other>> | |
| { using type = typename _Tp::template rebind<_Up>::other; }; | |
| protected: | |
| template<typename _Tp> | |
| using __pointer = typename _Tp::pointer; | |
| template<typename _Tp> | |
| using __c_pointer = typename _Tp::const_pointer; | |
| template<typename _Tp> | |
| using __v_pointer = typename _Tp::void_pointer; | |
| template<typename _Tp> | |
| using __cv_pointer = typename _Tp::const_void_pointer; | |
| template<typename _Tp> | |
| using __pocca = typename _Tp::propagate_on_container_copy_assignment; | |
| template<typename _Tp> | |
| using __pocma = typename _Tp::propagate_on_container_move_assignment; | |
| template<typename _Tp> | |
| using __pocs = typename _Tp::propagate_on_container_swap; | |
| template<typename _Tp> | |
| using __equal = typename _Tp::is_always_equal; | |
| }; | |
| template<typename _Alloc, typename _Up> | |
| using __alloc_rebind | |
| = typename __allocator_traits_base::template __rebind<_Alloc, _Up>::type; | |
| template<typename _Alloc> | |
| struct allocator_traits : __allocator_traits_base | |
| { | |
| typedef _Alloc allocator_type; | |
| typedef typename _Alloc::value_type value_type; | |
| using pointer = __detected_or_t<value_type*, __pointer, _Alloc>; | |
| private: | |
| template<template<typename> class _Func, typename _Tp, typename = void> | |
| struct _Ptr | |
| { | |
| using type = typename pointer_traits<pointer>::template rebind<_Tp>; | |
| }; | |
| template<template<typename> class _Func, typename _Tp> | |
| struct _Ptr<_Func, _Tp, __void_t<_Func<_Alloc>>> | |
| { | |
| using type = _Func<_Alloc>; | |
| }; | |
| template<typename _A2, typename _PtrT, typename = void> | |
| struct _Diff | |
| { using type = typename pointer_traits<_PtrT>::difference_type; }; | |
| template<typename _A2, typename _PtrT> | |
| struct _Diff<_A2, _PtrT, __void_t<typename _A2::difference_type>> | |
| { using type = typename _A2::difference_type; }; | |
| template<typename _A2, typename _DiffT, typename = void> | |
| struct _Size : make_unsigned<_DiffT> { }; | |
| template<typename _A2, typename _DiffT> | |
| struct _Size<_A2, _DiffT, __void_t<typename _A2::size_type>> | |
| { using type = typename _A2::size_type; }; | |
| public: | |
| using const_pointer = typename _Ptr<__c_pointer, const value_type>::type; | |
| using void_pointer = typename _Ptr<__v_pointer, void>::type; | |
| using const_void_pointer = typename _Ptr<__cv_pointer, const void>::type; | |
| using difference_type = typename _Diff<_Alloc, pointer>::type; | |
| using size_type = typename _Size<_Alloc, difference_type>::type; | |
| using propagate_on_container_copy_assignment | |
| = __detected_or_t<false_type, __pocca, _Alloc>; | |
| using propagate_on_container_move_assignment | |
| = __detected_or_t<false_type, __pocma, _Alloc>; | |
| using propagate_on_container_swap | |
| = __detected_or_t<false_type, __pocs, _Alloc>; | |
| using is_always_equal | |
| = __detected_or_t<typename is_empty<_Alloc>::type, __equal, _Alloc>; | |
| template<typename _Tp> | |
| using rebind_alloc = __alloc_rebind<_Alloc, _Tp>; | |
| template<typename _Tp> | |
| using rebind_traits = allocator_traits<rebind_alloc<_Tp>>; | |
| private: | |
| template<typename _Alloc2> | |
| static auto | |
| _S_allocate(_Alloc2& __a, size_type __n, const_void_pointer __hint, int) | |
| -> decltype(__a.allocate(__n, __hint)) | |
| { return __a.allocate(__n, __hint); } | |
| template<typename _Alloc2> | |
| static pointer | |
| _S_allocate(_Alloc2& __a, size_type __n, const_void_pointer, ...) | |
| { return __a.allocate(__n); } | |
| template<typename _Tp, typename... _Args> | |
| struct __construct_helper | |
| { | |
| template<typename _Alloc2, | |
| typename = decltype(std::declval<_Alloc2*>()->construct( | |
| std::declval<_Tp*>(), std::declval<_Args>()...))> | |
| static true_type __test(int); | |
| template<typename> | |
| static false_type __test(...); | |
| using type = decltype(__test<_Alloc>(0)); | |
| }; | |
| template<typename _Tp, typename... _Args> | |
| using __has_construct | |
| = typename __construct_helper<_Tp, _Args...>::type; | |
| template<typename _Tp, typename... _Args> | |
| static _Require<__has_construct<_Tp, _Args...>> | |
| _S_construct(_Alloc& __a, _Tp* __p, _Args&&... __args) | |
| noexcept(noexcept(__a.construct(__p, std::forward<_Args>(__args)...))) | |
| { __a.construct(__p, std::forward<_Args>(__args)...); } | |
| template<typename _Tp, typename... _Args> | |
| static | |
| _Require<__and_<__not_<__has_construct<_Tp, _Args...>>, | |
| is_constructible<_Tp, _Args...>>> | |
| _S_construct(_Alloc&, _Tp* __p, _Args&&... __args) | |
| noexcept(noexcept(::new((void*)__p) | |
| _Tp(std::forward<_Args>(__args)...))) | |
| { ::new((void*)__p) _Tp(std::forward<_Args>(__args)...); } | |
| template<typename _Alloc2, typename _Tp> | |
| static auto | |
| _S_destroy(_Alloc2& __a, _Tp* __p, int) | |
| noexcept(noexcept(__a.destroy(__p))) | |
| -> decltype(__a.destroy(__p)) | |
| { __a.destroy(__p); } | |
| template<typename _Alloc2, typename _Tp> | |
| static void | |
| _S_destroy(_Alloc2&, _Tp* __p, ...) | |
| noexcept(noexcept(__p->~_Tp())) | |
| { __p->~_Tp(); } | |
| template<typename _Alloc2> | |
| static auto | |
| _S_max_size(_Alloc2& __a, int) | |
| -> decltype(__a.max_size()) | |
| { return __a.max_size(); } | |
| template<typename _Alloc2> | |
| static size_type | |
| _S_max_size(_Alloc2&, ...) | |
| { | |
| return __gnu_cxx::__numeric_traits<size_type>::__max | |
| / sizeof(value_type); | |
| } | |
| template<typename _Alloc2> | |
| static auto | |
| _S_select(_Alloc2& __a, int) | |
| -> decltype(__a.select_on_container_copy_construction()) | |
| { return __a.select_on_container_copy_construction(); } | |
| template<typename _Alloc2> | |
| static _Alloc2 | |
| _S_select(_Alloc2& __a, ...) | |
| { return __a; } | |
| public: | |
| # 304 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static pointer | |
| allocate(_Alloc& __a, size_type __n) | |
| { return __a.allocate(__n); } | |
| # 319 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static pointer | |
| allocate(_Alloc& __a, size_type __n, const_void_pointer __hint) | |
| { return _S_allocate(__a, __n, __hint, 0); } | |
| # 331 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static void | |
| deallocate(_Alloc& __a, pointer __p, size_type __n) | |
| { __a.deallocate(__p, __n); } | |
| # 346 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| template<typename _Tp, typename... _Args> | |
| static auto construct(_Alloc& __a, _Tp* __p, _Args&&... __args) | |
| noexcept(noexcept(_S_construct(__a, __p, | |
| std::forward<_Args>(__args)...))) | |
| -> decltype(_S_construct(__a, __p, std::forward<_Args>(__args)...)) | |
| { _S_construct(__a, __p, std::forward<_Args>(__args)...); } | |
| # 361 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| template<typename _Tp> | |
| static void destroy(_Alloc& __a, _Tp* __p) | |
| noexcept(noexcept(_S_destroy(__a, __p, 0))) | |
| { _S_destroy(__a, __p, 0); } | |
| # 374 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static size_type max_size(const _Alloc& __a) noexcept | |
| { return _S_max_size(__a, 0); } | |
| # 385 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static _Alloc | |
| select_on_container_copy_construction(const _Alloc& __rhs) | |
| { return _S_select(__rhs, 0); } | |
| }; | |
| template<typename _Tp> | |
| struct allocator_traits<allocator<_Tp>> | |
| { | |
| using allocator_type = allocator<_Tp>; | |
| using value_type = _Tp; | |
| using pointer = _Tp*; | |
| using const_pointer = const _Tp*; | |
| using void_pointer = void*; | |
| using const_void_pointer = const void*; | |
| using difference_type = std::ptrdiff_t; | |
| using size_type = std::size_t; | |
| using propagate_on_container_copy_assignment = false_type; | |
| using propagate_on_container_move_assignment = true_type; | |
| using propagate_on_container_swap = false_type; | |
| using is_always_equal = true_type; | |
| template<typename _Up> | |
| using rebind_alloc = allocator<_Up>; | |
| template<typename _Up> | |
| using rebind_traits = allocator_traits<allocator<_Up>>; | |
| # 442 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static pointer | |
| allocate(allocator_type& __a, size_type __n) | |
| { return __a.allocate(__n); } | |
| # 456 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static pointer | |
| allocate(allocator_type& __a, size_type __n, const_void_pointer __hint) | |
| { return __a.allocate(__n, __hint); } | |
| # 468 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| static void | |
| deallocate(allocator_type& __a, pointer __p, size_type __n) | |
| { __a.deallocate(__p, __n); } | |
| # 480 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| template<typename _Up, typename... _Args> | |
| static void | |
| construct(allocator_type& __a, _Up* __p, _Args&&... __args) | |
| noexcept(noexcept(__a.construct(__p, std::forward<_Args>(__args)...))) | |
| { __a.construct(__p, std::forward<_Args>(__args)...); } | |
| # 493 "/usr/sgug/include/c++/9/bits/alloc_traits.h" 3 | |
| template<typename _Up> | |
| static void | |
| destroy(allocator_type& __a, _Up* __p) | |
| noexcept(noexcept(__a.destroy(__p))) | |
| { __a.destroy(__p); } | |
| static size_type | |
| max_size(const allocator_type& __a) noexcept | |
| { return __a.max_size(); } | |
| static allocator_type | |
| select_on_container_copy_construction(const allocator_type& __rhs) | |
| { return __rhs; } | |
| }; | |
| template<typename _Alloc> | |
| inline void | |
| __do_alloc_on_copy(_Alloc& __one, const _Alloc& __two, true_type) | |
| { __one = __two; } | |
| template<typename _Alloc> | |
| inline void | |
| __do_alloc_on_copy(_Alloc&, const _Alloc&, false_type) | |
| { } | |
| template<typename _Alloc> | |
| inline void __alloc_on_copy(_Alloc& __one, const _Alloc& __two) | |
| { | |
| typedef allocator_traits<_Alloc> __traits; | |
| typedef typename __traits::propagate_on_container_copy_assignment __pocca; | |
| __do_alloc_on_copy(__one, __two, __pocca()); | |
| } | |
| template<typename _Alloc> | |
| inline _Alloc __alloc_on_copy(const _Alloc& __a) | |
| { | |
| typedef allocator_traits<_Alloc> __traits; | |
| return __traits::select_on_container_copy_construction(__a); | |
| } | |
| template<typename _Alloc> | |
| inline void __do_alloc_on_move(_Alloc& __one, _Alloc& __two, true_type) | |
| { __one = std::move(__two); } | |
| template<typename _Alloc> | |
| inline void __do_alloc_on_move(_Alloc&, _Alloc&, false_type) | |
| { } | |
| template<typename _Alloc> | |
| inline void __alloc_on_move(_Alloc& __one, _Alloc& __two) | |
| { | |
| typedef allocator_traits<_Alloc> __traits; | |
| typedef typename __traits::propagate_on_container_move_assignment __pocma; | |
| __do_alloc_on_move(__one, __two, __pocma()); | |
| } | |
| template<typename _Alloc> | |
| inline void __do_alloc_on_swap(_Alloc& __one, _Alloc& __two, true_type) | |
| { | |
| using std::swap; | |
| swap(__one, __two); | |
| } | |
| template<typename _Alloc> | |
| inline void __do_alloc_on_swap(_Alloc&, _Alloc&, false_type) | |
| { } | |
| template<typename _Alloc> | |
| inline void __alloc_on_swap(_Alloc& __one, _Alloc& __two) | |
| { | |
| typedef allocator_traits<_Alloc> __traits; | |
| typedef typename __traits::propagate_on_container_swap __pocs; | |
| __do_alloc_on_swap(__one, __two, __pocs()); | |
| } | |
| template<typename _Alloc, typename _Tp, | |
| typename _ValueT = __remove_cvref_t<typename _Alloc::value_type>, | |
| typename = void> | |
| struct __is_alloc_insertable_impl | |
| : false_type | |
| { }; | |
| template<typename _Alloc, typename _Tp, typename _ValueT> | |
| struct __is_alloc_insertable_impl<_Alloc, _Tp, _ValueT, | |
| __void_t<decltype(allocator_traits<_Alloc>::construct( | |
| std::declval<_Alloc&>(), std::declval<_ValueT*>(), | |
| std::declval<_Tp>()))>> | |
| : true_type | |
| { }; | |
| template<typename _Alloc> | |
| struct __is_copy_insertable | |
| : __is_alloc_insertable_impl<_Alloc, | |
| typename _Alloc::value_type const&>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_copy_insertable<allocator<_Tp>> | |
| : is_copy_constructible<_Tp> | |
| { }; | |
| template<typename _Alloc> | |
| struct __is_move_insertable | |
| : __is_alloc_insertable_impl<_Alloc, typename _Alloc::value_type>::type | |
| { }; | |
| template<typename _Tp> | |
| struct __is_move_insertable<allocator<_Tp>> | |
| : is_move_constructible<_Tp> | |
| { }; | |
| template<typename _Alloc, typename = void> | |
| struct __is_allocator : false_type { }; | |
| template<typename _Alloc> | |
| struct __is_allocator<_Alloc, | |
| __void_t<typename _Alloc::value_type, | |
| decltype(std::declval<_Alloc&>().allocate(size_t{}))>> | |
| : true_type { }; | |
| template<typename _Alloc> | |
| using _RequireAllocator | |
| = typename enable_if<__is_allocator<_Alloc>::value, _Alloc>::type; | |
| template<typename _Alloc> | |
| using _RequireNotAllocator | |
| = typename enable_if<!__is_allocator<_Alloc>::value, _Alloc>::type; | |
| } | |
| # 37 "/usr/sgug/include/c++/9/ext/alloc_traits.h" 2 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Alloc, typename = typename _Alloc::value_type> | |
| struct __alloc_traits | |
| : std::allocator_traits<_Alloc> | |
| { | |
| typedef _Alloc allocator_type; | |
| typedef std::allocator_traits<_Alloc> _Base_type; | |
| typedef typename _Base_type::value_type value_type; | |
| typedef typename _Base_type::pointer pointer; | |
| typedef typename _Base_type::const_pointer const_pointer; | |
| typedef typename _Base_type::size_type size_type; | |
| typedef typename _Base_type::difference_type difference_type; | |
| typedef value_type& reference; | |
| typedef const value_type& const_reference; | |
| using _Base_type::allocate; | |
| using _Base_type::deallocate; | |
| using _Base_type::construct; | |
| using _Base_type::destroy; | |
| using _Base_type::max_size; | |
| private: | |
| template<typename _Ptr> | |
| using __is_custom_pointer | |
| = std::__and_<std::is_same<pointer, _Ptr>, | |
| std::__not_<std::is_pointer<_Ptr>>>; | |
| public: | |
| template<typename _Ptr, typename... _Args> | |
| static typename std::enable_if<__is_custom_pointer<_Ptr>::value>::type | |
| construct(_Alloc& __a, _Ptr __p, _Args&&... __args) | |
| noexcept(noexcept(_Base_type::construct(__a, std::__to_address(__p), | |
| std::forward<_Args>(__args)...))) | |
| { | |
| _Base_type::construct(__a, std::__to_address(__p), | |
| std::forward<_Args>(__args)...); | |
| } | |
| template<typename _Ptr> | |
| static typename std::enable_if<__is_custom_pointer<_Ptr>::value>::type | |
| destroy(_Alloc& __a, _Ptr __p) | |
| noexcept(noexcept(_Base_type::destroy(__a, std::__to_address(__p)))) | |
| { _Base_type::destroy(__a, std::__to_address(__p)); } | |
| static _Alloc _S_select_on_copy(const _Alloc& __a) | |
| { return _Base_type::select_on_container_copy_construction(__a); } | |
| static void _S_on_swap(_Alloc& __a, _Alloc& __b) | |
| { std::__alloc_on_swap(__a, __b); } | |
| static constexpr bool _S_propagate_on_copy_assign() | |
| { return _Base_type::propagate_on_container_copy_assignment::value; } | |
| static constexpr bool _S_propagate_on_move_assign() | |
| { return _Base_type::propagate_on_container_move_assignment::value; } | |
| static constexpr bool _S_propagate_on_swap() | |
| { return _Base_type::propagate_on_container_swap::value; } | |
| static constexpr bool _S_always_equal() | |
| { return _Base_type::is_always_equal::value; } | |
| static constexpr bool _S_nothrow_move() | |
| { return _S_propagate_on_move_assign() || _S_always_equal(); } | |
| template<typename _Tp> | |
| struct rebind | |
| { typedef typename _Base_type::template rebind_alloc<_Tp> other; }; | |
| # 161 "/usr/sgug/include/c++/9/ext/alloc_traits.h" 3 | |
| }; | |
| } | |
| # 62 "/usr/sgug/include/c++/9/bits/stl_construct.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _T1, typename... _Args> | |
| inline void | |
| _Construct(_T1* __p, _Args&&... __args) | |
| { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); } | |
| # 87 "/usr/sgug/include/c++/9/bits/stl_construct.h" 3 | |
| template<typename _T1> | |
| inline void | |
| _Construct_novalue(_T1* __p) | |
| { ::new(static_cast<void*>(__p)) _T1; } | |
| template<typename _Tp> | |
| inline void | |
| _Destroy(_Tp* __pointer) | |
| { __pointer->~_Tp(); } | |
| template<bool> | |
| struct _Destroy_aux | |
| { | |
| template<typename _ForwardIterator> | |
| static void | |
| __destroy(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| for (; __first != __last; ++__first) | |
| std::_Destroy(std::__addressof(*__first)); | |
| } | |
| }; | |
| template<> | |
| struct _Destroy_aux<true> | |
| { | |
| template<typename _ForwardIterator> | |
| static void | |
| __destroy(_ForwardIterator, _ForwardIterator) { } | |
| }; | |
| template<typename _ForwardIterator> | |
| inline void | |
| _Destroy(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| typedef typename iterator_traits<_ForwardIterator>::value_type | |
| _Value_type; | |
| static_assert(is_destructible<_Value_type>::value, | |
| "value type is destructible"); | |
| std::_Destroy_aux<__has_trivial_destructor(_Value_type)>:: | |
| __destroy(__first, __last); | |
| } | |
| template<bool> | |
| struct _Destroy_n_aux | |
| { | |
| template<typename _ForwardIterator, typename _Size> | |
| static _ForwardIterator | |
| __destroy_n(_ForwardIterator __first, _Size __count) | |
| { | |
| for (; __count > 0; (void)++__first, --__count) | |
| std::_Destroy(std::__addressof(*__first)); | |
| return __first; | |
| } | |
| }; | |
| template<> | |
| struct _Destroy_n_aux<true> | |
| { | |
| template<typename _ForwardIterator, typename _Size> | |
| static _ForwardIterator | |
| __destroy_n(_ForwardIterator __first, _Size __count) | |
| { | |
| std::advance(__first, __count); | |
| return __first; | |
| } | |
| }; | |
| template<typename _ForwardIterator, typename _Size> | |
| inline _ForwardIterator | |
| _Destroy_n(_ForwardIterator __first, _Size __count) | |
| { | |
| typedef typename iterator_traits<_ForwardIterator>::value_type | |
| _Value_type; | |
| static_assert(is_destructible<_Value_type>::value, | |
| "value type is destructible"); | |
| return std::_Destroy_n_aux<__has_trivial_destructor(_Value_type)>:: | |
| __destroy_n(__first, __count); | |
| } | |
| template<typename _ForwardIterator, typename _Allocator> | |
| void | |
| _Destroy(_ForwardIterator __first, _ForwardIterator __last, | |
| _Allocator& __alloc) | |
| { | |
| typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; | |
| for (; __first != __last; ++__first) | |
| __traits::destroy(__alloc, std::__addressof(*__first)); | |
| } | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline void | |
| _Destroy(_ForwardIterator __first, _ForwardIterator __last, | |
| allocator<_Tp>&) | |
| { | |
| _Destroy(__first, __last); | |
| } | |
| # 232 "/usr/sgug/include/c++/9/bits/stl_construct.h" 3 | |
| } | |
| # 61 "/usr/sgug/include/c++/9/bits/stl_tempbuf.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 83 "/usr/sgug/include/c++/9/bits/stl_tempbuf.h" 3 | |
| template<typename _Tp> | |
| pair<_Tp*, ptrdiff_t> | |
| get_temporary_buffer(ptrdiff_t __len) noexcept | |
| { | |
| const ptrdiff_t __max = | |
| __gnu_cxx::__numeric_traits<ptrdiff_t>::__max / sizeof(_Tp); | |
| if (__len > __max) | |
| __len = __max; | |
| while (__len > 0) | |
| { | |
| _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp), | |
| std::nothrow)); | |
| if (__tmp != 0) | |
| return std::pair<_Tp*, ptrdiff_t>(__tmp, __len); | |
| __len /= 2; | |
| } | |
| return std::pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0); | |
| } | |
| # 110 "/usr/sgug/include/c++/9/bits/stl_tempbuf.h" 3 | |
| template<typename _Tp> | |
| inline void | |
| return_temporary_buffer(_Tp* __p) | |
| { ::operator delete(__p); } | |
| template<typename _ForwardIterator, typename _Tp> | |
| class _Temporary_buffer | |
| { | |
| public: | |
| typedef _Tp value_type; | |
| typedef value_type* pointer; | |
| typedef pointer iterator; | |
| typedef ptrdiff_t size_type; | |
| protected: | |
| size_type _M_original_len; | |
| size_type _M_len; | |
| pointer _M_buffer; | |
| public: | |
| size_type | |
| size() const | |
| { return _M_len; } | |
| size_type | |
| requested_size() const | |
| { return _M_original_len; } | |
| iterator | |
| begin() | |
| { return _M_buffer; } | |
| iterator | |
| end() | |
| { return _M_buffer + _M_len; } | |
| _Temporary_buffer(_ForwardIterator __seed, size_type __original_len); | |
| ~_Temporary_buffer() | |
| { | |
| std::_Destroy(_M_buffer, _M_buffer + _M_len); | |
| std::return_temporary_buffer(_M_buffer); | |
| } | |
| private: | |
| _Temporary_buffer(const _Temporary_buffer&); | |
| void | |
| operator=(const _Temporary_buffer&); | |
| }; | |
| template<bool> | |
| struct __uninitialized_construct_buf_dispatch | |
| { | |
| template<typename _Pointer, typename _ForwardIterator> | |
| static void | |
| __ucr(_Pointer __first, _Pointer __last, | |
| _ForwardIterator __seed) | |
| { | |
| if(__first == __last) | |
| return; | |
| _Pointer __cur = __first; | |
| if (true) | |
| { | |
| std::_Construct(std::__addressof(*__first), | |
| std::move(*__seed)); | |
| _Pointer __prev = __cur; | |
| ++__cur; | |
| for(; __cur != __last; ++__cur, ++__prev) | |
| std::_Construct(std::__addressof(*__cur), | |
| std::move(*__prev)); | |
| *__seed = std::move(*__prev); | |
| } | |
| if (false) | |
| { | |
| std::_Destroy(__first, __cur); | |
| ; | |
| } | |
| } | |
| }; | |
| template<> | |
| struct __uninitialized_construct_buf_dispatch<true> | |
| { | |
| template<typename _Pointer, typename _ForwardIterator> | |
| static void | |
| __ucr(_Pointer, _Pointer, _ForwardIterator) { } | |
| }; | |
| # 229 "/usr/sgug/include/c++/9/bits/stl_tempbuf.h" 3 | |
| template<typename _Pointer, typename _ForwardIterator> | |
| inline void | |
| __uninitialized_construct_buf(_Pointer __first, _Pointer __last, | |
| _ForwardIterator __seed) | |
| { | |
| typedef typename std::iterator_traits<_Pointer>::value_type | |
| _ValueType; | |
| std::__uninitialized_construct_buf_dispatch< | |
| __has_trivial_constructor(_ValueType)>:: | |
| __ucr(__first, __last, __seed); | |
| } | |
| template<typename _ForwardIterator, typename _Tp> | |
| _Temporary_buffer<_ForwardIterator, _Tp>:: | |
| _Temporary_buffer(_ForwardIterator __seed, size_type __original_len) | |
| : _M_original_len(__original_len), _M_len(0), _M_buffer(0) | |
| { | |
| if (true) | |
| { | |
| std::pair<pointer, size_type> __p(std::get_temporary_buffer< | |
| value_type>(_M_original_len)); | |
| _M_buffer = __p.first; | |
| _M_len = __p.second; | |
| if (_M_buffer) | |
| std::__uninitialized_construct_buf(_M_buffer, _M_buffer + _M_len, | |
| __seed); | |
| } | |
| if (false) | |
| { | |
| std::return_temporary_buffer(_M_buffer); | |
| _M_buffer = 0; | |
| _M_len = 0; | |
| ; | |
| } | |
| } | |
| } | |
| # 63 "/usr/sgug/include/c++/9/bits/stl_algo.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/uniform_int_dist.h" 1 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/uniform_int_dist.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/limits" 1 3 | |
| # 40 "/usr/sgug/include/c++/9/limits" 3 | |
| # 41 "/usr/sgug/include/c++/9/limits" 3 | |
| # 158 "/usr/sgug/include/c++/9/limits" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| 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 | |
| }; | |
| # 202 "/usr/sgug/include/c++/9/limits" 3 | |
| struct __numeric_limits_base | |
| { | |
| static constexpr bool is_specialized = false; | |
| static constexpr int digits = 0; | |
| static constexpr int digits10 = 0; | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = false; | |
| static constexpr bool is_exact = false; | |
| static constexpr int radix = 0; | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = false; | |
| # 288 "/usr/sgug/include/c++/9/limits" 3 | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = false; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style = | |
| round_toward_zero; | |
| }; | |
| # 311 "/usr/sgug/include/c++/9/limits" 3 | |
| template<typename _Tp> | |
| struct numeric_limits : public __numeric_limits_base | |
| { | |
| static constexpr _Tp | |
| min() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| max() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| lowest() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| epsilon() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| round_error() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| infinity() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| quiet_NaN() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| signaling_NaN() noexcept { return _Tp(); } | |
| static constexpr _Tp | |
| denorm_min() noexcept { return _Tp(); } | |
| }; | |
| template<typename _Tp> | |
| struct numeric_limits<const _Tp> | |
| : public numeric_limits<_Tp> { }; | |
| template<typename _Tp> | |
| struct numeric_limits<volatile _Tp> | |
| : public numeric_limits<_Tp> { }; | |
| template<typename _Tp> | |
| struct numeric_limits<const volatile _Tp> | |
| : public numeric_limits<_Tp> { }; | |
| # 383 "/usr/sgug/include/c++/9/limits" 3 | |
| template<> | |
| struct numeric_limits<bool> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr bool | |
| min() noexcept { return false; } | |
| static constexpr bool | |
| max() noexcept { return true; } | |
| static constexpr bool | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = 1; | |
| static constexpr int digits10 = 0; | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr bool | |
| epsilon() noexcept { return false; } | |
| static constexpr bool | |
| round_error() noexcept { return false; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr bool | |
| infinity() noexcept { return false; } | |
| static constexpr bool | |
| quiet_NaN() noexcept { return false; } | |
| static constexpr bool | |
| signaling_NaN() noexcept { return false; } | |
| static constexpr bool | |
| denorm_min() noexcept { return false; } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<char> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr char | |
| min() noexcept { return (((char)(-1) < 0) ? -(((char)(-1) < 0) ? (((((char)1 << ((sizeof(char) * 8 - ((char)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char)0) - 1 : (char)0); } | |
| static constexpr char | |
| max() noexcept { return (((char)(-1) < 0) ? (((((char)1 << ((sizeof(char) * 8 - ((char)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char)0); } | |
| static constexpr char | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(char) * 8 - ((char)(-1) < 0)); | |
| static constexpr int digits10 = ((sizeof(char) * 8 - ((char)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = ((char)(-1) < 0); | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr char | |
| epsilon() noexcept { return 0; } | |
| static constexpr char | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr | |
| char infinity() noexcept { return char(); } | |
| static constexpr char | |
| quiet_NaN() noexcept { return char(); } | |
| static constexpr char | |
| signaling_NaN() noexcept { return char(); } | |
| static constexpr char | |
| denorm_min() noexcept { return static_cast<char>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = !is_signed; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<signed char> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr signed char | |
| min() noexcept { return -0x7f - 1; } | |
| static constexpr signed char | |
| max() noexcept { return 0x7f; } | |
| static constexpr signed char | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(signed char) * 8 - ((signed char)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(signed char) * 8 - ((signed char)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr signed char | |
| epsilon() noexcept { return 0; } | |
| static constexpr signed char | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr signed char | |
| infinity() noexcept { return static_cast<signed char>(0); } | |
| static constexpr signed char | |
| quiet_NaN() noexcept { return static_cast<signed char>(0); } | |
| static constexpr signed char | |
| signaling_NaN() noexcept | |
| { return static_cast<signed char>(0); } | |
| static constexpr signed char | |
| denorm_min() noexcept | |
| { return static_cast<signed char>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<unsigned char> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr unsigned char | |
| min() noexcept { return 0; } | |
| static constexpr unsigned char | |
| max() noexcept { return 0x7f * 2U + 1; } | |
| static constexpr unsigned char | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits | |
| = (sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr unsigned char | |
| epsilon() noexcept { return 0; } | |
| static constexpr unsigned char | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr unsigned char | |
| infinity() noexcept | |
| { return static_cast<unsigned char>(0); } | |
| static constexpr unsigned char | |
| quiet_NaN() noexcept | |
| { return static_cast<unsigned char>(0); } | |
| static constexpr unsigned char | |
| signaling_NaN() noexcept | |
| { return static_cast<unsigned char>(0); } | |
| static constexpr unsigned char | |
| denorm_min() noexcept | |
| { return static_cast<unsigned char>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = true; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<wchar_t> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr wchar_t | |
| min() noexcept { return (((wchar_t)(-1) < 0) ? -(((wchar_t)(-1) < 0) ? (((((wchar_t)1 << ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(wchar_t)0) - 1 : (wchar_t)0); } | |
| static constexpr wchar_t | |
| max() noexcept { return (((wchar_t)(-1) < 0) ? (((((wchar_t)1 << ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(wchar_t)0); } | |
| static constexpr wchar_t | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = ((wchar_t)(-1) < 0); | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr wchar_t | |
| epsilon() noexcept { return 0; } | |
| static constexpr wchar_t | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr wchar_t | |
| infinity() noexcept { return wchar_t(); } | |
| static constexpr wchar_t | |
| quiet_NaN() noexcept { return wchar_t(); } | |
| static constexpr wchar_t | |
| signaling_NaN() noexcept { return wchar_t(); } | |
| static constexpr wchar_t | |
| denorm_min() noexcept { return wchar_t(); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = !is_signed; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| # 796 "/usr/sgug/include/c++/9/limits" 3 | |
| template<> | |
| struct numeric_limits<char16_t> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr char16_t | |
| min() noexcept { return (((char16_t)(-1) < 0) ? -(((char16_t)(-1) < 0) ? (((((char16_t)1 << ((sizeof(char16_t) * 8 - ((char16_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char16_t)0) - 1 : (char16_t)0); } | |
| static constexpr char16_t | |
| max() noexcept { return (((char16_t)(-1) < 0) ? (((((char16_t)1 << ((sizeof(char16_t) * 8 - ((char16_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char16_t)0); } | |
| static constexpr char16_t | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(char16_t) * 8 - ((char16_t)(-1) < 0)); | |
| static constexpr int digits10 = ((sizeof(char16_t) * 8 - ((char16_t)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = ((char16_t)(-1) < 0); | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr char16_t | |
| epsilon() noexcept { return 0; } | |
| static constexpr char16_t | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr char16_t | |
| infinity() noexcept { return char16_t(); } | |
| static constexpr char16_t | |
| quiet_NaN() noexcept { return char16_t(); } | |
| static constexpr char16_t | |
| signaling_NaN() noexcept { return char16_t(); } | |
| static constexpr char16_t | |
| denorm_min() noexcept { return char16_t(); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = !is_signed; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<char32_t> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr char32_t | |
| min() noexcept { return (((char32_t)(-1) < 0) ? -(((char32_t)(-1) < 0) ? (((((char32_t)1 << ((sizeof(char32_t) * 8 - ((char32_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char32_t)0) - 1 : (char32_t)0); } | |
| static constexpr char32_t | |
| max() noexcept { return (((char32_t)(-1) < 0) ? (((((char32_t)1 << ((sizeof(char32_t) * 8 - ((char32_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char32_t)0); } | |
| static constexpr char32_t | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(char32_t) * 8 - ((char32_t)(-1) < 0)); | |
| static constexpr int digits10 = ((sizeof(char32_t) * 8 - ((char32_t)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = ((char32_t)(-1) < 0); | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr char32_t | |
| epsilon() noexcept { return 0; } | |
| static constexpr char32_t | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr char32_t | |
| infinity() noexcept { return char32_t(); } | |
| static constexpr char32_t | |
| quiet_NaN() noexcept { return char32_t(); } | |
| static constexpr char32_t | |
| signaling_NaN() noexcept { return char32_t(); } | |
| static constexpr char32_t | |
| denorm_min() noexcept { return char32_t(); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = !is_signed; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<short> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr short | |
| min() noexcept { return -0x7fff - 1; } | |
| static constexpr short | |
| max() noexcept { return 0x7fff; } | |
| static constexpr short | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(short) * 8 - ((short)(-1) < 0)); | |
| static constexpr int digits10 = ((sizeof(short) * 8 - ((short)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr short | |
| epsilon() noexcept { return 0; } | |
| static constexpr short | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr short | |
| infinity() noexcept { return short(); } | |
| static constexpr short | |
| quiet_NaN() noexcept { return short(); } | |
| static constexpr short | |
| signaling_NaN() noexcept { return short(); } | |
| static constexpr short | |
| denorm_min() noexcept { return short(); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<unsigned short> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr unsigned short | |
| min() noexcept { return 0; } | |
| static constexpr unsigned short | |
| max() noexcept { return 0x7fff * 2U + 1; } | |
| static constexpr unsigned short | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits | |
| = (sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr unsigned short | |
| epsilon() noexcept { return 0; } | |
| static constexpr unsigned short | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr unsigned short | |
| infinity() noexcept | |
| { return static_cast<unsigned short>(0); } | |
| static constexpr unsigned short | |
| quiet_NaN() noexcept | |
| { return static_cast<unsigned short>(0); } | |
| static constexpr unsigned short | |
| signaling_NaN() noexcept | |
| { return static_cast<unsigned short>(0); } | |
| static constexpr unsigned short | |
| denorm_min() noexcept | |
| { return static_cast<unsigned short>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = true; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<int> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr int | |
| min() noexcept { return -0x7fffffff - 1; } | |
| static constexpr int | |
| max() noexcept { return 0x7fffffff; } | |
| static constexpr int | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(int) * 8 - ((int)(-1) < 0)); | |
| static constexpr int digits10 = ((sizeof(int) * 8 - ((int)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr int | |
| epsilon() noexcept { return 0; } | |
| static constexpr int | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr int | |
| infinity() noexcept { return static_cast<int>(0); } | |
| static constexpr int | |
| quiet_NaN() noexcept { return static_cast<int>(0); } | |
| static constexpr int | |
| signaling_NaN() noexcept { return static_cast<int>(0); } | |
| static constexpr int | |
| denorm_min() noexcept { return static_cast<int>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<unsigned int> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr unsigned int | |
| min() noexcept { return 0; } | |
| static constexpr unsigned int | |
| max() noexcept { return 0x7fffffff * 2U + 1; } | |
| static constexpr unsigned int | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits | |
| = (sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr unsigned int | |
| epsilon() noexcept { return 0; } | |
| static constexpr unsigned int | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr unsigned int | |
| infinity() noexcept { return static_cast<unsigned int>(0); } | |
| static constexpr unsigned int | |
| quiet_NaN() noexcept | |
| { return static_cast<unsigned int>(0); } | |
| static constexpr unsigned int | |
| signaling_NaN() noexcept | |
| { return static_cast<unsigned int>(0); } | |
| static constexpr unsigned int | |
| denorm_min() noexcept | |
| { return static_cast<unsigned int>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = true; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<long> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr long | |
| min() noexcept { return -0x7fffffffL - 1; } | |
| static constexpr long | |
| max() noexcept { return 0x7fffffffL; } | |
| static constexpr long | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits = (sizeof(long) * 8 - ((long)(-1) < 0)); | |
| static constexpr int digits10 = ((sizeof(long) * 8 - ((long)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr long | |
| epsilon() noexcept { return 0; } | |
| static constexpr long | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr long | |
| infinity() noexcept { return static_cast<long>(0); } | |
| static constexpr long | |
| quiet_NaN() noexcept { return static_cast<long>(0); } | |
| static constexpr long | |
| signaling_NaN() noexcept { return static_cast<long>(0); } | |
| static constexpr long | |
| denorm_min() noexcept { return static_cast<long>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<unsigned long> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr unsigned long | |
| min() noexcept { return 0; } | |
| static constexpr unsigned long | |
| max() noexcept { return 0x7fffffffL * 2UL + 1; } | |
| static constexpr unsigned long | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits | |
| = (sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr unsigned long | |
| epsilon() noexcept { return 0; } | |
| static constexpr unsigned long | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr unsigned long | |
| infinity() noexcept | |
| { return static_cast<unsigned long>(0); } | |
| static constexpr unsigned long | |
| quiet_NaN() noexcept | |
| { return static_cast<unsigned long>(0); } | |
| static constexpr unsigned long | |
| signaling_NaN() noexcept | |
| { return static_cast<unsigned long>(0); } | |
| static constexpr unsigned long | |
| denorm_min() noexcept | |
| { return static_cast<unsigned long>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = true; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<long long> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr long long | |
| min() noexcept { return -0x7fffffffffffffffLL - 1; } | |
| static constexpr long long | |
| max() noexcept { return 0x7fffffffffffffffLL; } | |
| static constexpr long long | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits | |
| = (sizeof(long long) * 8 - ((long long)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(long long) * 8 - ((long long)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr long long | |
| epsilon() noexcept { return 0; } | |
| static constexpr long long | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr long long | |
| infinity() noexcept { return static_cast<long long>(0); } | |
| static constexpr long long | |
| quiet_NaN() noexcept { return static_cast<long long>(0); } | |
| static constexpr long long | |
| signaling_NaN() noexcept | |
| { return static_cast<long long>(0); } | |
| static constexpr long long | |
| denorm_min() noexcept { return static_cast<long long>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| template<> | |
| struct numeric_limits<unsigned long long> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr unsigned long long | |
| min() noexcept { return 0; } | |
| static constexpr unsigned long long | |
| max() noexcept { return 0x7fffffffffffffffLL * 2ULL + 1; } | |
| static constexpr unsigned long long | |
| lowest() noexcept { return min(); } | |
| static constexpr int digits | |
| = (sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)); | |
| static constexpr int digits10 | |
| = ((sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)) * 643L / 2136); | |
| static constexpr int max_digits10 = 0; | |
| static constexpr bool is_signed = false; | |
| static constexpr bool is_integer = true; | |
| static constexpr bool is_exact = true; | |
| static constexpr int radix = 2; | |
| static constexpr unsigned long long | |
| epsilon() noexcept { return 0; } | |
| static constexpr unsigned long long | |
| round_error() noexcept { return 0; } | |
| static constexpr int min_exponent = 0; | |
| static constexpr int min_exponent10 = 0; | |
| static constexpr int max_exponent = 0; | |
| static constexpr int max_exponent10 = 0; | |
| static constexpr bool has_infinity = false; | |
| static constexpr bool has_quiet_NaN = false; | |
| static constexpr bool has_signaling_NaN = false; | |
| static constexpr float_denorm_style has_denorm | |
| = denorm_absent; | |
| static constexpr bool has_denorm_loss = false; | |
| static constexpr unsigned long long | |
| infinity() noexcept | |
| { return static_cast<unsigned long long>(0); } | |
| static constexpr unsigned long long | |
| quiet_NaN() noexcept | |
| { return static_cast<unsigned long long>(0); } | |
| static constexpr unsigned long long | |
| signaling_NaN() noexcept | |
| { return static_cast<unsigned long long>(0); } | |
| static constexpr unsigned long long | |
| denorm_min() noexcept | |
| { return static_cast<unsigned long long>(0); } | |
| static constexpr bool is_iec559 = false; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = true; | |
| static constexpr bool traps = true; | |
| static constexpr bool tinyness_before = false; | |
| static constexpr float_round_style round_style | |
| = round_toward_zero; | |
| }; | |
| # 1659 "/usr/sgug/include/c++/9/limits" 3 | |
| template<> | |
| struct numeric_limits<float> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr float | |
| min() noexcept { return 1.17549435082228750796873653722225e-38F; } | |
| static constexpr float | |
| max() noexcept { return 3.40282346638528859811704183484517e+38F; } | |
| static constexpr float | |
| lowest() noexcept { return -3.40282346638528859811704183484517e+38F; } | |
| static constexpr int digits = 24; | |
| static constexpr int digits10 = 6; | |
| static constexpr int max_digits10 | |
| = (2 + (24) * 643L / 2136); | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = false; | |
| static constexpr bool is_exact = false; | |
| static constexpr int radix = 2; | |
| static constexpr float | |
| epsilon() noexcept { return 1.19209289550781250000000000000000e-7F; } | |
| static constexpr float | |
| round_error() noexcept { return 0.5F; } | |
| static constexpr int min_exponent = (-125); | |
| static constexpr int min_exponent10 = (-37); | |
| static constexpr int max_exponent = 128; | |
| static constexpr int max_exponent10 = 38; | |
| static constexpr bool has_infinity = 1; | |
| static constexpr bool has_quiet_NaN = 1; | |
| static constexpr bool has_signaling_NaN = has_quiet_NaN; | |
| static constexpr float_denorm_style has_denorm | |
| = bool(1) ? denorm_present : denorm_absent; | |
| static constexpr bool has_denorm_loss | |
| = false; | |
| static constexpr float | |
| infinity() noexcept { return __builtin_huge_valf(); } | |
| static constexpr float | |
| quiet_NaN() noexcept { return __builtin_nanf(""); } | |
| static constexpr float | |
| signaling_NaN() noexcept { return __builtin_nansf(""); } | |
| static constexpr float | |
| denorm_min() noexcept { return 1.40129846432481707092372958328992e-45F; } | |
| static constexpr bool is_iec559 | |
| = has_infinity && has_quiet_NaN && has_denorm == denorm_present; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = false; | |
| static constexpr bool tinyness_before | |
| = false; | |
| static constexpr float_round_style round_style | |
| = round_to_nearest; | |
| }; | |
| template<> | |
| struct numeric_limits<double> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr double | |
| min() noexcept { return double(2.22507385850720138309023271733240e-308L); } | |
| static constexpr double | |
| max() noexcept { return double(1.79769313486231570814527423731704e+308L); } | |
| static constexpr double | |
| lowest() noexcept { return -double(1.79769313486231570814527423731704e+308L); } | |
| static constexpr int digits = 53; | |
| static constexpr int digits10 = 15; | |
| static constexpr int max_digits10 | |
| = (2 + (53) * 643L / 2136); | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = false; | |
| static constexpr bool is_exact = false; | |
| static constexpr int radix = 2; | |
| static constexpr double | |
| epsilon() noexcept { return double(2.22044604925031308084726333618164e-16L); } | |
| static constexpr double | |
| round_error() noexcept { return 0.5; } | |
| static constexpr int min_exponent = (-1021); | |
| static constexpr int min_exponent10 = (-307); | |
| static constexpr int max_exponent = 1024; | |
| static constexpr int max_exponent10 = 308; | |
| static constexpr bool has_infinity = 1; | |
| static constexpr bool has_quiet_NaN = 1; | |
| static constexpr bool has_signaling_NaN = has_quiet_NaN; | |
| static constexpr float_denorm_style has_denorm | |
| = bool(1) ? denorm_present : denorm_absent; | |
| static constexpr bool has_denorm_loss | |
| = false; | |
| static constexpr double | |
| infinity() noexcept { return __builtin_huge_val(); } | |
| static constexpr double | |
| quiet_NaN() noexcept { return __builtin_nan(""); } | |
| static constexpr double | |
| signaling_NaN() noexcept { return __builtin_nans(""); } | |
| static constexpr double | |
| denorm_min() noexcept { return double(4.94065645841246544176568792868221e-324L); } | |
| static constexpr bool is_iec559 | |
| = has_infinity && has_quiet_NaN && has_denorm == denorm_present; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = false; | |
| static constexpr bool tinyness_before | |
| = false; | |
| static constexpr float_round_style round_style | |
| = round_to_nearest; | |
| }; | |
| template<> | |
| struct numeric_limits<long double> | |
| { | |
| static constexpr bool is_specialized = true; | |
| static constexpr long double | |
| min() noexcept { return 2.00416836000897277799610805135016e-292L; } | |
| static constexpr long double | |
| max() noexcept { return 1.79769313486231580793728971405301e+308L; } | |
| static constexpr long double | |
| lowest() noexcept { return -1.79769313486231580793728971405301e+308L; } | |
| static constexpr int digits = 106; | |
| static constexpr int digits10 = 31; | |
| static constexpr int max_digits10 | |
| = (2 + (106) * 643L / 2136); | |
| static constexpr bool is_signed = true; | |
| static constexpr bool is_integer = false; | |
| static constexpr bool is_exact = false; | |
| static constexpr int radix = 2; | |
| static constexpr long double | |
| epsilon() noexcept { return 4.94065645841246544176568792868221e-324L; } | |
| static constexpr long double | |
| round_error() noexcept { return 0.5L; } | |
| static constexpr int min_exponent = (-968); | |
| static constexpr int min_exponent10 = (-291); | |
| static constexpr int max_exponent = 1024; | |
| static constexpr int max_exponent10 = 308; | |
| static constexpr bool has_infinity = 1; | |
| static constexpr bool has_quiet_NaN = 1; | |
| static constexpr bool has_signaling_NaN = has_quiet_NaN; | |
| static constexpr float_denorm_style has_denorm | |
| = bool(1) ? denorm_present : denorm_absent; | |
| static constexpr bool has_denorm_loss | |
| = false; | |
| static constexpr long double | |
| infinity() noexcept { return __builtin_huge_vall(); } | |
| static constexpr long double | |
| quiet_NaN() noexcept { return __builtin_nanl(""); } | |
| static constexpr long double | |
| signaling_NaN() noexcept { return __builtin_nansl(""); } | |
| static constexpr long double | |
| denorm_min() noexcept { return 4.94065645841246544176568792868221e-324L; } | |
| static constexpr bool is_iec559 | |
| = has_infinity && has_quiet_NaN && has_denorm == denorm_present; | |
| static constexpr bool is_bounded = true; | |
| static constexpr bool is_modulo = false; | |
| static constexpr bool traps = false; | |
| static constexpr bool tinyness_before = | |
| false; | |
| static constexpr float_round_style round_style = | |
| round_to_nearest; | |
| }; | |
| } | |
| # 36 "/usr/sgug/include/c++/9/bits/uniform_int_dist.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| namespace __detail | |
| { | |
| template<typename _Tp> | |
| inline bool | |
| _Power_of_2(_Tp __x) | |
| { | |
| return ((__x - 1) & __x) == 0; | |
| } | |
| } | |
| template<typename _IntType = int> | |
| class uniform_int_distribution | |
| { | |
| static_assert(std::is_integral<_IntType>::value, | |
| "template argument must be an integral type"); | |
| public: | |
| typedef _IntType result_type; | |
| struct param_type | |
| { | |
| typedef uniform_int_distribution<_IntType> distribution_type; | |
| param_type() : param_type(0) { } | |
| explicit | |
| param_type(_IntType __a, | |
| _IntType __b = numeric_limits<_IntType>::max()) | |
| : _M_a(__a), _M_b(__b) | |
| { | |
| ; | |
| } | |
| result_type | |
| a() const | |
| { return _M_a; } | |
| result_type | |
| b() const | |
| { return _M_b; } | |
| friend bool | |
| operator==(const param_type& __p1, const param_type& __p2) | |
| { return __p1._M_a == __p2._M_a && __p1._M_b == __p2._M_b; } | |
| friend bool | |
| operator!=(const param_type& __p1, const param_type& __p2) | |
| { return !(__p1 == __p2); } | |
| private: | |
| _IntType _M_a; | |
| _IntType _M_b; | |
| }; | |
| public: | |
| uniform_int_distribution() : uniform_int_distribution(0) { } | |
| explicit | |
| uniform_int_distribution(_IntType __a, | |
| _IntType __b = numeric_limits<_IntType>::max()) | |
| : _M_param(__a, __b) | |
| { } | |
| explicit | |
| uniform_int_distribution(const param_type& __p) | |
| : _M_param(__p) | |
| { } | |
| void | |
| reset() { } | |
| result_type | |
| a() const | |
| { return _M_param.a(); } | |
| result_type | |
| b() const | |
| { return _M_param.b(); } | |
| param_type | |
| param() const | |
| { return _M_param; } | |
| void | |
| param(const param_type& __param) | |
| { _M_param = __param; } | |
| result_type | |
| min() const | |
| { return this->a(); } | |
| result_type | |
| max() const | |
| { return this->b(); } | |
| template<typename _UniformRandomNumberGenerator> | |
| result_type | |
| operator()(_UniformRandomNumberGenerator& __urng) | |
| { return this->operator()(__urng, _M_param); } | |
| template<typename _UniformRandomNumberGenerator> | |
| result_type | |
| operator()(_UniformRandomNumberGenerator& __urng, | |
| const param_type& __p); | |
| template<typename _ForwardIterator, | |
| typename _UniformRandomNumberGenerator> | |
| void | |
| __generate(_ForwardIterator __f, _ForwardIterator __t, | |
| _UniformRandomNumberGenerator& __urng) | |
| { this->__generate(__f, __t, __urng, _M_param); } | |
| template<typename _ForwardIterator, | |
| typename _UniformRandomNumberGenerator> | |
| void | |
| __generate(_ForwardIterator __f, _ForwardIterator __t, | |
| _UniformRandomNumberGenerator& __urng, | |
| const param_type& __p) | |
| { this->__generate_impl(__f, __t, __urng, __p); } | |
| template<typename _UniformRandomNumberGenerator> | |
| void | |
| __generate(result_type* __f, result_type* __t, | |
| _UniformRandomNumberGenerator& __urng, | |
| const param_type& __p) | |
| { this->__generate_impl(__f, __t, __urng, __p); } | |
| friend bool | |
| operator==(const uniform_int_distribution& __d1, | |
| const uniform_int_distribution& __d2) | |
| { return __d1._M_param == __d2._M_param; } | |
| private: | |
| template<typename _ForwardIterator, | |
| typename _UniformRandomNumberGenerator> | |
| void | |
| __generate_impl(_ForwardIterator __f, _ForwardIterator __t, | |
| _UniformRandomNumberGenerator& __urng, | |
| const param_type& __p); | |
| param_type _M_param; | |
| }; | |
| template<typename _IntType> | |
| template<typename _UniformRandomNumberGenerator> | |
| typename uniform_int_distribution<_IntType>::result_type | |
| uniform_int_distribution<_IntType>:: | |
| operator()(_UniformRandomNumberGenerator& __urng, | |
| const param_type& __param) | |
| { | |
| typedef typename _UniformRandomNumberGenerator::result_type | |
| _Gresult_type; | |
| typedef typename std::make_unsigned<result_type>::type __utype; | |
| typedef typename std::common_type<_Gresult_type, __utype>::type | |
| __uctype; | |
| const __uctype __urngmin = __urng.min(); | |
| const __uctype __urngmax = __urng.max(); | |
| const __uctype __urngrange = __urngmax - __urngmin; | |
| const __uctype __urange | |
| = __uctype(__param.b()) - __uctype(__param.a()); | |
| __uctype __ret; | |
| if (__urngrange > __urange) | |
| { | |
| const __uctype __uerange = __urange + 1; | |
| const __uctype __scaling = __urngrange / __uerange; | |
| const __uctype __past = __uerange * __scaling; | |
| do | |
| __ret = __uctype(__urng()) - __urngmin; | |
| while (__ret >= __past); | |
| __ret /= __scaling; | |
| } | |
| else if (__urngrange < __urange) | |
| { | |
| # 271 "/usr/sgug/include/c++/9/bits/uniform_int_dist.h" 3 | |
| __uctype __tmp; | |
| do | |
| { | |
| const __uctype __uerngrange = __urngrange + 1; | |
| __tmp = (__uerngrange * operator() | |
| (__urng, param_type(0, __urange / __uerngrange))); | |
| __ret = __tmp + (__uctype(__urng()) - __urngmin); | |
| } | |
| while (__ret > __urange || __ret < __tmp); | |
| } | |
| else | |
| __ret = __uctype(__urng()) - __urngmin; | |
| return __ret + __param.a(); | |
| } | |
| template<typename _IntType> | |
| template<typename _ForwardIterator, | |
| typename _UniformRandomNumberGenerator> | |
| void | |
| uniform_int_distribution<_IntType>:: | |
| __generate_impl(_ForwardIterator __f, _ForwardIterator __t, | |
| _UniformRandomNumberGenerator& __urng, | |
| const param_type& __param) | |
| { | |
| typedef typename _UniformRandomNumberGenerator::result_type | |
| _Gresult_type; | |
| typedef typename std::make_unsigned<result_type>::type __utype; | |
| typedef typename std::common_type<_Gresult_type, __utype>::type | |
| __uctype; | |
| const __uctype __urngmin = __urng.min(); | |
| const __uctype __urngmax = __urng.max(); | |
| const __uctype __urngrange = __urngmax - __urngmin; | |
| const __uctype __urange | |
| = __uctype(__param.b()) - __uctype(__param.a()); | |
| __uctype __ret; | |
| if (__urngrange > __urange) | |
| { | |
| if (__detail::_Power_of_2(__urngrange + 1) | |
| && __detail::_Power_of_2(__urange + 1)) | |
| { | |
| while (__f != __t) | |
| { | |
| __ret = __uctype(__urng()) - __urngmin; | |
| *__f++ = (__ret & __urange) + __param.a(); | |
| } | |
| } | |
| else | |
| { | |
| const __uctype __uerange = __urange + 1; | |
| const __uctype __scaling = __urngrange / __uerange; | |
| const __uctype __past = __uerange * __scaling; | |
| while (__f != __t) | |
| { | |
| do | |
| __ret = __uctype(__urng()) - __urngmin; | |
| while (__ret >= __past); | |
| *__f++ = __ret / __scaling + __param.a(); | |
| } | |
| } | |
| } | |
| else if (__urngrange < __urange) | |
| { | |
| # 355 "/usr/sgug/include/c++/9/bits/uniform_int_dist.h" 3 | |
| __uctype __tmp; | |
| while (__f != __t) | |
| { | |
| do | |
| { | |
| const __uctype __uerngrange = __urngrange + 1; | |
| __tmp = (__uerngrange * operator() | |
| (__urng, param_type(0, __urange / __uerngrange))); | |
| __ret = __tmp + (__uctype(__urng()) - __urngmin); | |
| } | |
| while (__ret > __urange || __ret < __tmp); | |
| *__f++ = __ret; | |
| } | |
| } | |
| else | |
| while (__f != __t) | |
| *__f++ = __uctype(__urng()) - __urngmin + __param.a(); | |
| } | |
| } | |
| # 67 "/usr/sgug/include/c++/9/bits/stl_algo.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Iterator, typename _Compare> | |
| void | |
| __move_median_to_first(_Iterator __result,_Iterator __a, _Iterator __b, | |
| _Iterator __c, _Compare __comp) | |
| { | |
| if (__comp(__a, __b)) | |
| { | |
| if (__comp(__b, __c)) | |
| std::iter_swap(__result, __b); | |
| else if (__comp(__a, __c)) | |
| std::iter_swap(__result, __c); | |
| else | |
| std::iter_swap(__result, __a); | |
| } | |
| else if (__comp(__a, __c)) | |
| std::iter_swap(__result, __a); | |
| else if (__comp(__b, __c)) | |
| std::iter_swap(__result, __c); | |
| else | |
| std::iter_swap(__result, __b); | |
| } | |
| template<typename _InputIterator, typename _Predicate> | |
| inline _InputIterator | |
| __find_if(_InputIterator __first, _InputIterator __last, | |
| _Predicate __pred, input_iterator_tag) | |
| { | |
| while (__first != __last && !__pred(__first)) | |
| ++__first; | |
| return __first; | |
| } | |
| template<typename _RandomAccessIterator, typename _Predicate> | |
| _RandomAccessIterator | |
| __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Predicate __pred, random_access_iterator_tag) | |
| { | |
| typename iterator_traits<_RandomAccessIterator>::difference_type | |
| __trip_count = (__last - __first) >> 2; | |
| for (; __trip_count > 0; --__trip_count) | |
| { | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| } | |
| switch (__last - __first) | |
| { | |
| case 3: | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| case 2: | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| case 1: | |
| if (__pred(__first)) | |
| return __first; | |
| ++__first; | |
| case 0: | |
| default: | |
| return __last; | |
| } | |
| } | |
| template<typename _Iterator, typename _Predicate> | |
| inline _Iterator | |
| __find_if(_Iterator __first, _Iterator __last, _Predicate __pred) | |
| { | |
| return __find_if(__first, __last, __pred, | |
| std::__iterator_category(__first)); | |
| } | |
| template<typename _InputIterator, typename _Predicate> | |
| inline _InputIterator | |
| __find_if_not(_InputIterator __first, _InputIterator __last, | |
| _Predicate __pred) | |
| { | |
| return std::__find_if(__first, __last, | |
| __gnu_cxx::__ops::__negate(__pred), | |
| std::__iterator_category(__first)); | |
| } | |
| template<typename _InputIterator, typename _Predicate, typename _Distance> | |
| _InputIterator | |
| __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred) | |
| { | |
| for (; __len; --__len, (void) ++__first) | |
| if (!__pred(__first)) | |
| break; | |
| return __first; | |
| } | |
| # 202 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| _ForwardIterator1 | |
| __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2, | |
| _BinaryPredicate __predicate) | |
| { | |
| if (__first1 == __last1 || __first2 == __last2) | |
| return __first1; | |
| _ForwardIterator2 __p1(__first2); | |
| if (++__p1 == __last2) | |
| return std::__find_if(__first1, __last1, | |
| __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2)); | |
| _ForwardIterator2 __p; | |
| _ForwardIterator1 __current = __first1; | |
| for (;;) | |
| { | |
| __first1 = | |
| std::__find_if(__first1, __last1, | |
| __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2)); | |
| 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<typename _ForwardIterator, typename _Integer, | |
| typename _UnaryPredicate> | |
| _ForwardIterator | |
| __search_n_aux(_ForwardIterator __first, _ForwardIterator __last, | |
| _Integer __count, _UnaryPredicate __unary_pred, | |
| std::forward_iterator_tag) | |
| { | |
| __first = std::__find_if(__first, __last, __unary_pred); | |
| while (__first != __last) | |
| { | |
| typename iterator_traits<_ForwardIterator>::difference_type | |
| __n = __count; | |
| _ForwardIterator __i = __first; | |
| ++__i; | |
| while (__i != __last && __n != 1 && __unary_pred(__i)) | |
| { | |
| ++__i; | |
| --__n; | |
| } | |
| if (__n == 1) | |
| return __first; | |
| if (__i == __last) | |
| return __last; | |
| __first = std::__find_if(++__i, __last, __unary_pred); | |
| } | |
| return __last; | |
| } | |
| template<typename _RandomAccessIter, typename _Integer, | |
| typename _UnaryPredicate> | |
| _RandomAccessIter | |
| __search_n_aux(_RandomAccessIter __first, _RandomAccessIter __last, | |
| _Integer __count, _UnaryPredicate __unary_pred, | |
| std::random_access_iterator_tag) | |
| { | |
| typedef typename std::iterator_traits<_RandomAccessIter>::difference_type | |
| _DistanceType; | |
| _DistanceType __tailSize = __last - __first; | |
| _DistanceType __remainder = __count; | |
| while (__remainder <= __tailSize) | |
| { | |
| __first += __remainder; | |
| __tailSize -= __remainder; | |
| _RandomAccessIter __backTrack = __first; | |
| while (__unary_pred(--__backTrack)) | |
| { | |
| if (--__remainder == 0) | |
| return (__first - __count); | |
| } | |
| __remainder = __count + 1 - (__first - __backTrack); | |
| } | |
| return __last; | |
| } | |
| template<typename _ForwardIterator, typename _Integer, | |
| typename _UnaryPredicate> | |
| _ForwardIterator | |
| __search_n(_ForwardIterator __first, _ForwardIterator __last, | |
| _Integer __count, | |
| _UnaryPredicate __unary_pred) | |
| { | |
| if (__count <= 0) | |
| return __first; | |
| if (__count == 1) | |
| return std::__find_if(__first, __last, __unary_pred); | |
| return std::__search_n_aux(__first, __last, __count, __unary_pred, | |
| std::__iterator_category(__first)); | |
| } | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| _ForwardIterator1 | |
| __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2, | |
| forward_iterator_tag, forward_iterator_tag, | |
| _BinaryPredicate __comp) | |
| { | |
| if (__first2 == __last2) | |
| return __last1; | |
| _ForwardIterator1 __result = __last1; | |
| while (1) | |
| { | |
| _ForwardIterator1 __new_result | |
| = std::__search(__first1, __last1, __first2, __last2, __comp); | |
| if (__new_result == __last1) | |
| return __result; | |
| else | |
| { | |
| __result = __new_result; | |
| __first1 = __new_result; | |
| ++__first1; | |
| } | |
| } | |
| } | |
| template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, | |
| typename _BinaryPredicate> | |
| _BidirectionalIterator1 | |
| __find_end(_BidirectionalIterator1 __first1, | |
| _BidirectionalIterator1 __last1, | |
| _BidirectionalIterator2 __first2, | |
| _BidirectionalIterator2 __last2, | |
| bidirectional_iterator_tag, bidirectional_iterator_tag, | |
| _BinaryPredicate __comp) | |
| { | |
| typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; | |
| typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; | |
| _RevIterator1 __rlast1(__first1); | |
| _RevIterator2 __rlast2(__first2); | |
| _RevIterator1 __rresult = std::__search(_RevIterator1(__last1), __rlast1, | |
| _RevIterator2(__last2), __rlast2, | |
| __comp); | |
| if (__rresult == __rlast1) | |
| return __last1; | |
| else | |
| { | |
| _BidirectionalIterator1 __result = __rresult.base(); | |
| std::advance(__result, -std::distance(__first2, __last2)); | |
| return __result; | |
| } | |
| } | |
| # 423 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2> | |
| inline _ForwardIterator1 | |
| find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2) | |
| { | |
| ; | |
| ; | |
| return std::__find_end(__first1, __last1, __first2, __last2, | |
| std::__iterator_category(__first1), | |
| std::__iterator_category(__first2), | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 471 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| inline _ForwardIterator1 | |
| find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2, | |
| _BinaryPredicate __comp) | |
| { | |
| ; | |
| ; | |
| return std::__find_end(__first1, __last1, __first2, __last2, | |
| std::__iterator_category(__first1), | |
| std::__iterator_category(__first2), | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| # 506 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline bool | |
| all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) | |
| { return __last == std::find_if_not(__first, __last, __pred); } | |
| # 523 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline bool | |
| none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) | |
| { return __last == std::find_if(__first, __last, __pred); } | |
| # 541 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline bool | |
| any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) | |
| { return !std::none_of(__first, __last, __pred); } | |
| # 556 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline _InputIterator | |
| find_if_not(_InputIterator __first, _InputIterator __last, | |
| _Predicate __pred) | |
| { | |
| ; | |
| return std::__find_if_not(__first, __last, | |
| __gnu_cxx::__ops::__pred_iter(__pred)); | |
| } | |
| # 580 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline bool | |
| is_partitioned(_InputIterator __first, _InputIterator __last, | |
| _Predicate __pred) | |
| { | |
| __first = std::find_if_not(__first, __last, __pred); | |
| if (__first == __last) | |
| return true; | |
| ++__first; | |
| return std::none_of(__first, __last, __pred); | |
| } | |
| # 601 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Predicate> | |
| _ForwardIterator | |
| partition_point(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred) | |
| { | |
| ; | |
| typedef typename iterator_traits<_ForwardIterator>::difference_type | |
| _DistanceType; | |
| _DistanceType __len = std::distance(__first, __last); | |
| _DistanceType __half; | |
| _ForwardIterator __middle; | |
| while (__len > 0) | |
| { | |
| __half = __len >> 1; | |
| __middle = __first; | |
| std::advance(__middle, __half); | |
| if (__pred(*__middle)) | |
| { | |
| __first = __middle; | |
| ++__first; | |
| __len = __len - __half - 1; | |
| } | |
| else | |
| __len = __half; | |
| } | |
| return __first; | |
| } | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _Predicate> | |
| _OutputIterator | |
| __remove_copy_if(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, _Predicate __pred) | |
| { | |
| for (; __first != __last; ++__first) | |
| if (!__pred(__first)) | |
| { | |
| *__result = *__first; | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| # 668 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, typename _Tp> | |
| inline _OutputIterator | |
| remove_copy(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, const _Tp& __value) | |
| { | |
| ; | |
| return std::__remove_copy_if(__first, __last, __result, | |
| __gnu_cxx::__ops::__iter_equals_val(__value)); | |
| } | |
| # 700 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _Predicate> | |
| inline _OutputIterator | |
| remove_copy_if(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, _Predicate __pred) | |
| { | |
| ; | |
| return std::__remove_copy_if(__first, __last, __result, | |
| __gnu_cxx::__ops::__pred_iter(__pred)); | |
| } | |
| # 734 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _Predicate> | |
| _OutputIterator | |
| copy_if(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, _Predicate __pred) | |
| { | |
| ; | |
| for (; __first != __last; ++__first) | |
| if (__pred(*__first)) | |
| { | |
| *__result = *__first; | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| template<typename _InputIterator, typename _Size, typename _OutputIterator> | |
| _OutputIterator | |
| __copy_n(_InputIterator __first, _Size __n, | |
| _OutputIterator __result, input_iterator_tag) | |
| { | |
| if (__n > 0) | |
| { | |
| while (true) | |
| { | |
| *__result = *__first; | |
| ++__result; | |
| if (--__n > 0) | |
| ++__first; | |
| else | |
| break; | |
| } | |
| } | |
| return __result; | |
| } | |
| template<typename _RandomAccessIterator, typename _Size, | |
| typename _OutputIterator> | |
| inline _OutputIterator | |
| __copy_n(_RandomAccessIterator __first, _Size __n, | |
| _OutputIterator __result, random_access_iterator_tag) | |
| { return std::copy(__first, __first + __n, __result); } | |
| # 797 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Size, typename _OutputIterator> | |
| inline _OutputIterator | |
| copy_n(_InputIterator __first, _Size __n, _OutputIterator __result) | |
| { | |
| return std::__copy_n(__first, __n, __result, | |
| std::__iterator_category(__first)); | |
| } | |
| # 825 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator1, | |
| typename _OutputIterator2, typename _Predicate> | |
| pair<_OutputIterator1, _OutputIterator2> | |
| partition_copy(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator1 __out_true, _OutputIterator2 __out_false, | |
| _Predicate __pred) | |
| { | |
| ; | |
| for (; __first != __last; ++__first) | |
| if (__pred(*__first)) | |
| { | |
| *__out_true = *__first; | |
| ++__out_true; | |
| } | |
| else | |
| { | |
| *__out_false = *__first; | |
| ++__out_false; | |
| } | |
| return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); | |
| } | |
| template<typename _ForwardIterator, typename _Predicate> | |
| _ForwardIterator | |
| __remove_if(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred) | |
| { | |
| __first = std::__find_if(__first, __last, __pred); | |
| if (__first == __last) | |
| return __first; | |
| _ForwardIterator __result = __first; | |
| ++__first; | |
| for (; __first != __last; ++__first) | |
| if (!__pred(__first)) | |
| { | |
| *__result = std::move(*__first); | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| # 894 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline _ForwardIterator | |
| remove(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __value) | |
| { | |
| ; | |
| return std::__remove_if(__first, __last, | |
| __gnu_cxx::__ops::__iter_equals_val(__value)); | |
| } | |
| # 927 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Predicate> | |
| inline _ForwardIterator | |
| remove_if(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred) | |
| { | |
| ; | |
| return std::__remove_if(__first, __last, | |
| __gnu_cxx::__ops::__pred_iter(__pred)); | |
| } | |
| template<typename _ForwardIterator, typename _BinaryPredicate> | |
| _ForwardIterator | |
| __adjacent_find(_ForwardIterator __first, _ForwardIterator __last, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| if (__first == __last) | |
| return __last; | |
| _ForwardIterator __next = __first; | |
| while (++__next != __last) | |
| { | |
| if (__binary_pred(__first, __next)) | |
| return __first; | |
| __first = __next; | |
| } | |
| return __last; | |
| } | |
| template<typename _ForwardIterator, typename _BinaryPredicate> | |
| _ForwardIterator | |
| __unique(_ForwardIterator __first, _ForwardIterator __last, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| __first = std::__adjacent_find(__first, __last, __binary_pred); | |
| if (__first == __last) | |
| return __last; | |
| _ForwardIterator __dest = __first; | |
| ++__first; | |
| while (++__first != __last) | |
| if (!__binary_pred(__dest, __first)) | |
| *++__dest = std::move(*__first); | |
| return ++__dest; | |
| } | |
| # 993 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| inline _ForwardIterator | |
| unique(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| ; | |
| return std::__unique(__first, __last, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 1023 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _BinaryPredicate> | |
| inline _ForwardIterator | |
| unique(_ForwardIterator __first, _ForwardIterator __last, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| return std::__unique(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__binary_pred)); | |
| } | |
| template<typename _ForwardIterator, typename _OutputIterator, | |
| typename _BinaryPredicate> | |
| _OutputIterator | |
| __unique_copy(_ForwardIterator __first, _ForwardIterator __last, | |
| _OutputIterator __result, _BinaryPredicate __binary_pred, | |
| forward_iterator_tag, output_iterator_tag) | |
| { | |
| _ForwardIterator __next = __first; | |
| *__result = *__first; | |
| while (++__next != __last) | |
| if (!__binary_pred(__first, __next)) | |
| { | |
| __first = __next; | |
| *++__result = *__first; | |
| } | |
| return ++__result; | |
| } | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _BinaryPredicate> | |
| _OutputIterator | |
| __unique_copy(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, _BinaryPredicate __binary_pred, | |
| input_iterator_tag, output_iterator_tag) | |
| { | |
| typename iterator_traits<_InputIterator>::value_type __value = *__first; | |
| __decltype(__gnu_cxx::__ops::__iter_comp_val(__binary_pred)) | |
| __rebound_pred | |
| = __gnu_cxx::__ops::__iter_comp_val(__binary_pred); | |
| *__result = __value; | |
| while (++__first != __last) | |
| if (!__rebound_pred(__first, __value)) | |
| { | |
| __value = *__first; | |
| *++__result = __value; | |
| } | |
| return ++__result; | |
| } | |
| template<typename _InputIterator, typename _ForwardIterator, | |
| typename _BinaryPredicate> | |
| _ForwardIterator | |
| __unique_copy(_InputIterator __first, _InputIterator __last, | |
| _ForwardIterator __result, _BinaryPredicate __binary_pred, | |
| input_iterator_tag, forward_iterator_tag) | |
| { | |
| *__result = *__first; | |
| while (++__first != __last) | |
| if (!__binary_pred(__result, __first)) | |
| *++__result = *__first; | |
| return ++__result; | |
| } | |
| template<typename _BidirectionalIterator> | |
| void | |
| __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, | |
| bidirectional_iterator_tag) | |
| { | |
| while (true) | |
| if (__first == __last || __first == --__last) | |
| return; | |
| else | |
| { | |
| std::iter_swap(__first, __last); | |
| ++__first; | |
| } | |
| } | |
| template<typename _RandomAccessIterator> | |
| void | |
| __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| random_access_iterator_tag) | |
| { | |
| if (__first == __last) | |
| return; | |
| --__last; | |
| while (__first < __last) | |
| { | |
| std::iter_swap(__first, __last); | |
| ++__first; | |
| --__last; | |
| } | |
| } | |
| # 1178 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator> | |
| inline void | |
| reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) | |
| { | |
| ; | |
| std::__reverse(__first, __last, std::__iterator_category(__first)); | |
| } | |
| # 1205 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator, typename _OutputIterator> | |
| _OutputIterator | |
| reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| while (__first != __last) | |
| { | |
| --__last; | |
| *__result = *__last; | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| template<typename _EuclideanRingElement> | |
| _EuclideanRingElement | |
| __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) | |
| { | |
| while (__n != 0) | |
| { | |
| _EuclideanRingElement __t = __m % __n; | |
| __m = __n; | |
| __n = __t; | |
| } | |
| return __m; | |
| } | |
| inline namespace _V2 | |
| { | |
| template<typename _ForwardIterator> | |
| _ForwardIterator | |
| __rotate(_ForwardIterator __first, | |
| _ForwardIterator __middle, | |
| _ForwardIterator __last, | |
| forward_iterator_tag) | |
| { | |
| if (__first == __middle) | |
| return __last; | |
| else if (__last == __middle) | |
| return __first; | |
| _ForwardIterator __first2 = __middle; | |
| do | |
| { | |
| std::iter_swap(__first, __first2); | |
| ++__first; | |
| ++__first2; | |
| if (__first == __middle) | |
| __middle = __first2; | |
| } | |
| while (__first2 != __last); | |
| _ForwardIterator __ret = __first; | |
| __first2 = __middle; | |
| while (__first2 != __last) | |
| { | |
| std::iter_swap(__first, __first2); | |
| ++__first; | |
| ++__first2; | |
| if (__first == __middle) | |
| __middle = __first2; | |
| else if (__first2 == __last) | |
| __first2 = __middle; | |
| } | |
| return __ret; | |
| } | |
| template<typename _BidirectionalIterator> | |
| _BidirectionalIterator | |
| __rotate(_BidirectionalIterator __first, | |
| _BidirectionalIterator __middle, | |
| _BidirectionalIterator __last, | |
| bidirectional_iterator_tag) | |
| { | |
| if (__first == __middle) | |
| return __last; | |
| else if (__last == __middle) | |
| return __first; | |
| std::__reverse(__first, __middle, bidirectional_iterator_tag()); | |
| std::__reverse(__middle, __last, bidirectional_iterator_tag()); | |
| while (__first != __middle && __middle != __last) | |
| { | |
| std::iter_swap(__first, --__last); | |
| ++__first; | |
| } | |
| if (__first == __middle) | |
| { | |
| std::__reverse(__middle, __last, bidirectional_iterator_tag()); | |
| return __last; | |
| } | |
| else | |
| { | |
| std::__reverse(__first, __middle, bidirectional_iterator_tag()); | |
| return __first; | |
| } | |
| } | |
| template<typename _RandomAccessIterator> | |
| _RandomAccessIterator | |
| __rotate(_RandomAccessIterator __first, | |
| _RandomAccessIterator __middle, | |
| _RandomAccessIterator __last, | |
| random_access_iterator_tag) | |
| { | |
| if (__first == __middle) | |
| return __last; | |
| else if (__last == __middle) | |
| return __first; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _Distance; | |
| typedef typename iterator_traits<_RandomAccessIterator>::value_type | |
| _ValueType; | |
| _Distance __n = __last - __first; | |
| _Distance __k = __middle - __first; | |
| if (__k == __n - __k) | |
| { | |
| std::swap_ranges(__first, __middle, __middle); | |
| return __middle; | |
| } | |
| _RandomAccessIterator __p = __first; | |
| _RandomAccessIterator __ret = __first + (__last - __middle); | |
| for (;;) | |
| { | |
| if (__k < __n - __k) | |
| { | |
| if (__is_pod(_ValueType) && __k == 1) | |
| { | |
| _ValueType __t = std::move(*__p); | |
| std::move(__p + 1, __p + __n, __p); | |
| *(__p + __n - 1) = std::move(__t); | |
| return __ret; | |
| } | |
| _RandomAccessIterator __q = __p + __k; | |
| for (_Distance __i = 0; __i < __n - __k; ++ __i) | |
| { | |
| std::iter_swap(__p, __q); | |
| ++__p; | |
| ++__q; | |
| } | |
| __n %= __k; | |
| if (__n == 0) | |
| return __ret; | |
| std::swap(__n, __k); | |
| __k = __n - __k; | |
| } | |
| else | |
| { | |
| __k = __n - __k; | |
| if (__is_pod(_ValueType) && __k == 1) | |
| { | |
| _ValueType __t = std::move(*(__p + __n - 1)); | |
| std::move_backward(__p, __p + __n - 1, __p + __n); | |
| *__p = std::move(__t); | |
| return __ret; | |
| } | |
| _RandomAccessIterator __q = __p + __n; | |
| __p = __q - __k; | |
| for (_Distance __i = 0; __i < __n - __k; ++ __i) | |
| { | |
| --__p; | |
| --__q; | |
| std::iter_swap(__p, __q); | |
| } | |
| __n %= __k; | |
| if (__n == 0) | |
| return __ret; | |
| std::swap(__n, __k); | |
| } | |
| } | |
| } | |
| # 1432 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| inline _ForwardIterator | |
| rotate(_ForwardIterator __first, _ForwardIterator __middle, | |
| _ForwardIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__rotate(__first, __middle, __last, | |
| std::__iterator_category(__first)); | |
| } | |
| } | |
| # 1469 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _OutputIterator> | |
| inline _OutputIterator | |
| rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, | |
| _ForwardIterator __last, _OutputIterator __result) | |
| { | |
| ; | |
| ; | |
| return std::copy(__first, __middle, | |
| std::copy(__middle, __last, __result)); | |
| } | |
| template<typename _ForwardIterator, typename _Predicate> | |
| _ForwardIterator | |
| __partition(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred, forward_iterator_tag) | |
| { | |
| if (__first == __last) | |
| return __first; | |
| while (__pred(*__first)) | |
| if (++__first == __last) | |
| return __first; | |
| _ForwardIterator __next = __first; | |
| while (++__next != __last) | |
| if (__pred(*__next)) | |
| { | |
| std::iter_swap(__first, __next); | |
| ++__first; | |
| } | |
| return __first; | |
| } | |
| template<typename _BidirectionalIterator, typename _Predicate> | |
| _BidirectionalIterator | |
| __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, | |
| _Predicate __pred, bidirectional_iterator_tag) | |
| { | |
| while (true) | |
| { | |
| while (true) | |
| if (__first == __last) | |
| return __first; | |
| else if (__pred(*__first)) | |
| ++__first; | |
| else | |
| break; | |
| --__last; | |
| while (true) | |
| if (__first == __last) | |
| return __first; | |
| else if (!bool(__pred(*__last))) | |
| --__last; | |
| else | |
| break; | |
| std::iter_swap(__first, __last); | |
| ++__first; | |
| } | |
| } | |
| # 1546 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Pointer, typename _Predicate, | |
| typename _Distance> | |
| _ForwardIterator | |
| __stable_partition_adaptive(_ForwardIterator __first, | |
| _ForwardIterator __last, | |
| _Predicate __pred, _Distance __len, | |
| _Pointer __buffer, | |
| _Distance __buffer_size) | |
| { | |
| if (__len == 1) | |
| return __first; | |
| if (__len <= __buffer_size) | |
| { | |
| _ForwardIterator __result1 = __first; | |
| _Pointer __result2 = __buffer; | |
| *__result2 = std::move(*__first); | |
| ++__result2; | |
| ++__first; | |
| for (; __first != __last; ++__first) | |
| if (__pred(__first)) | |
| { | |
| *__result1 = std::move(*__first); | |
| ++__result1; | |
| } | |
| else | |
| { | |
| *__result2 = std::move(*__first); | |
| ++__result2; | |
| } | |
| std::move(__buffer, __result2, __result1); | |
| return __result1; | |
| } | |
| _ForwardIterator __middle = __first; | |
| std::advance(__middle, __len / 2); | |
| _ForwardIterator __left_split = | |
| std::__stable_partition_adaptive(__first, __middle, __pred, | |
| __len / 2, __buffer, | |
| __buffer_size); | |
| _Distance __right_len = __len - __len / 2; | |
| _ForwardIterator __right_split = | |
| std::__find_if_not_n(__middle, __right_len, __pred); | |
| if (__right_len) | |
| __right_split = | |
| std::__stable_partition_adaptive(__right_split, __last, __pred, | |
| __right_len, | |
| __buffer, __buffer_size); | |
| return std::rotate(__left_split, __middle, __right_split); | |
| } | |
| template<typename _ForwardIterator, typename _Predicate> | |
| _ForwardIterator | |
| __stable_partition(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred) | |
| { | |
| __first = std::__find_if_not(__first, __last, __pred); | |
| if (__first == __last) | |
| return __first; | |
| typedef typename iterator_traits<_ForwardIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_ForwardIterator>::difference_type | |
| _DistanceType; | |
| _Temporary_buffer<_ForwardIterator, _ValueType> | |
| __buf(__first, std::distance(__first, __last)); | |
| return | |
| std::__stable_partition_adaptive(__first, __last, __pred, | |
| _DistanceType(__buf.requested_size()), | |
| __buf.begin(), | |
| _DistanceType(__buf.size())); | |
| } | |
| # 1648 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Predicate> | |
| inline _ForwardIterator | |
| stable_partition(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred) | |
| { | |
| ; | |
| return std::__stable_partition(__first, __last, | |
| __gnu_cxx::__ops::__pred_iter(__pred)); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __heap_select(_RandomAccessIterator __first, | |
| _RandomAccessIterator __middle, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| std::__make_heap(__first, __middle, __comp); | |
| for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) | |
| if (__comp(__i, __first)) | |
| std::__pop_heap(__first, __middle, __i, __comp); | |
| } | |
| template<typename _InputIterator, typename _RandomAccessIterator, | |
| typename _Compare> | |
| _RandomAccessIterator | |
| __partial_sort_copy(_InputIterator __first, _InputIterator __last, | |
| _RandomAccessIterator __result_first, | |
| _RandomAccessIterator __result_last, | |
| _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_InputIterator>::value_type | |
| _InputValueType; | |
| typedef iterator_traits<_RandomAccessIterator> _RItTraits; | |
| typedef typename _RItTraits::difference_type _DistanceType; | |
| if (__result_first == __result_last) | |
| return __result_last; | |
| _RandomAccessIterator __result_real_last = __result_first; | |
| while (__first != __last && __result_real_last != __result_last) | |
| { | |
| *__result_real_last = *__first; | |
| ++__result_real_last; | |
| ++__first; | |
| } | |
| std::__make_heap(__result_first, __result_real_last, __comp); | |
| while (__first != __last) | |
| { | |
| if (__comp(__first, __result_first)) | |
| std::__adjust_heap(__result_first, _DistanceType(0), | |
| _DistanceType(__result_real_last | |
| - __result_first), | |
| _InputValueType(*__first), __comp); | |
| ++__first; | |
| } | |
| std::__sort_heap(__result_first, __result_real_last, __comp); | |
| return __result_real_last; | |
| } | |
| # 1734 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _RandomAccessIterator> | |
| inline _RandomAccessIterator | |
| partial_sort_copy(_InputIterator __first, _InputIterator __last, | |
| _RandomAccessIterator __result_first, | |
| _RandomAccessIterator __result_last) | |
| { | |
| # 1748 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| ; | |
| ; | |
| ; | |
| return std::__partial_sort_copy(__first, __last, | |
| __result_first, __result_last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 1783 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _RandomAccessIterator, | |
| typename _Compare> | |
| inline _RandomAccessIterator | |
| partial_sort_copy(_InputIterator __first, _InputIterator __last, | |
| _RandomAccessIterator __result_first, | |
| _RandomAccessIterator __result_last, | |
| _Compare __comp) | |
| { | |
| # 1799 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| ; | |
| ; | |
| ; | |
| return std::__partial_sort_copy(__first, __last, | |
| __result_first, __result_last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __unguarded_linear_insert(_RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| typename iterator_traits<_RandomAccessIterator>::value_type | |
| __val = std::move(*__last); | |
| _RandomAccessIterator __next = __last; | |
| --__next; | |
| while (__comp(__val, __next)) | |
| { | |
| *__last = std::move(*__next); | |
| __last = __next; | |
| --__next; | |
| } | |
| *__last = std::move(__val); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __insertion_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| if (__first == __last) return; | |
| for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) | |
| { | |
| if (__comp(__i, __first)) | |
| { | |
| typename iterator_traits<_RandomAccessIterator>::value_type | |
| __val = std::move(*__i); | |
| std::move_backward(__first, __i, __i + 1); | |
| *__first = std::move(__val); | |
| } | |
| else | |
| std::__unguarded_linear_insert(__i, | |
| __gnu_cxx::__ops::__val_comp_iter(__comp)); | |
| } | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| __unguarded_insertion_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| for (_RandomAccessIterator __i = __first; __i != __last; ++__i) | |
| std::__unguarded_linear_insert(__i, | |
| __gnu_cxx::__ops::__val_comp_iter(__comp)); | |
| } | |
| enum { _S_threshold = 16 }; | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __final_insertion_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| if (__last - __first > int(_S_threshold)) | |
| { | |
| std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | |
| std::__unguarded_insertion_sort(__first + int(_S_threshold), __last, | |
| __comp); | |
| } | |
| else | |
| std::__insertion_sort(__first, __last, __comp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| _RandomAccessIterator | |
| __unguarded_partition(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, | |
| _RandomAccessIterator __pivot, _Compare __comp) | |
| { | |
| while (true) | |
| { | |
| while (__comp(__first, __pivot)) | |
| ++__first; | |
| --__last; | |
| while (__comp(__pivot, __last)) | |
| --__last; | |
| if (!(__first < __last)) | |
| return __first; | |
| std::iter_swap(__first, __last); | |
| ++__first; | |
| } | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline _RandomAccessIterator | |
| __unguarded_partition_pivot(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| _RandomAccessIterator __mid = __first + (__last - __first) / 2; | |
| std::__move_median_to_first(__first, __first + 1, __mid, __last - 1, | |
| __comp); | |
| return std::__unguarded_partition(__first + 1, __last, __first, __comp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| __partial_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __middle, | |
| _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| std::__heap_select(__first, __middle, __last, __comp); | |
| std::__sort_heap(__first, __middle, __comp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Size, typename _Compare> | |
| void | |
| __introsort_loop(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, | |
| _Size __depth_limit, _Compare __comp) | |
| { | |
| while (__last - __first > int(_S_threshold)) | |
| { | |
| if (__depth_limit == 0) | |
| { | |
| std::__partial_sort(__first, __last, __last, __comp); | |
| return; | |
| } | |
| --__depth_limit; | |
| _RandomAccessIterator __cut = | |
| std::__unguarded_partition_pivot(__first, __last, __comp); | |
| std::__introsort_loop(__cut, __last, __depth_limit, __comp); | |
| __last = __cut; | |
| } | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| if (__first != __last) | |
| { | |
| std::__introsort_loop(__first, __last, | |
| std::__lg(__last - __first) * 2, | |
| __comp); | |
| std::__final_insertion_sort(__first, __last, __comp); | |
| } | |
| } | |
| template<typename _RandomAccessIterator, typename _Size, typename _Compare> | |
| void | |
| __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, | |
| _RandomAccessIterator __last, _Size __depth_limit, | |
| _Compare __comp) | |
| { | |
| while (__last - __first > 3) | |
| { | |
| if (__depth_limit == 0) | |
| { | |
| std::__heap_select(__first, __nth + 1, __last, __comp); | |
| std::iter_swap(__first, __nth); | |
| return; | |
| } | |
| --__depth_limit; | |
| _RandomAccessIterator __cut = | |
| std::__unguarded_partition_pivot(__first, __last, __comp); | |
| if (__cut <= __nth) | |
| __first = __cut; | |
| else | |
| __last = __cut; | |
| } | |
| std::__insertion_sort(__first, __last, __comp); | |
| } | |
| # 2020 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp, typename _Compare> | |
| inline _ForwardIterator | |
| lower_bound(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, _Compare __comp) | |
| { | |
| ; | |
| return std::__lower_bound(__first, __last, __val, | |
| __gnu_cxx::__ops::__iter_comp_val(__comp)); | |
| } | |
| template<typename _ForwardIterator, typename _Tp, typename _Compare> | |
| _ForwardIterator | |
| __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_ForwardIterator>::difference_type | |
| _DistanceType; | |
| _DistanceType __len = std::distance(__first, __last); | |
| while (__len > 0) | |
| { | |
| _DistanceType __half = __len >> 1; | |
| _ForwardIterator __middle = __first; | |
| std::advance(__middle, __half); | |
| if (__comp(__val, __middle)) | |
| __len = __half; | |
| else | |
| { | |
| __first = __middle; | |
| ++__first; | |
| __len = __len - __half - 1; | |
| } | |
| } | |
| return __first; | |
| } | |
| # 2074 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline _ForwardIterator | |
| upper_bound(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val) | |
| { | |
| ; | |
| return std::__upper_bound(__first, __last, __val, | |
| __gnu_cxx::__ops::__val_less_iter()); | |
| } | |
| # 2104 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp, typename _Compare> | |
| inline _ForwardIterator | |
| upper_bound(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, _Compare __comp) | |
| { | |
| ; | |
| return std::__upper_bound(__first, __last, __val, | |
| __gnu_cxx::__ops::__val_comp_iter(__comp)); | |
| } | |
| template<typename _ForwardIterator, typename _Tp, | |
| typename _CompareItTp, typename _CompareTpIt> | |
| pair<_ForwardIterator, _ForwardIterator> | |
| __equal_range(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, | |
| _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it) | |
| { | |
| typedef typename iterator_traits<_ForwardIterator>::difference_type | |
| _DistanceType; | |
| _DistanceType __len = std::distance(__first, __last); | |
| while (__len > 0) | |
| { | |
| _DistanceType __half = __len >> 1; | |
| _ForwardIterator __middle = __first; | |
| std::advance(__middle, __half); | |
| if (__comp_it_val(__middle, __val)) | |
| { | |
| __first = __middle; | |
| ++__first; | |
| __len = __len - __half - 1; | |
| } | |
| else if (__comp_val_it(__val, __middle)) | |
| __len = __half; | |
| else | |
| { | |
| _ForwardIterator __left | |
| = std::__lower_bound(__first, __middle, __val, __comp_it_val); | |
| std::advance(__first, __len); | |
| _ForwardIterator __right | |
| = std::__upper_bound(++__middle, __first, __val, __comp_val_it); | |
| return pair<_ForwardIterator, _ForwardIterator>(__left, __right); | |
| } | |
| } | |
| return pair<_ForwardIterator, _ForwardIterator>(__first, __first); | |
| } | |
| # 2175 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| inline pair<_ForwardIterator, _ForwardIterator> | |
| equal_range(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val) | |
| { | |
| ; | |
| ; | |
| return std::__equal_range(__first, __last, __val, | |
| __gnu_cxx::__ops::__iter_less_val(), | |
| __gnu_cxx::__ops::__val_less_iter()); | |
| } | |
| # 2211 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp, typename _Compare> | |
| inline pair<_ForwardIterator, _ForwardIterator> | |
| equal_range(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__equal_range(__first, __last, __val, | |
| __gnu_cxx::__ops::__iter_comp_val(__comp), | |
| __gnu_cxx::__ops::__val_comp_iter(__comp)); | |
| } | |
| # 2244 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| bool | |
| binary_search(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val) | |
| { | |
| ; | |
| ; | |
| _ForwardIterator __i | |
| = std::__lower_bound(__first, __last, __val, | |
| __gnu_cxx::__ops::__iter_less_val()); | |
| return __i != __last && !(__val < *__i); | |
| } | |
| # 2277 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp, typename _Compare> | |
| bool | |
| binary_search(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __val, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| _ForwardIterator __i | |
| = std::__lower_bound(__first, __last, __val, | |
| __gnu_cxx::__ops::__iter_comp_val(__comp)); | |
| return __i != __last && !bool(__comp(__val, *__i)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| void | |
| __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| { | |
| if (__comp(__first2, __first1)) | |
| { | |
| *__result = std::move(*__first2); | |
| ++__first2; | |
| } | |
| else | |
| { | |
| *__result = std::move(*__first1); | |
| ++__first1; | |
| } | |
| ++__result; | |
| } | |
| if (__first1 != __last1) | |
| std::move(__first1, __last1, __result); | |
| } | |
| template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, | |
| typename _BidirectionalIterator3, typename _Compare> | |
| void | |
| __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, | |
| _BidirectionalIterator1 __last1, | |
| _BidirectionalIterator2 __first2, | |
| _BidirectionalIterator2 __last2, | |
| _BidirectionalIterator3 __result, | |
| _Compare __comp) | |
| { | |
| if (__first1 == __last1) | |
| { | |
| std::move_backward(__first2, __last2, __result); | |
| return; | |
| } | |
| else if (__first2 == __last2) | |
| return; | |
| --__last1; | |
| --__last2; | |
| while (true) | |
| { | |
| if (__comp(__last2, __last1)) | |
| { | |
| *--__result = std::move(*__last1); | |
| if (__first1 == __last1) | |
| { | |
| std::move_backward(__first2, ++__last2, __result); | |
| return; | |
| } | |
| --__last1; | |
| } | |
| else | |
| { | |
| *--__result = std::move(*__last2); | |
| if (__first2 == __last2) | |
| return; | |
| --__last2; | |
| } | |
| } | |
| } | |
| template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, | |
| typename _Distance> | |
| _BidirectionalIterator1 | |
| __rotate_adaptive(_BidirectionalIterator1 __first, | |
| _BidirectionalIterator1 __middle, | |
| _BidirectionalIterator1 __last, | |
| _Distance __len1, _Distance __len2, | |
| _BidirectionalIterator2 __buffer, | |
| _Distance __buffer_size) | |
| { | |
| _BidirectionalIterator2 __buffer_end; | |
| if (__len1 > __len2 && __len2 <= __buffer_size) | |
| { | |
| if (__len2) | |
| { | |
| __buffer_end = std::move(__middle, __last, __buffer); | |
| std::move_backward(__first, __middle, __last); | |
| return std::move(__buffer, __buffer_end, __first); | |
| } | |
| else | |
| return __first; | |
| } | |
| else if (__len1 <= __buffer_size) | |
| { | |
| if (__len1) | |
| { | |
| __buffer_end = std::move(__first, __middle, __buffer); | |
| std::move(__middle, __last, __first); | |
| return std::move_backward(__buffer, __buffer_end, __last); | |
| } | |
| else | |
| return __last; | |
| } | |
| else | |
| return std::rotate(__first, __middle, __last); | |
| } | |
| template<typename _BidirectionalIterator, typename _Distance, | |
| typename _Pointer, typename _Compare> | |
| void | |
| __merge_adaptive(_BidirectionalIterator __first, | |
| _BidirectionalIterator __middle, | |
| _BidirectionalIterator __last, | |
| _Distance __len1, _Distance __len2, | |
| _Pointer __buffer, _Distance __buffer_size, | |
| _Compare __comp) | |
| { | |
| if (__len1 <= __len2 && __len1 <= __buffer_size) | |
| { | |
| _Pointer __buffer_end = std::move(__first, __middle, __buffer); | |
| std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last, | |
| __first, __comp); | |
| } | |
| else if (__len2 <= __buffer_size) | |
| { | |
| _Pointer __buffer_end = std::move(__middle, __last, __buffer); | |
| std::__move_merge_adaptive_backward(__first, __middle, __buffer, | |
| __buffer_end, __last, __comp); | |
| } | |
| else | |
| { | |
| _BidirectionalIterator __first_cut = __first; | |
| _BidirectionalIterator __second_cut = __middle; | |
| _Distance __len11 = 0; | |
| _Distance __len22 = 0; | |
| if (__len1 > __len2) | |
| { | |
| __len11 = __len1 / 2; | |
| std::advance(__first_cut, __len11); | |
| __second_cut | |
| = std::__lower_bound(__middle, __last, *__first_cut, | |
| __gnu_cxx::__ops::__iter_comp_val(__comp)); | |
| __len22 = std::distance(__middle, __second_cut); | |
| } | |
| else | |
| { | |
| __len22 = __len2 / 2; | |
| std::advance(__second_cut, __len22); | |
| __first_cut | |
| = std::__upper_bound(__first, __middle, *__second_cut, | |
| __gnu_cxx::__ops::__val_comp_iter(__comp)); | |
| __len11 = std::distance(__first, __first_cut); | |
| } | |
| _BidirectionalIterator __new_middle | |
| = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | |
| __len1 - __len11, __len22, __buffer, | |
| __buffer_size); | |
| std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, | |
| __len22, __buffer, __buffer_size, __comp); | |
| std::__merge_adaptive(__new_middle, __second_cut, __last, | |
| __len1 - __len11, | |
| __len2 - __len22, __buffer, | |
| __buffer_size, __comp); | |
| } | |
| } | |
| template<typename _BidirectionalIterator, typename _Distance, | |
| typename _Compare> | |
| void | |
| __merge_without_buffer(_BidirectionalIterator __first, | |
| _BidirectionalIterator __middle, | |
| _BidirectionalIterator __last, | |
| _Distance __len1, _Distance __len2, | |
| _Compare __comp) | |
| { | |
| if (__len1 == 0 || __len2 == 0) | |
| return; | |
| if (__len1 + __len2 == 2) | |
| { | |
| if (__comp(__middle, __first)) | |
| std::iter_swap(__first, __middle); | |
| return; | |
| } | |
| _BidirectionalIterator __first_cut = __first; | |
| _BidirectionalIterator __second_cut = __middle; | |
| _Distance __len11 = 0; | |
| _Distance __len22 = 0; | |
| if (__len1 > __len2) | |
| { | |
| __len11 = __len1 / 2; | |
| std::advance(__first_cut, __len11); | |
| __second_cut | |
| = std::__lower_bound(__middle, __last, *__first_cut, | |
| __gnu_cxx::__ops::__iter_comp_val(__comp)); | |
| __len22 = std::distance(__middle, __second_cut); | |
| } | |
| else | |
| { | |
| __len22 = __len2 / 2; | |
| std::advance(__second_cut, __len22); | |
| __first_cut | |
| = std::__upper_bound(__first, __middle, *__second_cut, | |
| __gnu_cxx::__ops::__val_comp_iter(__comp)); | |
| __len11 = std::distance(__first, __first_cut); | |
| } | |
| _BidirectionalIterator __new_middle | |
| = std::rotate(__first_cut, __middle, __second_cut); | |
| std::__merge_without_buffer(__first, __first_cut, __new_middle, | |
| __len11, __len22, __comp); | |
| std::__merge_without_buffer(__new_middle, __second_cut, __last, | |
| __len1 - __len11, __len2 - __len22, __comp); | |
| } | |
| template<typename _BidirectionalIterator, typename _Compare> | |
| void | |
| __inplace_merge(_BidirectionalIterator __first, | |
| _BidirectionalIterator __middle, | |
| _BidirectionalIterator __last, | |
| _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_BidirectionalIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_BidirectionalIterator>::difference_type | |
| _DistanceType; | |
| if (__first == __middle || __middle == __last) | |
| return; | |
| const _DistanceType __len1 = std::distance(__first, __middle); | |
| const _DistanceType __len2 = std::distance(__middle, __last); | |
| typedef _Temporary_buffer<_BidirectionalIterator, _ValueType> _TmpBuf; | |
| _TmpBuf __buf(__first, __len1 + __len2); | |
| if (__buf.begin() == 0) | |
| std::__merge_without_buffer | |
| (__first, __middle, __last, __len1, __len2, __comp); | |
| else | |
| std::__merge_adaptive | |
| (__first, __middle, __last, __len1, __len2, __buf.begin(), | |
| _DistanceType(__buf.size()), __comp); | |
| } | |
| # 2566 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator> | |
| inline void | |
| inplace_merge(_BidirectionalIterator __first, | |
| _BidirectionalIterator __middle, | |
| _BidirectionalIterator __last) | |
| { | |
| ; | |
| ; | |
| ; | |
| std::__inplace_merge(__first, __middle, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 2607 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator, typename _Compare> | |
| inline void | |
| inplace_merge(_BidirectionalIterator __first, | |
| _BidirectionalIterator __middle, | |
| _BidirectionalIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| std::__inplace_merge(__first, __middle, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _Compare> | |
| _OutputIterator | |
| __move_merge(_InputIterator __first1, _InputIterator __last1, | |
| _InputIterator __first2, _InputIterator __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| { | |
| if (__comp(__first2, __first1)) | |
| { | |
| *__result = std::move(*__first2); | |
| ++__first2; | |
| } | |
| else | |
| { | |
| *__result = std::move(*__first1); | |
| ++__first1; | |
| } | |
| ++__result; | |
| } | |
| return std::move(__first2, __last2, std::move(__first1, __last1, __result)) | |
| ; | |
| } | |
| template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, | |
| typename _Distance, typename _Compare> | |
| void | |
| __merge_sort_loop(_RandomAccessIterator1 __first, | |
| _RandomAccessIterator1 __last, | |
| _RandomAccessIterator2 __result, _Distance __step_size, | |
| _Compare __comp) | |
| { | |
| const _Distance __two_step = 2 * __step_size; | |
| while (__last - __first >= __two_step) | |
| { | |
| __result = std::__move_merge(__first, __first + __step_size, | |
| __first + __step_size, | |
| __first + __two_step, | |
| __result, __comp); | |
| __first += __two_step; | |
| } | |
| __step_size = std::min(_Distance(__last - __first), __step_size); | |
| std::__move_merge(__first, __first + __step_size, | |
| __first + __step_size, __last, __result, __comp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Distance, | |
| typename _Compare> | |
| void | |
| __chunk_insertion_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, | |
| _Distance __chunk_size, _Compare __comp) | |
| { | |
| while (__last - __first >= __chunk_size) | |
| { | |
| std::__insertion_sort(__first, __first + __chunk_size, __comp); | |
| __first += __chunk_size; | |
| } | |
| std::__insertion_sort(__first, __last, __comp); | |
| } | |
| enum { _S_chunk_size = 7 }; | |
| template<typename _RandomAccessIterator, typename _Pointer, typename _Compare> | |
| void | |
| __merge_sort_with_buffer(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, | |
| _Pointer __buffer, _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _Distance; | |
| const _Distance __len = __last - __first; | |
| const _Pointer __buffer_last = __buffer + __len; | |
| _Distance __step_size = _S_chunk_size; | |
| std::__chunk_insertion_sort(__first, __last, __step_size, __comp); | |
| while (__step_size < __len) | |
| { | |
| std::__merge_sort_loop(__first, __last, __buffer, | |
| __step_size, __comp); | |
| __step_size *= 2; | |
| std::__merge_sort_loop(__buffer, __buffer_last, __first, | |
| __step_size, __comp); | |
| __step_size *= 2; | |
| } | |
| } | |
| template<typename _RandomAccessIterator, typename _Pointer, | |
| typename _Distance, typename _Compare> | |
| void | |
| __stable_sort_adaptive(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, | |
| _Pointer __buffer, _Distance __buffer_size, | |
| _Compare __comp) | |
| { | |
| const _Distance __len = (__last - __first + 1) / 2; | |
| const _RandomAccessIterator __middle = __first + __len; | |
| if (__len > __buffer_size) | |
| { | |
| std::__stable_sort_adaptive(__first, __middle, __buffer, | |
| __buffer_size, __comp); | |
| std::__stable_sort_adaptive(__middle, __last, __buffer, | |
| __buffer_size, __comp); | |
| } | |
| else | |
| { | |
| std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); | |
| std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); | |
| } | |
| std::__merge_adaptive(__first, __middle, __last, | |
| _Distance(__middle - __first), | |
| _Distance(__last - __middle), | |
| __buffer, __buffer_size, | |
| __comp); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| void | |
| __inplace_stable_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| if (__last - __first < 15) | |
| { | |
| std::__insertion_sort(__first, __last, __comp); | |
| return; | |
| } | |
| _RandomAccessIterator __middle = __first + (__last - __first) / 2; | |
| std::__inplace_stable_sort(__first, __middle, __comp); | |
| std::__inplace_stable_sort(__middle, __last, __comp); | |
| std::__merge_without_buffer(__first, __middle, __last, | |
| __middle - __first, | |
| __last - __middle, | |
| __comp); | |
| } | |
| # 2779 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _Compare> | |
| bool | |
| __includes(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| if (__comp(__first2, __first1)) | |
| return false; | |
| else if (__comp(__first1, __first2)) | |
| ++__first1; | |
| else | |
| { | |
| ++__first1; | |
| ++__first2; | |
| } | |
| return __first2 == __last2; | |
| } | |
| # 2818 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2> | |
| inline bool | |
| includes(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__includes(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 2862 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _Compare> | |
| inline bool | |
| includes(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__includes(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| # 2897 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator, typename _Compare> | |
| bool | |
| __next_permutation(_BidirectionalIterator __first, | |
| _BidirectionalIterator __last, _Compare __comp) | |
| { | |
| if (__first == __last) | |
| return false; | |
| _BidirectionalIterator __i = __first; | |
| ++__i; | |
| if (__i == __last) | |
| return false; | |
| __i = __last; | |
| --__i; | |
| for(;;) | |
| { | |
| _BidirectionalIterator __ii = __i; | |
| --__i; | |
| if (__comp(__i, __ii)) | |
| { | |
| _BidirectionalIterator __j = __last; | |
| while (!__comp(__i, --__j)) | |
| {} | |
| std::iter_swap(__i, __j); | |
| std::__reverse(__ii, __last, | |
| std::__iterator_category(__first)); | |
| return true; | |
| } | |
| if (__i == __first) | |
| { | |
| std::__reverse(__first, __last, | |
| std::__iterator_category(__first)); | |
| return false; | |
| } | |
| } | |
| } | |
| # 2946 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator> | |
| inline bool | |
| next_permutation(_BidirectionalIterator __first, | |
| _BidirectionalIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__next_permutation | |
| (__first, __last, __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 2978 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator, typename _Compare> | |
| inline bool | |
| next_permutation(_BidirectionalIterator __first, | |
| _BidirectionalIterator __last, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__next_permutation | |
| (__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _BidirectionalIterator, typename _Compare> | |
| bool | |
| __prev_permutation(_BidirectionalIterator __first, | |
| _BidirectionalIterator __last, _Compare __comp) | |
| { | |
| if (__first == __last) | |
| return false; | |
| _BidirectionalIterator __i = __first; | |
| ++__i; | |
| if (__i == __last) | |
| return false; | |
| __i = __last; | |
| --__i; | |
| for(;;) | |
| { | |
| _BidirectionalIterator __ii = __i; | |
| --__i; | |
| if (__comp(__ii, __i)) | |
| { | |
| _BidirectionalIterator __j = __last; | |
| while (!__comp(--__j, __i)) | |
| {} | |
| std::iter_swap(__i, __j); | |
| std::__reverse(__ii, __last, | |
| std::__iterator_category(__first)); | |
| return true; | |
| } | |
| if (__i == __first) | |
| { | |
| std::__reverse(__first, __last, | |
| std::__iterator_category(__first)); | |
| return false; | |
| } | |
| } | |
| } | |
| # 3046 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator> | |
| inline bool | |
| prev_permutation(_BidirectionalIterator __first, | |
| _BidirectionalIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__prev_permutation(__first, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 3078 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _BidirectionalIterator, typename _Compare> | |
| inline bool | |
| prev_permutation(_BidirectionalIterator __first, | |
| _BidirectionalIterator __last, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__prev_permutation(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _Predicate, typename _Tp> | |
| _OutputIterator | |
| __replace_copy_if(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, | |
| _Predicate __pred, const _Tp& __new_value) | |
| { | |
| for (; __first != __last; ++__first, (void)++__result) | |
| if (__pred(__first)) | |
| *__result = __new_value; | |
| else | |
| *__result = *__first; | |
| return __result; | |
| } | |
| # 3128 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, typename _Tp> | |
| inline _OutputIterator | |
| replace_copy(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, | |
| const _Tp& __old_value, const _Tp& __new_value) | |
| { | |
| ; | |
| return std::__replace_copy_if(__first, __last, __result, | |
| __gnu_cxx::__ops::__iter_equals_val(__old_value), | |
| __new_value); | |
| } | |
| # 3162 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _Predicate, typename _Tp> | |
| inline _OutputIterator | |
| replace_copy_if(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, | |
| _Predicate __pred, const _Tp& __new_value) | |
| { | |
| ; | |
| return std::__replace_copy_if(__first, __last, __result, | |
| __gnu_cxx::__ops::__pred_iter(__pred), | |
| __new_value); | |
| } | |
| template<typename _InputIterator, typename _Predicate> | |
| typename iterator_traits<_InputIterator>::difference_type | |
| __count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) | |
| { | |
| typename iterator_traits<_InputIterator>::difference_type __n = 0; | |
| for (; __first != __last; ++__first) | |
| if (__pred(__first)) | |
| ++__n; | |
| return __n; | |
| } | |
| # 3201 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| inline bool | |
| is_sorted(_ForwardIterator __first, _ForwardIterator __last) | |
| { return std::is_sorted_until(__first, __last) == __last; } | |
| # 3215 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Compare> | |
| inline bool | |
| is_sorted(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { return std::is_sorted_until(__first, __last, __comp) == __last; } | |
| template<typename _ForwardIterator, typename _Compare> | |
| _ForwardIterator | |
| __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| if (__first == __last) | |
| return __last; | |
| _ForwardIterator __next = __first; | |
| for (++__next; __next != __last; __first = __next, (void)++__next) | |
| if (__comp(__next, __first)) | |
| return __next; | |
| return __next; | |
| } | |
| # 3244 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| inline _ForwardIterator | |
| is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__is_sorted_until(__first, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 3268 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Compare> | |
| inline _ForwardIterator | |
| is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__is_sorted_until(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| # 3293 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _Tp> | |
| constexpr | |
| inline pair<const _Tp&, const _Tp&> | |
| minmax(const _Tp& __a, const _Tp& __b) | |
| { | |
| return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a) | |
| : pair<const _Tp&, const _Tp&>(__a, __b); | |
| } | |
| # 3314 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| inline pair<const _Tp&, const _Tp&> | |
| minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) | |
| { | |
| return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) | |
| : pair<const _Tp&, const _Tp&>(__a, __b); | |
| } | |
| template<typename _ForwardIterator, typename _Compare> | |
| constexpr | |
| pair<_ForwardIterator, _ForwardIterator> | |
| __minmax_element(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| _ForwardIterator __next = __first; | |
| if (__first == __last | |
| || ++__next == __last) | |
| return std::make_pair(__first, __first); | |
| _ForwardIterator __min{}, __max{}; | |
| if (__comp(__next, __first)) | |
| { | |
| __min = __next; | |
| __max = __first; | |
| } | |
| else | |
| { | |
| __min = __first; | |
| __max = __next; | |
| } | |
| __first = __next; | |
| ++__first; | |
| while (__first != __last) | |
| { | |
| __next = __first; | |
| if (++__next == __last) | |
| { | |
| if (__comp(__first, __min)) | |
| __min = __first; | |
| else if (!__comp(__first, __max)) | |
| __max = __first; | |
| break; | |
| } | |
| if (__comp(__next, __first)) | |
| { | |
| if (__comp(__next, __min)) | |
| __min = __next; | |
| if (!__comp(__first, __max)) | |
| __max = __first; | |
| } | |
| else | |
| { | |
| if (__comp(__first, __min)) | |
| __min = __first; | |
| if (!__comp(__next, __max)) | |
| __max = __next; | |
| } | |
| __first = __next; | |
| ++__first; | |
| } | |
| return std::make_pair(__min, __max); | |
| } | |
| # 3394 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| constexpr | |
| inline pair<_ForwardIterator, _ForwardIterator> | |
| minmax_element(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__minmax_element(__first, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 3422 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Compare> | |
| constexpr | |
| inline pair<_ForwardIterator, _ForwardIterator> | |
| minmax_element(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__minmax_element(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _Tp> | |
| constexpr | |
| inline _Tp | |
| min(initializer_list<_Tp> __l) | |
| { return *std::min_element(__l.begin(), __l.end()); } | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| inline _Tp | |
| min(initializer_list<_Tp> __l, _Compare __comp) | |
| { return *std::min_element(__l.begin(), __l.end(), __comp); } | |
| template<typename _Tp> | |
| constexpr | |
| inline _Tp | |
| max(initializer_list<_Tp> __l) | |
| { return *std::max_element(__l.begin(), __l.end()); } | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| inline _Tp | |
| max(initializer_list<_Tp> __l, _Compare __comp) | |
| { return *std::max_element(__l.begin(), __l.end(), __comp); } | |
| template<typename _Tp> | |
| constexpr | |
| inline pair<_Tp, _Tp> | |
| minmax(initializer_list<_Tp> __l) | |
| { | |
| pair<const _Tp*, const _Tp*> __p = | |
| std::minmax_element(__l.begin(), __l.end()); | |
| return std::make_pair(*__p.first, *__p.second); | |
| } | |
| template<typename _Tp, typename _Compare> | |
| constexpr | |
| inline pair<_Tp, _Tp> | |
| minmax(initializer_list<_Tp> __l, _Compare __comp) | |
| { | |
| pair<const _Tp*, const _Tp*> __p = | |
| std::minmax_element(__l.begin(), __l.end(), __comp); | |
| return std::make_pair(*__p.first, *__p.second); | |
| } | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| bool | |
| __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _BinaryPredicate __pred) | |
| { | |
| for (; __first1 != __last1; ++__first1, (void)++__first2) | |
| if (!__pred(__first1, __first2)) | |
| break; | |
| if (__first1 == __last1) | |
| return true; | |
| _ForwardIterator2 __last2 = __first2; | |
| std::advance(__last2, std::distance(__first1, __last1)); | |
| for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan) | |
| { | |
| if (__scan != std::__find_if(__first1, __scan, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))) | |
| continue; | |
| auto __matches | |
| = std::__count_if(__first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)); | |
| if (0 == __matches || | |
| std::__count_if(__scan, __last1, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)) | |
| != __matches) | |
| return false; | |
| } | |
| return true; | |
| } | |
| # 3534 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2> | |
| inline bool | |
| is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2) | |
| { | |
| ; | |
| return std::__is_permutation(__first1, __last1, __first2, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 3565 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| inline bool | |
| is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _BinaryPredicate __pred) | |
| { | |
| ; | |
| return std::__is_permutation(__first1, __last1, __first2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred)); | |
| } | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| bool | |
| __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2, | |
| _BinaryPredicate __pred) | |
| { | |
| using _Cat1 | |
| = typename iterator_traits<_ForwardIterator1>::iterator_category; | |
| using _Cat2 | |
| = typename iterator_traits<_ForwardIterator2>::iterator_category; | |
| using _It1_is_RA = is_same<_Cat1, random_access_iterator_tag>; | |
| using _It2_is_RA = is_same<_Cat2, random_access_iterator_tag>; | |
| constexpr bool __ra_iters = _It1_is_RA() && _It2_is_RA(); | |
| if (__ra_iters) | |
| { | |
| auto __d1 = std::distance(__first1, __last1); | |
| auto __d2 = std::distance(__first2, __last2); | |
| if (__d1 != __d2) | |
| return false; | |
| } | |
| for (; __first1 != __last1 && __first2 != __last2; | |
| ++__first1, (void)++__first2) | |
| if (!__pred(__first1, __first2)) | |
| break; | |
| if (__ra_iters) | |
| { | |
| if (__first1 == __last1) | |
| return true; | |
| } | |
| else | |
| { | |
| auto __d1 = std::distance(__first1, __last1); | |
| auto __d2 = std::distance(__first2, __last2); | |
| if (__d1 == 0 && __d2 == 0) | |
| return true; | |
| if (__d1 != __d2) | |
| return false; | |
| } | |
| for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan) | |
| { | |
| if (__scan != std::__find_if(__first1, __scan, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))) | |
| continue; | |
| auto __matches = std::__count_if(__first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)); | |
| if (0 == __matches | |
| || std::__count_if(__scan, __last1, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)) | |
| != __matches) | |
| return false; | |
| } | |
| return true; | |
| } | |
| # 3658 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2> | |
| inline bool | |
| is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2) | |
| { | |
| ; | |
| ; | |
| return | |
| std::__is_permutation(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 3685 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| inline bool | |
| is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2, | |
| _BinaryPredicate __pred) | |
| { | |
| ; | |
| ; | |
| return std::__is_permutation(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__pred)); | |
| } | |
| # 3761 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _IntType, typename _UniformRandomBitGenerator> | |
| pair<_IntType, _IntType> | |
| __gen_two_uniform_ints(_IntType __b0, _IntType __b1, | |
| _UniformRandomBitGenerator&& __g) | |
| { | |
| _IntType __x | |
| = uniform_int_distribution<_IntType>{0, (__b0 * __b1) - 1}(__g); | |
| return std::make_pair(__x / __b1, __x % __b1); | |
| } | |
| # 3783 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator, | |
| typename _UniformRandomNumberGenerator> | |
| void | |
| shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _UniformRandomNumberGenerator&& __g) | |
| { | |
| ; | |
| if (__first == __last) | |
| return; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _DistanceType; | |
| typedef typename std::make_unsigned<_DistanceType>::type __ud_type; | |
| typedef typename std::uniform_int_distribution<__ud_type> __distr_type; | |
| typedef typename __distr_type::param_type __p_type; | |
| typedef typename remove_reference<_UniformRandomNumberGenerator>::type | |
| _Gen; | |
| typedef typename common_type<typename _Gen::result_type, __ud_type>::type | |
| __uc_type; | |
| const __uc_type __urngrange = __g.max() - __g.min(); | |
| const __uc_type __urange = __uc_type(__last - __first); | |
| if (__urngrange / __urange >= __urange) | |
| { | |
| _RandomAccessIterator __i = __first + 1; | |
| if ((__urange % 2) == 0) | |
| { | |
| __distr_type __d{0, 1}; | |
| std::iter_swap(__i++, __first + __d(__g)); | |
| } | |
| while (__i != __last) | |
| { | |
| const __uc_type __swap_range = __uc_type(__i - __first) + 1; | |
| const pair<__uc_type, __uc_type> __pospos = | |
| __gen_two_uniform_ints(__swap_range, __swap_range + 1, __g); | |
| std::iter_swap(__i++, __first + __pospos.first); | |
| std::iter_swap(__i++, __first + __pospos.second); | |
| } | |
| return; | |
| } | |
| __distr_type __d; | |
| for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) | |
| std::iter_swap(__i, __first + __d(__g, __p_type(0, __i - __first))); | |
| } | |
| # 3868 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Function> | |
| _Function | |
| for_each(_InputIterator __first, _InputIterator __last, _Function __f) | |
| { | |
| ; | |
| for (; __first != __last; ++__first) | |
| __f(*__first); | |
| return __f; | |
| } | |
| # 3889 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Tp> | |
| inline _InputIterator | |
| find(_InputIterator __first, _InputIterator __last, | |
| const _Tp& __val) | |
| { | |
| ; | |
| return std::__find_if(__first, __last, | |
| __gnu_cxx::__ops::__iter_equals_val(__val)); | |
| } | |
| # 3913 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline _InputIterator | |
| find_if(_InputIterator __first, _InputIterator __last, | |
| _Predicate __pred) | |
| { | |
| ; | |
| return std::__find_if(__first, __last, | |
| __gnu_cxx::__ops::__pred_iter(__pred)); | |
| } | |
| # 3944 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _ForwardIterator> | |
| _InputIterator | |
| find_first_of(_InputIterator __first1, _InputIterator __last1, | |
| _ForwardIterator __first2, _ForwardIterator __last2) | |
| { | |
| ; | |
| ; | |
| for (; __first1 != __last1; ++__first1) | |
| for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) | |
| if (*__first1 == *__iter) | |
| return __first1; | |
| return __last1; | |
| } | |
| # 3984 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _ForwardIterator, | |
| typename _BinaryPredicate> | |
| _InputIterator | |
| find_first_of(_InputIterator __first1, _InputIterator __last1, | |
| _ForwardIterator __first2, _ForwardIterator __last2, | |
| _BinaryPredicate __comp) | |
| { | |
| ; | |
| ; | |
| for (; __first1 != __last1; ++__first1) | |
| for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) | |
| if (__comp(*__first1, *__iter)) | |
| return __first1; | |
| return __last1; | |
| } | |
| # 4016 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| inline _ForwardIterator | |
| adjacent_find(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| ; | |
| return std::__adjacent_find(__first, __last, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 4041 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _BinaryPredicate> | |
| inline _ForwardIterator | |
| adjacent_find(_ForwardIterator __first, _ForwardIterator __last, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| return std::__adjacent_find(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__binary_pred)); | |
| } | |
| # 4066 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Tp> | |
| inline typename iterator_traits<_InputIterator>::difference_type | |
| count(_InputIterator __first, _InputIterator __last, const _Tp& __value) | |
| { | |
| ; | |
| return std::__count_if(__first, __last, | |
| __gnu_cxx::__ops::__iter_equals_val(__value)); | |
| } | |
| # 4089 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _Predicate> | |
| inline typename iterator_traits<_InputIterator>::difference_type | |
| count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) | |
| { | |
| ; | |
| return std::__count_if(__first, __last, | |
| __gnu_cxx::__ops::__pred_iter(__pred)); | |
| } | |
| # 4129 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2> | |
| inline _ForwardIterator1 | |
| search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2) | |
| { | |
| ; | |
| ; | |
| return std::__search(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_equal_to_iter()); | |
| } | |
| # 4168 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator1, typename _ForwardIterator2, | |
| typename _BinaryPredicate> | |
| inline _ForwardIterator1 | |
| search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, | |
| _ForwardIterator2 __first2, _ForwardIterator2 __last2, | |
| _BinaryPredicate __predicate) | |
| { | |
| ; | |
| ; | |
| return std::__search(__first1, __last1, __first2, __last2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__predicate)); | |
| } | |
| # 4203 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Integer, typename _Tp> | |
| inline _ForwardIterator | |
| search_n(_ForwardIterator __first, _ForwardIterator __last, | |
| _Integer __count, const _Tp& __val) | |
| { | |
| ; | |
| return std::__search_n(__first, __last, __count, | |
| __gnu_cxx::__ops::__iter_equals_val(__val)); | |
| } | |
| # 4236 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Integer, typename _Tp, | |
| typename _BinaryPredicate> | |
| inline _ForwardIterator | |
| search_n(_ForwardIterator __first, _ForwardIterator __last, | |
| _Integer __count, const _Tp& __val, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| return std::__search_n(__first, __last, __count, | |
| __gnu_cxx::__ops::__iter_comp_val(__binary_pred, __val)); | |
| } | |
| # 4284 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _UnaryOperation> | |
| _OutputIterator | |
| transform(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, _UnaryOperation __unary_op) | |
| { | |
| ; | |
| for (; __first != __last; ++__first, (void)++__result) | |
| *__result = __unary_op(*__first); | |
| return __result; | |
| } | |
| # 4321 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _BinaryOperation> | |
| _OutputIterator | |
| transform(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _OutputIterator __result, | |
| _BinaryOperation __binary_op) | |
| { | |
| ; | |
| for (; __first1 != __last1; ++__first1, (void)++__first2, ++__result) | |
| *__result = __binary_op(*__first1, *__first2); | |
| return __result; | |
| } | |
| # 4354 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Tp> | |
| void | |
| replace(_ForwardIterator __first, _ForwardIterator __last, | |
| const _Tp& __old_value, const _Tp& __new_value) | |
| { | |
| ; | |
| for (; __first != __last; ++__first) | |
| if (*__first == __old_value) | |
| *__first = __new_value; | |
| } | |
| # 4386 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Predicate, typename _Tp> | |
| void | |
| replace_if(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred, const _Tp& __new_value) | |
| { | |
| ; | |
| for (; __first != __last; ++__first) | |
| if (__pred(*__first)) | |
| *__first = __new_value; | |
| } | |
| # 4418 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Generator> | |
| void | |
| generate(_ForwardIterator __first, _ForwardIterator __last, | |
| _Generator __gen) | |
| { | |
| ; | |
| for (; __first != __last; ++__first) | |
| *__first = __gen(); | |
| } | |
| # 4449 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _OutputIterator, typename _Size, typename _Generator> | |
| _OutputIterator | |
| generate_n(_OutputIterator __first, _Size __n, _Generator __gen) | |
| { | |
| for (__decltype(__n + 0) __niter = __n; | |
| __niter > 0; --__niter, (void) ++__first) | |
| *__first = __gen(); | |
| return __first; | |
| } | |
| # 4485 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator> | |
| inline _OutputIterator | |
| unique_copy(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| if (__first == __last) | |
| return __result; | |
| return std::__unique_copy(__first, __last, __result, | |
| __gnu_cxx::__ops::__iter_equal_to_iter(), | |
| std::__iterator_category(__first), | |
| std::__iterator_category(__result)); | |
| } | |
| # 4525 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator, typename _OutputIterator, | |
| typename _BinaryPredicate> | |
| inline _OutputIterator | |
| unique_copy(_InputIterator __first, _InputIterator __last, | |
| _OutputIterator __result, | |
| _BinaryPredicate __binary_pred) | |
| { | |
| ; | |
| if (__first == __last) | |
| return __result; | |
| return std::__unique_copy(__first, __last, __result, | |
| __gnu_cxx::__ops::__iter_comp_iter(__binary_pred), | |
| std::__iterator_category(__first), | |
| std::__iterator_category(__result)); | |
| } | |
| # 4558 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| if (__first != __last) | |
| for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) | |
| { | |
| _RandomAccessIterator __j = __first | |
| + std::rand() % ((__i - __first) + 1); | |
| if (__i != __j) | |
| std::iter_swap(__i, __j); | |
| } | |
| } | |
| # 4593 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator, typename _RandomNumberGenerator> | |
| void | |
| random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _RandomNumberGenerator&& __rand) | |
| { | |
| ; | |
| if (__first == __last) | |
| return; | |
| for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) | |
| { | |
| _RandomAccessIterator __j = __first + __rand((__i - __first) + 1); | |
| if (__i != __j) | |
| std::iter_swap(__i, __j); | |
| } | |
| } | |
| # 4633 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Predicate> | |
| inline _ForwardIterator | |
| partition(_ForwardIterator __first, _ForwardIterator __last, | |
| _Predicate __pred) | |
| { | |
| ; | |
| return std::__partition(__first, __last, __pred, | |
| std::__iterator_category(__first)); | |
| } | |
| # 4666 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| partial_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __middle, | |
| _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| ; | |
| std::__partial_sort(__first, __middle, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 4704 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| partial_sort(_RandomAccessIterator __first, | |
| _RandomAccessIterator __middle, | |
| _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| std::__partial_sort(__first, __middle, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| # 4740 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, | |
| _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| ; | |
| if (__first == __last || __nth == __last) | |
| return; | |
| std::__introselect(__first, __nth, __last, | |
| std::__lg(__last - __first) * 2, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 4779 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, | |
| _RandomAccessIterator __last, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| if (__first == __last || __nth == __last) | |
| return; | |
| std::__introselect(__first, __nth, __last, | |
| std::__lg(__last - __first) * 2, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| # 4816 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| sort(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 4846 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| _OutputIterator | |
| __merge(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| { | |
| if (__comp(__first2, __first1)) | |
| { | |
| *__result = *__first2; | |
| ++__first2; | |
| } | |
| else | |
| { | |
| *__result = *__first1; | |
| ++__first1; | |
| } | |
| ++__result; | |
| } | |
| return std::copy(__first2, __last2, | |
| std::copy(__first1, __last1, __result)); | |
| } | |
| # 4907 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator> | |
| inline _OutputIterator | |
| merge(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__merge(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 4957 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| inline _OutputIterator | |
| merge(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__merge(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| typedef typename iterator_traits<_RandomAccessIterator>::value_type | |
| _ValueType; | |
| typedef typename iterator_traits<_RandomAccessIterator>::difference_type | |
| _DistanceType; | |
| typedef _Temporary_buffer<_RandomAccessIterator, _ValueType> _TmpBuf; | |
| _TmpBuf __buf(__first, std::distance(__first, __last)); | |
| if (__buf.begin() == 0) | |
| std::__inplace_stable_sort(__first, __last, __comp); | |
| else | |
| std::__stable_sort_adaptive(__first, __last, __buf.begin(), | |
| _DistanceType(__buf.size()), __comp); | |
| } | |
| # 5021 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator> | |
| inline void | |
| stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) | |
| { | |
| ; | |
| ; | |
| std::__stable_sort(__first, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5055 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _RandomAccessIterator, typename _Compare> | |
| inline void | |
| stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| std::__stable_sort(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, | |
| typename _Compare> | |
| _OutputIterator | |
| __set_union(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| { | |
| if (__comp(__first1, __first2)) | |
| { | |
| *__result = *__first1; | |
| ++__first1; | |
| } | |
| else if (__comp(__first2, __first1)) | |
| { | |
| *__result = *__first2; | |
| ++__first2; | |
| } | |
| else | |
| { | |
| *__result = *__first1; | |
| ++__first1; | |
| ++__first2; | |
| } | |
| ++__result; | |
| } | |
| return std::copy(__first2, __last2, | |
| std::copy(__first1, __last1, __result)); | |
| } | |
| # 5124 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator> | |
| inline _OutputIterator | |
| set_union(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_union(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5174 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| inline _OutputIterator | |
| set_union(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_union(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, | |
| typename _Compare> | |
| _OutputIterator | |
| __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| if (__comp(__first1, __first2)) | |
| ++__first1; | |
| else if (__comp(__first2, __first1)) | |
| ++__first2; | |
| else | |
| { | |
| *__result = *__first1; | |
| ++__first1; | |
| ++__first2; | |
| ++__result; | |
| } | |
| return __result; | |
| } | |
| # 5245 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator> | |
| inline _OutputIterator | |
| set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_intersection(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5294 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| inline _OutputIterator | |
| set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_intersection(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, | |
| typename _Compare> | |
| _OutputIterator | |
| __set_difference(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| if (__comp(__first1, __first2)) | |
| { | |
| *__result = *__first1; | |
| ++__first1; | |
| ++__result; | |
| } | |
| else if (__comp(__first2, __first1)) | |
| ++__first2; | |
| else | |
| { | |
| ++__first1; | |
| ++__first2; | |
| } | |
| return std::copy(__first1, __last1, __result); | |
| } | |
| # 5367 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator> | |
| inline _OutputIterator | |
| set_difference(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_difference(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5418 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| inline _OutputIterator | |
| set_difference(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_difference(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, | |
| typename _Compare> | |
| _OutputIterator | |
| __set_symmetric_difference(_InputIterator1 __first1, | |
| _InputIterator1 __last1, | |
| _InputIterator2 __first2, | |
| _InputIterator2 __last2, | |
| _OutputIterator __result, | |
| _Compare __comp) | |
| { | |
| while (__first1 != __last1 && __first2 != __last2) | |
| if (__comp(__first1, __first2)) | |
| { | |
| *__result = *__first1; | |
| ++__first1; | |
| ++__result; | |
| } | |
| else if (__comp(__first2, __first1)) | |
| { | |
| *__result = *__first2; | |
| ++__first2; | |
| ++__result; | |
| } | |
| else | |
| { | |
| ++__first1; | |
| ++__first2; | |
| } | |
| return std::copy(__first2, __last2, | |
| std::copy(__first1, __last1, __result)); | |
| } | |
| # 5497 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator> | |
| inline _OutputIterator | |
| set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_symmetric_difference(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5548 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _InputIterator1, typename _InputIterator2, | |
| typename _OutputIterator, typename _Compare> | |
| inline _OutputIterator | |
| set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, | |
| _InputIterator2 __first2, _InputIterator2 __last2, | |
| _OutputIterator __result, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| ; | |
| ; | |
| return std::__set_symmetric_difference(__first1, __last1, | |
| __first2, __last2, __result, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _ForwardIterator, typename _Compare> | |
| constexpr | |
| _ForwardIterator | |
| __min_element(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| if (__first == __last) | |
| return __first; | |
| _ForwardIterator __result = __first; | |
| while (++__first != __last) | |
| if (__comp(__first, __result)) | |
| __result = __first; | |
| return __result; | |
| } | |
| # 5601 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| constexpr | |
| _ForwardIterator | |
| inline min_element(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__min_element(__first, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5626 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Compare> | |
| constexpr | |
| inline _ForwardIterator | |
| min_element(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__min_element(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _ForwardIterator, typename _Compare> | |
| constexpr | |
| _ForwardIterator | |
| __max_element(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| if (__first == __last) return __first; | |
| _ForwardIterator __result = __first; | |
| while (++__first != __last) | |
| if (__comp(__result, __first)) | |
| __result = __first; | |
| return __result; | |
| } | |
| # 5665 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator> | |
| constexpr | |
| inline _ForwardIterator | |
| max_element(_ForwardIterator __first, _ForwardIterator __last) | |
| { | |
| ; | |
| ; | |
| return std::__max_element(__first, __last, | |
| __gnu_cxx::__ops::__iter_less_iter()); | |
| } | |
| # 5690 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| template<typename _ForwardIterator, typename _Compare> | |
| constexpr | |
| inline _ForwardIterator | |
| max_element(_ForwardIterator __first, _ForwardIterator __last, | |
| _Compare __comp) | |
| { | |
| ; | |
| ; | |
| return std::__max_element(__first, __last, | |
| __gnu_cxx::__ops::__iter_comp_iter(__comp)); | |
| } | |
| template<typename _InputIterator, typename _RandomAccessIterator, | |
| typename _Size, typename _UniformRandomBitGenerator> | |
| _RandomAccessIterator | |
| __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, | |
| _RandomAccessIterator __out, random_access_iterator_tag, | |
| _Size __n, _UniformRandomBitGenerator&& __g) | |
| { | |
| using __distrib_type = uniform_int_distribution<_Size>; | |
| using __param_type = typename __distrib_type::param_type; | |
| __distrib_type __d{}; | |
| _Size __sample_sz = 0; | |
| while (__first != __last && __sample_sz != __n) | |
| { | |
| __out[__sample_sz++] = *__first; | |
| ++__first; | |
| } | |
| for (auto __pop_sz = __sample_sz; __first != __last; | |
| ++__first, (void) ++__pop_sz) | |
| { | |
| const auto __k = __d(__g, __param_type{0, __pop_sz}); | |
| if (__k < __n) | |
| __out[__k] = *__first; | |
| } | |
| return __out + __sample_sz; | |
| } | |
| template<typename _ForwardIterator, typename _OutputIterator, typename _Cat, | |
| typename _Size, typename _UniformRandomBitGenerator> | |
| _OutputIterator | |
| __sample(_ForwardIterator __first, _ForwardIterator __last, | |
| forward_iterator_tag, | |
| _OutputIterator __out, _Cat, | |
| _Size __n, _UniformRandomBitGenerator&& __g) | |
| { | |
| using __distrib_type = uniform_int_distribution<_Size>; | |
| using __param_type = typename __distrib_type::param_type; | |
| using _USize = make_unsigned_t<_Size>; | |
| using _Gen = remove_reference_t<_UniformRandomBitGenerator>; | |
| using __uc_type = common_type_t<typename _Gen::result_type, _USize>; | |
| __distrib_type __d{}; | |
| _Size __unsampled_sz = std::distance(__first, __last); | |
| __n = std::min(__n, __unsampled_sz); | |
| const __uc_type __urngrange = __g.max() - __g.min(); | |
| if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz)) | |
| { | |
| while (__n != 0 && __unsampled_sz >= 2) | |
| { | |
| const pair<_Size, _Size> __p = | |
| __gen_two_uniform_ints(__unsampled_sz, __unsampled_sz - 1, __g); | |
| --__unsampled_sz; | |
| if (__p.first < __n) | |
| { | |
| *__out++ = *__first; | |
| --__n; | |
| } | |
| ++__first; | |
| if (__n == 0) break; | |
| --__unsampled_sz; | |
| if (__p.second < __n) | |
| { | |
| *__out++ = *__first; | |
| --__n; | |
| } | |
| ++__first; | |
| } | |
| } | |
| for (; __n != 0; ++__first) | |
| if (__d(__g, __param_type{0, --__unsampled_sz}) < __n) | |
| { | |
| *__out++ = *__first; | |
| --__n; | |
| } | |
| return __out; | |
| } | |
| # 5833 "/usr/sgug/include/c++/9/bits/stl_algo.h" 3 | |
| } | |
| # 63 "/usr/sgug/include/c++/9/algorithm" 2 3 | |
| # 39 "/usr/sgug/include/c++/9/regex" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bitset" 1 3 | |
| # 45 "/usr/sgug/include/c++/9/bitset" 3 | |
| # 46 "/usr/sgug/include/c++/9/bitset" 3 | |
| # 1 "/usr/sgug/include/c++/9/string" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/string" 3 | |
| # 37 "/usr/sgug/include/c++/9/string" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stringfwd.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/stringfwd.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/stringfwd.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<class _CharT> | |
| struct char_traits; | |
| template<> struct char_traits<char>; | |
| template<> struct char_traits<wchar_t>; | |
| template<> struct char_traits<char16_t>; | |
| template<> struct char_traits<char32_t>; | |
| namespace __cxx11 { | |
| template<typename _CharT, typename _Traits = char_traits<_CharT>, | |
| typename _Alloc = allocator<_CharT> > | |
| class basic_string; | |
| } | |
| typedef basic_string<char> string; | |
| typedef basic_string<wchar_t> wstring; | |
| # 93 "/usr/sgug/include/c++/9/bits/stringfwd.h" 3 | |
| typedef basic_string<char16_t> u16string; | |
| typedef basic_string<char32_t> u32string; | |
| } | |
| # 40 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/char_traits.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/char_traits.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/char_traits.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/postypes.h" 1 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| # 39 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/cwchar" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cwchar" 3 | |
| # 40 "/usr/sgug/include/c++/9/cwchar" 3 | |
| # 1 "/usr/include/wchar.h" 1 3 4 | |
| # 1 "/usr/include/locale_attr.h" 1 3 4 | |
| # 18 "/usr/include/locale_attr.h" 3 4 | |
| # 8 "/usr/include/wchar.h" 2 3 4 | |
| # 1 "/usr/include/wctype.h" 1 3 4 | |
| #ident "$Revision: 1.8 $" | |
| # 24 "/usr/include/wctype.h" 3 4 | |
| # 1 "/usr/include/wchar.h" 1 3 4 | |
| # 25 "/usr/include/wctype.h" 2 3 4 | |
| # 1 "/usr/include/internal/wctype_core.h" 1 3 4 | |
| #ident "$Revision: 1.7 $" | |
| # 36 "/usr/include/internal/wctype_core.h" 3 4 | |
| extern "C" { | |
| # 58 "/usr/include/internal/wctype_core.h" 3 4 | |
| typedef unsigned long wctrans_t; | |
| # 69 "/usr/include/internal/wctype_core.h" 3 4 | |
| typedef unsigned long wctype_t; | |
| # 82 "/usr/include/internal/wctype_core.h" 3 4 | |
| extern int iswalnum(wint_t); | |
| extern int iswalpha(wint_t); | |
| extern int iswblank(wint_t); | |
| extern int __iswblank( wint_t); | |
| extern int iswcntrl(wint_t); | |
| extern int iswdigit(wint_t); | |
| extern int iswgraph(wint_t); | |
| extern int iswlower(wint_t); | |
| extern int iswprint(wint_t); | |
| extern int iswpunct(wint_t); | |
| extern int iswspace(wint_t); | |
| extern int iswupper(wint_t); | |
| extern int iswxdigit(wint_t); | |
| extern int iswctype(wint_t, wctype_t); | |
| extern wctype_t wctype(const char *); | |
| extern wint_t towlower(wint_t); | |
| extern wint_t towupper(wint_t); | |
| extern wint_t towctrans (wint_t, wctrans_t); | |
| extern wctrans_t wctrans(const char *); | |
| #pragma optional towctrans | |
| #pragma optional wctrans | |
| extern int __iswctype( wint_t, | |
| wctype_t); | |
| extern wint_t | |
| __trwctype( wint_t, | |
| wctype_t); | |
| # 182 "/usr/include/internal/wctype_core.h" 3 4 | |
| extern int iswascii( wint_t); | |
| extern int isphonogram( wint_t); | |
| extern int isideogram( wint_t); | |
| extern int isenglish( wint_t); | |
| extern int isnumber( wint_t); | |
| extern int isspecial( wint_t); | |
| # 227 "/usr/include/internal/wctype_core.h" 3 4 | |
| } | |
| # 26 "/usr/include/wctype.h" 2 3 4 | |
| # 10 "/usr/include/wchar.h" 2 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 1 3 4 | |
| # 12 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| #ident "$Revision: 1.13 $" | |
| # 48 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| extern "C" { | |
| # 79 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| typedef unsigned long wuchar_t; | |
| # 117 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| typedef char mbstate_t; | |
| # 141 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| extern int iswalnum(wint_t); | |
| extern int iswalpha(wint_t); | |
| extern int iswblank(wint_t); | |
| #pragma optional iswblank | |
| extern int __iswblank( wint_t); | |
| extern int iswcntrl(wint_t); | |
| extern int iswdigit(wint_t); | |
| extern int iswgraph(wint_t); | |
| extern int iswlower(wint_t); | |
| extern int iswprint(wint_t); | |
| extern int iswpunct(wint_t); | |
| extern int iswspace(wint_t); | |
| extern int iswupper(wint_t); | |
| extern int iswxdigit(wint_t); | |
| extern int iswctype(wint_t, wctype_t); | |
| extern wctype_t wctype(const char *); | |
| extern wint_t towlower(wint_t); | |
| extern wint_t towupper(wint_t); | |
| extern int fwprintf(FILE * __restrict, const wchar_t * __restrict, ...); | |
| extern int fwscanf(FILE * __restrict, const wchar_t * __restrict, ...); | |
| extern int swprintf(wchar_t * __restrict, size_t, const wchar_t * __restrict, ...); | |
| extern int swscanf(const wchar_t * __restrict, const wchar_t * __restrict, ...); | |
| extern int vfwprintf(FILE * __restrict, const wchar_t * __restrict, va_list); | |
| extern int vswprintf(wchar_t * __restrict, size_t, const wchar_t * __restrict, va_list); | |
| extern int vwprintf(const wchar_t * __restrict, va_list); | |
| extern int wprintf(const wchar_t * __restrict, ...); | |
| extern int wscanf(const wchar_t * __restrict, ...); | |
| #pragma optional fwprintf | |
| #pragma optional fwscanf | |
| #pragma optional swprintf | |
| #pragma optional swscanf | |
| #pragma optional vfwprintf | |
| #pragma optional vswprintf | |
| #pragma optional vwprintf | |
| #pragma optional wprintf | |
| #pragma optional wscanf | |
| extern int vfwscanf(FILE * __restrict, const wchar_t * __restrict, va_list); | |
| extern int vswscanf(const wchar_t * __restrict, const wchar_t * __restrict, va_list); | |
| extern int vwscanf(const wchar_t * __restrict, va_list); | |
| #pragma optional vfwscanf | |
| #pragma optional vswscanf | |
| #pragma optional vwscanf | |
| extern wint_t fgetwc(FILE *); | |
| extern wchar_t *fgetws(wchar_t * __restrict, int, FILE * __restrict); | |
| extern wint_t fputwc(wint_t, FILE *); | |
| extern int fputws(const wchar_t * __restrict, FILE * __restrict); | |
| extern int fwide(FILE *, int); | |
| extern wint_t getwc(FILE *); | |
| extern wint_t getwchar(void); | |
| extern wint_t putwc(wint_t, FILE *); | |
| extern wint_t putwchar(wint_t); | |
| extern wint_t ungetwc(wint_t, FILE *); | |
| extern wchar_t *getws(wchar_t *); | |
| extern int putws(wchar_t *); | |
| # 238 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| extern double wcstod(const wchar_t * __restrict, wchar_t ** __restrict); | |
| extern float wcstof(const wchar_t * __restrict, wchar_t ** __restrict); | |
| extern long double wcstold(const wchar_t * __restrict, wchar_t ** __restrict); | |
| #pragma optional wcstof | |
| #pragma optional wcstold | |
| extern long wcstol(const wchar_t * __restrict, wchar_t ** __restrict, int); | |
| extern long long wcstoll(const wchar_t * __restrict, wchar_t ** __restrict, int); | |
| extern unsigned long wcstoul(const wchar_t * __restrict, wchar_t ** __restrict, int); | |
| extern unsigned long long wcstoull(const wchar_t * __restrict, wchar_t ** __restrict, int); | |
| extern wchar_t *wcscpy(wchar_t * __restrict, const wchar_t * __restrict); | |
| extern wchar_t *wcsncpy(wchar_t * __restrict, const wchar_t * __restrict, size_t); | |
| extern wchar_t *wmemcpy(wchar_t * __restrict, const wchar_t * __restrict, size_t); | |
| extern wchar_t *wmemmove(wchar_t *, const wchar_t *, size_t); | |
| #pragma optional wmemcpy | |
| #pragma optional wmemmove | |
| extern wchar_t *wcscat(wchar_t * __restrict, const wchar_t * __restrict); | |
| extern wchar_t *wcsncat(wchar_t * __restrict, const wchar_t * __restrict, size_t); | |
| extern int wcscmp(const wchar_t *, const wchar_t *); | |
| extern int wcscoll(const wchar_t *, const wchar_t *); | |
| extern int wcsncmp(const wchar_t *, const wchar_t *, size_t); | |
| extern size_t wcsxfrm(wchar_t * __restrict, const wchar_t * __restrict, size_t); | |
| extern int wmemcmp(const wchar_t *, const wchar_t *, size_t); | |
| #pragma optional wmemcmp | |
| extern wchar_t *wcschr(const wchar_t *, wint_t); | |
| extern size_t wcscspn(const wchar_t *, const wchar_t *); | |
| extern wchar_t *wcspbrk(const wchar_t *, const wchar_t *); | |
| extern wchar_t *wcsrchr(const wchar_t *, wchar_t); | |
| extern size_t wcsspn(const wchar_t *, const wchar_t *); | |
| extern wchar_t *wcsstr(const wchar_t *, const wchar_t *); | |
| extern wchar_t * wcstok(wchar_t *, const wchar_t *); | |
| extern wchar_t *_xpg4_wcstok(wchar_t *, const wchar_t *); | |
| #pragma optional _xpg4_wcstok | |
| # 356 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| extern wchar_t *wmemchr(const wchar_t *, wchar_t, size_t); | |
| #pragma optional wmemchr | |
| extern size_t wcslen(const wchar_t *); | |
| extern wchar_t *wmemset(wchar_t *, wchar_t, size_t); | |
| #pragma optional wmemset | |
| # 384 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| extern size_t _xpg5_wcsftime(wchar_t * __restrict, size_t, const wchar_t * __restrict, const struct tm * __restrict); | |
| # 402 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| static __inline size_t wcsftime(wchar_t * __restrict _wcs, size_t _maxsize, const wchar_t * __restrict _format, const struct tm * __restrict _timptr) | |
| { | |
| return(_xpg5_wcsftime(_wcs, _maxsize, _format, _timptr)); | |
| } | |
| #pragma optional _xpg5_wcsftime | |
| # 428 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/internal/wchar_core.h" 3 4 | |
| extern wint_t btowc(int); | |
| extern int wctob(wint_t); | |
| #pragma optional btowc | |
| #pragma optional wctob | |
| extern int mbsinit(const mbstate_t *); | |
| #pragma optional mbsinit | |
| extern size_t mbrlen(const char * __restrict, size_t, mbstate_t * __restrict); | |
| extern size_t mbrtowc(wchar_t * __restrict, const char * __restrict, size_t, mbstate_t * __restrict); | |
| extern size_t wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict); | |
| #pragma optional mbrlen | |
| #pragma optional mbrtowc | |
| #pragma optional wcrtomb | |
| extern size_t mbsrtowcs(wchar_t * __restrict, const char ** __restrict, size_t, mbstate_t * __restrict); | |
| extern size_t wcsrtombs(char * __restrict, const wchar_t ** __restrict, size_t, mbstate_t * __restrict); | |
| #pragma optional mbsrtowcs | |
| #pragma optional wcsrtombs | |
| extern int wcwidth(wchar_t); | |
| extern int wcswidth(const wchar_t *, size_t); | |
| extern wchar_t *wcswcs(const wchar_t *, const wchar_t *); | |
| #pragma optional fwide | |
| extern wchar_t *wcstok_r(wchar_t *, const wchar_t *, wchar_t **); | |
| } | |
| # 12 "/usr/include/wchar.h" 2 3 4 | |
| # 45 "/usr/sgug/include/c++/9/cwchar" 2 3 | |
| # 62 "/usr/sgug/include/c++/9/cwchar" 3 | |
| namespace std | |
| { | |
| using ::mbstate_t; | |
| } | |
| # 135 "/usr/sgug/include/c++/9/cwchar" 3 | |
| extern "C++" | |
| { | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| using ::wint_t; | |
| using ::btowc; | |
| using ::fgetwc; | |
| using ::fgetws; | |
| using ::fputwc; | |
| using ::fputws; | |
| using ::fwide; | |
| using ::fwprintf; | |
| using ::fwscanf; | |
| using ::getwc; | |
| using ::getwchar; | |
| using ::mbrlen; | |
| using ::mbrtowc; | |
| using ::mbsinit; | |
| using ::mbsrtowcs; | |
| using ::putwc; | |
| using ::putwchar; | |
| using ::swprintf; | |
| using ::swscanf; | |
| using ::ungetwc; | |
| using ::vfwprintf; | |
| using ::vfwscanf; | |
| using ::vswprintf; | |
| using ::vswscanf; | |
| using ::vwprintf; | |
| using ::vwscanf; | |
| using ::wcrtomb; | |
| using ::wcscat; | |
| using ::wcscmp; | |
| using ::wcscoll; | |
| using ::wcscpy; | |
| using ::wcscspn; | |
| using ::wcsftime; | |
| using ::wcslen; | |
| using ::wcsncat; | |
| using ::wcsncmp; | |
| using ::wcsncpy; | |
| using ::wcsrtombs; | |
| using ::wcsspn; | |
| using ::wcstod; | |
| using ::wcstof; | |
| using ::wcstok; | |
| using ::wcstol; | |
| using ::wcstoul; | |
| using ::wcsxfrm; | |
| using ::wctob; | |
| using ::wmemcmp; | |
| using ::wmemcpy; | |
| using ::wmemmove; | |
| using ::wmemset; | |
| using ::wprintf; | |
| using ::wscanf; | |
| using ::wcschr; | |
| using ::wcspbrk; | |
| using ::wcsrchr; | |
| using ::wcsstr; | |
| using ::wmemchr; | |
| inline wchar_t* | |
| wcschr(wchar_t* __p, wchar_t __c) | |
| { return wcschr(const_cast<const wchar_t*>(__p), __c); } | |
| inline wchar_t* | |
| wcspbrk(wchar_t* __s1, const wchar_t* __s2) | |
| { return wcspbrk(const_cast<const wchar_t*>(__s1), __s2); } | |
| inline wchar_t* | |
| wcsrchr(wchar_t* __p, wchar_t __c) | |
| { return wcsrchr(const_cast<const wchar_t*>(__p), __c); } | |
| inline wchar_t* | |
| wcsstr(wchar_t* __s1, const wchar_t* __s2) | |
| { return wcsstr(const_cast<const wchar_t*>(__s1), __s2); } | |
| inline wchar_t* | |
| wmemchr(wchar_t* __p, wchar_t __c, size_t __n) | |
| { return wmemchr(const_cast<const wchar_t*>(__p), __c, __n); } | |
| } | |
| } | |
| namespace __gnu_cxx | |
| { | |
| using ::wcstold; | |
| # 260 "/usr/sgug/include/c++/9/cwchar" 3 | |
| using ::wcstoll; | |
| using ::wcstoull; | |
| } | |
| namespace std | |
| { | |
| using ::__gnu_cxx::wcstold; | |
| using ::__gnu_cxx::wcstoll; | |
| using ::__gnu_cxx::wcstoull; | |
| } | |
| # 280 "/usr/sgug/include/c++/9/cwchar" 3 | |
| namespace std | |
| { | |
| using std::wcstof; | |
| using std::vfwscanf; | |
| using std::vswscanf; | |
| using std::vwscanf; | |
| using std::wcstold; | |
| using std::wcstoll; | |
| using std::wcstoull; | |
| } | |
| # 41 "/usr/sgug/include/c++/9/bits/postypes.h" 2 3 | |
| # 68 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 90 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| typedef long long streamoff; | |
| typedef ptrdiff_t streamsize; | |
| # 111 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| template<typename _StateT> | |
| class fpos | |
| { | |
| private: | |
| streamoff _M_off; | |
| _StateT _M_state; | |
| public: | |
| fpos() | |
| : _M_off(0), _M_state() { } | |
| # 133 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| fpos(streamoff __off) | |
| : _M_off(__off), _M_state() { } | |
| fpos(const fpos&) = default; | |
| fpos& operator=(const fpos&) = default; | |
| ~fpos() = default; | |
| operator streamoff() const { return _M_off; } | |
| void | |
| state(_StateT __st) | |
| { _M_state = __st; } | |
| _StateT | |
| state() const | |
| { return _M_state; } | |
| fpos& | |
| operator+=(streamoff __off) | |
| { | |
| _M_off += __off; | |
| return *this; | |
| } | |
| fpos& | |
| operator-=(streamoff __off) | |
| { | |
| _M_off -= __off; | |
| return *this; | |
| } | |
| fpos | |
| operator+(streamoff __off) const | |
| { | |
| fpos __pos(*this); | |
| __pos += __off; | |
| return __pos; | |
| } | |
| fpos | |
| operator-(streamoff __off) const | |
| { | |
| fpos __pos(*this); | |
| __pos -= __off; | |
| return __pos; | |
| } | |
| streamoff | |
| operator-(const fpos& __other) const | |
| { return _M_off - __other._M_off; } | |
| }; | |
| template<typename _StateT> | |
| inline bool | |
| operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) | |
| { return streamoff(__lhs) == streamoff(__rhs); } | |
| template<typename _StateT> | |
| inline bool | |
| operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) | |
| { return streamoff(__lhs) != streamoff(__rhs); } | |
| typedef fpos<mbstate_t> streampos; | |
| typedef fpos<mbstate_t> wstreampos; | |
| # 245 "/usr/sgug/include/c++/9/bits/postypes.h" 3 | |
| typedef fpos<mbstate_t> u16streampos; | |
| typedef fpos<mbstate_t> u32streampos; | |
| } | |
| # 41 "/usr/sgug/include/c++/9/bits/char_traits.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/cwchar" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cwchar" 3 | |
| # 40 "/usr/sgug/include/c++/9/cwchar" 3 | |
| # 42 "/usr/sgug/include/c++/9/bits/char_traits.h" 2 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 61 "/usr/sgug/include/c++/9/bits/char_traits.h" 3 | |
| template<typename _CharT> | |
| struct _Char_types | |
| { | |
| typedef unsigned long int_type; | |
| typedef std::streampos pos_type; | |
| typedef std::streamoff off_type; | |
| typedef std::mbstate_t state_type; | |
| }; | |
| # 86 "/usr/sgug/include/c++/9/bits/char_traits.h" 3 | |
| template<typename _CharT> | |
| struct char_traits | |
| { | |
| typedef _CharT char_type; | |
| typedef typename _Char_types<_CharT>::int_type int_type; | |
| typedef typename _Char_types<_CharT>::pos_type pos_type; | |
| typedef typename _Char_types<_CharT>::off_type off_type; | |
| typedef typename _Char_types<_CharT>::state_type state_type; | |
| static constexpr void | |
| assign(char_type& __c1, const char_type& __c2) | |
| { __c1 = __c2; } | |
| static constexpr bool | |
| eq(const char_type& __c1, const char_type& __c2) | |
| { return __c1 == __c2; } | |
| static constexpr bool | |
| lt(const char_type& __c1, const char_type& __c2) | |
| { return __c1 < __c2; } | |
| static constexpr int | |
| compare(const char_type* __s1, const char_type* __s2, std::size_t __n); | |
| static constexpr std::size_t | |
| length(const char_type* __s); | |
| static constexpr const char_type* | |
| find(const char_type* __s, std::size_t __n, const char_type& __a); | |
| static char_type* | |
| move(char_type* __s1, const char_type* __s2, std::size_t __n); | |
| static char_type* | |
| copy(char_type* __s1, const char_type* __s2, std::size_t __n); | |
| static char_type* | |
| assign(char_type* __s, std::size_t __n, char_type __a); | |
| static constexpr char_type | |
| to_char_type(const int_type& __c) | |
| { return static_cast<char_type>(__c); } | |
| static constexpr int_type | |
| to_int_type(const char_type& __c) | |
| { return static_cast<int_type>(__c); } | |
| static constexpr bool | |
| eq_int_type(const int_type& __c1, const int_type& __c2) | |
| { return __c1 == __c2; } | |
| static constexpr int_type | |
| eof() | |
| { return static_cast<int_type>(-1); } | |
| static constexpr int_type | |
| not_eof(const int_type& __c) | |
| { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); } | |
| }; | |
| template<typename _CharT> | |
| constexpr int | |
| char_traits<_CharT>:: | |
| compare(const char_type* __s1, const char_type* __s2, std::size_t __n) | |
| { | |
| for (std::size_t __i = 0; __i < __n; ++__i) | |
| if (lt(__s1[__i], __s2[__i])) | |
| return -1; | |
| else if (lt(__s2[__i], __s1[__i])) | |
| return 1; | |
| return 0; | |
| } | |
| template<typename _CharT> | |
| constexpr std::size_t | |
| char_traits<_CharT>:: | |
| length(const char_type* __p) | |
| { | |
| std::size_t __i = 0; | |
| while (!eq(__p[__i], char_type())) | |
| ++__i; | |
| return __i; | |
| } | |
| template<typename _CharT> | |
| constexpr const typename char_traits<_CharT>::char_type* | |
| char_traits<_CharT>:: | |
| find(const char_type* __s, std::size_t __n, const char_type& __a) | |
| { | |
| for (std::size_t __i = 0; __i < __n; ++__i) | |
| if (eq(__s[__i], __a)) | |
| return __s + __i; | |
| return 0; | |
| } | |
| template<typename _CharT> | |
| typename char_traits<_CharT>::char_type* | |
| char_traits<_CharT>:: | |
| move(char_type* __s1, const char_type* __s2, std::size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return static_cast<_CharT*>(__builtin_memmove(__s1, __s2, | |
| __n * sizeof(char_type))); | |
| } | |
| template<typename _CharT> | |
| typename char_traits<_CharT>::char_type* | |
| char_traits<_CharT>:: | |
| copy(char_type* __s1, const char_type* __s2, std::size_t __n) | |
| { | |
| std::copy(__s2, __s2 + __n, __s1); | |
| return __s1; | |
| } | |
| template<typename _CharT> | |
| typename char_traits<_CharT>::char_type* | |
| char_traits<_CharT>:: | |
| assign(char_type* __s, std::size_t __n, char_type __a) | |
| { | |
| std::fill_n(__s, __n, __a); | |
| return __s; | |
| } | |
| } | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 283 "/usr/sgug/include/c++/9/bits/char_traits.h" 3 | |
| template<class _CharT> | |
| struct char_traits : public __gnu_cxx::char_traits<_CharT> | |
| { }; | |
| template<> | |
| struct char_traits<char> | |
| { | |
| typedef char char_type; | |
| typedef int int_type; | |
| typedef streampos pos_type; | |
| typedef streamoff off_type; | |
| typedef mbstate_t state_type; | |
| static void | |
| assign(char_type& __c1, const char_type& __c2) noexcept | |
| { __c1 = __c2; } | |
| static constexpr bool | |
| eq(const char_type& __c1, const char_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr bool | |
| lt(const char_type& __c1, const char_type& __c2) noexcept | |
| { | |
| return (static_cast<unsigned char>(__c1) | |
| < static_cast<unsigned char>(__c2)); | |
| } | |
| static int | |
| compare(const char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return 0; | |
| return __builtin_memcmp(__s1, __s2, __n); | |
| } | |
| static size_t | |
| length(const char_type* __s) | |
| { | |
| return __builtin_strlen(__s); | |
| } | |
| static const char_type* | |
| find(const char_type* __s, size_t __n, const char_type& __a) | |
| { | |
| if (__n == 0) | |
| return 0; | |
| return static_cast<const char_type*>(__builtin_memchr(__s, __a, __n)); | |
| } | |
| static char_type* | |
| move(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return static_cast<char_type*>(__builtin_memmove(__s1, __s2, __n)); | |
| } | |
| static char_type* | |
| copy(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return static_cast<char_type*>(__builtin_memcpy(__s1, __s2, __n)); | |
| } | |
| static char_type* | |
| assign(char_type* __s, size_t __n, char_type __a) | |
| { | |
| if (__n == 0) | |
| return __s; | |
| return static_cast<char_type*>(__builtin_memset(__s, __a, __n)); | |
| } | |
| static constexpr char_type | |
| to_char_type(const int_type& __c) noexcept | |
| { return static_cast<char_type>(__c); } | |
| static constexpr int_type | |
| to_int_type(const char_type& __c) noexcept | |
| { return static_cast<int_type>(static_cast<unsigned char>(__c)); } | |
| static constexpr bool | |
| eq_int_type(const int_type& __c1, const int_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr int_type | |
| eof() noexcept | |
| { return static_cast<int_type>(-1); } | |
| static constexpr int_type | |
| not_eof(const int_type& __c) noexcept | |
| { return (__c == eof()) ? 0 : __c; } | |
| }; | |
| template<> | |
| struct char_traits<wchar_t> | |
| { | |
| typedef wchar_t char_type; | |
| typedef wint_t int_type; | |
| typedef streamoff off_type; | |
| typedef wstreampos pos_type; | |
| typedef mbstate_t state_type; | |
| static void | |
| assign(char_type& __c1, const char_type& __c2) noexcept | |
| { __c1 = __c2; } | |
| static constexpr bool | |
| eq(const char_type& __c1, const char_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr bool | |
| lt(const char_type& __c1, const char_type& __c2) noexcept | |
| { return __c1 < __c2; } | |
| static int | |
| compare(const char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return 0; | |
| return wmemcmp(__s1, __s2, __n); | |
| } | |
| static size_t | |
| length(const char_type* __s) | |
| { | |
| return wcslen(__s); | |
| } | |
| static const char_type* | |
| find(const char_type* __s, size_t __n, const char_type& __a) | |
| { | |
| if (__n == 0) | |
| return 0; | |
| return wmemchr(__s, __a, __n); | |
| } | |
| static char_type* | |
| move(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return wmemmove(__s1, __s2, __n); | |
| } | |
| static char_type* | |
| copy(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return wmemcpy(__s1, __s2, __n); | |
| } | |
| static char_type* | |
| assign(char_type* __s, size_t __n, char_type __a) | |
| { | |
| if (__n == 0) | |
| return __s; | |
| return wmemset(__s, __a, __n); | |
| } | |
| static constexpr char_type | |
| to_char_type(const int_type& __c) noexcept | |
| { return char_type(__c); } | |
| static constexpr int_type | |
| to_int_type(const char_type& __c) noexcept | |
| { return int_type(__c); } | |
| static constexpr bool | |
| eq_int_type(const int_type& __c1, const int_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr int_type | |
| eof() noexcept | |
| { return static_cast<int_type>((-1)); } | |
| static constexpr int_type | |
| not_eof(const int_type& __c) noexcept | |
| { return eq_int_type(__c, eof()) ? 0 : __c; } | |
| }; | |
| # 616 "/usr/sgug/include/c++/9/bits/char_traits.h" 3 | |
| } | |
| # 1 "/usr/sgug/include/c++/9/cstdint" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/cstdint" 3 | |
| # 33 "/usr/sgug/include/c++/9/cstdint" 3 | |
| # 41 "/usr/sgug/include/c++/9/cstdint" 3 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stdint.h" 1 3 4 | |
| # 9 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stdint.h" 3 4 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/stdint.h" 1 3 4 | |
| # 51 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/stdint.h" 3 4 | |
| typedef signed char int_least8_t; | |
| typedef unsigned char uint_least8_t; | |
| typedef signed short int_least16_t; | |
| typedef unsigned short uint_least16_t; | |
| typedef signed int int_least32_t; | |
| typedef unsigned int uint_least32_t; | |
| typedef signed long long int_least64_t; | |
| typedef unsigned long long uint_least64_t; | |
| typedef signed char int_fast8_t; | |
| typedef unsigned char uint_fast8_t; | |
| typedef signed short int_fast16_t; | |
| typedef unsigned short uint_fast16_t; | |
| typedef signed int int_fast32_t; | |
| typedef unsigned int uint_fast32_t; | |
| typedef signed long long int_fast64_t; | |
| typedef unsigned long long uint_fast64_t; | |
| # 10 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include/stdint.h" 2 3 4 | |
| # 42 "/usr/sgug/include/c++/9/cstdint" 2 3 | |
| namespace std | |
| { | |
| using ::int8_t; | |
| using ::int16_t; | |
| using ::int32_t; | |
| using ::int64_t; | |
| using ::int_fast8_t; | |
| using ::int_fast16_t; | |
| using ::int_fast32_t; | |
| using ::int_fast64_t; | |
| using ::int_least8_t; | |
| using ::int_least16_t; | |
| using ::int_least32_t; | |
| using ::int_least64_t; | |
| using ::intmax_t; | |
| using ::intptr_t; | |
| using ::uint8_t; | |
| using ::uint16_t; | |
| using ::uint32_t; | |
| using ::uint64_t; | |
| using ::uint_fast8_t; | |
| using ::uint_fast16_t; | |
| using ::uint_fast32_t; | |
| using ::uint_fast64_t; | |
| using ::uint_least8_t; | |
| using ::uint_least16_t; | |
| using ::uint_least32_t; | |
| using ::uint_least64_t; | |
| using ::uintmax_t; | |
| using ::uintptr_t; | |
| } | |
| # 622 "/usr/sgug/include/c++/9/bits/char_traits.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<> | |
| struct char_traits<char16_t> | |
| { | |
| typedef char16_t char_type; | |
| typedef uint_least16_t int_type; | |
| typedef streamoff off_type; | |
| typedef u16streampos pos_type; | |
| typedef mbstate_t state_type; | |
| static void | |
| assign(char_type& __c1, const char_type& __c2) noexcept | |
| { __c1 = __c2; } | |
| static constexpr bool | |
| eq(const char_type& __c1, const char_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr bool | |
| lt(const char_type& __c1, const char_type& __c2) noexcept | |
| { 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 (lt(__s1[__i], __s2[__i])) | |
| return -1; | |
| else if (lt(__s2[__i], __s1[__i])) | |
| return 1; | |
| return 0; | |
| } | |
| static size_t | |
| length(const char_type* __s) | |
| { | |
| size_t __i = 0; | |
| while (!eq(__s[__i], char_type())) | |
| ++__i; | |
| return __i; | |
| } | |
| static const char_type* | |
| find(const char_type* __s, size_t __n, const char_type& __a) | |
| { | |
| for (size_t __i = 0; __i < __n; ++__i) | |
| if (eq(__s[__i], __a)) | |
| return __s + __i; | |
| return 0; | |
| } | |
| static char_type* | |
| move(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return (static_cast<char_type*> | |
| (__builtin_memmove(__s1, __s2, __n * sizeof(char_type)))); | |
| } | |
| static char_type* | |
| copy(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return (static_cast<char_type*> | |
| (__builtin_memcpy(__s1, __s2, __n * sizeof(char_type)))); | |
| } | |
| static char_type* | |
| assign(char_type* __s, size_t __n, char_type __a) | |
| { | |
| for (size_t __i = 0; __i < __n; ++__i) | |
| assign(__s[__i], __a); | |
| return __s; | |
| } | |
| static constexpr char_type | |
| to_char_type(const int_type& __c) noexcept | |
| { return char_type(__c); } | |
| static constexpr int_type | |
| to_int_type(const char_type& __c) noexcept | |
| { return __c == eof() ? int_type(0xfffd) : int_type(__c); } | |
| static constexpr bool | |
| eq_int_type(const int_type& __c1, const int_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr int_type | |
| eof() noexcept | |
| { return static_cast<int_type>(-1); } | |
| static constexpr int_type | |
| not_eof(const int_type& __c) noexcept | |
| { return eq_int_type(__c, eof()) ? 0 : __c; } | |
| }; | |
| template<> | |
| struct char_traits<char32_t> | |
| { | |
| typedef char32_t char_type; | |
| typedef uint_least32_t int_type; | |
| typedef streamoff off_type; | |
| typedef u32streampos pos_type; | |
| typedef mbstate_t state_type; | |
| static void | |
| assign(char_type& __c1, const char_type& __c2) noexcept | |
| { __c1 = __c2; } | |
| static constexpr bool | |
| eq(const char_type& __c1, const char_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr bool | |
| lt(const char_type& __c1, const char_type& __c2) noexcept | |
| { 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 (lt(__s1[__i], __s2[__i])) | |
| return -1; | |
| else if (lt(__s2[__i], __s1[__i])) | |
| return 1; | |
| return 0; | |
| } | |
| static size_t | |
| length(const char_type* __s) | |
| { | |
| size_t __i = 0; | |
| while (!eq(__s[__i], char_type())) | |
| ++__i; | |
| return __i; | |
| } | |
| static const char_type* | |
| find(const char_type* __s, size_t __n, const char_type& __a) | |
| { | |
| for (size_t __i = 0; __i < __n; ++__i) | |
| if (eq(__s[__i], __a)) | |
| return __s + __i; | |
| return 0; | |
| } | |
| static char_type* | |
| move(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return (static_cast<char_type*> | |
| (__builtin_memmove(__s1, __s2, __n * sizeof(char_type)))); | |
| } | |
| static char_type* | |
| copy(char_type* __s1, const char_type* __s2, size_t __n) | |
| { | |
| if (__n == 0) | |
| return __s1; | |
| return (static_cast<char_type*> | |
| (__builtin_memcpy(__s1, __s2, __n * sizeof(char_type)))); | |
| } | |
| static char_type* | |
| assign(char_type* __s, size_t __n, char_type __a) | |
| { | |
| for (size_t __i = 0; __i < __n; ++__i) | |
| assign(__s[__i], __a); | |
| return __s; | |
| } | |
| static constexpr char_type | |
| to_char_type(const int_type& __c) noexcept | |
| { return char_type(__c); } | |
| static constexpr int_type | |
| to_int_type(const char_type& __c) noexcept | |
| { return int_type(__c); } | |
| static constexpr bool | |
| eq_int_type(const int_type& __c1, const int_type& __c2) noexcept | |
| { return __c1 == __c2; } | |
| static constexpr int_type | |
| eof() noexcept | |
| { return static_cast<int_type>(-1); } | |
| static constexpr int_type | |
| not_eof(const int_type& __c) noexcept | |
| { return eq_int_type(__c, eof()) ? 0 : __c; } | |
| }; | |
| } | |
| # 41 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/allocator.h" 1 3 | |
| # 46 "/usr/sgug/include/c++/9/bits/allocator.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++allocator.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++allocator.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/ext/new_allocator.h" 1 3 | |
| # 40 "/usr/sgug/include/c++/9/ext/new_allocator.h" 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| using std::size_t; | |
| using std::ptrdiff_t; | |
| # 57 "/usr/sgug/include/c++/9/ext/new_allocator.h" 3 | |
| template<typename _Tp> | |
| class new_allocator | |
| { | |
| public: | |
| typedef size_t size_type; | |
| typedef ptrdiff_t difference_type; | |
| typedef _Tp* pointer; | |
| typedef const _Tp* const_pointer; | |
| typedef _Tp& reference; | |
| typedef const _Tp& const_reference; | |
| typedef _Tp value_type; | |
| template<typename _Tp1> | |
| struct rebind | |
| { typedef new_allocator<_Tp1> other; }; | |
| typedef std::true_type propagate_on_container_move_assignment; | |
| new_allocator() noexcept { } | |
| new_allocator(const new_allocator&) noexcept { } | |
| template<typename _Tp1> | |
| new_allocator(const new_allocator<_Tp1>&) noexcept { } | |
| ~new_allocator() noexcept { } | |
| pointer | |
| address(reference __x) const noexcept | |
| { return std::__addressof(__x); } | |
| const_pointer | |
| address(const_reference __x) const noexcept | |
| { return std::__addressof(__x); } | |
| pointer | |
| allocate(size_type __n, const void* = static_cast<const void*>(0)) | |
| { | |
| if (__n > this->max_size()) | |
| std::__throw_bad_alloc(); | |
| # 114 "/usr/sgug/include/c++/9/ext/new_allocator.h" 3 | |
| return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp))); | |
| } | |
| void | |
| deallocate(pointer __p, size_type) | |
| { | |
| ::operator delete(__p); | |
| } | |
| size_type | |
| max_size() const noexcept | |
| { | |
| return size_t(0x7fffffff) / sizeof(_Tp); | |
| } | |
| template<typename _Up, typename... _Args> | |
| void | |
| construct(_Up* __p, _Args&&... __args) | |
| noexcept(noexcept(::new((void *)__p) | |
| _Up(std::forward<_Args>(__args)...))) | |
| { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | |
| template<typename _Up> | |
| void | |
| destroy(_Up* __p) | |
| noexcept(noexcept( __p->~_Up())) | |
| { __p->~_Up(); } | |
| # 165 "/usr/sgug/include/c++/9/ext/new_allocator.h" 3 | |
| template<typename _Up> | |
| friend bool | |
| operator==(const new_allocator&, const new_allocator<_Up>&) | |
| noexcept | |
| { return true; } | |
| template<typename _Up> | |
| friend bool | |
| operator!=(const new_allocator&, const new_allocator<_Up>&) | |
| noexcept | |
| { return false; } | |
| }; | |
| } | |
| # 34 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++allocator.h" 2 3 | |
| namespace std | |
| { | |
| # 47 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++allocator.h" 3 | |
| template<typename _Tp> | |
| using __allocator_base = __gnu_cxx::new_allocator<_Tp>; | |
| } | |
| # 47 "/usr/sgug/include/c++/9/bits/allocator.h" 2 3 | |
| # 57 "/usr/sgug/include/c++/9/bits/allocator.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<> | |
| class allocator<void> | |
| { | |
| public: | |
| typedef size_t size_type; | |
| typedef ptrdiff_t difference_type; | |
| typedef void* pointer; | |
| typedef const void* const_pointer; | |
| typedef void value_type; | |
| template<typename _Tp1> | |
| struct rebind | |
| { typedef allocator<_Tp1> other; }; | |
| typedef true_type propagate_on_container_move_assignment; | |
| typedef true_type is_always_equal; | |
| template<typename _Up, typename... _Args> | |
| void | |
| construct(_Up* __p, _Args&&... __args) | |
| noexcept(noexcept(::new((void *)__p) | |
| _Up(std::forward<_Args>(__args)...))) | |
| { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | |
| template<typename _Up> | |
| void | |
| destroy(_Up* __p) | |
| noexcept(noexcept(__p->~_Up())) | |
| { __p->~_Up(); } | |
| }; | |
| # 111 "/usr/sgug/include/c++/9/bits/allocator.h" 3 | |
| template<typename _Tp> | |
| class allocator : public __allocator_base<_Tp> | |
| { | |
| public: | |
| typedef size_t size_type; | |
| typedef ptrdiff_t difference_type; | |
| typedef _Tp* pointer; | |
| typedef const _Tp* const_pointer; | |
| typedef _Tp& reference; | |
| typedef const _Tp& const_reference; | |
| typedef _Tp value_type; | |
| template<typename _Tp1> | |
| struct rebind | |
| { typedef allocator<_Tp1> other; }; | |
| typedef true_type propagate_on_container_move_assignment; | |
| typedef true_type is_always_equal; | |
| allocator() noexcept { } | |
| allocator(const allocator& __a) noexcept | |
| : __allocator_base<_Tp>(__a) { } | |
| allocator& operator=(const allocator&) = default; | |
| template<typename _Tp1> | |
| allocator(const allocator<_Tp1>&) noexcept { } | |
| ~allocator() noexcept { } | |
| friend bool | |
| operator==(const allocator&, const allocator&) noexcept | |
| { return true; } | |
| friend bool | |
| operator!=(const allocator&, const allocator&) noexcept | |
| { return false; } | |
| }; | |
| template<typename _T1, typename _T2> | |
| inline bool | |
| operator==(const allocator<_T1>&, const allocator<_T2>&) | |
| noexcept | |
| { return true; } | |
| template<typename _T1, typename _T2> | |
| inline bool | |
| operator!=(const allocator<_T1>&, const allocator<_T2>&) | |
| noexcept | |
| { return false; } | |
| template<typename _Tp> | |
| class allocator<const _Tp> | |
| { | |
| public: | |
| typedef _Tp value_type; | |
| template<typename _Up> allocator(const allocator<_Up>&) { } | |
| }; | |
| template<typename _Tp> | |
| class allocator<volatile _Tp> | |
| { | |
| public: | |
| typedef _Tp value_type; | |
| template<typename _Up> allocator(const allocator<_Up>&) { } | |
| }; | |
| template<typename _Tp> | |
| class allocator<const volatile _Tp> | |
| { | |
| public: | |
| typedef _Tp value_type; | |
| template<typename _Up> allocator(const allocator<_Up>&) { } | |
| }; | |
| extern template class allocator<char>; | |
| extern template class allocator<wchar_t>; | |
| template<typename _Alloc, bool = __is_empty(_Alloc)> | |
| struct __alloc_swap | |
| { static void _S_do_it(_Alloc&, _Alloc&) noexcept { } }; | |
| template<typename _Alloc> | |
| struct __alloc_swap<_Alloc, false> | |
| { | |
| static void | |
| _S_do_it(_Alloc& __one, _Alloc& __two) noexcept | |
| { | |
| if (__one != __two) | |
| swap(__one, __two); | |
| } | |
| }; | |
| template<typename _Alloc, bool = __is_empty(_Alloc)> | |
| struct __alloc_neq | |
| { | |
| static bool | |
| _S_do_it(const _Alloc&, const _Alloc&) | |
| { return false; } | |
| }; | |
| template<typename _Alloc> | |
| struct __alloc_neq<_Alloc, false> | |
| { | |
| static bool | |
| _S_do_it(const _Alloc& __one, const _Alloc& __two) | |
| { return __one != __two; } | |
| }; | |
| template<typename _Tp, bool | |
| = __or_<is_copy_constructible<typename _Tp::value_type>, | |
| is_nothrow_move_constructible<typename _Tp::value_type>>::value> | |
| struct __shrink_to_fit_aux | |
| { static bool _S_do_it(_Tp&) noexcept { return false; } }; | |
| template<typename _Tp> | |
| struct __shrink_to_fit_aux<_Tp, true> | |
| { | |
| static bool | |
| _S_do_it(_Tp& __c) noexcept | |
| { | |
| # 274 "/usr/sgug/include/c++/9/bits/allocator.h" 3 | |
| return false; | |
| } | |
| }; | |
| } | |
| # 42 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/localefwd.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/localefwd.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/localefwd.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++locale.h" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++locale.h" 3 | |
| # 40 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++locale.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/clocale" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/clocale" 3 | |
| # 40 "/usr/sgug/include/c++/9/clocale" 3 | |
| # 51 "/usr/sgug/include/c++/9/clocale" 3 | |
| namespace std | |
| { | |
| using ::lconv; | |
| using ::setlocale; | |
| using ::localeconv; | |
| } | |
| # 42 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/c++locale.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| typedef int* __c_locale; | |
| inline int | |
| __convert_from_v(const __c_locale&, char* __out, | |
| const int __size __attribute__((__unused__)), | |
| const char* __fmt, ...) | |
| { | |
| char* __old = std::setlocale(1, 0); | |
| char* __sav = 0; | |
| if (__builtin_strcmp(__old, "C")) | |
| { | |
| const size_t __len = __builtin_strlen(__old) + 1; | |
| __sav = new char[__len]; | |
| __builtin_memcpy(__sav, __old, __len); | |
| std::setlocale(1, "C"); | |
| } | |
| __builtin_va_list __args; | |
| __builtin_va_start(__args, __fmt); | |
| const int __ret = __builtin_vsnprintf(__out, __size, __fmt, __args); | |
| __builtin_va_end(__args); | |
| if (__sav) | |
| { | |
| std::setlocale(1, __sav); | |
| delete [] __sav; | |
| } | |
| return __ret; | |
| } | |
| } | |
| # 41 "/usr/sgug/include/c++/9/bits/localefwd.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/iosfwd" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/iosfwd" 3 | |
| # 37 "/usr/sgug/include/c++/9/iosfwd" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 74 "/usr/sgug/include/c++/9/iosfwd" 3 | |
| class ios_base; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_ios; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_streambuf; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_istream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_ostream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_iostream; | |
| namespace __cxx11 { | |
| template<typename _CharT, typename _Traits = char_traits<_CharT>, | |
| typename _Alloc = allocator<_CharT> > | |
| class basic_stringbuf; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT>, | |
| typename _Alloc = allocator<_CharT> > | |
| class basic_istringstream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT>, | |
| typename _Alloc = allocator<_CharT> > | |
| class basic_ostringstream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT>, | |
| typename _Alloc = allocator<_CharT> > | |
| class basic_stringstream; | |
| } | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_filebuf; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_ifstream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_ofstream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class basic_fstream; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class istreambuf_iterator; | |
| template<typename _CharT, typename _Traits = char_traits<_CharT> > | |
| class ostreambuf_iterator; | |
| typedef basic_ios<char> ios; | |
| typedef basic_streambuf<char> streambuf; | |
| typedef basic_istream<char> istream; | |
| typedef basic_ostream<char> ostream; | |
| typedef basic_iostream<char> iostream; | |
| typedef basic_stringbuf<char> stringbuf; | |
| typedef basic_istringstream<char> istringstream; | |
| typedef basic_ostringstream<char> ostringstream; | |
| typedef basic_stringstream<char> stringstream; | |
| typedef basic_filebuf<char> filebuf; | |
| typedef basic_ifstream<char> ifstream; | |
| typedef basic_ofstream<char> ofstream; | |
| typedef basic_fstream<char> fstream; | |
| typedef basic_ios<wchar_t> wios; | |
| typedef basic_streambuf<wchar_t> wstreambuf; | |
| typedef basic_istream<wchar_t> wistream; | |
| typedef basic_ostream<wchar_t> wostream; | |
| typedef basic_iostream<wchar_t> wiostream; | |
| typedef basic_stringbuf<wchar_t> wstringbuf; | |
| typedef basic_istringstream<wchar_t> wistringstream; | |
| typedef basic_ostringstream<wchar_t> wostringstream; | |
| typedef basic_stringstream<wchar_t> wstringstream; | |
| typedef basic_filebuf<wchar_t> wfilebuf; | |
| typedef basic_ifstream<wchar_t> wifstream; | |
| typedef basic_ofstream<wchar_t> wofstream; | |
| typedef basic_fstream<wchar_t> wfstream; | |
| } | |
| # 42 "/usr/sgug/include/c++/9/bits/localefwd.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/cctype" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cctype" 3 | |
| # 40 "/usr/sgug/include/c++/9/cctype" 3 | |
| # 62 "/usr/sgug/include/c++/9/cctype" 3 | |
| namespace std | |
| { | |
| using ::isalnum; | |
| using ::isalpha; | |
| using ::iscntrl; | |
| using ::isdigit; | |
| using ::isgraph; | |
| using ::islower; | |
| using ::isprint; | |
| using ::ispunct; | |
| using ::isspace; | |
| using ::isupper; | |
| using ::isxdigit; | |
| using ::tolower; | |
| using ::toupper; | |
| } | |
| namespace std | |
| { | |
| using ::isblank; | |
| } | |
| # 43 "/usr/sgug/include/c++/9/bits/localefwd.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 55 "/usr/sgug/include/c++/9/bits/localefwd.h" 3 | |
| class locale; | |
| template<typename _Facet> | |
| bool | |
| has_facet(const locale&) throw(); | |
| template<typename _Facet> | |
| const _Facet& | |
| use_facet(const locale&); | |
| template<typename _CharT> | |
| bool | |
| isspace(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isprint(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| iscntrl(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isupper(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| islower(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isalpha(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isdigit(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| ispunct(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isxdigit(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isalnum(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isgraph(_CharT, const locale&); | |
| template<typename _CharT> | |
| bool | |
| isblank(_CharT, const locale&); | |
| template<typename _CharT> | |
| _CharT | |
| toupper(_CharT, const locale&); | |
| template<typename _CharT> | |
| _CharT | |
| tolower(_CharT, const locale&); | |
| class ctype_base; | |
| template<typename _CharT> | |
| class ctype; | |
| template<> class ctype<char>; | |
| template<> class ctype<wchar_t>; | |
| template<typename _CharT> | |
| class ctype_byname; | |
| class codecvt_base; | |
| template<typename _InternT, typename _ExternT, typename _StateT> | |
| class codecvt; | |
| template<> class codecvt<char, char, mbstate_t>; | |
| template<> class codecvt<wchar_t, char, mbstate_t>; | |
| template<> class codecvt<char16_t, char, mbstate_t>; | |
| template<> class codecvt<char32_t, char, mbstate_t>; | |
| template<typename _InternT, typename _ExternT, typename _StateT> | |
| class codecvt_byname; | |
| template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > | |
| class num_get; | |
| template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > | |
| class num_put; | |
| namespace __cxx11 { | |
| template<typename _CharT> class numpunct; | |
| template<typename _CharT> class numpunct_byname; | |
| } | |
| namespace __cxx11 { | |
| template<typename _CharT> | |
| class collate; | |
| template<typename _CharT> | |
| class collate_byname; | |
| } | |
| class time_base; | |
| namespace __cxx11 { | |
| 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; | |
| namespace __cxx11 { | |
| template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > | |
| class money_get; | |
| template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > | |
| class money_put; | |
| } | |
| namespace __cxx11 { | |
| template<typename _CharT, bool _Intl = false> | |
| class moneypunct; | |
| template<typename _CharT, bool _Intl = false> | |
| class moneypunct_byname; | |
| } | |
| class messages_base; | |
| namespace __cxx11 { | |
| template<typename _CharT> | |
| class messages; | |
| template<typename _CharT> | |
| class messages_byname; | |
| } | |
| } | |
| # 44 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/ostream_insert.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/ostream_insert.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/ostream_insert.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/cxxabi_forced.h" 1 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/cxxabi_forced.h" 3 | |
| # 35 "/usr/sgug/include/c++/9/bits/cxxabi_forced.h" 3 | |
| #pragma GCC visibility push(default) | |
| namespace __cxxabiv1 | |
| { | |
| class __forced_unwind | |
| { | |
| virtual ~__forced_unwind() throw(); | |
| virtual void __pure_dummy() = 0; | |
| }; | |
| } | |
| #pragma GCC visibility pop | |
| # 37 "/usr/sgug/include/c++/9/bits/ostream_insert.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits> | |
| inline void | |
| __ostream_write(basic_ostream<_CharT, _Traits>& __out, | |
| const _CharT* __s, streamsize __n) | |
| { | |
| typedef basic_ostream<_CharT, _Traits> __ostream_type; | |
| typedef typename __ostream_type::ios_base __ios_base; | |
| const streamsize __put = __out.rdbuf()->sputn(__s, __n); | |
| if (__put != __n) | |
| __out.setstate(__ios_base::badbit); | |
| } | |
| template<typename _CharT, typename _Traits> | |
| inline void | |
| __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n) | |
| { | |
| typedef basic_ostream<_CharT, _Traits> __ostream_type; | |
| typedef typename __ostream_type::ios_base __ios_base; | |
| const _CharT __c = __out.fill(); | |
| for (; __n > 0; --__n) | |
| { | |
| const typename _Traits::int_type __put = __out.rdbuf()->sputc(__c); | |
| if (_Traits::eq_int_type(__put, _Traits::eof())) | |
| { | |
| __out.setstate(__ios_base::badbit); | |
| break; | |
| } | |
| } | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| __ostream_insert(basic_ostream<_CharT, _Traits>& __out, | |
| const _CharT* __s, streamsize __n) | |
| { | |
| typedef basic_ostream<_CharT, _Traits> __ostream_type; | |
| typedef typename __ostream_type::ios_base __ios_base; | |
| typename __ostream_type::sentry __cerb(__out); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| const streamsize __w = __out.width(); | |
| if (__w > __n) | |
| { | |
| const bool __left = ((__out.flags() | |
| & __ios_base::adjustfield) | |
| == __ios_base::left); | |
| if (!__left) | |
| __ostream_fill(__out, __w - __n); | |
| if (__out.good()) | |
| __ostream_write(__out, __s, __n); | |
| if (__left && __out.good()) | |
| __ostream_fill(__out, __w - __n); | |
| } | |
| else | |
| __ostream_write(__out, __s, __n); | |
| __out.width(0); | |
| } | |
| if (false) | |
| { | |
| __out._M_setstate(__ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { __out._M_setstate(__ios_base::badbit); } | |
| } | |
| return __out; | |
| } | |
| extern template ostream& __ostream_insert(ostream&, const char*, streamsize); | |
| extern template wostream& __ostream_insert(wostream&, const wchar_t*, | |
| streamsize); | |
| } | |
| # 45 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stl_function.h" 1 3 | |
| # 63 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 104 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| template<typename _Arg, typename _Result> | |
| struct unary_function | |
| { | |
| typedef _Arg argument_type; | |
| typedef _Result result_type; | |
| }; | |
| template<typename _Arg1, typename _Arg2, typename _Result> | |
| struct binary_function | |
| { | |
| typedef _Arg1 first_argument_type; | |
| typedef _Arg2 second_argument_type; | |
| typedef _Result result_type; | |
| }; | |
| # 144 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| struct __is_transparent; | |
| template<typename _Tp = void> | |
| struct plus; | |
| template<typename _Tp = void> | |
| struct minus; | |
| template<typename _Tp = void> | |
| struct multiplies; | |
| template<typename _Tp = void> | |
| struct divides; | |
| template<typename _Tp = void> | |
| struct modulus; | |
| template<typename _Tp = void> | |
| struct negate; | |
| template<typename _Tp> | |
| struct plus : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x + __y; } | |
| }; | |
| template<typename _Tp> | |
| struct minus : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x - __y; } | |
| }; | |
| template<typename _Tp> | |
| struct multiplies : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x * __y; } | |
| }; | |
| template<typename _Tp> | |
| struct divides : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x / __y; } | |
| }; | |
| template<typename _Tp> | |
| struct modulus : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x % __y; } | |
| }; | |
| template<typename _Tp> | |
| struct negate : public unary_function<_Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x) const | |
| { return -__x; } | |
| }; | |
| template<> | |
| struct plus<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) + std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) + std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) + std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct minus<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) - std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) - std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) - std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct multiplies<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) * std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) * std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) * std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct divides<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) / std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) / std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) / std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct modulus<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) % std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) % std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) % std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct negate<void> | |
| { | |
| template <typename _Tp> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t) const | |
| noexcept(noexcept(-std::forward<_Tp>(__t))) | |
| -> decltype(-std::forward<_Tp>(__t)) | |
| { return -std::forward<_Tp>(__t); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| # 330 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| template<typename _Tp = void> | |
| struct equal_to; | |
| template<typename _Tp = void> | |
| struct not_equal_to; | |
| template<typename _Tp = void> | |
| struct greater; | |
| template<typename _Tp = void> | |
| struct less; | |
| template<typename _Tp = void> | |
| struct greater_equal; | |
| template<typename _Tp = void> | |
| struct less_equal; | |
| template<typename _Tp> | |
| struct equal_to : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x == __y; } | |
| }; | |
| template<typename _Tp> | |
| struct not_equal_to : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x != __y; } | |
| }; | |
| template<typename _Tp> | |
| struct greater : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x > __y; } | |
| }; | |
| template<typename _Tp> | |
| struct less : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x < __y; } | |
| }; | |
| template<typename _Tp> | |
| struct greater_equal : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x >= __y; } | |
| }; | |
| template<typename _Tp> | |
| struct less_equal : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x <= __y; } | |
| }; | |
| template<typename _Tp> | |
| struct greater<_Tp*> : public binary_function<_Tp*, _Tp*, bool> | |
| { | |
| constexpr bool | |
| operator()(_Tp* __x, _Tp* __y) const noexcept | |
| { | |
| if (__builtin_is_constant_evaluated()) | |
| return __x > __y; | |
| return (long unsigned int)__x > (long unsigned int)__y; | |
| } | |
| }; | |
| template<typename _Tp> | |
| struct less<_Tp*> : public binary_function<_Tp*, _Tp*, bool> | |
| { | |
| constexpr bool | |
| operator()(_Tp* __x, _Tp* __y) const noexcept | |
| { | |
| if (__builtin_is_constant_evaluated()) | |
| return __x < __y; | |
| return (long unsigned int)__x < (long unsigned int)__y; | |
| } | |
| }; | |
| template<typename _Tp> | |
| struct greater_equal<_Tp*> : public binary_function<_Tp*, _Tp*, bool> | |
| { | |
| constexpr bool | |
| operator()(_Tp* __x, _Tp* __y) const noexcept | |
| { | |
| if (__builtin_is_constant_evaluated()) | |
| return __x >= __y; | |
| return (long unsigned int)__x >= (long unsigned int)__y; | |
| } | |
| }; | |
| template<typename _Tp> | |
| struct less_equal<_Tp*> : public binary_function<_Tp*, _Tp*, bool> | |
| { | |
| constexpr bool | |
| operator()(_Tp* __x, _Tp* __y) const noexcept | |
| { | |
| if (__builtin_is_constant_evaluated()) | |
| return __x <= __y; | |
| return (long unsigned int)__x <= (long unsigned int)__y; | |
| } | |
| }; | |
| template<> | |
| struct equal_to<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) == std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct not_equal_to<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) != std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) != std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) != std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct greater<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) > std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) > std::forward<_Up>(__u)) | |
| { | |
| return _S_cmp(std::forward<_Tp>(__t), std::forward<_Up>(__u), | |
| __ptr_cmp<_Tp, _Up>{}); | |
| } | |
| template<typename _Tp, typename _Up> | |
| constexpr bool | |
| operator()(_Tp* __t, _Up* __u) const noexcept | |
| { return greater<common_type_t<_Tp*, _Up*>>{}(__t, __u); } | |
| typedef __is_transparent is_transparent; | |
| private: | |
| template <typename _Tp, typename _Up> | |
| static constexpr decltype(auto) | |
| _S_cmp(_Tp&& __t, _Up&& __u, false_type) | |
| { return std::forward<_Tp>(__t) > std::forward<_Up>(__u); } | |
| template <typename _Tp, typename _Up> | |
| static constexpr bool | |
| _S_cmp(_Tp&& __t, _Up&& __u, true_type) noexcept | |
| { | |
| return greater<const volatile void*>{}( | |
| static_cast<const volatile void*>(std::forward<_Tp>(__t)), | |
| static_cast<const volatile void*>(std::forward<_Up>(__u))); | |
| } | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded2 : true_type { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded2<_Tp, _Up, __void_t< | |
| decltype(std::declval<_Tp>().operator>(std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded : __not_overloaded2<_Tp, _Up> { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded<_Tp, _Up, __void_t< | |
| decltype(operator>(std::declval<_Tp>(), std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up> | |
| using __ptr_cmp = __and_<__not_overloaded<_Tp, _Up>, | |
| is_convertible<_Tp, const volatile void*>, | |
| is_convertible<_Up, const volatile void*>>; | |
| }; | |
| template<> | |
| struct less<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) < std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) < std::forward<_Up>(__u)) | |
| { | |
| return _S_cmp(std::forward<_Tp>(__t), std::forward<_Up>(__u), | |
| __ptr_cmp<_Tp, _Up>{}); | |
| } | |
| template<typename _Tp, typename _Up> | |
| constexpr bool | |
| operator()(_Tp* __t, _Up* __u) const noexcept | |
| { return less<common_type_t<_Tp*, _Up*>>{}(__t, __u); } | |
| typedef __is_transparent is_transparent; | |
| private: | |
| template <typename _Tp, typename _Up> | |
| static constexpr decltype(auto) | |
| _S_cmp(_Tp&& __t, _Up&& __u, false_type) | |
| { return std::forward<_Tp>(__t) < std::forward<_Up>(__u); } | |
| template <typename _Tp, typename _Up> | |
| static constexpr bool | |
| _S_cmp(_Tp&& __t, _Up&& __u, true_type) noexcept | |
| { | |
| return less<const volatile void*>{}( | |
| static_cast<const volatile void*>(std::forward<_Tp>(__t)), | |
| static_cast<const volatile void*>(std::forward<_Up>(__u))); | |
| } | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded2 : true_type { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded2<_Tp, _Up, __void_t< | |
| decltype(std::declval<_Tp>().operator<(std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded : __not_overloaded2<_Tp, _Up> { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded<_Tp, _Up, __void_t< | |
| decltype(operator<(std::declval<_Tp>(), std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up> | |
| using __ptr_cmp = __and_<__not_overloaded<_Tp, _Up>, | |
| is_convertible<_Tp, const volatile void*>, | |
| is_convertible<_Up, const volatile void*>>; | |
| }; | |
| template<> | |
| struct greater_equal<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) >= std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) >= std::forward<_Up>(__u)) | |
| { | |
| return _S_cmp(std::forward<_Tp>(__t), std::forward<_Up>(__u), | |
| __ptr_cmp<_Tp, _Up>{}); | |
| } | |
| template<typename _Tp, typename _Up> | |
| constexpr bool | |
| operator()(_Tp* __t, _Up* __u) const noexcept | |
| { return greater_equal<common_type_t<_Tp*, _Up*>>{}(__t, __u); } | |
| typedef __is_transparent is_transparent; | |
| private: | |
| template <typename _Tp, typename _Up> | |
| static constexpr decltype(auto) | |
| _S_cmp(_Tp&& __t, _Up&& __u, false_type) | |
| { return std::forward<_Tp>(__t) >= std::forward<_Up>(__u); } | |
| template <typename _Tp, typename _Up> | |
| static constexpr bool | |
| _S_cmp(_Tp&& __t, _Up&& __u, true_type) noexcept | |
| { | |
| return greater_equal<const volatile void*>{}( | |
| static_cast<const volatile void*>(std::forward<_Tp>(__t)), | |
| static_cast<const volatile void*>(std::forward<_Up>(__u))); | |
| } | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded2 : true_type { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded2<_Tp, _Up, __void_t< | |
| decltype(std::declval<_Tp>().operator>=(std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded : __not_overloaded2<_Tp, _Up> { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded<_Tp, _Up, __void_t< | |
| decltype(operator>=(std::declval<_Tp>(), std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up> | |
| using __ptr_cmp = __and_<__not_overloaded<_Tp, _Up>, | |
| is_convertible<_Tp, const volatile void*>, | |
| is_convertible<_Up, const volatile void*>>; | |
| }; | |
| template<> | |
| struct less_equal<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) <= std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) <= std::forward<_Up>(__u)) | |
| { | |
| return _S_cmp(std::forward<_Tp>(__t), std::forward<_Up>(__u), | |
| __ptr_cmp<_Tp, _Up>{}); | |
| } | |
| template<typename _Tp, typename _Up> | |
| constexpr bool | |
| operator()(_Tp* __t, _Up* __u) const noexcept | |
| { return less_equal<common_type_t<_Tp*, _Up*>>{}(__t, __u); } | |
| typedef __is_transparent is_transparent; | |
| private: | |
| template <typename _Tp, typename _Up> | |
| static constexpr decltype(auto) | |
| _S_cmp(_Tp&& __t, _Up&& __u, false_type) | |
| { return std::forward<_Tp>(__t) <= std::forward<_Up>(__u); } | |
| template <typename _Tp, typename _Up> | |
| static constexpr bool | |
| _S_cmp(_Tp&& __t, _Up&& __u, true_type) noexcept | |
| { | |
| return less_equal<const volatile void*>{}( | |
| static_cast<const volatile void*>(std::forward<_Tp>(__t)), | |
| static_cast<const volatile void*>(std::forward<_Up>(__u))); | |
| } | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded2 : true_type { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded2<_Tp, _Up, __void_t< | |
| decltype(std::declval<_Tp>().operator<=(std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up, typename = void> | |
| struct __not_overloaded : __not_overloaded2<_Tp, _Up> { }; | |
| template<typename _Tp, typename _Up> | |
| struct __not_overloaded<_Tp, _Up, __void_t< | |
| decltype(operator<=(std::declval<_Tp>(), std::declval<_Up>()))>> | |
| : false_type { }; | |
| template<typename _Tp, typename _Up> | |
| using __ptr_cmp = __and_<__not_overloaded<_Tp, _Up>, | |
| is_convertible<_Tp, const volatile void*>, | |
| is_convertible<_Up, const volatile void*>>; | |
| }; | |
| # 774 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| template<typename _Tp = void> | |
| struct logical_and; | |
| template<typename _Tp = void> | |
| struct logical_or; | |
| template<typename _Tp = void> | |
| struct logical_not; | |
| template<typename _Tp> | |
| struct logical_and : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x && __y; } | |
| }; | |
| template<typename _Tp> | |
| struct logical_or : public binary_function<_Tp, _Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x || __y; } | |
| }; | |
| template<typename _Tp> | |
| struct logical_not : public unary_function<_Tp, bool> | |
| { | |
| constexpr | |
| bool | |
| operator()(const _Tp& __x) const | |
| { return !__x; } | |
| }; | |
| template<> | |
| struct logical_and<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) && std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) && std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) && std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct logical_or<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) || std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) || std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) || std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<> | |
| struct logical_not<void> | |
| { | |
| template <typename _Tp> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t) const | |
| noexcept(noexcept(!std::forward<_Tp>(__t))) | |
| -> decltype(!std::forward<_Tp>(__t)) | |
| { return !std::forward<_Tp>(__t); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template<typename _Tp = void> | |
| struct bit_and; | |
| template<typename _Tp = void> | |
| struct bit_or; | |
| template<typename _Tp = void> | |
| struct bit_xor; | |
| template<typename _Tp = void> | |
| struct bit_not; | |
| template<typename _Tp> | |
| struct bit_and : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x & __y; } | |
| }; | |
| template<typename _Tp> | |
| struct bit_or : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x | __y; } | |
| }; | |
| template<typename _Tp> | |
| struct bit_xor : public binary_function<_Tp, _Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x, const _Tp& __y) const | |
| { return __x ^ __y; } | |
| }; | |
| template<typename _Tp> | |
| struct bit_not : public unary_function<_Tp, _Tp> | |
| { | |
| constexpr | |
| _Tp | |
| operator()(const _Tp& __x) const | |
| { return ~__x; } | |
| }; | |
| template <> | |
| struct bit_and<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) & std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) & std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) & std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template <> | |
| struct bit_or<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) | std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) | std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) | std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template <> | |
| struct bit_xor<void> | |
| { | |
| template <typename _Tp, typename _Up> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t, _Up&& __u) const | |
| noexcept(noexcept(std::forward<_Tp>(__t) ^ std::forward<_Up>(__u))) | |
| -> decltype(std::forward<_Tp>(__t) ^ std::forward<_Up>(__u)) | |
| { return std::forward<_Tp>(__t) ^ std::forward<_Up>(__u); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| template <> | |
| struct bit_not<void> | |
| { | |
| template <typename _Tp> | |
| constexpr | |
| auto | |
| operator()(_Tp&& __t) const | |
| noexcept(noexcept(~std::forward<_Tp>(__t))) | |
| -> decltype(~std::forward<_Tp>(__t)) | |
| { return ~std::forward<_Tp>(__t); } | |
| typedef __is_transparent is_transparent; | |
| }; | |
| # 1002 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| template<typename _Predicate> | |
| class unary_negate | |
| : public unary_function<typename _Predicate::argument_type, bool> | |
| { | |
| protected: | |
| _Predicate _M_pred; | |
| public: | |
| constexpr | |
| explicit | |
| unary_negate(const _Predicate& __x) : _M_pred(__x) { } | |
| constexpr | |
| bool | |
| operator()(const typename _Predicate::argument_type& __x) const | |
| { return !_M_pred(__x); } | |
| }; | |
| template<typename _Predicate> | |
| constexpr | |
| inline unary_negate<_Predicate> | |
| not1(const _Predicate& __pred) | |
| { return unary_negate<_Predicate>(__pred); } | |
| template<typename _Predicate> | |
| class binary_negate | |
| : public binary_function<typename _Predicate::first_argument_type, | |
| typename _Predicate::second_argument_type, bool> | |
| { | |
| protected: | |
| _Predicate _M_pred; | |
| public: | |
| constexpr | |
| explicit | |
| binary_negate(const _Predicate& __x) : _M_pred(__x) { } | |
| constexpr | |
| bool | |
| operator()(const typename _Predicate::first_argument_type& __x, | |
| const typename _Predicate::second_argument_type& __y) const | |
| { return !_M_pred(__x, __y); } | |
| }; | |
| template<typename _Predicate> | |
| constexpr | |
| inline binary_negate<_Predicate> | |
| not2(const _Predicate& __pred) | |
| { return binary_negate<_Predicate>(__pred); } | |
| # 1079 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| template<typename _Arg, typename _Result> | |
| class pointer_to_unary_function : public unary_function<_Arg, _Result> | |
| { | |
| protected: | |
| _Result (*_M_ptr)(_Arg); | |
| public: | |
| pointer_to_unary_function() { } | |
| explicit | |
| pointer_to_unary_function(_Result (*__x)(_Arg)) | |
| : _M_ptr(__x) { } | |
| _Result | |
| operator()(_Arg __x) const | |
| { return _M_ptr(__x); } | |
| }; | |
| template<typename _Arg, typename _Result> | |
| inline pointer_to_unary_function<_Arg, _Result> | |
| ptr_fun(_Result (*__x)(_Arg)) | |
| { return pointer_to_unary_function<_Arg, _Result>(__x); } | |
| template<typename _Arg1, typename _Arg2, typename _Result> | |
| class pointer_to_binary_function | |
| : public binary_function<_Arg1, _Arg2, _Result> | |
| { | |
| protected: | |
| _Result (*_M_ptr)(_Arg1, _Arg2); | |
| public: | |
| pointer_to_binary_function() { } | |
| explicit | |
| pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) | |
| : _M_ptr(__x) { } | |
| _Result | |
| operator()(_Arg1 __x, _Arg2 __y) const | |
| { return _M_ptr(__x, __y); } | |
| }; | |
| template<typename _Arg1, typename _Arg2, typename _Result> | |
| inline pointer_to_binary_function<_Arg1, _Arg2, _Result> | |
| ptr_fun(_Result (*__x)(_Arg1, _Arg2)) | |
| { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); } | |
| template<typename _Tp> | |
| struct _Identity | |
| : public unary_function<_Tp, _Tp> | |
| { | |
| _Tp& | |
| operator()(_Tp& __x) const | |
| { return __x; } | |
| const _Tp& | |
| operator()(const _Tp& __x) const | |
| { return __x; } | |
| }; | |
| template<typename _Tp> struct _Identity<const _Tp> : _Identity<_Tp> { }; | |
| template<typename _Pair> | |
| struct _Select1st | |
| : public unary_function<_Pair, typename _Pair::first_type> | |
| { | |
| typename _Pair::first_type& | |
| operator()(_Pair& __x) const | |
| { return __x.first; } | |
| const typename _Pair::first_type& | |
| operator()(const _Pair& __x) const | |
| { return __x.first; } | |
| template<typename _Pair2> | |
| typename _Pair2::first_type& | |
| operator()(_Pair2& __x) const | |
| { return __x.first; } | |
| template<typename _Pair2> | |
| const typename _Pair2::first_type& | |
| operator()(const _Pair2& __x) const | |
| { return __x.first; } | |
| }; | |
| template<typename _Pair> | |
| struct _Select2nd | |
| : public unary_function<_Pair, typename _Pair::second_type> | |
| { | |
| typename _Pair::second_type& | |
| operator()(_Pair& __x) const | |
| { return __x.second; } | |
| const typename _Pair::second_type& | |
| operator()(const _Pair& __x) const | |
| { return __x.second; } | |
| }; | |
| # 1202 "/usr/sgug/include/c++/9/bits/stl_function.h" 3 | |
| template<typename _Ret, typename _Tp> | |
| class mem_fun_t : public unary_function<_Tp*, _Ret> | |
| { | |
| public: | |
| explicit | |
| mem_fun_t(_Ret (_Tp::*__pf)()) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(_Tp* __p) const | |
| { return (__p->*_M_f)(); } | |
| private: | |
| _Ret (_Tp::*_M_f)(); | |
| }; | |
| template<typename _Ret, typename _Tp> | |
| class const_mem_fun_t : public unary_function<const _Tp*, _Ret> | |
| { | |
| public: | |
| explicit | |
| const_mem_fun_t(_Ret (_Tp::*__pf)() const) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(const _Tp* __p) const | |
| { return (__p->*_M_f)(); } | |
| private: | |
| _Ret (_Tp::*_M_f)() const; | |
| }; | |
| template<typename _Ret, typename _Tp> | |
| class mem_fun_ref_t : public unary_function<_Tp, _Ret> | |
| { | |
| public: | |
| explicit | |
| mem_fun_ref_t(_Ret (_Tp::*__pf)()) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(_Tp& __r) const | |
| { return (__r.*_M_f)(); } | |
| private: | |
| _Ret (_Tp::*_M_f)(); | |
| }; | |
| template<typename _Ret, typename _Tp> | |
| class const_mem_fun_ref_t : public unary_function<_Tp, _Ret> | |
| { | |
| public: | |
| explicit | |
| const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(const _Tp& __r) const | |
| { return (__r.*_M_f)(); } | |
| private: | |
| _Ret (_Tp::*_M_f)() const; | |
| }; | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret> | |
| { | |
| public: | |
| explicit | |
| mem_fun1_t(_Ret (_Tp::*__pf)(_Arg)) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(_Tp* __p, _Arg __x) const | |
| { return (__p->*_M_f)(__x); } | |
| private: | |
| _Ret (_Tp::*_M_f)(_Arg); | |
| }; | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret> | |
| { | |
| public: | |
| explicit | |
| const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(const _Tp* __p, _Arg __x) const | |
| { return (__p->*_M_f)(__x); } | |
| private: | |
| _Ret (_Tp::*_M_f)(_Arg) const; | |
| }; | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> | |
| { | |
| public: | |
| explicit | |
| mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(_Tp& __r, _Arg __x) const | |
| { return (__r.*_M_f)(__x); } | |
| private: | |
| _Ret (_Tp::*_M_f)(_Arg); | |
| }; | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> | |
| { | |
| public: | |
| explicit | |
| const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const) | |
| : _M_f(__pf) { } | |
| _Ret | |
| operator()(const _Tp& __r, _Arg __x) const | |
| { return (__r.*_M_f)(__x); } | |
| private: | |
| _Ret (_Tp::*_M_f)(_Arg) const; | |
| }; | |
| template<typename _Ret, typename _Tp> | |
| inline mem_fun_t<_Ret, _Tp> | |
| mem_fun(_Ret (_Tp::*__f)()) | |
| { return mem_fun_t<_Ret, _Tp>(__f); } | |
| template<typename _Ret, typename _Tp> | |
| inline const_mem_fun_t<_Ret, _Tp> | |
| mem_fun(_Ret (_Tp::*__f)() const) | |
| { return const_mem_fun_t<_Ret, _Tp>(__f); } | |
| template<typename _Ret, typename _Tp> | |
| inline mem_fun_ref_t<_Ret, _Tp> | |
| mem_fun_ref(_Ret (_Tp::*__f)()) | |
| { return mem_fun_ref_t<_Ret, _Tp>(__f); } | |
| template<typename _Ret, typename _Tp> | |
| inline const_mem_fun_ref_t<_Ret, _Tp> | |
| mem_fun_ref(_Ret (_Tp::*__f)() const) | |
| { return const_mem_fun_ref_t<_Ret, _Tp>(__f); } | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| inline mem_fun1_t<_Ret, _Tp, _Arg> | |
| mem_fun(_Ret (_Tp::*__f)(_Arg)) | |
| { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| inline const_mem_fun1_t<_Ret, _Tp, _Arg> | |
| mem_fun(_Ret (_Tp::*__f)(_Arg) const) | |
| { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| inline mem_fun1_ref_t<_Ret, _Tp, _Arg> | |
| mem_fun_ref(_Ret (_Tp::*__f)(_Arg)) | |
| { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } | |
| template<typename _Ret, typename _Tp, typename _Arg> | |
| inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> | |
| mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const) | |
| { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/backward/binders.h" 1 3 | |
| # 60 "/usr/sgug/include/c++/9/backward/binders.h" 3 | |
| #pragma GCC diagnostic push | |
| #pragma GCC diagnostic ignored "-Wdeprecated-declarations" | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 107 "/usr/sgug/include/c++/9/backward/binders.h" 3 | |
| template<typename _Operation> | |
| class binder1st | |
| : public unary_function<typename _Operation::second_argument_type, | |
| typename _Operation::result_type> | |
| { | |
| protected: | |
| _Operation op; | |
| typename _Operation::first_argument_type value; | |
| public: | |
| binder1st(const _Operation& __x, | |
| const typename _Operation::first_argument_type& __y) | |
| : op(__x), value(__y) { } | |
| typename _Operation::result_type | |
| operator()(const typename _Operation::second_argument_type& __x) const | |
| { return op(value, __x); } | |
| typename _Operation::result_type | |
| operator()(typename _Operation::second_argument_type& __x) const | |
| { return op(value, __x); } | |
| } __attribute__ ((__deprecated__)); | |
| template<typename _Operation, typename _Tp> | |
| inline binder1st<_Operation> | |
| bind1st(const _Operation& __fn, const _Tp& __x) | |
| { | |
| typedef typename _Operation::first_argument_type _Arg1_type; | |
| return binder1st<_Operation>(__fn, _Arg1_type(__x)); | |
| } | |
| template<typename _Operation> | |
| class binder2nd | |
| : public unary_function<typename _Operation::first_argument_type, | |
| typename _Operation::result_type> | |
| { | |
| protected: | |
| _Operation op; | |
| typename _Operation::second_argument_type value; | |
| public: | |
| binder2nd(const _Operation& __x, | |
| const typename _Operation::second_argument_type& __y) | |
| : op(__x), value(__y) { } | |
| typename _Operation::result_type | |
| operator()(const typename _Operation::first_argument_type& __x) const | |
| { return op(__x, value); } | |
| typename _Operation::result_type | |
| operator()(typename _Operation::first_argument_type& __x) const | |
| { return op(__x, value); } | |
| } __attribute__ ((__deprecated__)); | |
| template<typename _Operation, typename _Tp> | |
| inline binder2nd<_Operation> | |
| bind2nd(const _Operation& __fn, const _Tp& __x) | |
| { | |
| typedef typename _Operation::second_argument_type _Arg2_type; | |
| return binder2nd<_Operation>(__fn, _Arg2_type(__x)); | |
| } | |
| } | |
| #pragma GCC diagnostic pop | |
| # 1393 "/usr/sgug/include/c++/9/bits/stl_function.h" 2 3 | |
| # 49 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/range_access.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/range_access.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/range_access.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Container> | |
| inline auto | |
| begin(_Container& __cont) -> decltype(__cont.begin()) | |
| { return __cont.begin(); } | |
| template<typename _Container> | |
| inline auto | |
| begin(const _Container& __cont) -> decltype(__cont.begin()) | |
| { return __cont.begin(); } | |
| template<typename _Container> | |
| inline auto | |
| end(_Container& __cont) -> decltype(__cont.end()) | |
| { return __cont.end(); } | |
| template<typename _Container> | |
| inline auto | |
| end(const _Container& __cont) -> decltype(__cont.end()) | |
| { return __cont.end(); } | |
| template<typename _Tp, size_t _Nm> | |
| inline constexpr _Tp* | |
| begin(_Tp (&__arr)[_Nm]) | |
| { return __arr; } | |
| template<typename _Tp, size_t _Nm> | |
| inline constexpr _Tp* | |
| end(_Tp (&__arr)[_Nm]) | |
| { return __arr + _Nm; } | |
| template<typename _Tp> class valarray; | |
| template<typename _Tp> _Tp* begin(valarray<_Tp>&); | |
| template<typename _Tp> const _Tp* begin(const valarray<_Tp>&); | |
| template<typename _Tp> _Tp* end(valarray<_Tp>&); | |
| template<typename _Tp> const _Tp* end(const valarray<_Tp>&); | |
| template<typename _Container> | |
| inline constexpr auto | |
| cbegin(const _Container& __cont) noexcept(noexcept(std::begin(__cont))) | |
| -> decltype(std::begin(__cont)) | |
| { return std::begin(__cont); } | |
| template<typename _Container> | |
| inline constexpr auto | |
| cend(const _Container& __cont) noexcept(noexcept(std::end(__cont))) | |
| -> decltype(std::end(__cont)) | |
| { return std::end(__cont); } | |
| template<typename _Container> | |
| inline auto | |
| rbegin(_Container& __cont) -> decltype(__cont.rbegin()) | |
| { return __cont.rbegin(); } | |
| template<typename _Container> | |
| inline auto | |
| rbegin(const _Container& __cont) -> decltype(__cont.rbegin()) | |
| { return __cont.rbegin(); } | |
| template<typename _Container> | |
| inline auto | |
| rend(_Container& __cont) -> decltype(__cont.rend()) | |
| { return __cont.rend(); } | |
| template<typename _Container> | |
| inline auto | |
| rend(const _Container& __cont) -> decltype(__cont.rend()) | |
| { return __cont.rend(); } | |
| template<typename _Tp, size_t _Nm> | |
| inline reverse_iterator<_Tp*> | |
| rbegin(_Tp (&__arr)[_Nm]) | |
| { return reverse_iterator<_Tp*>(__arr + _Nm); } | |
| template<typename _Tp, size_t _Nm> | |
| inline reverse_iterator<_Tp*> | |
| rend(_Tp (&__arr)[_Nm]) | |
| { return reverse_iterator<_Tp*>(__arr); } | |
| template<typename _Tp> | |
| inline reverse_iterator<const _Tp*> | |
| rbegin(initializer_list<_Tp> __il) | |
| { return reverse_iterator<const _Tp*>(__il.end()); } | |
| template<typename _Tp> | |
| inline reverse_iterator<const _Tp*> | |
| rend(initializer_list<_Tp> __il) | |
| { return reverse_iterator<const _Tp*>(__il.begin()); } | |
| template<typename _Container> | |
| inline auto | |
| crbegin(const _Container& __cont) -> decltype(std::rbegin(__cont)) | |
| { return std::rbegin(__cont); } | |
| template<typename _Container> | |
| inline auto | |
| crend(const _Container& __cont) -> decltype(std::rend(__cont)) | |
| { return std::rend(__cont); } | |
| # 323 "/usr/sgug/include/c++/9/bits/range_access.h" 3 | |
| } | |
| # 55 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/basic_string.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/ext/atomicity.h" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/ext/atomicity.h" 3 | |
| # 33 "/usr/sgug/include/c++/9/ext/atomicity.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr.h" 1 3 | |
| # 30 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr.h" 3 | |
| #pragma GCC visibility push(default) | |
| # 148 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 1 3 | |
| # 35 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 1 3 4 | |
| # 40 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| # 1 "/usr/include/sched.h" 1 3 4 | |
| # 20 "/usr/include/sched.h" 3 4 | |
| #ident "$Id: sched.h,v 1.3 2002/05/24 17:57:55 csturtiv Exp $" | |
| # 1 "/usr/include/sys/sched.h" 1 3 4 | |
| # 34 "/usr/include/sys/sched.h" 3 4 | |
| # 1 "/usr/include/sys/param.h" 1 3 4 | |
| # 36 "/usr/include/sys/param.h" 3 4 | |
| #ident "$Revision: 3.91 $" | |
| # 1 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 1 3 4 | |
| # 34 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| #ident "$Revision: 3.148 $" | |
| # 91 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| extern "C" { | |
| # 111 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| typedef void (*SIG_PF) (int); | |
| } | |
| # 1 "/usr/include/sys/sigevent.h" 1 3 4 | |
| # 20 "/usr/include/sys/sigevent.h" 3 4 | |
| #ident "$Revision: 1.9 $" | |
| # 34 "/usr/include/sys/sigevent.h" 3 4 | |
| extern "C" { | |
| typedef union sigval { | |
| int sival_int; | |
| void *sival_ptr; | |
| } sigval_t; | |
| # 54 "/usr/include/sys/sigevent.h" 3 4 | |
| typedef union notifyinfo { | |
| int nisigno; | |
| void (*nifunc) (sigval_t); | |
| } notifyinfo_t; | |
| typedef struct sigevent { | |
| int sigev_notify; | |
| notifyinfo_t sigev_notifyinfo; | |
| sigval_t sigev_value; | |
| void (*sigev_notify_function) (sigval_t); | |
| pthread_attr_t *sigev_notify_attributes; | |
| unsigned long sigev_reserved[11]; | |
| unsigned long sigev_pad[6]; | |
| } sigevent_t; | |
| # 76 "/usr/include/sys/sigevent.h" 3 4 | |
| } | |
| # 126 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 2 3 4 | |
| # 1 "/usr/include/sys/siginfo.h" 1 3 4 | |
| # 24 "/usr/include/sys/siginfo.h" 3 4 | |
| #ident "$Revision: 1.28 $" | |
| # 46 "/usr/include/sys/siginfo.h" 3 4 | |
| extern "C" { | |
| # 59 "/usr/include/sys/siginfo.h" 3 4 | |
| typedef struct __siginfo { | |
| int si_signo; | |
| int si_code; | |
| int si_errno; | |
| union { | |
| int si_pad[((128 / sizeof(__int32_t)) - 3)]; | |
| struct { | |
| pid_t __pid; | |
| union { | |
| struct { | |
| uid_t __uid; | |
| } __kill; | |
| struct { | |
| clock_t __utime; | |
| int __status; | |
| clock_t __stime; | |
| int __swap; | |
| } __cld; | |
| } __pdata; | |
| } __proc; | |
| struct { | |
| void *__addr; | |
| } __fault; | |
| struct { | |
| int __fd; | |
| long __band; | |
| } __file; | |
| union sigval __value; | |
| } __data; | |
| } siginfo_t; | |
| # 220 "/usr/include/sys/siginfo.h" 3 4 | |
| } | |
| # 133 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 2 3 4 | |
| extern "C" { | |
| typedef struct { | |
| __uint32_t __sigbits[4]; | |
| } sigset_t; | |
| typedef union __sighandler { | |
| void (*sa_handler1)(int); | |
| void (*sa_sigaction1)(int, siginfo_t *, void *); | |
| } __sighandler_t; | |
| typedef struct sigaction { | |
| int sa_flags; | |
| __sighandler_t sa_sighandler; | |
| sigset_t sa_mask; | |
| int sa_resv[2]; | |
| } sigaction_t; | |
| # 207 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| } | |
| extern "C" { | |
| struct sigstack { | |
| void *ss_sp; | |
| int ss_onstack; | |
| }; | |
| # 230 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| } | |
| # 1 "/usr/include/sys/ucontext.h" 1 3 4 | |
| # 26 "/usr/include/sys/ucontext.h" 3 4 | |
| #ident "$Revision: 1.37 $" | |
| # 56 "/usr/include/sys/ucontext.h" 3 4 | |
| typedef struct _sigaltstack { | |
| void *ss_sp; | |
| size_t ss_size; | |
| int ss_flags; | |
| } stack_t; | |
| # 126 "/usr/include/sys/ucontext.h" 3 4 | |
| typedef machreg_t greg_t; | |
| typedef greg_t gregset_t[37]; | |
| typedef struct __fpregset { | |
| union { | |
| double __fp_dregs[32]; | |
| struct { | |
| __uint32_t _fp_fill; | |
| float _fp_fregs; | |
| } __fp_fregs[32]; | |
| machreg_t __fp_regs[32]; | |
| } __fp_r; | |
| __uint32_t __fp_csr; | |
| __uint32_t __fp_pad; | |
| } fpregset_t; | |
| typedef struct { | |
| gregset_t __gregs; | |
| fpregset_t __fpregs; | |
| } mcontext_t; | |
| typedef struct __ucontext { | |
| unsigned long uc_flags; | |
| struct __ucontext *uc_link; | |
| sigset_t uc_sigmask; | |
| stack_t uc_stack; | |
| mcontext_t uc_mcontext; | |
| long uc_filler[49]; | |
| } ucontext_t; | |
| # 233 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 2 3 4 | |
| extern "C" { | |
| # 295 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| extern void (*bsd_signal(int, void (*)(int)))(int); | |
| extern int killpg(pid_t, int); | |
| extern int sigstack(struct sigstack *, struct sigstack *); | |
| extern void (*signal(int,void (*)(int)))(int); | |
| # 329 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| typedef struct sigcontext { | |
| __uint32_t sc_regmask; | |
| __uint32_t sc_status; | |
| __uint64_t sc_pc; | |
| __uint64_t sc_regs[32]; | |
| __uint64_t sc_fpregs[32]; | |
| __uint32_t sc_ownedfp; | |
| __uint32_t sc_fpc_csr; | |
| __uint32_t sc_fpc_eir; | |
| __uint32_t sc_ssflags; | |
| __uint64_t sc_mdhi; | |
| __uint64_t sc_mdlo; | |
| __uint64_t sc_cause; | |
| __uint64_t sc_badvaddr; | |
| __uint64_t sc_triggersave; | |
| sigset_t sc_sigset; | |
| __uint64_t sc_fp_rounded_result; | |
| __uint64_t sc_pad[31]; | |
| } sigcontext_t; | |
| # 382 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/sys/signal.h" 3 4 | |
| } | |
| # 41 "/usr/include/sys/param.h" 2 3 4 | |
| # 238 "/usr/include/sys/param.h" 3 4 | |
| struct paramconst { | |
| int p_usize; | |
| int p_extusize; | |
| }; | |
| # 35 "/usr/include/sys/sched.h" 2 3 4 | |
| # 47 "/usr/include/sys/sched.h" 3 4 | |
| struct sched_param { | |
| int sched_priority; | |
| }; | |
| # 26 "/usr/include/sched.h" 2 3 4 | |
| extern "C" { | |
| int sched_setparam(pid_t, const struct sched_param *); | |
| int sched_getparam(pid_t, struct sched_param *); | |
| int sched_setscheduler(pid_t, int, const struct sched_param *); | |
| int sched_getscheduler(pid_t); | |
| int sched_yield(void); | |
| int sched_get_priority_max(int); | |
| int sched_get_priority_min(int); | |
| int sched_rr_get_interval(pid_t, timespec_t *); | |
| } | |
| # 41 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 2 3 4 | |
| extern "C" { | |
| # 64 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_attr_init(pthread_attr_t *); | |
| int pthread_attr_destroy(pthread_attr_t *); | |
| int pthread_attr_setstacksize(pthread_attr_t *, size_t); | |
| int pthread_attr_getstacksize(const pthread_attr_t *, size_t *); | |
| int pthread_attr_setstackaddr(pthread_attr_t *, void *); | |
| int pthread_attr_getstackaddr(const pthread_attr_t *, void **); | |
| int pthread_attr_setguardsize(pthread_attr_t *, size_t); | |
| int pthread_attr_getguardsize(const pthread_attr_t *, size_t *); | |
| int pthread_attr_setdetachstate(pthread_attr_t *, int); | |
| int pthread_attr_getdetachstate(const pthread_attr_t *, int *); | |
| int pthread_attr_setscope(pthread_attr_t *, int); | |
| int pthread_attr_getscope(const pthread_attr_t *, int *); | |
| int pthread_attr_setinheritsched(pthread_attr_t *, int); | |
| int pthread_attr_getinheritsched(const pthread_attr_t *, int *); | |
| int pthread_attr_setschedpolicy(pthread_attr_t *, int); | |
| int pthread_attr_getschedpolicy(const pthread_attr_t *, int *); | |
| int pthread_attr_setschedparam(pthread_attr_t *, const struct sched_param *); | |
| int pthread_attr_getschedparam(const pthread_attr_t *, struct sched_param *); | |
| # 99 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_create(pthread_t *, const pthread_attr_t *, void *(*)(void *), void *); | |
| int pthread_join(pthread_t, void **); | |
| int pthread_detach(pthread_t); | |
| void pthread_exit(void *); | |
| pthread_t pthread_self(void); | |
| int pthread_equal(pthread_t, pthread_t); | |
| int pthread_once(pthread_once_t *, void (*)(void)); | |
| int pthread_getschedparam(pthread_t, int *, struct sched_param *); | |
| int pthread_setschedparam(pthread_t, int, const struct sched_param *); | |
| int pthread_getconcurrency(void); | |
| int pthread_setconcurrency(int); | |
| int pthread_getrunon_np(int *); | |
| int pthread_setrunon_np(int); | |
| int pthread_cancel(pthread_t); | |
| int pthread_setcancelstate(int, int *); | |
| int pthread_setcanceltype(int, int *); | |
| void pthread_testcancel(void); | |
| struct __pthread_cncl_hdlr **__pthread_cancel_list(void); | |
| struct __pthread_cncl_hdlr { | |
| struct __pthread_cncl_hdlr *__ptch_next; | |
| void (*__ptch_func)(void *); | |
| void *__ptch_arg; | |
| }; | |
| # 164 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_mutexattr_init(pthread_mutexattr_t *); | |
| int pthread_mutexattr_destroy(pthread_mutexattr_t *); | |
| int pthread_mutexattr_getpshared(const pthread_mutexattr_t *, int *); | |
| int pthread_mutexattr_setpshared(pthread_mutexattr_t *, int); | |
| int pthread_mutexattr_setprotocol(pthread_mutexattr_t *, int); | |
| int pthread_mutexattr_getprotocol(const pthread_mutexattr_t *, int *); | |
| int pthread_mutexattr_setprioceiling(pthread_mutexattr_t *, int); | |
| int pthread_mutexattr_getprioceiling(const pthread_mutexattr_t *, int *); | |
| # 186 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_mutexattr_settype(pthread_mutexattr_t *, int); | |
| int pthread_mutexattr_gettype(const pthread_mutexattr_t *, int *); | |
| # 197 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_mutex_init(pthread_mutex_t *, const pthread_mutexattr_t *); | |
| int pthread_mutex_destroy(pthread_mutex_t *); | |
| int pthread_mutex_lock(pthread_mutex_t *); | |
| int pthread_mutex_trylock(pthread_mutex_t *); | |
| int pthread_mutex_unlock(pthread_mutex_t *); | |
| int pthread_mutex_setprioceiling(pthread_mutex_t *, int, int *); | |
| int pthread_mutex_getprioceiling(const pthread_mutex_t *, int *); | |
| # 218 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_condattr_init(pthread_condattr_t *); | |
| int pthread_condattr_destroy(pthread_condattr_t *); | |
| int pthread_condattr_getpshared(const pthread_condattr_t *, int *); | |
| int pthread_condattr_setpshared(pthread_condattr_t *, int); | |
| int pthread_cond_init(pthread_cond_t *, const pthread_condattr_t *); | |
| int pthread_cond_destroy(pthread_cond_t *); | |
| int pthread_cond_signal(pthread_cond_t *); | |
| int pthread_cond_broadcast(pthread_cond_t *); | |
| int pthread_cond_wait(pthread_cond_t *, pthread_mutex_t *); | |
| int pthread_cond_timedwait(pthread_cond_t *, pthread_mutex_t *, | |
| const struct timespec *); | |
| # 243 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_rwlockattr_init(pthread_rwlockattr_t *); | |
| int pthread_rwlockattr_destroy(pthread_rwlockattr_t *); | |
| int pthread_rwlockattr_getpshared(const pthread_rwlockattr_t *, int *); | |
| int pthread_rwlockattr_setpshared(pthread_rwlockattr_t *, int); | |
| int pthread_rwlock_init(pthread_rwlock_t *, const pthread_rwlockattr_t *); | |
| int pthread_rwlock_destroy(pthread_rwlock_t *); | |
| int pthread_rwlock_rdlock(pthread_rwlock_t *); | |
| int pthread_rwlock_tryrdlock(pthread_rwlock_t *); | |
| int pthread_rwlock_wrlock(pthread_rwlock_t *); | |
| int pthread_rwlock_trywrlock(pthread_rwlock_t *); | |
| int pthread_rwlock_unlock(pthread_rwlock_t *); | |
| # 266 "/usr/sgug/lib/gcc/mips-sgi-irix6.5/9/include-fixed/pthread.h" 3 4 | |
| int pthread_key_create(pthread_key_t *, void (*)(void *)); | |
| int pthread_setspecific(pthread_key_t, const void *); | |
| void *pthread_getspecific(pthread_key_t); | |
| int pthread_key_delete(pthread_key_t); | |
| int pthread_barrierattr_destroy(pthread_barrierattr_t *); | |
| int pthread_barrierattr_init(pthread_barrierattr_t *); | |
| int pthread_barrierattr_setpshared(pthread_barrierattr_t *, int); | |
| int pthread_barrierattr_getpshared(pthread_barrierattr_t *, int *); | |
| int pthread_barrier_init(pthread_barrier_t *, | |
| const pthread_barrierattr_t *, unsigned int); | |
| int pthread_barrier_wait(pthread_barrier_t *); | |
| int pthread_barrier_destroy(pthread_barrier_t *); | |
| #pragma optional pthread_barrierattr_destroy | |
| #pragma optional pthread_barrierattr_init | |
| #pragma optional pthread_barrierattr_setpshared | |
| #pragma optional pthread_barrierattr_getpshared | |
| #pragma optional pthread_barrier_init | |
| #pragma optional pthread_barrier_wait | |
| #pragma optional pthread_barrier_destroy | |
| int pthread_spin_destroy(pthread_spinlock_t *); | |
| int pthread_spin_init(pthread_spinlock_t *, int); | |
| int pthread_spin_lock(pthread_spinlock_t *); | |
| int pthread_spin_trylock(pthread_spinlock_t *); | |
| int pthread_spin_unlock(pthread_spinlock_t *); | |
| #pragma optional pthread_spin_destroy | |
| #pragma optional pthread_spin_init | |
| #pragma optional pthread_spin_lock | |
| #pragma optional pthread_spin_trylock | |
| #pragma optional pthread_spin_unlock | |
| } | |
| # 36 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 2 3 | |
| # 47 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| typedef pthread_t __gthread_t; | |
| typedef pthread_key_t __gthread_key_t; | |
| typedef pthread_once_t __gthread_once_t; | |
| typedef pthread_mutex_t __gthread_mutex_t; | |
| typedef pthread_mutex_t __gthread_recursive_mutex_t; | |
| typedef pthread_cond_t __gthread_cond_t; | |
| typedef struct timespec __gthread_time_t; | |
| # 102 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| static __typeof(pthread_once) __gthrw_pthread_once __attribute__ ((__weakref__("pthread_once"), __copy__ (pthread_once))); | |
| static __typeof(pthread_getspecific) __gthrw_pthread_getspecific __attribute__ ((__weakref__("pthread_getspecific"), __copy__ (pthread_getspecific))); | |
| static __typeof(pthread_setspecific) __gthrw_pthread_setspecific __attribute__ ((__weakref__("pthread_setspecific"), __copy__ (pthread_setspecific))); | |
| static __typeof(pthread_create) __gthrw_pthread_create __attribute__ ((__weakref__("pthread_create"), __copy__ (pthread_create))); | |
| static __typeof(pthread_join) __gthrw_pthread_join __attribute__ ((__weakref__("pthread_join"), __copy__ (pthread_join))); | |
| static __typeof(pthread_equal) __gthrw_pthread_equal __attribute__ ((__weakref__("pthread_equal"), __copy__ (pthread_equal))); | |
| static __typeof(pthread_self) __gthrw_pthread_self __attribute__ ((__weakref__("pthread_self"), __copy__ (pthread_self))); | |
| static __typeof(pthread_detach) __gthrw_pthread_detach __attribute__ ((__weakref__("pthread_detach"), __copy__ (pthread_detach))); | |
| static __typeof(pthread_cancel) __gthrw_pthread_cancel __attribute__ ((__weakref__("pthread_cancel"), __copy__ (pthread_cancel))); | |
| static __typeof(sched_yield) __gthrw_sched_yield __attribute__ ((__weakref__("sched_yield"), __copy__ (sched_yield))); | |
| static __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __attribute__ ((__weakref__("pthread_mutex_lock"), __copy__ (pthread_mutex_lock))); | |
| static __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __attribute__ ((__weakref__("pthread_mutex_trylock"), __copy__ (pthread_mutex_trylock))); | |
| static __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __attribute__ ((__weakref__("pthread_mutex_unlock"), __copy__ (pthread_mutex_unlock))); | |
| static __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __attribute__ ((__weakref__("pthread_mutex_init"), __copy__ (pthread_mutex_init))); | |
| static __typeof(pthread_mutex_destroy) __gthrw_pthread_mutex_destroy __attribute__ ((__weakref__("pthread_mutex_destroy"), __copy__ (pthread_mutex_destroy))); | |
| static __typeof(pthread_cond_init) __gthrw_pthread_cond_init __attribute__ ((__weakref__("pthread_cond_init"), __copy__ (pthread_cond_init))); | |
| static __typeof(pthread_cond_broadcast) __gthrw_pthread_cond_broadcast __attribute__ ((__weakref__("pthread_cond_broadcast"), __copy__ (pthread_cond_broadcast))); | |
| static __typeof(pthread_cond_signal) __gthrw_pthread_cond_signal __attribute__ ((__weakref__("pthread_cond_signal"), __copy__ (pthread_cond_signal))); | |
| static __typeof(pthread_cond_wait) __gthrw_pthread_cond_wait __attribute__ ((__weakref__("pthread_cond_wait"), __copy__ (pthread_cond_wait))); | |
| static __typeof(pthread_cond_timedwait) __gthrw_pthread_cond_timedwait __attribute__ ((__weakref__("pthread_cond_timedwait"), __copy__ (pthread_cond_timedwait))); | |
| static __typeof(pthread_cond_destroy) __gthrw_pthread_cond_destroy __attribute__ ((__weakref__("pthread_cond_destroy"), __copy__ (pthread_cond_destroy))); | |
| static __typeof(pthread_key_create) __gthrw_pthread_key_create __attribute__ ((__weakref__("pthread_key_create"), __copy__ (pthread_key_create))); | |
| static __typeof(pthread_key_delete) __gthrw_pthread_key_delete __attribute__ ((__weakref__("pthread_key_delete"), __copy__ (pthread_key_delete))); | |
| static __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __attribute__ ((__weakref__("pthread_mutexattr_init"), __copy__ (pthread_mutexattr_init))); | |
| static __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __attribute__ ((__weakref__("pthread_mutexattr_settype"), __copy__ (pthread_mutexattr_settype))); | |
| static __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __attribute__ ((__weakref__("pthread_mutexattr_destroy"), __copy__ (pthread_mutexattr_destroy))); | |
| # 247 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| static inline int | |
| __gthread_active_p (void) | |
| { | |
| static void *const __gthread_active_ptr | |
| = __extension__ (void *) &__gthrw_pthread_cancel; | |
| return __gthread_active_ptr != 0; | |
| } | |
| # 659 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| static inline int | |
| __gthread_create (__gthread_t *__threadid, void *(*__func) (void*), | |
| void *__args) | |
| { | |
| return __gthrw_pthread_create (__threadid, __null, __func, __args); | |
| } | |
| static inline int | |
| __gthread_join (__gthread_t __threadid, void **__value_ptr) | |
| { | |
| return __gthrw_pthread_join (__threadid, __value_ptr); | |
| } | |
| static inline int | |
| __gthread_detach (__gthread_t __threadid) | |
| { | |
| return __gthrw_pthread_detach (__threadid); | |
| } | |
| static inline int | |
| __gthread_equal (__gthread_t __t1, __gthread_t __t2) | |
| { | |
| return __gthrw_pthread_equal (__t1, __t2); | |
| } | |
| static inline __gthread_t | |
| __gthread_self (void) | |
| { | |
| return __gthrw_pthread_self (); | |
| } | |
| static inline int | |
| __gthread_yield (void) | |
| { | |
| return __gthrw_sched_yield (); | |
| } | |
| static inline int | |
| __gthread_once (__gthread_once_t *__once, void (*__func) (void)) | |
| { | |
| if (__gthread_active_p ()) | |
| return __gthrw_pthread_once (__once, __func); | |
| else | |
| return -1; | |
| } | |
| static inline int | |
| __gthread_key_create (__gthread_key_t *__key, void (*__dtor) (void *)) | |
| { | |
| return __gthrw_pthread_key_create (__key, __dtor); | |
| } | |
| static inline int | |
| __gthread_key_delete (__gthread_key_t __key) | |
| { | |
| return __gthrw_pthread_key_delete (__key); | |
| } | |
| static inline void * | |
| __gthread_getspecific (__gthread_key_t __key) | |
| { | |
| return __gthrw_pthread_getspecific (__key); | |
| } | |
| static inline int | |
| __gthread_setspecific (__gthread_key_t __key, const void *__ptr) | |
| { | |
| return __gthrw_pthread_setspecific (__key, __ptr); | |
| } | |
| static inline void | |
| __gthread_mutex_init_function (__gthread_mutex_t *__mutex) | |
| { | |
| if (__gthread_active_p ()) | |
| __gthrw_pthread_mutex_init (__mutex, __null); | |
| } | |
| static inline int | |
| __gthread_mutex_destroy (__gthread_mutex_t *__mutex) | |
| { | |
| if (__gthread_active_p ()) | |
| return __gthrw_pthread_mutex_destroy (__mutex); | |
| else | |
| return 0; | |
| } | |
| static inline int | |
| __gthread_mutex_lock (__gthread_mutex_t *__mutex) | |
| { | |
| if (__gthread_active_p ()) | |
| return __gthrw_pthread_mutex_lock (__mutex); | |
| else | |
| return 0; | |
| } | |
| static inline int | |
| __gthread_mutex_trylock (__gthread_mutex_t *__mutex) | |
| { | |
| if (__gthread_active_p ()) | |
| return __gthrw_pthread_mutex_trylock (__mutex); | |
| else | |
| return 0; | |
| } | |
| # 775 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| static inline int | |
| __gthread_mutex_unlock (__gthread_mutex_t *__mutex) | |
| { | |
| if (__gthread_active_p ()) | |
| return __gthrw_pthread_mutex_unlock (__mutex); | |
| else | |
| return 0; | |
| } | |
| static inline int | |
| __gthread_recursive_mutex_init_function (__gthread_recursive_mutex_t *__mutex) | |
| { | |
| if (__gthread_active_p ()) | |
| { | |
| pthread_mutexattr_t __attr; | |
| int __r; | |
| __r = __gthrw_pthread_mutexattr_init (&__attr); | |
| if (!__r) | |
| __r = __gthrw_pthread_mutexattr_settype (&__attr, | |
| 2); | |
| if (!__r) | |
| __r = __gthrw_pthread_mutex_init (__mutex, &__attr); | |
| if (!__r) | |
| __r = __gthrw_pthread_mutexattr_destroy (&__attr); | |
| return __r; | |
| } | |
| return 0; | |
| } | |
| static inline int | |
| __gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *__mutex) | |
| { | |
| return __gthread_mutex_lock (__mutex); | |
| } | |
| static inline int | |
| __gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *__mutex) | |
| { | |
| return __gthread_mutex_trylock (__mutex); | |
| } | |
| # 829 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| static inline int | |
| __gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *__mutex) | |
| { | |
| return __gthread_mutex_unlock (__mutex); | |
| } | |
| static inline int | |
| __gthread_recursive_mutex_destroy (__gthread_recursive_mutex_t *__mutex) | |
| { | |
| return __gthread_mutex_destroy (__mutex); | |
| } | |
| # 850 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr-default.h" 3 | |
| static inline int | |
| __gthread_cond_broadcast (__gthread_cond_t *__cond) | |
| { | |
| return __gthrw_pthread_cond_broadcast (__cond); | |
| } | |
| static inline int | |
| __gthread_cond_signal (__gthread_cond_t *__cond) | |
| { | |
| return __gthrw_pthread_cond_signal (__cond); | |
| } | |
| static inline int | |
| __gthread_cond_wait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex) | |
| { | |
| return __gthrw_pthread_cond_wait (__cond, __mutex); | |
| } | |
| static inline int | |
| __gthread_cond_timedwait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex, | |
| const __gthread_time_t *__abs_timeout) | |
| { | |
| return __gthrw_pthread_cond_timedwait (__cond, __mutex, __abs_timeout); | |
| } | |
| static inline int | |
| __gthread_cond_wait_recursive (__gthread_cond_t *__cond, | |
| __gthread_recursive_mutex_t *__mutex) | |
| { | |
| return __gthread_cond_wait (__cond, __mutex); | |
| } | |
| static inline int | |
| __gthread_cond_destroy (__gthread_cond_t* __cond) | |
| { | |
| return __gthrw_pthread_cond_destroy (__cond); | |
| } | |
| # 149 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/gthr.h" 2 3 | |
| #pragma GCC visibility pop | |
| # 36 "/usr/sgug/include/c++/9/ext/atomicity.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/atomic_word.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/atomic_word.h" 3 | |
| typedef long _Atomic_word; | |
| # 37 "/usr/sgug/include/c++/9/ext/atomicity.h" 2 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| static inline _Atomic_word | |
| __exchange_and_add(volatile _Atomic_word* __mem, int __val) | |
| { return __atomic_fetch_add(__mem, __val, 4); } | |
| static inline void | |
| __atomic_add(volatile _Atomic_word* __mem, int __val) | |
| { __atomic_fetch_add(__mem, __val, 4); } | |
| # 64 "/usr/sgug/include/c++/9/ext/atomicity.h" 3 | |
| static inline _Atomic_word | |
| __exchange_and_add_single(_Atomic_word* __mem, int __val) | |
| { | |
| _Atomic_word __result = *__mem; | |
| *__mem += __val; | |
| return __result; | |
| } | |
| static inline void | |
| __atomic_add_single(_Atomic_word* __mem, int __val) | |
| { *__mem += __val; } | |
| static inline _Atomic_word | |
| __attribute__ ((__unused__)) | |
| __exchange_and_add_dispatch(_Atomic_word* __mem, int __val) | |
| { | |
| if (__gthread_active_p()) | |
| return __exchange_and_add(__mem, __val); | |
| else | |
| return __exchange_and_add_single(__mem, __val); | |
| } | |
| static inline void | |
| __attribute__ ((__unused__)) | |
| __atomic_add_dispatch(_Atomic_word* __mem, int __val) | |
| { | |
| if (__gthread_active_p()) | |
| __atomic_add(__mem, __val); | |
| else | |
| __atomic_add_single(__mem, __val); | |
| } | |
| } | |
| # 40 "/usr/sgug/include/c++/9/bits/basic_string.h" 2 3 | |
| # 52 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| namespace __cxx11 { | |
| # 76 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| class basic_string | |
| { | |
| typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template | |
| rebind<_CharT>::other _Char_alloc_type; | |
| typedef __gnu_cxx::__alloc_traits<_Char_alloc_type> _Alloc_traits; | |
| public: | |
| typedef _Traits traits_type; | |
| typedef typename _Traits::char_type value_type; | |
| typedef _Char_alloc_type allocator_type; | |
| typedef typename _Alloc_traits::size_type size_type; | |
| typedef typename _Alloc_traits::difference_type difference_type; | |
| typedef typename _Alloc_traits::reference reference; | |
| typedef typename _Alloc_traits::const_reference const_reference; | |
| typedef typename _Alloc_traits::pointer pointer; | |
| typedef typename _Alloc_traits::const_pointer const_pointer; | |
| typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator; | |
| typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string> | |
| const_iterator; | |
| typedef std::reverse_iterator<const_iterator> const_reverse_iterator; | |
| typedef std::reverse_iterator<iterator> reverse_iterator; | |
| static const size_type npos = static_cast<size_type>(-1); | |
| protected: | |
| typedef const_iterator __const_iterator; | |
| private: | |
| # 150 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| struct _Alloc_hider : allocator_type | |
| { | |
| _Alloc_hider(pointer __dat, const _Alloc& __a) | |
| : allocator_type(__a), _M_p(__dat) { } | |
| _Alloc_hider(pointer __dat, _Alloc&& __a = _Alloc()) | |
| : allocator_type(std::move(__a)), _M_p(__dat) { } | |
| pointer _M_p; | |
| }; | |
| _Alloc_hider _M_dataplus; | |
| size_type _M_string_length; | |
| enum { _S_local_capacity = 15 / sizeof(_CharT) }; | |
| union | |
| { | |
| _CharT _M_local_buf[_S_local_capacity + 1]; | |
| size_type _M_allocated_capacity; | |
| }; | |
| void | |
| _M_data(pointer __p) | |
| { _M_dataplus._M_p = __p; } | |
| void | |
| _M_length(size_type __length) | |
| { _M_string_length = __length; } | |
| pointer | |
| _M_data() const | |
| { return _M_dataplus._M_p; } | |
| pointer | |
| _M_local_data() | |
| { | |
| return std::pointer_traits<pointer>::pointer_to(*_M_local_buf); | |
| } | |
| const_pointer | |
| _M_local_data() const | |
| { | |
| return std::pointer_traits<const_pointer>::pointer_to(*_M_local_buf); | |
| } | |
| void | |
| _M_capacity(size_type __capacity) | |
| { _M_allocated_capacity = __capacity; } | |
| void | |
| _M_set_length(size_type __n) | |
| { | |
| _M_length(__n); | |
| traits_type::assign(_M_data()[__n], _CharT()); | |
| } | |
| bool | |
| _M_is_local() const | |
| { return _M_data() == _M_local_data(); } | |
| pointer | |
| _M_create(size_type&, size_type); | |
| void | |
| _M_dispose() | |
| { | |
| if (!_M_is_local()) | |
| _M_destroy(_M_allocated_capacity); | |
| } | |
| void | |
| _M_destroy(size_type __size) throw() | |
| { _Alloc_traits::deallocate(_M_get_allocator(), _M_data(), __size + 1); } | |
| template<typename _InIterator> | |
| void | |
| _M_construct_aux(_InIterator __beg, _InIterator __end, | |
| std::__false_type) | |
| { | |
| typedef typename iterator_traits<_InIterator>::iterator_category _Tag; | |
| _M_construct(__beg, __end, _Tag()); | |
| } | |
| template<typename _Integer> | |
| void | |
| _M_construct_aux(_Integer __beg, _Integer __end, std::__true_type) | |
| { _M_construct_aux_2(static_cast<size_type>(__beg), __end); } | |
| void | |
| _M_construct_aux_2(size_type __req, _CharT __c) | |
| { _M_construct(__req, __c); } | |
| template<typename _InIterator> | |
| void | |
| _M_construct(_InIterator __beg, _InIterator __end) | |
| { | |
| typedef typename std::__is_integer<_InIterator>::__type _Integral; | |
| _M_construct_aux(__beg, __end, _Integral()); | |
| } | |
| template<typename _InIterator> | |
| void | |
| _M_construct(_InIterator __beg, _InIterator __end, | |
| std::input_iterator_tag); | |
| template<typename _FwdIterator> | |
| void | |
| _M_construct(_FwdIterator __beg, _FwdIterator __end, | |
| std::forward_iterator_tag); | |
| void | |
| _M_construct(size_type __req, _CharT __c); | |
| allocator_type& | |
| _M_get_allocator() | |
| { return _M_dataplus; } | |
| const allocator_type& | |
| _M_get_allocator() const | |
| { return _M_dataplus; } | |
| private: | |
| # 309 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| _M_check(size_type __pos, const char* __s) const | |
| { | |
| if (__pos > this->size()) | |
| __throw_out_of_range_fmt(("%s: __pos (which is %zu) > " "this->size() (which is %zu)") | |
| , | |
| __s, __pos, this->size()); | |
| return __pos; | |
| } | |
| void | |
| _M_check_length(size_type __n1, size_type __n2, const char* __s) const | |
| { | |
| if (this->max_size() - (this->size() - __n1) < __n2) | |
| __throw_length_error((__s)); | |
| } | |
| size_type | |
| _M_limit(size_type __pos, size_type __off) const noexcept | |
| { | |
| const bool __testoff = __off < this->size() - __pos; | |
| return __testoff ? __off : this->size() - __pos; | |
| } | |
| bool | |
| _M_disjunct(const _CharT* __s) const noexcept | |
| { | |
| return (less<const _CharT*>()(__s, _M_data()) | |
| || less<const _CharT*>()(_M_data() + this->size(), __s)); | |
| } | |
| static void | |
| _S_copy(_CharT* __d, const _CharT* __s, size_type __n) | |
| { | |
| if (__n == 1) | |
| traits_type::assign(*__d, *__s); | |
| else | |
| traits_type::copy(__d, __s, __n); | |
| } | |
| static void | |
| _S_move(_CharT* __d, const _CharT* __s, size_type __n) | |
| { | |
| if (__n == 1) | |
| traits_type::assign(*__d, *__s); | |
| else | |
| traits_type::move(__d, __s, __n); | |
| } | |
| static void | |
| _S_assign(_CharT* __d, size_type __n, _CharT __c) | |
| { | |
| if (__n == 1) | |
| traits_type::assign(*__d, __c); | |
| else | |
| traits_type::assign(__d, __n, __c); | |
| } | |
| template<class _Iterator> | |
| static void | |
| _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2) | |
| { | |
| for (; __k1 != __k2; ++__k1, (void)++__p) | |
| traits_type::assign(*__p, *__k1); | |
| } | |
| static void | |
| _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) noexcept | |
| { _S_copy_chars(__p, __k1.base(), __k2.base()); } | |
| static void | |
| _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2) | |
| noexcept | |
| { _S_copy_chars(__p, __k1.base(), __k2.base()); } | |
| static void | |
| _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) noexcept | |
| { _S_copy(__p, __k1, __k2 - __k1); } | |
| static void | |
| _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) | |
| noexcept | |
| { _S_copy(__p, __k1, __k2 - __k1); } | |
| static int | |
| _S_compare(size_type __n1, size_type __n2) noexcept | |
| { | |
| const difference_type __d = difference_type(__n1 - __n2); | |
| if (__d > __gnu_cxx::__numeric_traits<int>::__max) | |
| return __gnu_cxx::__numeric_traits<int>::__max; | |
| else if (__d < __gnu_cxx::__numeric_traits<int>::__min) | |
| return __gnu_cxx::__numeric_traits<int>::__min; | |
| else | |
| return int(__d); | |
| } | |
| void | |
| _M_assign(const basic_string&); | |
| void | |
| _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, | |
| size_type __len2); | |
| void | |
| _M_erase(size_type __pos, size_type __n); | |
| public: | |
| basic_string() | |
| noexcept(is_nothrow_default_constructible<_Alloc>::value) | |
| : _M_dataplus(_M_local_data()) | |
| { _M_set_length(0); } | |
| explicit | |
| basic_string(const _Alloc& __a) noexcept | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_set_length(0); } | |
| basic_string(const basic_string& __str) | |
| : _M_dataplus(_M_local_data(), | |
| _Alloc_traits::_S_select_on_copy(__str._M_get_allocator())) | |
| { _M_construct(__str._M_data(), __str._M_data() + __str.length()); } | |
| # 461 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string(const basic_string& __str, size_type __pos, | |
| const _Alloc& __a = _Alloc()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { | |
| const _CharT* __start = __str._M_data() | |
| + __str._M_check(__pos, "basic_string::basic_string"); | |
| _M_construct(__start, __start + __str._M_limit(__pos, npos)); | |
| } | |
| basic_string(const basic_string& __str, size_type __pos, | |
| size_type __n) | |
| : _M_dataplus(_M_local_data()) | |
| { | |
| const _CharT* __start = __str._M_data() | |
| + __str._M_check(__pos, "basic_string::basic_string"); | |
| _M_construct(__start, __start + __str._M_limit(__pos, __n)); | |
| } | |
| # 492 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string(const basic_string& __str, size_type __pos, | |
| size_type __n, const _Alloc& __a) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { | |
| const _CharT* __start | |
| = __str._M_data() + __str._M_check(__pos, "string::string"); | |
| _M_construct(__start, __start + __str._M_limit(__pos, __n)); | |
| } | |
| # 510 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string(const _CharT* __s, size_type __n, | |
| const _Alloc& __a = _Alloc()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_construct(__s, __s + __n); } | |
| # 525 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_construct(__s, __s ? __s + traits_type::length(__s) : __s+npos); } | |
| # 540 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_construct(__n, __c); } | |
| # 552 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string(basic_string&& __str) noexcept | |
| : _M_dataplus(_M_local_data(), std::move(__str._M_get_allocator())) | |
| { | |
| if (__str._M_is_local()) | |
| { | |
| traits_type::copy(_M_local_buf, __str._M_local_buf, | |
| _S_local_capacity + 1); | |
| } | |
| else | |
| { | |
| _M_data(__str._M_data()); | |
| _M_capacity(__str._M_allocated_capacity); | |
| } | |
| _M_length(__str.length()); | |
| __str._M_data(__str._M_local_data()); | |
| __str._M_set_length(0); | |
| } | |
| basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_construct(__l.begin(), __l.end()); } | |
| basic_string(const basic_string& __str, const _Alloc& __a) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_construct(__str.begin(), __str.end()); } | |
| basic_string(basic_string&& __str, const _Alloc& __a) | |
| noexcept(_Alloc_traits::_S_always_equal()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { | |
| if (__str._M_is_local()) | |
| { | |
| traits_type::copy(_M_local_buf, __str._M_local_buf, | |
| _S_local_capacity + 1); | |
| _M_length(__str.length()); | |
| __str._M_set_length(0); | |
| } | |
| else if (_Alloc_traits::_S_always_equal() | |
| || __str.get_allocator() == __a) | |
| { | |
| _M_data(__str._M_data()); | |
| _M_length(__str.length()); | |
| _M_capacity(__str._M_allocated_capacity); | |
| __str._M_data(__str._M_local_buf); | |
| __str._M_set_length(0); | |
| } | |
| else | |
| _M_construct(__str.begin(), __str.end()); | |
| } | |
| # 620 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _InputIterator, | |
| typename = std::_RequireInputIter<_InputIterator>> | |
| basic_string(_InputIterator __beg, _InputIterator __end, | |
| const _Alloc& __a = _Alloc()) | |
| : _M_dataplus(_M_local_data(), __a) | |
| { _M_construct(__beg, __end); } | |
| # 657 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| ~basic_string() | |
| { _M_dispose(); } | |
| basic_string& | |
| operator=(const basic_string& __str) | |
| { | |
| if (_Alloc_traits::_S_propagate_on_copy_assign()) | |
| { | |
| if (!_Alloc_traits::_S_always_equal() && !_M_is_local() | |
| && _M_get_allocator() != __str._M_get_allocator()) | |
| { | |
| if (__str.size() <= _S_local_capacity) | |
| { | |
| _M_destroy(_M_allocated_capacity); | |
| _M_data(_M_local_data()); | |
| _M_set_length(0); | |
| } | |
| else | |
| { | |
| const auto __len = __str.size(); | |
| auto __alloc = __str._M_get_allocator(); | |
| auto __ptr = _Alloc_traits::allocate(__alloc, __len + 1); | |
| _M_destroy(_M_allocated_capacity); | |
| _M_data(__ptr); | |
| _M_capacity(__len); | |
| _M_set_length(__len); | |
| } | |
| } | |
| std::__alloc_on_copy(_M_get_allocator(), __str._M_get_allocator()); | |
| } | |
| return this->assign(__str); | |
| } | |
| basic_string& | |
| operator=(const _CharT* __s) | |
| { return this->assign(__s); } | |
| # 714 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| operator=(_CharT __c) | |
| { | |
| this->assign(1, __c); | |
| return *this; | |
| } | |
| # 731 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| operator=(basic_string&& __str) | |
| noexcept(_Alloc_traits::_S_nothrow_move()) | |
| { | |
| if (!_M_is_local() && _Alloc_traits::_S_propagate_on_move_assign() | |
| && !_Alloc_traits::_S_always_equal() | |
| && _M_get_allocator() != __str._M_get_allocator()) | |
| { | |
| _M_destroy(_M_allocated_capacity); | |
| _M_data(_M_local_data()); | |
| _M_set_length(0); | |
| } | |
| std::__alloc_on_move(_M_get_allocator(), __str._M_get_allocator()); | |
| if (__str._M_is_local()) | |
| { | |
| if (__str.size()) | |
| this->_S_copy(_M_data(), __str._M_data(), __str.size()); | |
| _M_set_length(__str.size()); | |
| } | |
| else if (_Alloc_traits::_S_propagate_on_move_assign() | |
| || _Alloc_traits::_S_always_equal() | |
| || _M_get_allocator() == __str._M_get_allocator()) | |
| { | |
| pointer __data = nullptr; | |
| size_type __capacity; | |
| if (!_M_is_local()) | |
| { | |
| if (_Alloc_traits::_S_always_equal()) | |
| { | |
| __data = _M_data(); | |
| __capacity = _M_allocated_capacity; | |
| } | |
| else | |
| _M_destroy(_M_allocated_capacity); | |
| } | |
| _M_data(__str._M_data()); | |
| _M_length(__str.length()); | |
| _M_capacity(__str._M_allocated_capacity); | |
| if (__data) | |
| { | |
| __str._M_data(__data); | |
| __str._M_capacity(__capacity); | |
| } | |
| else | |
| __str._M_data(__str._M_local_buf); | |
| } | |
| else | |
| assign(__str); | |
| __str.clear(); | |
| return *this; | |
| } | |
| basic_string& | |
| operator=(initializer_list<_CharT> __l) | |
| { | |
| this->assign(__l.begin(), __l.size()); | |
| return *this; | |
| } | |
| # 825 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| iterator | |
| begin() noexcept | |
| { return iterator(_M_data()); } | |
| const_iterator | |
| begin() const noexcept | |
| { return const_iterator(_M_data()); } | |
| iterator | |
| end() noexcept | |
| { return iterator(_M_data() + this->size()); } | |
| const_iterator | |
| end() const noexcept | |
| { return const_iterator(_M_data() + this->size()); } | |
| reverse_iterator | |
| rbegin() noexcept | |
| { return reverse_iterator(this->end()); } | |
| const_reverse_iterator | |
| rbegin() const noexcept | |
| { return const_reverse_iterator(this->end()); } | |
| reverse_iterator | |
| rend() noexcept | |
| { return reverse_iterator(this->begin()); } | |
| const_reverse_iterator | |
| rend() const noexcept | |
| { return const_reverse_iterator(this->begin()); } | |
| const_iterator | |
| cbegin() const noexcept | |
| { return const_iterator(this->_M_data()); } | |
| const_iterator | |
| cend() const noexcept | |
| { return const_iterator(this->_M_data() + this->size()); } | |
| const_reverse_iterator | |
| crbegin() const noexcept | |
| { return const_reverse_iterator(this->end()); } | |
| const_reverse_iterator | |
| crend() const noexcept | |
| { return const_reverse_iterator(this->begin()); } | |
| public: | |
| size_type | |
| size() const noexcept | |
| { return _M_string_length; } | |
| size_type | |
| length() const noexcept | |
| { return _M_string_length; } | |
| size_type | |
| max_size() const noexcept | |
| { return (_Alloc_traits::max_size(_M_get_allocator()) - 1) / 2; } | |
| # 954 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| void | |
| resize(size_type __n, _CharT __c); | |
| # 967 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| void | |
| resize(size_type __n) | |
| { this->resize(__n, _CharT()); } | |
| void | |
| shrink_to_fit() noexcept | |
| { | |
| # 985 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| } | |
| size_type | |
| capacity() const noexcept | |
| { | |
| return _M_is_local() ? size_type(_S_local_capacity) | |
| : _M_allocated_capacity; | |
| } | |
| # 1016 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| void | |
| reserve(size_type __res_arg = 0); | |
| void | |
| clear() noexcept | |
| { _M_set_length(0); } | |
| bool | |
| empty() const noexcept | |
| { return this->size() == 0; } | |
| # 1045 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| const_reference | |
| operator[] (size_type __pos) const noexcept | |
| { | |
| ; | |
| return _M_data()[__pos]; | |
| } | |
| # 1062 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| reference | |
| operator[](size_type __pos) | |
| { | |
| ; | |
| ; | |
| return _M_data()[__pos]; | |
| } | |
| # 1083 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| const_reference | |
| at(size_type __n) const | |
| { | |
| if (__n >= this->size()) | |
| __throw_out_of_range_fmt(("basic_string::at: __n " "(which is %zu) >= this->size() " "(which is %zu)") | |
| , | |
| __n, this->size()); | |
| return _M_data()[__n]; | |
| } | |
| # 1104 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| reference | |
| at(size_type __n) | |
| { | |
| if (__n >= size()) | |
| __throw_out_of_range_fmt(("basic_string::at: __n " "(which is %zu) >= this->size() " "(which is %zu)") | |
| , | |
| __n, this->size()); | |
| return _M_data()[__n]; | |
| } | |
| reference | |
| front() noexcept | |
| { | |
| ; | |
| return operator[](0); | |
| } | |
| const_reference | |
| front() const noexcept | |
| { | |
| ; | |
| return operator[](0); | |
| } | |
| reference | |
| back() noexcept | |
| { | |
| ; | |
| return operator[](this->size() - 1); | |
| } | |
| const_reference | |
| back() const noexcept | |
| { | |
| ; | |
| return operator[](this->size() - 1); | |
| } | |
| # 1167 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| operator+=(const basic_string& __str) | |
| { return this->append(__str); } | |
| basic_string& | |
| operator+=(const _CharT* __s) | |
| { return this->append(__s); } | |
| basic_string& | |
| operator+=(_CharT __c) | |
| { | |
| this->push_back(__c); | |
| return *this; | |
| } | |
| basic_string& | |
| operator+=(initializer_list<_CharT> __l) | |
| { return this->append(__l.begin(), __l.size()); } | |
| # 1220 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| append(const basic_string& __str) | |
| { return _M_append(__str._M_data(), __str.size()); } | |
| # 1237 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| append(const basic_string& __str, size_type __pos, size_type __n = npos) | |
| { return _M_append(__str._M_data() | |
| + __str._M_check(__pos, "basic_string::append"), | |
| __str._M_limit(__pos, __n)); } | |
| basic_string& | |
| append(const _CharT* __s, size_type __n) | |
| { | |
| ; | |
| _M_check_length(size_type(0), __n, "basic_string::append"); | |
| return _M_append(__s, __n); | |
| } | |
| basic_string& | |
| append(const _CharT* __s) | |
| { | |
| ; | |
| const size_type __n = traits_type::length(__s); | |
| _M_check_length(size_type(0), __n, "basic_string::append"); | |
| return _M_append(__s, __n); | |
| } | |
| # 1279 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| append(size_type __n, _CharT __c) | |
| { return _M_replace_aux(this->size(), size_type(0), __n, __c); } | |
| basic_string& | |
| append(initializer_list<_CharT> __l) | |
| { return this->append(__l.begin(), __l.size()); } | |
| # 1303 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<class _InputIterator, | |
| typename = std::_RequireInputIter<_InputIterator>> | |
| basic_string& | |
| append(_InputIterator __first, _InputIterator __last) | |
| { return this->replace(end(), end(), __first, __last); } | |
| # 1348 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| void | |
| push_back(_CharT __c) | |
| { | |
| const size_type __size = this->size(); | |
| if (__size + 1 > this->capacity()) | |
| this->_M_mutate(__size, size_type(0), 0, size_type(1)); | |
| traits_type::assign(this->_M_data()[__size], __c); | |
| this->_M_set_length(__size + 1); | |
| } | |
| basic_string& | |
| assign(const basic_string& __str) | |
| { | |
| this->_M_assign(__str); | |
| return *this; | |
| } | |
| # 1379 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| assign(basic_string&& __str) | |
| noexcept(_Alloc_traits::_S_nothrow_move()) | |
| { | |
| return *this = std::move(__str); | |
| } | |
| # 1402 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| assign(const basic_string& __str, size_type __pos, size_type __n = npos) | |
| { return _M_replace(size_type(0), this->size(), __str._M_data() | |
| + __str._M_check(__pos, "basic_string::assign"), | |
| __str._M_limit(__pos, __n)); } | |
| # 1418 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| assign(const _CharT* __s, size_type __n) | |
| { | |
| ; | |
| return _M_replace(size_type(0), this->size(), __s, __n); | |
| } | |
| # 1434 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| assign(const _CharT* __s) | |
| { | |
| ; | |
| return _M_replace(size_type(0), this->size(), __s, | |
| traits_type::length(__s)); | |
| } | |
| # 1451 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| assign(size_type __n, _CharT __c) | |
| { return _M_replace_aux(size_type(0), this->size(), __n, __c); } | |
| # 1464 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<class _InputIterator, | |
| typename = std::_RequireInputIter<_InputIterator>> | |
| basic_string& | |
| assign(_InputIterator __first, _InputIterator __last) | |
| { return this->replace(begin(), end(), __first, __last); } | |
| basic_string& | |
| assign(initializer_list<_CharT> __l) | |
| { return this->assign(__l.begin(), __l.size()); } | |
| # 1533 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| iterator | |
| insert(const_iterator __p, size_type __n, _CharT __c) | |
| { | |
| ; | |
| const size_type __pos = __p - begin(); | |
| this->replace(__p, __p, __n, __c); | |
| return iterator(this->_M_data() + __pos); | |
| } | |
| # 1575 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<class _InputIterator, | |
| typename = std::_RequireInputIter<_InputIterator>> | |
| iterator | |
| insert(const_iterator __p, _InputIterator __beg, _InputIterator __end) | |
| { | |
| ; | |
| const size_type __pos = __p - begin(); | |
| this->replace(__p, __p, __beg, __end); | |
| return iterator(this->_M_data() + __pos); | |
| } | |
| # 1611 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| iterator | |
| insert(const_iterator __p, initializer_list<_CharT> __l) | |
| { return this->insert(__p, __l.begin(), __l.end()); } | |
| # 1638 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| insert(size_type __pos1, const basic_string& __str) | |
| { return this->replace(__pos1, size_type(0), | |
| __str._M_data(), __str.size()); } | |
| # 1661 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| insert(size_type __pos1, const basic_string& __str, | |
| size_type __pos2, size_type __n = npos) | |
| { return this->replace(__pos1, size_type(0), __str._M_data() | |
| + __str._M_check(__pos2, "basic_string::insert"), | |
| __str._M_limit(__pos2, __n)); } | |
| # 1684 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| insert(size_type __pos, const _CharT* __s, size_type __n) | |
| { return this->replace(__pos, size_type(0), __s, __n); } | |
| # 1703 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| insert(size_type __pos, const _CharT* __s) | |
| { | |
| ; | |
| return this->replace(__pos, size_type(0), __s, | |
| traits_type::length(__s)); | |
| } | |
| # 1727 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| insert(size_type __pos, size_type __n, _CharT __c) | |
| { return _M_replace_aux(_M_check(__pos, "basic_string::insert"), | |
| size_type(0), __n, __c); } | |
| # 1745 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| iterator | |
| insert(__const_iterator __p, _CharT __c) | |
| { | |
| ; | |
| const size_type __pos = __p - begin(); | |
| _M_replace_aux(__pos, size_type(0), size_type(1), __c); | |
| return iterator(_M_data() + __pos); | |
| } | |
| # 1806 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| erase(size_type __pos = 0, size_type __n = npos) | |
| { | |
| _M_check(__pos, "basic_string::erase"); | |
| if (__n == npos) | |
| this->_M_set_length(__pos); | |
| else if (__n != 0) | |
| this->_M_erase(__pos, _M_limit(__pos, __n)); | |
| return *this; | |
| } | |
| # 1825 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| iterator | |
| erase(__const_iterator __position) | |
| { | |
| ; | |
| const size_type __pos = __position - begin(); | |
| this->_M_erase(__pos, size_type(1)); | |
| return iterator(_M_data() + __pos); | |
| } | |
| # 1844 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| iterator | |
| erase(__const_iterator __first, __const_iterator __last) | |
| { | |
| ; | |
| const size_type __pos = __first - begin(); | |
| if (__last == end()) | |
| this->_M_set_length(__pos); | |
| else | |
| this->_M_erase(__pos, __last - __first); | |
| return iterator(this->_M_data() + __pos); | |
| } | |
| void | |
| pop_back() noexcept | |
| { | |
| ; | |
| _M_erase(size() - 1, 1); | |
| } | |
| # 1888 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(size_type __pos, size_type __n, const basic_string& __str) | |
| { return this->replace(__pos, __n, __str._M_data(), __str.size()); } | |
| # 1910 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(size_type __pos1, size_type __n1, const basic_string& __str, | |
| size_type __pos2, size_type __n2 = npos) | |
| { return this->replace(__pos1, __n1, __str._M_data() | |
| + __str._M_check(__pos2, "basic_string::replace"), | |
| __str._M_limit(__pos2, __n2)); } | |
| # 1935 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(size_type __pos, size_type __n1, const _CharT* __s, | |
| size_type __n2) | |
| { | |
| ; | |
| return _M_replace(_M_check(__pos, "basic_string::replace"), | |
| _M_limit(__pos, __n1), __s, __n2); | |
| } | |
| # 1960 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(size_type __pos, size_type __n1, const _CharT* __s) | |
| { | |
| ; | |
| return this->replace(__pos, __n1, __s, traits_type::length(__s)); | |
| } | |
| # 1984 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) | |
| { return _M_replace_aux(_M_check(__pos, "basic_string::replace"), | |
| _M_limit(__pos, __n1), __n2, __c); } | |
| # 2002 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, | |
| const basic_string& __str) | |
| { return this->replace(__i1, __i2, __str._M_data(), __str.size()); } | |
| # 2022 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, | |
| const _CharT* __s, size_type __n) | |
| { | |
| ; | |
| return this->replace(__i1 - begin(), __i2 - __i1, __s, __n); | |
| } | |
| # 2044 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, const _CharT* __s) | |
| { | |
| ; | |
| return this->replace(__i1, __i2, __s, traits_type::length(__s)); | |
| } | |
| # 2065 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, size_type __n, | |
| _CharT __c) | |
| { | |
| ; | |
| return _M_replace_aux(__i1 - begin(), __i2 - __i1, __n, __c); | |
| } | |
| # 2090 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<class _InputIterator, | |
| typename = std::_RequireInputIter<_InputIterator>> | |
| basic_string& | |
| replace(const_iterator __i1, const_iterator __i2, | |
| _InputIterator __k1, _InputIterator __k2) | |
| { | |
| ; | |
| ; | |
| return this->_M_replace_dispatch(__i1, __i2, __k1, __k2, | |
| std::__false_type()); | |
| } | |
| # 2122 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, | |
| _CharT* __k1, _CharT* __k2) | |
| { | |
| ; | |
| ; | |
| return this->replace(__i1 - begin(), __i2 - __i1, | |
| __k1, __k2 - __k1); | |
| } | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, | |
| const _CharT* __k1, const _CharT* __k2) | |
| { | |
| ; | |
| ; | |
| return this->replace(__i1 - begin(), __i2 - __i1, | |
| __k1, __k2 - __k1); | |
| } | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, | |
| iterator __k1, iterator __k2) | |
| { | |
| ; | |
| ; | |
| return this->replace(__i1 - begin(), __i2 - __i1, | |
| __k1.base(), __k2 - __k1); | |
| } | |
| basic_string& | |
| replace(__const_iterator __i1, __const_iterator __i2, | |
| const_iterator __k1, const_iterator __k2) | |
| { | |
| ; | |
| ; | |
| return this->replace(__i1 - begin(), __i2 - __i1, | |
| __k1.base(), __k2 - __k1); | |
| } | |
| # 2181 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string& replace(const_iterator __i1, const_iterator __i2, | |
| initializer_list<_CharT> __l) | |
| { return this->replace(__i1, __i2, __l.begin(), __l.size()); } | |
| # 2241 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| private: | |
| template<class _Integer> | |
| basic_string& | |
| _M_replace_dispatch(const_iterator __i1, const_iterator __i2, | |
| _Integer __n, _Integer __val, __true_type) | |
| { return _M_replace_aux(__i1 - begin(), __i2 - __i1, __n, __val); } | |
| template<class _InputIterator> | |
| basic_string& | |
| _M_replace_dispatch(const_iterator __i1, const_iterator __i2, | |
| _InputIterator __k1, _InputIterator __k2, | |
| __false_type); | |
| basic_string& | |
| _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, | |
| _CharT __c); | |
| basic_string& | |
| _M_replace(size_type __pos, size_type __len1, const _CharT* __s, | |
| const size_type __len2); | |
| basic_string& | |
| _M_append(const _CharT* __s, size_type __n); | |
| public: | |
| # 2279 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| copy(_CharT* __s, size_type __n, size_type __pos = 0) const; | |
| # 2289 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| void | |
| swap(basic_string& __s) noexcept; | |
| # 2299 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| const _CharT* | |
| c_str() const noexcept | |
| { return _M_data(); } | |
| # 2311 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| const _CharT* | |
| data() const noexcept | |
| { return _M_data(); } | |
| # 2330 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| allocator_type | |
| get_allocator() const noexcept | |
| { return _M_get_allocator(); } | |
| # 2346 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept; | |
| # 2360 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find(const basic_string& __str, size_type __pos = 0) const | |
| noexcept | |
| { return this->find(__str.data(), __pos, __str.size()); } | |
| # 2392 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find(const _CharT* __s, size_type __pos = 0) const noexcept | |
| { | |
| ; | |
| return this->find(__s, __pos, traits_type::length(__s)); | |
| } | |
| # 2409 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find(_CharT __c, size_type __pos = 0) const noexcept; | |
| # 2422 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| rfind(const basic_string& __str, size_type __pos = npos) const | |
| noexcept | |
| { return this->rfind(__str.data(), __pos, __str.size()); } | |
| # 2456 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| rfind(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept; | |
| # 2470 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| rfind(const _CharT* __s, size_type __pos = npos) const | |
| { | |
| ; | |
| return this->rfind(__s, __pos, traits_type::length(__s)); | |
| } | |
| # 2487 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| rfind(_CharT __c, size_type __pos = npos) const noexcept; | |
| # 2501 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_of(const basic_string& __str, size_type __pos = 0) const | |
| noexcept | |
| { return this->find_first_of(__str.data(), __pos, __str.size()); } | |
| # 2536 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_of(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept; | |
| # 2550 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_of(const _CharT* __s, size_type __pos = 0) const | |
| noexcept | |
| { | |
| ; | |
| return this->find_first_of(__s, __pos, traits_type::length(__s)); | |
| } | |
| # 2570 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_of(_CharT __c, size_type __pos = 0) const noexcept | |
| { return this->find(__c, __pos); } | |
| # 2585 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_of(const basic_string& __str, size_type __pos = npos) const | |
| noexcept | |
| { return this->find_last_of(__str.data(), __pos, __str.size()); } | |
| # 2620 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_of(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept; | |
| # 2634 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_of(const _CharT* __s, size_type __pos = npos) const | |
| noexcept | |
| { | |
| ; | |
| return this->find_last_of(__s, __pos, traits_type::length(__s)); | |
| } | |
| # 2654 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_of(_CharT __c, size_type __pos = npos) const noexcept | |
| { return this->rfind(__c, __pos); } | |
| # 2668 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_not_of(const basic_string& __str, size_type __pos = 0) const | |
| noexcept | |
| { return this->find_first_not_of(__str.data(), __pos, __str.size()); } | |
| # 2703 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_not_of(const _CharT* __s, size_type __pos, | |
| size_type __n) const noexcept; | |
| # 2717 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_not_of(const _CharT* __s, size_type __pos = 0) const | |
| noexcept | |
| { | |
| ; | |
| return this->find_first_not_of(__s, __pos, traits_type::length(__s)); | |
| } | |
| # 2735 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_first_not_of(_CharT __c, size_type __pos = 0) const | |
| noexcept; | |
| # 2750 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_not_of(const basic_string& __str, size_type __pos = npos) const | |
| noexcept | |
| { return this->find_last_not_of(__str.data(), __pos, __str.size()); } | |
| # 2785 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_not_of(const _CharT* __s, size_type __pos, | |
| size_type __n) const noexcept; | |
| # 2799 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_not_of(const _CharT* __s, size_type __pos = npos) const | |
| noexcept | |
| { | |
| ; | |
| return this->find_last_not_of(__s, __pos, traits_type::length(__s)); | |
| } | |
| # 2817 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| size_type | |
| find_last_not_of(_CharT __c, size_type __pos = npos) const | |
| noexcept; | |
| # 2833 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| basic_string | |
| substr(size_type __pos = 0, size_type __n = npos) const | |
| { return basic_string(*this, | |
| _M_check(__pos, "basic_string::substr"), __n); } | |
| # 2852 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| int | |
| compare(const basic_string& __str) const | |
| { | |
| const size_type __size = this->size(); | |
| const size_type __osize = __str.size(); | |
| const size_type __len = std::min(__size, __osize); | |
| int __r = traits_type::compare(_M_data(), __str.data(), __len); | |
| if (!__r) | |
| __r = _S_compare(__size, __osize); | |
| return __r; | |
| } | |
| # 2945 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| int | |
| compare(size_type __pos, size_type __n, const basic_string& __str) const; | |
| # 2971 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| int | |
| compare(size_type __pos1, size_type __n1, const basic_string& __str, | |
| size_type __pos2, size_type __n2 = npos) const; | |
| # 2989 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| int | |
| compare(const _CharT* __s) const noexcept; | |
| # 3013 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| int | |
| compare(size_type __pos, size_type __n1, const _CharT* __s) const; | |
| # 3040 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| int | |
| compare(size_type __pos, size_type __n1, const _CharT* __s, | |
| size_type __n2) const; | |
| # 3071 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename, typename, typename> friend class basic_stringbuf; | |
| }; | |
| } | |
| # 6018 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT, _Traits, _Alloc> | |
| operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| { | |
| basic_string<_CharT, _Traits, _Alloc> __str(__lhs); | |
| __str.append(__rhs); | |
| return __str; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT,_Traits,_Alloc> | |
| operator+(const _CharT* __lhs, | |
| const basic_string<_CharT,_Traits,_Alloc>& __rhs); | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT,_Traits,_Alloc> | |
| operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const _CharT* __rhs) | |
| { | |
| basic_string<_CharT, _Traits, _Alloc> __str(__lhs); | |
| __str.append(__rhs); | |
| return __str; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) | |
| { | |
| typedef basic_string<_CharT, _Traits, _Alloc> __string_type; | |
| typedef typename __string_type::size_type __size_type; | |
| __string_type __str(__lhs); | |
| __str.append(__size_type(1), __rhs); | |
| return __str; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| { return std::move(__lhs.append(__rhs)); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| basic_string<_CharT, _Traits, _Alloc>&& __rhs) | |
| { return std::move(__rhs.insert(0, __lhs)); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs, | |
| basic_string<_CharT, _Traits, _Alloc>&& __rhs) | |
| { | |
| const auto __size = __lhs.size() + __rhs.size(); | |
| const bool __cond = (__size > __lhs.capacity() | |
| && __size <= __rhs.capacity()); | |
| return __cond ? std::move(__rhs.insert(0, __lhs)) | |
| : std::move(__lhs.append(__rhs)); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(const _CharT* __lhs, | |
| basic_string<_CharT, _Traits, _Alloc>&& __rhs) | |
| { return std::move(__rhs.insert(0, __lhs)); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(_CharT __lhs, | |
| basic_string<_CharT, _Traits, _Alloc>&& __rhs) | |
| { return std::move(__rhs.insert(0, 1, __lhs)); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs, | |
| const _CharT* __rhs) | |
| { return std::move(__lhs.append(__rhs)); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_string<_CharT, _Traits, _Alloc> | |
| operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs, | |
| _CharT __rhs) | |
| { return std::move(__lhs.append(1, __rhs)); } | |
| # 6139 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept | |
| { return __lhs.compare(__rhs) == 0; } | |
| template<typename _CharT> | |
| inline | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type | |
| operator==(const basic_string<_CharT>& __lhs, | |
| const basic_string<_CharT>& __rhs) noexcept | |
| { return (__lhs.size() == __rhs.size() | |
| && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(), | |
| __lhs.size())); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator==(const _CharT* __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| { return __rhs.compare(__lhs) == 0; } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const _CharT* __rhs) | |
| { return __lhs.compare(__rhs) == 0; } | |
| # 6186 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept | |
| { return !(__lhs == __rhs); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator!=(const _CharT* __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| { return !(__lhs == __rhs); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const _CharT* __rhs) | |
| { return !(__lhs == __rhs); } | |
| # 6224 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept | |
| { 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; } | |
| # 6262 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept | |
| { 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; } | |
| # 6300 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept | |
| { 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; } | |
| # 6338 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline bool | |
| operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept | |
| { 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; } | |
| # 6376 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline void | |
| swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, | |
| basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| noexcept(noexcept(__lhs.swap(__rhs))) | |
| { __lhs.swap(__rhs); } | |
| # 6396 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_istream<_CharT, _Traits>& | |
| operator>>(basic_istream<_CharT, _Traits>& __is, | |
| basic_string<_CharT, _Traits, _Alloc>& __str); | |
| template<> | |
| basic_istream<char>& | |
| operator>>(basic_istream<char>& __is, basic_string<char>& __str); | |
| # 6414 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_ostream<_CharT, _Traits>& | |
| operator<<(basic_ostream<_CharT, _Traits>& __os, | |
| const basic_string<_CharT, _Traits, _Alloc>& __str) | |
| { | |
| return __ostream_insert(__os, __str.data(), __str.size()); | |
| } | |
| # 6437 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_istream<_CharT, _Traits>& | |
| getline(basic_istream<_CharT, _Traits>& __is, | |
| basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim); | |
| # 6454 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_istream<_CharT, _Traits>& | |
| getline(basic_istream<_CharT, _Traits>& __is, | |
| basic_string<_CharT, _Traits, _Alloc>& __str) | |
| { return std::getline(__is, __str, __is.widen('\n')); } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| inline basic_istream<_CharT, _Traits>& | |
| getline(basic_istream<_CharT, _Traits>&& __is, | |
| basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) | |
| { return std::getline(__is, __str, __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) | |
| { return std::getline(__is, __str); } | |
| template<> | |
| basic_istream<char>& | |
| getline(basic_istream<char>& __in, basic_string<char>& __str, | |
| char __delim); | |
| template<> | |
| basic_istream<wchar_t>& | |
| getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str, | |
| wchar_t __delim); | |
| } | |
| # 1 "/usr/sgug/include/c++/9/ext/string_conversions.h" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/ext/string_conversions.h" 3 | |
| # 33 "/usr/sgug/include/c++/9/ext/string_conversions.h" 3 | |
| # 41 "/usr/sgug/include/c++/9/ext/string_conversions.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/cstdlib" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 40 "/usr/sgug/include/c++/9/cstdlib" 3 | |
| # 42 "/usr/sgug/include/c++/9/ext/string_conversions.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/cwchar" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cwchar" 3 | |
| # 40 "/usr/sgug/include/c++/9/cwchar" 3 | |
| # 43 "/usr/sgug/include/c++/9/ext/string_conversions.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/cstdio" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cstdio" 3 | |
| # 40 "/usr/sgug/include/c++/9/cstdio" 3 | |
| # 96 "/usr/sgug/include/c++/9/cstdio" 3 | |
| namespace std | |
| { | |
| using ::FILE; | |
| using ::fpos_t; | |
| using ::clearerr; | |
| using ::fclose; | |
| using ::feof; | |
| using ::ferror; | |
| using ::fflush; | |
| using ::fgetc; | |
| using ::fgetpos; | |
| using ::fgets; | |
| using ::fopen; | |
| using ::fprintf; | |
| using ::fputc; | |
| using ::fputs; | |
| using ::fread; | |
| using ::freopen; | |
| using ::fscanf; | |
| using ::fseek; | |
| using ::fsetpos; | |
| using ::ftell; | |
| using ::fwrite; | |
| using ::getc; | |
| using ::getchar; | |
| using ::perror; | |
| using ::printf; | |
| using ::putc; | |
| using ::putchar; | |
| using ::puts; | |
| using ::remove; | |
| using ::rename; | |
| using ::rewind; | |
| using ::scanf; | |
| using ::setbuf; | |
| using ::setvbuf; | |
| using ::sprintf; | |
| using ::sscanf; | |
| using ::tmpfile; | |
| using ::tmpnam; | |
| using ::ungetc; | |
| using ::vfprintf; | |
| using ::vprintf; | |
| using ::vsprintf; | |
| } | |
| # 157 "/usr/sgug/include/c++/9/cstdio" 3 | |
| namespace __gnu_cxx | |
| { | |
| # 175 "/usr/sgug/include/c++/9/cstdio" 3 | |
| using ::snprintf; | |
| using ::vfscanf; | |
| using ::vscanf; | |
| using ::vsnprintf; | |
| using ::vsscanf; | |
| } | |
| namespace std | |
| { | |
| using ::__gnu_cxx::snprintf; | |
| using ::__gnu_cxx::vfscanf; | |
| using ::__gnu_cxx::vscanf; | |
| using ::__gnu_cxx::vsnprintf; | |
| using ::__gnu_cxx::vsscanf; | |
| } | |
| # 44 "/usr/sgug/include/c++/9/ext/string_conversions.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/cerrno" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cerrno" 3 | |
| # 40 "/usr/sgug/include/c++/9/cerrno" 3 | |
| # 45 "/usr/sgug/include/c++/9/ext/string_conversions.h" 2 3 | |
| namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _TRet, typename _Ret = _TRet, typename _CharT, | |
| typename... _Base> | |
| _Ret | |
| __stoa(_TRet (*__convf) (const _CharT*, _CharT**, _Base...), | |
| const char* __name, const _CharT* __str, std::size_t* __idx, | |
| _Base... __base) | |
| { | |
| _Ret __ret; | |
| _CharT* __endptr; | |
| struct _Save_errno { | |
| _Save_errno() : _M_errno((*__oserror())) { (*__oserror()) = 0; } | |
| ~_Save_errno() { if ((*__oserror()) == 0) (*__oserror()) = _M_errno; } | |
| int _M_errno; | |
| } const __save_errno; | |
| struct _Range_chk { | |
| static bool | |
| _S_chk(_TRet, std::false_type) { return false; } | |
| static bool | |
| _S_chk(_TRet __val, std::true_type) | |
| { | |
| return __val < _TRet(__numeric_traits<int>::__min) | |
| || __val > _TRet(__numeric_traits<int>::__max); | |
| } | |
| }; | |
| const _TRet __tmp = __convf(__str, &__endptr, __base...); | |
| if (__endptr == __str) | |
| std::__throw_invalid_argument(__name); | |
| else if ((*__oserror()) == 34 | |
| || _Range_chk::_S_chk(__tmp, std::is_same<_Ret, int>{})) | |
| std::__throw_out_of_range(__name); | |
| else | |
| __ret = __tmp; | |
| if (__idx) | |
| *__idx = __endptr - __str; | |
| return __ret; | |
| } | |
| template<typename _String, typename _CharT = typename _String::value_type> | |
| _String | |
| __to_xstring(int (*__convf) (_CharT*, std::size_t, const _CharT*, | |
| __builtin_va_list), std::size_t __n, | |
| const _CharT* __fmt, ...) | |
| { | |
| _CharT* __s = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __n)); | |
| __builtin_va_list __args; | |
| __builtin_va_start(__args, __fmt); | |
| const int __len = __convf(__s, __n, __fmt, __args); | |
| __builtin_va_end(__args); | |
| return _String(__s, __s + __len); | |
| } | |
| } | |
| # 6494 "/usr/sgug/include/c++/9/bits/basic_string.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| namespace __cxx11 { | |
| inline int | |
| stoi(const string& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa<long, int>(&std:: | |
| # 6504 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtol | |
| # 6504 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stoi", __str.c_str(), | |
| __idx, __base); } | |
| inline long | |
| stol(const string& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std:: | |
| # 6509 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtol | |
| # 6509 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stol", __str.c_str(), | |
| __idx, __base); } | |
| inline unsigned long | |
| stoul(const string& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std:: | |
| # 6514 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtoul | |
| # 6514 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stoul", __str.c_str(), | |
| __idx, __base); } | |
| inline long long | |
| stoll(const string& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std:: | |
| # 6519 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtoll | |
| # 6519 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stoll", __str.c_str(), | |
| __idx, __base); } | |
| inline unsigned long long | |
| stoull(const string& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std:: | |
| # 6524 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtoull | |
| # 6524 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stoull", __str.c_str(), | |
| __idx, __base); } | |
| inline float | |
| stof(const string& __str, size_t* __idx = 0) | |
| { return __gnu_cxx::__stoa(&std::strtof, "stof", __str.c_str(), __idx); } | |
| inline double | |
| stod(const string& __str, size_t* __idx = 0) | |
| { return __gnu_cxx::__stoa(&std:: | |
| # 6534 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtod | |
| # 6534 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stod", __str.c_str(), __idx); } | |
| inline long double | |
| stold(const string& __str, size_t* __idx = 0) | |
| { return __gnu_cxx::__stoa(&std:: | |
| # 6538 "/usr/sgug/include/c++/9/bits/basic_string.h" | |
| ld_strtold | |
| # 6538 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| , "stold", __str.c_str(), __idx); } | |
| inline string | |
| to_string(int __val) | |
| { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, 4 * sizeof(int), | |
| "%d", __val); } | |
| inline string | |
| to_string(unsigned __val) | |
| { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, | |
| 4 * sizeof(unsigned), | |
| "%u", __val); } | |
| inline string | |
| to_string(long __val) | |
| { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, 4 * sizeof(long), | |
| "%ld", __val); } | |
| inline string | |
| to_string(unsigned long __val) | |
| { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, | |
| 4 * sizeof(unsigned long), | |
| "%lu", __val); } | |
| inline string | |
| to_string(long long __val) | |
| { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, | |
| 4 * sizeof(long long), | |
| "%lld", __val); } | |
| inline string | |
| to_string(unsigned long long __val) | |
| { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, | |
| 4 * sizeof(unsigned long long), | |
| "%llu", __val); } | |
| inline string | |
| to_string(float __val) | |
| { | |
| const int __n = | |
| __gnu_cxx::__numeric_traits<float>::__max_exponent10 + 20; | |
| return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n, | |
| "%f", __val); | |
| } | |
| inline string | |
| to_string(double __val) | |
| { | |
| const int __n = | |
| __gnu_cxx::__numeric_traits<double>::__max_exponent10 + 20; | |
| return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n, | |
| "%f", __val); | |
| } | |
| inline string | |
| to_string(long double __val) | |
| { | |
| const int __n = | |
| __gnu_cxx::__numeric_traits<long double>::__max_exponent10 + 20; | |
| return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n, | |
| "%Lf", __val); | |
| } | |
| inline int | |
| stoi(const wstring& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa<long, int>(&std::wcstol, "stoi", __str.c_str(), | |
| __idx, __base); } | |
| inline long | |
| stol(const wstring& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std::wcstol, "stol", __str.c_str(), | |
| __idx, __base); } | |
| inline unsigned long | |
| stoul(const wstring& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std::wcstoul, "stoul", __str.c_str(), | |
| __idx, __base); } | |
| inline long long | |
| stoll(const wstring& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std::wcstoll, "stoll", __str.c_str(), | |
| __idx, __base); } | |
| inline unsigned long long | |
| stoull(const wstring& __str, size_t* __idx = 0, int __base = 10) | |
| { return __gnu_cxx::__stoa(&std::wcstoull, "stoull", __str.c_str(), | |
| __idx, __base); } | |
| inline float | |
| stof(const wstring& __str, size_t* __idx = 0) | |
| { return __gnu_cxx::__stoa(&std::wcstof, "stof", __str.c_str(), __idx); } | |
| inline double | |
| stod(const wstring& __str, size_t* __idx = 0) | |
| { return __gnu_cxx::__stoa(&std::wcstod, "stod", __str.c_str(), __idx); } | |
| inline long double | |
| stold(const wstring& __str, size_t* __idx = 0) | |
| { return __gnu_cxx::__stoa(&std::wcstold, "stold", __str.c_str(), __idx); } | |
| inline wstring | |
| to_wstring(int __val) | |
| { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, 4 * sizeof(int), | |
| L"%d", __val); } | |
| inline wstring | |
| to_wstring(unsigned __val) | |
| { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, | |
| 4 * sizeof(unsigned), | |
| L"%u", __val); } | |
| inline wstring | |
| to_wstring(long __val) | |
| { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, 4 * sizeof(long), | |
| L"%ld", __val); } | |
| inline wstring | |
| to_wstring(unsigned long __val) | |
| { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, | |
| 4 * sizeof(unsigned long), | |
| L"%lu", __val); } | |
| inline wstring | |
| to_wstring(long long __val) | |
| { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, | |
| 4 * sizeof(long long), | |
| L"%lld", __val); } | |
| inline wstring | |
| to_wstring(unsigned long long __val) | |
| { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, | |
| 4 * sizeof(unsigned long long), | |
| L"%llu", __val); } | |
| inline wstring | |
| to_wstring(float __val) | |
| { | |
| const int __n = | |
| __gnu_cxx::__numeric_traits<float>::__max_exponent10 + 20; | |
| return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n, | |
| L"%f", __val); | |
| } | |
| inline wstring | |
| to_wstring(double __val) | |
| { | |
| const int __n = | |
| __gnu_cxx::__numeric_traits<double>::__max_exponent10 + 20; | |
| return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n, | |
| L"%f", __val); | |
| } | |
| inline wstring | |
| to_wstring(long double __val) | |
| { | |
| const int __n = | |
| __gnu_cxx::__numeric_traits<long double>::__max_exponent10 + 20; | |
| return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n, | |
| L"%Lf", __val); | |
| } | |
| } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/functional_hash.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/functional_hash.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/functional_hash.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 49 "/usr/sgug/include/c++/9/bits/functional_hash.h" 3 | |
| template<typename _Result, typename _Arg> | |
| struct __hash_base | |
| { | |
| typedef _Result result_type ; | |
| typedef _Arg argument_type ; | |
| }; | |
| template<typename _Tp> | |
| struct hash; | |
| template<typename _Tp, typename = void> | |
| struct __poison_hash | |
| { | |
| static constexpr bool __enable_hash_call = false; | |
| private: | |
| __poison_hash(__poison_hash&&); | |
| ~__poison_hash(); | |
| }; | |
| template<typename _Tp> | |
| struct __poison_hash<_Tp, __void_t<decltype(hash<_Tp>()(declval<_Tp>()))>> | |
| { | |
| static constexpr bool __enable_hash_call = true; | |
| }; | |
| template<typename _Tp, bool = is_enum<_Tp>::value> | |
| struct __hash_enum | |
| { | |
| private: | |
| __hash_enum(__hash_enum&&); | |
| ~__hash_enum(); | |
| }; | |
| template<typename _Tp> | |
| struct __hash_enum<_Tp, true> : public __hash_base<size_t, _Tp> | |
| { | |
| size_t | |
| operator()(_Tp __val) const noexcept | |
| { | |
| using __type = typename underlying_type<_Tp>::type; | |
| return hash<__type>{}(static_cast<__type>(__val)); | |
| } | |
| }; | |
| template<typename _Tp> | |
| struct hash : __hash_enum<_Tp> | |
| { }; | |
| template<typename _Tp> | |
| struct hash<_Tp*> : public __hash_base<size_t, _Tp*> | |
| { | |
| size_t | |
| operator()(_Tp* __p) const noexcept | |
| { return reinterpret_cast<size_t>(__p); } | |
| }; | |
| # 124 "/usr/sgug/include/c++/9/bits/functional_hash.h" 3 | |
| template<> struct hash<bool> : public __hash_base<size_t, bool> { size_t operator()(bool __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<char> : public __hash_base<size_t, char> { size_t operator()(char __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<signed char> : public __hash_base<size_t, signed char> { size_t operator()(signed char __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<unsigned char> : public __hash_base<size_t, unsigned char> { size_t operator()(unsigned char __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<wchar_t> : public __hash_base<size_t, wchar_t> { size_t operator()(wchar_t __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<char16_t> : public __hash_base<size_t, char16_t> { size_t operator()(char16_t __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<char32_t> : public __hash_base<size_t, char32_t> { size_t operator()(char32_t __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<short> : public __hash_base<size_t, short> { size_t operator()(short __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<int> : public __hash_base<size_t, int> { size_t operator()(int __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<long> : public __hash_base<size_t, long> { size_t operator()(long __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<long long> : public __hash_base<size_t, long long> { size_t operator()(long long __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<unsigned short> : public __hash_base<size_t, unsigned short> { size_t operator()(unsigned short __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<unsigned int> : public __hash_base<size_t, unsigned int> { size_t operator()(unsigned int __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<unsigned long> : public __hash_base<size_t, unsigned long> { size_t operator()(unsigned long __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| template<> struct hash<unsigned long long> : public __hash_base<size_t, unsigned long long> { size_t operator()(unsigned long long __val) const noexcept { return static_cast<size_t>(__val); } }; | |
| # 192 "/usr/sgug/include/c++/9/bits/functional_hash.h" 3 | |
| struct _Hash_impl | |
| { | |
| static size_t | |
| hash(const void* __ptr, size_t __clength, | |
| size_t __seed = static_cast<size_t>(0xc70f6907UL)) | |
| { return _Hash_bytes(__ptr, __clength, __seed); } | |
| template<typename _Tp> | |
| static size_t | |
| hash(const _Tp& __val) | |
| { return hash(&__val, sizeof(__val)); } | |
| template<typename _Tp> | |
| static size_t | |
| __hash_combine(const _Tp& __val, size_t __hash) | |
| { return hash(&__val, sizeof(__val), __hash); } | |
| }; | |
| struct _Fnv_hash_impl | |
| { | |
| static size_t | |
| hash(const void* __ptr, size_t __clength, | |
| size_t __seed = static_cast<size_t>(2166136261UL)) | |
| { return _Fnv_hash_bytes(__ptr, __clength, __seed); } | |
| template<typename _Tp> | |
| static size_t | |
| hash(const _Tp& __val) | |
| { return hash(&__val, sizeof(__val)); } | |
| template<typename _Tp> | |
| static size_t | |
| __hash_combine(const _Tp& __val, size_t __hash) | |
| { return hash(&__val, sizeof(__val), __hash); } | |
| }; | |
| template<> | |
| struct hash<float> : public __hash_base<size_t, float> | |
| { | |
| size_t | |
| operator()(float __val) const noexcept | |
| { | |
| return __val != 0.0f ? std::_Hash_impl::hash(__val) : 0; | |
| } | |
| }; | |
| template<> | |
| struct hash<double> : public __hash_base<size_t, double> | |
| { | |
| size_t | |
| operator()(double __val) const noexcept | |
| { | |
| return __val != 0.0 ? std::_Hash_impl::hash(__val) : 0; | |
| } | |
| }; | |
| template<> | |
| struct hash<long double> | |
| : public __hash_base<size_t, long double> | |
| { | |
| __attribute__ ((__pure__)) size_t | |
| operator()(long double __val) const noexcept; | |
| }; | |
| # 278 "/usr/sgug/include/c++/9/bits/functional_hash.h" 3 | |
| template<typename _Hash> | |
| struct __is_fast_hash : public std::true_type | |
| { }; | |
| template<> | |
| struct __is_fast_hash<hash<long double>> : public std::false_type | |
| { }; | |
| } | |
| # 6720 "/usr/sgug/include/c++/9/bits/basic_string.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<> | |
| struct hash<string> | |
| : public __hash_base<size_t, string> | |
| { | |
| size_t | |
| operator()(const string& __s) const noexcept | |
| { return std::_Hash_impl::hash(__s.data(), __s.length()); } | |
| }; | |
| template<> | |
| struct __is_fast_hash<hash<string>> : std::false_type | |
| { }; | |
| template<> | |
| struct hash<wstring> | |
| : public __hash_base<size_t, wstring> | |
| { | |
| size_t | |
| operator()(const wstring& __s) const noexcept | |
| { return std::_Hash_impl::hash(__s.data(), | |
| __s.length() * sizeof(wchar_t)); } | |
| }; | |
| template<> | |
| struct __is_fast_hash<hash<wstring>> : std::false_type | |
| { }; | |
| # 6778 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| template<> | |
| struct hash<u16string> | |
| : public __hash_base<size_t, u16string> | |
| { | |
| size_t | |
| operator()(const u16string& __s) const noexcept | |
| { return std::_Hash_impl::hash(__s.data(), | |
| __s.length() * sizeof(char16_t)); } | |
| }; | |
| template<> | |
| struct __is_fast_hash<hash<u16string>> : std::false_type | |
| { }; | |
| template<> | |
| struct hash<u32string> | |
| : public __hash_base<size_t, u32string> | |
| { | |
| size_t | |
| operator()(const u32string& __s) const noexcept | |
| { return std::_Hash_impl::hash(__s.data(), | |
| __s.length() * sizeof(char32_t)); } | |
| }; | |
| template<> | |
| struct __is_fast_hash<hash<u32string>> : std::false_type | |
| { }; | |
| inline namespace literals | |
| { | |
| inline namespace string_literals | |
| { | |
| #pragma GCC diagnostic push | |
| #pragma GCC diagnostic ignored "-Wliteral-suffix" | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| inline basic_string<char> | |
| operator""s(const char* __str, size_t __len) | |
| { return basic_string<char>{__str, __len}; } | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| inline basic_string<wchar_t> | |
| operator""s(const wchar_t* __str, size_t __len) | |
| { return basic_string<wchar_t>{__str, __len}; } | |
| # 6836 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| inline basic_string<char16_t> | |
| operator""s(const char16_t* __str, size_t __len) | |
| { return basic_string<char16_t>{__str, __len}; } | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| inline basic_string<char32_t> | |
| operator""s(const char32_t* __str, size_t __len) | |
| { return basic_string<char32_t>{__str, __len}; } | |
| #pragma GCC diagnostic pop | |
| } | |
| } | |
| # 6868 "/usr/sgug/include/c++/9/bits/basic_string.h" 3 | |
| } | |
| # 56 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/basic_string.tcc" 1 3 | |
| # 42 "/usr/sgug/include/c++/9/bits/basic_string.tcc" 3 | |
| # 43 "/usr/sgug/include/c++/9/bits/basic_string.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| const typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>::npos; | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| swap(basic_string& __s) noexcept | |
| { | |
| if (this == &__s) | |
| return; | |
| _Alloc_traits::_S_on_swap(_M_get_allocator(), __s._M_get_allocator()); | |
| if (_M_is_local()) | |
| if (__s._M_is_local()) | |
| { | |
| if (length() && __s.length()) | |
| { | |
| _CharT __tmp_data[_S_local_capacity + 1]; | |
| traits_type::copy(__tmp_data, __s._M_local_buf, | |
| _S_local_capacity + 1); | |
| traits_type::copy(__s._M_local_buf, _M_local_buf, | |
| _S_local_capacity + 1); | |
| traits_type::copy(_M_local_buf, __tmp_data, | |
| _S_local_capacity + 1); | |
| } | |
| else if (__s.length()) | |
| { | |
| traits_type::copy(_M_local_buf, __s._M_local_buf, | |
| _S_local_capacity + 1); | |
| _M_length(__s.length()); | |
| __s._M_set_length(0); | |
| return; | |
| } | |
| else if (length()) | |
| { | |
| traits_type::copy(__s._M_local_buf, _M_local_buf, | |
| _S_local_capacity + 1); | |
| __s._M_length(length()); | |
| _M_set_length(0); | |
| return; | |
| } | |
| } | |
| else | |
| { | |
| const size_type __tmp_capacity = __s._M_allocated_capacity; | |
| traits_type::copy(__s._M_local_buf, _M_local_buf, | |
| _S_local_capacity + 1); | |
| _M_data(__s._M_data()); | |
| __s._M_data(__s._M_local_buf); | |
| _M_capacity(__tmp_capacity); | |
| } | |
| else | |
| { | |
| const size_type __tmp_capacity = _M_allocated_capacity; | |
| if (__s._M_is_local()) | |
| { | |
| traits_type::copy(_M_local_buf, __s._M_local_buf, | |
| _S_local_capacity + 1); | |
| __s._M_data(_M_data()); | |
| _M_data(_M_local_buf); | |
| } | |
| else | |
| { | |
| pointer __tmp_ptr = _M_data(); | |
| _M_data(__s._M_data()); | |
| __s._M_data(__tmp_ptr); | |
| _M_capacity(__s._M_allocated_capacity); | |
| } | |
| __s._M_capacity(__tmp_capacity); | |
| } | |
| const size_type __tmp_length = length(); | |
| _M_length(__s.length()); | |
| __s._M_length(__tmp_length); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::pointer | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_create(size_type& __capacity, size_type __old_capacity) | |
| { | |
| if (__capacity > max_size()) | |
| std::__throw_length_error(("basic_string::_M_create")); | |
| if (__capacity > __old_capacity && __capacity < 2 * __old_capacity) | |
| { | |
| __capacity = 2 * __old_capacity; | |
| if (__capacity > max_size()) | |
| __capacity = max_size(); | |
| } | |
| return _Alloc_traits::allocate(_M_get_allocator(), __capacity + 1); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| template<typename _InIterator> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_construct(_InIterator __beg, _InIterator __end, | |
| std::input_iterator_tag) | |
| { | |
| size_type __len = 0; | |
| size_type __capacity = size_type(_S_local_capacity); | |
| while (__beg != __end && __len < __capacity) | |
| { | |
| _M_data()[__len++] = *__beg; | |
| ++__beg; | |
| } | |
| if (true) | |
| { | |
| while (__beg != __end) | |
| { | |
| if (__len == __capacity) | |
| { | |
| __capacity = __len + 1; | |
| pointer __another = _M_create(__capacity, __len); | |
| this->_S_copy(__another, _M_data(), __len); | |
| _M_dispose(); | |
| _M_data(__another); | |
| _M_capacity(__capacity); | |
| } | |
| _M_data()[__len++] = *__beg; | |
| ++__beg; | |
| } | |
| } | |
| if (false) | |
| { | |
| _M_dispose(); | |
| ; | |
| } | |
| _M_set_length(__len); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| template<typename _InIterator> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_construct(_InIterator __beg, _InIterator __end, | |
| std::forward_iterator_tag) | |
| { | |
| if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end) | |
| std::__throw_logic_error(("basic_string::" "_M_construct null not valid") | |
| ); | |
| size_type __dnew = static_cast<size_type>(std::distance(__beg, __end)); | |
| if (__dnew > size_type(_S_local_capacity)) | |
| { | |
| _M_data(_M_create(__dnew, size_type(0))); | |
| _M_capacity(__dnew); | |
| } | |
| if (true) | |
| { this->_S_copy_chars(_M_data(), __beg, __end); } | |
| if (false) | |
| { | |
| _M_dispose(); | |
| ; | |
| } | |
| _M_set_length(__dnew); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_construct(size_type __n, _CharT __c) | |
| { | |
| if (__n > size_type(_S_local_capacity)) | |
| { | |
| _M_data(_M_create(__n, size_type(0))); | |
| _M_capacity(__n); | |
| } | |
| if (__n) | |
| this->_S_assign(_M_data(), __n, __c); | |
| _M_set_length(__n); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_assign(const basic_string& __str) | |
| { | |
| if (this != &__str) | |
| { | |
| const size_type __rsize = __str.length(); | |
| const size_type __capacity = capacity(); | |
| if (__rsize > __capacity) | |
| { | |
| size_type __new_capacity = __rsize; | |
| pointer __tmp = _M_create(__new_capacity, __capacity); | |
| _M_dispose(); | |
| _M_data(__tmp); | |
| _M_capacity(__new_capacity); | |
| } | |
| if (__rsize) | |
| this->_S_copy(_M_data(), __str._M_data(), __rsize); | |
| _M_set_length(__rsize); | |
| } | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| reserve(size_type __res) | |
| { | |
| if (__res < length()) | |
| __res = length(); | |
| const size_type __capacity = capacity(); | |
| if (__res != __capacity) | |
| { | |
| if (__res > __capacity | |
| || __res > size_type(_S_local_capacity)) | |
| { | |
| pointer __tmp = _M_create(__res, __capacity); | |
| this->_S_copy(__tmp, _M_data(), length() + 1); | |
| _M_dispose(); | |
| _M_data(__tmp); | |
| _M_capacity(__res); | |
| } | |
| else if (!_M_is_local()) | |
| { | |
| this->_S_copy(_M_local_data(), _M_data(), length() + 1); | |
| _M_destroy(__capacity); | |
| _M_data(_M_local_data()); | |
| } | |
| } | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_mutate(size_type __pos, size_type __len1, const _CharT* __s, | |
| size_type __len2) | |
| { | |
| const size_type __how_much = length() - __pos - __len1; | |
| size_type __new_capacity = length() + __len2 - __len1; | |
| pointer __r = _M_create(__new_capacity, capacity()); | |
| if (__pos) | |
| this->_S_copy(__r, _M_data(), __pos); | |
| if (__s && __len2) | |
| this->_S_copy(__r + __pos, __s, __len2); | |
| if (__how_much) | |
| this->_S_copy(__r + __pos + __len2, | |
| _M_data() + __pos + __len1, __how_much); | |
| _M_dispose(); | |
| _M_data(__r); | |
| _M_capacity(__new_capacity); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_erase(size_type __pos, size_type __n) | |
| { | |
| const size_type __how_much = length() - __pos - __n; | |
| if (__how_much && __n) | |
| this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, __how_much); | |
| _M_set_length(length() - __n); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| void | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| resize(size_type __n, _CharT __c) | |
| { | |
| const size_type __size = this->size(); | |
| if (__size < __n) | |
| this->append(__n - __size, __c); | |
| else if (__n < __size) | |
| this->_M_set_length(__n); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT, _Traits, _Alloc>& | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_append(const _CharT* __s, size_type __n) | |
| { | |
| const size_type __len = __n + this->size(); | |
| if (__len <= this->capacity()) | |
| { | |
| if (__n) | |
| this->_S_copy(this->_M_data() + this->size(), __s, __n); | |
| } | |
| else | |
| this->_M_mutate(this->size(), size_type(0), __s, __n); | |
| this->_M_set_length(__len); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| template<typename _InputIterator> | |
| basic_string<_CharT, _Traits, _Alloc>& | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_replace_dispatch(const_iterator __i1, const_iterator __i2, | |
| _InputIterator __k1, _InputIterator __k2, | |
| std::__false_type) | |
| { | |
| const basic_string __s(__k1, __k2); | |
| const size_type __n1 = __i2 - __i1; | |
| return _M_replace(__i1 - begin(), __n1, __s._M_data(), | |
| __s.size()); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT, _Traits, _Alloc>& | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, | |
| _CharT __c) | |
| { | |
| _M_check_length(__n1, __n2, "basic_string::_M_replace_aux"); | |
| const size_type __old_size = this->size(); | |
| const size_type __new_size = __old_size + __n2 - __n1; | |
| if (__new_size <= this->capacity()) | |
| { | |
| pointer __p = this->_M_data() + __pos1; | |
| const size_type __how_much = __old_size - __pos1 - __n1; | |
| if (__how_much && __n1 != __n2) | |
| this->_S_move(__p + __n2, __p + __n1, __how_much); | |
| } | |
| else | |
| this->_M_mutate(__pos1, __n1, 0, __n2); | |
| if (__n2) | |
| this->_S_assign(this->_M_data() + __pos1, __n2, __c); | |
| this->_M_set_length(__new_size); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT, _Traits, _Alloc>& | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| _M_replace(size_type __pos, size_type __len1, const _CharT* __s, | |
| const size_type __len2) | |
| { | |
| _M_check_length(__len1, __len2, "basic_string::_M_replace"); | |
| const size_type __old_size = this->size(); | |
| const size_type __new_size = __old_size + __len2 - __len1; | |
| if (__new_size <= this->capacity()) | |
| { | |
| pointer __p = this->_M_data() + __pos; | |
| const size_type __how_much = __old_size - __pos - __len1; | |
| if (_M_disjunct(__s)) | |
| { | |
| if (__how_much && __len1 != __len2) | |
| this->_S_move(__p + __len2, __p + __len1, __how_much); | |
| if (__len2) | |
| this->_S_copy(__p, __s, __len2); | |
| } | |
| else | |
| { | |
| if (__len2 && __len2 <= __len1) | |
| this->_S_move(__p, __s, __len2); | |
| if (__how_much && __len1 != __len2) | |
| this->_S_move(__p + __len2, __p + __len1, __how_much); | |
| if (__len2 > __len1) | |
| { | |
| if (__s + __len2 <= __p + __len1) | |
| this->_S_move(__p, __s, __len2); | |
| else if (__s >= __p + __len1) | |
| this->_S_copy(__p, __s + __len2 - __len1, __len2); | |
| else | |
| { | |
| const size_type __nleft = (__p + __len1) - __s; | |
| this->_S_move(__p, __s, __nleft); | |
| this->_S_copy(__p + __nleft, __p + __len2, | |
| __len2 - __nleft); | |
| } | |
| } | |
| } | |
| } | |
| else | |
| this->_M_mutate(__pos, __len1, __s, __len2); | |
| this->_M_set_length(__new_size); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| copy(_CharT* __s, size_type __n, size_type __pos) const | |
| { | |
| _M_check(__pos, "basic_string::copy"); | |
| __n = _M_limit(__pos, __n); | |
| ; | |
| if (__n) | |
| _S_copy(__s, _M_data() + __pos, __n); | |
| return __n; | |
| } | |
| # 1156 "/usr/sgug/include/c++/9/bits/basic_string.tcc" 3 | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT, _Traits, _Alloc> | |
| operator+(const _CharT* __lhs, | |
| const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| { | |
| ; | |
| typedef basic_string<_CharT, _Traits, _Alloc> __string_type; | |
| typedef typename __string_type::size_type __size_type; | |
| const __size_type __len = _Traits::length(__lhs); | |
| __string_type __str; | |
| __str.reserve(__len + __rhs.size()); | |
| __str.append(__lhs, __len); | |
| __str.append(__rhs); | |
| return __str; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_string<_CharT, _Traits, _Alloc> | |
| operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) | |
| { | |
| typedef basic_string<_CharT, _Traits, _Alloc> __string_type; | |
| typedef typename __string_type::size_type __size_type; | |
| __string_type __str; | |
| const __size_type __len = __rhs.size(); | |
| __str.reserve(__len + 1); | |
| __str.append(__size_type(1), __lhs); | |
| __str.append(__rhs); | |
| return __str; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept | |
| { | |
| ; | |
| const size_type __size = this->size(); | |
| if (__n == 0) | |
| return __pos <= __size ? __pos : npos; | |
| if (__pos >= __size) | |
| return npos; | |
| const _CharT __elem0 = __s[0]; | |
| const _CharT* const __data = data(); | |
| const _CharT* __first = __data + __pos; | |
| const _CharT* const __last = __data + __size; | |
| size_type __len = __size - __pos; | |
| while (__len >= __n) | |
| { | |
| __first = traits_type::find(__first, __len - __n + 1, __elem0); | |
| if (!__first) | |
| return npos; | |
| if (traits_type::compare(__first, __s, __n) == 0) | |
| return __first - __data; | |
| __len = __last - ++__first; | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find(_CharT __c, size_type __pos) const noexcept | |
| { | |
| size_type __ret = npos; | |
| const size_type __size = this->size(); | |
| if (__pos < __size) | |
| { | |
| const _CharT* __data = _M_data(); | |
| const size_type __n = __size - __pos; | |
| const _CharT* __p = traits_type::find(__data + __pos, __n, __c); | |
| if (__p) | |
| __ret = __p - __data; | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| rfind(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept | |
| { | |
| ; | |
| const size_type __size = this->size(); | |
| if (__n <= __size) | |
| { | |
| __pos = std::min(size_type(__size - __n), __pos); | |
| const _CharT* __data = _M_data(); | |
| do | |
| { | |
| if (traits_type::compare(__data + __pos, __s, __n) == 0) | |
| return __pos; | |
| } | |
| while (__pos-- > 0); | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| rfind(_CharT __c, size_type __pos) const noexcept | |
| { | |
| size_type __size = this->size(); | |
| if (__size) | |
| { | |
| if (--__size > __pos) | |
| __size = __pos; | |
| for (++__size; __size-- > 0; ) | |
| if (traits_type::eq(_M_data()[__size], __c)) | |
| return __size; | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find_first_of(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept | |
| { | |
| ; | |
| for (; __n && __pos < this->size(); ++__pos) | |
| { | |
| const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]); | |
| if (__p) | |
| return __pos; | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find_last_of(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept | |
| { | |
| ; | |
| size_type __size = this->size(); | |
| if (__size && __n) | |
| { | |
| if (--__size > __pos) | |
| __size = __pos; | |
| do | |
| { | |
| if (traits_type::find(__s, __n, _M_data()[__size])) | |
| return __size; | |
| } | |
| while (__size-- != 0); | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept | |
| { | |
| ; | |
| for (; __pos < this->size(); ++__pos) | |
| if (!traits_type::find(__s, __n, _M_data()[__pos])) | |
| return __pos; | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find_first_not_of(_CharT __c, size_type __pos) const noexcept | |
| { | |
| for (; __pos < this->size(); ++__pos) | |
| if (!traits_type::eq(_M_data()[__pos], __c)) | |
| return __pos; | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const | |
| noexcept | |
| { | |
| ; | |
| size_type __size = this->size(); | |
| if (__size) | |
| { | |
| if (--__size > __pos) | |
| __size = __pos; | |
| do | |
| { | |
| if (!traits_type::find(__s, __n, _M_data()[__size])) | |
| return __size; | |
| } | |
| while (__size--); | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| typename basic_string<_CharT, _Traits, _Alloc>::size_type | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| find_last_not_of(_CharT __c, size_type __pos) const noexcept | |
| { | |
| size_type __size = this->size(); | |
| if (__size) | |
| { | |
| if (--__size > __pos) | |
| __size = __pos; | |
| do | |
| { | |
| if (!traits_type::eq(_M_data()[__size], __c)) | |
| return __size; | |
| } | |
| while (__size--); | |
| } | |
| return npos; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| int | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| compare(size_type __pos, size_type __n, const basic_string& __str) const | |
| { | |
| _M_check(__pos, "basic_string::compare"); | |
| __n = _M_limit(__pos, __n); | |
| const size_type __osize = __str.size(); | |
| const size_type __len = std::min(__n, __osize); | |
| int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len); | |
| if (!__r) | |
| __r = _S_compare(__n, __osize); | |
| return __r; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| int | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| compare(size_type __pos1, size_type __n1, const basic_string& __str, | |
| size_type __pos2, size_type __n2) const | |
| { | |
| _M_check(__pos1, "basic_string::compare"); | |
| __str._M_check(__pos2, "basic_string::compare"); | |
| __n1 = _M_limit(__pos1, __n1); | |
| __n2 = __str._M_limit(__pos2, __n2); | |
| const size_type __len = std::min(__n1, __n2); | |
| int __r = traits_type::compare(_M_data() + __pos1, | |
| __str.data() + __pos2, __len); | |
| if (!__r) | |
| __r = _S_compare(__n1, __n2); | |
| return __r; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| int | |
| basic_string<_CharT, _Traits, _Alloc>:: | |
| compare(const _CharT* __s) const noexcept | |
| { | |
| ; | |
| const size_type __size = this->size(); | |
| const size_type __osize = traits_type::length(__s); | |
| const size_type __len = std::min(__size, __osize); | |
| int __r = traits_type::compare(_M_data(), __s, __len); | |
| if (!__r) | |
| __r = _S_compare(__size, __osize); | |
| return __r; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| int | |
| basic_string <_CharT, _Traits, _Alloc>:: | |
| compare(size_type __pos, size_type __n1, const _CharT* __s) const | |
| { | |
| ; | |
| _M_check(__pos, "basic_string::compare"); | |
| __n1 = _M_limit(__pos, __n1); | |
| const size_type __osize = traits_type::length(__s); | |
| const size_type __len = std::min(__n1, __osize); | |
| int __r = traits_type::compare(_M_data() + __pos, __s, __len); | |
| if (!__r) | |
| __r = _S_compare(__n1, __osize); | |
| return __r; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| int | |
| basic_string <_CharT, _Traits, _Alloc>:: | |
| compare(size_type __pos, size_type __n1, const _CharT* __s, | |
| size_type __n2) const | |
| { | |
| ; | |
| _M_check(__pos, "basic_string::compare"); | |
| __n1 = _M_limit(__pos, __n1); | |
| const size_type __len = std::min(__n1, __n2); | |
| int __r = traits_type::compare(_M_data() + __pos, __s, __len); | |
| if (!__r) | |
| __r = _S_compare(__n1, __n2); | |
| return __r; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_istream<_CharT, _Traits>& | |
| operator>>(basic_istream<_CharT, _Traits>& __in, | |
| basic_string<_CharT, _Traits, _Alloc>& __str) | |
| { | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef basic_string<_CharT, _Traits, _Alloc> __string_type; | |
| typedef typename __istream_type::ios_base __ios_base; | |
| typedef typename __istream_type::int_type __int_type; | |
| typedef typename __string_type::size_type __size_type; | |
| typedef ctype<_CharT> __ctype_type; | |
| typedef typename __ctype_type::ctype_base __ctype_base; | |
| __size_type __extracted = 0; | |
| typename __ios_base::iostate __err = __ios_base::goodbit; | |
| typename __istream_type::sentry __cerb(__in, false); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| __str.erase(); | |
| _CharT __buf[128]; | |
| __size_type __len = 0; | |
| const streamsize __w = __in.width(); | |
| const __size_type __n = __w > 0 ? static_cast<__size_type>(__w) | |
| : __str.max_size(); | |
| const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); | |
| const __int_type __eof = _Traits::eof(); | |
| __int_type __c = __in.rdbuf()->sgetc(); | |
| while (__extracted < __n | |
| && !_Traits::eq_int_type(__c, __eof) | |
| && !__ct.is(__ctype_base::space, | |
| _Traits::to_char_type(__c))) | |
| { | |
| if (__len == sizeof(__buf) / sizeof(_CharT)) | |
| { | |
| __str.append(__buf, sizeof(__buf) / sizeof(_CharT)); | |
| __len = 0; | |
| } | |
| __buf[__len++] = _Traits::to_char_type(__c); | |
| ++__extracted; | |
| __c = __in.rdbuf()->snextc(); | |
| } | |
| __str.append(__buf, __len); | |
| if (_Traits::eq_int_type(__c, __eof)) | |
| __err |= __ios_base::eofbit; | |
| __in.width(0); | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(__ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(__ios_base::badbit); | |
| } | |
| } | |
| if (!__extracted) | |
| __err |= __ios_base::failbit; | |
| if (__err) | |
| __in.setstate(__err); | |
| return __in; | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| basic_istream<_CharT, _Traits>& | |
| getline(basic_istream<_CharT, _Traits>& __in, | |
| basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) | |
| { | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef basic_string<_CharT, _Traits, _Alloc> __string_type; | |
| typedef typename __istream_type::ios_base __ios_base; | |
| typedef typename __istream_type::int_type __int_type; | |
| typedef typename __string_type::size_type __size_type; | |
| __size_type __extracted = 0; | |
| const __size_type __n = __str.max_size(); | |
| typename __ios_base::iostate __err = __ios_base::goodbit; | |
| typename __istream_type::sentry __cerb(__in, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| __str.erase(); | |
| const __int_type __idelim = _Traits::to_int_type(__delim); | |
| const __int_type __eof = _Traits::eof(); | |
| __int_type __c = __in.rdbuf()->sgetc(); | |
| while (__extracted < __n | |
| && !_Traits::eq_int_type(__c, __eof) | |
| && !_Traits::eq_int_type(__c, __idelim)) | |
| { | |
| __str += _Traits::to_char_type(__c); | |
| ++__extracted; | |
| __c = __in.rdbuf()->snextc(); | |
| } | |
| if (_Traits::eq_int_type(__c, __eof)) | |
| __err |= __ios_base::eofbit; | |
| else if (_Traits::eq_int_type(__c, __idelim)) | |
| { | |
| ++__extracted; | |
| __in.rdbuf()->sbumpc(); | |
| } | |
| else | |
| __err |= __ios_base::failbit; | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(__ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(__ios_base::badbit); | |
| } | |
| } | |
| if (!__extracted) | |
| __err |= __ios_base::failbit; | |
| if (__err) | |
| __in.setstate(__err); | |
| return __in; | |
| } | |
| # 1608 "/usr/sgug/include/c++/9/bits/basic_string.tcc" 3 | |
| extern template class basic_string<char>; | |
| extern template | |
| basic_istream<char>& | |
| operator>>(basic_istream<char>&, string&); | |
| extern template | |
| basic_ostream<char>& | |
| operator<<(basic_ostream<char>&, const string&); | |
| extern template | |
| basic_istream<char>& | |
| getline(basic_istream<char>&, string&, char); | |
| extern template | |
| basic_istream<char>& | |
| getline(basic_istream<char>&, string&); | |
| extern template class basic_string<wchar_t>; | |
| extern template | |
| basic_istream<wchar_t>& | |
| operator>>(basic_istream<wchar_t>&, wstring&); | |
| extern template | |
| basic_ostream<wchar_t>& | |
| operator<<(basic_ostream<wchar_t>&, const wstring&); | |
| extern template | |
| basic_istream<wchar_t>& | |
| getline(basic_istream<wchar_t>&, wstring&, wchar_t); | |
| extern template | |
| basic_istream<wchar_t>& | |
| getline(basic_istream<wchar_t>&, wstring&); | |
| } | |
| # 57 "/usr/sgug/include/c++/9/string" 2 3 | |
| # 48 "/usr/sgug/include/c++/9/bitset" 2 3 | |
| # 64 "/usr/sgug/include/c++/9/bitset" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<size_t _Nw> | |
| struct _Base_bitset | |
| { | |
| typedef unsigned long _WordT; | |
| _WordT _M_w[_Nw]; | |
| constexpr _Base_bitset() noexcept | |
| : _M_w() { } | |
| constexpr _Base_bitset(unsigned long long __val) noexcept | |
| : _M_w{ _WordT(__val) | |
| , _WordT(__val >> (8 * 4)) | |
| } { } | |
| static constexpr size_t | |
| _S_whichword(size_t __pos) noexcept | |
| { return __pos / (8 * 4); } | |
| static constexpr size_t | |
| _S_whichbyte(size_t __pos) noexcept | |
| { return (__pos % (8 * 4)) / 8; } | |
| static constexpr size_t | |
| _S_whichbit(size_t __pos) noexcept | |
| { return __pos % (8 * 4); } | |
| static constexpr _WordT | |
| _S_maskbit(size_t __pos) noexcept | |
| { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } | |
| _WordT& | |
| _M_getword(size_t __pos) noexcept | |
| { return _M_w[_S_whichword(__pos)]; } | |
| constexpr _WordT | |
| _M_getword(size_t __pos) const noexcept | |
| { return _M_w[_S_whichword(__pos)]; } | |
| const _WordT* | |
| _M_getdata() const noexcept | |
| { return _M_w; } | |
| _WordT& | |
| _M_hiword() noexcept | |
| { return _M_w[_Nw - 1]; } | |
| constexpr _WordT | |
| _M_hiword() const noexcept | |
| { return _M_w[_Nw - 1]; } | |
| void | |
| _M_do_and(const _Base_bitset<_Nw>& __x) noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| _M_w[__i] &= __x._M_w[__i]; | |
| } | |
| void | |
| _M_do_or(const _Base_bitset<_Nw>& __x) noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| _M_w[__i] |= __x._M_w[__i]; | |
| } | |
| void | |
| _M_do_xor(const _Base_bitset<_Nw>& __x) noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| _M_w[__i] ^= __x._M_w[__i]; | |
| } | |
| void | |
| _M_do_left_shift(size_t __shift) noexcept; | |
| void | |
| _M_do_right_shift(size_t __shift) noexcept; | |
| void | |
| _M_do_flip() noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| _M_w[__i] = ~_M_w[__i]; | |
| } | |
| void | |
| _M_do_set() noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| _M_w[__i] = ~static_cast<_WordT>(0); | |
| } | |
| void | |
| _M_do_reset() noexcept | |
| { __builtin_memset(_M_w, 0, _Nw * sizeof(_WordT)); } | |
| bool | |
| _M_is_equal(const _Base_bitset<_Nw>& __x) const noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; ++__i) | |
| if (_M_w[__i] != __x._M_w[__i]) | |
| return false; | |
| return true; | |
| } | |
| template<size_t _Nb> | |
| bool | |
| _M_are_all() const noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw - 1; __i++) | |
| if (_M_w[__i] != ~static_cast<_WordT>(0)) | |
| return false; | |
| return _M_hiword() == (~static_cast<_WordT>(0) | |
| >> (_Nw * (8 * 4) | |
| - _Nb)); | |
| } | |
| bool | |
| _M_is_any() const noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| if (_M_w[__i] != static_cast<_WordT>(0)) | |
| return true; | |
| return false; | |
| } | |
| size_t | |
| _M_do_count() const noexcept | |
| { | |
| size_t __result = 0; | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| __result += __builtin_popcountl(_M_w[__i]); | |
| return __result; | |
| } | |
| unsigned long | |
| _M_do_to_ulong() const; | |
| unsigned long long | |
| _M_do_to_ullong() const; | |
| size_t | |
| _M_do_find_first(size_t) const noexcept; | |
| size_t | |
| _M_do_find_next(size_t, size_t) const noexcept; | |
| }; | |
| template<size_t _Nw> | |
| void | |
| _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift) noexcept | |
| { | |
| if (__builtin_expect(__shift != 0, 1)) | |
| { | |
| const size_t __wshift = __shift / (8 * 4); | |
| const size_t __offset = __shift % (8 * 4); | |
| if (__offset == 0) | |
| for (size_t __n = _Nw - 1; __n >= __wshift; --__n) | |
| _M_w[__n] = _M_w[__n - __wshift]; | |
| else | |
| { | |
| const size_t __sub_offset = ((8 * 4) | |
| - __offset); | |
| for (size_t __n = _Nw - 1; __n > __wshift; --__n) | |
| _M_w[__n] = ((_M_w[__n - __wshift] << __offset) | |
| | (_M_w[__n - __wshift - 1] >> __sub_offset)); | |
| _M_w[__wshift] = _M_w[0] << __offset; | |
| } | |
| std::fill(_M_w + 0, _M_w + __wshift, static_cast<_WordT>(0)); | |
| } | |
| } | |
| template<size_t _Nw> | |
| void | |
| _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift) noexcept | |
| { | |
| if (__builtin_expect(__shift != 0, 1)) | |
| { | |
| const size_t __wshift = __shift / (8 * 4); | |
| const size_t __offset = __shift % (8 * 4); | |
| const size_t __limit = _Nw - __wshift - 1; | |
| if (__offset == 0) | |
| for (size_t __n = 0; __n <= __limit; ++__n) | |
| _M_w[__n] = _M_w[__n + __wshift]; | |
| else | |
| { | |
| const size_t __sub_offset = ((8 * 4) | |
| - __offset); | |
| for (size_t __n = 0; __n < __limit; ++__n) | |
| _M_w[__n] = ((_M_w[__n + __wshift] >> __offset) | |
| | (_M_w[__n + __wshift + 1] << __sub_offset)); | |
| _M_w[__limit] = _M_w[_Nw-1] >> __offset; | |
| } | |
| std::fill(_M_w + __limit + 1, _M_w + _Nw, static_cast<_WordT>(0)); | |
| } | |
| } | |
| template<size_t _Nw> | |
| unsigned long | |
| _Base_bitset<_Nw>::_M_do_to_ulong() const | |
| { | |
| for (size_t __i = 1; __i < _Nw; ++__i) | |
| if (_M_w[__i]) | |
| __throw_overflow_error(("_Base_bitset::_M_do_to_ulong")); | |
| return _M_w[0]; | |
| } | |
| template<size_t _Nw> | |
| unsigned long long | |
| _Base_bitset<_Nw>::_M_do_to_ullong() const | |
| { | |
| const bool __dw = sizeof(unsigned long long) > sizeof(unsigned long); | |
| for (size_t __i = 1 + __dw; __i < _Nw; ++__i) | |
| if (_M_w[__i]) | |
| __throw_overflow_error(("_Base_bitset::_M_do_to_ullong")); | |
| if (__dw) | |
| return _M_w[0] + (static_cast<unsigned long long>(_M_w[1]) | |
| << (8 * 4)); | |
| return _M_w[0]; | |
| } | |
| template<size_t _Nw> | |
| size_t | |
| _Base_bitset<_Nw>:: | |
| _M_do_find_first(size_t __not_found) const noexcept | |
| { | |
| for (size_t __i = 0; __i < _Nw; __i++) | |
| { | |
| _WordT __thisword = _M_w[__i]; | |
| if (__thisword != static_cast<_WordT>(0)) | |
| return (__i * (8 * 4) | |
| + __builtin_ctzl(__thisword)); | |
| } | |
| return __not_found; | |
| } | |
| template<size_t _Nw> | |
| size_t | |
| _Base_bitset<_Nw>:: | |
| _M_do_find_next(size_t __prev, size_t __not_found) const noexcept | |
| { | |
| ++__prev; | |
| if (__prev >= _Nw * (8 * 4)) | |
| return __not_found; | |
| size_t __i = _S_whichword(__prev); | |
| _WordT __thisword = _M_w[__i]; | |
| __thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev); | |
| if (__thisword != static_cast<_WordT>(0)) | |
| return (__i * (8 * 4) | |
| + __builtin_ctzl(__thisword)); | |
| __i++; | |
| for (; __i < _Nw; __i++) | |
| { | |
| __thisword = _M_w[__i]; | |
| if (__thisword != static_cast<_WordT>(0)) | |
| return (__i * (8 * 4) | |
| + __builtin_ctzl(__thisword)); | |
| } | |
| return __not_found; | |
| } | |
| template<> | |
| struct _Base_bitset<1> | |
| { | |
| typedef unsigned long _WordT; | |
| _WordT _M_w; | |
| constexpr _Base_bitset() noexcept | |
| : _M_w(0) | |
| { } | |
| constexpr _Base_bitset(unsigned long long __val) noexcept | |
| : _M_w(__val) | |
| { } | |
| static constexpr size_t | |
| _S_whichword(size_t __pos) noexcept | |
| { return __pos / (8 * 4); } | |
| static constexpr size_t | |
| _S_whichbyte(size_t __pos) noexcept | |
| { return (__pos % (8 * 4)) / 8; } | |
| static constexpr size_t | |
| _S_whichbit(size_t __pos) noexcept | |
| { return __pos % (8 * 4); } | |
| static constexpr _WordT | |
| _S_maskbit(size_t __pos) noexcept | |
| { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } | |
| _WordT& | |
| _M_getword(size_t) noexcept | |
| { return _M_w; } | |
| constexpr _WordT | |
| _M_getword(size_t) const noexcept | |
| { return _M_w; } | |
| const _WordT* | |
| _M_getdata() const noexcept | |
| { return &_M_w; } | |
| _WordT& | |
| _M_hiword() noexcept | |
| { return _M_w; } | |
| constexpr _WordT | |
| _M_hiword() const noexcept | |
| { return _M_w; } | |
| void | |
| _M_do_and(const _Base_bitset<1>& __x) noexcept | |
| { _M_w &= __x._M_w; } | |
| void | |
| _M_do_or(const _Base_bitset<1>& __x) noexcept | |
| { _M_w |= __x._M_w; } | |
| void | |
| _M_do_xor(const _Base_bitset<1>& __x) noexcept | |
| { _M_w ^= __x._M_w; } | |
| void | |
| _M_do_left_shift(size_t __shift) noexcept | |
| { _M_w <<= __shift; } | |
| void | |
| _M_do_right_shift(size_t __shift) noexcept | |
| { _M_w >>= __shift; } | |
| void | |
| _M_do_flip() noexcept | |
| { _M_w = ~_M_w; } | |
| void | |
| _M_do_set() noexcept | |
| { _M_w = ~static_cast<_WordT>(0); } | |
| void | |
| _M_do_reset() noexcept | |
| { _M_w = 0; } | |
| bool | |
| _M_is_equal(const _Base_bitset<1>& __x) const noexcept | |
| { return _M_w == __x._M_w; } | |
| template<size_t _Nb> | |
| bool | |
| _M_are_all() const noexcept | |
| { return _M_w == (~static_cast<_WordT>(0) | |
| >> ((8 * 4) - _Nb)); } | |
| bool | |
| _M_is_any() const noexcept | |
| { return _M_w != 0; } | |
| size_t | |
| _M_do_count() const noexcept | |
| { return __builtin_popcountl(_M_w); } | |
| unsigned long | |
| _M_do_to_ulong() const noexcept | |
| { return _M_w; } | |
| unsigned long long | |
| _M_do_to_ullong() const noexcept | |
| { return _M_w; } | |
| size_t | |
| _M_do_find_first(size_t __not_found) const noexcept | |
| { | |
| if (_M_w != 0) | |
| return __builtin_ctzl(_M_w); | |
| else | |
| return __not_found; | |
| } | |
| size_t | |
| _M_do_find_next(size_t __prev, size_t __not_found) const | |
| noexcept | |
| { | |
| ++__prev; | |
| if (__prev >= ((size_t) (8 * 4))) | |
| return __not_found; | |
| _WordT __x = _M_w >> __prev; | |
| if (__x != 0) | |
| return __builtin_ctzl(__x) + __prev; | |
| else | |
| return __not_found; | |
| } | |
| }; | |
| template<> | |
| struct _Base_bitset<0> | |
| { | |
| typedef unsigned long _WordT; | |
| constexpr _Base_bitset() noexcept | |
| { } | |
| constexpr _Base_bitset(unsigned long long) noexcept | |
| { } | |
| static constexpr size_t | |
| _S_whichword(size_t __pos) noexcept | |
| { return __pos / (8 * 4); } | |
| static constexpr size_t | |
| _S_whichbyte(size_t __pos) noexcept | |
| { return (__pos % (8 * 4)) / 8; } | |
| static constexpr size_t | |
| _S_whichbit(size_t __pos) noexcept | |
| { return __pos % (8 * 4); } | |
| static constexpr _WordT | |
| _S_maskbit(size_t __pos) noexcept | |
| { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } | |
| # 560 "/usr/sgug/include/c++/9/bitset" 3 | |
| _WordT& | |
| _M_getword(size_t) noexcept | |
| { | |
| __throw_out_of_range(("_Base_bitset::_M_getword")); | |
| return *new _WordT; | |
| } | |
| constexpr _WordT | |
| _M_getword(size_t) const noexcept | |
| { return 0; } | |
| constexpr _WordT | |
| _M_hiword() const noexcept | |
| { return 0; } | |
| void | |
| _M_do_and(const _Base_bitset<0>&) noexcept | |
| { } | |
| void | |
| _M_do_or(const _Base_bitset<0>&) noexcept | |
| { } | |
| void | |
| _M_do_xor(const _Base_bitset<0>&) noexcept | |
| { } | |
| void | |
| _M_do_left_shift(size_t) noexcept | |
| { } | |
| void | |
| _M_do_right_shift(size_t) noexcept | |
| { } | |
| void | |
| _M_do_flip() noexcept | |
| { } | |
| void | |
| _M_do_set() noexcept | |
| { } | |
| void | |
| _M_do_reset() noexcept | |
| { } | |
| bool | |
| _M_is_equal(const _Base_bitset<0>&) const noexcept | |
| { return true; } | |
| template<size_t _Nb> | |
| bool | |
| _M_are_all() const noexcept | |
| { return true; } | |
| bool | |
| _M_is_any() const noexcept | |
| { return false; } | |
| size_t | |
| _M_do_count() const noexcept | |
| { return 0; } | |
| unsigned long | |
| _M_do_to_ulong() const noexcept | |
| { return 0; } | |
| unsigned long long | |
| _M_do_to_ullong() const noexcept | |
| { return 0; } | |
| size_t | |
| _M_do_find_first(size_t) const noexcept | |
| { return 0; } | |
| size_t | |
| _M_do_find_next(size_t, size_t) const noexcept | |
| { return 0; } | |
| }; | |
| template<size_t _Extrabits> | |
| struct _Sanitize | |
| { | |
| typedef unsigned long _WordT; | |
| static void | |
| _S_do_sanitize(_WordT& __val) noexcept | |
| { __val &= ~((~static_cast<_WordT>(0)) << _Extrabits); } | |
| }; | |
| template<> | |
| struct _Sanitize<0> | |
| { | |
| typedef unsigned long _WordT; | |
| static void | |
| _S_do_sanitize(_WordT) noexcept { } | |
| }; | |
| template<size_t _Nb, bool = (_Nb < (8 * 8))> | |
| struct _Sanitize_val | |
| { | |
| static constexpr unsigned long long | |
| _S_do_sanitize_val(unsigned long long __val) | |
| { return __val; } | |
| }; | |
| template<size_t _Nb> | |
| struct _Sanitize_val<_Nb, true> | |
| { | |
| static constexpr unsigned long long | |
| _S_do_sanitize_val(unsigned long long __val) | |
| { return __val & ~((~static_cast<unsigned long long>(0)) << _Nb); } | |
| }; | |
| # 750 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<size_t _Nb> | |
| class bitset | |
| : private _Base_bitset<((_Nb) / (8 * 4) + ((_Nb) % (8 * 4) == 0 ? 0 : 1))> | |
| { | |
| private: | |
| typedef _Base_bitset<((_Nb) / (8 * 4) + ((_Nb) % (8 * 4) == 0 ? 0 : 1))> _Base; | |
| typedef unsigned long _WordT; | |
| template<class _CharT, class _Traits, class _Alloc> | |
| void | |
| _M_check_initial_position(const std::basic_string<_CharT, _Traits, _Alloc>& __s, | |
| size_t __position) const | |
| { | |
| if (__position > __s.size()) | |
| __throw_out_of_range_fmt(("bitset::bitset: __position " "(which is %zu) > __s.size() " "(which is %zu)") | |
| , | |
| __position, __s.size()); | |
| } | |
| void _M_check(size_t __position, const char *__s) const | |
| { | |
| if (__position >= _Nb) | |
| __throw_out_of_range_fmt(("%s: __position (which is %zu) " ">= _Nb (which is %zu)") | |
| , | |
| __s, __position, _Nb); | |
| } | |
| void | |
| _M_do_sanitize() noexcept | |
| { | |
| typedef _Sanitize<_Nb % (8 * 4)> __sanitize_type; | |
| __sanitize_type::_S_do_sanitize(this->_M_hiword()); | |
| } | |
| friend struct std::hash<bitset>; | |
| public: | |
| # 802 "/usr/sgug/include/c++/9/bitset" 3 | |
| class reference | |
| { | |
| friend class bitset; | |
| _WordT* _M_wp; | |
| size_t _M_bpos; | |
| reference(); | |
| public: | |
| reference(bitset& __b, size_t __pos) noexcept | |
| { | |
| _M_wp = &__b._M_getword(__pos); | |
| _M_bpos = _Base::_S_whichbit(__pos); | |
| } | |
| reference(const reference&) = default; | |
| ~reference() noexcept | |
| { } | |
| reference& | |
| operator=(bool __x) noexcept | |
| { | |
| if (__x) | |
| *_M_wp |= _Base::_S_maskbit(_M_bpos); | |
| else | |
| *_M_wp &= ~_Base::_S_maskbit(_M_bpos); | |
| return *this; | |
| } | |
| reference& | |
| operator=(const reference& __j) noexcept | |
| { | |
| if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos))) | |
| *_M_wp |= _Base::_S_maskbit(_M_bpos); | |
| else | |
| *_M_wp &= ~_Base::_S_maskbit(_M_bpos); | |
| return *this; | |
| } | |
| bool | |
| operator~() const noexcept | |
| { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) == 0; } | |
| operator bool() const noexcept | |
| { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) != 0; } | |
| reference& | |
| flip() noexcept | |
| { | |
| *_M_wp ^= _Base::_S_maskbit(_M_bpos); | |
| return *this; | |
| } | |
| }; | |
| friend class reference; | |
| constexpr bitset() noexcept | |
| { } | |
| constexpr bitset(unsigned long long __val) noexcept | |
| : _Base(_Sanitize_val<_Nb>::_S_do_sanitize_val(__val)) { } | |
| # 891 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<class _CharT, class _Traits, class _Alloc> | |
| explicit | |
| bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, | |
| size_t __position = 0) | |
| : _Base() | |
| { | |
| _M_check_initial_position(__s, __position); | |
| _M_copy_from_string(__s, __position, | |
| std::basic_string<_CharT, _Traits, _Alloc>::npos, | |
| _CharT('0'), _CharT('1')); | |
| } | |
| # 913 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<class _CharT, class _Traits, class _Alloc> | |
| bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, | |
| size_t __position, size_t __n) | |
| : _Base() | |
| { | |
| _M_check_initial_position(__s, __position); | |
| _M_copy_from_string(__s, __position, __n, _CharT('0'), _CharT('1')); | |
| } | |
| template<class _CharT, class _Traits, class _Alloc> | |
| bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, | |
| size_t __position, size_t __n, | |
| _CharT __zero, _CharT __one = _CharT('1')) | |
| : _Base() | |
| { | |
| _M_check_initial_position(__s, __position); | |
| _M_copy_from_string(__s, __position, __n, __zero, __one); | |
| } | |
| # 944 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<typename _CharT> | |
| explicit | |
| bitset(const _CharT* __str, | |
| typename std::basic_string<_CharT>::size_type __n | |
| = std::basic_string<_CharT>::npos, | |
| _CharT __zero = _CharT('0'), _CharT __one = _CharT('1')) | |
| : _Base() | |
| { | |
| if (!__str) | |
| __throw_logic_error(("bitset::bitset(const _CharT*, ...)")); | |
| if (__n == std::basic_string<_CharT>::npos) | |
| __n = std::char_traits<_CharT>::length(__str); | |
| _M_copy_from_ptr<_CharT, std::char_traits<_CharT>>(__str, __n, 0, | |
| __n, __zero, | |
| __one); | |
| } | |
| # 971 "/usr/sgug/include/c++/9/bitset" 3 | |
| bitset<_Nb>& | |
| operator&=(const bitset<_Nb>& __rhs) noexcept | |
| { | |
| this->_M_do_and(__rhs); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| operator|=(const bitset<_Nb>& __rhs) noexcept | |
| { | |
| this->_M_do_or(__rhs); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| operator^=(const bitset<_Nb>& __rhs) noexcept | |
| { | |
| this->_M_do_xor(__rhs); | |
| return *this; | |
| } | |
| # 1000 "/usr/sgug/include/c++/9/bitset" 3 | |
| bitset<_Nb>& | |
| operator<<=(size_t __position) noexcept | |
| { | |
| if (__builtin_expect(__position < _Nb, 1)) | |
| { | |
| this->_M_do_left_shift(__position); | |
| this->_M_do_sanitize(); | |
| } | |
| else | |
| this->_M_do_reset(); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| operator>>=(size_t __position) noexcept | |
| { | |
| if (__builtin_expect(__position < _Nb, 1)) | |
| { | |
| this->_M_do_right_shift(__position); | |
| this->_M_do_sanitize(); | |
| } | |
| else | |
| this->_M_do_reset(); | |
| return *this; | |
| } | |
| # 1033 "/usr/sgug/include/c++/9/bitset" 3 | |
| bitset<_Nb>& | |
| _Unchecked_set(size_t __pos) noexcept | |
| { | |
| this->_M_getword(__pos) |= _Base::_S_maskbit(__pos); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| _Unchecked_set(size_t __pos, int __val) noexcept | |
| { | |
| if (__val) | |
| this->_M_getword(__pos) |= _Base::_S_maskbit(__pos); | |
| else | |
| this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| _Unchecked_reset(size_t __pos) noexcept | |
| { | |
| this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| _Unchecked_flip(size_t __pos) noexcept | |
| { | |
| this->_M_getword(__pos) ^= _Base::_S_maskbit(__pos); | |
| return *this; | |
| } | |
| constexpr bool | |
| _Unchecked_test(size_t __pos) const noexcept | |
| { return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos)) | |
| != static_cast<_WordT>(0)); } | |
| bitset<_Nb>& | |
| set() noexcept | |
| { | |
| this->_M_do_set(); | |
| this->_M_do_sanitize(); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| set(size_t __position, bool __val = true) | |
| { | |
| this->_M_check(__position, ("bitset::set")); | |
| return _Unchecked_set(__position, __val); | |
| } | |
| bitset<_Nb>& | |
| reset() noexcept | |
| { | |
| this->_M_do_reset(); | |
| return *this; | |
| } | |
| # 1112 "/usr/sgug/include/c++/9/bitset" 3 | |
| bitset<_Nb>& | |
| reset(size_t __position) | |
| { | |
| this->_M_check(__position, ("bitset::reset")); | |
| return _Unchecked_reset(__position); | |
| } | |
| bitset<_Nb>& | |
| flip() noexcept | |
| { | |
| this->_M_do_flip(); | |
| this->_M_do_sanitize(); | |
| return *this; | |
| } | |
| bitset<_Nb>& | |
| flip(size_t __position) | |
| { | |
| this->_M_check(__position, ("bitset::flip")); | |
| return _Unchecked_flip(__position); | |
| } | |
| bitset<_Nb> | |
| operator~() const noexcept | |
| { return bitset<_Nb>(*this).flip(); } | |
| # 1162 "/usr/sgug/include/c++/9/bitset" 3 | |
| reference | |
| operator[](size_t __position) | |
| { return reference(*this, __position); } | |
| constexpr bool | |
| operator[](size_t __position) const | |
| { return _Unchecked_test(__position); } | |
| # 1177 "/usr/sgug/include/c++/9/bitset" 3 | |
| unsigned long | |
| to_ulong() const | |
| { return this->_M_do_to_ulong(); } | |
| unsigned long long | |
| to_ullong() const | |
| { return this->_M_do_to_ullong(); } | |
| # 1195 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<class _CharT, class _Traits, class _Alloc> | |
| std::basic_string<_CharT, _Traits, _Alloc> | |
| to_string() const | |
| { | |
| std::basic_string<_CharT, _Traits, _Alloc> __result; | |
| _M_copy_to_string(__result, _CharT('0'), _CharT('1')); | |
| return __result; | |
| } | |
| template<class _CharT, class _Traits, class _Alloc> | |
| std::basic_string<_CharT, _Traits, _Alloc> | |
| to_string(_CharT __zero, _CharT __one = _CharT('1')) const | |
| { | |
| std::basic_string<_CharT, _Traits, _Alloc> __result; | |
| _M_copy_to_string(__result, __zero, __one); | |
| return __result; | |
| } | |
| template<class _CharT, class _Traits> | |
| std::basic_string<_CharT, _Traits, std::allocator<_CharT> > | |
| to_string() const | |
| { return to_string<_CharT, _Traits, std::allocator<_CharT> >(); } | |
| template<class _CharT, class _Traits> | |
| std::basic_string<_CharT, _Traits, std::allocator<_CharT> > | |
| to_string(_CharT __zero, _CharT __one = _CharT('1')) const | |
| { return to_string<_CharT, _Traits, | |
| std::allocator<_CharT> >(__zero, __one); } | |
| template<class _CharT> | |
| std::basic_string<_CharT, std::char_traits<_CharT>, | |
| std::allocator<_CharT> > | |
| to_string() const | |
| { | |
| return to_string<_CharT, std::char_traits<_CharT>, | |
| std::allocator<_CharT> >(); | |
| } | |
| template<class _CharT> | |
| std::basic_string<_CharT, std::char_traits<_CharT>, | |
| std::allocator<_CharT> > | |
| to_string(_CharT __zero, _CharT __one = _CharT('1')) const | |
| { | |
| return to_string<_CharT, std::char_traits<_CharT>, | |
| std::allocator<_CharT> >(__zero, __one); | |
| } | |
| std::basic_string<char, std::char_traits<char>, std::allocator<char> > | |
| to_string() const | |
| { | |
| return to_string<char, std::char_traits<char>, | |
| std::allocator<char> >(); | |
| } | |
| std::basic_string<char, std::char_traits<char>, std::allocator<char> > | |
| to_string(char __zero, char __one = '1') const | |
| { | |
| return to_string<char, std::char_traits<char>, | |
| std::allocator<char> >(__zero, __one); | |
| } | |
| template<class _CharT, class _Traits> | |
| void | |
| _M_copy_from_ptr(const _CharT*, size_t, size_t, size_t, | |
| _CharT, _CharT); | |
| template<class _CharT, class _Traits, class _Alloc> | |
| void | |
| _M_copy_from_string(const std::basic_string<_CharT, | |
| _Traits, _Alloc>& __s, size_t __pos, size_t __n, | |
| _CharT __zero, _CharT __one) | |
| { _M_copy_from_ptr<_CharT, _Traits>(__s.data(), __s.size(), __pos, __n, | |
| __zero, __one); } | |
| template<class _CharT, class _Traits, class _Alloc> | |
| void | |
| _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&, | |
| _CharT, _CharT) const; | |
| template<class _CharT, class _Traits, class _Alloc> | |
| void | |
| _M_copy_from_string(const std::basic_string<_CharT, | |
| _Traits, _Alloc>& __s, size_t __pos, size_t __n) | |
| { _M_copy_from_string(__s, __pos, __n, _CharT('0'), _CharT('1')); } | |
| template<class _CharT, class _Traits, class _Alloc> | |
| void | |
| _M_copy_to_string(std::basic_string<_CharT, _Traits,_Alloc>& __s) const | |
| { _M_copy_to_string(__s, _CharT('0'), _CharT('1')); } | |
| size_t | |
| count() const noexcept | |
| { return this->_M_do_count(); } | |
| constexpr size_t | |
| size() const noexcept | |
| { return _Nb; } | |
| bool | |
| operator==(const bitset<_Nb>& __rhs) const noexcept | |
| { return this->_M_is_equal(__rhs); } | |
| bool | |
| operator!=(const bitset<_Nb>& __rhs) const noexcept | |
| { return !this->_M_is_equal(__rhs); } | |
| # 1320 "/usr/sgug/include/c++/9/bitset" 3 | |
| bool | |
| test(size_t __position) const | |
| { | |
| this->_M_check(__position, ("bitset::test")); | |
| return _Unchecked_test(__position); | |
| } | |
| bool | |
| all() const noexcept | |
| { return this->template _M_are_all<_Nb>(); } | |
| bool | |
| any() const noexcept | |
| { return this->_M_is_any(); } | |
| bool | |
| none() const noexcept | |
| { return !this->_M_is_any(); } | |
| bitset<_Nb> | |
| operator<<(size_t __position) const noexcept | |
| { return bitset<_Nb>(*this) <<= __position; } | |
| bitset<_Nb> | |
| operator>>(size_t __position) const noexcept | |
| { return bitset<_Nb>(*this) >>= __position; } | |
| # 1370 "/usr/sgug/include/c++/9/bitset" 3 | |
| size_t | |
| _Find_first() const noexcept | |
| { return this->_M_do_find_first(_Nb); } | |
| # 1381 "/usr/sgug/include/c++/9/bitset" 3 | |
| size_t | |
| _Find_next(size_t __prev) const noexcept | |
| { return this->_M_do_find_next(__prev, _Nb); } | |
| }; | |
| template<size_t _Nb> | |
| template<class _CharT, class _Traits> | |
| void | |
| bitset<_Nb>:: | |
| _M_copy_from_ptr(const _CharT* __s, size_t __len, | |
| size_t __pos, size_t __n, _CharT __zero, _CharT __one) | |
| { | |
| reset(); | |
| const size_t __nbits = std::min(_Nb, std::min(__n, size_t(__len - __pos))); | |
| for (size_t __i = __nbits; __i > 0; --__i) | |
| { | |
| const _CharT __c = __s[__pos + __nbits - __i]; | |
| if (_Traits::eq(__c, __zero)) | |
| ; | |
| else if (_Traits::eq(__c, __one)) | |
| _Unchecked_set(__i - 1); | |
| else | |
| __throw_invalid_argument(("bitset::_M_copy_from_ptr")); | |
| } | |
| } | |
| template<size_t _Nb> | |
| template<class _CharT, class _Traits, class _Alloc> | |
| void | |
| bitset<_Nb>:: | |
| _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s, | |
| _CharT __zero, _CharT __one) const | |
| { | |
| __s.assign(_Nb, __zero); | |
| for (size_t __i = _Nb; __i > 0; --__i) | |
| if (_Unchecked_test(__i - 1)) | |
| _Traits::assign(__s[_Nb - __i], __one); | |
| } | |
| # 1431 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<size_t _Nb> | |
| inline bitset<_Nb> | |
| operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y) noexcept | |
| { | |
| bitset<_Nb> __result(__x); | |
| __result &= __y; | |
| return __result; | |
| } | |
| template<size_t _Nb> | |
| inline bitset<_Nb> | |
| operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y) noexcept | |
| { | |
| bitset<_Nb> __result(__x); | |
| __result |= __y; | |
| return __result; | |
| } | |
| template <size_t _Nb> | |
| inline bitset<_Nb> | |
| operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y) noexcept | |
| { | |
| bitset<_Nb> __result(__x); | |
| __result ^= __y; | |
| return __result; | |
| } | |
| # 1468 "/usr/sgug/include/c++/9/bitset" 3 | |
| template<class _CharT, class _Traits, size_t _Nb> | |
| std::basic_istream<_CharT, _Traits>& | |
| operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) | |
| { | |
| typedef typename _Traits::char_type char_type; | |
| typedef std::basic_istream<_CharT, _Traits> __istream_type; | |
| typedef typename __istream_type::ios_base __ios_base; | |
| std::basic_string<_CharT, _Traits> __tmp; | |
| __tmp.reserve(_Nb); | |
| const char_type __zero = __is.widen('0'); | |
| const char_type __one = __is.widen('1'); | |
| typename __ios_base::iostate __state = __ios_base::goodbit; | |
| typename __istream_type::sentry __sentry(__is); | |
| if (__sentry) | |
| { | |
| if (true) | |
| { | |
| for (size_t __i = _Nb; __i > 0; --__i) | |
| { | |
| static typename _Traits::int_type __eof = _Traits::eof(); | |
| typename _Traits::int_type __c1 = __is.rdbuf()->sbumpc(); | |
| if (_Traits::eq_int_type(__c1, __eof)) | |
| { | |
| __state |= __ios_base::eofbit; | |
| break; | |
| } | |
| else | |
| { | |
| const char_type __c2 = _Traits::to_char_type(__c1); | |
| if (_Traits::eq(__c2, __zero)) | |
| __tmp.push_back(__zero); | |
| else if (_Traits::eq(__c2, __one)) | |
| __tmp.push_back(__one); | |
| else if (_Traits:: | |
| eq_int_type(__is.rdbuf()->sputbackc(__c2), | |
| __eof)) | |
| { | |
| __state |= __ios_base::failbit; | |
| break; | |
| } | |
| } | |
| } | |
| } | |
| if (false) | |
| { | |
| __is._M_setstate(__ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { __is._M_setstate(__ios_base::badbit); } | |
| } | |
| if (__tmp.empty() && _Nb) | |
| __state |= __ios_base::failbit; | |
| else | |
| __x._M_copy_from_string(__tmp, static_cast<size_t>(0), _Nb, | |
| __zero, __one); | |
| if (__state) | |
| __is.setstate(__state); | |
| return __is; | |
| } | |
| template <class _CharT, class _Traits, size_t _Nb> | |
| std::basic_ostream<_CharT, _Traits>& | |
| operator<<(std::basic_ostream<_CharT, _Traits>& __os, | |
| const bitset<_Nb>& __x) | |
| { | |
| std::basic_string<_CharT, _Traits> __tmp; | |
| const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__os.getloc()); | |
| __x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1')); | |
| return __os << __tmp; | |
| } | |
| } | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<size_t _Nb> | |
| struct hash<std::bitset<_Nb>> | |
| : public __hash_base<size_t, std::bitset<_Nb>> | |
| { | |
| size_t | |
| operator()(const std::bitset<_Nb>& __b) const noexcept | |
| { | |
| const size_t __clength = (_Nb + 8 - 1) / 8; | |
| return std::_Hash_impl::hash(__b._M_getdata(), __clength); | |
| } | |
| }; | |
| template<> | |
| struct hash<std::bitset<0>> | |
| : public __hash_base<size_t, std::bitset<0>> | |
| { | |
| size_t | |
| operator()(const std::bitset<0>&) const noexcept | |
| { return 0; } | |
| }; | |
| } | |
| # 40 "/usr/sgug/include/c++/9/regex" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/iterator" 1 3 | |
| # 58 "/usr/sgug/include/c++/9/iterator" 3 | |
| # 59 "/usr/sgug/include/c++/9/iterator" 3 | |
| # 1 "/usr/sgug/include/c++/9/ostream" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/ostream" 3 | |
| # 37 "/usr/sgug/include/c++/9/ostream" 3 | |
| # 1 "/usr/sgug/include/c++/9/ios" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/ios" 3 | |
| # 37 "/usr/sgug/include/c++/9/ios" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/ios_base.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/locale_classes.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 62 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| class locale | |
| { | |
| public: | |
| typedef int category; | |
| class facet; | |
| class id; | |
| class _Impl; | |
| friend class facet; | |
| friend class _Impl; | |
| template<typename _Facet> | |
| friend bool | |
| has_facet(const locale&) throw(); | |
| template<typename _Facet> | |
| friend const _Facet& | |
| use_facet(const locale&); | |
| template<typename _Cache> | |
| friend struct __use_cache; | |
| # 98 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| static const category none = 0; | |
| static const category ctype = 1L << 0; | |
| static const category numeric = 1L << 1; | |
| static const category collate = 1L << 2; | |
| static const category time = 1L << 3; | |
| static const category monetary = 1L << 4; | |
| static const category messages = 1L << 5; | |
| static const category all = (ctype | numeric | collate | | |
| time | monetary | messages); | |
| # 117 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| locale() throw(); | |
| # 126 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| locale(const locale& __other) throw(); | |
| # 136 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| explicit | |
| locale(const char* __s); | |
| # 151 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| locale(const locale& __base, const char* __s, category __cat); | |
| # 162 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| explicit | |
| locale(const std::string& __s) : locale(__s.c_str()) { } | |
| # 177 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| locale(const locale& __base, const std::string& __s, category __cat) | |
| : locale(__base, __s.c_str(), __cat) { } | |
| # 192 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| locale(const locale& __base, const locale& __add, category __cat); | |
| # 205 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| template<typename _Facet> | |
| locale(const locale& __other, _Facet* __f); | |
| ~locale() throw(); | |
| # 219 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| const locale& | |
| operator=(const locale& __other) throw(); | |
| # 234 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| template<typename _Facet> | |
| locale | |
| combine(const locale& __other) const; | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| string | |
| name() const; | |
| # 254 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| bool | |
| operator==(const locale& __other) const throw(); | |
| bool | |
| operator!=(const locale& __other) const throw() | |
| { return !(this->operator==(__other)); } | |
| # 282 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| template<typename _Char, typename _Traits, typename _Alloc> | |
| bool | |
| operator()(const basic_string<_Char, _Traits, _Alloc>& __s1, | |
| const basic_string<_Char, _Traits, _Alloc>& __s2) const; | |
| # 298 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| static locale | |
| global(const locale& __loc); | |
| static const locale& | |
| classic(); | |
| private: | |
| _Impl* _M_impl; | |
| static _Impl* _S_classic; | |
| static _Impl* _S_global; | |
| static const char* const* const _S_categories; | |
| # 333 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| enum { _S_categories_size = 6 + 0 }; | |
| static __gthread_once_t _S_once; | |
| explicit | |
| locale(_Impl*) throw(); | |
| static void | |
| _S_initialize(); | |
| static void | |
| _S_initialize_once() throw(); | |
| static category | |
| _S_normalize_category(category); | |
| void | |
| _M_coalesce(const locale& __base, const locale& __add, category __cat); | |
| static const id* const _S_twinned_facets[]; | |
| }; | |
| # 371 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| class locale::facet | |
| { | |
| private: | |
| friend class locale; | |
| friend class locale::_Impl; | |
| mutable _Atomic_word _M_refcount; | |
| static __c_locale _S_c_locale; | |
| static const char _S_c_name[2]; | |
| static __gthread_once_t _S_once; | |
| static void | |
| _S_initialize_once(); | |
| protected: | |
| # 402 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| explicit | |
| facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0) | |
| { } | |
| virtual | |
| ~facet(); | |
| static void | |
| _S_create_c_locale(__c_locale& __cloc, const char* __s, | |
| __c_locale __old = 0); | |
| static __c_locale | |
| _S_clone_c_locale(__c_locale& __cloc) throw(); | |
| static void | |
| _S_destroy_c_locale(__c_locale& __cloc); | |
| static __c_locale | |
| _S_lc_ctype_c_locale(__c_locale __cloc, const char* __s); | |
| static __c_locale | |
| _S_get_c_locale(); | |
| __attribute__ ((__const__)) static const char* | |
| _S_get_c_name() throw(); | |
| # 438 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| facet(const facet&) = delete; | |
| facet& | |
| operator=(const facet&) = delete; | |
| private: | |
| void | |
| _M_add_reference() const throw() | |
| { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } | |
| void | |
| _M_remove_reference() const throw() | |
| { | |
| ; | |
| if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) | |
| { | |
| ; | |
| if (true) | |
| { delete this; } | |
| if (false) | |
| { } | |
| } | |
| } | |
| const facet* _M_sso_shim(const id*) const; | |
| const facet* _M_cow_shim(const id*) const; | |
| protected: | |
| class __shim; | |
| }; | |
| # 483 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| class locale::id | |
| { | |
| private: | |
| friend class locale; | |
| friend class locale::_Impl; | |
| template<typename _Facet> | |
| friend const _Facet& | |
| use_facet(const locale&); | |
| template<typename _Facet> | |
| friend bool | |
| has_facet(const locale&) throw(); | |
| mutable size_t _M_index; | |
| static _Atomic_word _S_refcount; | |
| void | |
| operator=(const id&); | |
| id(const id&); | |
| public: | |
| id() { } | |
| size_t | |
| _M_id() const throw(); | |
| }; | |
| class locale::_Impl | |
| { | |
| public: | |
| friend class locale; | |
| friend class locale::facet; | |
| template<typename _Facet> | |
| friend bool | |
| has_facet(const locale&) throw(); | |
| template<typename _Facet> | |
| friend const _Facet& | |
| use_facet(const locale&); | |
| template<typename _Cache> | |
| friend struct __use_cache; | |
| private: | |
| _Atomic_word _M_refcount; | |
| const facet** _M_facets; | |
| size_t _M_facets_size; | |
| const facet** _M_caches; | |
| char** _M_names; | |
| static const locale::id* const _S_id_ctype[]; | |
| static const locale::id* const _S_id_numeric[]; | |
| static const locale::id* const _S_id_collate[]; | |
| static const locale::id* const _S_id_time[]; | |
| static const locale::id* const _S_id_monetary[]; | |
| static const locale::id* const _S_id_messages[]; | |
| static const locale::id* const* const _S_facet_categories[]; | |
| void | |
| _M_add_reference() throw() | |
| { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } | |
| void | |
| _M_remove_reference() throw() | |
| { | |
| ; | |
| if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) | |
| { | |
| ; | |
| if (true) | |
| { delete this; } | |
| if (false) | |
| { } | |
| } | |
| } | |
| _Impl(const _Impl&, size_t); | |
| _Impl(const char*, size_t); | |
| _Impl(size_t) throw(); | |
| ~_Impl() throw(); | |
| _Impl(const _Impl&); | |
| void | |
| operator=(const _Impl&); | |
| bool | |
| _M_check_same_name() | |
| { | |
| bool __ret = true; | |
| if (_M_names[1]) | |
| for (size_t __i = 0; __ret && __i < _S_categories_size - 1; ++__i) | |
| __ret = __builtin_strcmp(_M_names[__i], _M_names[__i + 1]) == 0; | |
| return __ret; | |
| } | |
| void | |
| _M_replace_categories(const _Impl*, category); | |
| void | |
| _M_replace_category(const _Impl*, const locale::id* const*); | |
| void | |
| _M_replace_facet(const _Impl*, const locale::id*); | |
| void | |
| _M_install_facet(const locale::id*, const facet*); | |
| template<typename _Facet> | |
| void | |
| _M_init_facet(_Facet* __facet) | |
| { _M_install_facet(&_Facet::id, __facet); } | |
| template<typename _Facet> | |
| void | |
| _M_init_facet_unchecked(_Facet* __facet) | |
| { | |
| __facet->_M_add_reference(); | |
| _M_facets[_Facet::id._M_id()] = __facet; | |
| } | |
| void | |
| _M_install_cache(const facet*, size_t); | |
| void _M_init_extra(facet**); | |
| void _M_init_extra(void*, void*, const char*, const char*); | |
| }; | |
| # 641 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| template<typename _CharT> | |
| class __cxx11:: collate : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| protected: | |
| __c_locale _M_c_locale_collate; | |
| public: | |
| static locale::id id; | |
| # 668 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| explicit | |
| collate(size_t __refs = 0) | |
| : facet(__refs), _M_c_locale_collate(_S_get_c_locale()) | |
| { } | |
| # 682 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| explicit | |
| collate(__c_locale __cloc, size_t __refs = 0) | |
| : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc)) | |
| { } | |
| # 699 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| int | |
| compare(const _CharT* __lo1, const _CharT* __hi1, | |
| const _CharT* __lo2, const _CharT* __hi2) const | |
| { return this->do_compare(__lo1, __hi1, __lo2, __hi2); } | |
| # 718 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| string_type | |
| transform(const _CharT* __lo, const _CharT* __hi) const | |
| { return this->do_transform(__lo, __hi); } | |
| # 732 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| long | |
| hash(const _CharT* __lo, const _CharT* __hi) const | |
| { return this->do_hash(__lo, __hi); } | |
| int | |
| _M_compare(const _CharT*, const _CharT*) const throw(); | |
| size_t | |
| _M_transform(_CharT*, const _CharT*, size_t) const throw(); | |
| protected: | |
| virtual | |
| ~collate() | |
| { _S_destroy_c_locale(_M_c_locale_collate); } | |
| # 761 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| virtual int | |
| do_compare(const _CharT* __lo1, const _CharT* __hi1, | |
| const _CharT* __lo2, const _CharT* __hi2) const; | |
| # 775 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| virtual string_type | |
| do_transform(const _CharT* __lo, const _CharT* __hi) const; | |
| # 788 "/usr/sgug/include/c++/9/bits/locale_classes.h" 3 | |
| virtual long | |
| do_hash(const _CharT* __lo, const _CharT* __hi) const; | |
| }; | |
| template<typename _CharT> | |
| locale::id collate<_CharT>::id; | |
| template<> | |
| int | |
| collate<char>::_M_compare(const char*, const char*) const throw(); | |
| template<> | |
| size_t | |
| collate<char>::_M_transform(char*, const char*, size_t) const throw(); | |
| template<> | |
| int | |
| collate<wchar_t>::_M_compare(const wchar_t*, const wchar_t*) const throw(); | |
| template<> | |
| size_t | |
| collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const throw(); | |
| template<typename _CharT> | |
| class __cxx11:: collate_byname : public collate<_CharT> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| explicit | |
| collate_byname(const char* __s, size_t __refs = 0) | |
| : collate<_CharT>(__refs) | |
| { | |
| if (__builtin_strcmp(__s, "C") != 0 | |
| && __builtin_strcmp(__s, "POSIX") != 0) | |
| { | |
| this->_S_destroy_c_locale(this->_M_c_locale_collate); | |
| this->_S_create_c_locale(this->_M_c_locale_collate, __s); | |
| } | |
| } | |
| explicit | |
| collate_byname(const string& __s, size_t __refs = 0) | |
| : collate_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~collate_byname() { } | |
| }; | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/locale_classes.tcc" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/locale_classes.tcc" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/locale_classes.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Facet> | |
| locale:: | |
| locale(const locale& __other, _Facet* __f) | |
| { | |
| _M_impl = new _Impl(*__other._M_impl, 1); | |
| if (true) | |
| { _M_impl->_M_install_facet(&_Facet::id, __f); } | |
| if (false) | |
| { | |
| _M_impl->_M_remove_reference(); | |
| ; | |
| } | |
| delete [] _M_impl->_M_names[0]; | |
| _M_impl->_M_names[0] = 0; | |
| } | |
| template<typename _Facet> | |
| locale | |
| locale:: | |
| combine(const locale& __other) const | |
| { | |
| _Impl* __tmp = new _Impl(*_M_impl, 1); | |
| if (true) | |
| { | |
| __tmp->_M_replace_facet(__other._M_impl, &_Facet::id); | |
| } | |
| if (false) | |
| { | |
| __tmp->_M_remove_reference(); | |
| ; | |
| } | |
| return locale(__tmp); | |
| } | |
| template<typename _CharT, typename _Traits, typename _Alloc> | |
| bool | |
| locale:: | |
| operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1, | |
| const basic_string<_CharT, _Traits, _Alloc>& __s2) const | |
| { | |
| typedef std::collate<_CharT> __collate_type; | |
| const __collate_type& __collate = use_facet<__collate_type>(*this); | |
| return (__collate.compare(__s1.data(), __s1.data() + __s1.length(), | |
| __s2.data(), __s2.data() + __s2.length()) < 0); | |
| } | |
| # 102 "/usr/sgug/include/c++/9/bits/locale_classes.tcc" 3 | |
| template<typename _Facet> | |
| bool | |
| has_facet(const locale& __loc) throw() | |
| { | |
| const size_t __i = _Facet::id._M_id(); | |
| const locale::facet** __facets = __loc._M_impl->_M_facets; | |
| return (__i < __loc._M_impl->_M_facets_size | |
| && dynamic_cast<const _Facet*>(__facets[__i])); | |
| } | |
| # 130 "/usr/sgug/include/c++/9/bits/locale_classes.tcc" 3 | |
| template<typename _Facet> | |
| const _Facet& | |
| use_facet(const locale& __loc) | |
| { | |
| const size_t __i = _Facet::id._M_id(); | |
| const locale::facet** __facets = __loc._M_impl->_M_facets; | |
| if (__i >= __loc._M_impl->_M_facets_size || !__facets[__i]) | |
| __throw_bad_cast(); | |
| return dynamic_cast<const _Facet&>(*__facets[__i]); | |
| } | |
| template<typename _CharT> | |
| int | |
| collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const throw () | |
| { return 0; } | |
| template<typename _CharT> | |
| size_t | |
| collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const throw () | |
| { return 0; } | |
| template<typename _CharT> | |
| int | |
| collate<_CharT>:: | |
| do_compare(const _CharT* __lo1, const _CharT* __hi1, | |
| const _CharT* __lo2, const _CharT* __hi2) const | |
| { | |
| const string_type __one(__lo1, __hi1); | |
| const string_type __two(__lo2, __hi2); | |
| const _CharT* __p = __one.c_str(); | |
| const _CharT* __pend = __one.data() + __one.length(); | |
| const _CharT* __q = __two.c_str(); | |
| const _CharT* __qend = __two.data() + __two.length(); | |
| for (;;) | |
| { | |
| const int __res = _M_compare(__p, __q); | |
| if (__res) | |
| return __res; | |
| __p += char_traits<_CharT>::length(__p); | |
| __q += char_traits<_CharT>::length(__q); | |
| if (__p == __pend && __q == __qend) | |
| return 0; | |
| else if (__p == __pend) | |
| return -1; | |
| else if (__q == __qend) | |
| return 1; | |
| __p++; | |
| __q++; | |
| } | |
| } | |
| template<typename _CharT> | |
| typename collate<_CharT>::string_type | |
| collate<_CharT>:: | |
| do_transform(const _CharT* __lo, const _CharT* __hi) const | |
| { | |
| string_type __ret; | |
| const string_type __str(__lo, __hi); | |
| const _CharT* __p = __str.c_str(); | |
| const _CharT* __pend = __str.data() + __str.length(); | |
| size_t __len = (__hi - __lo) * 2; | |
| _CharT* __c = new _CharT[__len]; | |
| if (true) | |
| { | |
| for (;;) | |
| { | |
| size_t __res = _M_transform(__c, __p, __len); | |
| if (__res >= __len) | |
| { | |
| __len = __res + 1; | |
| delete [] __c, __c = 0; | |
| __c = new _CharT[__len]; | |
| __res = _M_transform(__c, __p, __len); | |
| } | |
| __ret.append(__c, __res); | |
| __p += char_traits<_CharT>::length(__p); | |
| if (__p == __pend) | |
| break; | |
| __p++; | |
| __ret.push_back(_CharT()); | |
| } | |
| } | |
| if (false) | |
| { | |
| delete [] __c; | |
| ; | |
| } | |
| delete [] __c; | |
| return __ret; | |
| } | |
| template<typename _CharT> | |
| long | |
| collate<_CharT>:: | |
| do_hash(const _CharT* __lo, const _CharT* __hi) const | |
| { | |
| unsigned long __val = 0; | |
| for (; __lo < __hi; ++__lo) | |
| __val = | |
| *__lo + ((__val << 7) | |
| | (__val >> (__gnu_cxx::__numeric_traits<unsigned long>:: | |
| __digits - 7))); | |
| return static_cast<long>(__val); | |
| } | |
| extern template class collate<char>; | |
| extern template class collate_byname<char>; | |
| extern template | |
| const collate<char>& | |
| use_facet<collate<char> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<collate<char> >(const locale&); | |
| extern template class collate<wchar_t>; | |
| extern template class collate_byname<wchar_t>; | |
| extern template | |
| const collate<wchar_t>& | |
| use_facet<collate<wchar_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<collate<wchar_t> >(const locale&); | |
| } | |
| # 852 "/usr/sgug/include/c++/9/bits/locale_classes.h" 2 3 | |
| # 42 "/usr/sgug/include/c++/9/bits/ios_base.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/system_error" 1 3 | |
| # 32 "/usr/sgug/include/c++/9/system_error" 3 | |
| # 33 "/usr/sgug/include/c++/9/system_error" 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/error_constants.h" 1 3 | |
| # 34 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/error_constants.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/cerrno" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cerrno" 3 | |
| # 40 "/usr/sgug/include/c++/9/cerrno" 3 | |
| # 35 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/error_constants.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| enum class errc | |
| { | |
| address_family_not_supported = 124, | |
| address_in_use = 125, | |
| address_not_available = 126, | |
| already_connected = 133, | |
| argument_list_too_long = 7, | |
| argument_out_of_domain = 33, | |
| bad_address = 14, | |
| bad_file_descriptor = 9, | |
| bad_message = 77, | |
| broken_pipe = 32, | |
| connection_aborted = 130, | |
| connection_already_in_progress = 149, | |
| connection_refused = 146, | |
| connection_reset = 131, | |
| cross_device_link = 18, | |
| destination_address_required = 96, | |
| device_or_resource_busy = 16, | |
| directory_not_empty = 93, | |
| executable_format_error = 8, | |
| file_exists = 17, | |
| file_too_large = 27, | |
| filename_too_long = 78, | |
| function_not_supported = 89, | |
| host_unreachable = 148, | |
| identifier_removed = 36, | |
| illegal_byte_sequence = 88, | |
| inappropriate_io_control_operation = 25, | |
| interrupted = 4, | |
| invalid_argument = 22, | |
| invalid_seek = 29, | |
| io_error = 5, | |
| is_a_directory = 21, | |
| message_size = 97, | |
| network_down = 127, | |
| network_reset = 129, | |
| network_unreachable = 128, | |
| no_buffer_space = 132, | |
| no_child_process = 10, | |
| no_link = 67, | |
| no_lock_available = 46, | |
| no_message_available = 61, | |
| no_message = 35, | |
| no_protocol_option = 99, | |
| no_space_on_device = 28, | |
| no_stream_resources = 63, | |
| no_such_device_or_address = 6, | |
| no_such_device = 19, | |
| no_such_file_or_directory = 2, | |
| no_such_process = 3, | |
| not_a_directory = 20, | |
| not_a_socket = 95, | |
| not_a_stream = 60, | |
| not_connected = 134, | |
| not_enough_memory = 12, | |
| not_supported = 1008, | |
| operation_canceled = 158, | |
| operation_in_progress = 150, | |
| operation_not_permitted = 1, | |
| operation_not_supported = 122, | |
| operation_would_block = 11, | |
| permission_denied = 13, | |
| protocol_error = 71, | |
| protocol_not_supported = 120, | |
| read_only_file_system = 30, | |
| resource_deadlock_would_occur = 45, | |
| resource_unavailable_try_again = 11, | |
| result_out_of_range = 34, | |
| stream_timeout = 62, | |
| text_file_busy = 26, | |
| timed_out = 145, | |
| too_many_files_open_in_system = 23, | |
| too_many_files_open = 24, | |
| too_many_links = 31, | |
| too_many_symbolic_link_levels = 90, | |
| value_too_large = 79, | |
| wrong_protocol_type = 98 | |
| }; | |
| } | |
| # 40 "/usr/sgug/include/c++/9/system_error" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/stdexcept" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/stdexcept" 3 | |
| # 37 "/usr/sgug/include/c++/9/stdexcept" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| struct __cow_string | |
| { | |
| union { | |
| const char* _M_p; | |
| char _M_bytes[sizeof(const char*)]; | |
| }; | |
| __cow_string(); | |
| __cow_string(const std::string&); | |
| __cow_string(const char*, size_t); | |
| __cow_string(const __cow_string&) noexcept; | |
| __cow_string& operator=(const __cow_string&) noexcept; | |
| ~__cow_string(); | |
| __cow_string(__cow_string&&) noexcept; | |
| __cow_string& operator=(__cow_string&&) noexcept; | |
| }; | |
| typedef basic_string<char> __sso_string; | |
| # 113 "/usr/sgug/include/c++/9/stdexcept" 3 | |
| class logic_error : public exception | |
| { | |
| __cow_string _M_msg; | |
| public: | |
| explicit | |
| logic_error(const string& __arg) ; | |
| explicit | |
| logic_error(const char*) ; | |
| logic_error(logic_error&&) noexcept; | |
| logic_error& operator=(logic_error&&) noexcept; | |
| logic_error(const logic_error&) noexcept; | |
| logic_error& operator=(const logic_error&) noexcept; | |
| virtual ~logic_error() noexcept; | |
| virtual const char* | |
| what() const noexcept; | |
| }; | |
| class domain_error : public logic_error | |
| { | |
| public: | |
| explicit domain_error(const string& __arg) ; | |
| explicit domain_error(const char*) ; | |
| domain_error(const domain_error&) = default; | |
| domain_error& operator=(const domain_error&) = default; | |
| domain_error(domain_error&&) = default; | |
| domain_error& operator=(domain_error&&) = default; | |
| virtual ~domain_error() noexcept; | |
| }; | |
| class invalid_argument : public logic_error | |
| { | |
| public: | |
| explicit invalid_argument(const string& __arg) ; | |
| explicit invalid_argument(const char*) ; | |
| invalid_argument(const invalid_argument&) = default; | |
| invalid_argument& operator=(const invalid_argument&) = default; | |
| invalid_argument(invalid_argument&&) = default; | |
| invalid_argument& operator=(invalid_argument&&) = default; | |
| virtual ~invalid_argument() noexcept; | |
| }; | |
| class length_error : public logic_error | |
| { | |
| public: | |
| explicit length_error(const string& __arg) ; | |
| explicit length_error(const char*) ; | |
| length_error(const length_error&) = default; | |
| length_error& operator=(const length_error&) = default; | |
| length_error(length_error&&) = default; | |
| length_error& operator=(length_error&&) = default; | |
| virtual ~length_error() noexcept; | |
| }; | |
| class out_of_range : public logic_error | |
| { | |
| public: | |
| explicit out_of_range(const string& __arg) ; | |
| explicit out_of_range(const char*) ; | |
| out_of_range(const out_of_range&) = default; | |
| out_of_range& operator=(const out_of_range&) = default; | |
| out_of_range(out_of_range&&) = default; | |
| out_of_range& operator=(out_of_range&&) = default; | |
| virtual ~out_of_range() noexcept; | |
| }; | |
| class runtime_error : public exception | |
| { | |
| __cow_string _M_msg; | |
| public: | |
| explicit | |
| runtime_error(const string& __arg) ; | |
| explicit | |
| runtime_error(const char*) ; | |
| runtime_error(runtime_error&&) noexcept; | |
| runtime_error& operator=(runtime_error&&) noexcept; | |
| runtime_error(const runtime_error&) noexcept; | |
| runtime_error& operator=(const runtime_error&) noexcept; | |
| virtual ~runtime_error() noexcept; | |
| virtual const char* | |
| what() const noexcept; | |
| }; | |
| class range_error : public runtime_error | |
| { | |
| public: | |
| explicit range_error(const string& __arg) ; | |
| explicit range_error(const char*) ; | |
| range_error(const range_error&) = default; | |
| range_error& operator=(const range_error&) = default; | |
| range_error(range_error&&) = default; | |
| range_error& operator=(range_error&&) = default; | |
| virtual ~range_error() noexcept; | |
| }; | |
| class overflow_error : public runtime_error | |
| { | |
| public: | |
| explicit overflow_error(const string& __arg) ; | |
| explicit overflow_error(const char*) ; | |
| overflow_error(const overflow_error&) = default; | |
| overflow_error& operator=(const overflow_error&) = default; | |
| overflow_error(overflow_error&&) = default; | |
| overflow_error& operator=(overflow_error&&) = default; | |
| virtual ~overflow_error() noexcept; | |
| }; | |
| class underflow_error : public runtime_error | |
| { | |
| public: | |
| explicit underflow_error(const string& __arg) ; | |
| explicit underflow_error(const char*) ; | |
| underflow_error(const underflow_error&) = default; | |
| underflow_error& operator=(const underflow_error&) = default; | |
| underflow_error(underflow_error&&) = default; | |
| underflow_error& operator=(underflow_error&&) = default; | |
| virtual ~underflow_error() noexcept; | |
| }; | |
| } | |
| # 42 "/usr/sgug/include/c++/9/system_error" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| class error_code; | |
| class error_condition; | |
| class system_error; | |
| template<typename _Tp> | |
| struct is_error_code_enum : public false_type { }; | |
| template<typename _Tp> | |
| struct is_error_condition_enum : public false_type { }; | |
| template<> | |
| struct is_error_condition_enum<errc> | |
| : public true_type { }; | |
| # 71 "/usr/sgug/include/c++/9/system_error" 3 | |
| inline namespace _V2 { | |
| class error_category | |
| { | |
| public: | |
| constexpr error_category() noexcept = default; | |
| virtual ~error_category(); | |
| error_category(const error_category&) = delete; | |
| error_category& operator=(const error_category&) = delete; | |
| virtual const char* | |
| name() const noexcept = 0; | |
| private: | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| virtual __cow_string | |
| _M_message(int) const; | |
| public: | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| virtual string | |
| message(int) const = 0; | |
| # 110 "/usr/sgug/include/c++/9/system_error" 3 | |
| public: | |
| virtual error_condition | |
| default_error_condition(int __i) const noexcept; | |
| virtual bool | |
| equivalent(int __i, const error_condition& __cond) const noexcept; | |
| virtual bool | |
| equivalent(const error_code& __code, int __i) const noexcept; | |
| bool | |
| operator<(const error_category& __other) const noexcept | |
| { return less<const error_category*>()(this, &__other); } | |
| bool | |
| operator==(const error_category& __other) const noexcept | |
| { return this == &__other; } | |
| bool | |
| operator!=(const error_category& __other) const noexcept | |
| { return this != &__other; } | |
| }; | |
| __attribute__ ((__const__)) const error_category& system_category() noexcept; | |
| __attribute__ ((__const__)) const error_category& generic_category() noexcept; | |
| } | |
| error_code make_error_code(errc) noexcept; | |
| template<typename _Tp> | |
| struct hash; | |
| struct error_code | |
| { | |
| error_code() noexcept | |
| : _M_value(0), _M_cat(&system_category()) { } | |
| error_code(int __v, const error_category& __cat) noexcept | |
| : _M_value(__v), _M_cat(&__cat) { } | |
| template<typename _ErrorCodeEnum, typename = typename | |
| enable_if<is_error_code_enum<_ErrorCodeEnum>::value>::type> | |
| error_code(_ErrorCodeEnum __e) noexcept | |
| { *this = make_error_code(__e); } | |
| void | |
| assign(int __v, const error_category& __cat) noexcept | |
| { | |
| _M_value = __v; | |
| _M_cat = &__cat; | |
| } | |
| void | |
| clear() noexcept | |
| { assign(0, system_category()); } | |
| template<typename _ErrorCodeEnum> | |
| typename enable_if<is_error_code_enum<_ErrorCodeEnum>::value, | |
| error_code&>::type | |
| operator=(_ErrorCodeEnum __e) noexcept | |
| { return *this = make_error_code(__e); } | |
| int | |
| value() const noexcept { return _M_value; } | |
| const error_category& | |
| category() const noexcept { return *_M_cat; } | |
| error_condition | |
| default_error_condition() const noexcept; | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| string | |
| message() const | |
| { return category().message(value()); } | |
| explicit operator bool() const noexcept | |
| { return _M_value != 0; } | |
| private: | |
| friend class hash<error_code>; | |
| int _M_value; | |
| const error_category* _M_cat; | |
| }; | |
| inline error_code | |
| make_error_code(errc __e) noexcept | |
| { return error_code(static_cast<int>(__e), generic_category()); } | |
| inline bool | |
| operator<(const error_code& __lhs, const error_code& __rhs) noexcept | |
| { | |
| return (__lhs.category() < __rhs.category() | |
| || (__lhs.category() == __rhs.category() | |
| && __lhs.value() < __rhs.value())); | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| operator<<(basic_ostream<_CharT, _Traits>& __os, const error_code& __e) | |
| { return (__os << __e.category().name() << ':' << __e.value()); } | |
| error_condition make_error_condition(errc) noexcept; | |
| struct error_condition | |
| { | |
| error_condition() noexcept | |
| : _M_value(0), _M_cat(&generic_category()) { } | |
| error_condition(int __v, const error_category& __cat) noexcept | |
| : _M_value(__v), _M_cat(&__cat) { } | |
| template<typename _ErrorConditionEnum, typename = typename | |
| enable_if<is_error_condition_enum<_ErrorConditionEnum>::value>::type> | |
| error_condition(_ErrorConditionEnum __e) noexcept | |
| { *this = make_error_condition(__e); } | |
| void | |
| assign(int __v, const error_category& __cat) noexcept | |
| { | |
| _M_value = __v; | |
| _M_cat = &__cat; | |
| } | |
| template<typename _ErrorConditionEnum> | |
| typename enable_if<is_error_condition_enum | |
| <_ErrorConditionEnum>::value, error_condition&>::type | |
| operator=(_ErrorConditionEnum __e) noexcept | |
| { return *this = make_error_condition(__e); } | |
| void | |
| clear() noexcept | |
| { assign(0, generic_category()); } | |
| int | |
| value() const noexcept { return _M_value; } | |
| const error_category& | |
| category() const noexcept { return *_M_cat; } | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| string | |
| message() const | |
| { return category().message(value()); } | |
| explicit operator bool() const noexcept | |
| { return _M_value != 0; } | |
| private: | |
| int _M_value; | |
| const error_category* _M_cat; | |
| }; | |
| inline error_condition | |
| make_error_condition(errc __e) noexcept | |
| { return error_condition(static_cast<int>(__e), generic_category()); } | |
| inline bool | |
| operator<(const error_condition& __lhs, | |
| const error_condition& __rhs) noexcept | |
| { | |
| return (__lhs.category() < __rhs.category() | |
| || (__lhs.category() == __rhs.category() | |
| && __lhs.value() < __rhs.value())); | |
| } | |
| inline bool | |
| operator==(const error_code& __lhs, const error_code& __rhs) noexcept | |
| { return (__lhs.category() == __rhs.category() | |
| && __lhs.value() == __rhs.value()); } | |
| inline bool | |
| operator==(const error_code& __lhs, const error_condition& __rhs) noexcept | |
| { | |
| return (__lhs.category().equivalent(__lhs.value(), __rhs) | |
| || __rhs.category().equivalent(__lhs, __rhs.value())); | |
| } | |
| inline bool | |
| operator==(const error_condition& __lhs, const error_code& __rhs) noexcept | |
| { | |
| return (__rhs.category().equivalent(__rhs.value(), __lhs) | |
| || __lhs.category().equivalent(__rhs, __lhs.value())); | |
| } | |
| inline bool | |
| operator==(const error_condition& __lhs, | |
| const error_condition& __rhs) noexcept | |
| { | |
| return (__lhs.category() == __rhs.category() | |
| && __lhs.value() == __rhs.value()); | |
| } | |
| inline bool | |
| operator!=(const error_code& __lhs, const error_code& __rhs) noexcept | |
| { return !(__lhs == __rhs); } | |
| inline bool | |
| operator!=(const error_code& __lhs, const error_condition& __rhs) noexcept | |
| { return !(__lhs == __rhs); } | |
| inline bool | |
| operator!=(const error_condition& __lhs, const error_code& __rhs) noexcept | |
| { return !(__lhs == __rhs); } | |
| inline bool | |
| operator!=(const error_condition& __lhs, | |
| const error_condition& __rhs) noexcept | |
| { return !(__lhs == __rhs); } | |
| class system_error : public std::runtime_error | |
| { | |
| private: | |
| error_code _M_code; | |
| public: | |
| system_error(error_code __ec = error_code()) | |
| : runtime_error(__ec.message()), _M_code(__ec) { } | |
| system_error(error_code __ec, const string& __what) | |
| : runtime_error(__what + ": " + __ec.message()), _M_code(__ec) { } | |
| system_error(error_code __ec, const char* __what) | |
| : runtime_error(__what + (": " + __ec.message())), _M_code(__ec) { } | |
| system_error(int __v, const error_category& __ecat, const char* __what) | |
| : system_error(error_code(__v, __ecat), __what) { } | |
| system_error(int __v, const error_category& __ecat) | |
| : runtime_error(error_code(__v, __ecat).message()), | |
| _M_code(__v, __ecat) { } | |
| system_error(int __v, const error_category& __ecat, const string& __what) | |
| : runtime_error(__what + ": " + error_code(__v, __ecat).message()), | |
| _M_code(__v, __ecat) { } | |
| system_error (const system_error &) = default; | |
| system_error &operator= (const system_error &) = default; | |
| virtual ~system_error() noexcept; | |
| const error_code& | |
| code() const noexcept { return _M_code; } | |
| }; | |
| } | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<> | |
| struct hash<error_code> | |
| : public __hash_base<size_t, error_code> | |
| { | |
| size_t | |
| operator()(const error_code& __e) const noexcept | |
| { | |
| const size_t __tmp = std::_Hash_impl::hash(__e._M_value); | |
| return std::_Hash_impl::__hash_combine(__e._M_cat, __tmp); | |
| } | |
| }; | |
| # 419 "/usr/sgug/include/c++/9/system_error" 3 | |
| } | |
| # 47 "/usr/sgug/include/c++/9/bits/ios_base.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| enum _Ios_Fmtflags | |
| { | |
| _S_boolalpha = 1L << 0, | |
| _S_dec = 1L << 1, | |
| _S_fixed = 1L << 2, | |
| _S_hex = 1L << 3, | |
| _S_internal = 1L << 4, | |
| _S_left = 1L << 5, | |
| _S_oct = 1L << 6, | |
| _S_right = 1L << 7, | |
| _S_scientific = 1L << 8, | |
| _S_showbase = 1L << 9, | |
| _S_showpoint = 1L << 10, | |
| _S_showpos = 1L << 11, | |
| _S_skipws = 1L << 12, | |
| _S_unitbuf = 1L << 13, | |
| _S_uppercase = 1L << 14, | |
| _S_adjustfield = _S_left | _S_right | _S_internal, | |
| _S_basefield = _S_dec | _S_oct | _S_hex, | |
| _S_floatfield = _S_scientific | _S_fixed, | |
| _S_ios_fmtflags_end = 1L << 16, | |
| _S_ios_fmtflags_max = 0x7fffffff, | |
| _S_ios_fmtflags_min = ~0x7fffffff | |
| }; | |
| inline constexpr _Ios_Fmtflags | |
| operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b) | |
| { return _Ios_Fmtflags(static_cast<int>(__a) & static_cast<int>(__b)); } | |
| inline constexpr _Ios_Fmtflags | |
| operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b) | |
| { return _Ios_Fmtflags(static_cast<int>(__a) | static_cast<int>(__b)); } | |
| inline constexpr _Ios_Fmtflags | |
| operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b) | |
| { return _Ios_Fmtflags(static_cast<int>(__a) ^ static_cast<int>(__b)); } | |
| inline constexpr _Ios_Fmtflags | |
| operator~(_Ios_Fmtflags __a) | |
| { return _Ios_Fmtflags(~static_cast<int>(__a)); } | |
| inline const _Ios_Fmtflags& | |
| operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) | |
| { return __a = __a | __b; } | |
| inline const _Ios_Fmtflags& | |
| operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) | |
| { return __a = __a & __b; } | |
| inline const _Ios_Fmtflags& | |
| operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) | |
| { return __a = __a ^ __b; } | |
| enum _Ios_Openmode | |
| { | |
| _S_app = 1L << 0, | |
| _S_ate = 1L << 1, | |
| _S_bin = 1L << 2, | |
| _S_in = 1L << 3, | |
| _S_out = 1L << 4, | |
| _S_trunc = 1L << 5, | |
| _S_ios_openmode_end = 1L << 16, | |
| _S_ios_openmode_max = 0x7fffffff, | |
| _S_ios_openmode_min = ~0x7fffffff | |
| }; | |
| inline constexpr _Ios_Openmode | |
| operator&(_Ios_Openmode __a, _Ios_Openmode __b) | |
| { return _Ios_Openmode(static_cast<int>(__a) & static_cast<int>(__b)); } | |
| inline constexpr _Ios_Openmode | |
| operator|(_Ios_Openmode __a, _Ios_Openmode __b) | |
| { return _Ios_Openmode(static_cast<int>(__a) | static_cast<int>(__b)); } | |
| inline constexpr _Ios_Openmode | |
| operator^(_Ios_Openmode __a, _Ios_Openmode __b) | |
| { return _Ios_Openmode(static_cast<int>(__a) ^ static_cast<int>(__b)); } | |
| inline constexpr _Ios_Openmode | |
| operator~(_Ios_Openmode __a) | |
| { return _Ios_Openmode(~static_cast<int>(__a)); } | |
| inline const _Ios_Openmode& | |
| operator|=(_Ios_Openmode& __a, _Ios_Openmode __b) | |
| { return __a = __a | __b; } | |
| inline const _Ios_Openmode& | |
| operator&=(_Ios_Openmode& __a, _Ios_Openmode __b) | |
| { return __a = __a & __b; } | |
| inline const _Ios_Openmode& | |
| operator^=(_Ios_Openmode& __a, _Ios_Openmode __b) | |
| { return __a = __a ^ __b; } | |
| enum _Ios_Iostate | |
| { | |
| _S_goodbit = 0, | |
| _S_badbit = 1L << 0, | |
| _S_eofbit = 1L << 1, | |
| _S_failbit = 1L << 2, | |
| _S_ios_iostate_end = 1L << 16, | |
| _S_ios_iostate_max = 0x7fffffff, | |
| _S_ios_iostate_min = ~0x7fffffff | |
| }; | |
| inline constexpr _Ios_Iostate | |
| operator&(_Ios_Iostate __a, _Ios_Iostate __b) | |
| { return _Ios_Iostate(static_cast<int>(__a) & static_cast<int>(__b)); } | |
| inline constexpr _Ios_Iostate | |
| operator|(_Ios_Iostate __a, _Ios_Iostate __b) | |
| { return _Ios_Iostate(static_cast<int>(__a) | static_cast<int>(__b)); } | |
| inline constexpr _Ios_Iostate | |
| operator^(_Ios_Iostate __a, _Ios_Iostate __b) | |
| { return _Ios_Iostate(static_cast<int>(__a) ^ static_cast<int>(__b)); } | |
| inline constexpr _Ios_Iostate | |
| operator~(_Ios_Iostate __a) | |
| { return _Ios_Iostate(~static_cast<int>(__a)); } | |
| inline const _Ios_Iostate& | |
| operator|=(_Ios_Iostate& __a, _Ios_Iostate __b) | |
| { return __a = __a | __b; } | |
| inline const _Ios_Iostate& | |
| operator&=(_Ios_Iostate& __a, _Ios_Iostate __b) | |
| { return __a = __a & __b; } | |
| inline const _Ios_Iostate& | |
| operator^=(_Ios_Iostate& __a, _Ios_Iostate __b) | |
| { return __a = __a ^ __b; } | |
| enum _Ios_Seekdir | |
| { | |
| _S_beg = 0, | |
| _S_cur = 1, | |
| _S_end = 2, | |
| _S_ios_seekdir_end = 1L << 16 | |
| }; | |
| enum class io_errc { stream = 1 }; | |
| template <> struct is_error_code_enum<io_errc> : public true_type { }; | |
| const error_category& iostream_category() noexcept; | |
| inline error_code | |
| make_error_code(io_errc __e) noexcept | |
| { return error_code(static_cast<int>(__e), iostream_category()); } | |
| inline error_condition | |
| make_error_condition(io_errc __e) noexcept | |
| { return error_condition(static_cast<int>(__e), iostream_category()); } | |
| # 228 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| class ios_base | |
| { | |
| # 246 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| public: | |
| # 255 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| class __attribute ((__abi_tag__ ("cxx11"))) failure : public system_error | |
| { | |
| public: | |
| explicit | |
| failure(const string& __str); | |
| explicit | |
| failure(const string&, const error_code&); | |
| explicit | |
| failure(const char*, const error_code& = io_errc::stream); | |
| virtual | |
| ~failure() throw(); | |
| virtual const char* | |
| what() const throw(); | |
| }; | |
| # 323 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| typedef _Ios_Fmtflags fmtflags; | |
| static const fmtflags boolalpha = _S_boolalpha; | |
| static const fmtflags dec = _S_dec; | |
| static const fmtflags fixed = _S_fixed; | |
| static const fmtflags hex = _S_hex; | |
| static const fmtflags internal = _S_internal; | |
| static const fmtflags left = _S_left; | |
| static const fmtflags oct = _S_oct; | |
| static const fmtflags right = _S_right; | |
| static const fmtflags scientific = _S_scientific; | |
| static const fmtflags showbase = _S_showbase; | |
| static const fmtflags showpoint = _S_showpoint; | |
| static const fmtflags showpos = _S_showpos; | |
| static const fmtflags skipws = _S_skipws; | |
| static const fmtflags unitbuf = _S_unitbuf; | |
| static const fmtflags uppercase = _S_uppercase; | |
| static const fmtflags adjustfield = _S_adjustfield; | |
| static const fmtflags basefield = _S_basefield; | |
| static const fmtflags floatfield = _S_floatfield; | |
| # 398 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| typedef _Ios_Iostate iostate; | |
| static const iostate badbit = _S_badbit; | |
| static const iostate eofbit = _S_eofbit; | |
| static const iostate failbit = _S_failbit; | |
| static const iostate goodbit = _S_goodbit; | |
| # 429 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| typedef _Ios_Openmode openmode; | |
| static const openmode app = _S_app; | |
| static const openmode ate = _S_ate; | |
| static const openmode binary = _S_bin; | |
| static const openmode in = _S_in; | |
| static const openmode out = _S_out; | |
| static const openmode trunc = _S_trunc; | |
| # 461 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| typedef _Ios_Seekdir seekdir; | |
| static const seekdir beg = _S_beg; | |
| static const seekdir cur = _S_cur; | |
| static const seekdir end = _S_end; | |
| typedef int io_state; | |
| typedef int open_mode; | |
| typedef int seek_dir; | |
| typedef std::streampos streampos; | |
| typedef std::streamoff streamoff; | |
| # 489 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| enum event | |
| { | |
| erase_event, | |
| imbue_event, | |
| copyfmt_event | |
| }; | |
| # 506 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| typedef void (*event_callback) (event __e, ios_base& __b, int __i); | |
| # 518 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| void | |
| register_callback(event_callback __fn, int __index); | |
| protected: | |
| streamsize _M_precision; | |
| streamsize _M_width; | |
| fmtflags _M_flags; | |
| iostate _M_exception; | |
| iostate _M_streambuf_state; | |
| struct _Callback_list | |
| { | |
| _Callback_list* _M_next; | |
| ios_base::event_callback _M_fn; | |
| int _M_index; | |
| _Atomic_word _M_refcount; | |
| _Callback_list(ios_base::event_callback __fn, int __index, | |
| _Callback_list* __cb) | |
| : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { } | |
| void | |
| _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } | |
| int | |
| _M_remove_reference() | |
| { | |
| ; | |
| int __res = __gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1); | |
| if (__res == 0) | |
| { | |
| ; | |
| } | |
| return __res; | |
| } | |
| }; | |
| _Callback_list* _M_callbacks; | |
| void | |
| _M_call_callbacks(event __ev) throw(); | |
| void | |
| _M_dispose_callbacks(void) throw(); | |
| struct _Words | |
| { | |
| void* _M_pword; | |
| long _M_iword; | |
| _Words() : _M_pword(0), _M_iword(0) { } | |
| }; | |
| _Words _M_word_zero; | |
| enum { _S_local_word_size = 8 }; | |
| _Words _M_local_word[_S_local_word_size]; | |
| int _M_word_size; | |
| _Words* _M_word; | |
| _Words& | |
| _M_grow_words(int __index, bool __iword); | |
| locale _M_ios_locale; | |
| void | |
| _M_init() throw(); | |
| public: | |
| class Init | |
| { | |
| friend class ios_base; | |
| public: | |
| Init(); | |
| ~Init(); | |
| Init(const Init&) = default; | |
| Init& operator=(const Init&) = default; | |
| private: | |
| static _Atomic_word _S_refcount; | |
| static bool _S_synced_with_stdio; | |
| }; | |
| fmtflags | |
| flags() const | |
| { return _M_flags; } | |
| # 636 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| fmtflags | |
| flags(fmtflags __fmtfl) | |
| { | |
| fmtflags __old = _M_flags; | |
| _M_flags = __fmtfl; | |
| return __old; | |
| } | |
| # 652 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| fmtflags | |
| setf(fmtflags __fmtfl) | |
| { | |
| fmtflags __old = _M_flags; | |
| _M_flags |= __fmtfl; | |
| return __old; | |
| } | |
| # 669 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| fmtflags | |
| setf(fmtflags __fmtfl, fmtflags __mask) | |
| { | |
| fmtflags __old = _M_flags; | |
| _M_flags &= ~__mask; | |
| _M_flags |= (__fmtfl & __mask); | |
| return __old; | |
| } | |
| void | |
| unsetf(fmtflags __mask) | |
| { _M_flags &= ~__mask; } | |
| # 695 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| streamsize | |
| precision() const | |
| { return _M_precision; } | |
| streamsize | |
| precision(streamsize __prec) | |
| { | |
| streamsize __old = _M_precision; | |
| _M_precision = __prec; | |
| return __old; | |
| } | |
| streamsize | |
| width() const | |
| { return _M_width; } | |
| streamsize | |
| width(streamsize __wide) | |
| { | |
| streamsize __old = _M_width; | |
| _M_width = __wide; | |
| return __old; | |
| } | |
| # 746 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| static bool | |
| sync_with_stdio(bool __sync = true); | |
| # 758 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| locale | |
| imbue(const locale& __loc) throw(); | |
| # 769 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| locale | |
| getloc() const | |
| { return _M_ios_locale; } | |
| # 780 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| const locale& | |
| _M_getloc() const | |
| { return _M_ios_locale; } | |
| # 799 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| static int | |
| xalloc() throw(); | |
| # 815 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| long& | |
| iword(int __ix) | |
| { | |
| _Words& __word = ((unsigned)__ix < (unsigned)_M_word_size) | |
| ? _M_word[__ix] : _M_grow_words(__ix, true); | |
| return __word._M_iword; | |
| } | |
| # 836 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| void*& | |
| pword(int __ix) | |
| { | |
| _Words& __word = ((unsigned)__ix < (unsigned)_M_word_size) | |
| ? _M_word[__ix] : _M_grow_words(__ix, false); | |
| return __word._M_pword; | |
| } | |
| # 853 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| virtual ~ios_base(); | |
| protected: | |
| ios_base() throw (); | |
| # 867 "/usr/sgug/include/c++/9/bits/ios_base.h" 3 | |
| public: | |
| ios_base(const ios_base&) = delete; | |
| ios_base& | |
| operator=(const ios_base&) = delete; | |
| protected: | |
| void | |
| _M_move(ios_base&) noexcept; | |
| void | |
| _M_swap(ios_base& __rhs) noexcept; | |
| }; | |
| 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; | |
| } | |
| inline ios_base& | |
| hexfloat(ios_base& __base) | |
| { | |
| __base.setf(ios_base::fixed | ios_base::scientific, ios_base::floatfield); | |
| return __base; | |
| } | |
| inline ios_base& | |
| defaultfloat(ios_base& __base) | |
| { | |
| __base.unsetf(ios_base::floatfield); | |
| return __base; | |
| } | |
| } | |
| # 43 "/usr/sgug/include/c++/9/ios" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/streambuf" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/streambuf" 3 | |
| # 37 "/usr/sgug/include/c++/9/streambuf" 3 | |
| # 45 "/usr/sgug/include/c++/9/streambuf" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits> | |
| streamsize | |
| __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*, | |
| basic_streambuf<_CharT, _Traits>*, bool&); | |
| # 121 "/usr/sgug/include/c++/9/streambuf" 3 | |
| template<typename _CharT, typename _Traits> | |
| class basic_streambuf | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _Traits traits_type; | |
| typedef typename traits_type::int_type int_type; | |
| typedef typename traits_type::pos_type pos_type; | |
| typedef typename traits_type::off_type off_type; | |
| typedef basic_streambuf<char_type, traits_type> __streambuf_type; | |
| friend class basic_ios<char_type, traits_type>; | |
| friend class basic_istream<char_type, traits_type>; | |
| friend class basic_ostream<char_type, traits_type>; | |
| friend class istreambuf_iterator<char_type, traits_type>; | |
| friend class ostreambuf_iterator<char_type, traits_type>; | |
| friend streamsize | |
| __copy_streambufs_eof<>(basic_streambuf*, basic_streambuf*, bool&); | |
| template<bool _IsMove, typename _CharT2> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| _CharT2*>::__type | |
| __copy_move_a2(istreambuf_iterator<_CharT2>, | |
| istreambuf_iterator<_CharT2>, _CharT2*); | |
| template<typename _CharT2> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| istreambuf_iterator<_CharT2> >::__type | |
| find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, | |
| const _CharT2&); | |
| template<typename _CharT2, typename _Distance> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| void>::__type | |
| advance(istreambuf_iterator<_CharT2>&, _Distance); | |
| template<typename _CharT2, typename _Traits2> | |
| friend basic_istream<_CharT2, _Traits2>& | |
| operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*); | |
| template<typename _CharT2, typename _Traits2, typename _Alloc> | |
| friend basic_istream<_CharT2, _Traits2>& | |
| operator>>(basic_istream<_CharT2, _Traits2>&, | |
| basic_string<_CharT2, _Traits2, _Alloc>&); | |
| template<typename _CharT2, typename _Traits2, typename _Alloc> | |
| friend basic_istream<_CharT2, _Traits2>& | |
| getline(basic_istream<_CharT2, _Traits2>&, | |
| basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2); | |
| protected: | |
| char_type* _M_in_beg; | |
| char_type* _M_in_cur; | |
| char_type* _M_in_end; | |
| char_type* _M_out_beg; | |
| char_type* _M_out_cur; | |
| char_type* _M_out_end; | |
| locale _M_buf_locale; | |
| public: | |
| virtual | |
| ~basic_streambuf() | |
| { } | |
| # 215 "/usr/sgug/include/c++/9/streambuf" 3 | |
| locale | |
| pubimbue(const locale& __loc) | |
| { | |
| locale __tmp(this->getloc()); | |
| this->imbue(__loc); | |
| _M_buf_locale = __loc; | |
| return __tmp; | |
| } | |
| # 232 "/usr/sgug/include/c++/9/streambuf" 3 | |
| locale | |
| getloc() const | |
| { return _M_buf_locale; } | |
| # 245 "/usr/sgug/include/c++/9/streambuf" 3 | |
| basic_streambuf* | |
| pubsetbuf(char_type* __s, streamsize __n) | |
| { return this->setbuf(__s, __n); } | |
| # 257 "/usr/sgug/include/c++/9/streambuf" 3 | |
| pos_type | |
| pubseekoff(off_type __off, ios_base::seekdir __way, | |
| ios_base::openmode __mode = ios_base::in | ios_base::out) | |
| { return this->seekoff(__off, __way, __mode); } | |
| # 269 "/usr/sgug/include/c++/9/streambuf" 3 | |
| pos_type | |
| pubseekpos(pos_type __sp, | |
| ios_base::openmode __mode = ios_base::in | ios_base::out) | |
| { return this->seekpos(__sp, __mode); } | |
| int | |
| pubsync() { return this->sync(); } | |
| # 290 "/usr/sgug/include/c++/9/streambuf" 3 | |
| streamsize | |
| in_avail() | |
| { | |
| const streamsize __ret = this->egptr() - this->gptr(); | |
| return __ret ? __ret : this->showmanyc(); | |
| } | |
| # 304 "/usr/sgug/include/c++/9/streambuf" 3 | |
| int_type | |
| snextc() | |
| { | |
| int_type __ret = traits_type::eof(); | |
| if (__builtin_expect(!traits_type::eq_int_type(this->sbumpc(), | |
| __ret), true)) | |
| __ret = this->sgetc(); | |
| return __ret; | |
| } | |
| # 322 "/usr/sgug/include/c++/9/streambuf" 3 | |
| int_type | |
| sbumpc() | |
| { | |
| int_type __ret; | |
| if (__builtin_expect(this->gptr() < this->egptr(), true)) | |
| { | |
| __ret = traits_type::to_int_type(*this->gptr()); | |
| this->gbump(1); | |
| } | |
| else | |
| __ret = this->uflow(); | |
| return __ret; | |
| } | |
| # 344 "/usr/sgug/include/c++/9/streambuf" 3 | |
| int_type | |
| sgetc() | |
| { | |
| int_type __ret; | |
| if (__builtin_expect(this->gptr() < this->egptr(), true)) | |
| __ret = traits_type::to_int_type(*this->gptr()); | |
| else | |
| __ret = this->underflow(); | |
| return __ret; | |
| } | |
| # 363 "/usr/sgug/include/c++/9/streambuf" 3 | |
| streamsize | |
| sgetn(char_type* __s, streamsize __n) | |
| { return this->xsgetn(__s, __n); } | |
| # 378 "/usr/sgug/include/c++/9/streambuf" 3 | |
| int_type | |
| sputbackc(char_type __c) | |
| { | |
| int_type __ret; | |
| const bool __testpos = this->eback() < this->gptr(); | |
| if (__builtin_expect(!__testpos || | |
| !traits_type::eq(__c, this->gptr()[-1]), false)) | |
| __ret = this->pbackfail(traits_type::to_int_type(__c)); | |
| else | |
| { | |
| this->gbump(-1); | |
| __ret = traits_type::to_int_type(*this->gptr()); | |
| } | |
| return __ret; | |
| } | |
| # 403 "/usr/sgug/include/c++/9/streambuf" 3 | |
| int_type | |
| sungetc() | |
| { | |
| int_type __ret; | |
| if (__builtin_expect(this->eback() < this->gptr(), true)) | |
| { | |
| this->gbump(-1); | |
| __ret = traits_type::to_int_type(*this->gptr()); | |
| } | |
| else | |
| __ret = this->pbackfail(); | |
| return __ret; | |
| } | |
| # 430 "/usr/sgug/include/c++/9/streambuf" 3 | |
| int_type | |
| sputc(char_type __c) | |
| { | |
| int_type __ret; | |
| if (__builtin_expect(this->pptr() < this->epptr(), true)) | |
| { | |
| *this->pptr() = __c; | |
| this->pbump(1); | |
| __ret = traits_type::to_int_type(__c); | |
| } | |
| else | |
| __ret = this->overflow(traits_type::to_int_type(__c)); | |
| return __ret; | |
| } | |
| # 456 "/usr/sgug/include/c++/9/streambuf" 3 | |
| streamsize | |
| sputn(const char_type* __s, streamsize __n) | |
| { return this->xsputn(__s, __n); } | |
| protected: | |
| # 470 "/usr/sgug/include/c++/9/streambuf" 3 | |
| basic_streambuf() | |
| : _M_in_beg(0), _M_in_cur(0), _M_in_end(0), | |
| _M_out_beg(0), _M_out_cur(0), _M_out_end(0), | |
| _M_buf_locale(locale()) | |
| { } | |
| # 488 "/usr/sgug/include/c++/9/streambuf" 3 | |
| char_type* | |
| eback() const { return _M_in_beg; } | |
| char_type* | |
| gptr() const { return _M_in_cur; } | |
| char_type* | |
| egptr() const { return _M_in_end; } | |
| # 504 "/usr/sgug/include/c++/9/streambuf" 3 | |
| void | |
| gbump(int __n) { _M_in_cur += __n; } | |
| # 515 "/usr/sgug/include/c++/9/streambuf" 3 | |
| void | |
| setg(char_type* __gbeg, char_type* __gnext, char_type* __gend) | |
| { | |
| _M_in_beg = __gbeg; | |
| _M_in_cur = __gnext; | |
| _M_in_end = __gend; | |
| } | |
| # 535 "/usr/sgug/include/c++/9/streambuf" 3 | |
| char_type* | |
| pbase() const { return _M_out_beg; } | |
| char_type* | |
| pptr() const { return _M_out_cur; } | |
| char_type* | |
| epptr() const { return _M_out_end; } | |
| # 551 "/usr/sgug/include/c++/9/streambuf" 3 | |
| void | |
| pbump(int __n) { _M_out_cur += __n; } | |
| # 561 "/usr/sgug/include/c++/9/streambuf" 3 | |
| void | |
| setp(char_type* __pbeg, char_type* __pend) | |
| { | |
| _M_out_beg = _M_out_cur = __pbeg; | |
| _M_out_end = __pend; | |
| } | |
| # 582 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual void | |
| imbue(const locale& __loc __attribute__ ((__unused__))) | |
| { } | |
| # 597 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual basic_streambuf<char_type,_Traits>* | |
| setbuf(char_type*, streamsize) | |
| { return this; } | |
| # 608 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual pos_type | |
| seekoff(off_type, ios_base::seekdir, | |
| ios_base::openmode = ios_base::in | ios_base::out) | |
| { return pos_type(off_type(-1)); } | |
| # 620 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual pos_type | |
| seekpos(pos_type, | |
| ios_base::openmode = ios_base::in | ios_base::out) | |
| { return pos_type(off_type(-1)); } | |
| # 633 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual int | |
| sync() { return 0; } | |
| # 655 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual streamsize | |
| showmanyc() { return 0; } | |
| # 671 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual streamsize | |
| xsgetn(char_type* __s, streamsize __n); | |
| # 693 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual int_type | |
| underflow() | |
| { return traits_type::eof(); } | |
| # 706 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual int_type | |
| uflow() | |
| { | |
| int_type __ret = traits_type::eof(); | |
| const bool __testeof = traits_type::eq_int_type(this->underflow(), | |
| __ret); | |
| if (!__testeof) | |
| { | |
| __ret = traits_type::to_int_type(*this->gptr()); | |
| this->gbump(1); | |
| } | |
| return __ret; | |
| } | |
| # 730 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual int_type | |
| pbackfail(int_type __c __attribute__ ((__unused__)) = traits_type::eof()) | |
| { return traits_type::eof(); } | |
| # 748 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual streamsize | |
| xsputn(const char_type* __s, streamsize __n); | |
| # 774 "/usr/sgug/include/c++/9/streambuf" 3 | |
| virtual int_type | |
| overflow(int_type __c __attribute__ ((__unused__)) = traits_type::eof()) | |
| { return traits_type::eof(); } | |
| public: | |
| # 790 "/usr/sgug/include/c++/9/streambuf" 3 | |
| [[__deprecated__("stossc is deprecated, use sbumpc instead")]] | |
| void | |
| stossc() | |
| { | |
| if (this->gptr() < this->egptr()) | |
| this->gbump(1); | |
| else | |
| this->uflow(); | |
| } | |
| void | |
| __safe_gbump(streamsize __n) { _M_in_cur += __n; } | |
| void | |
| __safe_pbump(streamsize __n) { _M_out_cur += __n; } | |
| protected: | |
| basic_streambuf(const basic_streambuf&); | |
| basic_streambuf& | |
| operator=(const basic_streambuf&); | |
| void | |
| swap(basic_streambuf& __sb) | |
| { | |
| std::swap(_M_in_beg, __sb._M_in_beg); | |
| std::swap(_M_in_cur, __sb._M_in_cur); | |
| std::swap(_M_in_end, __sb._M_in_end); | |
| std::swap(_M_out_beg, __sb._M_out_beg); | |
| std::swap(_M_out_cur, __sb._M_out_cur); | |
| std::swap(_M_out_end, __sb._M_out_end); | |
| std::swap(_M_buf_locale, __sb._M_buf_locale); | |
| } | |
| }; | |
| template<typename _CharT, typename _Traits> | |
| std::basic_streambuf<_CharT, _Traits>:: | |
| basic_streambuf(const basic_streambuf&) = default; | |
| template<typename _CharT, typename _Traits> | |
| std::basic_streambuf<_CharT, _Traits>& | |
| std::basic_streambuf<_CharT, _Traits>:: | |
| operator=(const basic_streambuf&) = default; | |
| template<> | |
| streamsize | |
| __copy_streambufs_eof(basic_streambuf<char>* __sbin, | |
| basic_streambuf<char>* __sbout, bool& __ineof); | |
| template<> | |
| streamsize | |
| __copy_streambufs_eof(basic_streambuf<wchar_t>* __sbin, | |
| basic_streambuf<wchar_t>* __sbout, bool& __ineof); | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/streambuf.tcc" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/streambuf.tcc" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/streambuf.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits> | |
| streamsize | |
| basic_streambuf<_CharT, _Traits>:: | |
| xsgetn(char_type* __s, streamsize __n) | |
| { | |
| streamsize __ret = 0; | |
| while (__ret < __n) | |
| { | |
| const streamsize __buf_len = this->egptr() - this->gptr(); | |
| if (__buf_len) | |
| { | |
| const streamsize __remaining = __n - __ret; | |
| const streamsize __len = std::min(__buf_len, __remaining); | |
| traits_type::copy(__s, this->gptr(), __len); | |
| __ret += __len; | |
| __s += __len; | |
| this->__safe_gbump(__len); | |
| } | |
| if (__ret < __n) | |
| { | |
| const int_type __c = this->uflow(); | |
| if (!traits_type::eq_int_type(__c, traits_type::eof())) | |
| { | |
| traits_type::assign(*__s++, traits_type::to_char_type(__c)); | |
| ++__ret; | |
| } | |
| else | |
| break; | |
| } | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| streamsize | |
| basic_streambuf<_CharT, _Traits>:: | |
| xsputn(const char_type* __s, streamsize __n) | |
| { | |
| streamsize __ret = 0; | |
| while (__ret < __n) | |
| { | |
| const streamsize __buf_len = this->epptr() - this->pptr(); | |
| if (__buf_len) | |
| { | |
| const streamsize __remaining = __n - __ret; | |
| const streamsize __len = std::min(__buf_len, __remaining); | |
| traits_type::copy(this->pptr(), __s, __len); | |
| __ret += __len; | |
| __s += __len; | |
| this->__safe_pbump(__len); | |
| } | |
| if (__ret < __n) | |
| { | |
| int_type __c = this->overflow(traits_type::to_int_type(*__s)); | |
| if (!traits_type::eq_int_type(__c, traits_type::eof())) | |
| { | |
| ++__ret; | |
| ++__s; | |
| } | |
| else | |
| break; | |
| } | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| streamsize | |
| __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin, | |
| basic_streambuf<_CharT, _Traits>* __sbout, | |
| bool& __ineof) | |
| { | |
| streamsize __ret = 0; | |
| __ineof = true; | |
| typename _Traits::int_type __c = __sbin->sgetc(); | |
| while (!_Traits::eq_int_type(__c, _Traits::eof())) | |
| { | |
| __c = __sbout->sputc(_Traits::to_char_type(__c)); | |
| if (_Traits::eq_int_type(__c, _Traits::eof())) | |
| { | |
| __ineof = false; | |
| break; | |
| } | |
| ++__ret; | |
| __c = __sbin->snextc(); | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| inline streamsize | |
| __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin, | |
| basic_streambuf<_CharT, _Traits>* __sbout) | |
| { | |
| bool __ineof; | |
| return __copy_streambufs_eof(__sbin, __sbout, __ineof); | |
| } | |
| extern template class basic_streambuf<char>; | |
| extern template | |
| streamsize | |
| __copy_streambufs(basic_streambuf<char>*, | |
| basic_streambuf<char>*); | |
| extern template | |
| streamsize | |
| __copy_streambufs_eof(basic_streambuf<char>*, | |
| basic_streambuf<char>*, bool&); | |
| extern template class basic_streambuf<wchar_t>; | |
| extern template | |
| streamsize | |
| __copy_streambufs(basic_streambuf<wchar_t>*, | |
| basic_streambuf<wchar_t>*); | |
| extern template | |
| streamsize | |
| __copy_streambufs_eof(basic_streambuf<wchar_t>*, | |
| basic_streambuf<wchar_t>*, bool&); | |
| } | |
| # 863 "/usr/sgug/include/c++/9/streambuf" 2 3 | |
| # 44 "/usr/sgug/include/c++/9/ios" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/basic_ios.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/locale_facets.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/cwctype" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cwctype" 3 | |
| # 40 "/usr/sgug/include/c++/9/cwctype" 3 | |
| # 50 "/usr/sgug/include/c++/9/cwctype" 3 | |
| # 1 "/usr/include/wctype.h" 1 3 4 | |
| #ident "$Revision: 1.8 $" | |
| # 51 "/usr/sgug/include/c++/9/cwctype" 2 3 | |
| # 80 "/usr/sgug/include/c++/9/cwctype" 3 | |
| namespace std | |
| { | |
| using ::wctrans_t; | |
| using ::wctype_t; | |
| using ::wint_t; | |
| using ::iswalnum; | |
| using ::iswalpha; | |
| using ::iswblank; | |
| using ::iswcntrl; | |
| using ::iswctype; | |
| using ::iswdigit; | |
| using ::iswgraph; | |
| using ::iswlower; | |
| using ::iswprint; | |
| using ::iswpunct; | |
| using ::iswspace; | |
| using ::iswupper; | |
| using ::iswxdigit; | |
| using ::towctrans; | |
| using ::towlower; | |
| using ::towupper; | |
| using ::wctrans; | |
| using ::wctype; | |
| } | |
| # 40 "/usr/sgug/include/c++/9/bits/locale_facets.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/cctype" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/cctype" 3 | |
| # 40 "/usr/sgug/include/c++/9/cctype" 3 | |
| # 41 "/usr/sgug/include/c++/9/bits/locale_facets.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/ctype_base.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/ctype_base.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| struct ctype_base | |
| { | |
| typedef int* __to_type; | |
| typedef unsigned int mask; | |
| static const mask upper = (0x00000001); | |
| static const mask lower = (0x00000002); | |
| static const mask alpha = (0x00000001 | 0x00000002 | 0x00004000); | |
| static const mask digit = (0x00000004); | |
| static const mask xdigit = (0x00000080); | |
| static const mask space = (0x00000008 | 0x80000000); | |
| static const mask print = (0x00000010 | 0x00000001 | 0x00000002 | 0x00000004 | 0x00004000 | 0x00000080 | 0x00008000); | |
| static const mask graph = (0x00000001 | 0x00000002 | 0x00004000) | (0x00000004) | (0x00000010); | |
| static const mask cntrl = (0x00000020); | |
| static const mask punct = (0x00000010); | |
| static const mask alnum = (0x00000001 | 0x00000002 | 0x00004000) | (0x00000004); | |
| static const mask blank = (0x80000000); | |
| }; | |
| } | |
| # 42 "/usr/sgug/include/c++/9/bits/locale_facets.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/streambuf_iterator.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/streambuf_iterator.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/streambuf_iterator.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 49 "/usr/sgug/include/c++/9/bits/streambuf_iterator.h" 3 | |
| template<typename _CharT, typename _Traits> | |
| class istreambuf_iterator | |
| : public iterator<input_iterator_tag, _CharT, typename _Traits::off_type, | |
| _CharT*, | |
| _CharT> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _Traits traits_type; | |
| typedef typename _Traits::int_type int_type; | |
| typedef basic_streambuf<_CharT, _Traits> streambuf_type; | |
| typedef basic_istream<_CharT, _Traits> istream_type; | |
| template<typename _CharT2> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| ostreambuf_iterator<_CharT2> >::__type | |
| copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, | |
| ostreambuf_iterator<_CharT2>); | |
| template<bool _IsMove, typename _CharT2> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| _CharT2*>::__type | |
| __copy_move_a2(istreambuf_iterator<_CharT2>, | |
| istreambuf_iterator<_CharT2>, _CharT2*); | |
| template<typename _CharT2> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| istreambuf_iterator<_CharT2> >::__type | |
| find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, | |
| const _CharT2&); | |
| template<typename _CharT2, typename _Distance> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| void>::__type | |
| advance(istreambuf_iterator<_CharT2>&, _Distance); | |
| private: | |
| mutable streambuf_type* _M_sbuf; | |
| int_type _M_c; | |
| public: | |
| constexpr istreambuf_iterator() noexcept | |
| : _M_sbuf(0), _M_c(traits_type::eof()) { } | |
| istreambuf_iterator(const istreambuf_iterator&) noexcept = default; | |
| ~istreambuf_iterator() = default; | |
| istreambuf_iterator(istream_type& __s) noexcept | |
| : _M_sbuf(__s.rdbuf()), _M_c(traits_type::eof()) { } | |
| istreambuf_iterator(streambuf_type* __s) noexcept | |
| : _M_sbuf(__s), _M_c(traits_type::eof()) { } | |
| istreambuf_iterator& | |
| operator=(const istreambuf_iterator&) noexcept = default; | |
| char_type | |
| operator*() const | |
| { | |
| int_type __c = _M_get(); | |
| # 144 "/usr/sgug/include/c++/9/bits/streambuf_iterator.h" 3 | |
| return traits_type::to_char_type(__c); | |
| } | |
| istreambuf_iterator& | |
| operator++() | |
| { | |
| ; | |
| _M_sbuf->sbumpc(); | |
| _M_c = traits_type::eof(); | |
| return *this; | |
| } | |
| istreambuf_iterator | |
| operator++(int) | |
| { | |
| ; | |
| istreambuf_iterator __old = *this; | |
| __old._M_c = _M_sbuf->sbumpc(); | |
| _M_c = traits_type::eof(); | |
| return __old; | |
| } | |
| bool | |
| equal(const istreambuf_iterator& __b) const | |
| { return _M_at_eof() == __b._M_at_eof(); } | |
| private: | |
| int_type | |
| _M_get() const | |
| { | |
| int_type __ret = _M_c; | |
| if (_M_sbuf && _S_is_eof(__ret) && _S_is_eof(__ret = _M_sbuf->sgetc())) | |
| _M_sbuf = 0; | |
| return __ret; | |
| } | |
| bool | |
| _M_at_eof() const | |
| { return _S_is_eof(_M_get()); } | |
| static bool | |
| _S_is_eof(int_type __c) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| return traits_type::eq_int_type(__c, __eof); | |
| } | |
| }; | |
| template<typename _CharT, typename _Traits> | |
| inline bool | |
| operator==(const istreambuf_iterator<_CharT, _Traits>& __a, | |
| const istreambuf_iterator<_CharT, _Traits>& __b) | |
| { return __a.equal(__b); } | |
| template<typename _CharT, typename _Traits> | |
| inline bool | |
| operator!=(const istreambuf_iterator<_CharT, _Traits>& __a, | |
| const istreambuf_iterator<_CharT, _Traits>& __b) | |
| { return !__a.equal(__b); } | |
| template<typename _CharT, typename _Traits> | |
| class ostreambuf_iterator | |
| : public iterator<output_iterator_tag, void, void, void, void> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _Traits traits_type; | |
| typedef basic_streambuf<_CharT, _Traits> streambuf_type; | |
| typedef basic_ostream<_CharT, _Traits> ostream_type; | |
| template<typename _CharT2> | |
| friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, | |
| ostreambuf_iterator<_CharT2> >::__type | |
| copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, | |
| ostreambuf_iterator<_CharT2>); | |
| private: | |
| streambuf_type* _M_sbuf; | |
| bool _M_failed; | |
| public: | |
| ostreambuf_iterator(ostream_type& __s) noexcept | |
| : _M_sbuf(__s.rdbuf()), _M_failed(!_M_sbuf) { } | |
| ostreambuf_iterator(streambuf_type* __s) noexcept | |
| : _M_sbuf(__s), _M_failed(!_M_sbuf) { } | |
| ostreambuf_iterator& | |
| operator=(_CharT __c) | |
| { | |
| if (!_M_failed && | |
| _Traits::eq_int_type(_M_sbuf->sputc(__c), _Traits::eof())) | |
| _M_failed = true; | |
| return *this; | |
| } | |
| ostreambuf_iterator& | |
| operator*() | |
| { return *this; } | |
| ostreambuf_iterator& | |
| operator++(int) | |
| { return *this; } | |
| ostreambuf_iterator& | |
| operator++() | |
| { return *this; } | |
| bool | |
| failed() const noexcept | |
| { return _M_failed; } | |
| ostreambuf_iterator& | |
| _M_put(const _CharT* __ws, streamsize __len) | |
| { | |
| if (__builtin_expect(!_M_failed, true) | |
| && __builtin_expect(this->_M_sbuf->sputn(__ws, __len) != __len, | |
| false)) | |
| _M_failed = true; | |
| return *this; | |
| } | |
| }; | |
| template<typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| ostreambuf_iterator<_CharT> >::__type | |
| copy(istreambuf_iterator<_CharT> __first, | |
| istreambuf_iterator<_CharT> __last, | |
| ostreambuf_iterator<_CharT> __result) | |
| { | |
| if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) | |
| { | |
| bool __ineof; | |
| __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof); | |
| if (!__ineof) | |
| __result._M_failed = true; | |
| } | |
| return __result; | |
| } | |
| template<bool _IsMove, typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| ostreambuf_iterator<_CharT> >::__type | |
| __copy_move_a2(_CharT* __first, _CharT* __last, | |
| ostreambuf_iterator<_CharT> __result) | |
| { | |
| const streamsize __num = __last - __first; | |
| if (__num > 0) | |
| __result._M_put(__first, __num); | |
| return __result; | |
| } | |
| template<bool _IsMove, typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| ostreambuf_iterator<_CharT> >::__type | |
| __copy_move_a2(const _CharT* __first, const _CharT* __last, | |
| ostreambuf_iterator<_CharT> __result) | |
| { | |
| const streamsize __num = __last - __first; | |
| if (__num > 0) | |
| __result._M_put(__first, __num); | |
| return __result; | |
| } | |
| template<bool _IsMove, typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| _CharT*>::__type | |
| __copy_move_a2(istreambuf_iterator<_CharT> __first, | |
| istreambuf_iterator<_CharT> __last, _CharT* __result) | |
| { | |
| typedef istreambuf_iterator<_CharT> __is_iterator_type; | |
| typedef typename __is_iterator_type::traits_type traits_type; | |
| typedef typename __is_iterator_type::streambuf_type streambuf_type; | |
| typedef typename traits_type::int_type int_type; | |
| if (__first._M_sbuf && !__last._M_sbuf) | |
| { | |
| streambuf_type* __sb = __first._M_sbuf; | |
| int_type __c = __sb->sgetc(); | |
| while (!traits_type::eq_int_type(__c, traits_type::eof())) | |
| { | |
| const streamsize __n = __sb->egptr() - __sb->gptr(); | |
| if (__n > 1) | |
| { | |
| traits_type::copy(__result, __sb->gptr(), __n); | |
| __sb->__safe_gbump(__n); | |
| __result += __n; | |
| __c = __sb->underflow(); | |
| } | |
| else | |
| { | |
| *__result++ = traits_type::to_char_type(__c); | |
| __c = __sb->snextc(); | |
| } | |
| } | |
| } | |
| return __result; | |
| } | |
| template<typename _CharT> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| istreambuf_iterator<_CharT> >::__type | |
| find(istreambuf_iterator<_CharT> __first, | |
| istreambuf_iterator<_CharT> __last, const _CharT& __val) | |
| { | |
| typedef istreambuf_iterator<_CharT> __is_iterator_type; | |
| typedef typename __is_iterator_type::traits_type traits_type; | |
| typedef typename __is_iterator_type::streambuf_type streambuf_type; | |
| typedef typename traits_type::int_type int_type; | |
| const int_type __eof = traits_type::eof(); | |
| if (__first._M_sbuf && !__last._M_sbuf) | |
| { | |
| const int_type __ival = traits_type::to_int_type(__val); | |
| streambuf_type* __sb = __first._M_sbuf; | |
| int_type __c = __sb->sgetc(); | |
| while (!traits_type::eq_int_type(__c, __eof) | |
| && !traits_type::eq_int_type(__c, __ival)) | |
| { | |
| streamsize __n = __sb->egptr() - __sb->gptr(); | |
| if (__n > 1) | |
| { | |
| const _CharT* __p = traits_type::find(__sb->gptr(), | |
| __n, __val); | |
| if (__p) | |
| __n = __p - __sb->gptr(); | |
| __sb->__safe_gbump(__n); | |
| __c = __sb->sgetc(); | |
| } | |
| else | |
| __c = __sb->snextc(); | |
| } | |
| __first._M_c = __eof; | |
| } | |
| return __first; | |
| } | |
| template<typename _CharT, typename _Distance> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, | |
| void>::__type | |
| advance(istreambuf_iterator<_CharT>& __i, _Distance __n) | |
| { | |
| if (__n == 0) | |
| return; | |
| ; | |
| ; | |
| typedef istreambuf_iterator<_CharT> __is_iterator_type; | |
| typedef typename __is_iterator_type::traits_type traits_type; | |
| typedef typename __is_iterator_type::streambuf_type streambuf_type; | |
| typedef typename traits_type::int_type int_type; | |
| const int_type __eof = traits_type::eof(); | |
| streambuf_type* __sb = __i._M_sbuf; | |
| while (__n > 0) | |
| { | |
| streamsize __size = __sb->egptr() - __sb->gptr(); | |
| if (__size > __n) | |
| { | |
| __sb->__safe_gbump(__n); | |
| break; | |
| } | |
| __sb->__safe_gbump(__size); | |
| __n -= __size; | |
| if (traits_type::eq_int_type(__sb->underflow(), __eof)) | |
| { | |
| ; | |
| break; | |
| } | |
| } | |
| __i._M_c = __eof; | |
| } | |
| } | |
| # 49 "/usr/sgug/include/c++/9/bits/locale_facets.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 71 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<typename _Tp> | |
| void | |
| __convert_to_v(const char*, _Tp&, ios_base::iostate&, | |
| const __c_locale&) throw(); | |
| template<> | |
| void | |
| __convert_to_v(const char*, float&, ios_base::iostate&, | |
| const __c_locale&) throw(); | |
| template<> | |
| void | |
| __convert_to_v(const char*, double&, ios_base::iostate&, | |
| const __c_locale&) throw(); | |
| template<> | |
| void | |
| __convert_to_v(const char*, long double&, ios_base::iostate&, | |
| const __c_locale&) throw(); | |
| template<typename _CharT, typename _Traits> | |
| struct __pad | |
| { | |
| static void | |
| _S_pad(ios_base& __io, _CharT __fill, _CharT* __news, | |
| const _CharT* __olds, streamsize __newlen, streamsize __oldlen); | |
| }; | |
| template<typename _CharT> | |
| _CharT* | |
| __add_grouping(_CharT* __s, _CharT __sep, | |
| const char* __gbeg, size_t __gsize, | |
| const _CharT* __first, const _CharT* __last); | |
| template<typename _CharT> | |
| inline | |
| ostreambuf_iterator<_CharT> | |
| __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) | |
| { | |
| __s._M_put(__ws, __len); | |
| return __s; | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| inline | |
| _OutIter | |
| __write(_OutIter __s, const _CharT* __ws, int __len) | |
| { | |
| for (int __j = 0; __j < __len; __j++, ++__s) | |
| *__s = __ws[__j]; | |
| return __s; | |
| } | |
| # 149 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<typename _CharT> | |
| class __ctype_abstract_base : public locale::facet, public ctype_base | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| # 168 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| bool | |
| is(mask __m, char_type __c) const | |
| { return this->do_is(__m, __c); } | |
| # 185 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| is(const char_type *__lo, const char_type *__hi, mask *__vec) const | |
| { return this->do_is(__lo, __hi, __vec); } | |
| # 201 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| scan_is(mask __m, const char_type* __lo, const char_type* __hi) const | |
| { return this->do_scan_is(__m, __lo, __hi); } | |
| # 217 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| scan_not(mask __m, const char_type* __lo, const char_type* __hi) const | |
| { return this->do_scan_not(__m, __lo, __hi); } | |
| # 231 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| toupper(char_type __c) const | |
| { return this->do_toupper(__c); } | |
| # 246 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| toupper(char_type *__lo, const char_type* __hi) const | |
| { return this->do_toupper(__lo, __hi); } | |
| # 260 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| tolower(char_type __c) const | |
| { return this->do_tolower(__c); } | |
| # 275 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| tolower(char_type* __lo, const char_type* __hi) const | |
| { return this->do_tolower(__lo, __hi); } | |
| # 292 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| widen(char __c) const | |
| { return this->do_widen(__c); } | |
| # 311 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char* | |
| widen(const char* __lo, const char* __hi, char_type* __to) const | |
| { return this->do_widen(__lo, __hi, __to); } | |
| # 330 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char | |
| narrow(char_type __c, char __dfault) const | |
| { return this->do_narrow(__c, __dfault); } | |
| # 352 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| narrow(const char_type* __lo, const char_type* __hi, | |
| char __dfault, char* __to) const | |
| { return this->do_narrow(__lo, __hi, __dfault, __to); } | |
| protected: | |
| explicit | |
| __ctype_abstract_base(size_t __refs = 0): facet(__refs) { } | |
| virtual | |
| ~__ctype_abstract_base() { } | |
| # 377 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual bool | |
| do_is(mask __m, char_type __c) const = 0; | |
| # 396 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_is(const char_type* __lo, const char_type* __hi, | |
| mask* __vec) const = 0; | |
| # 415 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_scan_is(mask __m, const char_type* __lo, | |
| const char_type* __hi) const = 0; | |
| # 434 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_scan_not(mask __m, const char_type* __lo, | |
| const char_type* __hi) const = 0; | |
| # 452 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_toupper(char_type __c) const = 0; | |
| # 469 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_toupper(char_type* __lo, const char_type* __hi) const = 0; | |
| # 485 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_tolower(char_type __c) const = 0; | |
| # 502 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_tolower(char_type* __lo, const char_type* __hi) const = 0; | |
| # 521 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_widen(char __c) const = 0; | |
| # 542 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char* | |
| do_widen(const char* __lo, const char* __hi, char_type* __to) const = 0; | |
| # 563 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char | |
| do_narrow(char_type __c, char __dfault) const = 0; | |
| # 588 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_narrow(const char_type* __lo, const char_type* __hi, | |
| char __dfault, char* __to) const = 0; | |
| }; | |
| # 611 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<typename _CharT> | |
| class ctype : public __ctype_abstract_base<_CharT> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef typename __ctype_abstract_base<_CharT>::mask mask; | |
| static locale::id id; | |
| explicit | |
| ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { } | |
| protected: | |
| virtual | |
| ~ctype(); | |
| virtual bool | |
| do_is(mask __m, char_type __c) const; | |
| virtual const char_type* | |
| do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; | |
| virtual const char_type* | |
| do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; | |
| virtual const char_type* | |
| do_scan_not(mask __m, const char_type* __lo, | |
| const char_type* __hi) const; | |
| virtual char_type | |
| do_toupper(char_type __c) const; | |
| virtual const char_type* | |
| do_toupper(char_type* __lo, const char_type* __hi) const; | |
| virtual char_type | |
| do_tolower(char_type __c) const; | |
| virtual const char_type* | |
| do_tolower(char_type* __lo, const char_type* __hi) const; | |
| virtual char_type | |
| do_widen(char __c) const; | |
| virtual const char* | |
| do_widen(const char* __lo, const char* __hi, char_type* __dest) const; | |
| virtual char | |
| do_narrow(char_type, char __dfault) const; | |
| virtual const char_type* | |
| do_narrow(const char_type* __lo, const char_type* __hi, | |
| char __dfault, char* __to) const; | |
| }; | |
| template<typename _CharT> | |
| locale::id ctype<_CharT>::id; | |
| # 680 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<> | |
| class ctype<char> : public locale::facet, public ctype_base | |
| { | |
| public: | |
| typedef char char_type; | |
| protected: | |
| __c_locale _M_c_locale_ctype; | |
| bool _M_del; | |
| __to_type _M_toupper; | |
| __to_type _M_tolower; | |
| const mask* _M_table; | |
| mutable char _M_widen_ok; | |
| mutable char _M_widen[1 + static_cast<unsigned char>(-1)]; | |
| mutable char _M_narrow[1 + static_cast<unsigned char>(-1)]; | |
| mutable char _M_narrow_ok; | |
| public: | |
| static locale::id id; | |
| static const size_t table_size = 1 + static_cast<unsigned char>(-1); | |
| # 717 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0); | |
| # 730 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false, | |
| size_t __refs = 0); | |
| # 743 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| inline bool | |
| is(mask __m, char __c) const; | |
| # 758 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| inline const char* | |
| is(const char* __lo, const char* __hi, mask* __vec) const; | |
| # 772 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| inline const char* | |
| scan_is(mask __m, const char* __lo, const char* __hi) const; | |
| # 786 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| inline const char* | |
| scan_not(mask __m, const char* __lo, const char* __hi) const; | |
| # 801 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| toupper(char_type __c) const | |
| { return this->do_toupper(__c); } | |
| # 818 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| toupper(char_type *__lo, const char_type* __hi) const | |
| { return this->do_toupper(__lo, __hi); } | |
| # 834 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| tolower(char_type __c) const | |
| { return this->do_tolower(__c); } | |
| # 851 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| tolower(char_type* __lo, const char_type* __hi) const | |
| { return this->do_tolower(__lo, __hi); } | |
| # 871 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| widen(char __c) const | |
| { | |
| if (_M_widen_ok) | |
| return _M_widen[static_cast<unsigned char>(__c)]; | |
| this->_M_widen_init(); | |
| return this->do_widen(__c); | |
| } | |
| # 898 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char* | |
| widen(const char* __lo, const char* __hi, char_type* __to) const | |
| { | |
| if (_M_widen_ok == 1) | |
| { | |
| if (__builtin_expect(__hi != __lo, true)) | |
| __builtin_memcpy(__to, __lo, __hi - __lo); | |
| return __hi; | |
| } | |
| if (!_M_widen_ok) | |
| _M_widen_init(); | |
| return this->do_widen(__lo, __hi, __to); | |
| } | |
| # 930 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char | |
| narrow(char_type __c, char __dfault) const | |
| { | |
| if (_M_narrow[static_cast<unsigned char>(__c)]) | |
| return _M_narrow[static_cast<unsigned char>(__c)]; | |
| const char __t = do_narrow(__c, __dfault); | |
| if (__t != __dfault) | |
| _M_narrow[static_cast<unsigned char>(__c)] = __t; | |
| return __t; | |
| } | |
| # 963 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| const char_type* | |
| narrow(const char_type* __lo, const char_type* __hi, | |
| char __dfault, char* __to) const | |
| { | |
| if (__builtin_expect(_M_narrow_ok == 1, true)) | |
| { | |
| if (__builtin_expect(__hi != __lo, true)) | |
| __builtin_memcpy(__to, __lo, __hi - __lo); | |
| return __hi; | |
| } | |
| if (!_M_narrow_ok) | |
| _M_narrow_init(); | |
| return this->do_narrow(__lo, __hi, __dfault, __to); | |
| } | |
| const mask* | |
| table() const throw() | |
| { return _M_table; } | |
| static const mask* | |
| classic_table() throw(); | |
| protected: | |
| virtual | |
| ~ctype(); | |
| # 1013 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_toupper(char_type __c) const; | |
| # 1030 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_toupper(char_type* __lo, const char_type* __hi) const; | |
| # 1046 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_tolower(char_type __c) const; | |
| # 1063 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_tolower(char_type* __lo, const char_type* __hi) const; | |
| # 1083 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_widen(char __c) const | |
| { return __c; } | |
| # 1106 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char* | |
| do_widen(const char* __lo, const char* __hi, char_type* __to) const | |
| { | |
| if (__builtin_expect(__hi != __lo, true)) | |
| __builtin_memcpy(__to, __lo, __hi - __lo); | |
| return __hi; | |
| } | |
| # 1133 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char | |
| do_narrow(char_type __c, char __dfault __attribute__((__unused__))) const | |
| { return __c; } | |
| # 1159 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_narrow(const char_type* __lo, const char_type* __hi, | |
| char __dfault __attribute__((__unused__)), char* __to) const | |
| { | |
| if (__builtin_expect(__hi != __lo, true)) | |
| __builtin_memcpy(__to, __lo, __hi - __lo); | |
| return __hi; | |
| } | |
| private: | |
| void _M_narrow_init() const; | |
| void _M_widen_init() const; | |
| }; | |
| # 1185 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<> | |
| class ctype<wchar_t> : public __ctype_abstract_base<wchar_t> | |
| { | |
| public: | |
| typedef wchar_t char_type; | |
| typedef wctype_t __wmask_type; | |
| protected: | |
| __c_locale _M_c_locale_ctype; | |
| bool _M_narrow_ok; | |
| char _M_narrow[128]; | |
| wint_t _M_widen[1 + static_cast<unsigned char>(-1)]; | |
| mask _M_bit[16]; | |
| __wmask_type _M_wmask[16]; | |
| public: | |
| static locale::id id; | |
| # 1218 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| ctype(size_t __refs = 0); | |
| # 1229 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| ctype(__c_locale __cloc, size_t __refs = 0); | |
| protected: | |
| __wmask_type | |
| _M_convert_to_wmask(const mask __m) const throw(); | |
| virtual | |
| ~ctype(); | |
| # 1253 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual bool | |
| do_is(mask __m, char_type __c) const; | |
| # 1272 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; | |
| # 1290 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; | |
| # 1308 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_scan_not(mask __m, const char_type* __lo, | |
| const char_type* __hi) const; | |
| # 1325 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_toupper(char_type __c) const; | |
| # 1342 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_toupper(char_type* __lo, const char_type* __hi) const; | |
| # 1358 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_tolower(char_type __c) const; | |
| # 1375 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_tolower(char_type* __lo, const char_type* __hi) const; | |
| # 1395 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_widen(char __c) const; | |
| # 1417 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char* | |
| do_widen(const char* __lo, const char* __hi, char_type* __to) const; | |
| # 1440 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char | |
| do_narrow(char_type __c, char __dfault) const; | |
| # 1466 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual const char_type* | |
| do_narrow(const char_type* __lo, const char_type* __hi, | |
| char __dfault, char* __to) const; | |
| void | |
| _M_initialize_ctype() throw(); | |
| }; | |
| template<typename _CharT> | |
| class ctype_byname : public ctype<_CharT> | |
| { | |
| public: | |
| typedef typename ctype<_CharT>::mask mask; | |
| explicit | |
| ctype_byname(const char* __s, size_t __refs = 0); | |
| explicit | |
| ctype_byname(const string& __s, size_t __refs = 0) | |
| : ctype_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~ctype_byname() { } | |
| }; | |
| template<> | |
| class ctype_byname<char> : public ctype<char> | |
| { | |
| public: | |
| explicit | |
| ctype_byname(const char* __s, size_t __refs = 0); | |
| explicit | |
| ctype_byname(const string& __s, size_t __refs = 0); | |
| protected: | |
| virtual | |
| ~ctype_byname(); | |
| }; | |
| template<> | |
| class ctype_byname<wchar_t> : public ctype<wchar_t> | |
| { | |
| public: | |
| explicit | |
| ctype_byname(const char* __s, size_t __refs = 0); | |
| explicit | |
| ctype_byname(const string& __s, size_t __refs = 0); | |
| protected: | |
| virtual | |
| ~ctype_byname(); | |
| }; | |
| } | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/ctype_inline.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/ctype_inline.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| bool | |
| ctype<char>:: | |
| is(mask __m, char __c) const | |
| { return (_M_table)[static_cast<unsigned char>(__c)] & __m; } | |
| const char* | |
| ctype<char>:: | |
| is(const char* __low, const char* __high, mask* __vec) const | |
| { | |
| while (__low < __high) | |
| *__vec++ = (_M_table)[static_cast<unsigned char>(*__low++)]; | |
| return __high; | |
| } | |
| const char* | |
| ctype<char>:: | |
| scan_is(mask __m, const char* __low, const char* __high) const | |
| { | |
| while (__low < __high && ! this->is(__m, *__low)) | |
| ++__low; | |
| return __low; | |
| } | |
| const char* | |
| ctype<char>:: | |
| scan_not(mask __m, const char* __low, const char* __high) const | |
| { | |
| while (__low < __high && this->is(__m, *__low)) | |
| ++__low; | |
| return __low; | |
| } | |
| } | |
| # 1539 "/usr/sgug/include/c++/9/bits/locale_facets.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| class __num_base | |
| { | |
| public: | |
| enum | |
| { | |
| _S_ominus, | |
| _S_oplus, | |
| _S_ox, | |
| _S_oX, | |
| _S_odigits, | |
| _S_odigits_end = _S_odigits + 16, | |
| _S_oudigits = _S_odigits_end, | |
| _S_oudigits_end = _S_oudigits + 16, | |
| _S_oe = _S_odigits + 14, | |
| _S_oE = _S_oudigits + 14, | |
| _S_oend = _S_oudigits_end | |
| }; | |
| static const char* _S_atoms_out; | |
| static const char* _S_atoms_in; | |
| enum | |
| { | |
| _S_iminus, | |
| _S_iplus, | |
| _S_ix, | |
| _S_iX, | |
| _S_izero, | |
| _S_ie = _S_izero + 14, | |
| _S_iE = _S_izero + 20, | |
| _S_iend = 26 | |
| }; | |
| static void | |
| _S_format_float(const ios_base& __io, char* __fptr, char __mod) throw(); | |
| }; | |
| template<typename _CharT> | |
| struct __numpunct_cache : public locale::facet | |
| { | |
| const char* _M_grouping; | |
| size_t _M_grouping_size; | |
| bool _M_use_grouping; | |
| const _CharT* _M_truename; | |
| size_t _M_truename_size; | |
| const _CharT* _M_falsename; | |
| size_t _M_falsename_size; | |
| _CharT _M_decimal_point; | |
| _CharT _M_thousands_sep; | |
| _CharT _M_atoms_out[__num_base::_S_oend]; | |
| _CharT _M_atoms_in[__num_base::_S_iend]; | |
| bool _M_allocated; | |
| __numpunct_cache(size_t __refs = 0) | |
| : facet(__refs), _M_grouping(0), _M_grouping_size(0), | |
| _M_use_grouping(false), | |
| _M_truename(0), _M_truename_size(0), _M_falsename(0), | |
| _M_falsename_size(0), _M_decimal_point(_CharT()), | |
| _M_thousands_sep(_CharT()), _M_allocated(false) | |
| { } | |
| ~__numpunct_cache(); | |
| void | |
| _M_cache(const locale& __loc); | |
| private: | |
| __numpunct_cache& | |
| operator=(const __numpunct_cache&); | |
| explicit | |
| __numpunct_cache(const __numpunct_cache&); | |
| }; | |
| template<typename _CharT> | |
| __numpunct_cache<_CharT>::~__numpunct_cache() | |
| { | |
| if (_M_allocated) | |
| { | |
| delete [] _M_grouping; | |
| delete [] _M_truename; | |
| delete [] _M_falsename; | |
| } | |
| } | |
| namespace __cxx11 { | |
| # 1669 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<typename _CharT> | |
| class numpunct : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| protected: | |
| __cache_type* _M_data; | |
| public: | |
| static locale::id id; | |
| explicit | |
| numpunct(size_t __refs = 0) | |
| : facet(__refs), _M_data(0) | |
| { _M_initialize_numpunct(); } | |
| # 1707 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| numpunct(__cache_type* __cache, size_t __refs = 0) | |
| : facet(__refs), _M_data(__cache) | |
| { _M_initialize_numpunct(); } | |
| # 1721 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| numpunct(__c_locale __cloc, size_t __refs = 0) | |
| : facet(__refs), _M_data(0) | |
| { _M_initialize_numpunct(__cloc); } | |
| # 1735 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| decimal_point() const | |
| { return this->do_decimal_point(); } | |
| # 1748 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| char_type | |
| thousands_sep() const | |
| { return this->do_thousands_sep(); } | |
| # 1779 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| string | |
| grouping() const | |
| { return this->do_grouping(); } | |
| # 1792 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| string_type | |
| truename() const | |
| { return this->do_truename(); } | |
| # 1805 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| string_type | |
| falsename() const | |
| { return this->do_falsename(); } | |
| protected: | |
| virtual | |
| ~numpunct(); | |
| # 1822 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_decimal_point() const | |
| { return _M_data->_M_decimal_point; } | |
| # 1834 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual char_type | |
| do_thousands_sep() const | |
| { return _M_data->_M_thousands_sep; } | |
| # 1847 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual string | |
| do_grouping() const | |
| { return _M_data->_M_grouping; } | |
| # 1860 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual string_type | |
| do_truename() const | |
| { return _M_data->_M_truename; } | |
| # 1873 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual string_type | |
| do_falsename() const | |
| { return _M_data->_M_falsename; } | |
| void | |
| _M_initialize_numpunct(__c_locale __cloc = 0); | |
| }; | |
| template<typename _CharT> | |
| locale::id numpunct<_CharT>::id; | |
| template<> | |
| numpunct<char>::~numpunct(); | |
| template<> | |
| void | |
| numpunct<char>::_M_initialize_numpunct(__c_locale __cloc); | |
| template<> | |
| numpunct<wchar_t>::~numpunct(); | |
| template<> | |
| void | |
| numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc); | |
| template<typename _CharT> | |
| class numpunct_byname : public numpunct<_CharT> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| explicit | |
| numpunct_byname(const char* __s, size_t __refs = 0) | |
| : numpunct<_CharT>(__refs) | |
| { | |
| if (__builtin_strcmp(__s, "C") != 0 | |
| && __builtin_strcmp(__s, "POSIX") != 0) | |
| { | |
| __c_locale __tmp; | |
| this->_S_create_c_locale(__tmp, __s); | |
| this->_M_initialize_numpunct(__tmp); | |
| this->_S_destroy_c_locale(__tmp); | |
| } | |
| } | |
| explicit | |
| numpunct_byname(const string& __s, size_t __refs = 0) | |
| : numpunct_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~numpunct_byname() { } | |
| }; | |
| } | |
| # 1951 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<typename _CharT, typename _InIter> | |
| class num_get : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _InIter iter_type; | |
| static locale::id id; | |
| # 1972 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| num_get(size_t __refs = 0) : facet(__refs) { } | |
| # 1998 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, bool& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| # 2035 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, long& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned short& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned int& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned long& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, long long& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned long long& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| # 2095 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, float& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, double& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, long double& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| # 2138 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| get(iter_type __in, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, void*& __v) const | |
| { return this->do_get(__in, __end, __io, __err, __v); } | |
| protected: | |
| virtual ~num_get() { } | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| iter_type | |
| _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&, | |
| string&) const; | |
| template<typename _ValueT> | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| iter_type | |
| _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&, | |
| _ValueT&) const; | |
| template<typename _CharT2> | |
| typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, int>::__type | |
| _M_find(const _CharT2*, size_t __len, _CharT2 __c) const | |
| { | |
| int __ret = -1; | |
| if (__len <= 10) | |
| { | |
| if (__c >= _CharT2('0') && __c < _CharT2(_CharT2('0') + __len)) | |
| __ret = __c - _CharT2('0'); | |
| } | |
| else | |
| { | |
| if (__c >= _CharT2('0') && __c <= _CharT2('9')) | |
| __ret = __c - _CharT2('0'); | |
| else if (__c >= _CharT2('a') && __c <= _CharT2('f')) | |
| __ret = 10 + (__c - _CharT2('a')); | |
| else if (__c >= _CharT2('A') && __c <= _CharT2('F')) | |
| __ret = 10 + (__c - _CharT2('A')); | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT2> | |
| typename __gnu_cxx::__enable_if<!__is_char<_CharT2>::__value, | |
| int>::__type | |
| _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const | |
| { | |
| int __ret = -1; | |
| const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); | |
| if (__q) | |
| { | |
| __ret = __q - __zero; | |
| if (__ret > 15) | |
| __ret -= 6; | |
| } | |
| return __ret; | |
| } | |
| # 2211 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual iter_type | |
| do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const; | |
| virtual iter_type | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, long& __v) const | |
| { return _M_extract_int(__beg, __end, __io, __err, __v); } | |
| virtual iter_type | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned short& __v) const | |
| { return _M_extract_int(__beg, __end, __io, __err, __v); } | |
| virtual iter_type | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned int& __v) const | |
| { return _M_extract_int(__beg, __end, __io, __err, __v); } | |
| virtual iter_type | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned long& __v) const | |
| { return _M_extract_int(__beg, __end, __io, __err, __v); } | |
| virtual iter_type | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, long long& __v) const | |
| { return _M_extract_int(__beg, __end, __io, __err, __v); } | |
| virtual iter_type | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, unsigned long long& __v) const | |
| { return _M_extract_int(__beg, __end, __io, __err, __v); } | |
| virtual iter_type | |
| do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, float&) const; | |
| virtual iter_type | |
| do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, | |
| double&) const; | |
| virtual iter_type | |
| do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, | |
| long double&) const; | |
| virtual iter_type | |
| do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, void*&) const; | |
| # 2274 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| }; | |
| template<typename _CharT, typename _InIter> | |
| locale::id num_get<_CharT, _InIter>::id; | |
| # 2292 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| template<typename _CharT, typename _OutIter> | |
| class num_put : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _OutIter iter_type; | |
| static locale::id id; | |
| # 2313 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| explicit | |
| num_put(size_t __refs = 0) : facet(__refs) { } | |
| # 2331 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| # 2373 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, long __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, | |
| unsigned long __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, | |
| unsigned long long __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| # 2436 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, double __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, | |
| long double __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| # 2461 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, | |
| const void* __v) const | |
| { return this->do_put(__s, __io, __fill, __v); } | |
| protected: | |
| template<typename _ValueT> | |
| iter_type | |
| _M_insert_float(iter_type, ios_base& __io, char_type __fill, | |
| char __mod, _ValueT __v) const; | |
| void | |
| _M_group_float(const char* __grouping, size_t __grouping_size, | |
| char_type __sep, const char_type* __p, char_type* __new, | |
| char_type* __cs, int& __len) const; | |
| template<typename _ValueT> | |
| iter_type | |
| _M_insert_int(iter_type, ios_base& __io, char_type __fill, | |
| _ValueT __v) const; | |
| void | |
| _M_group_int(const char* __grouping, size_t __grouping_size, | |
| char_type __sep, ios_base& __io, char_type* __new, | |
| char_type* __cs, int& __len) const; | |
| void | |
| _M_pad(char_type __fill, streamsize __w, ios_base& __io, | |
| char_type* __new, const char_type* __cs, int& __len) const; | |
| virtual | |
| ~num_put() { } | |
| # 2509 "/usr/sgug/include/c++/9/bits/locale_facets.h" 3 | |
| virtual iter_type | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const; | |
| virtual iter_type | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const | |
| { return _M_insert_int(__s, __io, __fill, __v); } | |
| virtual iter_type | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, | |
| unsigned long __v) const | |
| { return _M_insert_int(__s, __io, __fill, __v); } | |
| virtual iter_type | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, | |
| long long __v) const | |
| { return _M_insert_int(__s, __io, __fill, __v); } | |
| virtual iter_type | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, | |
| unsigned long long __v) const | |
| { return _M_insert_int(__s, __io, __fill, __v); } | |
| virtual iter_type | |
| do_put(iter_type, ios_base&, char_type, double) const; | |
| virtual iter_type | |
| do_put(iter_type, ios_base&, char_type, long double) const; | |
| virtual iter_type | |
| do_put(iter_type, ios_base&, char_type, const void*) const; | |
| }; | |
| template <typename _CharT, typename _OutIter> | |
| locale::id num_put<_CharT, _OutIter>::id; | |
| 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 bool | |
| isblank(_CharT __c, const locale& __loc) | |
| { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::blank, __c); } | |
| template<typename _CharT> | |
| inline _CharT | |
| toupper(_CharT __c, const locale& __loc) | |
| { return use_facet<ctype<_CharT> >(__loc).toupper(__c); } | |
| template<typename _CharT> | |
| inline _CharT | |
| tolower(_CharT __c, const locale& __loc) | |
| { return use_facet<ctype<_CharT> >(__loc).tolower(__c); } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Facet> | |
| struct __use_cache | |
| { | |
| const _Facet* | |
| operator() (const locale& __loc) const; | |
| }; | |
| template<typename _CharT> | |
| struct __use_cache<__numpunct_cache<_CharT> > | |
| { | |
| const __numpunct_cache<_CharT>* | |
| operator() (const locale& __loc) const | |
| { | |
| const size_t __i = numpunct<_CharT>::id._M_id(); | |
| const locale::facet** __caches = __loc._M_impl->_M_caches; | |
| if (!__caches[__i]) | |
| { | |
| __numpunct_cache<_CharT>* __tmp = 0; | |
| if (true) | |
| { | |
| __tmp = new __numpunct_cache<_CharT>; | |
| __tmp->_M_cache(__loc); | |
| } | |
| if (false) | |
| { | |
| delete __tmp; | |
| ; | |
| } | |
| __loc._M_impl->_M_install_cache(__tmp, __i); | |
| } | |
| return static_cast<const __numpunct_cache<_CharT>*>(__caches[__i]); | |
| } | |
| }; | |
| template<typename _CharT> | |
| void | |
| __numpunct_cache<_CharT>::_M_cache(const locale& __loc) | |
| { | |
| const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc); | |
| char* __grouping = 0; | |
| _CharT* __truename = 0; | |
| _CharT* __falsename = 0; | |
| if (true) | |
| { | |
| const string& __g = __np.grouping(); | |
| _M_grouping_size = __g.size(); | |
| __grouping = new char[_M_grouping_size]; | |
| __g.copy(__grouping, _M_grouping_size); | |
| _M_use_grouping = (_M_grouping_size | |
| && static_cast<signed char>(__grouping[0]) > 0 | |
| && (__grouping[0] | |
| != __gnu_cxx::__numeric_traits<char>::__max)); | |
| const basic_string<_CharT>& __tn = __np.truename(); | |
| _M_truename_size = __tn.size(); | |
| __truename = new _CharT[_M_truename_size]; | |
| __tn.copy(__truename, _M_truename_size); | |
| const basic_string<_CharT>& __fn = __np.falsename(); | |
| _M_falsename_size = __fn.size(); | |
| __falsename = new _CharT[_M_falsename_size]; | |
| __fn.copy(__falsename, _M_falsename_size); | |
| _M_decimal_point = __np.decimal_point(); | |
| _M_thousands_sep = __np.thousands_sep(); | |
| const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc); | |
| __ct.widen(__num_base::_S_atoms_out, | |
| __num_base::_S_atoms_out | |
| + __num_base::_S_oend, _M_atoms_out); | |
| __ct.widen(__num_base::_S_atoms_in, | |
| __num_base::_S_atoms_in | |
| + __num_base::_S_iend, _M_atoms_in); | |
| _M_grouping = __grouping; | |
| _M_truename = __truename; | |
| _M_falsename = __falsename; | |
| _M_allocated = true; | |
| } | |
| if (false) | |
| { | |
| delete [] __grouping; | |
| delete [] __truename; | |
| delete [] __falsename; | |
| ; | |
| } | |
| } | |
| # 139 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| __attribute__ ((__pure__)) bool | |
| __verify_grouping(const char* __grouping, size_t __grouping_size, | |
| const string& __grouping_tmp) throw (); | |
| template<typename _CharT, typename _InIter> | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io, | |
| ios_base::iostate& __err, string& __xtrc) const | |
| { | |
| typedef char_traits<_CharT> __traits_type; | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| __use_cache<__cache_type> __uc; | |
| const locale& __loc = __io._M_getloc(); | |
| const __cache_type* __lc = __uc(__loc); | |
| const _CharT* __lit = __lc->_M_atoms_in; | |
| char_type __c = char_type(); | |
| bool __testeof = __beg == __end; | |
| if (!__testeof) | |
| { | |
| __c = *__beg; | |
| const bool __plus = __c == __lit[__num_base::_S_iplus]; | |
| if ((__plus || __c == __lit[__num_base::_S_iminus]) | |
| && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) | |
| && !(__c == __lc->_M_decimal_point)) | |
| { | |
| __xtrc += __plus ? '+' : '-'; | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| } | |
| bool __found_mantissa = false; | |
| int __sep_pos = 0; | |
| while (!__testeof) | |
| { | |
| if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) | |
| || __c == __lc->_M_decimal_point) | |
| break; | |
| else if (__c == __lit[__num_base::_S_izero]) | |
| { | |
| if (!__found_mantissa) | |
| { | |
| __xtrc += '0'; | |
| __found_mantissa = true; | |
| } | |
| ++__sep_pos; | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| else | |
| break; | |
| } | |
| bool __found_dec = false; | |
| bool __found_sci = false; | |
| string __found_grouping; | |
| if (__lc->_M_use_grouping) | |
| __found_grouping.reserve(32); | |
| const char_type* __lit_zero = __lit + __num_base::_S_izero; | |
| if (!__lc->_M_allocated) | |
| while (!__testeof) | |
| { | |
| const int __digit = _M_find(__lit_zero, 10, __c); | |
| if (__digit != -1) | |
| { | |
| __xtrc += '0' + __digit; | |
| __found_mantissa = true; | |
| } | |
| else if (__c == __lc->_M_decimal_point | |
| && !__found_dec && !__found_sci) | |
| { | |
| __xtrc += '.'; | |
| __found_dec = true; | |
| } | |
| else if ((__c == __lit[__num_base::_S_ie] | |
| || __c == __lit[__num_base::_S_iE]) | |
| && !__found_sci && __found_mantissa) | |
| { | |
| __xtrc += 'e'; | |
| __found_sci = true; | |
| if (++__beg != __end) | |
| { | |
| __c = *__beg; | |
| const bool __plus = __c == __lit[__num_base::_S_iplus]; | |
| if (__plus || __c == __lit[__num_base::_S_iminus]) | |
| __xtrc += __plus ? '+' : '-'; | |
| else | |
| continue; | |
| } | |
| else | |
| { | |
| __testeof = true; | |
| break; | |
| } | |
| } | |
| else | |
| break; | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| else | |
| while (!__testeof) | |
| { | |
| if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) | |
| { | |
| if (!__found_dec && !__found_sci) | |
| { | |
| if (__sep_pos) | |
| { | |
| __found_grouping += static_cast<char>(__sep_pos); | |
| __sep_pos = 0; | |
| } | |
| else | |
| { | |
| __xtrc.clear(); | |
| break; | |
| } | |
| } | |
| else | |
| break; | |
| } | |
| else if (__c == __lc->_M_decimal_point) | |
| { | |
| if (!__found_dec && !__found_sci) | |
| { | |
| if (__found_grouping.size()) | |
| __found_grouping += static_cast<char>(__sep_pos); | |
| __xtrc += '.'; | |
| __found_dec = true; | |
| } | |
| else | |
| break; | |
| } | |
| else | |
| { | |
| const char_type* __q = | |
| __traits_type::find(__lit_zero, 10, __c); | |
| if (__q) | |
| { | |
| __xtrc += '0' + (__q - __lit_zero); | |
| __found_mantissa = true; | |
| ++__sep_pos; | |
| } | |
| else if ((__c == __lit[__num_base::_S_ie] | |
| || __c == __lit[__num_base::_S_iE]) | |
| && !__found_sci && __found_mantissa) | |
| { | |
| if (__found_grouping.size() && !__found_dec) | |
| __found_grouping += static_cast<char>(__sep_pos); | |
| __xtrc += 'e'; | |
| __found_sci = true; | |
| if (++__beg != __end) | |
| { | |
| __c = *__beg; | |
| const bool __plus = __c == __lit[__num_base::_S_iplus]; | |
| if ((__plus || __c == __lit[__num_base::_S_iminus]) | |
| && !(__lc->_M_use_grouping | |
| && __c == __lc->_M_thousands_sep) | |
| && !(__c == __lc->_M_decimal_point)) | |
| __xtrc += __plus ? '+' : '-'; | |
| else | |
| continue; | |
| } | |
| else | |
| { | |
| __testeof = true; | |
| break; | |
| } | |
| } | |
| else | |
| break; | |
| } | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| if (__found_grouping.size()) | |
| { | |
| if (!__found_dec && !__found_sci) | |
| __found_grouping += static_cast<char>(__sep_pos); | |
| if (!std::__verify_grouping(__lc->_M_grouping, | |
| __lc->_M_grouping_size, | |
| __found_grouping)) | |
| __err = ios_base::failbit; | |
| } | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| template<typename _ValueT> | |
| __attribute ((__abi_tag__ ("cxx11"))) | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io, | |
| ios_base::iostate& __err, _ValueT& __v) const | |
| { | |
| typedef char_traits<_CharT> __traits_type; | |
| using __gnu_cxx::__add_unsigned; | |
| typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| __use_cache<__cache_type> __uc; | |
| const locale& __loc = __io._M_getloc(); | |
| const __cache_type* __lc = __uc(__loc); | |
| const _CharT* __lit = __lc->_M_atoms_in; | |
| char_type __c = char_type(); | |
| const ios_base::fmtflags __basefield = __io.flags() | |
| & ios_base::basefield; | |
| const bool __oct = __basefield == ios_base::oct; | |
| int __base = __oct ? 8 : (__basefield == ios_base::hex ? 16 : 10); | |
| bool __testeof = __beg == __end; | |
| bool __negative = false; | |
| if (!__testeof) | |
| { | |
| __c = *__beg; | |
| __negative = __c == __lit[__num_base::_S_iminus]; | |
| if ((__negative || __c == __lit[__num_base::_S_iplus]) | |
| && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) | |
| && !(__c == __lc->_M_decimal_point)) | |
| { | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| } | |
| bool __found_zero = false; | |
| int __sep_pos = 0; | |
| while (!__testeof) | |
| { | |
| if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) | |
| || __c == __lc->_M_decimal_point) | |
| break; | |
| else if (__c == __lit[__num_base::_S_izero] | |
| && (!__found_zero || __base == 10)) | |
| { | |
| __found_zero = true; | |
| ++__sep_pos; | |
| if (__basefield == 0) | |
| __base = 8; | |
| if (__base == 8) | |
| __sep_pos = 0; | |
| } | |
| else if (__found_zero | |
| && (__c == __lit[__num_base::_S_ix] | |
| || __c == __lit[__num_base::_S_iX])) | |
| { | |
| if (__basefield == 0) | |
| __base = 16; | |
| if (__base == 16) | |
| { | |
| __found_zero = false; | |
| __sep_pos = 0; | |
| } | |
| else | |
| break; | |
| } | |
| else | |
| break; | |
| if (++__beg != __end) | |
| { | |
| __c = *__beg; | |
| if (!__found_zero) | |
| break; | |
| } | |
| else | |
| __testeof = true; | |
| } | |
| const size_t __len = (__base == 16 ? __num_base::_S_iend | |
| - __num_base::_S_izero : __base); | |
| typedef __gnu_cxx::__numeric_traits<_ValueT> __num_traits; | |
| string __found_grouping; | |
| if (__lc->_M_use_grouping) | |
| __found_grouping.reserve(32); | |
| bool __testfail = false; | |
| bool __testoverflow = false; | |
| const __unsigned_type __max = | |
| (__negative && __num_traits::__is_signed) | |
| ? -static_cast<__unsigned_type>(__num_traits::__min) | |
| : __num_traits::__max; | |
| const __unsigned_type __smax = __max / __base; | |
| __unsigned_type __result = 0; | |
| int __digit = 0; | |
| const char_type* __lit_zero = __lit + __num_base::_S_izero; | |
| if (!__lc->_M_allocated) | |
| while (!__testeof) | |
| { | |
| __digit = _M_find(__lit_zero, __len, __c); | |
| if (__digit == -1) | |
| break; | |
| if (__result > __smax) | |
| __testoverflow = true; | |
| else | |
| { | |
| __result *= __base; | |
| __testoverflow |= __result > __max - __digit; | |
| __result += __digit; | |
| ++__sep_pos; | |
| } | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| else | |
| while (!__testeof) | |
| { | |
| if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) | |
| { | |
| if (__sep_pos) | |
| { | |
| __found_grouping += static_cast<char>(__sep_pos); | |
| __sep_pos = 0; | |
| } | |
| else | |
| { | |
| __testfail = true; | |
| break; | |
| } | |
| } | |
| else if (__c == __lc->_M_decimal_point) | |
| break; | |
| else | |
| { | |
| const char_type* __q = | |
| __traits_type::find(__lit_zero, __len, __c); | |
| if (!__q) | |
| break; | |
| __digit = __q - __lit_zero; | |
| if (__digit > 15) | |
| __digit -= 6; | |
| if (__result > __smax) | |
| __testoverflow = true; | |
| else | |
| { | |
| __result *= __base; | |
| __testoverflow |= __result > __max - __digit; | |
| __result += __digit; | |
| ++__sep_pos; | |
| } | |
| } | |
| if (++__beg != __end) | |
| __c = *__beg; | |
| else | |
| __testeof = true; | |
| } | |
| if (__found_grouping.size()) | |
| { | |
| __found_grouping += static_cast<char>(__sep_pos); | |
| if (!std::__verify_grouping(__lc->_M_grouping, | |
| __lc->_M_grouping_size, | |
| __found_grouping)) | |
| __err = ios_base::failbit; | |
| } | |
| if ((!__sep_pos && !__found_zero && !__found_grouping.size()) | |
| || __testfail) | |
| { | |
| __v = 0; | |
| __err = ios_base::failbit; | |
| } | |
| else if (__testoverflow) | |
| { | |
| if (__negative && __num_traits::__is_signed) | |
| __v = __num_traits::__min; | |
| else | |
| __v = __num_traits::__max; | |
| __err = ios_base::failbit; | |
| } | |
| else | |
| __v = __negative ? -__result : __result; | |
| if (__testeof) | |
| __err |= ios_base::eofbit; | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, bool& __v) const | |
| { | |
| if (!(__io.flags() & ios_base::boolalpha)) | |
| { | |
| long __l = -1; | |
| __beg = _M_extract_int(__beg, __end, __io, __err, __l); | |
| if (__l == 0 || __l == 1) | |
| __v = bool(__l); | |
| else | |
| { | |
| __v = true; | |
| __err = ios_base::failbit; | |
| if (__beg == __end) | |
| __err |= ios_base::eofbit; | |
| } | |
| } | |
| else | |
| { | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| __use_cache<__cache_type> __uc; | |
| const locale& __loc = __io._M_getloc(); | |
| const __cache_type* __lc = __uc(__loc); | |
| bool __testf = true; | |
| bool __testt = true; | |
| bool __donef = __lc->_M_falsename_size == 0; | |
| bool __donet = __lc->_M_truename_size == 0; | |
| bool __testeof = false; | |
| size_t __n = 0; | |
| while (!__donef || !__donet) | |
| { | |
| if (__beg == __end) | |
| { | |
| __testeof = true; | |
| break; | |
| } | |
| const char_type __c = *__beg; | |
| if (!__donef) | |
| __testf = __c == __lc->_M_falsename[__n]; | |
| if (!__testf && __donet) | |
| break; | |
| if (!__donet) | |
| __testt = __c == __lc->_M_truename[__n]; | |
| if (!__testt && __donef) | |
| break; | |
| if (!__testt && !__testf) | |
| break; | |
| ++__n; | |
| ++__beg; | |
| __donef = !__testf || __n >= __lc->_M_falsename_size; | |
| __donet = !__testt || __n >= __lc->_M_truename_size; | |
| } | |
| if (__testf && __n == __lc->_M_falsename_size && __n) | |
| { | |
| __v = false; | |
| if (__testt && __n == __lc->_M_truename_size) | |
| __err = ios_base::failbit; | |
| else | |
| __err = __testeof ? ios_base::eofbit : ios_base::goodbit; | |
| } | |
| else if (__testt && __n == __lc->_M_truename_size && __n) | |
| { | |
| __v = true; | |
| __err = __testeof ? ios_base::eofbit : ios_base::goodbit; | |
| } | |
| else | |
| { | |
| __v = false; | |
| __err = ios_base::failbit; | |
| if (__testeof) | |
| __err |= ios_base::eofbit; | |
| } | |
| } | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, float& __v) const | |
| { | |
| string __xtrc; | |
| __xtrc.reserve(32); | |
| __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); | |
| std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); | |
| if (__beg == __end) | |
| __err |= ios_base::eofbit; | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, double& __v) const | |
| { | |
| string __xtrc; | |
| __xtrc.reserve(32); | |
| __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); | |
| std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); | |
| if (__beg == __end) | |
| __err |= ios_base::eofbit; | |
| return __beg; | |
| } | |
| # 735 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, long double& __v) const | |
| { | |
| string __xtrc; | |
| __xtrc.reserve(32); | |
| __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); | |
| std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); | |
| if (__beg == __end) | |
| __err |= ios_base::eofbit; | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| num_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, void*& __v) const | |
| { | |
| typedef ios_base::fmtflags fmtflags; | |
| const fmtflags __fmt = __io.flags(); | |
| __io.flags((__fmt & ~ios_base::basefield) | ios_base::hex); | |
| typedef __gnu_cxx::__conditional_type<(sizeof(void*) | |
| <= sizeof(unsigned long)), | |
| unsigned long, unsigned long long>::__type _UIntPtrType; | |
| _UIntPtrType __ul; | |
| __beg = _M_extract_int(__beg, __end, __io, __err, __ul); | |
| __io.flags(__fmt); | |
| __v = reinterpret_cast<void*>(__ul); | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| void | |
| num_put<_CharT, _OutIter>:: | |
| _M_pad(_CharT __fill, streamsize __w, ios_base& __io, | |
| _CharT* __new, const _CharT* __cs, int& __len) const | |
| { | |
| __pad<_CharT, char_traits<_CharT> >::_S_pad(__io, __fill, __new, | |
| __cs, __w, __len); | |
| __len = static_cast<int>(__w); | |
| } | |
| template<typename _CharT, typename _ValueT> | |
| int | |
| __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit, | |
| ios_base::fmtflags __flags, bool __dec) | |
| { | |
| _CharT* __buf = __bufend; | |
| if (__builtin_expect(__dec, true)) | |
| { | |
| do | |
| { | |
| *--__buf = __lit[(__v % 10) + __num_base::_S_odigits]; | |
| __v /= 10; | |
| } | |
| while (__v != 0); | |
| } | |
| else if ((__flags & ios_base::basefield) == ios_base::oct) | |
| { | |
| do | |
| { | |
| *--__buf = __lit[(__v & 0x7) + __num_base::_S_odigits]; | |
| __v >>= 3; | |
| } | |
| while (__v != 0); | |
| } | |
| else | |
| { | |
| const bool __uppercase = __flags & ios_base::uppercase; | |
| const int __case_offset = __uppercase ? __num_base::_S_oudigits | |
| : __num_base::_S_odigits; | |
| do | |
| { | |
| *--__buf = __lit[(__v & 0xf) + __case_offset]; | |
| __v >>= 4; | |
| } | |
| while (__v != 0); | |
| } | |
| return __bufend - __buf; | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| void | |
| num_put<_CharT, _OutIter>:: | |
| _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep, | |
| ios_base&, _CharT* __new, _CharT* __cs, int& __len) const | |
| { | |
| _CharT* __p = std::__add_grouping(__new, __sep, __grouping, | |
| __grouping_size, __cs, __cs + __len); | |
| __len = __p - __new; | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| template<typename _ValueT> | |
| _OutIter | |
| num_put<_CharT, _OutIter>:: | |
| _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill, | |
| _ValueT __v) const | |
| { | |
| using __gnu_cxx::__add_unsigned; | |
| typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| __use_cache<__cache_type> __uc; | |
| const locale& __loc = __io._M_getloc(); | |
| const __cache_type* __lc = __uc(__loc); | |
| const _CharT* __lit = __lc->_M_atoms_out; | |
| const ios_base::fmtflags __flags = __io.flags(); | |
| const int __ilen = 5 * sizeof(_ValueT); | |
| _CharT* __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __ilen)); | |
| const ios_base::fmtflags __basefield = __flags & ios_base::basefield; | |
| const bool __dec = (__basefield != ios_base::oct | |
| && __basefield != ios_base::hex); | |
| const __unsigned_type __u = ((__v > 0 || !__dec) | |
| ? __unsigned_type(__v) | |
| : -__unsigned_type(__v)); | |
| int __len = __int_to_char(__cs + __ilen, __u, __lit, __flags, __dec); | |
| __cs += __ilen - __len; | |
| if (__lc->_M_use_grouping) | |
| { | |
| _CharT* __cs2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * (__len + 1) | |
| * 2)); | |
| _M_group_int(__lc->_M_grouping, __lc->_M_grouping_size, | |
| __lc->_M_thousands_sep, __io, __cs2 + 2, __cs, __len); | |
| __cs = __cs2 + 2; | |
| } | |
| if (__builtin_expect(__dec, true)) | |
| { | |
| if (__v >= 0) | |
| { | |
| if (bool(__flags & ios_base::showpos) | |
| && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) | |
| *--__cs = __lit[__num_base::_S_oplus], ++__len; | |
| } | |
| else | |
| *--__cs = __lit[__num_base::_S_ominus], ++__len; | |
| } | |
| else if (bool(__flags & ios_base::showbase) && __v) | |
| { | |
| if (__basefield == ios_base::oct) | |
| *--__cs = __lit[__num_base::_S_odigits], ++__len; | |
| else | |
| { | |
| const bool __uppercase = __flags & ios_base::uppercase; | |
| *--__cs = __lit[__num_base::_S_ox + __uppercase]; | |
| *--__cs = __lit[__num_base::_S_odigits]; | |
| __len += 2; | |
| } | |
| } | |
| const streamsize __w = __io.width(); | |
| if (__w > static_cast<streamsize>(__len)) | |
| { | |
| _CharT* __cs3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __w)); | |
| _M_pad(__fill, __w, __io, __cs3, __cs, __len); | |
| __cs = __cs3; | |
| } | |
| __io.width(0); | |
| return std::__write(__s, __cs, __len); | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| void | |
| num_put<_CharT, _OutIter>:: | |
| _M_group_float(const char* __grouping, size_t __grouping_size, | |
| _CharT __sep, const _CharT* __p, _CharT* __new, | |
| _CharT* __cs, int& __len) const | |
| { | |
| const int __declen = __p ? __p - __cs : __len; | |
| _CharT* __p2 = std::__add_grouping(__new, __sep, __grouping, | |
| __grouping_size, | |
| __cs, __cs + __declen); | |
| int __newlen = __p2 - __new; | |
| if (__p) | |
| { | |
| char_traits<_CharT>::copy(__p2, __p, __len - __declen); | |
| __newlen += __len - __declen; | |
| } | |
| __len = __newlen; | |
| } | |
| # 971 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| template<typename _CharT, typename _OutIter> | |
| template<typename _ValueT> | |
| _OutIter | |
| num_put<_CharT, _OutIter>:: | |
| _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, | |
| _ValueT __v) const | |
| { | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| __use_cache<__cache_type> __uc; | |
| const locale& __loc = __io._M_getloc(); | |
| const __cache_type* __lc = __uc(__loc); | |
| const streamsize __prec = __io.precision() < 0 ? 6 : __io.precision(); | |
| const int __max_digits = | |
| __gnu_cxx::__numeric_traits<_ValueT>::__digits10; | |
| int __len; | |
| char __fbuf[16]; | |
| __num_base::_S_format_float(__io, __fbuf, __mod); | |
| const bool __use_prec = | |
| (__io.flags() & ios_base::floatfield) != ios_base::floatfield; | |
| int __cs_size = __max_digits * 3; | |
| char* __cs = static_cast<char*>(__builtin_alloca(__cs_size)); | |
| if (__use_prec) | |
| __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, | |
| __fbuf, __prec, __v); | |
| else | |
| __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, | |
| __fbuf, __v); | |
| if (__len >= __cs_size) | |
| { | |
| __cs_size = __len + 1; | |
| __cs = static_cast<char*>(__builtin_alloca(__cs_size)); | |
| if (__use_prec) | |
| __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, | |
| __fbuf, __prec, __v); | |
| else | |
| __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, | |
| __fbuf, __v); | |
| } | |
| # 1044 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __len)); | |
| __ctype.widen(__cs, __cs + __len, __ws); | |
| _CharT* __wp = 0; | |
| const char* __p = char_traits<char>::find(__cs, __len, '.'); | |
| if (__p) | |
| { | |
| __wp = __ws + (__p - __cs); | |
| *__wp = __lc->_M_decimal_point; | |
| } | |
| if (__lc->_M_use_grouping | |
| && (__wp || __len < 3 || (__cs[1] <= '9' && __cs[2] <= '9' | |
| && __cs[1] >= '0' && __cs[2] >= '0'))) | |
| { | |
| _CharT* __ws2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __len * 2)); | |
| streamsize __off = 0; | |
| if (__cs[0] == '-' || __cs[0] == '+') | |
| { | |
| __off = 1; | |
| __ws2[0] = __ws[0]; | |
| __len -= 1; | |
| } | |
| _M_group_float(__lc->_M_grouping, __lc->_M_grouping_size, | |
| __lc->_M_thousands_sep, __wp, __ws2 + __off, | |
| __ws + __off, __len); | |
| __len += __off; | |
| __ws = __ws2; | |
| } | |
| const streamsize __w = __io.width(); | |
| if (__w > static_cast<streamsize>(__len)) | |
| { | |
| _CharT* __ws3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __w)); | |
| _M_pad(__fill, __w, __io, __ws3, __ws, __len); | |
| __ws = __ws3; | |
| } | |
| __io.width(0); | |
| return std::__write(__s, __ws, __len); | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| _OutIter | |
| num_put<_CharT, _OutIter>:: | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const | |
| { | |
| const ios_base::fmtflags __flags = __io.flags(); | |
| if ((__flags & ios_base::boolalpha) == 0) | |
| { | |
| const long __l = __v; | |
| __s = _M_insert_int(__s, __io, __fill, __l); | |
| } | |
| else | |
| { | |
| typedef __numpunct_cache<_CharT> __cache_type; | |
| __use_cache<__cache_type> __uc; | |
| const locale& __loc = __io._M_getloc(); | |
| const __cache_type* __lc = __uc(__loc); | |
| const _CharT* __name = __v ? __lc->_M_truename | |
| : __lc->_M_falsename; | |
| int __len = __v ? __lc->_M_truename_size | |
| : __lc->_M_falsename_size; | |
| const streamsize __w = __io.width(); | |
| if (__w > static_cast<streamsize>(__len)) | |
| { | |
| const streamsize __plen = __w - __len; | |
| _CharT* __ps | |
| = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) | |
| * __plen)); | |
| char_traits<_CharT>::assign(__ps, __plen, __fill); | |
| __io.width(0); | |
| if ((__flags & ios_base::adjustfield) == ios_base::left) | |
| { | |
| __s = std::__write(__s, __name, __len); | |
| __s = std::__write(__s, __ps, __plen); | |
| } | |
| else | |
| { | |
| __s = std::__write(__s, __ps, __plen); | |
| __s = std::__write(__s, __name, __len); | |
| } | |
| return __s; | |
| } | |
| __io.width(0); | |
| __s = std::__write(__s, __name, __len); | |
| } | |
| return __s; | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| _OutIter | |
| num_put<_CharT, _OutIter>:: | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const | |
| { return _M_insert_float(__s, __io, __fill, char(), __v); } | |
| # 1169 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| template<typename _CharT, typename _OutIter> | |
| _OutIter | |
| num_put<_CharT, _OutIter>:: | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, | |
| long double __v) const | |
| { return _M_insert_float(__s, __io, __fill, 'L', __v); } | |
| template<typename _CharT, typename _OutIter> | |
| _OutIter | |
| num_put<_CharT, _OutIter>:: | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, | |
| const void* __v) const | |
| { | |
| const ios_base::fmtflags __flags = __io.flags(); | |
| const ios_base::fmtflags __fmt = ~(ios_base::basefield | |
| | ios_base::uppercase); | |
| __io.flags((__flags & __fmt) | (ios_base::hex | ios_base::showbase)); | |
| typedef __gnu_cxx::__conditional_type<(sizeof(const void*) | |
| <= sizeof(unsigned long)), | |
| unsigned long, unsigned long long>::__type _UIntPtrType; | |
| __s = _M_insert_int(__s, __io, __fill, | |
| reinterpret_cast<_UIntPtrType>(__v)); | |
| __io.flags(__flags); | |
| return __s; | |
| } | |
| # 1206 "/usr/sgug/include/c++/9/bits/locale_facets.tcc" 3 | |
| template<typename _CharT, typename _Traits> | |
| void | |
| __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill, | |
| _CharT* __news, const _CharT* __olds, | |
| streamsize __newlen, streamsize __oldlen) | |
| { | |
| const size_t __plen = static_cast<size_t>(__newlen - __oldlen); | |
| const ios_base::fmtflags __adjust = __io.flags() & ios_base::adjustfield; | |
| if (__adjust == ios_base::left) | |
| { | |
| _Traits::copy(__news, __olds, __oldlen); | |
| _Traits::assign(__news + __oldlen, __plen, __fill); | |
| return; | |
| } | |
| size_t __mod = 0; | |
| if (__adjust == ios_base::internal) | |
| { | |
| const locale& __loc = __io._M_getloc(); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| if (__ctype.widen('-') == __olds[0] | |
| || __ctype.widen('+') == __olds[0]) | |
| { | |
| __news[0] = __olds[0]; | |
| __mod = 1; | |
| ++__news; | |
| } | |
| else if (__ctype.widen('0') == __olds[0] | |
| && __oldlen > 1 | |
| && (__ctype.widen('x') == __olds[1] | |
| || __ctype.widen('X') == __olds[1])) | |
| { | |
| __news[0] = __olds[0]; | |
| __news[1] = __olds[1]; | |
| __mod = 2; | |
| __news += 2; | |
| } | |
| } | |
| _Traits::assign(__news, __plen, __fill); | |
| _Traits::copy(__news + __plen, __olds + __mod, __oldlen - __mod); | |
| } | |
| template<typename _CharT> | |
| _CharT* | |
| __add_grouping(_CharT* __s, _CharT __sep, | |
| const char* __gbeg, size_t __gsize, | |
| const _CharT* __first, const _CharT* __last) | |
| { | |
| size_t __idx = 0; | |
| size_t __ctr = 0; | |
| while (__last - __first > __gbeg[__idx] | |
| && static_cast<signed char>(__gbeg[__idx]) > 0 | |
| && __gbeg[__idx] != __gnu_cxx::__numeric_traits<char>::__max) | |
| { | |
| __last -= __gbeg[__idx]; | |
| __idx < __gsize - 1 ? ++__idx : ++__ctr; | |
| } | |
| while (__first != __last) | |
| *__s++ = *__first++; | |
| while (__ctr--) | |
| { | |
| *__s++ = __sep; | |
| for (char __i = __gbeg[__idx]; __i > 0; --__i) | |
| *__s++ = *__first++; | |
| } | |
| while (__idx--) | |
| { | |
| *__s++ = __sep; | |
| for (char __i = __gbeg[__idx]; __i > 0; --__i) | |
| *__s++ = *__first++; | |
| } | |
| return __s; | |
| } | |
| extern template class __cxx11:: numpunct<char>; | |
| extern template class __cxx11:: numpunct_byname<char>; | |
| extern template class num_get<char>; | |
| extern template class num_put<char>; | |
| extern template class ctype_byname<char>; | |
| extern template | |
| const ctype<char>& | |
| use_facet<ctype<char> >(const locale&); | |
| extern template | |
| const numpunct<char>& | |
| use_facet<numpunct<char> >(const locale&); | |
| extern template | |
| const num_put<char>& | |
| use_facet<num_put<char> >(const locale&); | |
| extern template | |
| const num_get<char>& | |
| use_facet<num_get<char> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<ctype<char> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<numpunct<char> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<num_put<char> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<num_get<char> >(const locale&); | |
| extern template class __cxx11:: numpunct<wchar_t>; | |
| extern template class __cxx11:: numpunct_byname<wchar_t>; | |
| extern template class num_get<wchar_t>; | |
| extern template class num_put<wchar_t>; | |
| extern template class ctype_byname<wchar_t>; | |
| extern template | |
| const ctype<wchar_t>& | |
| use_facet<ctype<wchar_t> >(const locale&); | |
| extern template | |
| const numpunct<wchar_t>& | |
| use_facet<numpunct<wchar_t> >(const locale&); | |
| extern template | |
| const num_put<wchar_t>& | |
| use_facet<num_put<wchar_t> >(const locale&); | |
| extern template | |
| const num_get<wchar_t>& | |
| use_facet<num_get<wchar_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<ctype<wchar_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<numpunct<wchar_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<num_put<wchar_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<num_get<wchar_t> >(const locale&); | |
| } | |
| # 2656 "/usr/sgug/include/c++/9/bits/locale_facets.h" 2 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/basic_ios.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Facet> | |
| inline const _Facet& | |
| __check_facet(const _Facet* __f) | |
| { | |
| if (!__f) | |
| __throw_bad_cast(); | |
| return *__f; | |
| } | |
| # 66 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| template<typename _CharT, typename _Traits> | |
| class basic_ios : public ios_base | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef typename _Traits::int_type int_type; | |
| typedef typename _Traits::pos_type pos_type; | |
| typedef typename _Traits::off_type off_type; | |
| typedef _Traits traits_type; | |
| typedef ctype<_CharT> __ctype_type; | |
| typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > | |
| __num_put_type; | |
| typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > | |
| __num_get_type; | |
| protected: | |
| basic_ostream<_CharT, _Traits>* _M_tie; | |
| mutable char_type _M_fill; | |
| mutable bool _M_fill_init; | |
| basic_streambuf<_CharT, _Traits>* _M_streambuf; | |
| const __ctype_type* _M_ctype; | |
| const __num_put_type* _M_num_put; | |
| const __num_get_type* _M_num_get; | |
| public: | |
| # 117 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| explicit operator bool() const | |
| { return !this->fail(); } | |
| bool | |
| operator!() const | |
| { return this->fail(); } | |
| # 136 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| iostate | |
| rdstate() const | |
| { return _M_streambuf_state; } | |
| # 147 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| void | |
| clear(iostate __state = goodbit); | |
| void | |
| setstate(iostate __state) | |
| { this->clear(this->rdstate() | __state); } | |
| void | |
| _M_setstate(iostate __state) | |
| { | |
| _M_streambuf_state |= __state; | |
| if (this->exceptions() & __state) | |
| ; | |
| } | |
| bool | |
| good() const | |
| { return this->rdstate() == 0; } | |
| bool | |
| eof() const | |
| { return (this->rdstate() & eofbit) != 0; } | |
| # 200 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| bool | |
| fail() const | |
| { return (this->rdstate() & (badbit | failbit)) != 0; } | |
| bool | |
| bad() const | |
| { return (this->rdstate() & badbit) != 0; } | |
| # 221 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| iostate | |
| exceptions() const | |
| { return _M_exception; } | |
| # 256 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| void | |
| exceptions(iostate __except) | |
| { | |
| _M_exception = __except; | |
| this->clear(_M_streambuf_state); | |
| } | |
| explicit | |
| basic_ios(basic_streambuf<_CharT, _Traits>* __sb) | |
| : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0), | |
| _M_ctype(0), _M_num_put(0), _M_num_get(0) | |
| { this->init(__sb); } | |
| virtual | |
| ~basic_ios() { } | |
| # 294 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| basic_ostream<_CharT, _Traits>* | |
| tie() const | |
| { return _M_tie; } | |
| # 306 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| basic_ostream<_CharT, _Traits>* | |
| tie(basic_ostream<_CharT, _Traits>* __tiestr) | |
| { | |
| basic_ostream<_CharT, _Traits>* __old = _M_tie; | |
| _M_tie = __tiestr; | |
| return __old; | |
| } | |
| basic_streambuf<_CharT, _Traits>* | |
| rdbuf() const | |
| { return _M_streambuf; } | |
| # 346 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| basic_streambuf<_CharT, _Traits>* | |
| rdbuf(basic_streambuf<_CharT, _Traits>* __sb); | |
| # 360 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| basic_ios& | |
| copyfmt(const basic_ios& __rhs); | |
| char_type | |
| fill() const | |
| { | |
| if (!_M_fill_init) | |
| { | |
| _M_fill = this->widen(' '); | |
| _M_fill_init = true; | |
| } | |
| return _M_fill; | |
| } | |
| # 389 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| char_type | |
| fill(char_type __ch) | |
| { | |
| char_type __old = this->fill(); | |
| _M_fill = __ch; | |
| return __old; | |
| } | |
| # 409 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| locale | |
| imbue(const locale& __loc); | |
| # 429 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| char | |
| narrow(char_type __c, char __dfault) const | |
| { return __check_facet(_M_ctype).narrow(__c, __dfault); } | |
| # 448 "/usr/sgug/include/c++/9/bits/basic_ios.h" 3 | |
| char_type | |
| widen(char __c) const | |
| { return __check_facet(_M_ctype).widen(__c); } | |
| protected: | |
| basic_ios() | |
| : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), | |
| _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0) | |
| { } | |
| void | |
| init(basic_streambuf<_CharT, _Traits>* __sb); | |
| basic_ios(const basic_ios&) = delete; | |
| basic_ios& operator=(const basic_ios&) = delete; | |
| void | |
| move(basic_ios& __rhs) | |
| { | |
| ios_base::_M_move(__rhs); | |
| _M_cache_locale(_M_ios_locale); | |
| this->tie(__rhs.tie(nullptr)); | |
| _M_fill = __rhs._M_fill; | |
| _M_fill_init = __rhs._M_fill_init; | |
| _M_streambuf = nullptr; | |
| } | |
| void | |
| move(basic_ios&& __rhs) | |
| { this->move(__rhs); } | |
| void | |
| swap(basic_ios& __rhs) noexcept | |
| { | |
| ios_base::_M_swap(__rhs); | |
| _M_cache_locale(_M_ios_locale); | |
| __rhs._M_cache_locale(__rhs._M_ios_locale); | |
| std::swap(_M_tie, __rhs._M_tie); | |
| std::swap(_M_fill, __rhs._M_fill); | |
| std::swap(_M_fill_init, __rhs._M_fill_init); | |
| } | |
| void | |
| set_rdbuf(basic_streambuf<_CharT, _Traits>* __sb) | |
| { _M_streambuf = __sb; } | |
| void | |
| _M_cache_locale(const locale& __loc); | |
| }; | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/basic_ios.tcc" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/basic_ios.tcc" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/basic_ios.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits> | |
| void | |
| basic_ios<_CharT, _Traits>::clear(iostate __state) | |
| { | |
| if (this->rdbuf()) | |
| _M_streambuf_state = __state; | |
| else | |
| _M_streambuf_state = __state | badbit; | |
| if (this->exceptions() & this->rdstate()) | |
| __throw_ios_failure(("basic_ios::clear")); | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_streambuf<_CharT, _Traits>* | |
| basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb) | |
| { | |
| basic_streambuf<_CharT, _Traits>* __old = _M_streambuf; | |
| _M_streambuf = __sb; | |
| this->clear(); | |
| return __old; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ios<_CharT, _Traits>& | |
| basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs) | |
| { | |
| if (this != &__rhs) | |
| { | |
| _Words* __words = (__rhs._M_word_size <= _S_local_word_size) ? | |
| _M_local_word : new _Words[__rhs._M_word_size]; | |
| _Callback_list* __cb = __rhs._M_callbacks; | |
| if (__cb) | |
| __cb->_M_add_reference(); | |
| _M_call_callbacks(erase_event); | |
| if (_M_word != _M_local_word) | |
| { | |
| delete [] _M_word; | |
| _M_word = 0; | |
| } | |
| _M_dispose_callbacks(); | |
| _M_callbacks = __cb; | |
| for (int __i = 0; __i < __rhs._M_word_size; ++__i) | |
| __words[__i] = __rhs._M_word[__i]; | |
| _M_word = __words; | |
| _M_word_size = __rhs._M_word_size; | |
| this->flags(__rhs.flags()); | |
| this->width(__rhs.width()); | |
| this->precision(__rhs.precision()); | |
| this->tie(__rhs.tie()); | |
| this->fill(__rhs.fill()); | |
| _M_ios_locale = __rhs.getloc(); | |
| _M_cache_locale(_M_ios_locale); | |
| _M_call_callbacks(copyfmt_event); | |
| this->exceptions(__rhs.exceptions()); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| locale | |
| basic_ios<_CharT, _Traits>::imbue(const locale& __loc) | |
| { | |
| locale __old(this->getloc()); | |
| ios_base::imbue(__loc); | |
| _M_cache_locale(__loc); | |
| if (this->rdbuf() != 0) | |
| this->rdbuf()->pubimbue(__loc); | |
| return __old; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| void | |
| basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb) | |
| { | |
| ios_base::_M_init(); | |
| _M_cache_locale(_M_ios_locale); | |
| # 146 "/usr/sgug/include/c++/9/bits/basic_ios.tcc" 3 | |
| _M_fill = _CharT(); | |
| _M_fill_init = false; | |
| _M_tie = 0; | |
| _M_exception = goodbit; | |
| _M_streambuf = __sb; | |
| _M_streambuf_state = __sb ? goodbit : badbit; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| void | |
| basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc) | |
| { | |
| if (__builtin_expect(has_facet<__ctype_type>(__loc), true)) | |
| _M_ctype = std::__addressof(use_facet<__ctype_type>(__loc)); | |
| else | |
| _M_ctype = 0; | |
| if (__builtin_expect(has_facet<__num_put_type>(__loc), true)) | |
| _M_num_put = std::__addressof(use_facet<__num_put_type>(__loc)); | |
| else | |
| _M_num_put = 0; | |
| if (__builtin_expect(has_facet<__num_get_type>(__loc), true)) | |
| _M_num_get = std::__addressof(use_facet<__num_get_type>(__loc)); | |
| else | |
| _M_num_get = 0; | |
| } | |
| extern template class basic_ios<char>; | |
| extern template class basic_ios<wchar_t>; | |
| } | |
| # 517 "/usr/sgug/include/c++/9/bits/basic_ios.h" 2 3 | |
| # 45 "/usr/sgug/include/c++/9/ios" 2 3 | |
| # 39 "/usr/sgug/include/c++/9/ostream" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 57 "/usr/sgug/include/c++/9/ostream" 3 | |
| template<typename _CharT, typename _Traits> | |
| class basic_ostream : virtual public basic_ios<_CharT, _Traits> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef typename _Traits::int_type int_type; | |
| typedef typename _Traits::pos_type pos_type; | |
| typedef typename _Traits::off_type off_type; | |
| typedef _Traits traits_type; | |
| typedef basic_streambuf<_CharT, _Traits> __streambuf_type; | |
| typedef basic_ios<_CharT, _Traits> __ios_type; | |
| typedef basic_ostream<_CharT, _Traits> __ostream_type; | |
| typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > | |
| __num_put_type; | |
| typedef ctype<_CharT> __ctype_type; | |
| # 83 "/usr/sgug/include/c++/9/ostream" 3 | |
| explicit | |
| basic_ostream(__streambuf_type* __sb) | |
| { this->init(__sb); } | |
| virtual | |
| ~basic_ostream() { } | |
| class sentry; | |
| friend class sentry; | |
| # 107 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| operator<<(__ostream_type& (*__pf)(__ostream_type&)) | |
| { | |
| return __pf(*this); | |
| } | |
| __ostream_type& | |
| operator<<(__ios_type& (*__pf)(__ios_type&)) | |
| { | |
| __pf(*this); | |
| return *this; | |
| } | |
| __ostream_type& | |
| operator<<(ios_base& (*__pf) (ios_base&)) | |
| { | |
| __pf(*this); | |
| return *this; | |
| } | |
| # 165 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| operator<<(long __n) | |
| { return _M_insert(__n); } | |
| __ostream_type& | |
| operator<<(unsigned long __n) | |
| { return _M_insert(__n); } | |
| __ostream_type& | |
| operator<<(bool __n) | |
| { return _M_insert(__n); } | |
| __ostream_type& | |
| operator<<(short __n); | |
| __ostream_type& | |
| operator<<(unsigned short __n) | |
| { | |
| return _M_insert(static_cast<unsigned long>(__n)); | |
| } | |
| __ostream_type& | |
| operator<<(int __n); | |
| __ostream_type& | |
| operator<<(unsigned int __n) | |
| { | |
| return _M_insert(static_cast<unsigned long>(__n)); | |
| } | |
| __ostream_type& | |
| operator<<(long long __n) | |
| { return _M_insert(__n); } | |
| __ostream_type& | |
| operator<<(unsigned long long __n) | |
| { return _M_insert(__n); } | |
| # 219 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| operator<<(double __f) | |
| { return _M_insert(__f); } | |
| __ostream_type& | |
| operator<<(float __f) | |
| { | |
| return _M_insert(static_cast<double>(__f)); | |
| } | |
| __ostream_type& | |
| operator<<(long double __f) | |
| { return _M_insert(__f); } | |
| # 244 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| operator<<(const void* __p) | |
| { return _M_insert(__p); } | |
| # 275 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| operator<<(__streambuf_type* __sb); | |
| # 308 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| put(char_type __c); | |
| void | |
| _M_write(const char_type* __s, streamsize __n) | |
| { | |
| const streamsize __put = this->rdbuf()->sputn(__s, __n); | |
| if (__put != __n) | |
| this->setstate(ios_base::badbit); | |
| } | |
| # 340 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| write(const char_type* __s, streamsize __n); | |
| # 353 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| flush(); | |
| # 363 "/usr/sgug/include/c++/9/ostream" 3 | |
| pos_type | |
| tellp(); | |
| # 374 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| seekp(pos_type); | |
| # 386 "/usr/sgug/include/c++/9/ostream" 3 | |
| __ostream_type& | |
| seekp(off_type, ios_base::seekdir); | |
| protected: | |
| basic_ostream() | |
| { this->init(0); } | |
| basic_ostream(basic_iostream<_CharT, _Traits>&) { } | |
| basic_ostream(const basic_ostream&) = delete; | |
| basic_ostream(basic_ostream&& __rhs) | |
| : __ios_type() | |
| { __ios_type::move(__rhs); } | |
| basic_ostream& operator=(const basic_ostream&) = delete; | |
| basic_ostream& | |
| operator=(basic_ostream&& __rhs) | |
| { | |
| swap(__rhs); | |
| return *this; | |
| } | |
| void | |
| swap(basic_ostream& __rhs) | |
| { __ios_type::swap(__rhs); } | |
| template<typename _ValueT> | |
| __ostream_type& | |
| _M_insert(_ValueT __v); | |
| }; | |
| # 431 "/usr/sgug/include/c++/9/ostream" 3 | |
| template <typename _CharT, typename _Traits> | |
| class basic_ostream<_CharT, _Traits>::sentry | |
| { | |
| bool _M_ok; | |
| basic_ostream<_CharT, _Traits>& _M_os; | |
| public: | |
| # 450 "/usr/sgug/include/c++/9/ostream" 3 | |
| explicit | |
| sentry(basic_ostream<_CharT, _Traits>& __os); | |
| #pragma GCC diagnostic push | |
| #pragma GCC diagnostic ignored "-Wdeprecated-declarations" | |
| ~sentry() | |
| { | |
| if (bool(_M_os.flags() & ios_base::unitbuf) && !uncaught_exception()) | |
| { | |
| if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1) | |
| _M_os.setstate(ios_base::badbit); | |
| } | |
| } | |
| #pragma GCC diagnostic pop | |
| # 482 "/usr/sgug/include/c++/9/ostream" 3 | |
| explicit | |
| operator bool() const | |
| { return _M_ok; } | |
| }; | |
| # 504 "/usr/sgug/include/c++/9/ostream" 3 | |
| template<typename _CharT, typename _Traits> | |
| inline basic_ostream<_CharT, _Traits>& | |
| operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c) | |
| { return __ostream_insert(__out, &__c, 1); } | |
| template<typename _CharT, typename _Traits> | |
| inline basic_ostream<_CharT, _Traits>& | |
| operator<<(basic_ostream<_CharT, _Traits>& __out, char __c) | |
| { return (__out << __out.widen(__c)); } | |
| template <class _Traits> | |
| inline basic_ostream<char, _Traits>& | |
| operator<<(basic_ostream<char, _Traits>& __out, char __c) | |
| { return __ostream_insert(__out, &__c, 1); } | |
| template<class _Traits> | |
| inline basic_ostream<char, _Traits>& | |
| operator<<(basic_ostream<char, _Traits>& __out, signed char __c) | |
| { return (__out << static_cast<char>(__c)); } | |
| template<class _Traits> | |
| inline basic_ostream<char, _Traits>& | |
| operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c) | |
| { return (__out << static_cast<char>(__c)); } | |
| # 546 "/usr/sgug/include/c++/9/ostream" 3 | |
| template<typename _CharT, typename _Traits> | |
| inline basic_ostream<_CharT, _Traits>& | |
| operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) | |
| { | |
| if (!__s) | |
| __out.setstate(ios_base::badbit); | |
| else | |
| __ostream_insert(__out, __s, | |
| static_cast<streamsize>(_Traits::length(__s))); | |
| return __out; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits> & | |
| operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s); | |
| template<class _Traits> | |
| inline basic_ostream<char, _Traits>& | |
| operator<<(basic_ostream<char, _Traits>& __out, const char* __s) | |
| { | |
| if (!__s) | |
| __out.setstate(ios_base::badbit); | |
| else | |
| __ostream_insert(__out, __s, | |
| static_cast<streamsize>(_Traits::length(__s))); | |
| return __out; | |
| } | |
| template<class _Traits> | |
| inline basic_ostream<char, _Traits>& | |
| operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s) | |
| { return (__out << reinterpret_cast<const char*>(__s)); } | |
| template<class _Traits> | |
| inline basic_ostream<char, _Traits> & | |
| operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s) | |
| { return (__out << reinterpret_cast<const char*>(__s)); } | |
| # 597 "/usr/sgug/include/c++/9/ostream" 3 | |
| template<typename _CharT, typename _Traits> | |
| inline basic_ostream<_CharT, _Traits>& | |
| endl(basic_ostream<_CharT, _Traits>& __os) | |
| { return flush(__os.put(__os.widen('\n'))); } | |
| # 609 "/usr/sgug/include/c++/9/ostream" 3 | |
| template<typename _CharT, typename _Traits> | |
| inline basic_ostream<_CharT, _Traits>& | |
| ends(basic_ostream<_CharT, _Traits>& __os) | |
| { return __os.put(_CharT()); } | |
| template<typename _CharT, typename _Traits> | |
| inline basic_ostream<_CharT, _Traits>& | |
| flush(basic_ostream<_CharT, _Traits>& __os) | |
| { return __os.flush(); } | |
| template<typename _Ch, typename _Up> | |
| basic_ostream<_Ch, _Up>& | |
| __is_convertible_to_basic_ostream_test(basic_ostream<_Ch, _Up>*); | |
| template<typename _Tp, typename = void> | |
| struct __is_convertible_to_basic_ostream_impl | |
| { | |
| using __ostream_type = void; | |
| }; | |
| template<typename _Tp> | |
| using __do_is_convertible_to_basic_ostream_impl = | |
| decltype(__is_convertible_to_basic_ostream_test | |
| (declval<typename remove_reference<_Tp>::type*>())); | |
| template<typename _Tp> | |
| struct __is_convertible_to_basic_ostream_impl | |
| <_Tp, | |
| __void_t<__do_is_convertible_to_basic_ostream_impl<_Tp>>> | |
| { | |
| using __ostream_type = | |
| __do_is_convertible_to_basic_ostream_impl<_Tp>; | |
| }; | |
| template<typename _Tp> | |
| struct __is_convertible_to_basic_ostream | |
| : __is_convertible_to_basic_ostream_impl<_Tp> | |
| { | |
| public: | |
| using type = __not_<is_void< | |
| typename __is_convertible_to_basic_ostream_impl<_Tp>::__ostream_type>>; | |
| constexpr static bool value = type::value; | |
| }; | |
| template<typename _Ostream, typename _Tp, typename = void> | |
| struct __is_insertable : false_type {}; | |
| template<typename _Ostream, typename _Tp> | |
| struct __is_insertable<_Ostream, _Tp, | |
| __void_t<decltype(declval<_Ostream&>() | |
| << declval<const _Tp&>())>> | |
| : true_type {}; | |
| template<typename _Ostream> | |
| using __rvalue_ostream_type = | |
| typename __is_convertible_to_basic_ostream< | |
| _Ostream>::__ostream_type; | |
| # 683 "/usr/sgug/include/c++/9/ostream" 3 | |
| template<typename _Ostream, typename _Tp> | |
| inline | |
| typename enable_if<__and_<__not_<is_lvalue_reference<_Ostream>>, | |
| __is_convertible_to_basic_ostream<_Ostream>, | |
| __is_insertable< | |
| __rvalue_ostream_type<_Ostream>, | |
| const _Tp&>>::value, | |
| __rvalue_ostream_type<_Ostream>>::type | |
| operator<<(_Ostream&& __os, const _Tp& __x) | |
| { | |
| __rvalue_ostream_type<_Ostream> __ret_os = __os; | |
| __ret_os << __x; | |
| return __ret_os; | |
| } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/ostream.tcc" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/ostream.tcc" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/ostream.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>::sentry:: | |
| sentry(basic_ostream<_CharT, _Traits>& __os) | |
| : _M_ok(false), _M_os(__os) | |
| { | |
| if (__os.tie() && __os.good()) | |
| __os.tie()->flush(); | |
| if (__os.good()) | |
| _M_ok = true; | |
| else | |
| __os.setstate(ios_base::failbit); | |
| } | |
| template<typename _CharT, typename _Traits> | |
| template<typename _ValueT> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| _M_insert(_ValueT __v) | |
| { | |
| sentry __cerb(*this); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const __num_put_type& __np = __check_facet(this->_M_num_put); | |
| if (__np.put(*this, *this, this->fill(), __v).failed()) | |
| __err |= ios_base::badbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| operator<<(short __n) | |
| { | |
| const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; | |
| if (__fmt == ios_base::oct || __fmt == ios_base::hex) | |
| return _M_insert(static_cast<long>(static_cast<unsigned short>(__n))); | |
| else | |
| return _M_insert(static_cast<long>(__n)); | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| operator<<(int __n) | |
| { | |
| const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; | |
| if (__fmt == ios_base::oct || __fmt == ios_base::hex) | |
| return _M_insert(static_cast<long>(static_cast<unsigned int>(__n))); | |
| else | |
| return _M_insert(static_cast<long>(__n)); | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| operator<<(__streambuf_type* __sbin) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this); | |
| if (__cerb && __sbin) | |
| { | |
| if (true) | |
| { | |
| if (!__copy_streambufs(__sbin, this->rdbuf())) | |
| __err |= ios_base::failbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::failbit); } | |
| } | |
| else if (!__sbin) | |
| __err |= ios_base::badbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| put(char_type __c) | |
| { | |
| sentry __cerb(*this); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const int_type __put = this->rdbuf()->sputc(__c); | |
| if (traits_type::eq_int_type(__put, traits_type::eof())) | |
| __err |= ios_base::badbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| write(const _CharT* __s, streamsize __n) | |
| { | |
| sentry __cerb(*this); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { _M_write(__s, __n); } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| flush() | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| if (this->rdbuf() && this->rdbuf()->pubsync() == -1) | |
| __err |= ios_base::badbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| typename basic_ostream<_CharT, _Traits>::pos_type | |
| basic_ostream<_CharT, _Traits>:: | |
| tellp() | |
| { | |
| pos_type __ret = pos_type(-1); | |
| if (true) | |
| { | |
| if (!this->fail()) | |
| __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out); | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| seekp(pos_type __pos) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| if (!this->fail()) | |
| { | |
| const pos_type __p = this->rdbuf()->pubseekpos(__pos, | |
| ios_base::out); | |
| if (__p == pos_type(off_type(-1))) | |
| __err |= ios_base::failbit; | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| basic_ostream<_CharT, _Traits>:: | |
| seekp(off_type __off, ios_base::seekdir __dir) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| if (!this->fail()) | |
| { | |
| const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, | |
| ios_base::out); | |
| if (__p == pos_type(off_type(-1))) | |
| __err |= ios_base::failbit; | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_ostream<_CharT, _Traits>& | |
| operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s) | |
| { | |
| if (!__s) | |
| __out.setstate(ios_base::badbit); | |
| else | |
| { | |
| const size_t __clen = char_traits<char>::length(__s); | |
| if (true) | |
| { | |
| struct __ptr_guard | |
| { | |
| _CharT *__p; | |
| __ptr_guard (_CharT *__ip): __p(__ip) { } | |
| ~__ptr_guard() { delete[] __p; } | |
| _CharT* __get() { return __p; } | |
| } __pg (new _CharT[__clen]); | |
| _CharT *__ws = __pg.__get(); | |
| for (size_t __i = 0; __i < __clen; ++__i) | |
| __ws[__i] = __out.widen(__s[__i]); | |
| __ostream_insert(__out, __ws, __clen); | |
| } | |
| if (false) | |
| { | |
| __out._M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { __out._M_setstate(ios_base::badbit); } | |
| } | |
| return __out; | |
| } | |
| extern template class basic_ostream<char>; | |
| extern template ostream& endl(ostream&); | |
| extern template ostream& ends(ostream&); | |
| extern template ostream& flush(ostream&); | |
| extern template ostream& operator<<(ostream&, char); | |
| extern template ostream& operator<<(ostream&, unsigned char); | |
| extern template ostream& operator<<(ostream&, signed char); | |
| extern template ostream& operator<<(ostream&, const char*); | |
| extern template ostream& operator<<(ostream&, const unsigned char*); | |
| extern template ostream& operator<<(ostream&, const signed char*); | |
| extern template ostream& ostream::_M_insert(long); | |
| extern template ostream& ostream::_M_insert(unsigned long); | |
| extern template ostream& ostream::_M_insert(bool); | |
| extern template ostream& ostream::_M_insert(long long); | |
| extern template ostream& ostream::_M_insert(unsigned long long); | |
| extern template ostream& ostream::_M_insert(double); | |
| extern template ostream& ostream::_M_insert(long double); | |
| extern template ostream& ostream::_M_insert(const void*); | |
| extern template class basic_ostream<wchar_t>; | |
| extern template wostream& endl(wostream&); | |
| extern template wostream& ends(wostream&); | |
| extern template wostream& flush(wostream&); | |
| extern template wostream& operator<<(wostream&, wchar_t); | |
| extern template wostream& operator<<(wostream&, char); | |
| extern template wostream& operator<<(wostream&, const wchar_t*); | |
| extern template wostream& operator<<(wostream&, const char*); | |
| extern template wostream& wostream::_M_insert(long); | |
| extern template wostream& wostream::_M_insert(unsigned long); | |
| extern template wostream& wostream::_M_insert(bool); | |
| extern template wostream& wostream::_M_insert(long long); | |
| extern template wostream& wostream::_M_insert(unsigned long long); | |
| extern template wostream& wostream::_M_insert(double); | |
| extern template wostream& wostream::_M_insert(long double); | |
| extern template wostream& wostream::_M_insert(const void*); | |
| } | |
| # 703 "/usr/sgug/include/c++/9/ostream" 2 3 | |
| # 65 "/usr/sgug/include/c++/9/iterator" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/istream" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/istream" 3 | |
| # 37 "/usr/sgug/include/c++/9/istream" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 57 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _CharT, typename _Traits> | |
| class basic_istream : virtual public basic_ios<_CharT, _Traits> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef typename _Traits::int_type int_type; | |
| typedef typename _Traits::pos_type pos_type; | |
| typedef typename _Traits::off_type off_type; | |
| typedef _Traits traits_type; | |
| typedef basic_streambuf<_CharT, _Traits> __streambuf_type; | |
| typedef basic_ios<_CharT, _Traits> __ios_type; | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > | |
| __num_get_type; | |
| typedef ctype<_CharT> __ctype_type; | |
| protected: | |
| streamsize _M_gcount; | |
| public: | |
| explicit | |
| basic_istream(__streambuf_type* __sb) | |
| : _M_gcount(streamsize(0)) | |
| { this->init(__sb); } | |
| virtual | |
| ~basic_istream() | |
| { _M_gcount = streamsize(0); } | |
| class sentry; | |
| friend class sentry; | |
| # 119 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| operator>>(__istream_type& (*__pf)(__istream_type&)) | |
| { return __pf(*this); } | |
| __istream_type& | |
| operator>>(__ios_type& (*__pf)(__ios_type&)) | |
| { | |
| __pf(*this); | |
| return *this; | |
| } | |
| __istream_type& | |
| operator>>(ios_base& (*__pf)(ios_base&)) | |
| { | |
| __pf(*this); | |
| return *this; | |
| } | |
| # 167 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| operator>>(bool& __n) | |
| { return _M_extract(__n); } | |
| __istream_type& | |
| operator>>(short& __n); | |
| __istream_type& | |
| operator>>(unsigned short& __n) | |
| { return _M_extract(__n); } | |
| __istream_type& | |
| operator>>(int& __n); | |
| __istream_type& | |
| operator>>(unsigned int& __n) | |
| { return _M_extract(__n); } | |
| __istream_type& | |
| operator>>(long& __n) | |
| { return _M_extract(__n); } | |
| __istream_type& | |
| operator>>(unsigned long& __n) | |
| { return _M_extract(__n); } | |
| __istream_type& | |
| operator>>(long long& __n) | |
| { return _M_extract(__n); } | |
| __istream_type& | |
| operator>>(unsigned long long& __n) | |
| { return _M_extract(__n); } | |
| # 213 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| operator>>(float& __f) | |
| { return _M_extract(__f); } | |
| __istream_type& | |
| operator>>(double& __f) | |
| { return _M_extract(__f); } | |
| __istream_type& | |
| operator>>(long double& __f) | |
| { return _M_extract(__f); } | |
| # 234 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| operator>>(void*& __p) | |
| { return _M_extract(__p); } | |
| # 258 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| operator>>(__streambuf_type* __sb); | |
| # 268 "/usr/sgug/include/c++/9/istream" 3 | |
| streamsize | |
| gcount() const | |
| { return _M_gcount; } | |
| # 301 "/usr/sgug/include/c++/9/istream" 3 | |
| int_type | |
| get(); | |
| # 315 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| get(char_type& __c); | |
| # 342 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| get(char_type* __s, streamsize __n, char_type __delim); | |
| # 353 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| get(char_type* __s, streamsize __n) | |
| { return this->get(__s, __n, this->widen('\n')); } | |
| # 376 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| get(__streambuf_type& __sb, char_type __delim); | |
| # 386 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| get(__streambuf_type& __sb) | |
| { return this->get(__sb, this->widen('\n')); } | |
| # 415 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| getline(char_type* __s, streamsize __n, char_type __delim); | |
| # 426 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| getline(char_type* __s, streamsize __n) | |
| { return this->getline(__s, __n, this->widen('\n')); } | |
| # 450 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| ignore(streamsize __n, int_type __delim); | |
| __istream_type& | |
| ignore(streamsize __n); | |
| __istream_type& | |
| ignore(); | |
| # 467 "/usr/sgug/include/c++/9/istream" 3 | |
| int_type | |
| peek(); | |
| # 485 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| read(char_type* __s, streamsize __n); | |
| # 504 "/usr/sgug/include/c++/9/istream" 3 | |
| streamsize | |
| readsome(char_type* __s, streamsize __n); | |
| # 521 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| putback(char_type __c); | |
| # 537 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| unget(); | |
| # 555 "/usr/sgug/include/c++/9/istream" 3 | |
| int | |
| sync(); | |
| # 570 "/usr/sgug/include/c++/9/istream" 3 | |
| pos_type | |
| tellg(); | |
| # 585 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| seekg(pos_type); | |
| # 601 "/usr/sgug/include/c++/9/istream" 3 | |
| __istream_type& | |
| seekg(off_type, ios_base::seekdir); | |
| protected: | |
| basic_istream() | |
| : _M_gcount(streamsize(0)) | |
| { this->init(0); } | |
| basic_istream(const basic_istream&) = delete; | |
| basic_istream(basic_istream&& __rhs) | |
| : __ios_type(), _M_gcount(__rhs._M_gcount) | |
| { | |
| __ios_type::move(__rhs); | |
| __rhs._M_gcount = 0; | |
| } | |
| basic_istream& operator=(const basic_istream&) = delete; | |
| basic_istream& | |
| operator=(basic_istream&& __rhs) | |
| { | |
| swap(__rhs); | |
| return *this; | |
| } | |
| void | |
| swap(basic_istream& __rhs) | |
| { | |
| __ios_type::swap(__rhs); | |
| std::swap(_M_gcount, __rhs._M_gcount); | |
| } | |
| template<typename _ValueT> | |
| __istream_type& | |
| _M_extract(_ValueT& __v); | |
| }; | |
| template<> | |
| basic_istream<char>& | |
| basic_istream<char>:: | |
| getline(char_type* __s, streamsize __n, char_type __delim); | |
| template<> | |
| basic_istream<char>& | |
| basic_istream<char>:: | |
| ignore(streamsize __n); | |
| template<> | |
| basic_istream<char>& | |
| basic_istream<char>:: | |
| ignore(streamsize __n, int_type __delim); | |
| template<> | |
| basic_istream<wchar_t>& | |
| basic_istream<wchar_t>:: | |
| getline(char_type* __s, streamsize __n, char_type __delim); | |
| template<> | |
| basic_istream<wchar_t>& | |
| basic_istream<wchar_t>:: | |
| ignore(streamsize __n); | |
| template<> | |
| basic_istream<wchar_t>& | |
| basic_istream<wchar_t>:: | |
| ignore(streamsize __n, int_type __delim); | |
| # 685 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _CharT, typename _Traits> | |
| class basic_istream<_CharT, _Traits>::sentry | |
| { | |
| bool _M_ok; | |
| public: | |
| typedef _Traits traits_type; | |
| typedef basic_streambuf<_CharT, _Traits> __streambuf_type; | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef typename __istream_type::__ctype_type __ctype_type; | |
| typedef typename _Traits::int_type __int_type; | |
| # 721 "/usr/sgug/include/c++/9/istream" 3 | |
| explicit | |
| sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false); | |
| # 732 "/usr/sgug/include/c++/9/istream" 3 | |
| explicit | |
| operator bool() const | |
| { return _M_ok; } | |
| }; | |
| # 750 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c); | |
| template<class _Traits> | |
| inline basic_istream<char, _Traits>& | |
| operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c) | |
| { return (__in >> reinterpret_cast<char&>(__c)); } | |
| template<class _Traits> | |
| inline basic_istream<char, _Traits>& | |
| operator>>(basic_istream<char, _Traits>& __in, signed char& __c) | |
| { return (__in >> reinterpret_cast<char&>(__c)); } | |
| # 792 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s); | |
| template<> | |
| basic_istream<char>& | |
| operator>>(basic_istream<char>& __in, char* __s); | |
| template<class _Traits> | |
| inline basic_istream<char, _Traits>& | |
| operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s) | |
| { return (__in >> reinterpret_cast<char*>(__s)); } | |
| template<class _Traits> | |
| inline basic_istream<char, _Traits>& | |
| operator>>(basic_istream<char, _Traits>& __in, signed char* __s) | |
| { return (__in >> reinterpret_cast<char*>(__s)); } | |
| # 823 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _CharT, typename _Traits> | |
| class basic_iostream | |
| : public basic_istream<_CharT, _Traits>, | |
| public basic_ostream<_CharT, _Traits> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef typename _Traits::int_type int_type; | |
| typedef typename _Traits::pos_type pos_type; | |
| typedef typename _Traits::off_type off_type; | |
| typedef _Traits traits_type; | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef basic_ostream<_CharT, _Traits> __ostream_type; | |
| explicit | |
| basic_iostream(basic_streambuf<_CharT, _Traits>* __sb) | |
| : __istream_type(__sb), __ostream_type(__sb) { } | |
| virtual | |
| ~basic_iostream() { } | |
| protected: | |
| basic_iostream() | |
| : __istream_type(), __ostream_type() { } | |
| basic_iostream(const basic_iostream&) = delete; | |
| basic_iostream(basic_iostream&& __rhs) | |
| : __istream_type(std::move(__rhs)), __ostream_type(*this) | |
| { } | |
| basic_iostream& operator=(const basic_iostream&) = delete; | |
| basic_iostream& | |
| operator=(basic_iostream&& __rhs) | |
| { | |
| swap(__rhs); | |
| return *this; | |
| } | |
| void | |
| swap(basic_iostream& __rhs) | |
| { __istream_type::swap(__rhs); } | |
| }; | |
| # 906 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| ws(basic_istream<_CharT, _Traits>& __is); | |
| template<typename _Ch, typename _Up> | |
| basic_istream<_Ch, _Up>& | |
| __is_convertible_to_basic_istream_test(basic_istream<_Ch, _Up>*); | |
| template<typename _Tp, typename = void> | |
| struct __is_convertible_to_basic_istream_impl | |
| { | |
| using __istream_type = void; | |
| }; | |
| template<typename _Tp> | |
| using __do_is_convertible_to_basic_istream_impl = | |
| decltype(__is_convertible_to_basic_istream_test | |
| (declval<typename remove_reference<_Tp>::type*>())); | |
| template<typename _Tp> | |
| struct __is_convertible_to_basic_istream_impl | |
| <_Tp, | |
| __void_t<__do_is_convertible_to_basic_istream_impl<_Tp>>> | |
| { | |
| using __istream_type = | |
| __do_is_convertible_to_basic_istream_impl<_Tp>; | |
| }; | |
| template<typename _Tp> | |
| struct __is_convertible_to_basic_istream | |
| : __is_convertible_to_basic_istream_impl<_Tp> | |
| { | |
| public: | |
| using type = __not_<is_void< | |
| typename __is_convertible_to_basic_istream_impl<_Tp>::__istream_type>>; | |
| constexpr static bool value = type::value; | |
| }; | |
| template<typename _Istream, typename _Tp, typename = void> | |
| struct __is_extractable : false_type {}; | |
| template<typename _Istream, typename _Tp> | |
| struct __is_extractable<_Istream, _Tp, | |
| __void_t<decltype(declval<_Istream&>() | |
| >> declval<_Tp>())>> | |
| : true_type {}; | |
| template<typename _Istream> | |
| using __rvalue_istream_type = | |
| typename __is_convertible_to_basic_istream< | |
| _Istream>::__istream_type; | |
| # 972 "/usr/sgug/include/c++/9/istream" 3 | |
| template<typename _Istream, typename _Tp> | |
| inline | |
| typename enable_if<__and_<__not_<is_lvalue_reference<_Istream>>, | |
| __is_convertible_to_basic_istream<_Istream>, | |
| __is_extractable< | |
| __rvalue_istream_type<_Istream>, | |
| _Tp&&>>::value, | |
| __rvalue_istream_type<_Istream>>::type | |
| operator>>(_Istream&& __is, _Tp&& __x) | |
| { | |
| __rvalue_istream_type<_Istream> __ret_is = __is; | |
| __ret_is >> std::forward<_Tp>(__x); | |
| return __ret_is; | |
| } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/bits/istream.tcc" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/istream.tcc" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/istream.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>::sentry:: | |
| sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (__in.good()) | |
| if (true) | |
| { | |
| if (__in.tie()) | |
| __in.tie()->flush(); | |
| if (!__noskip && bool(__in.flags() & ios_base::skipws)) | |
| { | |
| const __int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = __in.rdbuf(); | |
| __int_type __c = __sb->sgetc(); | |
| const __ctype_type& __ct = __check_facet(__in._M_ctype); | |
| while (!traits_type::eq_int_type(__c, __eof) | |
| && __ct.is(ctype_base::space, | |
| traits_type::to_char_type(__c))) | |
| __c = __sb->snextc(); | |
| if (traits_type::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| } | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { __in._M_setstate(ios_base::badbit); } | |
| if (__in.good() && __err == ios_base::goodbit) | |
| _M_ok = true; | |
| else | |
| { | |
| __err |= ios_base::failbit; | |
| __in.setstate(__err); | |
| } | |
| } | |
| template<typename _CharT, typename _Traits> | |
| template<typename _ValueT> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| _M_extract(_ValueT& __v) | |
| { | |
| sentry __cerb(*this, false); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const __num_get_type& __ng = __check_facet(this->_M_num_get); | |
| __ng.get(*this, 0, *this, __err, __v); | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| operator>>(short& __n) | |
| { | |
| sentry __cerb(*this, false); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| long __l; | |
| const __num_get_type& __ng = __check_facet(this->_M_num_get); | |
| __ng.get(*this, 0, *this, __err, __l); | |
| if (__l < __gnu_cxx::__numeric_traits<short>::__min) | |
| { | |
| __err |= ios_base::failbit; | |
| __n = __gnu_cxx::__numeric_traits<short>::__min; | |
| } | |
| else if (__l > __gnu_cxx::__numeric_traits<short>::__max) | |
| { | |
| __err |= ios_base::failbit; | |
| __n = __gnu_cxx::__numeric_traits<short>::__max; | |
| } | |
| else | |
| __n = short(__l); | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| operator>>(int& __n) | |
| { | |
| sentry __cerb(*this, false); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| long __l; | |
| const __num_get_type& __ng = __check_facet(this->_M_num_get); | |
| __ng.get(*this, 0, *this, __err, __l); | |
| if (__l < __gnu_cxx::__numeric_traits<int>::__min) | |
| { | |
| __err |= ios_base::failbit; | |
| __n = __gnu_cxx::__numeric_traits<int>::__min; | |
| } | |
| else if (__l > __gnu_cxx::__numeric_traits<int>::__max) | |
| { | |
| __err |= ios_base::failbit; | |
| __n = __gnu_cxx::__numeric_traits<int>::__max; | |
| } | |
| else | |
| __n = int(__l); | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| operator>>(__streambuf_type* __sbout) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this, false); | |
| if (__cerb && __sbout) | |
| { | |
| if (true) | |
| { | |
| bool __ineof; | |
| if (!__copy_streambufs_eof(this->rdbuf(), __sbout, __ineof)) | |
| __err |= ios_base::failbit; | |
| if (__ineof) | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::failbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::failbit); } | |
| } | |
| else if (!__sbout) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| typename basic_istream<_CharT, _Traits>::int_type | |
| basic_istream<_CharT, _Traits>:: | |
| get(void) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| int_type __c = __eof; | |
| _M_gcount = 0; | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| __c = this->rdbuf()->sbumpc(); | |
| if (!traits_type::eq_int_type(__c, __eof)) | |
| _M_gcount = 1; | |
| else | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| if (!_M_gcount) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return __c; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| get(char_type& __c) | |
| { | |
| _M_gcount = 0; | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| const int_type __cb = this->rdbuf()->sbumpc(); | |
| if (!traits_type::eq_int_type(__cb, traits_type::eof())) | |
| { | |
| _M_gcount = 1; | |
| __c = traits_type::to_char_type(__cb); | |
| } | |
| else | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| if (!_M_gcount) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| get(char_type* __s, streamsize __n, char_type __delim) | |
| { | |
| _M_gcount = 0; | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| const int_type __idelim = traits_type::to_int_type(__delim); | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| int_type __c = __sb->sgetc(); | |
| while (_M_gcount + 1 < __n | |
| && !traits_type::eq_int_type(__c, __eof) | |
| && !traits_type::eq_int_type(__c, __idelim)) | |
| { | |
| *__s++ = traits_type::to_char_type(__c); | |
| ++_M_gcount; | |
| __c = __sb->snextc(); | |
| } | |
| if (traits_type::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| if (__n > 0) | |
| *__s = char_type(); | |
| if (!_M_gcount) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| get(__streambuf_type& __sb, char_type __delim) | |
| { | |
| _M_gcount = 0; | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| const int_type __idelim = traits_type::to_int_type(__delim); | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __this_sb = this->rdbuf(); | |
| int_type __c = __this_sb->sgetc(); | |
| char_type __c2 = traits_type::to_char_type(__c); | |
| while (!traits_type::eq_int_type(__c, __eof) | |
| && !traits_type::eq_int_type(__c, __idelim) | |
| && !traits_type::eq_int_type(__sb.sputc(__c2), __eof)) | |
| { | |
| ++_M_gcount; | |
| __c = __this_sb->snextc(); | |
| __c2 = traits_type::to_char_type(__c); | |
| } | |
| if (traits_type::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| if (!_M_gcount) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| getline(char_type* __s, streamsize __n, char_type __delim) | |
| { | |
| _M_gcount = 0; | |
| ios_base::iostate __err = ios_base::goodbit; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| const int_type __idelim = traits_type::to_int_type(__delim); | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| int_type __c = __sb->sgetc(); | |
| while (_M_gcount + 1 < __n | |
| && !traits_type::eq_int_type(__c, __eof) | |
| && !traits_type::eq_int_type(__c, __idelim)) | |
| { | |
| *__s++ = traits_type::to_char_type(__c); | |
| __c = __sb->snextc(); | |
| ++_M_gcount; | |
| } | |
| if (traits_type::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| else | |
| { | |
| if (traits_type::eq_int_type(__c, __idelim)) | |
| { | |
| __sb->sbumpc(); | |
| ++_M_gcount; | |
| } | |
| else | |
| __err |= ios_base::failbit; | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| if (__n > 0) | |
| *__s = char_type(); | |
| if (!_M_gcount) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| this->setstate(__err); | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| ignore(void) | |
| { | |
| _M_gcount = 0; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| if (traits_type::eq_int_type(__sb->sbumpc(), __eof)) | |
| __err |= ios_base::eofbit; | |
| else | |
| _M_gcount = 1; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| ignore(streamsize __n) | |
| { | |
| _M_gcount = 0; | |
| sentry __cerb(*this, true); | |
| if (__cerb && __n > 0) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| int_type __c = __sb->sgetc(); | |
| # 521 "/usr/sgug/include/c++/9/bits/istream.tcc" 3 | |
| bool __large_ignore = false; | |
| while (true) | |
| { | |
| while (_M_gcount < __n | |
| && !traits_type::eq_int_type(__c, __eof)) | |
| { | |
| ++_M_gcount; | |
| __c = __sb->snextc(); | |
| } | |
| if (__n == __gnu_cxx::__numeric_traits<streamsize>::__max | |
| && !traits_type::eq_int_type(__c, __eof)) | |
| { | |
| _M_gcount = | |
| __gnu_cxx::__numeric_traits<streamsize>::__min; | |
| __large_ignore = true; | |
| } | |
| else | |
| break; | |
| } | |
| if (__large_ignore) | |
| _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__max; | |
| if (traits_type::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| ignore(streamsize __n, int_type __delim) | |
| { | |
| _M_gcount = 0; | |
| sentry __cerb(*this, true); | |
| if (__cerb && __n > 0) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| int_type __c = __sb->sgetc(); | |
| bool __large_ignore = false; | |
| while (true) | |
| { | |
| while (_M_gcount < __n | |
| && !traits_type::eq_int_type(__c, __eof) | |
| && !traits_type::eq_int_type(__c, __delim)) | |
| { | |
| ++_M_gcount; | |
| __c = __sb->snextc(); | |
| } | |
| if (__n == __gnu_cxx::__numeric_traits<streamsize>::__max | |
| && !traits_type::eq_int_type(__c, __eof) | |
| && !traits_type::eq_int_type(__c, __delim)) | |
| { | |
| _M_gcount = | |
| __gnu_cxx::__numeric_traits<streamsize>::__min; | |
| __large_ignore = true; | |
| } | |
| else | |
| break; | |
| } | |
| if (__large_ignore) | |
| _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__max; | |
| if (traits_type::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| else if (traits_type::eq_int_type(__c, __delim)) | |
| { | |
| if (_M_gcount | |
| < __gnu_cxx::__numeric_traits<streamsize>::__max) | |
| ++_M_gcount; | |
| __sb->sbumpc(); | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| typename basic_istream<_CharT, _Traits>::int_type | |
| basic_istream<_CharT, _Traits>:: | |
| peek(void) | |
| { | |
| int_type __c = traits_type::eof(); | |
| _M_gcount = 0; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| __c = this->rdbuf()->sgetc(); | |
| if (traits_type::eq_int_type(__c, traits_type::eof())) | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return __c; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| read(char_type* __s, streamsize __n) | |
| { | |
| _M_gcount = 0; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| _M_gcount = this->rdbuf()->sgetn(__s, __n); | |
| if (_M_gcount != __n) | |
| __err |= (ios_base::eofbit | ios_base::failbit); | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| streamsize | |
| basic_istream<_CharT, _Traits>:: | |
| readsome(char_type* __s, streamsize __n) | |
| { | |
| _M_gcount = 0; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const streamsize __num = this->rdbuf()->in_avail(); | |
| if (__num > 0) | |
| _M_gcount = this->rdbuf()->sgetn(__s, std::min(__num, __n)); | |
| else if (__num == -1) | |
| __err |= ios_base::eofbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return _M_gcount; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| putback(char_type __c) | |
| { | |
| _M_gcount = 0; | |
| this->clear(this->rdstate() & ~ios_base::eofbit); | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| if (!__sb | |
| || traits_type::eq_int_type(__sb->sputbackc(__c), __eof)) | |
| __err |= ios_base::badbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| unget(void) | |
| { | |
| _M_gcount = 0; | |
| this->clear(this->rdstate() & ~ios_base::eofbit); | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const int_type __eof = traits_type::eof(); | |
| __streambuf_type* __sb = this->rdbuf(); | |
| if (!__sb | |
| || traits_type::eq_int_type(__sb->sungetc(), __eof)) | |
| __err |= ios_base::badbit; | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| int | |
| basic_istream<_CharT, _Traits>:: | |
| sync(void) | |
| { | |
| int __ret = -1; | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| __streambuf_type* __sb = this->rdbuf(); | |
| if (__sb) | |
| { | |
| if (__sb->pubsync() == -1) | |
| __err |= ios_base::badbit; | |
| else | |
| __ret = 0; | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| typename basic_istream<_CharT, _Traits>::pos_type | |
| basic_istream<_CharT, _Traits>:: | |
| tellg(void) | |
| { | |
| pos_type __ret = pos_type(-1); | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| if (!this->fail()) | |
| __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, | |
| ios_base::in); | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| } | |
| return __ret; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| seekg(pos_type __pos) | |
| { | |
| this->clear(this->rdstate() & ~ios_base::eofbit); | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| if (!this->fail()) | |
| { | |
| const pos_type __p = this->rdbuf()->pubseekpos(__pos, | |
| ios_base::in); | |
| if (__p == pos_type(off_type(-1))) | |
| __err |= ios_base::failbit; | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| basic_istream<_CharT, _Traits>:: | |
| seekg(off_type __off, ios_base::seekdir __dir) | |
| { | |
| this->clear(this->rdstate() & ~ios_base::eofbit); | |
| sentry __cerb(*this, true); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| if (!this->fail()) | |
| { | |
| const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, | |
| ios_base::in); | |
| if (__p == pos_type(off_type(-1))) | |
| __err |= ios_base::failbit; | |
| } | |
| } | |
| if (false) | |
| { | |
| this->_M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { this->_M_setstate(ios_base::badbit); } | |
| if (__err) | |
| this->setstate(__err); | |
| } | |
| return *this; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c) | |
| { | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef typename __istream_type::int_type __int_type; | |
| typename __istream_type::sentry __cerb(__in, false); | |
| if (__cerb) | |
| { | |
| ios_base::iostate __err = ios_base::goodbit; | |
| if (true) | |
| { | |
| const __int_type __cb = __in.rdbuf()->sbumpc(); | |
| if (!_Traits::eq_int_type(__cb, _Traits::eof())) | |
| __c = _Traits::to_char_type(__cb); | |
| else | |
| __err |= (ios_base::eofbit | ios_base::failbit); | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { __in._M_setstate(ios_base::badbit); } | |
| if (__err) | |
| __in.setstate(__err); | |
| } | |
| return __in; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s) | |
| { | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef basic_streambuf<_CharT, _Traits> __streambuf_type; | |
| typedef typename _Traits::int_type int_type; | |
| typedef _CharT char_type; | |
| typedef ctype<_CharT> __ctype_type; | |
| streamsize __extracted = 0; | |
| ios_base::iostate __err = ios_base::goodbit; | |
| typename __istream_type::sentry __cerb(__in, false); | |
| if (__cerb) | |
| { | |
| if (true) | |
| { | |
| streamsize __num = __in.width(); | |
| if (__num <= 0) | |
| __num = __gnu_cxx::__numeric_traits<streamsize>::__max; | |
| const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); | |
| const int_type __eof = _Traits::eof(); | |
| __streambuf_type* __sb = __in.rdbuf(); | |
| int_type __c = __sb->sgetc(); | |
| while (__extracted < __num - 1 | |
| && !_Traits::eq_int_type(__c, __eof) | |
| && !__ct.is(ctype_base::space, | |
| _Traits::to_char_type(__c))) | |
| { | |
| *__s++ = _Traits::to_char_type(__c); | |
| ++__extracted; | |
| __c = __sb->snextc(); | |
| } | |
| if (_Traits::eq_int_type(__c, __eof)) | |
| __err |= ios_base::eofbit; | |
| *__s = char_type(); | |
| __in.width(0); | |
| } | |
| if (false) | |
| { | |
| __in._M_setstate(ios_base::badbit); | |
| ; | |
| } | |
| if (false) | |
| { __in._M_setstate(ios_base::badbit); } | |
| } | |
| if (!__extracted) | |
| __err |= ios_base::failbit; | |
| if (__err) | |
| __in.setstate(__err); | |
| return __in; | |
| } | |
| template<typename _CharT, typename _Traits> | |
| basic_istream<_CharT, _Traits>& | |
| ws(basic_istream<_CharT, _Traits>& __in) | |
| { | |
| typedef basic_istream<_CharT, _Traits> __istream_type; | |
| typedef basic_streambuf<_CharT, _Traits> __streambuf_type; | |
| typedef typename __istream_type::int_type __int_type; | |
| typedef ctype<_CharT> __ctype_type; | |
| const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); | |
| const __int_type __eof = _Traits::eof(); | |
| __streambuf_type* __sb = __in.rdbuf(); | |
| __int_type __c = __sb->sgetc(); | |
| while (!_Traits::eq_int_type(__c, __eof) | |
| && __ct.is(ctype_base::space, _Traits::to_char_type(__c))) | |
| __c = __sb->snextc(); | |
| if (_Traits::eq_int_type(__c, __eof)) | |
| __in.setstate(ios_base::eofbit); | |
| return __in; | |
| } | |
| extern template class basic_istream<char>; | |
| extern template istream& ws(istream&); | |
| extern template istream& operator>>(istream&, char&); | |
| extern template istream& operator>>(istream&, char*); | |
| extern template istream& operator>>(istream&, unsigned char&); | |
| extern template istream& operator>>(istream&, signed char&); | |
| extern template istream& operator>>(istream&, unsigned char*); | |
| extern template istream& operator>>(istream&, signed char*); | |
| extern template istream& istream::_M_extract(unsigned short&); | |
| extern template istream& istream::_M_extract(unsigned int&); | |
| extern template istream& istream::_M_extract(long&); | |
| extern template istream& istream::_M_extract(unsigned long&); | |
| extern template istream& istream::_M_extract(bool&); | |
| extern template istream& istream::_M_extract(long long&); | |
| extern template istream& istream::_M_extract(unsigned long long&); | |
| extern template istream& istream::_M_extract(float&); | |
| extern template istream& istream::_M_extract(double&); | |
| extern template istream& istream::_M_extract(long double&); | |
| extern template istream& istream::_M_extract(void*&); | |
| extern template class basic_iostream<char>; | |
| extern template class basic_istream<wchar_t>; | |
| extern template wistream& ws(wistream&); | |
| extern template wistream& operator>>(wistream&, wchar_t&); | |
| extern template wistream& operator>>(wistream&, wchar_t*); | |
| extern template wistream& wistream::_M_extract(unsigned short&); | |
| extern template wistream& wistream::_M_extract(unsigned int&); | |
| extern template wistream& wistream::_M_extract(long&); | |
| extern template wistream& wistream::_M_extract(unsigned long&); | |
| extern template wistream& wistream::_M_extract(bool&); | |
| extern template wistream& wistream::_M_extract(long long&); | |
| extern template wistream& wistream::_M_extract(unsigned long long&); | |
| extern template wistream& wistream::_M_extract(float&); | |
| extern template wistream& wistream::_M_extract(double&); | |
| extern template wistream& wistream::_M_extract(long double&); | |
| extern template wistream& wistream::_M_extract(void*&); | |
| extern template class basic_iostream<wchar_t>; | |
| } | |
| # 992 "/usr/sgug/include/c++/9/istream" 2 3 | |
| # 66 "/usr/sgug/include/c++/9/iterator" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/stream_iterator.h" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/stream_iterator.h" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/stream_iterator.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _Tp, typename _CharT = char, | |
| typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t> | |
| class istream_iterator | |
| : public iterator<input_iterator_tag, _Tp, _Dist, const _Tp*, const _Tp&> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _Traits traits_type; | |
| typedef basic_istream<_CharT, _Traits> istream_type; | |
| private: | |
| istream_type* _M_stream; | |
| _Tp _M_value; | |
| bool _M_ok; | |
| public: | |
| constexpr istream_iterator() | |
| : _M_stream(0), _M_value(), _M_ok(false) {} | |
| istream_iterator(istream_type& __s) | |
| : _M_stream(std::__addressof(__s)) | |
| { _M_read(); } | |
| istream_iterator(const istream_iterator& __obj) | |
| : _M_stream(__obj._M_stream), _M_value(__obj._M_value), | |
| _M_ok(__obj._M_ok) | |
| { } | |
| istream_iterator& operator=(const istream_iterator&) = default; | |
| const _Tp& | |
| operator*() const | |
| { | |
| ; | |
| return _M_value; | |
| } | |
| const _Tp* | |
| operator->() const { return std::__addressof((operator*())); } | |
| istream_iterator& | |
| operator++() | |
| { | |
| ; | |
| _M_read(); | |
| return *this; | |
| } | |
| istream_iterator | |
| operator++(int) | |
| { | |
| ; | |
| istream_iterator __tmp = *this; | |
| _M_read(); | |
| return __tmp; | |
| } | |
| bool | |
| _M_equal(const istream_iterator& __x) const | |
| { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); } | |
| private: | |
| void | |
| _M_read() | |
| { | |
| _M_ok = (_M_stream && *_M_stream) ? true : false; | |
| if (_M_ok) | |
| { | |
| *_M_stream >> _M_value; | |
| _M_ok = *_M_stream ? true : false; | |
| } | |
| } | |
| }; | |
| template<typename _Tp, typename _CharT, typename _Traits, typename _Dist> | |
| inline bool | |
| operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, | |
| const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) | |
| { return __x._M_equal(__y); } | |
| template <class _Tp, class _CharT, class _Traits, class _Dist> | |
| inline bool | |
| operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, | |
| const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) | |
| { return !__x._M_equal(__y); } | |
| # 156 "/usr/sgug/include/c++/9/bits/stream_iterator.h" 3 | |
| template<typename _Tp, typename _CharT = char, | |
| typename _Traits = char_traits<_CharT> > | |
| class ostream_iterator | |
| : public iterator<output_iterator_tag, void, void, void, void> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _Traits traits_type; | |
| typedef basic_ostream<_CharT, _Traits> ostream_type; | |
| private: | |
| ostream_type* _M_stream; | |
| const _CharT* _M_string; | |
| public: | |
| ostream_iterator(ostream_type& __s) | |
| : _M_stream(std::__addressof(__s)), _M_string(0) {} | |
| # 188 "/usr/sgug/include/c++/9/bits/stream_iterator.h" 3 | |
| ostream_iterator(ostream_type& __s, const _CharT* __c) | |
| : _M_stream(&__s), _M_string(__c) { } | |
| ostream_iterator(const ostream_iterator& __obj) | |
| : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { } | |
| ostream_iterator& operator=(const ostream_iterator&) = default; | |
| ostream_iterator& | |
| operator=(const _Tp& __value) | |
| { | |
| ; | |
| *_M_stream << __value; | |
| if (_M_string) *_M_stream << _M_string; | |
| return *this; | |
| } | |
| ostream_iterator& | |
| operator*() | |
| { return *this; } | |
| ostream_iterator& | |
| operator++() | |
| { return *this; } | |
| ostream_iterator& | |
| operator++(int) | |
| { return *this; } | |
| }; | |
| } | |
| # 67 "/usr/sgug/include/c++/9/iterator" 2 3 | |
| # 44 "/usr/sgug/include/c++/9/regex" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/locale" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/locale" 3 | |
| # 37 "/usr/sgug/include/c++/9/locale" 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| # 38 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| # 1 "/usr/sgug/include/c++/9/ctime" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/ctime" 3 | |
| # 40 "/usr/sgug/include/c++/9/ctime" 3 | |
| # 58 "/usr/sgug/include/c++/9/ctime" 3 | |
| namespace std | |
| { | |
| using ::clock_t; | |
| using ::time_t; | |
| using ::tm; | |
| using ::clock; | |
| using ::difftime; | |
| using ::mktime; | |
| using ::time; | |
| using ::asctime; | |
| using ::ctime; | |
| using ::gmtime; | |
| using ::localtime; | |
| using ::strftime; | |
| } | |
| # 40 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| # 52 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| class time_base | |
| { | |
| public: | |
| enum dateorder { no_order, dmy, mdy, ymd, ydm }; | |
| }; | |
| template<typename _CharT> | |
| struct __timepunct_cache : public locale::facet | |
| { | |
| static const _CharT* _S_timezones[14]; | |
| const _CharT* _M_date_format; | |
| const _CharT* _M_date_era_format; | |
| const _CharT* _M_time_format; | |
| const _CharT* _M_time_era_format; | |
| const _CharT* _M_date_time_format; | |
| const _CharT* _M_date_time_era_format; | |
| const _CharT* _M_am; | |
| const _CharT* _M_pm; | |
| const _CharT* _M_am_pm_format; | |
| const _CharT* _M_day1; | |
| const _CharT* _M_day2; | |
| const _CharT* _M_day3; | |
| const _CharT* _M_day4; | |
| const _CharT* _M_day5; | |
| const _CharT* _M_day6; | |
| const _CharT* _M_day7; | |
| const _CharT* _M_aday1; | |
| const _CharT* _M_aday2; | |
| const _CharT* _M_aday3; | |
| const _CharT* _M_aday4; | |
| const _CharT* _M_aday5; | |
| const _CharT* _M_aday6; | |
| const _CharT* _M_aday7; | |
| const _CharT* _M_month01; | |
| const _CharT* _M_month02; | |
| const _CharT* _M_month03; | |
| const _CharT* _M_month04; | |
| const _CharT* _M_month05; | |
| const _CharT* _M_month06; | |
| const _CharT* _M_month07; | |
| const _CharT* _M_month08; | |
| const _CharT* _M_month09; | |
| const _CharT* _M_month10; | |
| const _CharT* _M_month11; | |
| const _CharT* _M_month12; | |
| const _CharT* _M_amonth01; | |
| const _CharT* _M_amonth02; | |
| const _CharT* _M_amonth03; | |
| const _CharT* _M_amonth04; | |
| const _CharT* _M_amonth05; | |
| const _CharT* _M_amonth06; | |
| const _CharT* _M_amonth07; | |
| const _CharT* _M_amonth08; | |
| const _CharT* _M_amonth09; | |
| const _CharT* _M_amonth10; | |
| const _CharT* _M_amonth11; | |
| const _CharT* _M_amonth12; | |
| bool _M_allocated; | |
| __timepunct_cache(size_t __refs = 0) : facet(__refs), | |
| _M_date_format(0), _M_date_era_format(0), _M_time_format(0), | |
| _M_time_era_format(0), _M_date_time_format(0), | |
| _M_date_time_era_format(0), _M_am(0), _M_pm(0), | |
| _M_am_pm_format(0), _M_day1(0), _M_day2(0), _M_day3(0), | |
| _M_day4(0), _M_day5(0), _M_day6(0), _M_day7(0), | |
| _M_aday1(0), _M_aday2(0), _M_aday3(0), _M_aday4(0), | |
| _M_aday5(0), _M_aday6(0), _M_aday7(0), _M_month01(0), | |
| _M_month02(0), _M_month03(0), _M_month04(0), _M_month05(0), | |
| _M_month06(0), _M_month07(0), _M_month08(0), _M_month09(0), | |
| _M_month10(0), _M_month11(0), _M_month12(0), _M_amonth01(0), | |
| _M_amonth02(0), _M_amonth03(0), _M_amonth04(0), | |
| _M_amonth05(0), _M_amonth06(0), _M_amonth07(0), | |
| _M_amonth08(0), _M_amonth09(0), _M_amonth10(0), | |
| _M_amonth11(0), _M_amonth12(0), _M_allocated(false) | |
| { } | |
| ~__timepunct_cache(); | |
| private: | |
| __timepunct_cache& | |
| operator=(const __timepunct_cache&); | |
| explicit | |
| __timepunct_cache(const __timepunct_cache&); | |
| }; | |
| template<typename _CharT> | |
| __timepunct_cache<_CharT>::~__timepunct_cache() | |
| { | |
| if (_M_allocated) | |
| { | |
| } | |
| } | |
| template<> | |
| const char* | |
| __timepunct_cache<char>::_S_timezones[14]; | |
| template<> | |
| const wchar_t* | |
| __timepunct_cache<wchar_t>::_S_timezones[14]; | |
| template<typename _CharT> | |
| const _CharT* __timepunct_cache<_CharT>::_S_timezones[14]; | |
| template<typename _CharT> | |
| class __timepunct : public locale::facet | |
| { | |
| public: | |
| typedef _CharT __char_type; | |
| typedef __timepunct_cache<_CharT> __cache_type; | |
| protected: | |
| __cache_type* _M_data; | |
| __c_locale _M_c_locale_timepunct; | |
| const char* _M_name_timepunct; | |
| public: | |
| static locale::id id; | |
| explicit | |
| __timepunct(size_t __refs = 0); | |
| explicit | |
| __timepunct(__cache_type* __cache, size_t __refs = 0); | |
| # 206 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0); | |
| void | |
| _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format, | |
| const tm* __tm) const throw (); | |
| void | |
| _M_date_formats(const _CharT** __date) const | |
| { | |
| __date[0] = _M_data->_M_date_format; | |
| __date[1] = _M_data->_M_date_era_format; | |
| } | |
| void | |
| _M_time_formats(const _CharT** __time) const | |
| { | |
| __time[0] = _M_data->_M_time_format; | |
| __time[1] = _M_data->_M_time_era_format; | |
| } | |
| void | |
| _M_date_time_formats(const _CharT** __dt) const | |
| { | |
| __dt[0] = _M_data->_M_date_time_format; | |
| __dt[1] = _M_data->_M_date_time_era_format; | |
| } | |
| void | |
| _M_am_pm_format(const _CharT*) const | |
| { } | |
| void | |
| _M_am_pm(const _CharT** __ampm) const | |
| { | |
| __ampm[0] = _M_data->_M_am; | |
| __ampm[1] = _M_data->_M_pm; | |
| } | |
| void | |
| _M_days(const _CharT** __days) const | |
| { | |
| __days[0] = _M_data->_M_day1; | |
| __days[1] = _M_data->_M_day2; | |
| __days[2] = _M_data->_M_day3; | |
| __days[3] = _M_data->_M_day4; | |
| __days[4] = _M_data->_M_day5; | |
| __days[5] = _M_data->_M_day6; | |
| __days[6] = _M_data->_M_day7; | |
| } | |
| void | |
| _M_days_abbreviated(const _CharT** __days) const | |
| { | |
| __days[0] = _M_data->_M_aday1; | |
| __days[1] = _M_data->_M_aday2; | |
| __days[2] = _M_data->_M_aday3; | |
| __days[3] = _M_data->_M_aday4; | |
| __days[4] = _M_data->_M_aday5; | |
| __days[5] = _M_data->_M_aday6; | |
| __days[6] = _M_data->_M_aday7; | |
| } | |
| void | |
| _M_months(const _CharT** __months) const | |
| { | |
| __months[0] = _M_data->_M_month01; | |
| __months[1] = _M_data->_M_month02; | |
| __months[2] = _M_data->_M_month03; | |
| __months[3] = _M_data->_M_month04; | |
| __months[4] = _M_data->_M_month05; | |
| __months[5] = _M_data->_M_month06; | |
| __months[6] = _M_data->_M_month07; | |
| __months[7] = _M_data->_M_month08; | |
| __months[8] = _M_data->_M_month09; | |
| __months[9] = _M_data->_M_month10; | |
| __months[10] = _M_data->_M_month11; | |
| __months[11] = _M_data->_M_month12; | |
| } | |
| void | |
| _M_months_abbreviated(const _CharT** __months) const | |
| { | |
| __months[0] = _M_data->_M_amonth01; | |
| __months[1] = _M_data->_M_amonth02; | |
| __months[2] = _M_data->_M_amonth03; | |
| __months[3] = _M_data->_M_amonth04; | |
| __months[4] = _M_data->_M_amonth05; | |
| __months[5] = _M_data->_M_amonth06; | |
| __months[6] = _M_data->_M_amonth07; | |
| __months[7] = _M_data->_M_amonth08; | |
| __months[8] = _M_data->_M_amonth09; | |
| __months[9] = _M_data->_M_amonth10; | |
| __months[10] = _M_data->_M_amonth11; | |
| __months[11] = _M_data->_M_amonth12; | |
| } | |
| protected: | |
| virtual | |
| ~__timepunct(); | |
| void | |
| _M_initialize_timepunct(__c_locale __cloc = 0); | |
| }; | |
| template<typename _CharT> | |
| locale::id __timepunct<_CharT>::id; | |
| template<> | |
| void | |
| __timepunct<char>::_M_initialize_timepunct(__c_locale __cloc); | |
| template<> | |
| void | |
| __timepunct<char>::_M_put(char*, size_t, const char*, const tm*) const throw (); | |
| template<> | |
| void | |
| __timepunct<wchar_t>::_M_initialize_timepunct(__c_locale __cloc); | |
| template<> | |
| void | |
| __timepunct<wchar_t>::_M_put(wchar_t*, size_t, const wchar_t*, | |
| const tm*) const throw (); | |
| } | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/time_members.h" 1 3 | |
| # 37 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/time_members.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT> | |
| __timepunct<_CharT>::__timepunct(size_t __refs) | |
| : facet(__refs), _M_data(0) | |
| { | |
| _M_name_timepunct = _S_get_c_name(); | |
| _M_initialize_timepunct(); | |
| } | |
| template<typename _CharT> | |
| __timepunct<_CharT>::__timepunct(__cache_type* __cache, size_t __refs) | |
| : facet(__refs), _M_data(__cache) | |
| { | |
| _M_name_timepunct = _S_get_c_name(); | |
| _M_initialize_timepunct(); | |
| } | |
| template<typename _CharT> | |
| __timepunct<_CharT>::__timepunct(__c_locale __cloc, const char* __s, | |
| size_t __refs) | |
| : facet(__refs), _M_data(0) | |
| { | |
| if (__builtin_strcmp(__s, _S_get_c_name()) != 0) | |
| { | |
| const size_t __len = __builtin_strlen(__s) + 1; | |
| char* __tmp = new char[__len]; | |
| __builtin_memcpy(__tmp, __s, __len); | |
| _M_name_timepunct = __tmp; | |
| } | |
| else | |
| _M_name_timepunct = _S_get_c_name(); | |
| if (true) | |
| { _M_initialize_timepunct(__cloc); } | |
| if (false) | |
| { | |
| if (_M_name_timepunct != _S_get_c_name()) | |
| delete [] _M_name_timepunct; | |
| ; | |
| } | |
| } | |
| template<typename _CharT> | |
| __timepunct<_CharT>::~__timepunct() | |
| { | |
| if (_M_name_timepunct != _S_get_c_name()) | |
| delete [] _M_name_timepunct; | |
| delete _M_data; | |
| _S_destroy_c_locale(_M_c_locale_timepunct); | |
| } | |
| } | |
| # 347 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 2 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| namespace __cxx11 { | |
| # 367 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<typename _CharT, typename _InIter> | |
| class time_get : public locale::facet, public time_base | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _InIter iter_type; | |
| static locale::id id; | |
| # 388 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| time_get(size_t __refs = 0) | |
| : facet (__refs) { } | |
| # 405 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| dateorder | |
| date_order() const | |
| { return this->do_date_order(); } | |
| # 429 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get_time(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const | |
| { return this->do_get_time(__beg, __end, __io, __err, __tm); } | |
| # 454 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get_date(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const | |
| { return this->do_get_date(__beg, __end, __io, __err, __tm); } | |
| # 482 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get_weekday(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const | |
| { return this->do_get_weekday(__beg, __end, __io, __err, __tm); } | |
| # 511 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get_monthname(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const | |
| { return this->do_get_monthname(__beg, __end, __io, __err, __tm); } | |
| # 537 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get_year(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const | |
| { return this->do_get_year(__beg, __end, __io, __err, __tm); } | |
| # 558 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| inline | |
| iter_type get(iter_type __s, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm, char __format, | |
| char __modifier = 0) const | |
| { | |
| return this->do_get(__s, __end, __io, __err, __tm, __format, | |
| __modifier); | |
| } | |
| # 585 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type get(iter_type __s, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm, const char_type* __fmt, | |
| const char_type* __fmtend) const; | |
| protected: | |
| virtual | |
| ~time_get() { } | |
| # 605 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual dateorder | |
| do_date_order() const; | |
| # 623 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get_time(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const; | |
| # 642 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get_date(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const; | |
| # 661 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get_weekday(iter_type __beg, iter_type __end, ios_base&, | |
| ios_base::iostate& __err, tm* __tm) const; | |
| # 680 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get_monthname(iter_type __beg, iter_type __end, ios_base&, | |
| ios_base::iostate& __err, tm* __tm) const; | |
| # 699 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get_year(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm) const; | |
| # 722 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual | |
| iter_type | |
| do_get(iter_type __s, iter_type __end, ios_base& __f, | |
| ios_base::iostate& __err, tm* __tm, | |
| char __format, char __modifier) const; | |
| iter_type | |
| _M_extract_num(iter_type __beg, iter_type __end, int& __member, | |
| int __min, int __max, size_t __len, | |
| ios_base& __io, ios_base::iostate& __err) const; | |
| iter_type | |
| _M_extract_name(iter_type __beg, iter_type __end, int& __member, | |
| const _CharT** __names, size_t __indexlen, | |
| ios_base& __io, ios_base::iostate& __err) const; | |
| iter_type | |
| _M_extract_wday_or_month(iter_type __beg, iter_type __end, int& __member, | |
| const _CharT** __names, size_t __indexlen, | |
| ios_base& __io, ios_base::iostate& __err) const; | |
| iter_type | |
| _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm, | |
| const _CharT* __format) const; | |
| }; | |
| template<typename _CharT, typename _InIter> | |
| locale::id time_get<_CharT, _InIter>::id; | |
| template<typename _CharT, typename _InIter> | |
| class time_get_byname : public time_get<_CharT, _InIter> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _InIter iter_type; | |
| explicit | |
| time_get_byname(const char*, size_t __refs = 0) | |
| : time_get<_CharT, _InIter>(__refs) { } | |
| explicit | |
| time_get_byname(const string& __s, size_t __refs = 0) | |
| : time_get_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~time_get_byname() { } | |
| }; | |
| } | |
| # 796 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<typename _CharT, typename _OutIter> | |
| class time_put : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _OutIter iter_type; | |
| static locale::id id; | |
| # 817 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| time_put(size_t __refs = 0) | |
| : facet(__refs) { } | |
| # 836 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, | |
| const _CharT* __beg, const _CharT* __end) const; | |
| # 856 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| put(iter_type __s, ios_base& __io, char_type __fill, | |
| const tm* __tm, char __format, char __mod = 0) const | |
| { return this->do_put(__s, __io, __fill, __tm, __format, __mod); } | |
| protected: | |
| virtual | |
| ~time_put() | |
| { } | |
| # 883 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, | |
| char __format, char __mod) const; | |
| }; | |
| template<typename _CharT, typename _OutIter> | |
| locale::id time_put<_CharT, _OutIter>::id; | |
| template<typename _CharT, typename _OutIter> | |
| class time_put_byname : public time_put<_CharT, _OutIter> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _OutIter iter_type; | |
| explicit | |
| time_put_byname(const char*, size_t __refs = 0) | |
| : time_put<_CharT, _OutIter>(__refs) | |
| { } | |
| explicit | |
| time_put_byname(const string& __s, size_t __refs = 0) | |
| : time_put_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~time_put_byname() { } | |
| }; | |
| # 928 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| class money_base | |
| { | |
| public: | |
| enum part { none, space, symbol, sign, value }; | |
| struct pattern { char field[4]; }; | |
| static const pattern _S_default_pattern; | |
| enum | |
| { | |
| _S_minus, | |
| _S_zero, | |
| _S_end = 11 | |
| }; | |
| static const char* _S_atoms; | |
| __attribute__ ((__const__)) static pattern | |
| _S_construct_pattern(char __precedes, char __space, char __posn) throw (); | |
| }; | |
| template<typename _CharT, bool _Intl> | |
| struct __moneypunct_cache : public locale::facet | |
| { | |
| const char* _M_grouping; | |
| size_t _M_grouping_size; | |
| bool _M_use_grouping; | |
| _CharT _M_decimal_point; | |
| _CharT _M_thousands_sep; | |
| const _CharT* _M_curr_symbol; | |
| size_t _M_curr_symbol_size; | |
| const _CharT* _M_positive_sign; | |
| size_t _M_positive_sign_size; | |
| const _CharT* _M_negative_sign; | |
| size_t _M_negative_sign_size; | |
| int _M_frac_digits; | |
| money_base::pattern _M_pos_format; | |
| money_base::pattern _M_neg_format; | |
| _CharT _M_atoms[money_base::_S_end]; | |
| bool _M_allocated; | |
| __moneypunct_cache(size_t __refs = 0) : facet(__refs), | |
| _M_grouping(0), _M_grouping_size(0), _M_use_grouping(false), | |
| _M_decimal_point(_CharT()), _M_thousands_sep(_CharT()), | |
| _M_curr_symbol(0), _M_curr_symbol_size(0), | |
| _M_positive_sign(0), _M_positive_sign_size(0), | |
| _M_negative_sign(0), _M_negative_sign_size(0), | |
| _M_frac_digits(0), | |
| _M_pos_format(money_base::pattern()), | |
| _M_neg_format(money_base::pattern()), _M_allocated(false) | |
| { } | |
| ~__moneypunct_cache(); | |
| void | |
| _M_cache(const locale& __loc); | |
| private: | |
| __moneypunct_cache& | |
| operator=(const __moneypunct_cache&); | |
| explicit | |
| __moneypunct_cache(const __moneypunct_cache&); | |
| }; | |
| template<typename _CharT, bool _Intl> | |
| __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache() | |
| { | |
| if (_M_allocated) | |
| { | |
| delete [] _M_grouping; | |
| delete [] _M_curr_symbol; | |
| delete [] _M_positive_sign; | |
| delete [] _M_negative_sign; | |
| } | |
| } | |
| namespace __cxx11 { | |
| # 1023 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<typename _CharT, bool _Intl> | |
| class moneypunct : public locale::facet, public money_base | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| typedef __moneypunct_cache<_CharT, _Intl> __cache_type; | |
| private: | |
| __cache_type* _M_data; | |
| public: | |
| static const bool intl = _Intl; | |
| static locale::id id; | |
| # 1052 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| moneypunct(size_t __refs = 0) | |
| : facet(__refs), _M_data(0) | |
| { _M_initialize_moneypunct(); } | |
| # 1065 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| moneypunct(__cache_type* __cache, size_t __refs = 0) | |
| : facet(__refs), _M_data(__cache) | |
| { _M_initialize_moneypunct(); } | |
| # 1080 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0) | |
| : facet(__refs), _M_data(0) | |
| { _M_initialize_moneypunct(__cloc, __s); } | |
| # 1094 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| char_type | |
| decimal_point() const | |
| { return this->do_decimal_point(); } | |
| # 1107 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| char_type | |
| thousands_sep() const | |
| { return this->do_thousands_sep(); } | |
| # 1137 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| string | |
| grouping() const | |
| { return this->do_grouping(); } | |
| # 1150 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| string_type | |
| curr_symbol() const | |
| { return this->do_curr_symbol(); } | |
| # 1167 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| string_type | |
| positive_sign() const | |
| { return this->do_positive_sign(); } | |
| # 1184 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| string_type | |
| negative_sign() const | |
| { return this->do_negative_sign(); } | |
| # 1200 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| int | |
| frac_digits() const | |
| { return this->do_frac_digits(); } | |
| # 1236 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| pattern | |
| pos_format() const | |
| { return this->do_pos_format(); } | |
| pattern | |
| neg_format() const | |
| { return this->do_neg_format(); } | |
| protected: | |
| virtual | |
| ~moneypunct(); | |
| # 1258 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual char_type | |
| do_decimal_point() const | |
| { return _M_data->_M_decimal_point; } | |
| # 1270 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual char_type | |
| do_thousands_sep() const | |
| { return _M_data->_M_thousands_sep; } | |
| # 1283 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual string | |
| do_grouping() const | |
| { return _M_data->_M_grouping; } | |
| # 1296 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual string_type | |
| do_curr_symbol() const | |
| { return _M_data->_M_curr_symbol; } | |
| # 1309 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual string_type | |
| do_positive_sign() const | |
| { return _M_data->_M_positive_sign; } | |
| # 1322 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual string_type | |
| do_negative_sign() const | |
| { return _M_data->_M_negative_sign; } | |
| # 1336 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual int | |
| do_frac_digits() const | |
| { return _M_data->_M_frac_digits; } | |
| # 1350 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual pattern | |
| do_pos_format() const | |
| { return _M_data->_M_pos_format; } | |
| # 1364 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual pattern | |
| do_neg_format() const | |
| { return _M_data->_M_neg_format; } | |
| void | |
| _M_initialize_moneypunct(__c_locale __cloc = 0, | |
| const char* __name = 0); | |
| }; | |
| template<typename _CharT, bool _Intl> | |
| locale::id moneypunct<_CharT, _Intl>::id; | |
| template<typename _CharT, bool _Intl> | |
| const bool moneypunct<_CharT, _Intl>::intl; | |
| template<> | |
| moneypunct<char, true>::~moneypunct(); | |
| template<> | |
| moneypunct<char, false>::~moneypunct(); | |
| template<> | |
| void | |
| moneypunct<char, true>::_M_initialize_moneypunct(__c_locale, const char*); | |
| template<> | |
| void | |
| moneypunct<char, false>::_M_initialize_moneypunct(__c_locale, const char*); | |
| template<> | |
| moneypunct<wchar_t, true>::~moneypunct(); | |
| template<> | |
| moneypunct<wchar_t, false>::~moneypunct(); | |
| template<> | |
| void | |
| moneypunct<wchar_t, true>::_M_initialize_moneypunct(__c_locale, | |
| const char*); | |
| template<> | |
| void | |
| moneypunct<wchar_t, false>::_M_initialize_moneypunct(__c_locale, | |
| const char*); | |
| template<typename _CharT, bool _Intl> | |
| class moneypunct_byname : public moneypunct<_CharT, _Intl> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| static const bool intl = _Intl; | |
| explicit | |
| moneypunct_byname(const char* __s, size_t __refs = 0) | |
| : moneypunct<_CharT, _Intl>(__refs) | |
| { | |
| if (__builtin_strcmp(__s, "C") != 0 | |
| && __builtin_strcmp(__s, "POSIX") != 0) | |
| { | |
| __c_locale __tmp; | |
| this->_S_create_c_locale(__tmp, __s); | |
| this->_M_initialize_moneypunct(__tmp); | |
| this->_S_destroy_c_locale(__tmp); | |
| } | |
| } | |
| explicit | |
| moneypunct_byname(const string& __s, size_t __refs = 0) | |
| : moneypunct_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~moneypunct_byname() { } | |
| }; | |
| template<typename _CharT, bool _Intl> | |
| const bool moneypunct_byname<_CharT, _Intl>::intl; | |
| } | |
| namespace __cxx11 { | |
| # 1467 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<typename _CharT, typename _InIter> | |
| class money_get : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _InIter iter_type; | |
| typedef basic_string<_CharT> string_type; | |
| static locale::id id; | |
| # 1489 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| money_get(size_t __refs = 0) : facet(__refs) { } | |
| # 1519 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, | |
| ios_base::iostate& __err, long double& __units) const | |
| { return this->do_get(__s, __end, __intl, __io, __err, __units); } | |
| # 1550 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, | |
| ios_base::iostate& __err, string_type& __digits) const | |
| { return this->do_get(__s, __end, __intl, __io, __err, __digits); } | |
| protected: | |
| virtual | |
| ~money_get() { } | |
| # 1574 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, | |
| ios_base::iostate& __err, long double& __units) const; | |
| # 1586 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, | |
| ios_base::iostate& __err, string_type& __digits) const; | |
| # 1598 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<bool _Intl> | |
| iter_type | |
| _M_extract(iter_type __s, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, string& __digits) const; | |
| }; | |
| template<typename _CharT, typename _InIter> | |
| locale::id money_get<_CharT, _InIter>::id; | |
| # 1620 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<typename _CharT, typename _OutIter> | |
| class money_put : public locale::facet | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef _OutIter iter_type; | |
| typedef basic_string<_CharT> string_type; | |
| static locale::id id; | |
| # 1641 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| money_put(size_t __refs = 0) : facet(__refs) { } | |
| # 1661 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| put(iter_type __s, bool __intl, ios_base& __io, | |
| char_type __fill, long double __units) const | |
| { return this->do_put(__s, __intl, __io, __fill, __units); } | |
| # 1684 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| iter_type | |
| put(iter_type __s, bool __intl, ios_base& __io, | |
| char_type __fill, const string_type& __digits) const | |
| { return this->do_put(__s, __intl, __io, __fill, __digits); } | |
| protected: | |
| virtual | |
| ~money_put() { } | |
| # 1719 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, | |
| long double __units) const; | |
| # 1743 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual iter_type | |
| do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, | |
| const string_type& __digits) const; | |
| # 1755 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<bool _Intl> | |
| iter_type | |
| _M_insert(iter_type __s, ios_base& __io, char_type __fill, | |
| const string_type& __digits) const; | |
| }; | |
| template<typename _CharT, typename _OutIter> | |
| locale::id money_put<_CharT, _OutIter>::id; | |
| } | |
| struct messages_base | |
| { | |
| typedef int catalog; | |
| }; | |
| namespace __cxx11 { | |
| # 1798 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| template<typename _CharT> | |
| class messages : public locale::facet, public messages_base | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| protected: | |
| __c_locale _M_c_locale_messages; | |
| const char* _M_name_messages; | |
| public: | |
| static locale::id id; | |
| # 1826 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| messages(size_t __refs = 0); | |
| # 1840 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| explicit | |
| messages(__c_locale __cloc, const char* __s, size_t __refs = 0); | |
| # 1853 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| catalog | |
| open(const basic_string<char>& __s, const locale& __loc) const | |
| { return this->do_open(__s, __loc); } | |
| # 1871 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| catalog | |
| open(const basic_string<char>&, const locale&, const char*) const; | |
| # 1889 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| string_type | |
| get(catalog __c, int __set, int __msgid, const string_type& __s) const | |
| { return this->do_get(__c, __set, __msgid, __s); } | |
| # 1900 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| void | |
| close(catalog __c) const | |
| { return this->do_close(__c); } | |
| protected: | |
| virtual | |
| ~messages(); | |
| # 1920 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual catalog | |
| do_open(const basic_string<char>&, const locale&) const; | |
| # 1939 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 3 | |
| virtual string_type | |
| do_get(catalog, int, int, const string_type& __dfault) const; | |
| virtual void | |
| do_close(catalog) const; | |
| char* | |
| _M_convert_to_char(const string_type& __msg) const | |
| { | |
| return reinterpret_cast<char*>(const_cast<_CharT*>(__msg.c_str())); | |
| } | |
| string_type | |
| _M_convert_from_char(char*) const | |
| { | |
| return string_type(); | |
| } | |
| }; | |
| template<typename _CharT> | |
| locale::id messages<_CharT>::id; | |
| template<> | |
| string | |
| messages<char>::do_get(catalog, int, int, const string&) const; | |
| template<> | |
| wstring | |
| messages<wchar_t>::do_get(catalog, int, int, const wstring&) const; | |
| template<typename _CharT> | |
| class messages_byname : public messages<_CharT> | |
| { | |
| public: | |
| typedef _CharT char_type; | |
| typedef basic_string<_CharT> string_type; | |
| explicit | |
| messages_byname(const char* __s, size_t __refs = 0); | |
| explicit | |
| messages_byname(const string& __s, size_t __refs = 0) | |
| : messages_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~messages_byname() | |
| { } | |
| }; | |
| } | |
| } | |
| # 1 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/messages_members.h" 1 3 | |
| # 36 "/usr/sgug/include/c++/9/mips-sgi-irix6.5/bits/messages_members.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT> | |
| messages<_CharT>::messages(size_t __refs) | |
| : facet(__refs) | |
| { _M_c_locale_messages = _S_get_c_locale(); } | |
| template<typename _CharT> | |
| messages<_CharT>::messages(__c_locale, const char*, size_t __refs) | |
| : facet(__refs) | |
| { _M_c_locale_messages = _S_get_c_locale(); } | |
| template<typename _CharT> | |
| typename messages<_CharT>::catalog | |
| messages<_CharT>::open(const basic_string<char>& __s, const locale& __loc, | |
| const char*) const | |
| { return this->do_open(__s, __loc); } | |
| template<typename _CharT> | |
| messages<_CharT>::~messages() | |
| { _S_destroy_c_locale(_M_c_locale_messages); } | |
| template<typename _CharT> | |
| typename messages<_CharT>::catalog | |
| messages<_CharT>::do_open(const basic_string<char>&, const locale&) const | |
| { return 0; } | |
| template<typename _CharT> | |
| typename messages<_CharT>::string_type | |
| messages<_CharT>::do_get(catalog, int, int, | |
| const string_type& __dfault) const | |
| { return __dfault; } | |
| template<typename _CharT> | |
| void | |
| messages<_CharT>::do_close(catalog) const | |
| { } | |
| template<typename _CharT> | |
| messages_byname<_CharT>::messages_byname(const char* __s, size_t __refs) | |
| : messages<_CharT>(__refs) | |
| { | |
| if (__builtin_strcmp(__s, "C") != 0 | |
| && __builtin_strcmp(__s, "POSIX") != 0) | |
| { | |
| this->_S_destroy_c_locale(this->_M_c_locale_messages); | |
| this->_S_create_c_locale(this->_M_c_locale_messages, __s); | |
| } | |
| } | |
| } | |
| # 2011 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/codecvt.h" 1 3 | |
| # 39 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| # 40 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| class codecvt_base | |
| { | |
| public: | |
| enum result | |
| { | |
| ok, | |
| partial, | |
| error, | |
| noconv | |
| }; | |
| }; | |
| # 67 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| template<typename _InternT, typename _ExternT, typename _StateT> | |
| class __codecvt_abstract_base | |
| : public locale::facet, public codecvt_base | |
| { | |
| public: | |
| typedef codecvt_base::result result; | |
| typedef _InternT intern_type; | |
| typedef _ExternT extern_type; | |
| typedef _StateT state_type; | |
| # 115 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| result | |
| out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const | |
| { | |
| return this->do_out(__state, __from, __from_end, __from_next, | |
| __to, __to_end, __to_next); | |
| } | |
| # 154 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| result | |
| unshift(state_type& __state, extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const | |
| { return this->do_unshift(__state, __to,__to_end,__to_next); } | |
| # 195 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| result | |
| in(state_type& __state, const extern_type* __from, | |
| const extern_type* __from_end, const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const | |
| { | |
| return this->do_in(__state, __from, __from_end, __from_next, | |
| __to, __to_end, __to_next); | |
| } | |
| int | |
| encoding() const throw() | |
| { return this->do_encoding(); } | |
| bool | |
| always_noconv() const throw() | |
| { return this->do_always_noconv(); } | |
| int | |
| length(state_type& __state, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const | |
| { return this->do_length(__state, __from, __end, __max); } | |
| int | |
| max_length() const throw() | |
| { return this->do_max_length(); } | |
| protected: | |
| explicit | |
| __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { } | |
| virtual | |
| ~__codecvt_abstract_base() { } | |
| # 236 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| virtual result | |
| do_out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const = 0; | |
| virtual result | |
| do_unshift(state_type& __state, extern_type* __to, | |
| extern_type* __to_end, extern_type*& __to_next) const = 0; | |
| virtual result | |
| do_in(state_type& __state, const extern_type* __from, | |
| const extern_type* __from_end, const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const = 0; | |
| virtual int | |
| do_encoding() const throw() = 0; | |
| virtual bool | |
| do_always_noconv() const throw() = 0; | |
| virtual int | |
| do_length(state_type&, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const = 0; | |
| virtual int | |
| do_max_length() const throw() = 0; | |
| }; | |
| # 273 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| template<typename _InternT, typename _ExternT, typename _StateT> | |
| class codecvt | |
| : public __codecvt_abstract_base<_InternT, _ExternT, _StateT> | |
| { | |
| public: | |
| typedef codecvt_base::result result; | |
| typedef _InternT intern_type; | |
| typedef _ExternT extern_type; | |
| typedef _StateT state_type; | |
| protected: | |
| __c_locale _M_c_locale_codecvt; | |
| public: | |
| static locale::id id; | |
| explicit | |
| codecvt(size_t __refs = 0) | |
| : __codecvt_abstract_base<_InternT, _ExternT, _StateT> (__refs), | |
| _M_c_locale_codecvt(0) | |
| { } | |
| explicit | |
| codecvt(__c_locale __cloc, size_t __refs = 0); | |
| protected: | |
| virtual | |
| ~codecvt() { } | |
| virtual result | |
| do_out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_unshift(state_type& __state, extern_type* __to, | |
| extern_type* __to_end, extern_type*& __to_next) const; | |
| virtual result | |
| do_in(state_type& __state, const extern_type* __from, | |
| const extern_type* __from_end, const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const; | |
| virtual int | |
| do_encoding() const throw(); | |
| virtual bool | |
| do_always_noconv() const throw(); | |
| virtual int | |
| do_length(state_type&, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const; | |
| virtual int | |
| do_max_length() const throw(); | |
| }; | |
| template<typename _InternT, typename _ExternT, typename _StateT> | |
| locale::id codecvt<_InternT, _ExternT, _StateT>::id; | |
| template<> | |
| class codecvt<char, char, mbstate_t> | |
| : public __codecvt_abstract_base<char, char, mbstate_t> | |
| { | |
| friend class messages<char>; | |
| public: | |
| typedef char intern_type; | |
| typedef char extern_type; | |
| typedef mbstate_t state_type; | |
| protected: | |
| __c_locale _M_c_locale_codecvt; | |
| public: | |
| static locale::id id; | |
| explicit | |
| codecvt(size_t __refs = 0); | |
| explicit | |
| codecvt(__c_locale __cloc, size_t __refs = 0); | |
| protected: | |
| virtual | |
| ~codecvt(); | |
| virtual result | |
| do_out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_unshift(state_type& __state, extern_type* __to, | |
| extern_type* __to_end, extern_type*& __to_next) const; | |
| virtual result | |
| do_in(state_type& __state, const extern_type* __from, | |
| const extern_type* __from_end, const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const; | |
| virtual int | |
| do_encoding() const throw(); | |
| virtual bool | |
| do_always_noconv() const throw(); | |
| virtual int | |
| do_length(state_type&, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const; | |
| virtual int | |
| do_max_length() const throw(); | |
| }; | |
| template<> | |
| class codecvt<wchar_t, char, mbstate_t> | |
| : public __codecvt_abstract_base<wchar_t, char, mbstate_t> | |
| { | |
| friend class messages<wchar_t>; | |
| public: | |
| typedef wchar_t intern_type; | |
| typedef char extern_type; | |
| typedef mbstate_t state_type; | |
| protected: | |
| __c_locale _M_c_locale_codecvt; | |
| public: | |
| static locale::id id; | |
| explicit | |
| codecvt(size_t __refs = 0); | |
| explicit | |
| codecvt(__c_locale __cloc, size_t __refs = 0); | |
| protected: | |
| virtual | |
| ~codecvt(); | |
| virtual result | |
| do_out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_unshift(state_type& __state, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_in(state_type& __state, | |
| const extern_type* __from, const extern_type* __from_end, | |
| const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const; | |
| virtual | |
| int do_encoding() const throw(); | |
| virtual | |
| bool do_always_noconv() const throw(); | |
| virtual | |
| int do_length(state_type&, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const; | |
| virtual int | |
| do_max_length() const throw(); | |
| }; | |
| template<> | |
| class codecvt<char16_t, char, mbstate_t> | |
| : public __codecvt_abstract_base<char16_t, char, mbstate_t> | |
| { | |
| public: | |
| typedef char16_t intern_type; | |
| typedef char extern_type; | |
| typedef mbstate_t state_type; | |
| public: | |
| static locale::id id; | |
| explicit | |
| codecvt(size_t __refs = 0) | |
| : __codecvt_abstract_base<char16_t, char, mbstate_t>(__refs) { } | |
| protected: | |
| virtual | |
| ~codecvt(); | |
| virtual result | |
| do_out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_unshift(state_type& __state, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_in(state_type& __state, | |
| const extern_type* __from, const extern_type* __from_end, | |
| const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const; | |
| virtual | |
| int do_encoding() const throw(); | |
| virtual | |
| bool do_always_noconv() const throw(); | |
| virtual | |
| int do_length(state_type&, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const; | |
| virtual int | |
| do_max_length() const throw(); | |
| }; | |
| template<> | |
| class codecvt<char32_t, char, mbstate_t> | |
| : public __codecvt_abstract_base<char32_t, char, mbstate_t> | |
| { | |
| public: | |
| typedef char32_t intern_type; | |
| typedef char extern_type; | |
| typedef mbstate_t state_type; | |
| public: | |
| static locale::id id; | |
| explicit | |
| codecvt(size_t __refs = 0) | |
| : __codecvt_abstract_base<char32_t, char, mbstate_t>(__refs) { } | |
| protected: | |
| virtual | |
| ~codecvt(); | |
| virtual result | |
| do_out(state_type& __state, const intern_type* __from, | |
| const intern_type* __from_end, const intern_type*& __from_next, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_unshift(state_type& __state, | |
| extern_type* __to, extern_type* __to_end, | |
| extern_type*& __to_next) const; | |
| virtual result | |
| do_in(state_type& __state, | |
| const extern_type* __from, const extern_type* __from_end, | |
| const extern_type*& __from_next, | |
| intern_type* __to, intern_type* __to_end, | |
| intern_type*& __to_next) const; | |
| virtual | |
| int do_encoding() const throw(); | |
| virtual | |
| bool do_always_noconv() const throw(); | |
| virtual | |
| int do_length(state_type&, const extern_type* __from, | |
| const extern_type* __end, size_t __max) const; | |
| virtual int | |
| do_max_length() const throw(); | |
| }; | |
| # 695 "/usr/sgug/include/c++/9/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* __s, size_t __refs = 0) | |
| : codecvt<_InternT, _ExternT, _StateT>(__refs) | |
| { | |
| if (__builtin_strcmp(__s, "C") != 0 | |
| && __builtin_strcmp(__s, "POSIX") != 0) | |
| { | |
| this->_S_destroy_c_locale(this->_M_c_locale_codecvt); | |
| this->_S_create_c_locale(this->_M_c_locale_codecvt, __s); | |
| } | |
| } | |
| explicit | |
| codecvt_byname(const string& __s, size_t __refs = 0) | |
| : codecvt_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~codecvt_byname() { } | |
| }; | |
| template<> | |
| class codecvt_byname<char16_t, char, mbstate_t> | |
| : public codecvt<char16_t, char, mbstate_t> | |
| { | |
| public: | |
| explicit | |
| codecvt_byname(const char*, size_t __refs = 0) | |
| : codecvt<char16_t, char, mbstate_t>(__refs) { } | |
| explicit | |
| codecvt_byname(const string& __s, size_t __refs = 0) | |
| : codecvt_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~codecvt_byname() { } | |
| }; | |
| template<> | |
| class codecvt_byname<char32_t, char, mbstate_t> | |
| : public codecvt<char32_t, char, mbstate_t> | |
| { | |
| public: | |
| explicit | |
| codecvt_byname(const char*, size_t __refs = 0) | |
| : codecvt<char32_t, char, mbstate_t>(__refs) { } | |
| explicit | |
| codecvt_byname(const string& __s, size_t __refs = 0) | |
| : codecvt_byname(__s.c_str(), __refs) { } | |
| protected: | |
| virtual | |
| ~codecvt_byname() { } | |
| }; | |
| # 802 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| extern template class codecvt_byname<char, char, mbstate_t>; | |
| extern template | |
| const codecvt<char, char, mbstate_t>& | |
| use_facet<codecvt<char, char, mbstate_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<codecvt<char, char, mbstate_t> >(const locale&); | |
| extern template class codecvt_byname<wchar_t, char, mbstate_t>; | |
| extern template | |
| const codecvt<wchar_t, char, mbstate_t>& | |
| use_facet<codecvt<wchar_t, char, mbstate_t> >(const locale&); | |
| extern template | |
| bool | |
| has_facet<codecvt<wchar_t, char, mbstate_t> >(const locale&); | |
| extern template class codecvt_byname<char16_t, char, mbstate_t>; | |
| extern template class codecvt_byname<char32_t, char, mbstate_t>; | |
| # 837 "/usr/sgug/include/c++/9/bits/codecvt.h" 3 | |
| } | |
| # 2014 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.h" 2 3 | |
| # 1 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.tcc" 1 3 | |
| # 33 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.tcc" 3 | |
| # 34 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.tcc" 3 | |
| namespace std __attribute__ ((__visibility__ ("default"))) | |
| { | |
| template<typename _CharT, bool _Intl> | |
| struct __use_cache<__moneypunct_cache<_CharT, _Intl> > | |
| { | |
| const __moneypunct_cache<_CharT, _Intl>* | |
| operator() (const locale& __loc) const | |
| { | |
| const size_t __i = moneypunct<_CharT, _Intl>::id._M_id(); | |
| const locale::facet** __caches = __loc._M_impl->_M_caches; | |
| if (!__caches[__i]) | |
| { | |
| __moneypunct_cache<_CharT, _Intl>* __tmp = 0; | |
| if (true) | |
| { | |
| __tmp = new __moneypunct_cache<_CharT, _Intl>; | |
| __tmp->_M_cache(__loc); | |
| } | |
| if (false) | |
| { | |
| delete __tmp; | |
| ; | |
| } | |
| __loc._M_impl->_M_install_cache(__tmp, __i); | |
| } | |
| return static_cast< | |
| const __moneypunct_cache<_CharT, _Intl>*>(__caches[__i]); | |
| } | |
| }; | |
| template<typename _CharT, bool _Intl> | |
| void | |
| __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc) | |
| { | |
| const moneypunct<_CharT, _Intl>& __mp = | |
| use_facet<moneypunct<_CharT, _Intl> >(__loc); | |
| _M_decimal_point = __mp.decimal_point(); | |
| _M_thousands_sep = __mp.thousands_sep(); | |
| _M_frac_digits = __mp.frac_digits(); | |
| char* __grouping = 0; | |
| _CharT* __curr_symbol = 0; | |
| _CharT* __positive_sign = 0; | |
| _CharT* __negative_sign = 0; | |
| if (true) | |
| { | |
| const string& __g = __mp.grouping(); | |
| _M_grouping_size = __g.size(); | |
| __grouping = new char[_M_grouping_size]; | |
| __g.copy(__grouping, _M_grouping_size); | |
| _M_use_grouping = (_M_grouping_size | |
| && static_cast<signed char>(__grouping[0]) > 0 | |
| && (__grouping[0] | |
| != __gnu_cxx::__numeric_traits<char>::__max)); | |
| const basic_string<_CharT>& __cs = __mp.curr_symbol(); | |
| _M_curr_symbol_size = __cs.size(); | |
| __curr_symbol = new _CharT[_M_curr_symbol_size]; | |
| __cs.copy(__curr_symbol, _M_curr_symbol_size); | |
| const basic_string<_CharT>& __ps = __mp.positive_sign(); | |
| _M_positive_sign_size = __ps.size(); | |
| __positive_sign = new _CharT[_M_positive_sign_size]; | |
| __ps.copy(__positive_sign, _M_positive_sign_size); | |
| const basic_string<_CharT>& __ns = __mp.negative_sign(); | |
| _M_negative_sign_size = __ns.size(); | |
| __negative_sign = new _CharT[_M_negative_sign_size]; | |
| __ns.copy(__negative_sign, _M_negative_sign_size); | |
| _M_pos_format = __mp.pos_format(); | |
| _M_neg_format = __mp.neg_format(); | |
| const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc); | |
| __ct.widen(money_base::_S_atoms, | |
| money_base::_S_atoms + money_base::_S_end, _M_atoms); | |
| _M_grouping = __grouping; | |
| _M_curr_symbol = __curr_symbol; | |
| _M_positive_sign = __positive_sign; | |
| _M_negative_sign = __negative_sign; | |
| _M_allocated = true; | |
| } | |
| if (false) | |
| { | |
| delete [] __grouping; | |
| delete [] __curr_symbol; | |
| delete [] __positive_sign; | |
| delete [] __negative_sign; | |
| ; | |
| } | |
| } | |
| namespace __cxx11 { | |
| template<typename _CharT, typename _InIter> | |
| template<bool _Intl> | |
| _InIter | |
| money_get<_CharT, _InIter>:: | |
| _M_extract(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, string& __units) const | |
| { | |
| typedef char_traits<_CharT> __traits_type; | |
| typedef typename string_type::size_type size_type; | |
| typedef money_base::part part; | |
| typedef __moneypunct_cache<_CharT, _Intl> __cache_type; | |
| const locale& __loc = __io._M_getloc(); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| __use_cache<__cache_type> __uc; | |
| const __cache_type* __lc = __uc(__loc); | |
| const char_type* __lit = __lc->_M_atoms; | |
| bool __negative = false; | |
| size_type __sign_size = 0; | |
| const bool __mandatory_sign = (__lc->_M_positive_sign_size | |
| && __lc->_M_negative_sign_size); | |
| string __grouping_tmp; | |
| if (__lc->_M_use_grouping) | |
| __grouping_tmp.reserve(32); | |
| int __last_pos = 0; | |
| int __n = 0; | |
| bool __testvalid = true; | |
| bool __testdecfound = false; | |
| string __res; | |
| __res.reserve(32); | |
| const char_type* __lit_zero = __lit + money_base::_S_zero; | |
| const money_base::pattern __p = __lc->_M_neg_format; | |
| for (int __i = 0; __i < 4 && __testvalid; ++__i) | |
| { | |
| const part __which = static_cast<part>(__p.field[__i]); | |
| switch (__which) | |
| { | |
| case money_base::symbol: | |
| if (__io.flags() & ios_base::showbase || __sign_size > 1 | |
| || __i == 0 | |
| || (__i == 1 && (__mandatory_sign | |
| || (static_cast<part>(__p.field[0]) | |
| == money_base::sign) | |
| || (static_cast<part>(__p.field[2]) | |
| == money_base::space))) | |
| || (__i == 2 && ((static_cast<part>(__p.field[3]) | |
| == money_base::value) | |
| || (__mandatory_sign | |
| && (static_cast<part>(__p.field[3]) | |
| == money_base::sign))))) | |
| { | |
| const size_type __len = __lc->_M_curr_symbol_size; | |
| size_type __j = 0; | |
| for (; __beg != __end && __j < __len | |
| && *__beg == __lc->_M_curr_symbol[__j]; | |
| ++__beg, (void)++__j); | |
| if (__j != __len | |
| && (__j || __io.flags() & ios_base::showbase)) | |
| __testvalid = false; | |
| } | |
| break; | |
| case money_base::sign: | |
| if (__lc->_M_positive_sign_size && __beg != __end | |
| && *__beg == __lc->_M_positive_sign[0]) | |
| { | |
| __sign_size = __lc->_M_positive_sign_size; | |
| ++__beg; | |
| } | |
| else if (__lc->_M_negative_sign_size && __beg != __end | |
| && *__beg == __lc->_M_negative_sign[0]) | |
| { | |
| __negative = true; | |
| __sign_size = __lc->_M_negative_sign_size; | |
| ++__beg; | |
| } | |
| else if (__lc->_M_positive_sign_size | |
| && !__lc->_M_negative_sign_size) | |
| __negative = true; | |
| else if (__mandatory_sign) | |
| __testvalid = false; | |
| break; | |
| case money_base::value: | |
| for (; __beg != __end; ++__beg) | |
| { | |
| const char_type __c = *__beg; | |
| const char_type* __q = __traits_type::find(__lit_zero, | |
| 10, __c); | |
| if (__q != 0) | |
| { | |
| __res += money_base::_S_atoms[__q - __lit]; | |
| ++__n; | |
| } | |
| else if (__c == __lc->_M_decimal_point | |
| && !__testdecfound) | |
| { | |
| if (__lc->_M_frac_digits <= 0) | |
| break; | |
| __last_pos = __n; | |
| __n = 0; | |
| __testdecfound = true; | |
| } | |
| else if (__lc->_M_use_grouping | |
| && __c == __lc->_M_thousands_sep | |
| && !__testdecfound) | |
| { | |
| if (__n) | |
| { | |
| __grouping_tmp += static_cast<char>(__n); | |
| __n = 0; | |
| } | |
| else | |
| { | |
| __testvalid = false; | |
| break; | |
| } | |
| } | |
| else | |
| break; | |
| } | |
| if (__res.empty()) | |
| __testvalid = false; | |
| break; | |
| case money_base::space: | |
| if (__beg != __end && __ctype.is(ctype_base::space, *__beg)) | |
| ++__beg; | |
| else | |
| __testvalid = false; | |
| case money_base::none: | |
| if (__i != 3) | |
| for (; __beg != __end | |
| && __ctype.is(ctype_base::space, *__beg); ++__beg); | |
| break; | |
| } | |
| } | |
| if (__sign_size > 1 && __testvalid) | |
| { | |
| const char_type* __sign = __negative ? __lc->_M_negative_sign | |
| : __lc->_M_positive_sign; | |
| size_type __i = 1; | |
| for (; __beg != __end && __i < __sign_size | |
| && *__beg == __sign[__i]; ++__beg, (void)++__i); | |
| if (__i != __sign_size) | |
| __testvalid = false; | |
| } | |
| if (__testvalid) | |
| { | |
| if (__res.size() > 1) | |
| { | |
| const size_type __first = __res.find_first_not_of('0'); | |
| const bool __only_zeros = __first == string::npos; | |
| if (__first) | |
| __res.erase(0, __only_zeros ? __res.size() - 1 : __first); | |
| } | |
| if (__negative && __res[0] != '0') | |
| __res.insert(__res.begin(), '-'); | |
| if (__grouping_tmp.size()) | |
| { | |
| __grouping_tmp += static_cast<char>(__testdecfound ? __last_pos | |
| : __n); | |
| if (!std::__verify_grouping(__lc->_M_grouping, | |
| __lc->_M_grouping_size, | |
| __grouping_tmp)) | |
| __err |= ios_base::failbit; | |
| } | |
| if (__testdecfound && __n != __lc->_M_frac_digits) | |
| __testvalid = false; | |
| } | |
| if (!__testvalid) | |
| __err |= ios_base::failbit; | |
| else | |
| __units.swap(__res); | |
| if (__beg == __end) | |
| __err |= ios_base::eofbit; | |
| return __beg; | |
| } | |
| # 368 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.tcc" 3 | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| money_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, | |
| ios_base::iostate& __err, long double& __units) const | |
| { | |
| string __str; | |
| __beg = __intl ? _M_extract<true>(__beg, __end, __io, __err, __str) | |
| : _M_extract<false>(__beg, __end, __io, __err, __str); | |
| std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale()); | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| money_get<_CharT, _InIter>:: | |
| do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, | |
| ios_base::iostate& __err, string_type& __digits) const | |
| { | |
| typedef typename string::size_type size_type; | |
| const locale& __loc = __io._M_getloc(); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| string __str; | |
| __beg = __intl ? _M_extract<true>(__beg, __end, __io, __err, __str) | |
| : _M_extract<false>(__beg, __end, __io, __err, __str); | |
| const size_type __len = __str.size(); | |
| if (__len) | |
| { | |
| __digits.resize(__len); | |
| __ctype.widen(__str.data(), __str.data() + __len, &__digits[0]); | |
| } | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| template<bool _Intl> | |
| _OutIter | |
| money_put<_CharT, _OutIter>:: | |
| _M_insert(iter_type __s, ios_base& __io, char_type __fill, | |
| const string_type& __digits) const | |
| { | |
| typedef typename string_type::size_type size_type; | |
| typedef money_base::part part; | |
| typedef __moneypunct_cache<_CharT, _Intl> __cache_type; | |
| const locale& __loc = __io._M_getloc(); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| __use_cache<__cache_type> __uc; | |
| const __cache_type* __lc = __uc(__loc); | |
| const char_type* __lit = __lc->_M_atoms; | |
| const char_type* __beg = __digits.data(); | |
| money_base::pattern __p; | |
| const char_type* __sign; | |
| size_type __sign_size; | |
| if (!(*__beg == __lit[money_base::_S_minus])) | |
| { | |
| __p = __lc->_M_pos_format; | |
| __sign = __lc->_M_positive_sign; | |
| __sign_size = __lc->_M_positive_sign_size; | |
| } | |
| else | |
| { | |
| __p = __lc->_M_neg_format; | |
| __sign = __lc->_M_negative_sign; | |
| __sign_size = __lc->_M_negative_sign_size; | |
| if (__digits.size()) | |
| ++__beg; | |
| } | |
| size_type __len = __ctype.scan_not(ctype_base::digit, __beg, | |
| __beg + __digits.size()) - __beg; | |
| if (__len) | |
| { | |
| string_type __value; | |
| __value.reserve(2 * __len); | |
| long __paddec = __len - __lc->_M_frac_digits; | |
| if (__paddec > 0) | |
| { | |
| if (__lc->_M_frac_digits < 0) | |
| __paddec = __len; | |
| if (__lc->_M_grouping_size) | |
| { | |
| __value.assign(2 * __paddec, char_type()); | |
| _CharT* __vend = | |
| std::__add_grouping(&__value[0], __lc->_M_thousands_sep, | |
| __lc->_M_grouping, | |
| __lc->_M_grouping_size, | |
| __beg, __beg + __paddec); | |
| __value.erase(__vend - &__value[0]); | |
| } | |
| else | |
| __value.assign(__beg, __paddec); | |
| } | |
| if (__lc->_M_frac_digits > 0) | |
| { | |
| __value += __lc->_M_decimal_point; | |
| if (__paddec >= 0) | |
| __value.append(__beg + __paddec, __lc->_M_frac_digits); | |
| else | |
| { | |
| __value.append(-__paddec, __lit[money_base::_S_zero]); | |
| __value.append(__beg, __len); | |
| } | |
| } | |
| const ios_base::fmtflags __f = __io.flags() | |
| & ios_base::adjustfield; | |
| __len = __value.size() + __sign_size; | |
| __len += ((__io.flags() & ios_base::showbase) | |
| ? __lc->_M_curr_symbol_size : 0); | |
| string_type __res; | |
| __res.reserve(2 * __len); | |
| const size_type __width = static_cast<size_type>(__io.width()); | |
| const bool __testipad = (__f == ios_base::internal | |
| && __len < __width); | |
| for (int __i = 0; __i < 4; ++__i) | |
| { | |
| const part __which = static_cast<part>(__p.field[__i]); | |
| switch (__which) | |
| { | |
| case money_base::symbol: | |
| if (__io.flags() & ios_base::showbase) | |
| __res.append(__lc->_M_curr_symbol, | |
| __lc->_M_curr_symbol_size); | |
| break; | |
| case money_base::sign: | |
| if (__sign_size) | |
| __res += __sign[0]; | |
| break; | |
| case money_base::value: | |
| __res += __value; | |
| break; | |
| case money_base::space: | |
| if (__testipad) | |
| __res.append(__width - __len, __fill); | |
| else | |
| __res += __fill; | |
| break; | |
| case money_base::none: | |
| if (__testipad) | |
| __res.append(__width - __len, __fill); | |
| break; | |
| } | |
| } | |
| if (__sign_size > 1) | |
| __res.append(__sign + 1, __sign_size - 1); | |
| __len = __res.size(); | |
| if (__width > __len) | |
| { | |
| if (__f == ios_base::left) | |
| __res.append(__width - __len, __fill); | |
| else | |
| __res.insert(0, __width - __len, __fill); | |
| __len = __width; | |
| } | |
| __s = std::__write(__s, __res.data(), __len); | |
| } | |
| __io.width(0); | |
| return __s; | |
| } | |
| # 574 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.tcc" 3 | |
| template<typename _CharT, typename _OutIter> | |
| _OutIter | |
| money_put<_CharT, _OutIter>:: | |
| do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, | |
| long double __units) const | |
| { | |
| const locale __loc = __io.getloc(); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| int __cs_size = 64; | |
| char* __cs = static_cast<char*>(__builtin_alloca(__cs_size)); | |
| int __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, | |
| "%.*Lf", 0, __units); | |
| if (__len >= __cs_size) | |
| { | |
| __cs_size = __len + 1; | |
| __cs = static_cast<char*>(__builtin_alloca(__cs_size)); | |
| __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, | |
| "%.*Lf", 0, __units); | |
| } | |
| # 606 "/usr/sgug/include/c++/9/bits/locale_facets_nonio.tcc" 3 | |
| string_type __digits(__len, char_type()); | |
| __ctype.widen(__cs, __cs + __len, &__digits[0]); | |
| return __intl ? _M_insert<true>(__s, __io, __fill, __digits) | |
| : _M_insert<false>(__s, __io, __fill, __digits); | |
| } | |
| template<typename _CharT, typename _OutIter> | |
| _OutIter | |
| money_put<_CharT, _OutIter>:: | |
| do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, | |
| const string_type& __digits) const | |
| { return __intl ? _M_insert<true>(__s, __io, __fill, __digits) | |
| : _M_insert<false>(__s, __io, __fill, __digits); } | |
| } | |
| template<typename _CharT, typename _InIter> | |
| time_base::dateorder | |
| time_get<_CharT, _InIter>::do_date_order() const | |
| { return time_base::no_order; } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| time_get<_CharT, _InIter>:: | |
| _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io, | |
| ios_base::iostate& __err, tm* __tm, | |
| const _CharT* __format) const | |
| { | |
| const locale& __loc = __io._M_getloc(); | |
| const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| const size_t __len = char_traits<_CharT>::length(__format); | |
| ios_base::iostate __tmperr = ios_base::goodbit; | |
| size_t __i = 0; | |
| for (; __beg != __end && __i < __len && !__tmperr; ++__i) | |
| { | |
| if (__ctype.narrow(__format[__i], 0) == '%') | |
| { | |
| char __c = __ctype.narrow(__format[++__i], 0); | |
| int __mem = 0; | |
| if (__c == 'E' || __c == 'O') | |
| __c = __ctype.narrow(__format[++__i], 0); | |
| switch (__c) | |
| { | |
| const char* __cs; | |
| _CharT __wcs[10]; | |
| case 'a': | |
| const char_type* __days1[7]; | |
| __tp._M_days_abbreviated(__days1); | |
| __beg = _M_extract_name(__beg, __end, __mem, __days1, | |
| 7, __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_wday = __mem; | |
| break; | |
| case 'A': | |
| const char_type* __days2[7]; | |
| __tp._M_days(__days2); | |
| __beg = _M_extract_name(__beg, __end, __mem, __days2, | |
| 7, __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_wday = __mem; | |
| break; | |
| case 'h': | |
| case 'b': | |
| const char_type* __months1[12]; | |
| __tp._M_months_abbreviated(__months1); | |
| __beg = _M_extract_name(__beg, __end, __mem, | |
| __months1, 12, __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_mon = __mem; | |
| break; | |
| case 'B': | |
| const char_type* __months2[12]; | |
| __tp._M_months(__months2); | |
| __beg = _M_extract_name(__beg, __end, __mem, | |
| __months2, 12, __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_mon = __mem; | |
| break; | |
| case 'c': | |
| const char_type* __dt[2]; | |
| __tp._M_date_time_formats(__dt); | |
| __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, | |
| __tm, __dt[0]); | |
| break; | |
| case 'd': | |
| __beg = _M_extract_num(__beg, __end, __mem, 1, 31, 2, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_mday = __mem; | |
| break; | |
| case 'e': | |
| if (__ctype.is(ctype_base::space, *__beg)) | |
| __beg = _M_extract_num(++__beg, __end, __mem, 1, 9, | |
| 1, __io, __tmperr); | |
| else | |
| __beg = _M_extract_num(__beg, __end, __mem, 10, 31, | |
| 2, __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_mday = __mem; | |
| break; | |
| case 'D': | |
| __cs = "%m/%d/%y"; | |
| __ctype.widen(__cs, __cs + 9, __wcs); | |
| __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, | |
| __tm, __wcs); | |
| break; | |
| case 'H': | |
| __beg = _M_extract_num(__beg, __end, __mem, 0, 23, 2, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_hour = __mem; | |
| break; | |
| case 'I': | |
| __beg = _M_extract_num(__beg, __end, __mem, 1, 12, 2, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_hour = __mem; | |
| break; | |
| case 'm': | |
| __beg = _M_extract_num(__beg, __end, __mem, 1, 12, 2, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_mon = __mem - 1; | |
| break; | |
| case 'M': | |
| __beg = _M_extract_num(__beg, __end, __mem, 0, 59, 2, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_min = __mem; | |
| break; | |
| case 'n': | |
| if (__ctype.narrow(*__beg, 0) == '\n') | |
| ++__beg; | |
| else | |
| __tmperr |= ios_base::failbit; | |
| break; | |
| case 'R': | |
| __cs = "%H:%M"; | |
| __ctype.widen(__cs, __cs + 6, __wcs); | |
| __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, | |
| __tm, __wcs); | |
| break; | |
| case 'S': | |
| __beg = _M_extract_num(__beg, __end, __mem, 0, 60, 2, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_sec = __mem; | |
| break; | |
| case 't': | |
| if (__ctype.narrow(*__beg, 0) == '\t') | |
| ++__beg; | |
| else | |
| __tmperr |= ios_base::failbit; | |
| break; | |
| case 'T': | |
| __cs = "%H:%M:%S"; | |
| __ctype.widen(__cs, __cs + 9, __wcs); | |
| __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, | |
| __tm, __wcs); | |
| break; | |
| case 'x': | |
| const char_type* __dates[2]; | |
| __tp._M_date_formats(__dates); | |
| __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, | |
| __tm, __dates[0]); | |
| break; | |
| case 'X': | |
| const char_type* __times[2]; | |
| __tp._M_time_formats(__times); | |
| __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, | |
| __tm, __times[0]); | |
| break; | |
| case 'y': | |
| case 'C': | |
| case 'Y': | |
| __beg = _M_extract_num(__beg, __end, __mem, 0, 9999, 4, | |
| __io, __tmperr); | |
| if (!__tmperr) | |
| __tm->tm_year = __mem < 0 ? __mem + 100 : __mem - 1900; | |
| break; | |
| case 'Z': | |
| if (__ctype.is(ctype_base::upper, *__beg)) | |
| { | |
| int __tmp; | |
| __beg = _M_extract_name(__beg, __end, __tmp, | |
| __timepunct_cache<_CharT>::_S_timezones, | |
| 14, __io, __tmperr); | |
| if (__beg != __end && !__tmperr && __tmp == 0 | |
| && (*__beg == __ctype.widen('-') | |
| || *__beg == __ctype.widen('+'))) | |
| { | |
| __beg = _M_extract_num(__beg, __end, __tmp, 0, 23, 2, | |
| __io, __tmperr); | |
| __beg = _M_extract_num(__beg, __end, __tmp, 0, 59, 2, | |
| __io, __tmperr); | |
| } | |
| } | |
| else | |
| __tmperr |= ios_base::failbit; | |
| break; | |
| default: | |
| __tmperr |= ios_base::failbit; | |
| } | |
| } | |
| else | |
| { | |
| if (__format[__i] == *__beg) | |
| ++__beg; | |
| else | |
| __tmperr |= ios_base::failbit; | |
| } | |
| } | |
| if (__tmperr || __i != __len) | |
| __err |= ios_base::failbit; | |
| return __beg; | |
| } | |
| template<typename _CharT, typename _InIter> | |
| _InIter | |
| time_get<_CharT, _InIter>:: | |
| _M_extract_num(iter_type __beg, iter_type __end, int& __member, | |
| int __min, int __max, size_t __len, | |
| ios_base& __io, ios_base::iostate& __err) const | |
| { | |
| const locale& __loc = __io._M_getloc(); | |
| const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); | |
| int __mult = __len == 2 ? 10 : (__len == 4 ? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment