Attachment 310323 Details for Bug 452972 – Preprocessed test case

Preprocessed test case

preprocessed.out (text/plain), 1.60 MB, created by torquil on 2008-06-26 11:57:50 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: torquil

Created: 2008-06-26 11:57:50 UTC

Size: 1.60 MB

patch

obsolete

>// /usr/libexec/gcc/i386-redhat-linux/4.1.2/cc1plus -quiet -I/mn/anatu/cma-u3/tmac/usr/include -D_GNU_SOURCE -D_REENTRANT openmp_gsl_rng.cpp -quiet -dumpbase openmp_gsl_rng.cpp -mtune=generic -auxbase openmp_gsl_rng -fopenmp -o - -frandom-seed=0
># 1 "openmp_gsl_rng.cpp"
># 1 "<built-in>"
># 1 "<command line>"
># 1 "openmp_gsl_rng.cpp"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 1
># 41 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 1
># 47 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/compiler.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/compiler.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzconfig.h" 1
># 39 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzconfig.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/gnu/bzconfig.h" 1
># 40 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzconfig.h" 2
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/compiler.h" 2
># 48 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tuning.h" 1
># 49 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tau.h" 1
># 50 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 1 3
># 35 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/os_defines.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/os_defines.h" 3
># 1 "/usr/include/features.h" 1 3 4
># 329 "/usr/include/features.h" 3 4
># 1 "/usr/include/sys/cdefs.h" 1 3 4
># 313 "/usr/include/sys/cdefs.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 314 "/usr/include/sys/cdefs.h" 2 3 4
># 330 "/usr/include/features.h" 2 3 4
># 352 "/usr/include/features.h" 3 4
># 1 "/usr/include/gnu/stubs.h" 1 3 4
>
>
>
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 5 "/usr/include/gnu/stubs.h" 2 3 4
>
>
># 1 "/usr/include/gnu/stubs-32.h" 1 3 4
># 8 "/usr/include/gnu/stubs.h" 2 3 4
># 353 "/usr/include/features.h" 2 3 4
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/os_defines.h" 2 3
># 36 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/cpu_defines.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++config.h" 2 3
>
>
>
>
>namespace __gnu_debug_def { }
>
>namespace __gnu_debug
>{
>  using namespace __gnu_debug_def;
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stringfwd.h" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stringfwd.h" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stringfwd.h" 3
>
>
>
>namespace std
>{
>  template<typename _Alloc>
>    class allocator;
>
>  template<class _CharT>
>    struct char_traits;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>           typename _Alloc = allocator<_CharT> >
>    class basic_string;
>
>  template<> struct char_traits<char>;
>
>  typedef basic_string<char> string;
>
>
>  template<> struct char_traits<wchar_t>;
>
>  typedef basic_string<wchar_t> wstring;
>
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 152 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 3 4
>typedef int ptrdiff_t;
># 214 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 3 4
>typedef unsigned int size_t;
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstddef" 2 3
>
>namespace std
>{
>  using ::ptrdiff_t;
>  using ::size_t;
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 2 3
>
># 1 "/usr/include/string.h" 1 3 4
># 28 "/usr/include/string.h" 3 4
>extern "C" {
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 34 "/usr/include/string.h" 2 3 4
>
>
>
>
>extern void *memcpy (void *__restrict __dest,
>       __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void *memmove (void *__dest, __const void *__src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern void *memccpy (void *__restrict __dest, __const void *__restrict __src,
>        int __c, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern void *memset (void *__s, int __c, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int memcmp (__const void *__s1, __const void *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void *memchr (__const void *__s, int __c, size_t __n)
>      throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern void *rawmemchr (__const void *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memrchr (__const void *__s, int __c, size_t __n)
>      throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strcat (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncat (char *__restrict __dest, __const char *__restrict __src,
>        size_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern int strncmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcoll (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern size_t strxfrm (char *__restrict __dest,
>         __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>
># 1 "/usr/include/xlocale.h" 1 3 4
># 28 "/usr/include/xlocale.h" 3 4
>typedef struct __locale_struct
>{
>
>  struct locale_data *__locales[13];
>
>
>  const unsigned short int *__ctype_b;
>  const int *__ctype_tolower;
>  const int *__ctype_toupper;
>
>
>  const char *__names[13];
>} *__locale_t;
># 119 "/usr/include/string.h" 2 3 4
>
>
>extern int strcoll_l (__const char *__s1, __const char *__s2, __locale_t __l)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>extern size_t strxfrm_l (char *__dest, __const char *__src, size_t __n,
>    __locale_t __l) throw () __attribute__ ((__nonnull__ (2, 4)));
>
>
>
>
>extern char *strdup (__const char *__s)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern char *strndup (__const char *__string, size_t __n)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1)));
># 165 "/usr/include/string.h" 3 4
>
>
>extern char *strchr (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>extern char *strrchr (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strchrnul (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern size_t strcspn (__const char *__s, __const char *__reject)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern size_t strspn (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strpbrk (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strstr (__const char *__haystack, __const char *__needle)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern char *strtok (char *__restrict __s, __const char *__restrict __delim)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>extern char *__strtok_r (char *__restrict __s,
>    __const char *__restrict __delim,
>    char **__restrict __save_ptr)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>extern char *strtok_r (char *__restrict __s, __const char *__restrict __delim,
>         char **__restrict __save_ptr)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>
>
>
>extern char *strcasestr (__const char *__haystack, __const char *__needle)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern void *memmem (__const void *__haystack, size_t __haystacklen,
>       __const void *__needle, size_t __needlelen)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>extern void *__mempcpy (void *__restrict __dest,
>   __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern void *mempcpy (void *__restrict __dest,
>        __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern size_t strlen (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern size_t strnlen (__const char *__string, size_t __maxlen)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strerror (int __errnum) throw ();
>
># 281 "/usr/include/string.h" 3 4
>extern char *strerror_r (int __errnum, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>extern void __bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern void bcopy (__const void *__src, void *__dest, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int bcmp (__const void *__s1, __const void *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *index (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern char *rindex (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int ffs (int __i) throw () __attribute__ ((__const__));
>
>
>
>
>extern int ffsl (long int __l) throw () __attribute__ ((__const__));
>
>__extension__ extern int ffsll (long long int __ll)
>     throw () __attribute__ ((__const__));
>
>
>
>
>extern int strcasecmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strncasecmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern int strcasecmp_l (__const char *__s1, __const char *__s2,
>    __locale_t __loc)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>extern int strncasecmp_l (__const char *__s1, __const char *__s2,
>     size_t __n, __locale_t __loc)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 4)));
>
>
>
>
>
>extern char *strsep (char **__restrict __stringp,
>       __const char *__restrict __delim)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int strverscmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strsignal (int __sig) throw ();
>
>
>extern char *__stpcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern char *stpcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern char *__stpncpy (char *__restrict __dest,
>   __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern char *stpncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strfry (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memfrob (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern char *basename (__const char *__filename) throw () __attribute__ ((__nonnull__ (1)));
># 426 "/usr/include/string.h" 3 4
>}
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 2 3
># 78 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstring" 3
>namespace std
>{
>  using ::memcpy;
>  using ::memmove;
>  using ::strcpy;
>  using ::strncpy;
>  using ::strcat;
>  using ::strncat;
>  using ::memcmp;
>  using ::strcmp;
>  using ::strcoll;
>  using ::strncmp;
>  using ::strxfrm;
>  using ::strcspn;
>  using ::strspn;
>  using ::strtok;
>  using ::memset;
>  using ::strerror;
>  using ::strlen;
>
>  using ::memchr;
>
>  inline void*
>  memchr(void* __p, int __c, size_t __n)
>  { return memchr(const_cast<const void*>(__p), __c, __n); }
>
>  using ::strchr;
>
>  inline char*
>  strchr(char* __s1, int __n)
>  { return __builtin_strchr(const_cast<const char*>(__s1), __n); }
>
>  using ::strpbrk;
>
>  inline char*
>  strpbrk(char* __s1, const char* __s2)
>  { return __builtin_strpbrk(const_cast<const char*>(__s1), __s2); }
>
>  using ::strrchr;
>
>  inline char*
>  strrchr(char* __s1, int __n)
>  { return __builtin_strrchr(const_cast<const char*>(__s1), __n); }
>
>  using ::strstr;
>
>  inline char*
>  strstr(char* __s1, const char* __s2)
>  { return __builtin_strstr(const_cast<const char*>(__s1), __s2); }
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 1 3 4
># 11 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/syslimits.h" 1 3 4
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 1 3 4
># 122 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 3 4
># 1 "/usr/include/limits.h" 1 3 4
># 145 "/usr/include/limits.h" 3 4
># 1 "/usr/include/bits/posix1_lim.h" 1 3 4
># 153 "/usr/include/bits/posix1_lim.h" 3 4
># 1 "/usr/include/bits/local_lim.h" 1 3 4
># 36 "/usr/include/bits/local_lim.h" 3 4
># 1 "/usr/include/linux/limits.h" 1 3 4
># 37 "/usr/include/bits/local_lim.h" 2 3 4
># 154 "/usr/include/bits/posix1_lim.h" 2 3 4
># 146 "/usr/include/limits.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/posix2_lim.h" 1 3 4
># 150 "/usr/include/limits.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/xopen_lim.h" 1 3 4
># 34 "/usr/include/bits/xopen_lim.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 35 "/usr/include/bits/xopen_lim.h" 2 3 4
># 154 "/usr/include/limits.h" 2 3 4
># 123 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 2 3 4
># 8 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/syslimits.h" 2 3 4
># 12 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/limits.h" 2 3 4
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/climits" 2 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
># 1 "/usr/include/stdlib.h" 1 3 4
># 33 "/usr/include/stdlib.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 34 "/usr/include/stdlib.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>
># 1 "/usr/include/bits/waitflags.h" 1 3 4
># 43 "/usr/include/stdlib.h" 2 3 4
># 1 "/usr/include/bits/waitstatus.h" 1 3 4
># 65 "/usr/include/bits/waitstatus.h" 3 4
># 1 "/usr/include/endian.h" 1 3 4
># 37 "/usr/include/endian.h" 3 4
># 1 "/usr/include/bits/endian.h" 1 3 4
># 38 "/usr/include/endian.h" 2 3 4
># 66 "/usr/include/bits/waitstatus.h" 2 3 4
>
>union wait
>  {
>    int w_status;
>    struct
>      {
>
> unsigned int __w_termsig:7;
> unsigned int __w_coredump:1;
> unsigned int __w_retcode:8;
> unsigned int:16;
>
>
>
>
>
>
>
>      } __wait_terminated;
>    struct
>      {
>
> unsigned int __w_stopval:8;
> unsigned int __w_stopsig:8;
> unsigned int:16;
>
>
>
>
>
>
>      } __wait_stopped;
>  };
># 44 "/usr/include/stdlib.h" 2 3 4
># 96 "/usr/include/stdlib.h" 3 4
>
>
>typedef struct
>  {
>    int quot;
>    int rem;
>  } div_t;
>
>
>
>typedef struct
>  {
>    long int quot;
>    long int rem;
>  } ldiv_t;
>
>
>
>
>
>
>
>__extension__ typedef struct
>  {
>    long long int quot;
>    long long int rem;
>  } lldiv_t;
>
>
># 140 "/usr/include/stdlib.h" 3 4
>extern size_t __ctype_get_mb_cur_max (void) throw () ;
>
>
>
>
>extern double atof (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern int atoi (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern long int atol (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__ extern long long int atoll (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern double strtod (__const char *__restrict __nptr,
>        char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern float strtof (__const char *__restrict __nptr,
>       char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern long double strtold (__const char *__restrict __nptr,
>       char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern long int strtol (__const char *__restrict __nptr,
>   char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern unsigned long int strtoul (__const char *__restrict __nptr,
>      char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>__extension__
>extern long long int strtoq (__const char *__restrict __nptr,
>        char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtouq (__const char *__restrict __nptr,
>           char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__
>extern long long int strtoll (__const char *__restrict __nptr,
>         char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtoull (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
># 240 "/usr/include/stdlib.h" 3 4
>extern long int strtol_l (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base,
>     __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern unsigned long int strtoul_l (__const char *__restrict __nptr,
>        char **__restrict __endptr,
>        int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern long long int strtoll_l (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __base,
>    __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern unsigned long long int strtoull_l (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern double strtod_l (__const char *__restrict __nptr,
>   char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern float strtof_l (__const char *__restrict __nptr,
>         char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern long double strtold_l (__const char *__restrict __nptr,
>         char **__restrict __endptr,
>         __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>
>
>
>
>
>extern double __strtod_internal (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern float __strtof_internal (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern long double __strtold_internal (__const char *__restrict __nptr,
>           char **__restrict __endptr,
>           int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern long int __strtol_internal (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern unsigned long int __strtoul_internal (__const char *__restrict __nptr,
>          char **__restrict __endptr,
>          int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>__extension__
>extern long long int __strtoll_internal (__const char *__restrict __nptr,
>      char **__restrict __endptr,
>      int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>__extension__
>extern unsigned long long int __strtoull_internal (__const char *
>         __restrict __nptr,
>         char **__restrict __endptr,
>         int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 429 "/usr/include/stdlib.h" 3 4
>extern char *l64a (long int __n) throw () ;
>
>
>extern long int a64l (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
># 1 "/usr/include/sys/types.h" 1 3 4
># 29 "/usr/include/sys/types.h" 3 4
>extern "C" {
>
># 1 "/usr/include/bits/types.h" 1 3 4
># 28 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/bits/types.h" 2 3 4
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 32 "/usr/include/bits/types.h" 2 3 4
>
>
>typedef unsigned char __u_char;
>typedef unsigned short int __u_short;
>typedef unsigned int __u_int;
>typedef unsigned long int __u_long;
>
>
>typedef signed char __int8_t;
>typedef unsigned char __uint8_t;
>typedef signed short int __int16_t;
>typedef unsigned short int __uint16_t;
>typedef signed int __int32_t;
>typedef unsigned int __uint32_t;
>
>
>
>
>__extension__ typedef signed long long int __int64_t;
>__extension__ typedef unsigned long long int __uint64_t;
>
>
>
>
>
>
>
>__extension__ typedef long long int __quad_t;
>__extension__ typedef unsigned long long int __u_quad_t;
># 134 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/typesizes.h" 1 3 4
># 135 "/usr/include/bits/types.h" 2 3 4
>
>
>__extension__ typedef __u_quad_t __dev_t;
>__extension__ typedef unsigned int __uid_t;
>__extension__ typedef unsigned int __gid_t;
>__extension__ typedef unsigned long int __ino_t;
>__extension__ typedef __u_quad_t __ino64_t;
>__extension__ typedef unsigned int __mode_t;
>__extension__ typedef unsigned int __nlink_t;
>__extension__ typedef long int __off_t;
>__extension__ typedef __quad_t __off64_t;
>__extension__ typedef int __pid_t;
>__extension__ typedef struct { int __val[2]; } __fsid_t;
>__extension__ typedef long int __clock_t;
>__extension__ typedef unsigned long int __rlim_t;
>__extension__ typedef __u_quad_t __rlim64_t;
>__extension__ typedef unsigned int __id_t;
>__extension__ typedef long int __time_t;
>__extension__ typedef unsigned int __useconds_t;
>__extension__ typedef long int __suseconds_t;
>
>__extension__ typedef int __daddr_t;
>__extension__ typedef long int __swblk_t;
>__extension__ typedef int __key_t;
>
>
>__extension__ typedef int __clockid_t;
>
>
>__extension__ typedef void * __timer_t;
>
>
>__extension__ typedef long int __blksize_t;
>
>
>
>
>__extension__ typedef long int __blkcnt_t;
>__extension__ typedef __quad_t __blkcnt64_t;
>
>
>__extension__ typedef unsigned long int __fsblkcnt_t;
>__extension__ typedef __u_quad_t __fsblkcnt64_t;
>
>
>__extension__ typedef unsigned long int __fsfilcnt_t;
>__extension__ typedef __u_quad_t __fsfilcnt64_t;
>
>__extension__ typedef int __ssize_t;
>
>
>
>typedef __off64_t __loff_t;
>typedef __quad_t *__qaddr_t;
>typedef char *__caddr_t;
>
>
>__extension__ typedef int __intptr_t;
>
>
>__extension__ typedef unsigned int __socklen_t;
># 32 "/usr/include/sys/types.h" 2 3 4
>
>
>
>typedef __u_char u_char;
>typedef __u_short u_short;
>typedef __u_int u_int;
>typedef __u_long u_long;
>typedef __quad_t quad_t;
>typedef __u_quad_t u_quad_t;
>typedef __fsid_t fsid_t;
>
>
>
>
>typedef __loff_t loff_t;
>
>
>
>typedef __ino_t ino_t;
>
>
>
>
>
>
>typedef __ino64_t ino64_t;
>
>
>
>
>typedef __dev_t dev_t;
>
>
>
>
>typedef __gid_t gid_t;
>
>
>
>
>typedef __mode_t mode_t;
>
>
>
>
>typedef __nlink_t nlink_t;
>
>
>
>
>typedef __uid_t uid_t;
>
>
>
>
>
>typedef __off_t off_t;
>
>
>
>
>
>
>typedef __off64_t off64_t;
>
>
>
>
>typedef __pid_t pid_t;
>
>
>
>
>typedef __id_t id_t;
>
>
>
>
>typedef __ssize_t ssize_t;
>
>
>
>
>
>typedef __daddr_t daddr_t;
>typedef __caddr_t caddr_t;
>
>
>
>
>
>typedef __key_t key_t;
># 133 "/usr/include/sys/types.h" 3 4
># 1 "/usr/include/time.h" 1 3 4
># 59 "/usr/include/time.h" 3 4
>
>
>typedef __clock_t clock_t;
>
>
>
># 75 "/usr/include/time.h" 3 4
>
>
>typedef __time_t time_t;
>
>
>
># 93 "/usr/include/time.h" 3 4
>typedef __clockid_t clockid_t;
># 105 "/usr/include/time.h" 3 4
>typedef __timer_t timer_t;
># 134 "/usr/include/sys/types.h" 2 3 4
>
>
>
>typedef __useconds_t useconds_t;
>
>
>
>typedef __suseconds_t suseconds_t;
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 148 "/usr/include/sys/types.h" 2 3 4
>
>
>
>typedef unsigned long int ulong;
>typedef unsigned short int ushort;
>typedef unsigned int uint;
># 195 "/usr/include/sys/types.h" 3 4
>typedef int int8_t __attribute__ ((__mode__ (__QI__)));
>typedef int int16_t __attribute__ ((__mode__ (__HI__)));
>typedef int int32_t __attribute__ ((__mode__ (__SI__)));
>typedef int int64_t __attribute__ ((__mode__ (__DI__)));
>
>
>typedef unsigned int u_int8_t __attribute__ ((__mode__ (__QI__)));
>typedef unsigned int u_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int u_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int u_int64_t __attribute__ ((__mode__ (__DI__)));
>
>typedef int register_t __attribute__ ((__mode__ (__word__)));
># 220 "/usr/include/sys/types.h" 3 4
># 1 "/usr/include/sys/select.h" 1 3 4
># 31 "/usr/include/sys/select.h" 3 4
># 1 "/usr/include/bits/select.h" 1 3 4
># 32 "/usr/include/sys/select.h" 2 3 4
>
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 23 "/usr/include/bits/sigset.h" 3 4
>typedef int __sig_atomic_t;
>
>
>
>
>typedef struct
>  {
>    unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))];
>  } __sigset_t;
># 35 "/usr/include/sys/select.h" 2 3 4
>
>
>
>typedef __sigset_t sigset_t;
>
>
>
>
>
># 1 "/usr/include/time.h" 1 3 4
># 121 "/usr/include/time.h" 3 4
>struct timespec
>  {
>    __time_t tv_sec;
>    long int tv_nsec;
>  };
># 45 "/usr/include/sys/select.h" 2 3 4
>
># 1 "/usr/include/bits/time.h" 1 3 4
># 69 "/usr/include/bits/time.h" 3 4
>struct timeval
>  {
>    __time_t tv_sec;
>    __suseconds_t tv_usec;
>  };
># 47 "/usr/include/sys/select.h" 2 3 4
># 55 "/usr/include/sys/select.h" 3 4
>typedef long int __fd_mask;
># 67 "/usr/include/sys/select.h" 3 4
>typedef struct
>  {
>
>
>
>    __fd_mask fds_bits[1024 / (8 * sizeof (__fd_mask))];
>
>
>
>
>
>  } fd_set;
>
>
>
>
>
>
>typedef __fd_mask fd_mask;
># 99 "/usr/include/sys/select.h" 3 4
>extern "C" {
># 109 "/usr/include/sys/select.h" 3 4
>extern int select (int __nfds, fd_set *__restrict __readfds,
>     fd_set *__restrict __writefds,
>     fd_set *__restrict __exceptfds,
>     struct timeval *__restrict __timeout);
># 121 "/usr/include/sys/select.h" 3 4
>extern int pselect (int __nfds, fd_set *__restrict __readfds,
>      fd_set *__restrict __writefds,
>      fd_set *__restrict __exceptfds,
>      const struct timespec *__restrict __timeout,
>      const __sigset_t *__restrict __sigmask);
>
>
>}
># 221 "/usr/include/sys/types.h" 2 3 4
>
>
># 1 "/usr/include/sys/sysmacros.h" 1 3 4
># 29 "/usr/include/sys/sysmacros.h" 3 4
>__extension__
>extern __inline unsigned int gnu_dev_major (unsigned long long int __dev)
>     throw ();
>__extension__
>extern __inline unsigned int gnu_dev_minor (unsigned long long int __dev)
>     throw ();
>__extension__
>extern __inline unsigned long long int gnu_dev_makedev (unsigned int __major,
>       unsigned int __minor)
>     throw ();
>
>
>__extension__ extern __inline unsigned int
>gnu_dev_major (unsigned long long int __dev) throw ()
>{
>  return ((__dev >> 8) & 0xfff) | ((unsigned int) (__dev >> 32) & ~0xfff);
>}
>
>__extension__ extern __inline unsigned int
>gnu_dev_minor (unsigned long long int __dev) throw ()
>{
>  return (__dev & 0xff) | ((unsigned int) (__dev >> 12) & ~0xff);
>}
>
>__extension__ extern __inline unsigned long long int
>gnu_dev_makedev (unsigned int __major, unsigned int __minor) throw ()
>{
>  return ((__minor & 0xff) | ((__major & 0xfff) << 8)
>   | (((unsigned long long int) (__minor & ~0xff)) << 12)
>   | (((unsigned long long int) (__major & ~0xfff)) << 32));
>}
># 224 "/usr/include/sys/types.h" 2 3 4
>
>
>
>
>typedef __blksize_t blksize_t;
>
>
>
>
>
>
>typedef __blkcnt_t blkcnt_t;
>
>
>
>typedef __fsblkcnt_t fsblkcnt_t;
>
>
>
>typedef __fsfilcnt_t fsfilcnt_t;
># 262 "/usr/include/sys/types.h" 3 4
>typedef __blkcnt64_t blkcnt64_t;
>typedef __fsblkcnt64_t fsblkcnt64_t;
>typedef __fsfilcnt64_t fsfilcnt64_t;
>
>
>
>
>
># 1 "/usr/include/bits/pthreadtypes.h" 1 3 4
># 36 "/usr/include/bits/pthreadtypes.h" 3 4
>typedef unsigned long int pthread_t;
>
>
>typedef union
>{
>  char __size[36];
>  long int __align;
>} pthread_attr_t;
>
>
>typedef struct __pthread_internal_slist
>{
>  struct __pthread_internal_slist *__next;
>} __pthread_slist_t;
>
>
>
>
>typedef union
>{
>  struct __pthread_mutex_s
>  {
>    int __lock;
>    unsigned int __count;
>    int __owner;
>
>
>    int __kind;
>    unsigned int __nusers;
>    __extension__ union
>    {
>      int __spins;
>      __pthread_slist_t __list;
>    };
>  } __data;
>  char __size[24];
>  long int __align;
>} pthread_mutex_t;
>
>typedef union
>{
>  char __size[4];
>  long int __align;
>} pthread_mutexattr_t;
>
>
>
>
>typedef union
>{
>  struct
>  {
>    int __lock;
>    unsigned int __futex;
>    __extension__ unsigned long long int __total_seq;
>    __extension__ unsigned long long int __wakeup_seq;
>    __extension__ unsigned long long int __woken_seq;
>    void *__mutex;
>    unsigned int __nwaiters;
>    unsigned int __broadcast_seq;
>  } __data;
>  char __size[48];
>  __extension__ long long int __align;
>} pthread_cond_t;
>
>typedef union
>{
>  char __size[4];
>  long int __align;
>} pthread_condattr_t;
>
>
>
>typedef unsigned int pthread_key_t;
>
>
>
>typedef int pthread_once_t;
>
>
>
>
>
>typedef union
>{
>  struct
>  {
>    int __lock;
>    unsigned int __nr_readers;
>    unsigned int __readers_wakeup;
>    unsigned int __writer_wakeup;
>    unsigned int __nr_readers_queued;
>    unsigned int __nr_writers_queued;
>
>
>    unsigned int __flags;
>    int __writer;
>  } __data;
>  char __size[32];
>  long int __align;
>} pthread_rwlock_t;
>
>typedef union
>{
>  char __size[8];
>  long int __align;
>} pthread_rwlockattr_t;
>
>
>
>
>
>typedef volatile int pthread_spinlock_t;
>
>
>
>
>typedef union
>{
>  char __size[20];
>  long int __align;
>} pthread_barrier_t;
>
>typedef union
>{
>  char __size[4];
>  int __align;
>} pthread_barrierattr_t;
># 271 "/usr/include/sys/types.h" 2 3 4
>
>
>}
># 439 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>
>
>extern long int random (void) throw ();
>
>
>extern void srandom (unsigned int __seed) throw ();
>
>
>
>
>
>extern char *initstate (unsigned int __seed, char *__statebuf,
>   size_t __statelen) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern char *setstate (char *__statebuf) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>struct random_data
>  {
>    int32_t *fptr;
>    int32_t *rptr;
>    int32_t *state;
>    int rand_type;
>    int rand_deg;
>    int rand_sep;
>    int32_t *end_ptr;
>  };
>
>extern int random_r (struct random_data *__restrict __buf,
>       int32_t *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int srandom_r (unsigned int __seed, struct random_data *__buf)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int initstate_r (unsigned int __seed, char *__restrict __statebuf,
>   size_t __statelen,
>   struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (2, 4)));
>
>extern int setstate_r (char *__restrict __statebuf,
>         struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern int rand (void) throw ();
>
>extern void srand (unsigned int __seed) throw ();
>
>
>
>
>extern int rand_r (unsigned int *__seed) throw ();
>
>
>
>
>
>
>
>extern double drand48 (void) throw ();
>extern double erand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int lrand48 (void) throw ();
>extern long int nrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int mrand48 (void) throw ();
>extern long int jrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void srand48 (long int __seedval) throw ();
>extern unsigned short int *seed48 (unsigned short int __seed16v[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>extern void lcong48 (unsigned short int __param[7]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>struct drand48_data
>  {
>    unsigned short int __x[3];
>    unsigned short int __old_x[3];
>    unsigned short int __c;
>    unsigned short int __init;
>    unsigned long long int __a;
>  };
>
>
>extern int drand48_r (struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int erand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int lrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int nrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int mrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int jrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int srand48_r (long int __seedval, struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int seed48_r (unsigned short int __seed16v[3],
>       struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int lcong48_r (unsigned short int __param[7],
>        struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>
>
>extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>extern void *calloc (size_t __nmemb, size_t __size)
>     throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>
>
>
>extern void *realloc (void *__ptr, size_t __size)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__warn_unused_result__));
>
>extern void free (void *__ptr) throw ();
>
>
>
>
>extern void cfree (void *__ptr) throw ();
>
>
>
># 1 "/usr/include/alloca.h" 1 3 4
># 25 "/usr/include/alloca.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 26 "/usr/include/alloca.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>extern void *alloca (size_t __size) throw ();
>
>
>
>
>
>}
># 613 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>extern void *valloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern void abort (void) throw () __attribute__ ((__noreturn__));
>
>
>
>extern int atexit (void (*__func) (void)) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>extern void _Exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>extern char *getenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern char *__secure_getenv (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int putenv (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int setenv (__const char *__name, __const char *__value, int __replace)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int unsetenv (__const char *__name) throw ();
>
>
>
>
>
>
>extern int clearenv (void) throw ();
># 698 "/usr/include/stdlib.h" 3 4
>extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
># 709 "/usr/include/stdlib.h" 3 4
>extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 719 "/usr/include/stdlib.h" 3 4
>extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 729 "/usr/include/stdlib.h" 3 4
>extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>
>extern int system (__const char *__command) ;
>
>
>
>
>
>
>
>extern char *canonicalize_file_name (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 756 "/usr/include/stdlib.h" 3 4
>extern char *realpath (__const char *__restrict __name,
>         char *__restrict __resolved) throw () ;
>
>
>
>
>
>
>typedef int (*__compar_fn_t) (__const void *, __const void *);
>
>
>typedef __compar_fn_t comparison_fn_t;
>
>
>
>
>
>
>extern void *bsearch (__const void *__key, __const void *__base,
>        size_t __nmemb, size_t __size, __compar_fn_t __compar)
>     __attribute__ ((__nonnull__ (1, 2, 5))) ;
>
>
>
>extern void qsort (void *__base, size_t __nmemb, size_t __size,
>     __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4)));
>
>
>
>extern int abs (int __x) throw () __attribute__ ((__const__)) ;
>extern long int labs (long int __x) throw () __attribute__ ((__const__)) ;
>
>
>
>__extension__ extern long long int llabs (long long int __x)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>
>
>
>extern div_t div (int __numer, int __denom)
>     throw () __attribute__ ((__const__)) ;
>extern ldiv_t ldiv (long int __numer, long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>__extension__ extern lldiv_t lldiv (long long int __numer,
>        long long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
># 821 "/usr/include/stdlib.h" 3 4
>extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ;
>
>
>
>
>extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ;
>
>
>
>
>extern char *gcvt (double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) ;
>
>
>
>
>extern char *qecvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) ;
>extern char *qfcvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) ;
>extern char *qgcvt (long double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) ;
>
>
>
>
>extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign, char *__restrict __buf,
>     size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign, char *__restrict __buf,
>     size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>
>extern int qecvt_r (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>extern int qfcvt_r (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>
>
>
>
>
>
>
>extern int mblen (__const char *__s, size_t __n) throw () ;
>
>
>extern int mbtowc (wchar_t *__restrict __pwc,
>     __const char *__restrict __s, size_t __n) throw () ;
>
>
>extern int wctomb (char *__s, wchar_t __wchar) throw () ;
>
>
>
>extern size_t mbstowcs (wchar_t *__restrict __pwcs,
>   __const char *__restrict __s, size_t __n) throw ();
>
>extern size_t wcstombs (char *__restrict __s,
>   __const wchar_t *__restrict __pwcs, size_t __n)
>     throw ();
>
>
>
>
>
>
>
>
>extern int rpmatch (__const char *__response) throw () __attribute__ ((__nonnull__ (1))) ;
># 909 "/usr/include/stdlib.h" 3 4
>extern int getsubopt (char **__restrict __optionp,
>        char *__const *__restrict __tokens,
>        char **__restrict __valuep)
>     throw () __attribute__ ((__nonnull__ (1, 2, 3))) ;
>
>
>
>
>
>extern void setkey (__const char *__key) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int posix_openpt (int __oflag) ;
>
>
>
>
>
>
>
>extern int grantpt (int __fd) throw ();
>
>
>
>extern int unlockpt (int __fd) throw ();
>
>
>
>
>extern char *ptsname (int __fd) throw () ;
>
>
>
>
>
>
>extern int ptsname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int getpt (void);
>
>
>
>
>
>
>extern int getloadavg (double __loadavg[], int __nelem)
>     throw () __attribute__ ((__nonnull__ (1)));
># 977 "/usr/include/stdlib.h" 3 4
>}
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 2 3
># 103 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>namespace std
>{
>  using ::div_t;
>  using ::ldiv_t;
>
>  using ::abort;
>  using ::abs;
>  using ::atexit;
>  using ::atof;
>  using ::atoi;
>  using ::atol;
>  using ::bsearch;
>  using ::calloc;
>  using ::div;
>  using ::exit;
>  using ::free;
>  using ::getenv;
>  using ::labs;
>  using ::ldiv;
>  using ::malloc;
>
>  using ::mblen;
>  using ::mbstowcs;
>  using ::mbtowc;
>
>  using ::qsort;
>  using ::rand;
>  using ::realloc;
>  using ::srand;
>  using ::strtod;
>  using ::strtol;
>  using ::strtoul;
>  using ::system;
>
>  using ::wcstombs;
>  using ::wctomb;
>
>
>  inline long
>  abs(long __i) { return labs(__i); }
>
>  inline ldiv_t
>  div(long __i, long __j) { return ldiv(__i, __j); }
>}
># 159 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>namespace __gnu_cxx
>{
>
>  using ::lldiv_t;
>
>
>
>
>
>  using ::_Exit;
>
>
>  inline long long
>  abs(long long __x) { return __x >= 0 ? __x : -__x; }
>
>
>  using ::llabs;
>
>  inline lldiv_t
>  div(long long __n, long long __d)
>  { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }
>
>  using ::lldiv;
># 192 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdlib" 3
>  using ::atoll;
>  using ::strtoll;
>  using ::strtoull;
>
>  using ::strtof;
>  using ::strtold;
>}
>
>namespace std
>{
>
>  using ::__gnu_cxx::lldiv_t;
>
>  using ::__gnu_cxx::_Exit;
>  using ::__gnu_cxx::abs;
>
>  using ::__gnu_cxx::llabs;
>  using ::__gnu_cxx::div;
>  using ::__gnu_cxx::lldiv;
>
>  using ::__gnu_cxx::atoll;
>  using ::__gnu_cxx::strtof;
>  using ::__gnu_cxx::strtoll;
>  using ::__gnu_cxx::strtoull;
>  using ::__gnu_cxx::strtold;
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>
>
>
>
># 1 "/usr/include/stdio.h" 1 3 4
># 30 "/usr/include/stdio.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 35 "/usr/include/stdio.h" 2 3 4
># 44 "/usr/include/stdio.h" 3 4
>
>
>typedef struct _IO_FILE FILE;
>
>
>
>
>
># 62 "/usr/include/stdio.h" 3 4
>typedef struct _IO_FILE __FILE;
># 72 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/libio.h" 1 3 4
># 32 "/usr/include/libio.h" 3 4
># 1 "/usr/include/_G_config.h" 1 3 4
># 14 "/usr/include/_G_config.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 355 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 3 4
>typedef unsigned int wint_t;
># 15 "/usr/include/_G_config.h" 2 3 4
># 24 "/usr/include/_G_config.h" 3 4
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
>
># 1 "/usr/include/bits/wchar.h" 1 3 4
># 51 "/usr/include/wchar.h" 2 3 4
># 76 "/usr/include/wchar.h" 3 4
>typedef struct
>{
>  int __count;
>  union
>  {
>    wint_t __wch;
>    char __wchb[4];
>  } __value;
>} __mbstate_t;
># 25 "/usr/include/_G_config.h" 2 3 4
>
>typedef struct
>{
>  __off_t __pos;
>  __mbstate_t __state;
>} _G_fpos_t;
>typedef struct
>{
>  __off64_t __pos;
>  __mbstate_t __state;
>} _G_fpos64_t;
># 44 "/usr/include/_G_config.h" 3 4
># 1 "/usr/include/gconv.h" 1 3 4
># 28 "/usr/include/gconv.h" 3 4
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
># 29 "/usr/include/gconv.h" 2 3 4
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 32 "/usr/include/gconv.h" 2 3 4
>
>
>
>
>
>enum
>{
>  __GCONV_OK = 0,
>  __GCONV_NOCONV,
>  __GCONV_NODB,
>  __GCONV_NOMEM,
>
>  __GCONV_EMPTY_INPUT,
>  __GCONV_FULL_OUTPUT,
>  __GCONV_ILLEGAL_INPUT,
>  __GCONV_INCOMPLETE_INPUT,
>
>  __GCONV_ILLEGAL_DESCRIPTOR,
>  __GCONV_INTERNAL_ERROR
>};
>
>
>
>enum
>{
>  __GCONV_IS_LAST = 0x0001,
>  __GCONV_IGNORE_ERRORS = 0x0002
>};
>
>
>
>struct __gconv_step;
>struct __gconv_step_data;
>struct __gconv_loaded_object;
>struct __gconv_trans_data;
>
>
>
>typedef int (*__gconv_fct) (struct __gconv_step *, struct __gconv_step_data *,
>       __const unsigned char **, __const unsigned char *,
>       unsigned char **, size_t *, int, int);
>
>
>typedef wint_t (*__gconv_btowc_fct) (struct __gconv_step *, unsigned char);
>
>
>typedef int (*__gconv_init_fct) (struct __gconv_step *);
>typedef void (*__gconv_end_fct) (struct __gconv_step *);
>
>
>
>typedef int (*__gconv_trans_fct) (struct __gconv_step *,
>      struct __gconv_step_data *, void *,
>      __const unsigned char *,
>      __const unsigned char **,
>      __const unsigned char *, unsigned char **,
>      size_t *);
>
>
>typedef int (*__gconv_trans_context_fct) (void *, __const unsigned char *,
>       __const unsigned char *,
>       unsigned char *, unsigned char *);
>
>
>typedef int (*__gconv_trans_query_fct) (__const char *, __const char ***,
>     size_t *);
>
>
>typedef int (*__gconv_trans_init_fct) (void **, const char *);
>typedef void (*__gconv_trans_end_fct) (void *);
>
>struct __gconv_trans_data
>{
>
>  __gconv_trans_fct __trans_fct;
>  __gconv_trans_context_fct __trans_context_fct;
>  __gconv_trans_end_fct __trans_end_fct;
>  void *__data;
>  struct __gconv_trans_data *__next;
>};
>
>
>
>struct __gconv_step
>{
>  struct __gconv_loaded_object *__shlib_handle;
>  __const char *__modname;
>
>  int __counter;
>
>  char *__from_name;
>  char *__to_name;
>
>  __gconv_fct __fct;
>  __gconv_btowc_fct __btowc_fct;
>  __gconv_init_fct __init_fct;
>  __gconv_end_fct __end_fct;
>
>
>
>  int __min_needed_from;
>  int __max_needed_from;
>  int __min_needed_to;
>  int __max_needed_to;
>
>
>  int __stateful;
>
>  void *__data;
>};
>
>
>
>struct __gconv_step_data
>{
>  unsigned char *__outbuf;
>  unsigned char *__outbufend;
>
>
>
>  int __flags;
>
>
>
>  int __invocation_counter;
>
>
>
>  int __internal_use;
>
>  __mbstate_t *__statep;
>  __mbstate_t __state;
>
>
>
>  struct __gconv_trans_data *__trans;
>};
>
>
>
>typedef struct __gconv_info
>{
>  size_t __nsteps;
>  struct __gconv_step *__steps;
>  __extension__ struct __gconv_step_data __data [];
>} *__gconv_t;
># 45 "/usr/include/_G_config.h" 2 3 4
>typedef union
>{
>  struct __gconv_info __cd;
>  struct
>  {
>    struct __gconv_info __cd;
>    struct __gconv_step_data __data;
>  } __combined;
>} _G_iconv_t;
>
>typedef int _G_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef int _G_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int _G_uint16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int _G_uint32_t __attribute__ ((__mode__ (__SI__)));
># 33 "/usr/include/libio.h" 2 3 4
># 53 "/usr/include/libio.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 1 3 4
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 3 4
>typedef __builtin_va_list __gnuc_va_list;
># 54 "/usr/include/libio.h" 2 3 4
># 167 "/usr/include/libio.h" 3 4
>struct _IO_jump_t; struct _IO_FILE;
># 177 "/usr/include/libio.h" 3 4
>typedef void _IO_lock_t;
>
>
>
>
>
>struct _IO_marker {
>  struct _IO_marker *_next;
>  struct _IO_FILE *_sbuf;
>
>
>
>  int _pos;
># 200 "/usr/include/libio.h" 3 4
>};
>
>
>enum __codecvt_result
>{
>  __codecvt_ok,
>  __codecvt_partial,
>  __codecvt_error,
>  __codecvt_noconv
>};
># 268 "/usr/include/libio.h" 3 4
>struct _IO_FILE {
>  int _flags;
>
>
>
>
>  char* _IO_read_ptr;
>  char* _IO_read_end;
>  char* _IO_read_base;
>  char* _IO_write_base;
>  char* _IO_write_ptr;
>  char* _IO_write_end;
>  char* _IO_buf_base;
>  char* _IO_buf_end;
>
>  char *_IO_save_base;
>  char *_IO_backup_base;
>  char *_IO_save_end;
>
>  struct _IO_marker *_markers;
>
>  struct _IO_FILE *_chain;
>
>  int _fileno;
>
>
>
>  int _flags2;
>
>  __off_t _old_offset;
>
>
>
>  unsigned short _cur_column;
>  signed char _vtable_offset;
>  char _shortbuf[1];
>
>
>
>  _IO_lock_t *_lock;
># 316 "/usr/include/libio.h" 3 4
>  __off64_t _offset;
># 325 "/usr/include/libio.h" 3 4
>  void *__pad1;
>  void *__pad2;
>  void *__pad3;
>  void *__pad4;
>  size_t __pad5;
>
>  int _mode;
>
>  char _unused2[15 * sizeof (int) - 4 * sizeof (void *) - sizeof (size_t)];
>
>};
>
>
>
>
>
>struct _IO_FILE_plus;
>
>extern struct _IO_FILE_plus _IO_2_1_stdin_;
>extern struct _IO_FILE_plus _IO_2_1_stdout_;
>extern struct _IO_FILE_plus _IO_2_1_stderr_;
># 361 "/usr/include/libio.h" 3 4
>typedef __ssize_t __io_read_fn (void *__cookie, char *__buf, size_t __nbytes);
>
>
>
>
>
>
>
>typedef __ssize_t __io_write_fn (void *__cookie, __const char *__buf,
>     size_t __n);
>
>
>
>
>
>
>
>typedef int __io_seek_fn (void *__cookie, __off64_t *__pos, int __w);
>
>
>typedef int __io_close_fn (void *__cookie);
>
>
>
>
>typedef __io_read_fn cookie_read_function_t;
>typedef __io_write_fn cookie_write_function_t;
>typedef __io_seek_fn cookie_seek_function_t;
>typedef __io_close_fn cookie_close_function_t;
>
>
>typedef struct
>{
>  __io_read_fn *read;
>  __io_write_fn *write;
>  __io_seek_fn *seek;
>  __io_close_fn *close;
>} _IO_cookie_io_functions_t;
>typedef _IO_cookie_io_functions_t cookie_io_functions_t;
>
>struct _IO_cookie_file;
>
>
>extern void _IO_cookie_init (struct _IO_cookie_file *__cfile, int __read_write,
>        void *__cookie, _IO_cookie_io_functions_t __fns);
>
>
>
>
>extern "C" {
>
>
>extern int __underflow (_IO_FILE *);
>extern int __uflow (_IO_FILE *);
>extern int __overflow (_IO_FILE *, int);
>extern wint_t __wunderflow (_IO_FILE *);
>extern wint_t __wuflow (_IO_FILE *);
>extern wint_t __woverflow (_IO_FILE *, wint_t);
># 451 "/usr/include/libio.h" 3 4
>extern int _IO_getc (_IO_FILE *__fp);
>extern int _IO_putc (int __c, _IO_FILE *__fp);
>extern int _IO_feof (_IO_FILE *__fp) throw ();
>extern int _IO_ferror (_IO_FILE *__fp) throw ();
>
>extern int _IO_peekc_locked (_IO_FILE *__fp);
>
>
>
>
>
>extern void _IO_flockfile (_IO_FILE *) throw ();
>extern void _IO_funlockfile (_IO_FILE *) throw ();
>extern int _IO_ftrylockfile (_IO_FILE *) throw ();
># 481 "/usr/include/libio.h" 3 4
>extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict,
>   __gnuc_va_list, int *__restrict);
>extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict,
>    __gnuc_va_list);
>extern __ssize_t _IO_padn (_IO_FILE *, int, __ssize_t);
>extern size_t _IO_sgetn (_IO_FILE *, void *, size_t);
>
>extern __off64_t _IO_seekoff (_IO_FILE *, __off64_t, int, int);
>extern __off64_t _IO_seekpos (_IO_FILE *, __off64_t, int);
>
>extern void _IO_free_backup_area (_IO_FILE *) throw ();
># 543 "/usr/include/libio.h" 3 4
>}
># 73 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>typedef __gnuc_va_list va_list;
># 86 "/usr/include/stdio.h" 3 4
>
>
>typedef _G_fpos_t fpos_t;
>
>
>
>
>
>typedef _G_fpos64_t fpos64_t;
># 138 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 139 "/usr/include/stdio.h" 2 3 4
>
>
>
>extern struct _IO_FILE *stdin;
>extern struct _IO_FILE *stdout;
>extern struct _IO_FILE *stderr;
>
>
>
>
>
>
>
>
>
>extern int remove (__const char *__filename) throw ();
>
>extern int rename (__const char *__old, __const char *__new) throw ();
>
>
>
>
>extern int renameat (int __oldfd, __const char *__old, int __newfd,
>       __const char *__new) throw ();
>
>
>
>
>
>
>
>
>extern FILE *tmpfile (void);
># 181 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile64 (void);
>
>
>
>extern char *tmpnam (char *__s) throw ();
>
>
>
>
>
>extern char *tmpnam_r (char *__s) throw ();
># 203 "/usr/include/stdio.h" 3 4
>extern char *tempnam (__const char *__dir, __const char *__pfx)
>     throw () __attribute__ ((__malloc__));
>
>
>
>
>
>
>
>
>extern int fclose (FILE *__stream);
>
>
>
>
>extern int fflush (FILE *__stream);
>
># 228 "/usr/include/stdio.h" 3 4
>extern int fflush_unlocked (FILE *__stream);
># 238 "/usr/include/stdio.h" 3 4
>extern int fcloseall (void);
>
>
>
>
>
>
>
>
>
>extern FILE *fopen (__const char *__restrict __filename,
>      __const char *__restrict __modes);
>
>
>
>
>extern FILE *freopen (__const char *__restrict __filename,
>        __const char *__restrict __modes,
>        FILE *__restrict __stream);
># 269 "/usr/include/stdio.h" 3 4
>
>
>extern FILE *fopen64 (__const char *__restrict __filename,
>        __const char *__restrict __modes);
>extern FILE *freopen64 (__const char *__restrict __filename,
>   __const char *__restrict __modes,
>   FILE *__restrict __stream);
>
>
>
>
>extern FILE *fdopen (int __fd, __const char *__modes) throw ();
>
>
>
>
>
>extern FILE *fopencookie (void *__restrict __magic_cookie,
>     __const char *__restrict __modes,
>     _IO_cookie_io_functions_t __io_funcs) throw ();
>
>
>extern FILE *fmemopen (void *__s, size_t __len, __const char *__modes) throw ();
>
>
>
>
>extern FILE *open_memstream (char **__bufloc, size_t *__sizeloc) throw ();
>
>
>
>
>
>
>extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) throw ();
>
>
>
>extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf,
>      int __modes, size_t __n) throw ();
>
>
>
>
>
>extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf,
>         size_t __size) throw ();
>
>
>extern void setlinebuf (FILE *__stream) throw ();
>
>
>
>
>
>
>
>
>extern int fprintf (FILE *__restrict __stream,
>      __const char *__restrict __format, ...);
>
>
>
>
>extern int printf (__const char *__restrict __format, ...);
>
>extern int sprintf (char *__restrict __s,
>      __const char *__restrict __format, ...) throw ();
>
>
>
>
>
>extern int vfprintf (FILE *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg);
>
>
>
>
>extern int vprintf (__const char *__restrict __format, __gnuc_va_list __arg);
>
>extern int vsprintf (char *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg) throw ();
>
>
>
>
>
>extern int snprintf (char *__restrict __s, size_t __maxlen,
>       __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 3, 4)));
>
>extern int vsnprintf (char *__restrict __s, size_t __maxlen,
>        __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 3, 0)));
>
>
>
>
>
>
>extern int vasprintf (char **__restrict __ptr, __const char *__restrict __f,
>        __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0)));
>extern int __asprintf (char **__restrict __ptr,
>         __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>extern int asprintf (char **__restrict __ptr,
>       __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>
>
>
>
>extern int vdprintf (int __fd, __const char *__restrict __fmt,
>       __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__printf__, 2, 0)));
>extern int dprintf (int __fd, __const char *__restrict __fmt, ...)
>     __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>
>
>
>
>
>extern int fscanf (FILE *__restrict __stream,
>     __const char *__restrict __format, ...) ;
>
>
>
>
>extern int scanf (__const char *__restrict __format, ...) ;
>
>extern int sscanf (__const char *__restrict __s,
>     __const char *__restrict __format, ...) throw ();
>
>
>
>
>
>
>
>
>extern int vfscanf (FILE *__restrict __s, __const char *__restrict __format,
>      __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 2, 0))) ;
>
>
>
>
>
>extern int vscanf (__const char *__restrict __format, __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 1, 0))) ;
>
>
>extern int vsscanf (__const char *__restrict __s,
>      __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__scanf__, 2, 0)));
>
>
>
>
>
>
>
>
>
>extern int fgetc (FILE *__stream);
>extern int getc (FILE *__stream);
>
>
>
>
>
>extern int getchar (void);
>
># 460 "/usr/include/stdio.h" 3 4
>extern int getc_unlocked (FILE *__stream);
>extern int getchar_unlocked (void);
># 471 "/usr/include/stdio.h" 3 4
>extern int fgetc_unlocked (FILE *__stream);
>
>
>
>
>
>
>
>
>
>
>
>extern int fputc (int __c, FILE *__stream);
>extern int putc (int __c, FILE *__stream);
>
>
>
>
>
>extern int putchar (int __c);
>
># 504 "/usr/include/stdio.h" 3 4
>extern int fputc_unlocked (int __c, FILE *__stream);
>
>
>
>
>
>
>
>extern int putc_unlocked (int __c, FILE *__stream);
>extern int putchar_unlocked (int __c);
>
>
>
>
>
>
>extern int getw (FILE *__stream);
>
>
>extern int putw (int __w, FILE *__stream);
>
>
>
>
>
>
>
>
>extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
>     ;
>
>
>
>
>
>
>extern char *gets (char *__s) ;
>
># 550 "/usr/include/stdio.h" 3 4
>extern char *fgets_unlocked (char *__restrict __s, int __n,
>        FILE *__restrict __stream) ;
># 566 "/usr/include/stdio.h" 3 4
>extern __ssize_t __getdelim (char **__restrict __lineptr,
>          size_t *__restrict __n, int __delimiter,
>          FILE *__restrict __stream) ;
>extern __ssize_t getdelim (char **__restrict __lineptr,
>        size_t *__restrict __n, int __delimiter,
>        FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>extern __ssize_t getline (char **__restrict __lineptr,
>       size_t *__restrict __n,
>       FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>
>extern int fputs (__const char *__restrict __s, FILE *__restrict __stream);
>
>
>
>
>
>extern int puts (__const char *__s);
>
>
>
>
>
>
>extern int ungetc (int __c, FILE *__stream);
>
>
>
>
>
>
>extern size_t fread (void *__restrict __ptr, size_t __size,
>       size_t __n, FILE *__restrict __stream) ;
>
>
>
>
>extern size_t fwrite (__const void *__restrict __ptr, size_t __size,
>        size_t __n, FILE *__restrict __s) ;
>
># 627 "/usr/include/stdio.h" 3 4
>extern int fputs_unlocked (__const char *__restrict __s,
>      FILE *__restrict __stream);
># 638 "/usr/include/stdio.h" 3 4
>extern size_t fread_unlocked (void *__restrict __ptr, size_t __size,
>         size_t __n, FILE *__restrict __stream) ;
>extern size_t fwrite_unlocked (__const void *__restrict __ptr, size_t __size,
>          size_t __n, FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>
>extern int fseek (FILE *__stream, long int __off, int __whence);
>
>
>
>
>extern long int ftell (FILE *__stream) ;
>
>
>
>
>extern void rewind (FILE *__stream);
>
># 674 "/usr/include/stdio.h" 3 4
>extern int fseeko (FILE *__stream, __off_t __off, int __whence);
>
>
>
>
>extern __off_t ftello (FILE *__stream) ;
># 693 "/usr/include/stdio.h" 3 4
>
>
>
>
>
>
>extern int fgetpos (FILE *__restrict __stream, fpos_t *__restrict __pos);
>
>
>
>
>extern int fsetpos (FILE *__stream, __const fpos_t *__pos);
># 716 "/usr/include/stdio.h" 3 4
>
>
>
>extern int fseeko64 (FILE *__stream, __off64_t __off, int __whence);
>extern __off64_t ftello64 (FILE *__stream) ;
>extern int fgetpos64 (FILE *__restrict __stream, fpos64_t *__restrict __pos);
>extern int fsetpos64 (FILE *__stream, __const fpos64_t *__pos);
>
>
>
>
>extern void clearerr (FILE *__stream) throw ();
>
>extern int feof (FILE *__stream) throw () ;
>
>extern int ferror (FILE *__stream) throw () ;
>
>
>
>
>extern void clearerr_unlocked (FILE *__stream) throw ();
>extern int feof_unlocked (FILE *__stream) throw () ;
>extern int ferror_unlocked (FILE *__stream) throw () ;
>
>
>
>
>
>
>
>
>extern void perror (__const char *__s);
>
>
>
>
>
>
># 1 "/usr/include/bits/sys_errlist.h" 1 3 4
># 27 "/usr/include/bits/sys_errlist.h" 3 4
>extern int sys_nerr;
>extern __const char *__const sys_errlist[];
>
>
>extern int _sys_nerr;
>extern __const char *__const _sys_errlist[];
># 755 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>extern int fileno (FILE *__stream) throw () ;
>
>
>
>
>extern int fileno_unlocked (FILE *__stream) throw () ;
># 774 "/usr/include/stdio.h" 3 4
>extern FILE *popen (__const char *__command, __const char *__modes) ;
>
>
>
>
>
>extern int pclose (FILE *__stream);
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
>
>
>
>
>
>extern char *cuserid (char *__s);
>
>
>
>
>struct obstack;
>
>
>extern int obstack_printf (struct obstack *__restrict __obstack,
>      __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>extern int obstack_vprintf (struct obstack *__restrict __obstack,
>       __const char *__restrict __format,
>       __gnuc_va_list __args)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0)));
>
>
>
>
>
>
>
>extern void flockfile (FILE *__stream) throw ();
>
>
>
>extern int ftrylockfile (FILE *__stream) throw () ;
>
>
>extern void funlockfile (FILE *__stream) throw ();
># 844 "/usr/include/stdio.h" 3 4
>}
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 2 3
># 98 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>namespace std
>{
>  using ::FILE;
>  using ::fpos_t;
>
>  using ::clearerr;
>  using ::fclose;
>  using ::feof;
>  using ::ferror;
>  using ::fflush;
>  using ::fgetc;
>  using ::fgetpos;
>  using ::fgets;
>  using ::fopen;
>  using ::fprintf;
>  using ::fputc;
>  using ::fputs;
>  using ::fread;
>  using ::freopen;
>  using ::fscanf;
>  using ::fseek;
>  using ::fsetpos;
>  using ::ftell;
>  using ::fwrite;
>  using ::getc;
>  using ::getchar;
>  using ::gets;
>  using ::perror;
>  using ::printf;
>  using ::putc;
>  using ::putchar;
>  using ::puts;
>  using ::remove;
>  using ::rename;
>  using ::rewind;
>  using ::scanf;
>  using ::setbuf;
>  using ::setvbuf;
>  using ::sprintf;
>  using ::sscanf;
>  using ::tmpfile;
>  using ::tmpnam;
>  using ::ungetc;
>  using ::vfprintf;
>  using ::vprintf;
>  using ::vsprintf;
>}
># 154 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>namespace __gnu_cxx
>{
># 169 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cstdio" 3
>  using ::snprintf;
>  using ::vfscanf;
>  using ::vscanf;
>  using ::vsnprintf;
>  using ::vsscanf;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::snprintf;
>  using __gnu_cxx::vfscanf;
>  using __gnu_cxx::vscanf;
>  using __gnu_cxx::vsnprintf;
>  using __gnu_cxx::vsscanf;
>}
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 3
>
># 1 "/usr/include/locale.h" 1 3 4
># 29 "/usr/include/locale.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 30 "/usr/include/locale.h" 2 3 4
># 1 "/usr/include/bits/locale.h" 1 3 4
># 27 "/usr/include/bits/locale.h" 3 4
>enum
>{
>  __LC_CTYPE = 0,
>  __LC_NUMERIC = 1,
>  __LC_TIME = 2,
>  __LC_COLLATE = 3,
>  __LC_MONETARY = 4,
>  __LC_MESSAGES = 5,
>  __LC_ALL = 6,
>  __LC_PAPER = 7,
>  __LC_NAME = 8,
>  __LC_ADDRESS = 9,
>  __LC_TELEPHONE = 10,
>  __LC_MEASUREMENT = 11,
>  __LC_IDENTIFICATION = 12
>};
># 31 "/usr/include/locale.h" 2 3 4
>
>extern "C" {
># 52 "/usr/include/locale.h" 3 4
>struct lconv
>{
>
>
>  char *decimal_point;
>  char *thousands_sep;
>
>
>
>
>
>  char *grouping;
>
>
>
>
>
>  char *int_curr_symbol;
>  char *currency_symbol;
>  char *mon_decimal_point;
>  char *mon_thousands_sep;
>  char *mon_grouping;
>  char *positive_sign;
>  char *negative_sign;
>  char int_frac_digits;
>  char frac_digits;
>
>  char p_cs_precedes;
>
>  char p_sep_by_space;
>
>  char n_cs_precedes;
>
>  char n_sep_by_space;
>
>
>
>
>
>
>  char p_sign_posn;
>  char n_sign_posn;
>
>
>  char int_p_cs_precedes;
>
>  char int_p_sep_by_space;
>
>  char int_n_cs_precedes;
>
>  char int_n_sep_by_space;
>
>
>
>
>
>
>  char int_p_sign_posn;
>  char int_n_sign_posn;
># 119 "/usr/include/locale.h" 3 4
>};
>
>
>
>
>
>extern char *setlocale (int __category, __const char *__locale) throw ();
>
>
>extern struct lconv *localeconv (void) throw ();
>
>
># 148 "/usr/include/locale.h" 3 4
>typedef __locale_t locale_t;
>
>
>
>
>
>extern __locale_t newlocale (int __category_mask, __const char *__locale,
>        __locale_t __base) throw ();
># 189 "/usr/include/locale.h" 3 4
>extern __locale_t duplocale (__locale_t __dataset) throw ();
>
>
>
>extern void freelocale (__locale_t __dataset) throw ();
>
>
>
>
>
>
>extern __locale_t uselocale (__locale_t __dataset) throw ();
>
>
>
>
>
>
>
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/clocale" 2 3
>
>
>
>
>
>namespace std
>{
>  using ::lconv;
>  using ::setlocale;
>  using ::localeconv;
>}
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/langinfo.h" 1 3 4
># 24 "/usr/include/langinfo.h" 3 4
># 1 "/usr/include/nl_types.h" 1 3 4
># 31 "/usr/include/nl_types.h" 3 4
>extern "C" {
>
>
>typedef void *nl_catd;
>
>
>typedef int nl_item;
>
>
>
>
>
>extern nl_catd catopen (__const char *__cat_name, int __flag) __attribute__ ((__nonnull__ (1)));
>
>
>
>extern char *catgets (nl_catd __catalog, int __set, int __number,
>        __const char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int catclose (nl_catd __catalog) throw () __attribute__ ((__nonnull__ (1)));
>
>}
># 25 "/usr/include/langinfo.h" 2 3 4
>
># 1 "/usr/include/bits/locale.h" 1 3 4
># 27 "/usr/include/langinfo.h" 2 3 4
>
>
>extern "C" {
># 42 "/usr/include/langinfo.h" 3 4
>enum
>{
>
>
>
>  ABDAY_1 = (((__LC_TIME) << 16) | (0)),
>
>  ABDAY_2,
>
>  ABDAY_3,
>
>  ABDAY_4,
>
>  ABDAY_5,
>
>  ABDAY_6,
>
>  ABDAY_7,
>
>
>
>  DAY_1,
>
>  DAY_2,
>
>  DAY_3,
>
>  DAY_4,
>
>  DAY_5,
>
>  DAY_6,
>
>  DAY_7,
>
>
>
>  ABMON_1,
>
>  ABMON_2,
>
>  ABMON_3,
>
>  ABMON_4,
>
>  ABMON_5,
>
>  ABMON_6,
>
>  ABMON_7,
>
>  ABMON_8,
>
>  ABMON_9,
>
>  ABMON_10,
>
>  ABMON_11,
>
>  ABMON_12,
>
>
>
>  MON_1,
>
>  MON_2,
>
>  MON_3,
>
>  MON_4,
>
>  MON_5,
>
>  MON_6,
>
>  MON_7,
>
>  MON_8,
>
>  MON_9,
>
>  MON_10,
>
>  MON_11,
>
>  MON_12,
>
>
>  AM_STR,
>
>  PM_STR,
>
>
>  D_T_FMT,
>
>  D_FMT,
>
>  T_FMT,
>
>  T_FMT_AMPM,
>
>
>  ERA,
>
>  __ERA_YEAR,
>
>
>
>  ERA_D_FMT,
>
>  ALT_DIGITS,
>
>  ERA_D_T_FMT,
>
>  ERA_T_FMT,
>
>
>  _NL_TIME_ERA_NUM_ENTRIES,
>  _NL_TIME_ERA_ENTRIES,
>
>  _NL_WABDAY_1,
>  _NL_WABDAY_2,
>  _NL_WABDAY_3,
>  _NL_WABDAY_4,
>  _NL_WABDAY_5,
>  _NL_WABDAY_6,
>  _NL_WABDAY_7,
>
>
>  _NL_WDAY_1,
>  _NL_WDAY_2,
>  _NL_WDAY_3,
>  _NL_WDAY_4,
>  _NL_WDAY_5,
>  _NL_WDAY_6,
>  _NL_WDAY_7,
>
>
>  _NL_WABMON_1,
>  _NL_WABMON_2,
>  _NL_WABMON_3,
>  _NL_WABMON_4,
>  _NL_WABMON_5,
>  _NL_WABMON_6,
>  _NL_WABMON_7,
>  _NL_WABMON_8,
>  _NL_WABMON_9,
>  _NL_WABMON_10,
>  _NL_WABMON_11,
>  _NL_WABMON_12,
>
>
>  _NL_WMON_1,
>  _NL_WMON_2,
>  _NL_WMON_3,
>  _NL_WMON_4,
>  _NL_WMON_5,
>  _NL_WMON_6,
>  _NL_WMON_7,
>  _NL_WMON_8,
>  _NL_WMON_9,
>  _NL_WMON_10,
>  _NL_WMON_11,
>  _NL_WMON_12,
>
>  _NL_WAM_STR,
>  _NL_WPM_STR,
>
>  _NL_WD_T_FMT,
>  _NL_WD_FMT,
>  _NL_WT_FMT,
>  _NL_WT_FMT_AMPM,
>
>  _NL_WERA_YEAR,
>  _NL_WERA_D_FMT,
>  _NL_WALT_DIGITS,
>  _NL_WERA_D_T_FMT,
>  _NL_WERA_T_FMT,
>
>  _NL_TIME_WEEK_NDAYS,
>  _NL_TIME_WEEK_1STDAY,
>  _NL_TIME_WEEK_1STWEEK,
>  _NL_TIME_FIRST_WEEKDAY,
>  _NL_TIME_FIRST_WORKDAY,
>  _NL_TIME_CAL_DIRECTION,
>  _NL_TIME_TIMEZONE,
>
>  _DATE_FMT,
>
>  _NL_W_DATE_FMT,
>
>  _NL_TIME_CODESET,
>
>  _NL_NUM_LC_TIME,
>
>
>
>
>  _NL_COLLATE_NRULES = (((__LC_COLLATE) << 16) | (0)),
>  _NL_COLLATE_RULESETS,
>  _NL_COLLATE_TABLEMB,
>  _NL_COLLATE_WEIGHTMB,
>  _NL_COLLATE_EXTRAMB,
>  _NL_COLLATE_INDIRECTMB,
>  _NL_COLLATE_GAP1,
>  _NL_COLLATE_GAP2,
>  _NL_COLLATE_GAP3,
>  _NL_COLLATE_TABLEWC,
>  _NL_COLLATE_WEIGHTWC,
>  _NL_COLLATE_EXTRAWC,
>  _NL_COLLATE_INDIRECTWC,
>  _NL_COLLATE_SYMB_HASH_SIZEMB,
>  _NL_COLLATE_SYMB_TABLEMB,
>  _NL_COLLATE_SYMB_EXTRAMB,
>  _NL_COLLATE_COLLSEQMB,
>  _NL_COLLATE_COLLSEQWC,
>  _NL_COLLATE_CODESET,
>  _NL_NUM_LC_COLLATE,
>
>
>
>
>  _NL_CTYPE_CLASS = (((__LC_CTYPE) << 16) | (0)),
>  _NL_CTYPE_TOUPPER,
>  _NL_CTYPE_GAP1,
>  _NL_CTYPE_TOLOWER,
>  _NL_CTYPE_GAP2,
>  _NL_CTYPE_CLASS32,
>  _NL_CTYPE_GAP3,
>  _NL_CTYPE_GAP4,
>  _NL_CTYPE_GAP5,
>  _NL_CTYPE_GAP6,
>  _NL_CTYPE_CLASS_NAMES,
>  _NL_CTYPE_MAP_NAMES,
>  _NL_CTYPE_WIDTH,
>  _NL_CTYPE_MB_CUR_MAX,
>  _NL_CTYPE_CODESET_NAME,
>  CODESET = _NL_CTYPE_CODESET_NAME,
>
>  _NL_CTYPE_TOUPPER32,
>  _NL_CTYPE_TOLOWER32,
>  _NL_CTYPE_CLASS_OFFSET,
>  _NL_CTYPE_MAP_OFFSET,
>  _NL_CTYPE_INDIGITS_MB_LEN,
>  _NL_CTYPE_INDIGITS0_MB,
>  _NL_CTYPE_INDIGITS1_MB,
>  _NL_CTYPE_INDIGITS2_MB,
>  _NL_CTYPE_INDIGITS3_MB,
>  _NL_CTYPE_INDIGITS4_MB,
>  _NL_CTYPE_INDIGITS5_MB,
>  _NL_CTYPE_INDIGITS6_MB,
>  _NL_CTYPE_INDIGITS7_MB,
>  _NL_CTYPE_INDIGITS8_MB,
>  _NL_CTYPE_INDIGITS9_MB,
>  _NL_CTYPE_INDIGITS_WC_LEN,
>  _NL_CTYPE_INDIGITS0_WC,
>  _NL_CTYPE_INDIGITS1_WC,
>  _NL_CTYPE_INDIGITS2_WC,
>  _NL_CTYPE_INDIGITS3_WC,
>  _NL_CTYPE_INDIGITS4_WC,
>  _NL_CTYPE_INDIGITS5_WC,
>  _NL_CTYPE_INDIGITS6_WC,
>  _NL_CTYPE_INDIGITS7_WC,
>  _NL_CTYPE_INDIGITS8_WC,
>  _NL_CTYPE_INDIGITS9_WC,
>  _NL_CTYPE_OUTDIGIT0_MB,
>  _NL_CTYPE_OUTDIGIT1_MB,
>  _NL_CTYPE_OUTDIGIT2_MB,
>  _NL_CTYPE_OUTDIGIT3_MB,
>  _NL_CTYPE_OUTDIGIT4_MB,
>  _NL_CTYPE_OUTDIGIT5_MB,
>  _NL_CTYPE_OUTDIGIT6_MB,
>  _NL_CTYPE_OUTDIGIT7_MB,
>  _NL_CTYPE_OUTDIGIT8_MB,
>  _NL_CTYPE_OUTDIGIT9_MB,
>  _NL_CTYPE_OUTDIGIT0_WC,
>  _NL_CTYPE_OUTDIGIT1_WC,
>  _NL_CTYPE_OUTDIGIT2_WC,
>  _NL_CTYPE_OUTDIGIT3_WC,
>  _NL_CTYPE_OUTDIGIT4_WC,
>  _NL_CTYPE_OUTDIGIT5_WC,
>  _NL_CTYPE_OUTDIGIT6_WC,
>  _NL_CTYPE_OUTDIGIT7_WC,
>  _NL_CTYPE_OUTDIGIT8_WC,
>  _NL_CTYPE_OUTDIGIT9_WC,
>  _NL_CTYPE_TRANSLIT_TAB_SIZE,
>  _NL_CTYPE_TRANSLIT_FROM_IDX,
>  _NL_CTYPE_TRANSLIT_FROM_TBL,
>  _NL_CTYPE_TRANSLIT_TO_IDX,
>  _NL_CTYPE_TRANSLIT_TO_TBL,
>  _NL_CTYPE_TRANSLIT_DEFAULT_MISSING_LEN,
>  _NL_CTYPE_TRANSLIT_DEFAULT_MISSING,
>  _NL_CTYPE_TRANSLIT_IGNORE_LEN,
>  _NL_CTYPE_TRANSLIT_IGNORE,
>  _NL_CTYPE_MAP_TO_NONASCII,
>  _NL_CTYPE_EXTRA_MAP_1,
>  _NL_CTYPE_EXTRA_MAP_2,
>  _NL_CTYPE_EXTRA_MAP_3,
>  _NL_CTYPE_EXTRA_MAP_4,
>  _NL_CTYPE_EXTRA_MAP_5,
>  _NL_CTYPE_EXTRA_MAP_6,
>  _NL_CTYPE_EXTRA_MAP_7,
>  _NL_CTYPE_EXTRA_MAP_8,
>  _NL_CTYPE_EXTRA_MAP_9,
>  _NL_CTYPE_EXTRA_MAP_10,
>  _NL_CTYPE_EXTRA_MAP_11,
>  _NL_CTYPE_EXTRA_MAP_12,
>  _NL_CTYPE_EXTRA_MAP_13,
>  _NL_CTYPE_EXTRA_MAP_14,
>  _NL_NUM_LC_CTYPE,
>
>
>
>
>  __INT_CURR_SYMBOL = (((__LC_MONETARY) << 16) | (0)),
>
>
>
>  __CURRENCY_SYMBOL,
>
>
>
>  __MON_DECIMAL_POINT,
>
>
>
>  __MON_THOUSANDS_SEP,
>
>
>
>  __MON_GROUPING,
>
>
>
>  __POSITIVE_SIGN,
>
>
>
>  __NEGATIVE_SIGN,
>
>
>
>  __INT_FRAC_DIGITS,
>
>
>
>  __FRAC_DIGITS,
>
>
>
>  __P_CS_PRECEDES,
>
>
>
>  __P_SEP_BY_SPACE,
>
>
>
>  __N_CS_PRECEDES,
>
>
>
>  __N_SEP_BY_SPACE,
>
>
>
>  __P_SIGN_POSN,
>
>
>
>  __N_SIGN_POSN,
>
>
>
>  _NL_MONETARY_CRNCYSTR,
>
>  __INT_P_CS_PRECEDES,
>
>
>
>  __INT_P_SEP_BY_SPACE,
>
>
>
>  __INT_N_CS_PRECEDES,
>
>
>
>  __INT_N_SEP_BY_SPACE,
>
>
>
>  __INT_P_SIGN_POSN,
>
>
>
>  __INT_N_SIGN_POSN,
>
>
>
>  _NL_MONETARY_DUO_INT_CURR_SYMBOL,
>  _NL_MONETARY_DUO_CURRENCY_SYMBOL,
>  _NL_MONETARY_DUO_INT_FRAC_DIGITS,
>  _NL_MONETARY_DUO_FRAC_DIGITS,
>  _NL_MONETARY_DUO_P_CS_PRECEDES,
>  _NL_MONETARY_DUO_P_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_N_CS_PRECEDES,
>  _NL_MONETARY_DUO_N_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_INT_P_CS_PRECEDES,
>  _NL_MONETARY_DUO_INT_P_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_INT_N_CS_PRECEDES,
>  _NL_MONETARY_DUO_INT_N_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_P_SIGN_POSN,
>  _NL_MONETARY_DUO_N_SIGN_POSN,
>  _NL_MONETARY_DUO_INT_P_SIGN_POSN,
>  _NL_MONETARY_DUO_INT_N_SIGN_POSN,
>  _NL_MONETARY_UNO_VALID_FROM,
>  _NL_MONETARY_UNO_VALID_TO,
>  _NL_MONETARY_DUO_VALID_FROM,
>  _NL_MONETARY_DUO_VALID_TO,
>  _NL_MONETARY_CONVERSION_RATE,
>  _NL_MONETARY_DECIMAL_POINT_WC,
>  _NL_MONETARY_THOUSANDS_SEP_WC,
>  _NL_MONETARY_CODESET,
>  _NL_NUM_LC_MONETARY,
>
>
>
>  __DECIMAL_POINT = (((__LC_NUMERIC) << 16) | (0)),
>
>
>
>  RADIXCHAR = __DECIMAL_POINT,
>
>  __THOUSANDS_SEP,
>
>
>
>  THOUSEP = __THOUSANDS_SEP,
>
>  __GROUPING,
>
>
>
>  _NL_NUMERIC_DECIMAL_POINT_WC,
>  _NL_NUMERIC_THOUSANDS_SEP_WC,
>  _NL_NUMERIC_CODESET,
>  _NL_NUM_LC_NUMERIC,
>
>  __YESEXPR = (((__LC_MESSAGES) << 16) | (0)),
>
>  __NOEXPR,
>
>  __YESSTR,
>
>
>
>  __NOSTR,
>
>
>
>  _NL_MESSAGES_CODESET,
>  _NL_NUM_LC_MESSAGES,
>
>  _NL_PAPER_HEIGHT = (((__LC_PAPER) << 16) | (0)),
>  _NL_PAPER_WIDTH,
>  _NL_PAPER_CODESET,
>  _NL_NUM_LC_PAPER,
>
>  _NL_NAME_NAME_FMT = (((__LC_NAME) << 16) | (0)),
>  _NL_NAME_NAME_GEN,
>  _NL_NAME_NAME_MR,
>  _NL_NAME_NAME_MRS,
>  _NL_NAME_NAME_MISS,
>  _NL_NAME_NAME_MS,
>  _NL_NAME_CODESET,
>  _NL_NUM_LC_NAME,
>
>  _NL_ADDRESS_POSTAL_FMT = (((__LC_ADDRESS) << 16) | (0)),
>  _NL_ADDRESS_COUNTRY_NAME,
>  _NL_ADDRESS_COUNTRY_POST,
>  _NL_ADDRESS_COUNTRY_AB2,
>  _NL_ADDRESS_COUNTRY_AB3,
>  _NL_ADDRESS_COUNTRY_CAR,
>  _NL_ADDRESS_COUNTRY_NUM,
>  _NL_ADDRESS_COUNTRY_ISBN,
>  _NL_ADDRESS_LANG_NAME,
>  _NL_ADDRESS_LANG_AB,
>  _NL_ADDRESS_LANG_TERM,
>  _NL_ADDRESS_LANG_LIB,
>  _NL_ADDRESS_CODESET,
>  _NL_NUM_LC_ADDRESS,
>
>  _NL_TELEPHONE_TEL_INT_FMT = (((__LC_TELEPHONE) << 16) | (0)),
>  _NL_TELEPHONE_TEL_DOM_FMT,
>  _NL_TELEPHONE_INT_SELECT,
>  _NL_TELEPHONE_INT_PREFIX,
>  _NL_TELEPHONE_CODESET,
>  _NL_NUM_LC_TELEPHONE,
>
>  _NL_MEASUREMENT_MEASUREMENT = (((__LC_MEASUREMENT) << 16) | (0)),
>  _NL_MEASUREMENT_CODESET,
>  _NL_NUM_LC_MEASUREMENT,
>
>  _NL_IDENTIFICATION_TITLE = (((__LC_IDENTIFICATION) << 16) | (0)),
>  _NL_IDENTIFICATION_SOURCE,
>  _NL_IDENTIFICATION_ADDRESS,
>  _NL_IDENTIFICATION_CONTACT,
>  _NL_IDENTIFICATION_EMAIL,
>  _NL_IDENTIFICATION_TEL,
>  _NL_IDENTIFICATION_FAX,
>  _NL_IDENTIFICATION_LANGUAGE,
>  _NL_IDENTIFICATION_TERRITORY,
>  _NL_IDENTIFICATION_AUDIENCE,
>  _NL_IDENTIFICATION_APPLICATION,
>  _NL_IDENTIFICATION_ABBREVIATION,
>  _NL_IDENTIFICATION_REVISION,
>  _NL_IDENTIFICATION_DATE,
>  _NL_IDENTIFICATION_CATEGORY,
>  _NL_IDENTIFICATION_CODESET,
>  _NL_NUM_LC_IDENTIFICATION,
>
>
>  _NL_NUM
>};
># 582 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo (nl_item __item) throw ();
># 593 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo_l (nl_item __item, __locale_t l);
>
>
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/iconv.h" 1 3 4
># 24 "/usr/include/iconv.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 25 "/usr/include/iconv.h" 2 3 4
>
>
>extern "C" {
>
>
>typedef void *iconv_t;
>
>
>
>
>
>
>
>extern iconv_t iconv_open (__const char *__tocode, __const char *__fromcode);
>
>
>
>
>extern size_t iconv (iconv_t __cd, char **__restrict __inbuf,
>       size_t *__restrict __inbytesleft,
>       char **__restrict __outbuf,
>       size_t *__restrict __outbytesleft);
>
>
>
>
>
>extern int iconv_close (iconv_t __cd);
>
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/libintl.h" 1 3 4
># 35 "/usr/include/libintl.h" 3 4
>extern "C" {
>
>
>
>
>extern char *gettext (__const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (1)));
>
>
>
>extern char *dgettext (__const char *__domainname, __const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (2)));
>extern char *__dgettext (__const char *__domainname, __const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (2)));
>
>
>
>extern char *dcgettext (__const char *__domainname,
>   __const char *__msgid, int __category)
>     throw () __attribute__ ((__format_arg__ (2)));
>extern char *__dcgettext (__const char *__domainname,
>     __const char *__msgid, int __category)
>     throw () __attribute__ ((__format_arg__ (2)));
>
>
>
>
>extern char *ngettext (__const char *__msgid1, __const char *__msgid2,
>         unsigned long int __n)
>     throw () __attribute__ ((__format_arg__ (1))) __attribute__ ((__format_arg__ (2)));
>
>
>
>extern char *dngettext (__const char *__domainname, __const char *__msgid1,
>   __const char *__msgid2, unsigned long int __n)
>     throw () __attribute__ ((__format_arg__ (2))) __attribute__ ((__format_arg__ (3)));
>
>
>
>extern char *dcngettext (__const char *__domainname, __const char *__msgid1,
>    __const char *__msgid2, unsigned long int __n,
>    int __category)
>     throw () __attribute__ ((__format_arg__ (2))) __attribute__ ((__format_arg__ (3)));
>
>
>
>
>
>extern char *textdomain (__const char *__domainname) throw ();
>
>
>
>extern char *bindtextdomain (__const char *__domainname,
>        __const char *__dirname) throw ();
>
>
>
>extern char *bind_textdomain_codeset (__const char *__domainname,
>          __const char *__codeset) throw ();
># 122 "/usr/include/libintl.h" 3 4
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 2 3
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>  extern "C" __typeof(uselocale) __uselocale;
>}
>
>
>namespace std
>{
>  typedef __locale_t __c_locale;
>
>
>
>
>
>  template<typename _Tv>
>    int
>    __convert_from_v(char* __out,
>       const int __size __attribute__ ((__unused__)),
>       const char* __fmt,
>
>       _Tv __v, const __c_locale& __cloc, int __prec)
>    {
>      __c_locale __old = __gnu_cxx::__uselocale(__cloc);
># 86 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++locale.h" 3
>      const int __ret = std::snprintf(__out, __size, __fmt, __prec, __v);
>
>
>
>
>
>      __gnu_cxx::__uselocale(__old);
>
>
>
>
>      return __ret;
>    }
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++io.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++io.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 1 3
># 33 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 3
>#pragma GCC visibility push(default)
># 132 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
># 1 "/usr/include/pthread.h" 1 3 4
># 23 "/usr/include/pthread.h" 3 4
># 1 "/usr/include/sched.h" 1 3 4
># 29 "/usr/include/sched.h" 3 4
># 1 "/usr/include/time.h" 1 3 4
># 30 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/bits/sched.h" 1 3 4
># 65 "/usr/include/bits/sched.h" 3 4
>struct sched_param
>  {
>    int __sched_priority;
>  };
>
>extern "C" {
>
>
>
>extern int clone (int (*__fn) (void *__arg), void *__child_stack,
>    int __flags, void *__arg, ...) throw ();
>
>
>extern int unshare (int __flags) throw ();
>
>
>}
>
>
>
>
>
>
>
>struct __sched_param
>  {
>    int __sched_priority;
>  };
># 104 "/usr/include/bits/sched.h" 3 4
>typedef unsigned long int __cpu_mask;
>
>
>
>
>
>
>typedef struct
>{
>  __cpu_mask __bits[1024 / (8 * sizeof (__cpu_mask))];
>} cpu_set_t;
># 33 "/usr/include/sched.h" 2 3 4
>
>
>
>
>extern "C" {
>
>
>extern int sched_setparam (__pid_t __pid, __const struct sched_param *__param)
>     throw ();
>
>
>extern int sched_getparam (__pid_t __pid, struct sched_param *__param) throw ();
>
>
>extern int sched_setscheduler (__pid_t __pid, int __policy,
>          __const struct sched_param *__param) throw ();
>
>
>extern int sched_getscheduler (__pid_t __pid) throw ();
>
>
>extern int sched_yield (void) throw ();
>
>
>extern int sched_get_priority_max (int __algorithm) throw ();
>
>
>extern int sched_get_priority_min (int __algorithm) throw ();
>
>
>extern int sched_rr_get_interval (__pid_t __pid, struct timespec *__t) throw ();
># 76 "/usr/include/sched.h" 3 4
>extern int sched_setaffinity (__pid_t __pid, size_t __cpusetsize,
>         __const cpu_set_t *__cpuset) throw ();
>
>
>extern int sched_getaffinity (__pid_t __pid, size_t __cpusetsize,
>         cpu_set_t *__cpuset) throw ();
>
>
>}
># 24 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/time.h" 1 3 4
># 31 "/usr/include/time.h" 3 4
>extern "C" {
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 40 "/usr/include/time.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/time.h" 1 3 4
># 44 "/usr/include/time.h" 2 3 4
># 132 "/usr/include/time.h" 3 4
>
>
>struct tm
>{
>  int tm_sec;
>  int tm_min;
>  int tm_hour;
>  int tm_mday;
>  int tm_mon;
>  int tm_year;
>  int tm_wday;
>  int tm_yday;
>  int tm_isdst;
>
>
>  long int tm_gmtoff;
>  __const char *tm_zone;
>
>
>
>
>};
>
>
>
>
>
>
>
>
>struct itimerspec
>  {
>    struct timespec it_interval;
>    struct timespec it_value;
>  };
>
>
>struct sigevent;
># 181 "/usr/include/time.h" 3 4
>
>
>
>extern clock_t clock (void) throw ();
>
>
>extern time_t time (time_t *__timer) throw ();
>
>
>extern double difftime (time_t __time1, time_t __time0)
>     throw () __attribute__ ((__const__));
>
>
>extern time_t mktime (struct tm *__tp) throw ();
>
>
>
>
>
>extern size_t strftime (char *__restrict __s, size_t __maxsize,
>   __const char *__restrict __format,
>   __const struct tm *__restrict __tp) throw ();
>
>
>
>
>
>extern char *strptime (__const char *__restrict __s,
>         __const char *__restrict __fmt, struct tm *__tp)
>     throw ();
>
>
>
>
>
>
>
>extern size_t strftime_l (char *__restrict __s, size_t __maxsize,
>     __const char *__restrict __format,
>     __const struct tm *__restrict __tp,
>     __locale_t __loc) throw ();
>
>extern char *strptime_l (__const char *__restrict __s,
>    __const char *__restrict __fmt, struct tm *__tp,
>    __locale_t __loc) throw ();
>
>
>
>
>
>
>extern struct tm *gmtime (__const time_t *__timer) throw ();
>
>
>
>extern struct tm *localtime (__const time_t *__timer) throw ();
>
>
>
>
>
>extern struct tm *gmtime_r (__const time_t *__restrict __timer,
>       struct tm *__restrict __tp) throw ();
>
>
>
>extern struct tm *localtime_r (__const time_t *__restrict __timer,
>          struct tm *__restrict __tp) throw ();
>
>
>
>
>
>extern char *asctime (__const struct tm *__tp) throw ();
>
>
>extern char *ctime (__const time_t *__timer) throw ();
>
>
>
>
>
>
>
>extern char *asctime_r (__const struct tm *__restrict __tp,
>   char *__restrict __buf) throw ();
>
>
>extern char *ctime_r (__const time_t *__restrict __timer,
>        char *__restrict __buf) throw ();
>
>
>
>
>extern char *__tzname[2];
>extern int __daylight;
>extern long int __timezone;
>
>
>
>
>extern char *tzname[2];
>
>
>
>extern void tzset (void) throw ();
>
>
>
>extern int daylight;
>extern long int timezone;
>
>
>
>
>
>extern int stime (__const time_t *__when) throw ();
># 312 "/usr/include/time.h" 3 4
>extern time_t timegm (struct tm *__tp) throw ();
>
>
>extern time_t timelocal (struct tm *__tp) throw ();
>
>
>extern int dysize (int __year) throw () __attribute__ ((__const__));
># 327 "/usr/include/time.h" 3 4
>extern int nanosleep (__const struct timespec *__requested_time,
>        struct timespec *__remaining);
>
>
>
>extern int clock_getres (clockid_t __clock_id, struct timespec *__res) throw ();
>
>
>extern int clock_gettime (clockid_t __clock_id, struct timespec *__tp) throw ();
>
>
>extern int clock_settime (clockid_t __clock_id, __const struct timespec *__tp)
>     throw ();
>
>
>
>
>
>
>extern int clock_nanosleep (clockid_t __clock_id, int __flags,
>       __const struct timespec *__req,
>       struct timespec *__rem);
>
>
>extern int clock_getcpuclockid (pid_t __pid, clockid_t *__clock_id) throw ();
>
>
>
>
>extern int timer_create (clockid_t __clock_id,
>    struct sigevent *__restrict __evp,
>    timer_t *__restrict __timerid) throw ();
>
>
>extern int timer_delete (timer_t __timerid) throw ();
>
>
>extern int timer_settime (timer_t __timerid, int __flags,
>     __const struct itimerspec *__restrict __value,
>     struct itimerspec *__restrict __ovalue) throw ();
>
>
>extern int timer_gettime (timer_t __timerid, struct itimerspec *__value)
>     throw ();
>
>
>extern int timer_getoverrun (timer_t __timerid) throw ();
># 389 "/usr/include/time.h" 3 4
>extern int getdate_err;
># 398 "/usr/include/time.h" 3 4
>extern struct tm *getdate (__const char *__string);
># 412 "/usr/include/time.h" 3 4
>extern int getdate_r (__const char *__restrict __string,
>        struct tm *__restrict __resbufp);
>
>
>}
># 25 "/usr/include/pthread.h" 2 3 4
>
>
># 1 "/usr/include/signal.h" 1 3 4
># 31 "/usr/include/signal.h" 3 4
>extern "C" {
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 34 "/usr/include/signal.h" 2 3 4
># 400 "/usr/include/signal.h" 3 4
>}
># 28 "/usr/include/pthread.h" 2 3 4
>
># 1 "/usr/include/bits/setjmp.h" 1 3 4
># 29 "/usr/include/bits/setjmp.h" 3 4
>typedef int __jmp_buf[6];
># 30 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 31 "/usr/include/pthread.h" 2 3 4
>
>
>
>enum
>{
>  PTHREAD_CREATE_JOINABLE,
>
>  PTHREAD_CREATE_DETACHED
>
>};
>
>
>
>enum
>{
>  PTHREAD_MUTEX_TIMED_NP,
>  PTHREAD_MUTEX_RECURSIVE_NP,
>  PTHREAD_MUTEX_ERRORCHECK_NP,
>  PTHREAD_MUTEX_ADAPTIVE_NP
>
>  ,
>  PTHREAD_MUTEX_NORMAL = PTHREAD_MUTEX_TIMED_NP,
>  PTHREAD_MUTEX_RECURSIVE = PTHREAD_MUTEX_RECURSIVE_NP,
>  PTHREAD_MUTEX_ERRORCHECK = PTHREAD_MUTEX_ERRORCHECK_NP,
>  PTHREAD_MUTEX_DEFAULT = PTHREAD_MUTEX_NORMAL
>
>
>
>  , PTHREAD_MUTEX_FAST_NP = PTHREAD_MUTEX_TIMED_NP
>
>};
>
>
>
>
>enum
>{
>  PTHREAD_MUTEX_STALLED_NP,
>  PTHREAD_MUTEX_ROBUST_NP
>};
>
>
>
>
>
>enum
>{
>  PTHREAD_PRIO_NONE,
>  PTHREAD_PRIO_INHERIT,
>  PTHREAD_PRIO_PROTECT
>};
># 113 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_RWLOCK_PREFER_READER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP,
>  PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_READER_NP
>};
># 143 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_INHERIT_SCHED,
>
>  PTHREAD_EXPLICIT_SCHED
>
>};
>
>
>
>enum
>{
>  PTHREAD_SCOPE_SYSTEM,
>
>  PTHREAD_SCOPE_PROCESS
>
>};
>
>
>
>enum
>{
>  PTHREAD_PROCESS_PRIVATE,
>
>  PTHREAD_PROCESS_SHARED
>
>};
># 178 "/usr/include/pthread.h" 3 4
>struct _pthread_cleanup_buffer
>{
>  void (*__routine) (void *);
>  void *__arg;
>  int __canceltype;
>  struct _pthread_cleanup_buffer *__prev;
>};
>
>
>enum
>{
>  PTHREAD_CANCEL_ENABLE,
>
>  PTHREAD_CANCEL_DISABLE
>
>};
>enum
>{
>  PTHREAD_CANCEL_DEFERRED,
>
>  PTHREAD_CANCEL_ASYNCHRONOUS
>
>};
># 216 "/usr/include/pthread.h" 3 4
>extern "C" {
>
>
>
>
>extern int pthread_create (pthread_t *__restrict __newthread,
>      __const pthread_attr_t *__restrict __attr,
>      void *(*__start_routine) (void *),
>      void *__restrict __arg) throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>
>
>extern void pthread_exit (void *__retval) __attribute__ ((__noreturn__));
>
>
>
>
>
>
>
>extern int pthread_join (pthread_t __th, void **__thread_return);
>
>
>
>
>extern int pthread_tryjoin_np (pthread_t __th, void **__thread_return) throw ();
>
>
>
>
>
>
>
>extern int pthread_timedjoin_np (pthread_t __th, void **__thread_return,
>     __const struct timespec *__abstime);
>
>
>
>
>
>
>extern int pthread_detach (pthread_t __th) throw ();
>
>
>
>extern pthread_t pthread_self (void) throw () __attribute__ ((__const__));
>
>
>extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw ();
>
>
>
>
>
>
>
>extern int pthread_attr_init (pthread_attr_t *__attr) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_destroy (pthread_attr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_getdetachstate (__const pthread_attr_t *__attr,
>     int *__detachstate)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setdetachstate (pthread_attr_t *__attr,
>     int __detachstate)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getguardsize (__const pthread_attr_t *__attr,
>          size_t *__guardsize)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setguardsize (pthread_attr_t *__attr,
>          size_t __guardsize)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getschedparam (__const pthread_attr_t *__restrict
>           __attr,
>           struct sched_param *__restrict __param)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setschedparam (pthread_attr_t *__restrict __attr,
>           __const struct sched_param *__restrict
>           __param) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_getschedpolicy (__const pthread_attr_t *__restrict
>     __attr, int *__restrict __policy)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_getinheritsched (__const pthread_attr_t *__restrict
>      __attr, int *__restrict __inherit)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setinheritsched (pthread_attr_t *__attr,
>      int __inherit)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getscope (__const pthread_attr_t *__restrict __attr,
>      int *__restrict __scope)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_attr_getstackaddr (__const pthread_attr_t *__restrict
>          __attr, void **__restrict __stackaddr)
>     throw () __attribute__ ((__nonnull__ (1, 2))) __attribute__ ((__deprecated__));
>
>
>
>
>
>extern int pthread_attr_setstackaddr (pthread_attr_t *__attr,
>          void *__stackaddr)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__));
>
>
>extern int pthread_attr_getstacksize (__const pthread_attr_t *__restrict
>          __attr, size_t *__restrict __stacksize)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int pthread_attr_setstacksize (pthread_attr_t *__attr,
>          size_t __stacksize)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_attr_getstack (__const pthread_attr_t *__restrict __attr,
>      void **__restrict __stackaddr,
>      size_t *__restrict __stacksize)
>     throw () __attribute__ ((__nonnull__ (1, 2, 3)));
>
>
>
>
>extern int pthread_attr_setstack (pthread_attr_t *__attr, void *__stackaddr,
>      size_t __stacksize) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int pthread_attr_setaffinity_np (pthread_attr_t *__attr,
>     size_t __cpusetsize,
>     __const cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>extern int pthread_attr_getaffinity_np (__const pthread_attr_t *__attr,
>     size_t __cpusetsize,
>     cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>
>
>extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>
>
>extern int pthread_setschedparam (pthread_t __target_thread, int __policy,
>      __const struct sched_param *__param)
>     throw () __attribute__ ((__nonnull__ (3)));
>
>
>extern int pthread_getschedparam (pthread_t __target_thread,
>      int *__restrict __policy,
>      struct sched_param *__restrict __param)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>
>extern int pthread_setschedprio (pthread_t __target_thread, int __prio)
>     throw ();
>
>
>
>
>extern int pthread_getconcurrency (void) throw ();
>
>
>extern int pthread_setconcurrency (int __level) throw ();
>
>
>
>
>
>
>
>extern int pthread_yield (void) throw ();
>
>
>
>
>extern int pthread_setaffinity_np (pthread_t __th, size_t __cpusetsize,
>       __const cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (3)));
>
>
>extern int pthread_getaffinity_np (pthread_t __th, size_t __cpusetsize,
>       cpu_set_t *__cpuset)
>     throw () __attribute__ ((__nonnull__ (3)));
># 462 "/usr/include/pthread.h" 3 4
>extern int pthread_once (pthread_once_t *__once_control,
>    void (*__init_routine) (void)) __attribute__ ((__nonnull__ (1, 2)));
># 474 "/usr/include/pthread.h" 3 4
>extern int pthread_setcancelstate (int __state, int *__oldstate);
>
>
>
>extern int pthread_setcanceltype (int __type, int *__oldtype);
>
>
>extern int pthread_cancel (pthread_t __th);
>
>
>
>
>extern void pthread_testcancel (void);
>
>
>
>
>typedef struct
>{
>  struct
>  {
>    __jmp_buf __cancel_jmp_buf;
>    int __mask_was_saved;
>  } __cancel_jmp_buf[1];
>  void *__pad[4];
>} __pthread_unwind_buf_t __attribute__ ((__aligned__));
># 508 "/usr/include/pthread.h" 3 4
>struct __pthread_cleanup_frame
>{
>  void (*__cancel_routine) (void *);
>  void *__cancel_arg;
>  int __do_it;
>  int __cancel_type;
>};
>
>
>
>
>class __pthread_cleanup_class
>{
>  void (*__cancel_routine) (void *);
>  void *__cancel_arg;
>  int __do_it;
>  int __cancel_type;
>
> public:
>  __pthread_cleanup_class (void (*__fct) (void *), void *__arg)
>    : __cancel_routine (__fct), __cancel_arg (__arg), __do_it (1) { }
>  ~__pthread_cleanup_class () { if (__do_it) __cancel_routine (__cancel_arg); }
>  void __setdoit (int __newval) { __do_it = __newval; }
>  void __defer () { pthread_setcanceltype (PTHREAD_CANCEL_DEFERRED,
>        &__cancel_type); }
>  void __restore () const { pthread_setcanceltype (__cancel_type, 0); }
>};
># 708 "/usr/include/pthread.h" 3 4
>struct __jmp_buf_tag;
>extern int __sigsetjmp (struct __jmp_buf_tag *__env, int __savemask) throw ();
>
>
>
>
>
>extern int pthread_mutex_init (pthread_mutex_t *__mutex,
>          __const pthread_mutexattr_t *__mutexattr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutex_destroy (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutex_trylock (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutex_lock (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_mutex_timedlock (pthread_mutex_t *__restrict __mutex,
>                                    __const struct timespec *__restrict
>                                    __abstime) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutex_unlock (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int pthread_mutex_getprioceiling (__const pthread_mutex_t *
>      __restrict __mutex,
>      int *__restrict __prioceiling)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutex_setprioceiling (pthread_mutex_t *__restrict __mutex,
>      int __prioceiling,
>      int *__restrict __old_ceiling)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>
>
>extern int pthread_mutex_consistent_np (pthread_mutex_t *__mutex)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_getpshared (__const pthread_mutexattr_t *
>      __restrict __attr,
>      int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_mutexattr_setpshared (pthread_mutexattr_t *__attr,
>      int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_mutexattr_gettype (__const pthread_mutexattr_t *__restrict
>          __attr, int *__restrict __kind)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_getprotocol (__const pthread_mutexattr_t *
>       __restrict __attr,
>       int *__restrict __protocol)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_mutexattr_setprotocol (pthread_mutexattr_t *__attr,
>       int __protocol)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_mutexattr_getprioceiling (__const pthread_mutexattr_t *
>          __restrict __attr,
>          int *__restrict __prioceiling)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_mutexattr_setprioceiling (pthread_mutexattr_t *__attr,
>          int __prioceiling)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int pthread_mutexattr_getrobust_np (__const pthread_mutexattr_t *__attr,
>        int *__robustness)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_mutexattr_setrobust_np (pthread_mutexattr_t *__attr,
>        int __robustness)
>     throw () __attribute__ ((__nonnull__ (1)));
># 842 "/usr/include/pthread.h" 3 4
>extern int pthread_rwlock_init (pthread_rwlock_t *__restrict __rwlock,
>    __const pthread_rwlockattr_t *__restrict
>    __attr) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock)
>  throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock,
>           __const struct timespec *__restrict
>           __abstime) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock,
>           __const struct timespec *__restrict
>           __abstime) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlockattr_getpshared (__const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr,
>       int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_rwlockattr_getkind_np (__const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pref)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr,
>       int __pref) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int pthread_cond_init (pthread_cond_t *__restrict __cond,
>         __const pthread_condattr_t *__restrict
>         __cond_attr) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_cond_destroy (pthread_cond_t *__cond)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_cond_signal (pthread_cond_t *__cond)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_cond_broadcast (pthread_cond_t *__cond)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int pthread_cond_wait (pthread_cond_t *__restrict __cond,
>         pthread_mutex_t *__restrict __mutex)
>     __attribute__ ((__nonnull__ (1, 2)));
># 954 "/usr/include/pthread.h" 3 4
>extern int pthread_cond_timedwait (pthread_cond_t *__restrict __cond,
>       pthread_mutex_t *__restrict __mutex,
>       __const struct timespec *__restrict
>       __abstime) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>
>
>
>extern int pthread_condattr_init (pthread_condattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_condattr_destroy (pthread_condattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_condattr_getpshared (__const pthread_condattr_t *
>                                        __restrict __attr,
>                                        int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_condattr_setpshared (pthread_condattr_t *__attr,
>                                        int __pshared) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_condattr_getclock (__const pthread_condattr_t *
>          __restrict __attr,
>          __clockid_t *__restrict __clock_id)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_condattr_setclock (pthread_condattr_t *__attr,
>          __clockid_t __clock_id)
>     throw () __attribute__ ((__nonnull__ (1)));
># 998 "/usr/include/pthread.h" 3 4
>extern int pthread_spin_init (pthread_spinlock_t *__lock, int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_destroy (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_lock (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_trylock (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_spin_unlock (pthread_spinlock_t *__lock)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int pthread_barrier_init (pthread_barrier_t *__restrict __barrier,
>     __const pthread_barrierattr_t *__restrict
>     __attr, unsigned int __count)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrier_destroy (pthread_barrier_t *__barrier)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrier_wait (pthread_barrier_t *__barrier)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int pthread_barrierattr_init (pthread_barrierattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrierattr_destroy (pthread_barrierattr_t *__attr)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_barrierattr_getpshared (__const pthread_barrierattr_t *
>        __restrict __attr,
>        int *__restrict __pshared)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int pthread_barrierattr_setpshared (pthread_barrierattr_t *__attr,
>                                           int __pshared)
>     throw () __attribute__ ((__nonnull__ (1)));
># 1065 "/usr/include/pthread.h" 3 4
>extern int pthread_key_create (pthread_key_t *__key,
>          void (*__destr_function) (void *))
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int pthread_key_delete (pthread_key_t __key) throw ();
>
>
>extern void *pthread_getspecific (pthread_key_t __key) throw ();
>
>
>extern int pthread_setspecific (pthread_key_t __key,
>    __const void *__pointer) throw () ;
>
>
>
>
>extern int pthread_getcpuclockid (pthread_t __thread_id,
>      __clockid_t *__clock_id)
>     throw () __attribute__ ((__nonnull__ (2)));
># 1099 "/usr/include/pthread.h" 3 4
>extern int pthread_atfork (void (*__prepare) (void),
>      void (*__parent) (void),
>      void (*__child) (void)) throw ();
># 1113 "/usr/include/pthread.h" 3 4
>}
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 2 3
># 1 "/usr/include/unistd.h" 1 3 4
># 28 "/usr/include/unistd.h" 3 4
>extern "C" {
># 173 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/bits/posix_opt.h" 1 3 4
># 174 "/usr/include/unistd.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/environments.h" 1 3 4
># 178 "/usr/include/unistd.h" 2 3 4
># 197 "/usr/include/unistd.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 198 "/usr/include/unistd.h" 2 3 4
># 238 "/usr/include/unistd.h" 3 4
>typedef __intptr_t intptr_t;
>
>
>
>
>
>
>typedef __socklen_t socklen_t;
># 258 "/usr/include/unistd.h" 3 4
>extern int access (__const char *__name, int __type) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int euidaccess (__const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int eaccess (__const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int faccessat (int __fd, __const char *__file, int __type, int __flag)
>     throw () __attribute__ ((__nonnull__ (2))) ;
># 301 "/usr/include/unistd.h" 3 4
>extern __off_t lseek (int __fd, __off_t __offset, int __whence) throw ();
># 312 "/usr/include/unistd.h" 3 4
>extern __off64_t lseek64 (int __fd, __off64_t __offset, int __whence)
>     throw ();
>
>
>
>
>
>
>extern int close (int __fd);
>
>
>
>
>
>
>extern ssize_t read (int __fd, void *__buf, size_t __nbytes) ;
>
>
>
>
>
>extern ssize_t write (int __fd, __const void *__buf, size_t __n) ;
># 343 "/usr/include/unistd.h" 3 4
>extern ssize_t pread (int __fd, void *__buf, size_t __nbytes,
>        __off_t __offset) ;
>
>
>
>
>
>
>extern ssize_t pwrite (int __fd, __const void *__buf, size_t __n,
>         __off_t __offset) ;
># 371 "/usr/include/unistd.h" 3 4
>extern ssize_t pread64 (int __fd, void *__buf, size_t __nbytes,
>   __off64_t __offset) ;
>
>
>extern ssize_t pwrite64 (int __fd, __const void *__buf, size_t __n,
>    __off64_t __offset) ;
>
>
>
>
>
>
>
>extern int pipe (int __pipedes[2]) throw () ;
># 393 "/usr/include/unistd.h" 3 4
>extern unsigned int alarm (unsigned int __seconds) throw ();
># 405 "/usr/include/unistd.h" 3 4
>extern unsigned int sleep (unsigned int __seconds);
>
>
>
>
>
>
>extern __useconds_t ualarm (__useconds_t __value, __useconds_t __interval)
>     throw ();
>
>
>
>
>
>
>extern int usleep (__useconds_t __useconds);
># 429 "/usr/include/unistd.h" 3 4
>extern int pause (void);
>
>
>
>extern int chown (__const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchown (int __fd, __uid_t __owner, __gid_t __group) throw () ;
>
>
>
>
>extern int lchown (__const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>extern int fchownat (int __fd, __const char *__file, __uid_t __owner,
>       __gid_t __group, int __flag)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int chdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchdir (int __fd) throw () ;
># 471 "/usr/include/unistd.h" 3 4
>extern char *getcwd (char *__buf, size_t __size) throw () ;
>
>
>
>
>
>extern char *get_current_dir_name (void) throw ();
>
>
>
>
>
>
>extern char *getwd (char *__buf)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__)) ;
>
>
>
>
>extern int dup (int __fd) throw () ;
>
>
>extern int dup2 (int __fd, int __fd2) throw ();
>
>
>extern char **__environ;
>
>extern char **environ;
>
>
>
>
>
>extern int execve (__const char *__path, char *__const __argv[],
>     char *__const __envp[]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int fexecve (int __fd, char *__const __argv[], char *__const __envp[])
>     throw ();
>
>
>
>
>extern int execv (__const char *__path, char *__const __argv[])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execle (__const char *__path, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execl (__const char *__path, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execvp (__const char *__file, char *__const __argv[])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int execlp (__const char *__file, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int nice (int __inc) throw () ;
>
>
>
>
>extern void _exit (int __status) __attribute__ ((__noreturn__));
>
>
>
>
>
># 1 "/usr/include/bits/confname.h" 1 3 4
># 26 "/usr/include/bits/confname.h" 3 4
>enum
>  {
>    _PC_LINK_MAX,
>
>    _PC_MAX_CANON,
>
>    _PC_MAX_INPUT,
>
>    _PC_NAME_MAX,
>
>    _PC_PATH_MAX,
>
>    _PC_PIPE_BUF,
>
>    _PC_CHOWN_RESTRICTED,
>
>    _PC_NO_TRUNC,
>
>    _PC_VDISABLE,
>
>    _PC_SYNC_IO,
>
>    _PC_ASYNC_IO,
>
>    _PC_PRIO_IO,
>
>    _PC_SOCK_MAXBUF,
>
>    _PC_FILESIZEBITS,
>
>    _PC_REC_INCR_XFER_SIZE,
>
>    _PC_REC_MAX_XFER_SIZE,
>
>    _PC_REC_MIN_XFER_SIZE,
>
>    _PC_REC_XFER_ALIGN,
>
>    _PC_ALLOC_SIZE_MIN,
>
>    _PC_SYMLINK_MAX,
>
>    _PC_2_SYMLINKS
>
>  };
>
>
>enum
>  {
>    _SC_ARG_MAX,
>
>    _SC_CHILD_MAX,
>
>    _SC_CLK_TCK,
>
>    _SC_NGROUPS_MAX,
>
>    _SC_OPEN_MAX,
>
>    _SC_STREAM_MAX,
>
>    _SC_TZNAME_MAX,
>
>    _SC_JOB_CONTROL,
>
>    _SC_SAVED_IDS,
>
>    _SC_REALTIME_SIGNALS,
>
>    _SC_PRIORITY_SCHEDULING,
>
>    _SC_TIMERS,
>
>    _SC_ASYNCHRONOUS_IO,
>
>    _SC_PRIORITIZED_IO,
>
>    _SC_SYNCHRONIZED_IO,
>
>    _SC_FSYNC,
>
>    _SC_MAPPED_FILES,
>
>    _SC_MEMLOCK,
>
>    _SC_MEMLOCK_RANGE,
>
>    _SC_MEMORY_PROTECTION,
>
>    _SC_MESSAGE_PASSING,
>
>    _SC_SEMAPHORES,
>
>    _SC_SHARED_MEMORY_OBJECTS,
>
>    _SC_AIO_LISTIO_MAX,
>
>    _SC_AIO_MAX,
>
>    _SC_AIO_PRIO_DELTA_MAX,
>
>    _SC_DELAYTIMER_MAX,
>
>    _SC_MQ_OPEN_MAX,
>
>    _SC_MQ_PRIO_MAX,
>
>    _SC_VERSION,
>
>    _SC_PAGESIZE,
>
>
>    _SC_RTSIG_MAX,
>
>    _SC_SEM_NSEMS_MAX,
>
>    _SC_SEM_VALUE_MAX,
>
>    _SC_SIGQUEUE_MAX,
>
>    _SC_TIMER_MAX,
>
>
>
>
>    _SC_BC_BASE_MAX,
>
>    _SC_BC_DIM_MAX,
>
>    _SC_BC_SCALE_MAX,
>
>    _SC_BC_STRING_MAX,
>
>    _SC_COLL_WEIGHTS_MAX,
>
>    _SC_EQUIV_CLASS_MAX,
>
>    _SC_EXPR_NEST_MAX,
>
>    _SC_LINE_MAX,
>
>    _SC_RE_DUP_MAX,
>
>    _SC_CHARCLASS_NAME_MAX,
>
>
>    _SC_2_VERSION,
>
>    _SC_2_C_BIND,
>
>    _SC_2_C_DEV,
>
>    _SC_2_FORT_DEV,
>
>    _SC_2_FORT_RUN,
>
>    _SC_2_SW_DEV,
>
>    _SC_2_LOCALEDEF,
>
>
>    _SC_PII,
>
>    _SC_PII_XTI,
>
>    _SC_PII_SOCKET,
>
>    _SC_PII_INTERNET,
>
>    _SC_PII_OSI,
>
>    _SC_POLL,
>
>    _SC_SELECT,
>
>    _SC_UIO_MAXIOV,
>
>    _SC_IOV_MAX = _SC_UIO_MAXIOV,
>
>    _SC_PII_INTERNET_STREAM,
>
>    _SC_PII_INTERNET_DGRAM,
>
>    _SC_PII_OSI_COTS,
>
>    _SC_PII_OSI_CLTS,
>
>    _SC_PII_OSI_M,
>
>    _SC_T_IOV_MAX,
>
>
>
>    _SC_THREADS,
>
>    _SC_THREAD_SAFE_FUNCTIONS,
>
>    _SC_GETGR_R_SIZE_MAX,
>
>    _SC_GETPW_R_SIZE_MAX,
>
>    _SC_LOGIN_NAME_MAX,
>
>    _SC_TTY_NAME_MAX,
>
>    _SC_THREAD_DESTRUCTOR_ITERATIONS,
>
>    _SC_THREAD_KEYS_MAX,
>
>    _SC_THREAD_STACK_MIN,
>
>    _SC_THREAD_THREADS_MAX,
>
>    _SC_THREAD_ATTR_STACKADDR,
>
>    _SC_THREAD_ATTR_STACKSIZE,
>
>    _SC_THREAD_PRIORITY_SCHEDULING,
>
>    _SC_THREAD_PRIO_INHERIT,
>
>    _SC_THREAD_PRIO_PROTECT,
>
>    _SC_THREAD_PROCESS_SHARED,
>
>
>    _SC_NPROCESSORS_CONF,
>
>    _SC_NPROCESSORS_ONLN,
>
>    _SC_PHYS_PAGES,
>
>    _SC_AVPHYS_PAGES,
>
>    _SC_ATEXIT_MAX,
>
>    _SC_PASS_MAX,
>
>
>    _SC_XOPEN_VERSION,
>
>    _SC_XOPEN_XCU_VERSION,
>
>    _SC_XOPEN_UNIX,
>
>    _SC_XOPEN_CRYPT,
>
>    _SC_XOPEN_ENH_I18N,
>
>    _SC_XOPEN_SHM,
>
>
>    _SC_2_CHAR_TERM,
>
>    _SC_2_C_VERSION,
>
>    _SC_2_UPE,
>
>
>    _SC_XOPEN_XPG2,
>
>    _SC_XOPEN_XPG3,
>
>    _SC_XOPEN_XPG4,
>
>
>    _SC_CHAR_BIT,
>
>    _SC_CHAR_MAX,
>
>    _SC_CHAR_MIN,
>
>    _SC_INT_MAX,
>
>    _SC_INT_MIN,
>
>    _SC_LONG_BIT,
>
>    _SC_WORD_BIT,
>
>    _SC_MB_LEN_MAX,
>
>    _SC_NZERO,
>
>    _SC_SSIZE_MAX,
>
>    _SC_SCHAR_MAX,
>
>    _SC_SCHAR_MIN,
>
>    _SC_SHRT_MAX,
>
>    _SC_SHRT_MIN,
>
>    _SC_UCHAR_MAX,
>
>    _SC_UINT_MAX,
>
>    _SC_ULONG_MAX,
>
>    _SC_USHRT_MAX,
>
>
>    _SC_NL_ARGMAX,
>
>    _SC_NL_LANGMAX,
>
>    _SC_NL_MSGMAX,
>
>    _SC_NL_NMAX,
>
>    _SC_NL_SETMAX,
>
>    _SC_NL_TEXTMAX,
>
>
>    _SC_XBS5_ILP32_OFF32,
>
>    _SC_XBS5_ILP32_OFFBIG,
>
>    _SC_XBS5_LP64_OFF64,
>
>    _SC_XBS5_LPBIG_OFFBIG,
>
>
>    _SC_XOPEN_LEGACY,
>
>    _SC_XOPEN_REALTIME,
>
>    _SC_XOPEN_REALTIME_THREADS,
>
>
>    _SC_ADVISORY_INFO,
>
>    _SC_BARRIERS,
>
>    _SC_BASE,
>
>    _SC_C_LANG_SUPPORT,
>
>    _SC_C_LANG_SUPPORT_R,
>
>    _SC_CLOCK_SELECTION,
>
>    _SC_CPUTIME,
>
>    _SC_THREAD_CPUTIME,
>
>    _SC_DEVICE_IO,
>
>    _SC_DEVICE_SPECIFIC,
>
>    _SC_DEVICE_SPECIFIC_R,
>
>    _SC_FD_MGMT,
>
>    _SC_FIFO,
>
>    _SC_PIPE,
>
>    _SC_FILE_ATTRIBUTES,
>
>    _SC_FILE_LOCKING,
>
>    _SC_FILE_SYSTEM,
>
>    _SC_MONOTONIC_CLOCK,
>
>    _SC_MULTI_PROCESS,
>
>    _SC_SINGLE_PROCESS,
>
>    _SC_NETWORKING,
>
>    _SC_READER_WRITER_LOCKS,
>
>    _SC_SPIN_LOCKS,
>
>    _SC_REGEXP,
>
>    _SC_REGEX_VERSION,
>
>    _SC_SHELL,
>
>    _SC_SIGNALS,
>
>    _SC_SPAWN,
>
>    _SC_SPORADIC_SERVER,
>
>    _SC_THREAD_SPORADIC_SERVER,
>
>    _SC_SYSTEM_DATABASE,
>
>    _SC_SYSTEM_DATABASE_R,
>
>    _SC_TIMEOUTS,
>
>    _SC_TYPED_MEMORY_OBJECTS,
>
>    _SC_USER_GROUPS,
>
>    _SC_USER_GROUPS_R,
>
>    _SC_2_PBS,
>
>    _SC_2_PBS_ACCOUNTING,
>
>    _SC_2_PBS_LOCATE,
>
>    _SC_2_PBS_MESSAGE,
>
>    _SC_2_PBS_TRACK,
>
>    _SC_SYMLOOP_MAX,
>
>    _SC_STREAMS,
>
>    _SC_2_PBS_CHECKPOINT,
>
>
>    _SC_V6_ILP32_OFF32,
>
>    _SC_V6_ILP32_OFFBIG,
>
>    _SC_V6_LP64_OFF64,
>
>    _SC_V6_LPBIG_OFFBIG,
>
>
>    _SC_HOST_NAME_MAX,
>
>    _SC_TRACE,
>
>    _SC_TRACE_EVENT_FILTER,
>
>    _SC_TRACE_INHERIT,
>
>    _SC_TRACE_LOG,
>
>
>    _SC_LEVEL1_ICACHE_SIZE,
>
>    _SC_LEVEL1_ICACHE_ASSOC,
>
>    _SC_LEVEL1_ICACHE_LINESIZE,
>
>    _SC_LEVEL1_DCACHE_SIZE,
>
>    _SC_LEVEL1_DCACHE_ASSOC,
>
>    _SC_LEVEL1_DCACHE_LINESIZE,
>
>    _SC_LEVEL2_CACHE_SIZE,
>
>    _SC_LEVEL2_CACHE_ASSOC,
>
>    _SC_LEVEL2_CACHE_LINESIZE,
>
>    _SC_LEVEL3_CACHE_SIZE,
>
>    _SC_LEVEL3_CACHE_ASSOC,
>
>    _SC_LEVEL3_CACHE_LINESIZE,
>
>    _SC_LEVEL4_CACHE_SIZE,
>
>    _SC_LEVEL4_CACHE_ASSOC,
>
>    _SC_LEVEL4_CACHE_LINESIZE,
>
>
>
>    _SC_IPV6 = _SC_LEVEL1_ICACHE_SIZE + 50,
>
>    _SC_RAW_SOCKETS
>
>  };
>
>
>enum
>  {
>    _CS_PATH,
>
>
>    _CS_V6_WIDTH_RESTRICTED_ENVS,
>
>
>    _CS_GNU_LIBC_VERSION,
>
>    _CS_GNU_LIBPTHREAD_VERSION,
>
>
>    _CS_LFS_CFLAGS = 1000,
>
>    _CS_LFS_LDFLAGS,
>
>    _CS_LFS_LIBS,
>
>    _CS_LFS_LINTFLAGS,
>
>    _CS_LFS64_CFLAGS,
>
>    _CS_LFS64_LDFLAGS,
>
>    _CS_LFS64_LIBS,
>
>    _CS_LFS64_LINTFLAGS,
>
>
>    _CS_XBS5_ILP32_OFF32_CFLAGS = 1100,
>
>    _CS_XBS5_ILP32_OFF32_LDFLAGS,
>
>    _CS_XBS5_ILP32_OFF32_LIBS,
>
>    _CS_XBS5_ILP32_OFF32_LINTFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_CFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_LIBS,
>
>    _CS_XBS5_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_XBS5_LP64_OFF64_CFLAGS,
>
>    _CS_XBS5_LP64_OFF64_LDFLAGS,
>
>    _CS_XBS5_LP64_OFF64_LIBS,
>
>    _CS_XBS5_LP64_OFF64_LINTFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LIBS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LINTFLAGS,
>
>
>    _CS_POSIX_V6_ILP32_OFF32_CFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LDFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LIBS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LINTFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LIBS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_CFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_LDFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_LIBS,
>
>    _CS_POSIX_V6_LP64_OFF64_LINTFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LIBS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LINTFLAGS
>
>  };
># 555 "/usr/include/unistd.h" 2 3 4
>
>
>extern long int pathconf (__const char *__path, int __name)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int fpathconf (int __fd, int __name) throw ();
>
>
>extern long int sysconf (int __name) throw () __attribute__ ((__const__));
>
>
>
>extern size_t confstr (int __name, char *__buf, size_t __len) throw ();
>
>
>
>
>extern __pid_t getpid (void) throw ();
>
>
>extern __pid_t getppid (void) throw ();
>
>
>
>
>extern __pid_t getpgrp (void) throw ();
># 591 "/usr/include/unistd.h" 3 4
>extern __pid_t __getpgid (__pid_t __pid) throw ();
>
>extern __pid_t getpgid (__pid_t __pid) throw ();
>
>
>
>
>
>
>extern int setpgid (__pid_t __pid, __pid_t __pgid) throw ();
># 617 "/usr/include/unistd.h" 3 4
>extern int setpgrp (void) throw ();
># 634 "/usr/include/unistd.h" 3 4
>extern __pid_t setsid (void) throw ();
>
>
>
>extern __pid_t getsid (__pid_t __pid) throw ();
>
>
>
>extern __uid_t getuid (void) throw ();
>
>
>extern __uid_t geteuid (void) throw ();
>
>
>extern __gid_t getgid (void) throw ();
>
>
>extern __gid_t getegid (void) throw ();
>
>
>
>
>extern int getgroups (int __size, __gid_t __list[]) throw () ;
>
>
>
>extern int group_member (__gid_t __gid) throw ();
>
>
>
>
>
>
>extern int setuid (__uid_t __uid) throw ();
>
>
>
>
>extern int setreuid (__uid_t __ruid, __uid_t __euid) throw ();
>
>
>
>
>extern int seteuid (__uid_t __uid) throw ();
>
>
>
>
>
>
>extern int setgid (__gid_t __gid) throw ();
>
>
>
>
>extern int setregid (__gid_t __rgid, __gid_t __egid) throw ();
>
>
>
>
>extern int setegid (__gid_t __gid) throw ();
>
>
>
>
>
>extern int getresuid (__uid_t *__ruid, __uid_t *__euid, __uid_t *__suid)
>     throw ();
>
>
>
>extern int getresgid (__gid_t *__rgid, __gid_t *__egid, __gid_t *__sgid)
>     throw ();
>
>
>
>extern int setresuid (__uid_t __ruid, __uid_t __euid, __uid_t __suid)
>     throw ();
>
>
>
>extern int setresgid (__gid_t __rgid, __gid_t __egid, __gid_t __sgid)
>     throw ();
>
>
>
>
>
>
>extern __pid_t fork (void) throw ();
>
>
>
>
>
>
>extern __pid_t vfork (void) throw ();
>
>
>
>
>
>extern char *ttyname (int __fd) throw ();
>
>
>
>extern int ttyname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int isatty (int __fd) throw ();
>
>
>
>
>
>extern int ttyslot (void) throw ();
>
>
>
>
>extern int link (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int linkat (int __fromfd, __const char *__from, int __tofd,
>     __const char *__to, int __flags)
>     throw () __attribute__ ((__nonnull__ (2, 4))) ;
>
>
>
>
>extern int symlink (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern ssize_t readlink (__const char *__restrict __path,
>    char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int symlinkat (__const char *__from, int __tofd,
>        __const char *__to) throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>
>extern ssize_t readlinkat (int __fd, __const char *__restrict __path,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (2, 3))) ;
>
>
>
>extern int unlink (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int unlinkat (int __fd, __const char *__name, int __flag)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern int rmdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern __pid_t tcgetpgrp (int __fd) throw ();
>
>
>extern int tcsetpgrp (int __fd, __pid_t __pgrp_id) throw ();
>
>
>
>
>
>
>extern char *getlogin (void);
>
>
>
>
>
>
>
>extern int getlogin_r (char *__name, size_t __name_len) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int setlogin (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
># 837 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/getopt.h" 1 3 4
># 50 "/usr/include/getopt.h" 3 4
>extern "C" {
># 59 "/usr/include/getopt.h" 3 4
>extern char *optarg;
># 73 "/usr/include/getopt.h" 3 4
>extern int optind;
>
>
>
>
>extern int opterr;
>
>
>
>extern int optopt;
># 152 "/usr/include/getopt.h" 3 4
>extern int getopt (int ___argc, char *const *___argv, const char *__shortopts)
>       throw ();
># 171 "/usr/include/getopt.h" 3 4
>}
># 838 "/usr/include/unistd.h" 2 3 4
>
>
>
>
>
>
>
>extern int gethostname (char *__name, size_t __len) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int sethostname (__const char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int sethostid (long int __id) throw () ;
>
>
>
>
>
>extern int getdomainname (char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern int setdomainname (__const char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int vhangup (void) throw ();
>
>
>extern int revoke (__const char *__file) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>extern int profil (unsigned short int *__sample_buffer, size_t __size,
>     size_t __offset, unsigned int __scale)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int acct (__const char *__name) throw ();
>
>
>
>extern char *getusershell (void) throw ();
>extern void endusershell (void) throw ();
>extern void setusershell (void) throw ();
>
>
>
>
>
>extern int daemon (int __nochdir, int __noclose) throw () ;
>
>
>
>
>
>
>extern int chroot (__const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern char *getpass (__const char *__prompt) __attribute__ ((__nonnull__ (1)));
># 923 "/usr/include/unistd.h" 3 4
>extern int fsync (int __fd);
>
>
>
>
>
>
>extern long int gethostid (void);
>
>
>extern void sync (void) throw ();
>
>
>
>
>extern int getpagesize (void) throw () __attribute__ ((__const__));
>
>
>
>
>extern int getdtablesize (void) throw ();
>
>
>
>
>extern int truncate (__const char *__file, __off_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 960 "/usr/include/unistd.h" 3 4
>extern int truncate64 (__const char *__file, __off64_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 970 "/usr/include/unistd.h" 3 4
>extern int ftruncate (int __fd, __off_t __length) throw () ;
># 980 "/usr/include/unistd.h" 3 4
>extern int ftruncate64 (int __fd, __off64_t __length) throw () ;
># 990 "/usr/include/unistd.h" 3 4
>extern int brk (void *__addr) throw () ;
>
>
>
>
>
>extern void *sbrk (intptr_t __delta) throw ();
># 1011 "/usr/include/unistd.h" 3 4
>extern long int syscall (long int __sysno, ...) throw ();
># 1034 "/usr/include/unistd.h" 3 4
>extern int lockf (int __fd, int __cmd, __off_t __len) ;
># 1044 "/usr/include/unistd.h" 3 4
>extern int lockf64 (int __fd, int __cmd, __off64_t __len) ;
># 1065 "/usr/include/unistd.h" 3 4
>extern int fdatasync (int __fildes);
>
>
>
>
>
>
>
>extern char *crypt (__const char *__key, __const char *__salt)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern void encrypt (char *__block, int __edflag) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void swab (__const void *__restrict __from, void *__restrict __to,
>    ssize_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
># 1103 "/usr/include/unistd.h" 3 4
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 2 3
>
>typedef pthread_key_t __gthread_key_t;
>typedef pthread_once_t __gthread_once_t;
>typedef pthread_mutex_t __gthread_mutex_t;
>typedef pthread_mutex_t __gthread_recursive_mutex_t;
>typedef pthread_cond_t __gthread_cond_t;
># 100 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
>extern __typeof(pthread_once) __gthrw_pthread_once __attribute__ ((__weakref__("pthread_once")));
>extern __typeof(pthread_getspecific) __gthrw_pthread_getspecific __attribute__ ((__weakref__("pthread_getspecific")));
>extern __typeof(pthread_setspecific) __gthrw_pthread_setspecific __attribute__ ((__weakref__("pthread_setspecific")));
>extern __typeof(pthread_create) __gthrw_pthread_create __attribute__ ((__weakref__("pthread_create")));
>extern __typeof(pthread_cancel) __gthrw_pthread_cancel __attribute__ ((__weakref__("pthread_cancel")));
>extern __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __attribute__ ((__weakref__("pthread_mutex_lock")));
>extern __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __attribute__ ((__weakref__("pthread_mutex_trylock")));
>extern __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __attribute__ ((__weakref__("pthread_mutex_unlock")));
>extern __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __attribute__ ((__weakref__("pthread_mutex_init")));
>extern __typeof(pthread_cond_broadcast) __gthrw_pthread_cond_broadcast __attribute__ ((__weakref__("pthread_cond_broadcast")));
>extern __typeof(pthread_cond_wait) __gthrw_pthread_cond_wait __attribute__ ((__weakref__("pthread_cond_wait")));
>
>
>extern __typeof(pthread_key_create) __gthrw_pthread_key_create __attribute__ ((__weakref__("pthread_key_create")));
>extern __typeof(pthread_key_delete) __gthrw_pthread_key_delete __attribute__ ((__weakref__("pthread_key_delete")));
>extern __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __attribute__ ((__weakref__("pthread_mutexattr_init")));
>extern __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __attribute__ ((__weakref__("pthread_mutexattr_settype")));
>extern __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __attribute__ ((__weakref__("pthread_mutexattr_destroy")));
># 155 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_active_p (void)
>{
>  static void *const __gthread_active_ptr
>    = __extension__ (void *) &__gthrw_pthread_cancel;
>  return __gthread_active_ptr != 0;
>}
># 522 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_once (__gthread_once_t *once, void (*func) (void))
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_once (once, func);
>  else
>    return -1;
>}
>
>static inline int
>__gthread_key_create (__gthread_key_t *key, void (*dtor) (void *))
>{
>  return __gthrw_pthread_key_create (key, dtor);
>}
>
>static inline int
>__gthread_key_delete (__gthread_key_t key)
>{
>  return __gthrw_pthread_key_delete (key);
>}
>
>static inline void *
>__gthread_getspecific (__gthread_key_t key)
>{
>  return __gthrw_pthread_getspecific (key);
>}
>
>static inline int
>__gthread_setspecific (__gthread_key_t key, const void *ptr)
>{
>  return __gthrw_pthread_setspecific (key, ptr);
>}
>
>static inline int
>__gthread_mutex_lock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_lock (mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_trylock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_trylock (mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_unlock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_unlock (mutex);
>  else
>    return 0;
>}
># 604 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_lock (mutex);
>}
>
>static inline int
>__gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_trylock (mutex);
>}
>
>static inline int
>__gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_unlock (mutex);
>}
>
>static inline int
>__gthread_cond_broadcast (__gthread_cond_t *cond)
>{
>  return __gthrw_pthread_cond_broadcast (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_wait_recursive (__gthread_cond_t *cond,
>          __gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_cond_wait (cond, mutex);
>}
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/gthr.h" 2 3
>
>
>
>
>
>
>
>#pragma GCC visibility pop
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++io.h" 2 3
>
>namespace std
>{
>  typedef __gthread_mutex_t __c_lock;
>
>
>  typedef FILE __c_file;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 3
>
>
># 1 "/usr/include/ctype.h" 1 3 4
># 30 "/usr/include/ctype.h" 3 4
>extern "C" {
># 48 "/usr/include/ctype.h" 3 4
>enum
>{
>  _ISupper = ((0) < 8 ? ((1 << (0)) << 8) : ((1 << (0)) >> 8)),
>  _ISlower = ((1) < 8 ? ((1 << (1)) << 8) : ((1 << (1)) >> 8)),
>  _ISalpha = ((2) < 8 ? ((1 << (2)) << 8) : ((1 << (2)) >> 8)),
>  _ISdigit = ((3) < 8 ? ((1 << (3)) << 8) : ((1 << (3)) >> 8)),
>  _ISxdigit = ((4) < 8 ? ((1 << (4)) << 8) : ((1 << (4)) >> 8)),
>  _ISspace = ((5) < 8 ? ((1 << (5)) << 8) : ((1 << (5)) >> 8)),
>  _ISprint = ((6) < 8 ? ((1 << (6)) << 8) : ((1 << (6)) >> 8)),
>  _ISgraph = ((7) < 8 ? ((1 << (7)) << 8) : ((1 << (7)) >> 8)),
>  _ISblank = ((8) < 8 ? ((1 << (8)) << 8) : ((1 << (8)) >> 8)),
>  _IScntrl = ((9) < 8 ? ((1 << (9)) << 8) : ((1 << (9)) >> 8)),
>  _ISpunct = ((10) < 8 ? ((1 << (10)) << 8) : ((1 << (10)) >> 8)),
>  _ISalnum = ((11) < 8 ? ((1 << (11)) << 8) : ((1 << (11)) >> 8))
>};
># 81 "/usr/include/ctype.h" 3 4
>extern __const unsigned short int **__ctype_b_loc (void)
>     __attribute__ ((__const));
>extern __const __int32_t **__ctype_tolower_loc (void)
>     __attribute__ ((__const));
>extern __const __int32_t **__ctype_toupper_loc (void)
>     __attribute__ ((__const));
># 96 "/usr/include/ctype.h" 3 4
>
>
>
>
>
>
>extern int isalnum (int) throw ();
>extern int isalpha (int) throw ();
>extern int iscntrl (int) throw ();
>extern int isdigit (int) throw ();
>extern int islower (int) throw ();
>extern int isgraph (int) throw ();
>extern int isprint (int) throw ();
>extern int ispunct (int) throw ();
>extern int isspace (int) throw ();
>extern int isupper (int) throw ();
>extern int isxdigit (int) throw ();
>
>
>
>extern int tolower (int __c) throw ();
>
>
>extern int toupper (int __c) throw ();
>
>
>
>
>
>
>
>
>extern int isblank (int) throw ();
>
>
>
>
>
>
>extern int isctype (int __c, int __mask) throw ();
>
>
>
>
>
>
>extern int isascii (int __c) throw ();
>
>
>
>extern int toascii (int __c) throw ();
>
>
>
>extern int _toupper (int) throw ();
>extern int _tolower (int) throw ();
># 247 "/usr/include/ctype.h" 3 4
>extern int isalnum_l (int, __locale_t) throw ();
>extern int isalpha_l (int, __locale_t) throw ();
>extern int iscntrl_l (int, __locale_t) throw ();
>extern int isdigit_l (int, __locale_t) throw ();
>extern int islower_l (int, __locale_t) throw ();
>extern int isgraph_l (int, __locale_t) throw ();
>extern int isprint_l (int, __locale_t) throw ();
>extern int ispunct_l (int, __locale_t) throw ();
>extern int isspace_l (int, __locale_t) throw ();
>extern int isupper_l (int, __locale_t) throw ();
>extern int isxdigit_l (int, __locale_t) throw ();
>
>extern int isblank_l (int, __locale_t) throw ();
>
>
>
>extern int __tolower_l (int __c, __locale_t __l) throw ();
>extern int tolower_l (int __c, __locale_t __l) throw ();
>
>
>extern int __toupper_l (int __c, __locale_t __l) throw ();
>extern int toupper_l (int __c, __locale_t __l) throw ();
># 323 "/usr/include/ctype.h" 3 4
>}
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 2 3
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cctype" 3
>namespace std
>{
>  using ::isalnum;
>  using ::isalpha;
>  using ::iscntrl;
>  using ::isdigit;
>  using ::isgraph;
>  using ::islower;
>  using ::isprint;
>  using ::ispunct;
>  using ::isspace;
>  using ::isupper;
>  using ::isxdigit;
>  using ::tolower;
>  using ::toupper;
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 1 3
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>       
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 3
># 65 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ctime" 3
>namespace std
>{
>  using ::clock_t;
>  using ::time_t;
>  using ::tm;
>
>  using ::clock;
>  using ::difftime;
>  using ::mktime;
>  using ::time;
>  using ::asctime;
>  using ::ctime;
>  using ::gmtime;
>  using ::localtime;
>  using ::strftime;
>}
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 2 3
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 40 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stdarg.h" 1 3 4
># 41 "/usr/include/wchar.h" 2 3 4
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
># 93 "/usr/include/wchar.h" 3 4
>
>
>typedef __mbstate_t mbstate_t;
>
>
>
># 118 "/usr/include/wchar.h" 3 4
>extern "C" {
>
>
>
>
>struct tm;
>
>
>
>
>
>
>
>
>
>extern wchar_t *wcscpy (wchar_t *__restrict __dest,
>   __const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncpy (wchar_t *__restrict __dest,
>    __const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern wchar_t *wcscat (wchar_t *__restrict __dest,
>   __const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncat (wchar_t *__restrict __dest,
>    __const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern int wcscmp (__const wchar_t *__s1, __const wchar_t *__s2)
>     throw () __attribute__ ((__pure__));
>
>extern int wcsncmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern int wcscasecmp (__const wchar_t *__s1, __const wchar_t *__s2) throw ();
>
>
>extern int wcsncasecmp (__const wchar_t *__s1, __const wchar_t *__s2,
>   size_t __n) throw ();
>
>
>
>
>
>extern int wcscasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2,
>    __locale_t __loc) throw ();
>
>extern int wcsncasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2,
>     size_t __n, __locale_t __loc) throw ();
>
>
>
>
>
>extern int wcscoll (__const wchar_t *__s1, __const wchar_t *__s2) throw ();
>
>
>
>extern size_t wcsxfrm (wchar_t *__restrict __s1,
>         __const wchar_t *__restrict __s2, size_t __n) throw ();
>
>
>
>
>
>
>
>
>extern int wcscoll_l (__const wchar_t *__s1, __const wchar_t *__s2,
>        __locale_t __loc) throw ();
>
>
>
>
>extern size_t wcsxfrm_l (wchar_t *__s1, __const wchar_t *__s2,
>    size_t __n, __locale_t __loc) throw ();
>
>
>extern wchar_t *wcsdup (__const wchar_t *__s) throw () __attribute__ ((__malloc__));
>
>
>
>
>extern wchar_t *wcschr (__const wchar_t *__wcs, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcsrchr (__const wchar_t *__wcs, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern wchar_t *wcschrnul (__const wchar_t *__s, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern size_t wcscspn (__const wchar_t *__wcs, __const wchar_t *__reject)
>     throw () __attribute__ ((__pure__));
>
>
>extern size_t wcsspn (__const wchar_t *__wcs, __const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcspbrk (__const wchar_t *__wcs, __const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcsstr (__const wchar_t *__haystack, __const wchar_t *__needle)
>     throw () __attribute__ ((__pure__));
>
>
>extern wchar_t *wcstok (wchar_t *__restrict __s,
>   __const wchar_t *__restrict __delim,
>   wchar_t **__restrict __ptr) throw ();
>
>
>extern size_t wcslen (__const wchar_t *__s) throw () __attribute__ ((__pure__));
>
>
>
>
>extern wchar_t *wcswcs (__const wchar_t *__haystack, __const wchar_t *__needle)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern size_t wcsnlen (__const wchar_t *__s, size_t __maxlen)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>extern int wmemcmp (__const wchar_t *__restrict __s1,
>      __const wchar_t *__restrict __s2, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>extern wchar_t *wmemcpy (wchar_t *__restrict __s1,
>    __const wchar_t *__restrict __s2, size_t __n) throw ();
>
>
>
>extern wchar_t *wmemmove (wchar_t *__s1, __const wchar_t *__s2, size_t __n)
>     throw ();
>
>
>extern wchar_t *wmemset (wchar_t *__s, wchar_t __c, size_t __n) throw ();
>
>
>
>
>
>extern wchar_t *wmempcpy (wchar_t *__restrict __s1,
>     __const wchar_t *__restrict __s2, size_t __n)
>     throw ();
>
>
>
>
>
>
>extern wint_t btowc (int __c) throw ();
>
>
>
>extern int wctob (wint_t __c) throw ();
>
>
>
>extern int mbsinit (__const mbstate_t *__ps) throw () __attribute__ ((__pure__));
>
>
>
>extern size_t mbrtowc (wchar_t *__restrict __pwc,
>         __const char *__restrict __s, size_t __n,
>         mbstate_t *__p) throw ();
>
>
>extern size_t wcrtomb (char *__restrict __s, wchar_t __wc,
>         mbstate_t *__restrict __ps) throw ();
>
>
>extern size_t __mbrlen (__const char *__restrict __s, size_t __n,
>   mbstate_t *__restrict __ps) throw ();
>extern size_t mbrlen (__const char *__restrict __s, size_t __n,
>        mbstate_t *__restrict __ps) throw ();
>
># 348 "/usr/include/wchar.h" 3 4
>
>
>
>extern size_t mbsrtowcs (wchar_t *__restrict __dst,
>    __const char **__restrict __src, size_t __len,
>    mbstate_t *__restrict __ps) throw ();
>
>
>
>extern size_t wcsrtombs (char *__restrict __dst,
>    __const wchar_t **__restrict __src, size_t __len,
>    mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>extern size_t mbsnrtowcs (wchar_t *__restrict __dst,
>     __const char **__restrict __src, size_t __nmc,
>     size_t __len, mbstate_t *__restrict __ps) throw ();
>
>
>
>extern size_t wcsnrtombs (char *__restrict __dst,
>     __const wchar_t **__restrict __src,
>     size_t __nwc, size_t __len,
>     mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>extern int wcwidth (wchar_t __c) throw ();
>
>
>
>extern int wcswidth (__const wchar_t *__s, size_t __n) throw ();
>
>
>
>
>
>
>extern double wcstod (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr) throw ();
>
>
>
>extern float wcstof (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr) throw ();
>extern long double wcstold (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr) throw ();
>
>
>
>
>
>extern long int wcstol (__const wchar_t *__restrict __nptr,
>   wchar_t **__restrict __endptr, int __base) throw ();
>
>
>
>extern unsigned long int wcstoul (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>
>__extension__
>extern long long int wcstoll (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>__extension__
>extern unsigned long long int wcstoull (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr,
>     int __base) throw ();
>
>
>
>
>
>
>__extension__
>extern long long int wcstoq (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>__extension__
>extern unsigned long long int wcstouq (__const wchar_t *__restrict __nptr,
>           wchar_t **__restrict __endptr,
>           int __base) throw ();
># 467 "/usr/include/wchar.h" 3 4
>extern long int wcstol_l (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr, int __base,
>     __locale_t __loc) throw ();
>
>extern unsigned long int wcstoul_l (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr,
>        int __base, __locale_t __loc) throw ();
>
>__extension__
>extern long long int wcstoll_l (__const wchar_t *__restrict __nptr,
>    wchar_t **__restrict __endptr,
>    int __base, __locale_t __loc) throw ();
>
>__extension__
>extern unsigned long long int wcstoull_l (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw ();
>
>extern double wcstod_l (__const wchar_t *__restrict __nptr,
>   wchar_t **__restrict __endptr, __locale_t __loc)
>     throw ();
>
>extern float wcstof_l (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr, __locale_t __loc)
>     throw ();
>
>extern long double wcstold_l (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr,
>         __locale_t __loc) throw ();
>
>
>
>
>
>extern double __wcstod_internal (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr, int __group)
>     throw ();
>extern float __wcstof_internal (__const wchar_t *__restrict __nptr,
>    wchar_t **__restrict __endptr, int __group)
>     throw ();
>extern long double __wcstold_internal (__const wchar_t *__restrict __nptr,
>           wchar_t **__restrict __endptr,
>           int __group) throw ();
># 593 "/usr/include/wchar.h" 3 4
>extern wchar_t *wcpcpy (wchar_t *__dest, __const wchar_t *__src) throw ();
>
>
>
>extern wchar_t *wcpncpy (wchar_t *__dest, __const wchar_t *__src, size_t __n)
>     throw ();
># 607 "/usr/include/wchar.h" 3 4
>extern __FILE *open_wmemstream (wchar_t **__bufloc, size_t *__sizeloc) throw ();
>
>
>
>
>
>
>extern int fwide (__FILE *__fp, int __mode) throw ();
>
>
>
>
>
>
>extern int fwprintf (__FILE *__restrict __stream,
>       __const wchar_t *__restrict __format, ...)
>                                                           ;
>
>
>
>
>extern int wprintf (__const wchar_t *__restrict __format, ...)
>                                                           ;
>
>extern int swprintf (wchar_t *__restrict __s, size_t __n,
>       __const wchar_t *__restrict __format, ...)
>     throw () ;
>
>
>
>
>
>extern int vfwprintf (__FILE *__restrict __s,
>        __const wchar_t *__restrict __format,
>        __gnuc_va_list __arg)
>                                                           ;
>
>
>
>
>extern int vwprintf (__const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>                                                           ;
>
>
>extern int vswprintf (wchar_t *__restrict __s, size_t __n,
>        __const wchar_t *__restrict __format,
>        __gnuc_va_list __arg)
>     throw () ;
>
>
>
>
>
>
>extern int fwscanf (__FILE *__restrict __stream,
>      __const wchar_t *__restrict __format, ...)
>                                                          ;
>
>
>
>
>extern int wscanf (__const wchar_t *__restrict __format, ...)
>                                                          ;
>
>extern int swscanf (__const wchar_t *__restrict __s,
>      __const wchar_t *__restrict __format, ...)
>     throw () ;
>
>
>
>
>
>
>
>
>
>
>
>extern int vfwscanf (__FILE *__restrict __s,
>       __const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>                                                          ;
>
>
>
>
>extern int vwscanf (__const wchar_t *__restrict __format,
>      __gnuc_va_list __arg)
>                                                          ;
>
>extern int vswscanf (__const wchar_t *__restrict __s,
>       __const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>     throw () ;
>
>
>
>
>
>
>
>
>
>
>extern wint_t fgetwc (__FILE *__stream);
>extern wint_t getwc (__FILE *__stream);
>
>
>
>
>
>extern wint_t getwchar (void);
>
>
>
>
>
>
>extern wint_t fputwc (wchar_t __wc, __FILE *__stream);
>extern wint_t putwc (wchar_t __wc, __FILE *__stream);
>
>
>
>
>
>extern wint_t putwchar (wchar_t __wc);
>
>
>
>
>
>
>
>extern wchar_t *fgetws (wchar_t *__restrict __ws, int __n,
>   __FILE *__restrict __stream);
>
>
>
>
>
>extern int fputws (__const wchar_t *__restrict __ws,
>     __FILE *__restrict __stream);
>
>
>
>
>
>
>extern wint_t ungetwc (wint_t __wc, __FILE *__stream);
>
># 768 "/usr/include/wchar.h" 3 4
>extern wint_t getwc_unlocked (__FILE *__stream);
>extern wint_t getwchar_unlocked (void);
>
>
>
>
>
>
>
>extern wint_t fgetwc_unlocked (__FILE *__stream);
>
>
>
>
>
>
>
>extern wint_t fputwc_unlocked (wchar_t __wc, __FILE *__stream);
># 794 "/usr/include/wchar.h" 3 4
>extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream);
>extern wint_t putwchar_unlocked (wchar_t __wc);
># 804 "/usr/include/wchar.h" 3 4
>extern wchar_t *fgetws_unlocked (wchar_t *__restrict __ws, int __n,
>     __FILE *__restrict __stream);
>
>
>
>
>
>
>
>extern int fputws_unlocked (__const wchar_t *__restrict __ws,
>       __FILE *__restrict __stream);
>
>
>
>
>
>
>
>extern size_t wcsftime (wchar_t *__restrict __s, size_t __maxsize,
>   __const wchar_t *__restrict __format,
>   __const struct tm *__restrict __tp) throw ();
>
>
>
>
>
>
>
>extern size_t wcsftime_l (wchar_t *__restrict __s, size_t __maxsize,
>     __const wchar_t *__restrict __format,
>     __const struct tm *__restrict __tp,
>     __locale_t __loc) throw ();
># 858 "/usr/include/wchar.h" 3 4
>}
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 2 3
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>namespace std
>{
>  using ::mbstate_t;
>}
># 142 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>namespace std
>{
>  using ::wint_t;
>
>  using ::btowc;
>  using ::fgetwc;
>  using ::fgetws;
>  using ::fputwc;
>  using ::fputws;
>  using ::fwide;
>  using ::fwprintf;
>  using ::fwscanf;
>  using ::getwc;
>  using ::getwchar;
>  using ::mbrlen;
>  using ::mbrtowc;
>  using ::mbsinit;
>  using ::mbsrtowcs;
>  using ::putwc;
>  using ::putwchar;
>  using ::swprintf;
>  using ::swscanf;
>  using ::ungetwc;
>  using ::vfwprintf;
>
>  using ::vfwscanf;
>
>  using ::vswprintf;
>
>  using ::vswscanf;
>
>  using ::vwprintf;
>
>  using ::vwscanf;
>
>  using ::wcrtomb;
>  using ::wcscat;
>  using ::wcscmp;
>  using ::wcscoll;
>  using ::wcscpy;
>  using ::wcscspn;
>  using ::wcsftime;
>  using ::wcslen;
>  using ::wcsncat;
>  using ::wcsncmp;
>  using ::wcsncpy;
>  using ::wcsrtombs;
>  using ::wcsspn;
>  using ::wcstod;
>
>  using ::wcstof;
>
>  using ::wcstok;
>  using ::wcstol;
>  using ::wcstoul;
>  using ::wcsxfrm;
>  using ::wctob;
>  using ::wmemcmp;
>  using ::wmemcpy;
>  using ::wmemmove;
>  using ::wmemset;
>  using ::wprintf;
>  using ::wscanf;
>
>  using ::wcschr;
>
>  inline wchar_t*
>  wcschr(wchar_t* __p, wchar_t __c)
>  { return wcschr(const_cast<const wchar_t*>(__p), __c); }
>
>  using ::wcspbrk;
>
>  inline wchar_t*
>  wcspbrk(wchar_t* __s1, const wchar_t* __s2)
>  { return wcspbrk(const_cast<const wchar_t*>(__s1), __s2); }
>
>  using ::wcsrchr;
>
>  inline wchar_t*
>  wcsrchr(wchar_t* __p, wchar_t __c)
>  { return wcsrchr(const_cast<const wchar_t*>(__p), __c); }
>
>  using ::wcsstr;
>
>  inline wchar_t*
>  wcsstr(wchar_t* __s1, const wchar_t* __s2)
>  { return wcsstr(const_cast<const wchar_t*>(__s1), __s2); }
>
>  using ::wmemchr;
>
>  inline wchar_t*
>  wmemchr(wchar_t* __p, wchar_t __c, size_t __n)
>  { return wmemchr(const_cast<const wchar_t*>(__p), __c, __n); }
>}
>
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>  using ::wcstold;
># 259 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwchar" 3
>  using ::wcstoll;
>  using ::wcstoull;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::wcstold;
>  using __gnu_cxx::wcstoll;
>  using __gnu_cxx::wcstoull;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 2 3
>
>
># 1 "/usr/include/stdint.h" 1 3 4
># 28 "/usr/include/stdint.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/stdint.h" 2 3 4
># 49 "/usr/include/stdint.h" 3 4
>typedef unsigned char uint8_t;
>typedef unsigned short int uint16_t;
>
>typedef unsigned int uint32_t;
>
>
>
>
>
>__extension__
>typedef unsigned long long int uint64_t;
>
>
>
>
>
>
>typedef signed char int_least8_t;
>typedef short int int_least16_t;
>typedef int int_least32_t;
>
>
>
>__extension__
>typedef long long int int_least64_t;
>
>
>
>typedef unsigned char uint_least8_t;
>typedef unsigned short int uint_least16_t;
>typedef unsigned int uint_least32_t;
>
>
>
>__extension__
>typedef unsigned long long int uint_least64_t;
>
>
>
>
>
>
>typedef signed char int_fast8_t;
>
>
>
>
>
>typedef int int_fast16_t;
>typedef int int_fast32_t;
>__extension__
>typedef long long int int_fast64_t;
>
>
>
>typedef unsigned char uint_fast8_t;
>
>
>
>
>
>typedef unsigned int uint_fast16_t;
>typedef unsigned int uint_fast32_t;
>__extension__
>typedef unsigned long long int uint_fast64_t;
># 129 "/usr/include/stdint.h" 3 4
>typedef unsigned int uintptr_t;
># 138 "/usr/include/stdint.h" 3 4
>__extension__
>typedef long long int intmax_t;
>__extension__
>typedef unsigned long long int uintmax_t;
># 50 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 2 3
>
>
>namespace std
>{
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>  typedef int64_t streamoff;
>
>
>
>
>
>  typedef ptrdiff_t streamsize;
>
>  template<typename _StateT>
>    class fpos;
># 94 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>  template<typename _StateT>
>    class fpos
>    {
>    private:
>      streamoff _M_off;
>      _StateT _M_state;
>
>    public:
>
>
>
>
>      fpos()
>      : _M_off(0), _M_state() { }
># 116 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/postypes.h" 3
>      fpos(streamoff __off)
>      : _M_off(__off), _M_state() { }
>
>
>      operator streamoff() const { return _M_off; }
>
>
>      void
>      state(_StateT __st)
>      { _M_state = __st; }
>
>
>      _StateT
>      state() const
>      { return _M_state; }
>
>
>
>
>
>
>      bool
>      operator==(const fpos& __other) const
>      { return _M_off == __other._M_off; }
>
>
>      bool
>      operator!=(const fpos& __other) const
>      { return _M_off != __other._M_off; }
>
>
>
>
>
>      fpos&
>      operator+=(streamoff __off)
>      {
> _M_off += __off;
> return *this;
>      }
>
>
>
>
>
>      fpos&
>      operator-=(streamoff __off)
>      {
> _M_off -= __off;
> return *this;
>      }
>
>
>
>
>
>
>
>      fpos
>      operator+(streamoff __off) const
>      {
> fpos __pos(*this);
> __pos += __off;
> return __pos;
>      }
>
>
>
>
>
>
>
>      fpos
>      operator-(streamoff __off) const
>      {
> fpos __pos(*this);
> __pos -= __off;
> return __pos;
>      }
>
>
>
>
>
>
>      streamoff
>      operator-(const fpos& __other) const
>      { return _M_off - __other._M_off; }
>    };
>
>
>
>
>
>  typedef fpos<mbstate_t> streampos;
>
>  typedef fpos<mbstate_t> wstreampos;
>}
># 50 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/functexcept.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/functexcept.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception_defines.h" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/functexcept.h" 2 3
>
>namespace std
>{
>
>  void
>  __throw_bad_exception(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_alloc(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_cast(void) __attribute__((__noreturn__));
>
>  void
>  __throw_bad_typeid(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_logic_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_domain_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_invalid_argument(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_length_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_out_of_range(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_runtime_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_range_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_overflow_error(const char*) __attribute__((__noreturn__));
>
>  void
>  __throw_underflow_error(const char*) __attribute__((__noreturn__));
>
>
>  void
>  __throw_ios_failure(const char*) __attribute__((__noreturn__));
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 2 3
>
>namespace std
>{
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ios;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_streambuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_istream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ostream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_iostream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>     typename _Alloc = allocator<_CharT> >
>    class basic_stringbuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_istringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_ostringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_stringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_filebuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ifstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ofstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_fstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class istreambuf_iterator;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class ostreambuf_iterator;
>
>
>
>  class ios_base;
># 135 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iosfwd" 3
>  typedef basic_ios<char> ios;
>  typedef basic_streambuf<char> streambuf;
>  typedef basic_istream<char> istream;
>  typedef basic_ostream<char> ostream;
>  typedef basic_iostream<char> iostream;
>  typedef basic_stringbuf<char> stringbuf;
>  typedef basic_istringstream<char> istringstream;
>  typedef basic_ostringstream<char> ostringstream;
>  typedef basic_stringstream<char> stringstream;
>  typedef basic_filebuf<char> filebuf;
>  typedef basic_ifstream<char> ifstream;
>  typedef basic_ofstream<char> ofstream;
>  typedef basic_fstream<char> fstream;
>
>
>  typedef basic_ios<wchar_t> wios;
>  typedef basic_streambuf<wchar_t> wstreambuf;
>  typedef basic_istream<wchar_t> wistream;
>  typedef basic_ostream<wchar_t> wostream;
>  typedef basic_iostream<wchar_t> wiostream;
>  typedef basic_stringbuf<wchar_t> wstringbuf;
>  typedef basic_istringstream<wchar_t> wistringstream;
>  typedef basic_ostringstream<wchar_t> wostringstream;
>  typedef basic_stringstream<wchar_t> wstringstream;
>  typedef basic_filebuf<wchar_t> wfilebuf;
>  typedef basic_ifstream<wchar_t> wifstream;
>  typedef basic_ofstream<wchar_t> wofstream;
>  typedef basic_fstream<wchar_t> wfstream;
>
>
>}
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_pair.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_pair.h" 3
>namespace std
>{
>
>  template<class _T1, class _T2>
>    struct pair
>    {
>      typedef _T1 first_type;
>      typedef _T2 second_type;
>
>      _T1 first;
>      _T2 second;
>
>
>
>
>
>      pair()
>      : first(), second() { }
>
>
>      pair(const _T1& __a, const _T2& __b)
>      : first(__a), second(__b) { }
>
>
>      template<class _U1, class _U2>
>        pair(const pair<_U1, _U2>& __p)
> : first(__p.first), second(__p.second) { }
>    };
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __x.first == __y.first && __x.second == __y.second; }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __x.first < __y.first
>      || (!(__y.first < __x.first) && __x.second < __y.second); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__x == __y); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __y < __x; }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__y < __x); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__x < __y); }
># 142 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_pair.h" 3
>  template<class _T1, class _T2>
>    inline pair<_T1, _T2>
>    make_pair(_T1 __x, _T2 __y)
>    { return pair<_T1, _T2>(__x, __y); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 3
># 75 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cpp_type_traits.h" 3
>namespace __gnu_internal
>{
>  typedef char __one;
>  typedef char __two[2];
>
>  template<typename _Tp>
>  __one __test_type(int _Tp::*);
>  template<typename _Tp>
>  __two& __test_type(...);
>}
>
>
>namespace __gnu_cxx
>{
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator;
>}
>
>struct __true_type { };
>struct __false_type { };
>
>namespace std
>{
>  template<bool>
>    struct __truth_type
>    { typedef __false_type __type; };
>
>  template<>
>    struct __truth_type<true>
>    { typedef __true_type __type; };
>
>
>
>  template<class _Sp, class _Tp>
>    struct __traitor
>    {
>      enum { __value = bool(_Sp::__value) || bool(_Tp::__value) };
>      typedef typename __truth_type<__value>::__type __type;
>    };
>
>
>  template<typename, typename>
>    struct __are_same
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Tp>
>    struct __are_same<_Tp, _Tp>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<typename, bool>
>    struct __enable_if
>    {
>    };
>
>  template<typename _Tp>
>    struct __enable_if<_Tp, true>
>    {
>      typedef _Tp __type;
>    };
>
>
>  template<typename _Tp>
>    struct __is_void
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<>
>    struct __is_void<void>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_integer
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>
>
>
>  template<>
>    struct __is_integer<bool>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<signed char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<>
>    struct __is_integer<wchar_t>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<>
>    struct __is_integer<short>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned short>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<int>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned int>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<long long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned long long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_floating
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>
>  template<>
>    struct __is_floating<float>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_floating<double>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_floating<long double>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_pointer
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Tp>
>    struct __is_pointer<_Tp*>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_normal_iterator
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Iterator, typename _Container>
>    struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator,
>             _Container> >
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_arithmetic
>    : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_fundamental
>    : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_scalar
>    : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_pod
>    {
>      enum
> {
>   __value = (sizeof(__gnu_internal::__test_type<_Tp>(0))
>       != sizeof(__gnu_internal::__one))
> };
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_empty
>    {
>    private:
>      template<typename>
>        struct __first { };
>      template<typename _Up>
>        struct __second
>        : public _Up { };
>
>    public:
>      enum
> {
>   __value = sizeof(__first<_Tp>) == sizeof(__second<_Tp>)
> };
>    };
>
>}
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 3
>       
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 3
>
>namespace std
>{
># 80 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 3
>  struct input_iterator_tag {};
>
>  struct output_iterator_tag {};
>
>  struct forward_iterator_tag : public input_iterator_tag {};
>
>
>  struct bidirectional_iterator_tag : public forward_iterator_tag {};
>
>
>  struct random_access_iterator_tag : public bidirectional_iterator_tag {};
># 104 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h" 3
>  template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t,
>           typename _Pointer = _Tp*, typename _Reference = _Tp&>
>    struct iterator
>    {
>
>      typedef _Category iterator_category;
>
>      typedef _Tp value_type;
>
>      typedef _Distance difference_type;
>
>      typedef _Pointer pointer;
>
>      typedef _Reference reference;
>    };
>
>
>
>
>
>
>
>  template<typename _Iterator>
>    struct iterator_traits
>    {
>      typedef typename _Iterator::iterator_category iterator_category;
>      typedef typename _Iterator::value_type value_type;
>      typedef typename _Iterator::difference_type difference_type;
>      typedef typename _Iterator::pointer pointer;
>      typedef typename _Iterator::reference reference;
>    };
>
>  template<typename _Tp>
>    struct iterator_traits<_Tp*>
>    {
>      typedef random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef _Tp& reference;
>    };
>
>  template<typename _Tp>
>    struct iterator_traits<const _Tp*>
>    {
>      typedef random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef ptrdiff_t difference_type;
>      typedef const _Tp* pointer;
>      typedef const _Tp& reference;
>    };
>
>
>
>
>
>
>
>  template<typename _Iter>
>    inline typename iterator_traits<_Iter>::iterator_category
>    __iterator_category(const _Iter&)
>    { return typename iterator_traits<_Iter>::iterator_category(); }
>
>}
># 73 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
>       
># 68 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/concept_check.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/concept_check.h" 3
>       
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/concept_check.h" 3
># 69 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 2 3
>
>namespace std
>{
>  template<typename _InputIterator>
>    inline typename iterator_traits<_InputIterator>::difference_type
>    __distance(_InputIterator __first, _InputIterator __last,
>               input_iterator_tag)
>    {
>
>     
>
>      typename iterator_traits<_InputIterator>::difference_type __n = 0;
>      while (__first != __last)
> {
>   ++__first;
>   ++__n;
> }
>      return __n;
>    }
>
>  template<typename _RandomAccessIterator>
>    inline typename iterator_traits<_RandomAccessIterator>::difference_type
>    __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
>               random_access_iterator_tag)
>    {
>
>     
>
>      return __last - __first;
>    }
># 112 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
>  template<typename _InputIterator>
>    inline typename iterator_traits<_InputIterator>::difference_type
>    distance(_InputIterator __first, _InputIterator __last)
>    {
>
>      return std::__distance(__first, __last,
>        std::__iterator_category(__first));
>    }
>
>  template<typename _InputIterator, typename _Distance>
>    inline void
>    __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
>    {
>
>     
>      while (__n--)
> ++__i;
>    }
>
>  template<typename _BidirectionalIterator, typename _Distance>
>    inline void
>    __advance(_BidirectionalIterator& __i, _Distance __n,
>              bidirectional_iterator_tag)
>    {
>
>     
>
>      if (__n > 0)
>        while (__n--)
>   ++__i;
>      else
>        while (__n++)
>   --__i;
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    inline void
>    __advance(_RandomAccessIterator& __i, _Distance __n,
>              random_access_iterator_tag)
>    {
>
>     
>
>      __i += __n;
>    }
># 170 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_funcs.h" 3
>  template<typename _InputIterator, typename _Distance>
>    inline void
>    advance(_InputIterator& __i, _Distance __n)
>    {
>
>      std::__advance(__i, __n, std::__iterator_category(__i));
>    }
>}
># 74 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 1 3
># 70 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>namespace std
>{
># 91 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Iterator>
>    class reverse_iterator
>    : public iterator<typename iterator_traits<_Iterator>::iterator_category,
>        typename iterator_traits<_Iterator>::value_type,
>        typename iterator_traits<_Iterator>::difference_type,
>        typename iterator_traits<_Iterator>::pointer,
>                      typename iterator_traits<_Iterator>::reference>
>    {
>    protected:
>      _Iterator current;
>
>    public:
>      typedef _Iterator iterator_type;
>      typedef typename iterator_traits<_Iterator>::difference_type
>              difference_type;
>      typedef typename iterator_traits<_Iterator>::reference reference;
>      typedef typename iterator_traits<_Iterator>::pointer pointer;
>
>    public:
>
>
>
>
>
>
>      reverse_iterator() : current() { }
>
>
>
>
>      explicit
>      reverse_iterator(iterator_type __x) : current(__x) { }
>
>
>
>
>      reverse_iterator(const reverse_iterator& __x)
>      : current(__x.current) { }
>
>
>
>
>
>      template<typename _Iter>
>        reverse_iterator(const reverse_iterator<_Iter>& __x)
> : current(__x.base()) { }
>
>
>
>
>      iterator_type
>      base() const
>      { return current; }
>
>
>
>
>
>
>      reference
>      operator*() const
>      {
> _Iterator __tmp = current;
> return *--__tmp;
>      }
>
>
>
>
>
>
>      pointer
>      operator->() const
>      { return &(operator*()); }
>
>
>
>
>
>
>      reverse_iterator&
>      operator++()
>      {
> --current;
> return *this;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator++(int)
>      {
> reverse_iterator __tmp = *this;
> --current;
> return __tmp;
>      }
>
>
>
>
>
>
>      reverse_iterator&
>      operator--()
>      {
> ++current;
> return *this;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator--(int)
>      {
> reverse_iterator __tmp = *this;
> ++current;
> return __tmp;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator+(difference_type __n) const
>      { return reverse_iterator(current - __n); }
>
>
>
>
>
>
>      reverse_iterator&
>      operator+=(difference_type __n)
>      {
> current -= __n;
> return *this;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator-(difference_type __n) const
>      { return reverse_iterator(current + __n); }
>
>
>
>
>
>
>      reverse_iterator&
>      operator-=(difference_type __n)
>      {
> current += __n;
> return *this;
>      }
>
>
>
>
>
>
>      reference
>      operator[](difference_type __n) const
>      { return *(*this + __n); }
>    };
># 278 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Iterator>
>    inline bool
>    operator==(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return __x.base() == __y.base(); }
>
>  template<typename _Iterator>
>    inline bool
>    operator<(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y.base() < __x.base(); }
>
>  template<typename _Iterator>
>    inline bool
>    operator!=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Iterator>
>    inline bool
>    operator>(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y < __x; }
>
>  template<typename _Iterator>
>    inline bool
>    operator<=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Iterator>
>    inline bool
>    operator>=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Iterator>
>    inline typename reverse_iterator<_Iterator>::difference_type
>    operator-(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y.base() - __x.base(); }
>
>  template<typename _Iterator>
>    inline reverse_iterator<_Iterator>
>    operator+(typename reverse_iterator<_Iterator>::difference_type __n,
>       const reverse_iterator<_Iterator>& __x)
>    { return reverse_iterator<_Iterator>(__x.base() - __n); }
>
>
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator==(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return __x.base() == __y.base(); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator<(const reverse_iterator<_IteratorL>& __x,
>       const reverse_iterator<_IteratorR>& __y)
>    { return __y.base() < __x.base(); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator!=(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return !(__x == __y); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator>(const reverse_iterator<_IteratorL>& __x,
>       const reverse_iterator<_IteratorR>& __y)
>    { return __y < __x; }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator<=(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return !(__y < __x); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline bool
>    operator>=(const reverse_iterator<_IteratorL>& __x,
>        const reverse_iterator<_IteratorR>& __y)
>    { return !(__x < __y); }
>
>  template<typename _IteratorL, typename _IteratorR>
>    inline typename reverse_iterator<_IteratorL>::difference_type
>    operator-(const reverse_iterator<_IteratorL>& __x,
>       const reverse_iterator<_IteratorR>& __y)
>    { return __y.base() - __x.base(); }
># 382 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    class back_insert_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _Container* container;
>
>    public:
>
>      typedef _Container container_type;
>
>
>      explicit
>      back_insert_iterator(_Container& __x) : container(&__x) { }
># 408 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>      back_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_back(__value);
> return *this;
>      }
>
>
>      back_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      back_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      back_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 442 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline back_insert_iterator<_Container>
>    back_inserter(_Container& __x)
>    { return back_insert_iterator<_Container>(__x); }
># 457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    class front_insert_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _Container* container;
>
>    public:
>
>      typedef _Container container_type;
>
>
>      explicit front_insert_iterator(_Container& __x) : container(&__x) { }
># 482 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>      front_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_front(__value);
> return *this;
>      }
>
>
>      front_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      front_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      front_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 516 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline front_insert_iterator<_Container>
>    front_inserter(_Container& __x)
>    { return front_insert_iterator<_Container>(__x); }
># 535 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    class insert_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _Container* container;
>      typename _Container::iterator iter;
>
>    public:
>
>      typedef _Container container_type;
>
>
>
>
>
>      insert_iterator(_Container& __x, typename _Container::iterator __i)
>      : container(&__x), iter(__i) {}
># 577 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>      insert_iterator&
>      operator=(const typename _Container::const_reference __value)
>      {
> iter = container->insert(iter, __value);
> ++iter;
> return *this;
>      }
>
>
>      insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++(int)
>      { return *this; }
>    };
># 612 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _Container, typename _Iterator>
>    inline insert_iterator<_Container>
>    inserter(_Container& __x, _Iterator __i)
>    {
>      return insert_iterator<_Container>(__x,
>      typename _Container::iterator(__i));
>    }
>}
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>
>
>  using std::iterator_traits;
>  using std::iterator;
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator
>    {
>    protected:
>      _Iterator _M_current;
>
>    public:
>      typedef typename iterator_traits<_Iterator>::iterator_category
>                                                             iterator_category;
>      typedef typename iterator_traits<_Iterator>::value_type value_type;
>      typedef typename iterator_traits<_Iterator>::difference_type
>                                                             difference_type;
>      typedef typename iterator_traits<_Iterator>::reference reference;
>      typedef typename iterator_traits<_Iterator>::pointer pointer;
>
>      __normal_iterator() : _M_current(_Iterator()) { }
>
>      explicit
>      __normal_iterator(const _Iterator& __i) : _M_current(__i) { }
>
>
>      template<typename _Iter>
>        __normal_iterator(const __normal_iterator<_Iter,
>     typename std::__enable_if<_Container,
>     (std::__are_same<_Iter,
>      typename _Container::pointer>::__value)
>     >::__type>& __i)
>        : _M_current(__i.base()) { }
>
>
>      reference
>      operator*() const
>      { return *_M_current; }
>
>      pointer
>      operator->() const
>      { return _M_current; }
>
>      __normal_iterator&
>      operator++()
>      {
> ++_M_current;
> return *this;
>      }
>
>      __normal_iterator
>      operator++(int)
>      { return __normal_iterator(_M_current++); }
>
>
>      __normal_iterator&
>      operator--()
>      {
> --_M_current;
> return *this;
>      }
>
>      __normal_iterator
>      operator--(int)
>      { return __normal_iterator(_M_current--); }
>
>
>      reference
>      operator[](const difference_type& __n) const
>      { return _M_current[__n]; }
>
>      __normal_iterator&
>      operator+=(const difference_type& __n)
>      { _M_current += __n; return *this; }
>
>      __normal_iterator
>      operator+(const difference_type& __n) const
>      { return __normal_iterator(_M_current + __n); }
>
>      __normal_iterator&
>      operator-=(const difference_type& __n)
>      { _M_current -= __n; return *this; }
>
>      __normal_iterator
>      operator-(const difference_type& __n) const
>      { return __normal_iterator(_M_current - __n); }
>
>      const _Iterator&
>      base() const
>      { return _M_current; }
>    };
># 728 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator.h" 3
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() == __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator==(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() == __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() != __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator!=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() != __rhs.base(); }
>
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() < __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator<(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() < __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() > __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator>(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() > __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() <= __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator<=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() <= __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() >= __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator>=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() >= __rhs.base(); }
>
>
>
>
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline typename __normal_iterator<_IteratorL, _Container>::difference_type
>    operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() - __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline __normal_iterator<_Iterator, _Container>
>    operator+(typename __normal_iterator<_Iterator, _Container>::difference_type
>       __n, const __normal_iterator<_Iterator, _Container>& __i)
>    { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }
>}
># 75 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/debug/debug.h" 1 3
># 77 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 2 3
>
>namespace std
>{
># 90 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline void
>    swap(_Tp& __a, _Tp& __b)
>    {
>
>     
>
>      _Tp __tmp = __a;
>      __a = __b;
>      __b = __tmp;
>    }
>
>
>
>
>  template<bool _BoolType>
>    struct __iter_swap
>    {
>      template<typename _ForwardIterator1, typename _ForwardIterator2>
>        static void
>        iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>        {
>          typedef typename iterator_traits<_ForwardIterator1>::value_type
>            _ValueType1;
>          _ValueType1 __tmp = *__a;
>          *__a = *__b;
>          *__b = __tmp;
> }
>    };
>
>  template<>
>    struct __iter_swap<true>
>    {
>      template<typename _ForwardIterator1, typename _ForwardIterator2>
>        static void
>        iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>        {
>          swap(*__a, *__b);
>        }
>    };
># 140 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    inline void
>    iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>    {
>      typedef typename iterator_traits<_ForwardIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_ForwardIterator2>::value_type
> _ValueType2;
>
>
>     
>
>     
>
>     
>
>     
>
>
>      typedef typename iterator_traits<_ForwardIterator1>::reference
> _ReferenceType1;
>      typedef typename iterator_traits<_ForwardIterator2>::reference
> _ReferenceType2;
>      std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value &&
> __are_same<_ValueType1 &, _ReferenceType1>::__value &&
> __are_same<_ValueType2 &, _ReferenceType2>::__value>::
> iter_swap(__a, __b);
>    }
># 182 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline const _Tp&
>    min(const _Tp& __a, const _Tp& __b)
>    {
>
>     
>
>      if (__b < __a)
> return __b;
>      return __a;
>    }
># 204 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline const _Tp&
>    max(const _Tp& __a, const _Tp& __b)
>    {
>
>     
>
>      if (__a < __b)
> return __b;
>      return __a;
>    }
># 226 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    min(const _Tp& __a, const _Tp& __b, _Compare __comp)
>    {
>
>      if (__comp(__b, __a))
> return __b;
>      return __a;
>    }
># 246 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    max(const _Tp& __a, const _Tp& __b, _Compare __comp)
>    {
>
>      if (__comp(__a, __b))
> return __b;
>      return __a;
>    }
>
>
>
>
>
>
>
>  template<bool, typename>
>    struct __copy
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy(_II __first, _II __last, _OI __result)
>        {
>   for (; __first != __last; ++__result, ++__first)
>     *__result = *__first;
>   return __result;
> }
>    };
>
>  template<bool _BoolType>
>    struct __copy<_BoolType, random_access_iterator_tag>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy(_II __first, _II __last, _OI __result)
>        {
>   typedef typename iterator_traits<_II>::difference_type _Distance;
>   for(_Distance __n = __last - __first; __n > 0; --__n)
>     {
>       *__result = *__first;
>       ++__first;
>       ++__result;
>     }
>   return __result;
> }
>    };
>
>  template<>
>    struct __copy<true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        copy(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   std::memmove(__result, __first, sizeof(_Tp) * (__last - __first));
>   return __result + (__last - __first);
> }
>    };
>
>  template<typename _II, typename _OI>
>    inline _OI
>    __copy_aux(_II __first, _II __last, _OI __result)
>    {
>      typedef typename iterator_traits<_II>::value_type _ValueTypeI;
>      typedef typename iterator_traits<_OI>::value_type _ValueTypeO;
>      typedef typename iterator_traits<_II>::iterator_category _Category;
>      const bool __simple = (__is_scalar<_ValueTypeI>::__value
>                      && __is_pointer<_II>::__value
>                      && __is_pointer<_OI>::__value
>        && __are_same<_ValueTypeI, _ValueTypeO>::__value);
>
>      return std::__copy<__simple, _Category>::copy(__first, __last, __result);
>    }
>
>  template<bool, bool>
>    struct __copy_normal
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return std::__copy_aux(__first, __last, __result); }
>    };
>
>  template<>
>    struct __copy_normal<true, false>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return std::__copy_aux(__first.base(), __last.base(), __result); }
>    };
>
>  template<>
>    struct __copy_normal<false, true>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return _OI(std::__copy_aux(__first, __last, __result.base())); }
>    };
>
>  template<>
>    struct __copy_normal<true, true>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return _OI(std::__copy_aux(__first.base(), __last.base(),
>         __result.base())); }
>    };
># 373 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    inline _OutputIterator
>    copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result)
>    {
>
>     
>     
>
>      ;
>
>       const bool __in = __is_normal_iterator<_InputIterator>::__value;
>       const bool __out = __is_normal_iterator<_OutputIterator>::__value;
>       return std::__copy_normal<__in, __out>::copy_n(__first, __last,
>            __result);
>    }
>
>  template<bool, typename>
>    struct __copy_backward
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   while (__first != __last)
>     *--__result = *--__last;
>   return __result;
> }
>    };
>
>  template<bool _BoolType>
>    struct __copy_backward<_BoolType, random_access_iterator_tag>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   typename iterator_traits<_BI1>::difference_type __n;
>   for (__n = __last - __first; __n > 0; --__n)
>     *--__result = *--__last;
>   return __result;
> }
>    };
>
>  template<>
>    struct __copy_backward<true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        copy_b(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   const ptrdiff_t _Num = __last - __first;
>   std::memmove(__result - _Num, __first, sizeof(_Tp) * _Num);
>   return __result - _Num;
> }
>    };
>
>  template<typename _BI1, typename _BI2>
>    inline _BI2
>    __copy_backward_aux(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>      typedef typename iterator_traits<_BI1>::value_type _ValueType1;
>      typedef typename iterator_traits<_BI2>::value_type _ValueType2;
>      typedef typename iterator_traits<_BI1>::iterator_category _Category;
>      const bool __simple = (__is_scalar<_ValueType1>::__value
>                      && __is_pointer<_BI1>::__value
>                      && __is_pointer<_BI2>::__value
>        && __are_same<_ValueType1, _ValueType2>::__value);
>
>      return std::__copy_backward<__simple, _Category>::copy_b(__first, __last,
>              __result);
>    }
>
>  template<bool, bool>
>    struct __copy_backward_normal
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return std::__copy_backward_aux(__first, __last, __result); }
>    };
>
>  template<>
>    struct __copy_backward_normal<true, false>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return std::__copy_backward_aux(__first.base(), __last.base(),
>       __result); }
>    };
>
>  template<>
>    struct __copy_backward_normal<false, true>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return _BI2(std::__copy_backward_aux(__first, __last,
>            __result.base())); }
>    };
>
>  template<>
>    struct __copy_backward_normal<true, true>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return _BI2(std::__copy_backward_aux(__first.base(), __last.base(),
>            __result.base())); }
>    };
># 502 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template <typename _BI1, typename _BI2>
>    inline _BI2
>    copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      const bool __bi1 = __is_normal_iterator<_BI1>::__value;
>      const bool __bi2 = __is_normal_iterator<_BI2>::__value;
>      return std::__copy_backward_normal<__bi1, __bi2>::copy_b_n(__first, __last,
>         __result);
>    }
>
>  template<bool>
>    struct __fill
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        fill(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>        {
>   for (; __first != __last; ++__first)
>     *__first = __value;
> }
>    };
>
>  template<>
>    struct __fill<true>
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        fill(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>        {
>   const _Tp __tmp = __value;
>   for (; __first != __last; ++__first)
>     *__first = __tmp;
> }
>    };
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
>    {
>
>     
>
>      ;
>
>      const bool __scalar = __is_scalar<_Tp>::__value;
>      std::__fill<__scalar>::fill(__first, __last, __value);
>    }
>
>
>  inline void
>  fill(unsigned char* __first, unsigned char* __last, const unsigned char& __c)
>  {
>    ;
>    const unsigned char __tmp = __c;
>    std::memset(__first, __tmp, __last - __first);
>  }
>
>  inline void
>  fill(signed char* __first, signed char* __last, const signed char& __c)
>  {
>    ;
>    const signed char __tmp = __c;
>    std::memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
>  }
>
>  inline void
>  fill(char* __first, char* __last, const char& __c)
>  {
>    ;
>    const char __tmp = __c;
>    std::memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
>  }
>
>  template<bool>
>    struct __fill_n
>    {
>      template<typename _OutputIterator, typename _Size, typename _Tp>
>        static _OutputIterator
>        fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>        {
>   for (; __n > 0; --__n, ++__first)
>     *__first = __value;
>   return __first;
> }
>    };
>
>  template<>
>    struct __fill_n<true>
>    {
>      template<typename _OutputIterator, typename _Size, typename _Tp>
>        static _OutputIterator
>        fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>        {
>   const _Tp __tmp = __value;
>   for (; __n > 0; --__n, ++__first)
>     *__first = __tmp;
>   return __first;
> }
>    };
># 634 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _OutputIterator, typename _Size, typename _Tp>
>    _OutputIterator
>    fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>    {
>
>     
>
>      const bool __scalar = __is_scalar<_Tp>::__value;
>      return std::__fill_n<__scalar>::fill_n(__first, __n, __value);
>    }
>
>  template<typename _Size>
>    inline unsigned char*
>    fill_n(unsigned char* __first, _Size __n, const unsigned char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
>
>  template<typename _Size>
>    inline signed char*
>    fill_n(char* __first, _Size __n, const signed char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
>
>  template<typename _Size>
>    inline char*
>    fill_n(char* __first, _Size __n, const char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
># 681 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    pair<_InputIterator1, _InputIterator2>
>    mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      while (__first1 != __last1 && *__first1 == *__first2)
>        {
>   ++__first1;
>   ++__first2;
>        }
>      return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
>    }
># 716 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _BinaryPredicate>
>    pair<_InputIterator1, _InputIterator2>
>    mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      while (__first1 != __last1 && __binary_pred(*__first1, *__first2))
>        {
>   ++__first1;
>   ++__first2;
>        }
>      return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
>    }
># 746 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    inline bool
>    equal(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!(*__first1 == *__first2))
>   return false;
>      return true;
>    }
># 778 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _BinaryPredicate>
>    inline bool
>    equal(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2,
>   _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!__binary_pred(*__first1, *__first2))
>   return false;
>      return true;
>    }
># 810 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    bool
>    lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>     
>
>
>      ;
>      ;
>
>      for (; __first1 != __last1 && __first2 != __last2;
>    ++__first1, ++__first2)
> {
>   if (*__first1 < *__first2)
>     return true;
>   if (*__first2 < *__first1)
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
># 850 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _Compare>
>    bool
>    lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _Compare __comp)
>    {
>
>     
>     
>      ;
>      ;
>
>      for (; __first1 != __last1 && __first2 != __last2;
>    ++__first1, ++__first2)
> {
>   if (__comp(*__first1, *__first2))
>     return true;
>   if (__comp(*__first2, *__first1))
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
>
>  inline bool
>  lexicographical_compare(const unsigned char* __first1,
>     const unsigned char* __last1,
>     const unsigned char* __first2,
>     const unsigned char* __last2)
>  {
>    ;
>    ;
>
>    const size_t __len1 = __last1 - __first1;
>    const size_t __len2 = __last2 - __first2;
>    const int __result = std::memcmp(__first1, __first2,
>         std::min(__len1, __len2));
>    return __result != 0 ? __result < 0 : __len1 < __len2;
>  }
>
>  inline bool
>  lexicographical_compare(const char* __first1, const char* __last1,
>     const char* __first2, const char* __last2)
>  {
>    ;
>    ;
>
>
>    return std::lexicographical_compare((const signed char*) __first1,
>     (const signed char*) __last1,
>     (const signed char*) __first2,
>     (const signed char*) __last2);
>
>
>
>
>
>
>  }
>
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 2 3
>
>
>namespace __gnu_cxx
>{
># 61 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>  template <class _CharT>
>    struct _Char_types
>    {
>      typedef unsigned long int_type;
>      typedef std::streampos pos_type;
>      typedef std::streamoff off_type;
>      typedef std::mbstate_t state_type;
>    };
># 86 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>  template<typename _CharT>
>    struct char_traits
>    {
>      typedef _CharT char_type;
>      typedef typename _Char_types<_CharT>::int_type int_type;
>      typedef typename _Char_types<_CharT>::pos_type pos_type;
>      typedef typename _Char_types<_CharT>::off_type off_type;
>      typedef typename _Char_types<_CharT>::state_type state_type;
>
>      static void
>      assign(char_type& __c1, const char_type& __c2)
>      { __c1 = __c2; }
>
>      static bool
>      eq(const char_type& __c1, const char_type& __c2)
>      { return __c1 == __c2; }
>
>      static bool
>      lt(const char_type& __c1, const char_type& __c2)
>      { return __c1 < __c2; }
>
>      static int
>      compare(const char_type* __s1, const char_type* __s2, std::size_t __n);
>
>      static std::size_t
>      length(const char_type* __s);
>
>      static const char_type*
>      find(const char_type* __s, std::size_t __n, const char_type& __a);
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, std::size_t __n);
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, std::size_t __n);
>
>      static char_type*
>      assign(char_type* __s, std::size_t __n, char_type __a);
>
>      static char_type
>      to_char_type(const int_type& __c)
>      { return static_cast<char_type>(__c); }
>
>      static int_type
>      to_int_type(const char_type& __c)
>      { return static_cast<int_type>(__c); }
>
>      static bool
>      eq_int_type(const int_type& __c1, const int_type& __c2)
>      { return __c1 == __c2; }
>
>      static int_type
>      eof()
>      { return static_cast<int_type>((-1)); }
>
>      static int_type
>      not_eof(const int_type& __c)
>      { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); }
>    };
>
>  template<typename _CharT>
>    int
>    char_traits<_CharT>::
>    compare(const char_type* __s1, const char_type* __s2, std::size_t __n)
>    {
>      for (size_t __i = 0; __i < __n; ++__i)
> if (lt(__s1[__i], __s2[__i]))
>   return -1;
> else if (lt(__s2[__i], __s1[__i]))
>   return 1;
>      return 0;
>    }
>
>  template<typename _CharT>
>    std::size_t
>    char_traits<_CharT>::
>    length(const char_type* __p)
>    {
>      std::size_t __i = 0;
>      while (!eq(__p[__i], char_type()))
>        ++__i;
>      return __i;
>    }
>
>  template<typename _CharT>
>    const typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    find(const char_type* __s, std::size_t __n, const char_type& __a)
>    {
>      for (std::size_t __i = 0; __i < __n; ++__i)
>        if (eq(__s[__i], __a))
>          return __s + __i;
>      return 0;
>    }
>
>  template<typename _CharT>
>    typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    move(char_type* __s1, const char_type* __s2, std::size_t __n)
>    {
>      return static_cast<_CharT*>(std::memmove(__s1, __s2,
>            __n * sizeof(char_type)));
>    }
>
>  template<typename _CharT>
>    typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    copy(char_type* __s1, const char_type* __s2, std::size_t __n)
>    {
>      std::copy(__s2, __s2 + __n, __s1);
>      return __s1;
>    }
>
>  template<typename _CharT>
>    typename char_traits<_CharT>::char_type*
>    char_traits<_CharT>::
>    assign(char_type* __s, std::size_t __n, char_type __a)
>    {
>      std::fill_n(__s, __n, __a);
>      return __s;
>    }
>}
>
>namespace std
>{
># 224 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/char_traits.h" 3
>  template<class _CharT>
>    struct char_traits : public __gnu_cxx::char_traits<_CharT>
>    { };
>
>
>
>  template<>
>    struct char_traits<char>
>    {
>      typedef char char_type;
>      typedef int int_type;
>      typedef streampos pos_type;
>      typedef streamoff off_type;
>      typedef mbstate_t state_type;
>
>      static void
>      assign(char_type& __c1, const char_type& __c2)
>      { __c1 = __c2; }
>
>      static bool
>      eq(const char_type& __c1, const char_type& __c2)
>      { return __c1 == __c2; }
>
>      static bool
>      lt(const char_type& __c1, const char_type& __c2)
>      { return __c1 < __c2; }
>
>      static int
>      compare(const char_type* __s1, const char_type* __s2, size_t __n)
>      { return memcmp(__s1, __s2, __n); }
>
>      static size_t
>      length(const char_type* __s)
>      { return strlen(__s); }
>
>      static const char_type*
>      find(const char_type* __s, size_t __n, const char_type& __a)
>      { return static_cast<const char_type*>(memchr(__s, __a, __n)); }
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, size_t __n)
>      { return static_cast<char_type*>(memmove(__s1, __s2, __n)); }
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, size_t __n)
>      { return static_cast<char_type*>(memcpy(__s1, __s2, __n)); }
>
>      static char_type*
>      assign(char_type* __s, size_t __n, char_type __a)
>      { return static_cast<char_type*>(memset(__s, __a, __n)); }
>
>      static char_type
>      to_char_type(const int_type& __c)
>      { return static_cast<char_type>(__c); }
>
>
>
>      static int_type
>      to_int_type(const char_type& __c)
>      { return static_cast<int_type>(static_cast<unsigned char>(__c)); }
>
>      static bool
>      eq_int_type(const int_type& __c1, const int_type& __c2)
>      { return __c1 == __c2; }
>
>      static int_type
>      eof() { return static_cast<int_type>((-1)); }
>
>      static int_type
>      not_eof(const int_type& __c)
>      { return (__c == eof()) ? 0 : __c; }
>  };
>
>
>
>
>  template<>
>    struct char_traits<wchar_t>
>    {
>      typedef wchar_t char_type;
>      typedef wint_t int_type;
>      typedef streamoff off_type;
>      typedef wstreampos pos_type;
>      typedef mbstate_t state_type;
>
>      static void
>      assign(char_type& __c1, const char_type& __c2)
>      { __c1 = __c2; }
>
>      static bool
>      eq(const char_type& __c1, const char_type& __c2)
>      { return __c1 == __c2; }
>
>      static bool
>      lt(const char_type& __c1, const char_type& __c2)
>      { return __c1 < __c2; }
>
>      static int
>      compare(const char_type* __s1, const char_type* __s2, size_t __n)
>      { return wmemcmp(__s1, __s2, __n); }
>
>      static size_t
>      length(const char_type* __s)
>      { return wcslen(__s); }
>
>      static const char_type*
>      find(const char_type* __s, size_t __n, const char_type& __a)
>      { return wmemchr(__s, __a, __n); }
>
>      static char_type*
>      move(char_type* __s1, const char_type* __s2, size_t __n)
>      { return wmemmove(__s1, __s2, __n); }
>
>      static char_type*
>      copy(char_type* __s1, const char_type* __s2, size_t __n)
>      { return wmemcpy(__s1, __s2, __n); }
>
>      static char_type*
>      assign(char_type* __s, size_t __n, char_type __a)
>      { return wmemset(__s, __a, __n); }
>
>      static char_type
>      to_char_type(const int_type& __c) { return char_type(__c); }
>
>      static int_type
>      to_int_type(const char_type& __c) { return int_type(__c); }
>
>      static bool
>      eq_int_type(const int_type& __c1, const int_type& __c2)
>      { return __c1 == __c2; }
>
>      static int_type
>      eof() { return static_cast<int_type>((0xffffffffu)); }
>
>      static int_type
>      not_eof(const int_type& __c)
>      { return eq_int_type(__c, eof()) ? 0 : __c; }
>  };
>
>
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 1 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>       
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/allocator.h" 1 3
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++allocator.h" 1 3
># 34 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ext/new_allocator.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ext/new_allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 1 3
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>  class exception
>  {
>  public:
>    exception() throw() { }
>    virtual ~exception() throw();
>
>
>    virtual const char* what() const throw();
>  };
>
>
>
>  class bad_exception : public exception
>  {
>  public:
>    bad_exception() throw() { }
>
>
>    virtual ~bad_exception() throw();
>  };
>
>
>  typedef void (*terminate_handler) ();
>
>  typedef void (*unexpected_handler) ();
>
>
>  terminate_handler set_terminate(terminate_handler) throw();
>
>
>  void terminate() __attribute__ ((__noreturn__));
>
>
>  unexpected_handler set_unexpected(unexpected_handler) throw();
>
>
>  void unexpected() __attribute__ ((__noreturn__));
># 102 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>  bool uncaught_exception() throw();
>}
>
>namespace __gnu_cxx
>{
># 117 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/exception" 3
>  void __verbose_terminate_handler ();
>}
>
>}
>
>#pragma GCC visibility pop
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 2 3
>
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
>
>
>
>
>
>  class bad_alloc : public exception
>  {
>  public:
>    bad_alloc() throw() { }
>
>
>    virtual ~bad_alloc() throw();
>  };
>
>  struct nothrow_t { };
>  extern const nothrow_t nothrow;
>
>
>  typedef void (*new_handler)();
>
>  new_handler set_new_handler(new_handler) throw();
>}
># 84 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/new" 3
>void* operator new(std::size_t) throw (std::bad_alloc);
>void* operator new[](std::size_t) throw (std::bad_alloc);
>void operator delete(void*) throw();
>void operator delete[](void*) throw();
>void* operator new(std::size_t, const std::nothrow_t&) throw();
>void* operator new[](std::size_t, const std::nothrow_t&) throw();
>void operator delete(void*, const std::nothrow_t&) throw();
>void operator delete[](void*, const std::nothrow_t&) throw();
>
>
>inline void* operator new(std::size_t, void* __p) throw() { return __p; }
>inline void* operator new[](std::size_t, void* __p) throw() { return __p; }
>
>
>inline void operator delete (void*, void*) throw() { }
>inline void operator delete[](void*, void*) throw() { }
>
>}
>
>#pragma GCC visibility pop
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ext/new_allocator.h" 2 3
>
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>
>
>  template<typename _Tp>
>    class new_allocator
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef new_allocator<_Tp1> other; };
>
>      new_allocator() throw() { }
>
>      new_allocator(const new_allocator&) throw() { }
>
>      template<typename _Tp1>
>        new_allocator(const new_allocator<_Tp1>&) throw() { }
>
>      ~new_allocator() throw() { }
>
>      pointer
>      address(reference __x) const { return &__x; }
>
>      const_pointer
>      address(const_reference __x) const { return &__x; }
>
>
>
>      pointer
>      allocate(size_type __n, const void* = 0)
>      {
> if (__builtin_expect(__n > this->max_size(), false))
>   std::__throw_bad_alloc();
>
> return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
>      }
>
>
>      void
>      deallocate(pointer __p, size_type)
>      { ::operator delete(__p); }
>
>      size_type
>      max_size() const throw()
>      { return size_t(-1) / sizeof(_Tp); }
>
>
>
>      void
>      construct(pointer __p, const _Tp& __val)
>      { ::new(__p) _Tp(__val); }
>
>      void
>      destroy(pointer __p) { __p->~_Tp(); }
>    };
>
>  template<typename _Tp>
>    inline bool
>    operator==(const new_allocator<_Tp>&, const new_allocator<_Tp>&)
>    { return true; }
>
>  template<typename _Tp>
>    inline bool
>    operator!=(const new_allocator<_Tp>&, const new_allocator<_Tp>&)
>    { return false; }
>}
># 35 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/c++allocator.h" 2 3
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/allocator.h" 2 3
>
>namespace std
>{
>  template<typename _Tp>
>    class allocator;
>
>
>  template<>
>    class allocator<void>
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef void* pointer;
>      typedef const void* const_pointer;
>      typedef void value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef allocator<_Tp1> other; };
>    };
>
>
>
>
>
>
>
>  template<typename _Tp>
>    class allocator: public __gnu_cxx::new_allocator<_Tp>
>    {
>   public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef allocator<_Tp1> other; };
>
>      allocator() throw() { }
>
>      allocator(const allocator& __a) throw()
>      : __gnu_cxx::new_allocator<_Tp>(__a) { }
>
>      template<typename _Tp1>
>        allocator(const allocator<_Tp1>&) throw() { }
>
>      ~allocator() throw() { }
>
>
>    };
>
>  template<typename _T1, typename _T2>
>    inline bool
>    operator==(const allocator<_T1>&, const allocator<_T2>&)
>    { return true; }
>
>  template<typename _T1, typename _T2>
>    inline bool
>    operator!=(const allocator<_T1>&, const allocator<_T2>&)
>    { return false; }
>
>
>
>
>
>  extern template class allocator<char>;
>  extern template class allocator<wchar_t>;
>
>
>
>
>}
># 55 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>namespace std
>{
>
>
>
>
>
>
>  template<typename _T1, typename _T2>
>    inline void
>    _Construct(_T1* __p, const _T2& __value)
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1(__value);
>    }
>
>
>
>
>
>
>
>  template<typename _T1>
>    inline void
>    _Construct(_T1* __p)
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1();
>    }
>
>
>
>
>
>
>  template<typename _Tp>
>    inline void
>    _Destroy(_Tp* __pointer)
>    { __pointer->~_Tp(); }
># 116 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator __first, _ForwardIterator __last,
>    __false_type)
>    {
>      for (; __first != __last; ++__first)
> std::_Destroy(&*__first);
>    }
># 134 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type)
>    { }
># 146 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
>                       _Value_type;
>      typedef typename std::__is_scalar<_Value_type>::__type
>                _Has_trivial_destructor;
>
>      std::__destroy_aux(__first, __last, _Has_trivial_destructor());
>    }
># 166 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_construct.h" 3
>  template <typename _Tp> class allocator;
>
>  template<typename _ForwardIterator, typename _Allocator>
>    void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      _Allocator __alloc)
>    {
>      for (; __first != __last; ++__first)
> __alloc.destroy(&*__first);
>    }
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      allocator<_Tp>)
>    {
>      _Destroy(__first, __last);
>    }
>
>
>}
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>namespace std
>{
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result,
>        __true_type)
>    { return std::copy(__first, __last, __result); }
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result,
>        __false_type)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   for (; __first != __last; ++__first, ++__cur)
>     std::_Construct(&*__cur, *__first);
>   return __cur;
> }
>      catch(...)
> {
>   std::_Destroy(__result, __cur);
>   throw;
> }
>    }
># 105 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    uninitialized_copy(_InputIterator __first, _InputIterator __last,
>         _ForwardIterator __result)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      return std::__uninitialized_copy_aux(__first, __last, __result,
>        _Is_POD());
>    }
>
>  inline char*
>  uninitialized_copy(const char* __first, const char* __last, char* __result)
>  {
>    std::memmove(__result, __first, __last - __first);
>    return __result + (__last - __first);
>  }
>
>  inline wchar_t*
>  uninitialized_copy(const wchar_t* __first, const wchar_t* __last,
>       wchar_t* __result)
>  {
>    std::memmove(__result, __first, sizeof(wchar_t) * (__last - __first));
>    return __result + (__last - __first);
>  }
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    __uninitialized_fill_aux(_ForwardIterator __first,
>        _ForwardIterator __last,
>        const _Tp& __x, __true_type)
>    { std::fill(__first, __last, __x); }
>
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last,
>        const _Tp& __x, __false_type)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __cur != __last; ++__cur)
>     std::_Construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur);
>   throw;
> }
>    }
># 167 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,
>         const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      std::__uninitialized_fill_aux(__first, __last, __x, _Is_POD());
>    }
>
>
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,
>          const _Tp& __x, __true_type)
>    { std::fill_n(__first, __n, __x); }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    void
>    __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,
>          const _Tp& __x, __false_type)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __n > 0; --__n, ++__cur)
>     std::_Construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur);
>   throw;
> }
>    }
># 212 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      std::__uninitialized_fill_n_aux(__first, __n, __x, _Is_POD());
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result,
>      _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   for (; __first != __last; ++__first, ++__cur)
>     __alloc.construct(&*__cur, *__first);
>   return __cur;
> }
>      catch(...)
> {
>   std::_Destroy(__result, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp>
>    inline _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result,
>      allocator<_Tp>)
>    {
>      return std::uninitialized_copy(__first, __last, __result);
>    }
>
>  template<typename _ForwardIterator, typename _Tp, typename _Allocator>
>    void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __cur != __last; ++__cur)
>     __alloc.construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Tp, typename _Tp2>
>    inline void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, allocator<_Tp2>)
>    {
>      std::uninitialized_fill(__first, __last, __x);
>    }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Allocator>
>    void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x,
>        _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __n > 0; --__n, ++__cur)
>     __alloc.construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Tp2>
>    void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x,
>        allocator<_Tp2>)
>    {
>      std::uninitialized_fill_n(__first, __n, __x);
>    }
># 323 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_copy_copy(_InputIterator1 __first1,
>         _InputIterator1 __last1,
>         _InputIterator2 __first2,
>         _InputIterator2 __last2,
>         _ForwardIterator __result,
>         _Allocator __alloc)
>    {
>      _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1,
>          __result,
>          __alloc);
>      try
> {
>   return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp, typename _InputIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_fill_copy(_ForwardIterator __result, _ForwardIterator __mid,
>         const _Tp& __x, _InputIterator __first,
>         _InputIterator __last,
>         _Allocator __alloc)
>    {
>      std::__uninitialized_fill_a(__result, __mid, __x, __alloc);
>      try
> {
>   return std::__uninitialized_copy_a(__first, __last, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp,
>    typename _Allocator>
>    inline void
>    __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1,
>         _ForwardIterator __first2,
>         _ForwardIterator __last2, const _Tp& __x,
>         _Allocator __alloc)
>    {
>      _ForwardIterator __mid2 = std::__uninitialized_copy_a(__first1, __last1,
>           __first2,
>           __alloc);
>      try
> {
>   std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__first2, __mid2, __alloc);
>   throw;
> }
>    }
>
>}
># 58 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_raw_storage_iter.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_raw_storage_iter.h" 3
>namespace std
>{
>
>
>
>
>  template <class _ForwardIterator, class _Tp>
>    class raw_storage_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _ForwardIterator _M_iter;
>
>    public:
>      explicit
>      raw_storage_iterator(_ForwardIterator __x)
>      : _M_iter(__x) {}
>
>      raw_storage_iterator&
>      operator*() { return *this; }
>
>      raw_storage_iterator&
>      operator=(const _Tp& __element)
>      {
> std::_Construct(&*_M_iter, __element);
> return *this;
>      }
>
>      raw_storage_iterator<_ForwardIterator, _Tp>&
>      operator++()
>      {
> ++_M_iter;
> return *this;
>      }
>
>      raw_storage_iterator<_ForwardIterator, _Tp>
>      operator++(int)
>      {
> raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this;
> ++_M_iter;
> return __tmp;
>      }
>    };
>}
># 59 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 1 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>       
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
># 149 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>namespace std
>{
>
>
>
>
>
>  enum float_round_style
>  {
>    round_indeterminate = -1,
>    round_toward_zero = 0,
>    round_to_nearest = 1,
>    round_toward_infinity = 2,
>    round_toward_neg_infinity = 3
>  };
>
>
>
>
>
>
>
>  enum float_denorm_style
>  {
>
>    denorm_indeterminate = -1,
>
>    denorm_absent = 0,
>
>    denorm_present = 1
>  };
># 191 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>  struct __numeric_limits_base
>  {
>
>
>    static const bool is_specialized = false;
>
>
>
>
>    static const int digits = 0;
>
>    static const int digits10 = 0;
>
>    static const bool is_signed = false;
>
>
>
>
>
>    static const bool is_integer = false;
>
>
>
>
>    static const bool is_exact = false;
>
>
>    static const int radix = 0;
>
>
>
>    static const int min_exponent = 0;
>
>
>    static const int min_exponent10 = 0;
>
>
>
>    static const int max_exponent = 0;
>
>
>    static const int max_exponent10 = 0;
>
>
>    static const bool has_infinity = false;
>
>
>    static const bool has_quiet_NaN = false;
>
>
>    static const bool has_signaling_NaN = false;
>
>    static const float_denorm_style has_denorm = denorm_absent;
>
>
>    static const bool has_denorm_loss = false;
>
>
>
>    static const bool is_iec559 = false;
>
>
>
>    static const bool is_bounded = false;
>
>
>
>
>    static const bool is_modulo = false;
>
>
>    static const bool traps = false;
>
>    static const bool tinyness_before = false;
>
>
>
>    static const float_round_style round_style = round_toward_zero;
>  };
># 284 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/limits" 3
>  template<typename _Tp>
>    struct numeric_limits : public __numeric_limits_base
>    {
>
>
>      static _Tp min() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp max() throw() { return static_cast<_Tp>(0); }
>
>
>      static _Tp epsilon() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp round_error() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp infinity() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); }
>
>
>      static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); }
>
>
>
>      static _Tp denorm_min() throw() { return static_cast<_Tp>(0); }
>    };
>
>
>
>
>
>  template<>
>    struct numeric_limits<bool>
>    {
>      static const bool is_specialized = true;
>
>      static bool min() throw()
>      { return false; }
>      static bool max() throw()
>      { return true; }
>
>      static const int digits = 1;
>      static const int digits10 = 0;
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static bool epsilon() throw()
>      { return false; }
>      static bool round_error() throw()
>      { return false; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static bool infinity() throw()
>      { return false; }
>      static bool quiet_NaN() throw()
>      { return false; }
>      static bool signaling_NaN() throw()
>      { return false; }
>      static bool denorm_min() throw()
>      { return false; }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>
>
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<char>
>    {
>      static const bool is_specialized = true;
>
>      static char min() throw()
>      { return (((char)(-1) < 0) ? (char)1 << (sizeof(char) * 8 - ((char)(-1) < 0)) : (char)0); }
>      static char max() throw()
>      { return (((char)(-1) < 0) ? ((char)1 << (sizeof(char) * 8 - ((char)(-1) < 0))) - 1 : ~(char)0); }
>
>      static const int digits = (sizeof(char) * 8 - ((char)(-1) < 0));
>      static const int digits10 = ((sizeof(char) * 8 - ((char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = ((char)(-1) < 0);
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static char epsilon() throw()
>      { return 0; }
>      static char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static char infinity() throw()
>      { return char(); }
>      static char quiet_NaN() throw()
>      { return char(); }
>      static char signaling_NaN() throw()
>      { return char(); }
>      static char denorm_min() throw()
>      { return static_cast<char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<signed char>
>    {
>      static const bool is_specialized = true;
>
>      static signed char min() throw()
>      { return -127 - 1; }
>      static signed char max() throw()
>      { return 127; }
>
>      static const int digits = (sizeof(signed char) * 8 - ((signed char)(-1) < 0));
>      static const int digits10 = ((sizeof(signed char) * 8 - ((signed char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static signed char epsilon() throw()
>      { return 0; }
>      static signed char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static signed char infinity() throw()
>      { return static_cast<signed char>(0); }
>      static signed char quiet_NaN() throw()
>      { return static_cast<signed char>(0); }
>      static signed char signaling_NaN() throw()
>      { return static_cast<signed char>(0); }
>      static signed char denorm_min() throw()
>      { return static_cast<signed char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned char>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned char min() throw()
>      { return 0; }
>      static unsigned char max() throw()
>      { return 127 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned char epsilon() throw()
>      { return 0; }
>      static unsigned char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned char infinity() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char quiet_NaN() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char signaling_NaN() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char denorm_min() throw()
>      { return static_cast<unsigned char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<wchar_t>
>    {
>      static const bool is_specialized = true;
>
>      static wchar_t min() throw()
>      { return (((wchar_t)(-1) < 0) ? (wchar_t)1 << (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) : (wchar_t)0); }
>      static wchar_t max() throw()
>      { return (((wchar_t)(-1) < 0) ? ((wchar_t)1 << (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0))) - 1 : ~(wchar_t)0); }
>
>      static const int digits = (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0));
>      static const int digits10 = ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = ((wchar_t)(-1) < 0);
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static wchar_t epsilon() throw()
>      { return 0; }
>      static wchar_t round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static wchar_t infinity() throw()
>      { return wchar_t(); }
>      static wchar_t quiet_NaN() throw()
>      { return wchar_t(); }
>      static wchar_t signaling_NaN() throw()
>      { return wchar_t(); }
>      static wchar_t denorm_min() throw()
>      { return wchar_t(); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<short>
>    {
>      static const bool is_specialized = true;
>
>      static short min() throw()
>      { return -32767 - 1; }
>      static short max() throw()
>      { return 32767; }
>
>      static const int digits = (sizeof(short) * 8 - ((short)(-1) < 0));
>      static const int digits10 = ((sizeof(short) * 8 - ((short)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static short epsilon() throw()
>      { return 0; }
>      static short round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static short infinity() throw()
>      { return short(); }
>      static short quiet_NaN() throw()
>      { return short(); }
>      static short signaling_NaN() throw()
>      { return short(); }
>      static short denorm_min() throw()
>      { return short(); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned short>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned short min() throw()
>      { return 0; }
>      static unsigned short max() throw()
>      { return 32767 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned short epsilon() throw()
>      { return 0; }
>      static unsigned short round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned short infinity() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short quiet_NaN() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short signaling_NaN() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short denorm_min() throw()
>      { return static_cast<unsigned short>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<int>
>    {
>      static const bool is_specialized = true;
>
>      static int min() throw()
>      { return -2147483647 - 1; }
>      static int max() throw()
>      { return 2147483647; }
>
>      static const int digits = (sizeof(int) * 8 - ((int)(-1) < 0));
>      static const int digits10 = ((sizeof(int) * 8 - ((int)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static int epsilon() throw()
>      { return 0; }
>      static int round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static int infinity() throw()
>      { return static_cast<int>(0); }
>      static int quiet_NaN() throw()
>      { return static_cast<int>(0); }
>      static int signaling_NaN() throw()
>      { return static_cast<int>(0); }
>      static int denorm_min() throw()
>      { return static_cast<int>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned int>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned int min() throw()
>      { return 0; }
>      static unsigned int max() throw()
>      { return 2147483647 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned int epsilon() throw()
>      { return 0; }
>      static unsigned int round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned int infinity() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int quiet_NaN() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int signaling_NaN() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int denorm_min() throw()
>      { return static_cast<unsigned int>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<long>
>    {
>      static const bool is_specialized = true;
>
>      static long min() throw()
>      { return -2147483647L - 1; }
>      static long max() throw()
>      { return 2147483647L; }
>
>      static const int digits = (sizeof(long) * 8 - ((long)(-1) < 0));
>      static const int digits10 = ((sizeof(long) * 8 - ((long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static long epsilon() throw()
>      { return 0; }
>      static long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static long infinity() throw()
>      { return static_cast<long>(0); }
>      static long quiet_NaN() throw()
>      { return static_cast<long>(0); }
>      static long signaling_NaN() throw()
>      { return static_cast<long>(0); }
>      static long denorm_min() throw()
>      { return static_cast<long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned long>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned long min() throw()
>      { return 0; }
>      static unsigned long max() throw()
>      { return 2147483647L * 2UL + 1; }
>
>      static const int digits = (sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned long epsilon() throw()
>      { return 0; }
>      static unsigned long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned long infinity() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long quiet_NaN() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long signaling_NaN() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long denorm_min() throw()
>      { return static_cast<unsigned long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<long long>
>    {
>      static const bool is_specialized = true;
>
>      static long long min() throw()
>      { return -9223372036854775807LL - 1; }
>      static long long max() throw()
>      { return 9223372036854775807LL; }
>
>      static const int digits = (sizeof(long long) * 8 - ((long long)(-1) < 0));
>      static const int digits10 = ((sizeof(long long) * 8 - ((long long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static long long epsilon() throw()
>      { return 0; }
>      static long long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static long long infinity() throw()
>      { return static_cast<long long>(0); }
>      static long long quiet_NaN() throw()
>      { return static_cast<long long>(0); }
>      static long long signaling_NaN() throw()
>      { return static_cast<long long>(0); }
>      static long long denorm_min() throw()
>      { return static_cast<long long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned long long>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned long long min() throw()
>      { return 0; }
>      static unsigned long long max() throw()
>      { return 9223372036854775807LL * 2ULL + 1; }
>
>      static const int digits = (sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned long long epsilon() throw()
>      { return 0; }
>      static unsigned long long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned long long infinity() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long quiet_NaN() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long signaling_NaN() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long denorm_min() throw()
>      { return static_cast<unsigned long long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<float>
>    {
>      static const bool is_specialized = true;
>
>      static float min() throw()
>      { return 1.17549435e-38F; }
>      static float max() throw()
>      { return 3.40282347e+38F; }
>
>      static const int digits = 24;
>      static const int digits10 = 6;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static float epsilon() throw()
>      { return 1.19209290e-7F; }
>      static float round_error() throw()
>      { return 0.5F; }
>
>      static const int min_exponent = (-125);
>      static const int min_exponent10 = (-37);
>      static const int max_exponent = 128;
>      static const int max_exponent10 = 38;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(1.40129846e-45F) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static float infinity() throw()
>      { return __builtin_huge_valf (); }
>      static float quiet_NaN() throw()
>      { return __builtin_nanf (""); }
>      static float signaling_NaN() throw()
>      { return __builtin_nansf (""); }
>      static float denorm_min() throw()
>      { return 1.40129846e-45F; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>
>  template<>
>    struct numeric_limits<double>
>    {
>      static const bool is_specialized = true;
>
>      static double min() throw()
>      { return 2.2250738585072014e-308; }
>      static double max() throw()
>      { return 1.7976931348623157e+308; }
>
>      static const int digits = 53;
>      static const int digits10 = 15;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static double epsilon() throw()
>      { return 2.2204460492503131e-16; }
>      static double round_error() throw()
>      { return 0.5; }
>
>      static const int min_exponent = (-1021);
>      static const int min_exponent10 = (-307);
>      static const int max_exponent = 1024;
>      static const int max_exponent10 = 308;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(4.9406564584124654e-324) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static double infinity() throw()
>      { return __builtin_huge_val(); }
>      static double quiet_NaN() throw()
>      { return __builtin_nan (""); }
>      static double signaling_NaN() throw()
>      { return __builtin_nans (""); }
>      static double denorm_min() throw()
>      { return 4.9406564584124654e-324; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>
>  template<>
>    struct numeric_limits<long double>
>    {
>      static const bool is_specialized = true;
>
>      static long double min() throw()
>      { return 3.36210314311209350626e-4932L; }
>      static long double max() throw()
>      { return 1.18973149535723176502e+4932L; }
>
>      static const int digits = 64;
>      static const int digits10 = 18;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static long double epsilon() throw()
>      { return 1.08420217248550443401e-19L; }
>      static long double round_error() throw()
>      { return 0.5L; }
>
>      static const int min_exponent = (-16381);
>      static const int min_exponent10 = (-4931);
>      static const int max_exponent = 16384;
>      static const int max_exponent10 = 4932;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(3.64519953188247460253e-4951L) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss
> = false;
>
>      static long double infinity() throw()
>      { return __builtin_huge_vall (); }
>      static long double quiet_NaN() throw()
>      { return __builtin_nanl (""); }
>      static long double signaling_NaN() throw()
>      { return __builtin_nansl (""); }
>      static long double denorm_min() throw()
>      { return 3.64519953188247460253e-4951L; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>}
># 61 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 2 3
>
>namespace std
>{
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    pair<_Tp*, ptrdiff_t>
>    __get_temporary_buffer(ptrdiff_t __len, _Tp*)
>    {
>      const ptrdiff_t __max = numeric_limits<ptrdiff_t>::max() / sizeof(_Tp);
>      if (__len > __max)
> __len = __max;
>
>      while (__len > 0)
> {
>   _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp),
>       nothrow));
>   if (__tmp != 0)
>     return pair<_Tp*, ptrdiff_t>(__tmp, __len);
>   __len /= 2;
> }
>      return pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0);
>    }
># 108 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    inline pair<_Tp*, ptrdiff_t>
>    get_temporary_buffer(ptrdiff_t __len)
>    { return std::__get_temporary_buffer(__len, static_cast<_Tp*>(0)); }
># 120 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    void
>    return_temporary_buffer(_Tp* __p)
>    { ::operator delete(__p, nothrow); }
># 132 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp1>
>    struct auto_ptr_ref
>    {
>      _Tp1* _M_ptr;
>
>      explicit
>      auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }
>    };
># 173 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>  template<typename _Tp>
>    class auto_ptr
>    {
>    private:
>      _Tp* _M_ptr;
>
>    public:
>
>      typedef _Tp element_type;
>
>
>
>
>
>
>
>      explicit
>      auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }
># 199 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }
># 211 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { }
># 222 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      auto_ptr&
>      operator=(auto_ptr& __a) throw()
>      {
> reset(__a.release());
> return *this;
>      }
># 239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr&
>        operator=(auto_ptr<_Tp1>& __a) throw()
>        {
>   reset(__a.release());
>   return *this;
> }
># 259 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      ~auto_ptr() { delete _M_ptr; }
># 269 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      element_type&
>      operator*() const throw()
>      {
> ;
> return *_M_ptr;
>      }
>
>
>
>
>
>
>
>      element_type*
>      operator->() const throw()
>      {
> ;
> return _M_ptr;
>      }
># 299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      element_type*
>      get() const throw() { return _M_ptr; }
># 313 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      element_type*
>      release() throw()
>      {
> element_type* __tmp = _M_ptr;
> _M_ptr = 0;
> return __tmp;
>      }
># 328 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      void
>      reset(element_type* __p = 0) throw()
>      {
> if (__p != _M_ptr)
>   {
>     delete _M_ptr;
>     _M_ptr = __p;
>   }
>      }
># 349 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/memory" 3
>      auto_ptr(auto_ptr_ref<element_type> __ref) throw()
>      : _M_ptr(__ref._M_ptr) { }
>
>      auto_ptr&
>      operator=(auto_ptr_ref<element_type> __ref) throw()
>      {
> if (__ref._M_ptr != this->get())
>   {
>     delete _M_ptr;
>     _M_ptr = __ref._M_ptr;
>   }
> return *this;
>      }
>
>      template<typename _Tp1>
>        operator auto_ptr_ref<_Tp1>() throw()
>        { return auto_ptr_ref<_Tp1>(this->release()); }
>
>      template<typename _Tp1>
>        operator auto_ptr<_Tp1>() throw()
>        { return auto_ptr<_Tp1>(this->release()); }
>  };
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>namespace std
>{
># 101 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Arg, class _Result>
>    struct unary_function
>    {
>      typedef _Arg argument_type;
>
>
>      typedef _Result result_type;
>    };
>
>
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    struct binary_function
>    {
>      typedef _Arg1 first_argument_type;
>
>
>      typedef _Arg2 second_argument_type;
>      typedef _Result result_type;
>    };
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct plus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x + __y; }
>    };
>
>
>  template <class _Tp>
>    struct minus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x - __y; }
>    };
>
>
>  template <class _Tp>
>    struct multiplies : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x * __y; }
>    };
>
>
>  template <class _Tp>
>    struct divides : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x / __y; }
>    };
>
>
>  template <class _Tp>
>    struct modulus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x % __y; }
>    };
>
>
>  template <class _Tp>
>    struct negate : public unary_function<_Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x) const
>      { return -__x; }
>    };
># 195 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x == __y; }
>    };
>
>
>  template <class _Tp>
>    struct not_equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x != __y; }
>    };
>
>
>  template <class _Tp>
>    struct greater : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x > __y; }
>    };
>
>
>  template <class _Tp>
>    struct less : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x < __y; }
>    };
>
>
>  template <class _Tp>
>    struct greater_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x >= __y; }
>    };
>
>
>  template <class _Tp>
>    struct less_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x <= __y; }
>    };
># 256 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct logical_and : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x && __y; }
>    };
>
>
>  template <class _Tp>
>    struct logical_or : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x || __y; }
>    };
>
>
>  template <class _Tp>
>    struct logical_not : public unary_function<_Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x) const
>      { return !__x; }
>    };
># 311 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Predicate>
>    class unary_negate
>    : public unary_function<typename _Predicate::argument_type, bool>
>    {
>    protected:
>      _Predicate _M_pred;
>    public:
>      explicit
>      unary_negate(const _Predicate& __x) : _M_pred(__x) {}
>
>      bool
>      operator()(const typename _Predicate::argument_type& __x) const
>      { return !_M_pred(__x); }
>    };
>
>
>  template <class _Predicate>
>    inline unary_negate<_Predicate>
>    not1(const _Predicate& __pred)
>    { return unary_negate<_Predicate>(__pred); }
>
>
>  template <class _Predicate>
>    class binary_negate
>    : public binary_function<typename _Predicate::first_argument_type,
>        typename _Predicate::second_argument_type,
>        bool>
>    {
>    protected:
>      _Predicate _M_pred;
>    public:
>      explicit
>      binary_negate(const _Predicate& __x)
>      : _M_pred(__x) { }
>
>      bool
>      operator()(const typename _Predicate::first_argument_type& __x,
>   const typename _Predicate::second_argument_type& __y) const
>      { return !_M_pred(__x, __y); }
>    };
>
>
>  template <class _Predicate>
>    inline binary_negate<_Predicate>
>    not2(const _Predicate& __pred)
>    { return binary_negate<_Predicate>(__pred); }
># 391 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Operation>
>    class binder1st
>    : public unary_function<typename _Operation::second_argument_type,
>       typename _Operation::result_type>
>    {
>    protected:
>      _Operation op;
>      typename _Operation::first_argument_type value;
>    public:
>      binder1st(const _Operation& __x,
>  const typename _Operation::first_argument_type& __y)
>      : op(__x), value(__y) {}
>
>      typename _Operation::result_type
>      operator()(const typename _Operation::second_argument_type& __x) const
>      { return op(value, __x); }
>
>
>
>      typename _Operation::result_type
>      operator()(typename _Operation::second_argument_type& __x) const
>      { return op(value, __x); }
>    };
>
>
>  template <class _Operation, class _Tp>
>    inline binder1st<_Operation>
>    bind1st(const _Operation& __fn, const _Tp& __x)
>    {
>      typedef typename _Operation::first_argument_type _Arg1_type;
>      return binder1st<_Operation>(__fn, _Arg1_type(__x));
>    }
>
>
>  template <class _Operation>
>    class binder2nd
>    : public unary_function<typename _Operation::first_argument_type,
>       typename _Operation::result_type>
>    {
>    protected:
>      _Operation op;
>      typename _Operation::second_argument_type value;
>    public:
>      binder2nd(const _Operation& __x,
>  const typename _Operation::second_argument_type& __y)
>      : op(__x), value(__y) {}
>
>      typename _Operation::result_type
>      operator()(const typename _Operation::first_argument_type& __x) const
>      { return op(__x, value); }
>
>
>
>      typename _Operation::result_type
>      operator()(typename _Operation::first_argument_type& __x) const
>      { return op(__x, value); }
>    };
>
>
>  template <class _Operation, class _Tp>
>    inline binder2nd<_Operation>
>    bind2nd(const _Operation& __fn, const _Tp& __x)
>    {
>      typedef typename _Operation::second_argument_type _Arg2_type;
>      return binder2nd<_Operation>(__fn, _Arg2_type(__x));
>    }
># 480 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Arg, class _Result>
>    class pointer_to_unary_function : public unary_function<_Arg, _Result>
>    {
>    protected:
>      _Result (*_M_ptr)(_Arg);
>    public:
>      pointer_to_unary_function() {}
>
>      explicit
>      pointer_to_unary_function(_Result (*__x)(_Arg))
>      : _M_ptr(__x) {}
>
>      _Result
>      operator()(_Arg __x) const
>      { return _M_ptr(__x); }
>    };
>
>
>  template <class _Arg, class _Result>
>    inline pointer_to_unary_function<_Arg, _Result>
>    ptr_fun(_Result (*__x)(_Arg))
>    { return pointer_to_unary_function<_Arg, _Result>(__x); }
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    class pointer_to_binary_function
>    : public binary_function<_Arg1, _Arg2, _Result>
>    {
>    protected:
>      _Result (*_M_ptr)(_Arg1, _Arg2);
>    public:
>      pointer_to_binary_function() {}
>
>      explicit
>      pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))
>      : _M_ptr(__x) {}
>
>      _Result
>      operator()(_Arg1 __x, _Arg2 __y) const
>      { return _M_ptr(__x, __y); }
>    };
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    inline pointer_to_binary_function<_Arg1, _Arg2, _Result>
>    ptr_fun(_Result (*__x)(_Arg1, _Arg2))
>    { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); }
>
>
>  template <class _Tp>
>    struct _Identity : public unary_function<_Tp,_Tp>
>    {
>      _Tp&
>      operator()(_Tp& __x) const
>      { return __x; }
>
>      const _Tp&
>      operator()(const _Tp& __x) const
>      { return __x; }
>    };
>
>  template <class _Pair>
>    struct _Select1st : public unary_function<_Pair,
>           typename _Pair::first_type>
>    {
>      typename _Pair::first_type&
>      operator()(_Pair& __x) const
>      { return __x.first; }
>
>      const typename _Pair::first_type&
>      operator()(const _Pair& __x) const
>      { return __x.first; }
>    };
>
>  template <class _Pair>
>    struct _Select2nd : public unary_function<_Pair,
>           typename _Pair::second_type>
>    {
>      typename _Pair::second_type&
>      operator()(_Pair& __x) const
>      { return __x.second; }
>
>      const typename _Pair::second_type&
>      operator()(const _Pair& __x) const
>      { return __x.second; }
>    };
># 582 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_function.h" 3
>  template <class _Ret, class _Tp>
>    class mem_fun_t : public unary_function<_Tp*, _Ret>
>    {
>    public:
>      explicit
>      mem_fun_t(_Ret (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp* __p) const
>      { return (__p->*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)();
>    };
>
>
>  template <class _Ret, class _Tp>
>    class const_mem_fun_t : public unary_function<const _Tp*, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun_t(_Ret (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp* __p) const
>      { return (__p->*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Ret, class _Tp>
>    class mem_fun_ref_t : public unary_function<_Tp, _Ret>
>    {
>    public:
>      explicit
>      mem_fun_ref_t(_Ret (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp& __r) const
>      { return (__r.*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)();
>  };
>
>
>  template <class _Ret, class _Tp>
>    class const_mem_fun_ref_t : public unary_function<_Tp, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp& __r) const
>      { return (__r.*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret>
>    {
>    public:
>      explicit
>      mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp* __p, _Arg __x) const
>      { return (__p->*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp* __p, _Arg __x) const
>      { return (__p->*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
>    {
>    public:
>      explicit
>      mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp& __r, _Arg __x) const
>      { return (__r.*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp& __r, _Arg __x) const
>      { return (__r.*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>
>  template <class _Ret, class _Tp>
>    inline mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)())
>    { return mem_fun_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline const_mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)())
>    { return mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline const_mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline const_mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg) const)
>    { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline mem_fun1_ref_t<_Ret, _Tp, _Arg>
>    mem_fun_ref(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg>
>    mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const)
>    { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); }
>
>
>
>}
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/atomicity.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/atomicity.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/atomic_word.h" 1 3
># 33 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/atomic_word.h" 3
>typedef int _Atomic_word;
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/atomicity.h" 2 3
>
>namespace __gnu_cxx
>{
>  _Atomic_word
>  __attribute__ ((__unused__))
>  __exchange_and_add(volatile _Atomic_word* __mem, int __val);
>
>  void
>  __attribute__ ((__unused__))
>  __atomic_add(volatile _Atomic_word* __mem, int __val);
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 2 3
>
>
>namespace std
>{
># 109 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_string
>    {
>      typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;
>
>
>    public:
>      typedef _Traits traits_type;
>      typedef typename _Traits::char_type value_type;
>      typedef _Alloc allocator_type;
>      typedef typename _CharT_alloc_type::size_type size_type;
>      typedef typename _CharT_alloc_type::difference_type difference_type;
>      typedef typename _CharT_alloc_type::reference reference;
>      typedef typename _CharT_alloc_type::const_reference const_reference;
>      typedef typename _CharT_alloc_type::pointer pointer;
>      typedef typename _CharT_alloc_type::const_pointer const_pointer;
>      typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator;
>      typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
>                                                            const_iterator;
>      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>      typedef std::reverse_iterator<iterator> reverse_iterator;
>
>    private:
># 146 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      struct _Rep_base
>      {
> size_type _M_length;
> size_type _M_capacity;
> _Atomic_word _M_refcount;
>      };
>
>      struct _Rep : _Rep_base
>      {
>
> typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc;
># 171 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
> static const size_type _S_max_size;
> static const _CharT _S_terminal;
>
>
>
>        static size_type _S_empty_rep_storage[];
>
>        static _Rep&
>        _S_empty_rep()
>        {
>   void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage);
>   return *reinterpret_cast<_Rep*>(__p);
> }
>
>        bool
> _M_is_leaked() const
>        { return this->_M_refcount < 0; }
>
>        bool
> _M_is_shared() const
>        { return this->_M_refcount > 0; }
>
>        void
> _M_set_leaked()
>        { this->_M_refcount = -1; }
>
>        void
> _M_set_sharable()
>        { this->_M_refcount = 0; }
>
> void
> _M_set_length_and_sharable(size_type __n)
> {
>   this->_M_set_sharable();
>   this->_M_length = __n;
>   traits_type::assign(this->_M_refdata()[__n], _S_terminal);
>
>
> }
>
> _CharT*
> _M_refdata() throw()
> { return reinterpret_cast<_CharT*>(this + 1); }
>
> _CharT*
> _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)
> {
>   return (!_M_is_leaked() && __alloc1 == __alloc2)
>           ? _M_refcopy() : _M_clone(__alloc1);
> }
>
>
> static _Rep*
> _S_create(size_type, size_type, const _Alloc&);
>
> void
> _M_dispose(const _Alloc& __a)
> {
>
>   if (__builtin_expect(this != &_S_empty_rep(), false))
>
>     if (__gnu_cxx::__exchange_and_add(&this->_M_refcount, -1) <= 0)
>       _M_destroy(__a);
> }
>
> void
> _M_destroy(const _Alloc&) throw();
>
> _CharT*
> _M_refcopy() throw()
> {
>
>   if (__builtin_expect(this != &_S_empty_rep(), false))
>
>            __gnu_cxx::__atomic_add(&this->_M_refcount, 1);
>   return _M_refdata();
> }
>
> _CharT*
> _M_clone(const _Alloc&, size_type __res = 0);
>      };
>
>
>      struct _Alloc_hider : _Alloc
>      {
> _Alloc_hider(_CharT* __dat, const _Alloc& __a)
> : _Alloc(__a), _M_p(__dat) { }
>
> _CharT* _M_p;
>      };
>
>    public:
>
>
>
>
>      static const size_type npos = static_cast<size_type>(-1);
>
>    private:
>
>      mutable _Alloc_hider _M_dataplus;
>
>      _CharT*
>      _M_data() const
>      { return _M_dataplus._M_p; }
>
>      _CharT*
>      _M_data(_CharT* __p)
>      { return (_M_dataplus._M_p = __p); }
>
>      _Rep*
>      _M_rep() const
>      { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }
>
>
>
>      iterator
>      _M_ibegin() const
>      { return iterator(_M_data()); }
>
>      iterator
>      _M_iend() const
>      { return iterator(_M_data() + this->size()); }
>
>      void
>      _M_leak()
>      {
> if (!_M_rep()->_M_is_leaked())
>   _M_leak_hard();
>      }
>
>      size_type
>      _M_check(size_type __pos, const char* __s) const
>      {
> if (__pos > this->size())
>   __throw_out_of_range((__s));
> return __pos;
>      }
>
>      void
>      _M_check_length(size_type __n1, size_type __n2, const char* __s) const
>      {
> if (this->max_size() - (this->size() - __n1) < __n2)
>   __throw_length_error((__s));
>      }
>
>
>      size_type
>      _M_limit(size_type __pos, size_type __off) const
>      {
> const bool __testoff = __off < this->size() - __pos;
> return __testoff ? __off : this->size() - __pos;
>      }
>
>
>      bool
>      _M_disjunct(const _CharT* __s) const
>      {
> return (less<const _CharT*>()(__s, _M_data())
>  || less<const _CharT*>()(_M_data() + this->size(), __s));
>      }
>
>
>
>      static void
>      _M_copy(_CharT* __d, const _CharT* __s, size_type __n)
>      {
> if (__n == 1)
>   traits_type::assign(*__d, *__s);
> else
>   traits_type::copy(__d, __s, __n);
>      }
>
>      static void
>      _M_move(_CharT* __d, const _CharT* __s, size_type __n)
>      {
> if (__n == 1)
>   traits_type::assign(*__d, *__s);
> else
>   traits_type::move(__d, __s, __n);
>      }
>
>      static void
>      _M_assign(_CharT* __d, size_type __n, _CharT __c)
>      {
> if (__n == 1)
>   traits_type::assign(*__d, __c);
> else
>   traits_type::assign(__d, __n, __c);
>      }
>
>
>
>      template<class _Iterator>
>        static void
>        _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
>        {
>   for (; __k1 != __k2; ++__k1, ++__p)
>     traits_type::assign(*__p, *__k1);
> }
>
>      static void
>      _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
>      { _S_copy_chars(__p, __k1.base(), __k2.base()); }
>
>      static void
>      _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
>      { _S_copy_chars(__p, __k1.base(), __k2.base()); }
>
>      static void
>      _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)
>      { _M_copy(__p, __k1, __k2 - __k1); }
>
>      static void
>      _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
>      { _M_copy(__p, __k1, __k2 - __k1); }
>
>      void
>      _M_mutate(size_type __pos, size_type __len1, size_type __len2);
>
>      void
>      _M_leak_hard();
>
>      static _Rep&
>      _S_empty_rep()
>      { return _Rep::_S_empty_rep(); }
>
>    public:
>
>
>
>
>
>
>
>      inline
>      basic_string();
>
>
>
>
>      explicit
>      basic_string(const _Alloc& __a);
>
>
>
>
>
>
>      basic_string(const basic_string& __str);
>
>
>
>
>
>
>      basic_string(const basic_string& __str, size_type __pos,
>     size_type __n = npos);
>
>
>
>
>
>
>
>      basic_string(const basic_string& __str, size_type __pos,
>     size_type __n, const _Alloc& __a);
># 448 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string(const _CharT* __s, size_type __n,
>     const _Alloc& __a = _Alloc());
>
>
>
>
>
>      basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());
>
>
>
>
>
>
>      basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());
>
>
>
>
>
>
>
>      template<class _InputIterator>
>        basic_string(_InputIterator __beg, _InputIterator __end,
>       const _Alloc& __a = _Alloc());
>
>
>
>
>      ~basic_string()
>      { _M_rep()->_M_dispose(this->get_allocator()); }
>
>
>
>
>
>      basic_string&
>      operator=(const basic_string& __str)
>      { return this->assign(__str); }
>
>
>
>
>
>      basic_string&
>      operator=(const _CharT* __s)
>      { return this->assign(__s); }
># 503 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      operator=(_CharT __c)
>      {
> this->assign(1, __c);
> return *this;
>      }
>
>
>
>
>
>
>      iterator
>      begin()
>      {
> _M_leak();
> return iterator(_M_data());
>      }
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return const_iterator(_M_data()); }
>
>
>
>
>
>      iterator
>      end()
>      {
> _M_leak();
> return iterator(_M_data() + this->size());
>      }
>
>
>
>
>
>      const_iterator
>      end() const
>      { return const_iterator(_M_data() + this->size()); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return reverse_iterator(this->end()); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return const_reverse_iterator(this->end()); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return reverse_iterator(this->begin()); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return const_reverse_iterator(this->begin()); }
>
>    public:
>
>
>
>      size_type
>      size() const
>      { return _M_rep()->_M_length; }
>
>
>
>      size_type
>      length() const
>      { return _M_rep()->_M_length; }
>
>
>      size_type
>      max_size() const
>      { return _Rep::_S_max_size; }
># 614 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      resize(size_type __n, _CharT __c);
># 627 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      resize(size_type __n)
>      { this->resize(__n, _CharT()); }
>
>
>
>
>
>      size_type
>      capacity() const
>      { return _M_rep()->_M_capacity; }
># 656 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      reserve(size_type __res_arg = 0);
>
>
>
>
>      void
>      clear()
>      { _M_mutate(0, this->size(), 0); }
>
>
>
>
>      bool
>      empty() const
>      { return this->size() == 0; }
># 684 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      const_reference
>      operator[] (size_type __pos) const
>      {
> ;
> return _M_data()[__pos];
>      }
># 701 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      reference
>      operator[](size_type __pos)
>      {
>
> ;
>
> ;
> _M_leak();
> return _M_data()[__pos];
>      }
># 722 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      const_reference
>      at(size_type __n) const
>      {
> if (__n >= this->size())
>   __throw_out_of_range(("basic_string::at"));
> return _M_data()[__n];
>      }
># 741 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      reference
>      at(size_type __n)
>      {
> if (__n >= size())
>   __throw_out_of_range(("basic_string::at"));
> _M_leak();
> return _M_data()[__n];
>      }
>
>
>
>
>
>
>
>      basic_string&
>      operator+=(const basic_string& __str)
>      { return this->append(__str); }
>
>
>
>
>
>
>      basic_string&
>      operator+=(const _CharT* __s)
>      { return this->append(__s); }
>
>
>
>
>
>
>      basic_string&
>      operator+=(_CharT __c)
>      {
> this->push_back(__c);
> return *this;
>      }
>
>
>
>
>
>
>      basic_string&
>      append(const basic_string& __str);
># 801 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      append(const basic_string& __str, size_type __pos, size_type __n);
>
>
>
>
>
>
>
>      basic_string&
>      append(const _CharT* __s, size_type __n);
>
>
>
>
>
>
>      basic_string&
>      append(const _CharT* __s)
>      {
> ;
> return this->append(__s, traits_type::length(__s));
>      }
># 833 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      append(size_type __n, _CharT __c);
># 844 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        basic_string&
>        append(_InputIterator __first, _InputIterator __last)
>        { return this->replace(_M_iend(), _M_iend(), __first, __last); }
>
>
>
>
>
>      void
>      push_back(_CharT __c)
>      {
> const size_type __len = 1 + this->size();
> if (__len > this->capacity() || _M_rep()->_M_is_shared())
>   this->reserve(__len);
> traits_type::assign(_M_data()[this->size()], __c);
> _M_rep()->_M_set_length_and_sharable(__len);
>      }
>
>
>
>
>
>
>      basic_string&
>      assign(const basic_string& __str);
># 883 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const basic_string& __str, size_type __pos, size_type __n)
>      { return this->assign(__str._M_data()
>       + __str._M_check(__pos, "basic_string::assign"),
>       __str._M_limit(__pos, __n)); }
># 899 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s, size_type __n);
># 911 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(const _CharT* __s)
>      {
> ;
> return this->assign(__s, traits_type::length(__s));
>      }
># 927 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      assign(size_type __n, _CharT __c)
>      { return _M_replace_aux(size_type(0), this->size(), __n, __c); }
># 939 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        basic_string&
>        assign(_InputIterator __first, _InputIterator __last)
>        { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
># 956 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      insert(iterator __p, size_type __n, _CharT __c)
>      { this->replace(__p, __p, __n, __c); }
># 971 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        void
>        insert(iterator __p, _InputIterator __beg, _InputIterator __end)
>        { this->replace(__p, __p, __beg, __end); }
># 987 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos1, const basic_string& __str)
>      { return this->insert(__pos1, __str, size_type(0), __str.size()); }
># 1009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos1, const basic_string& __str,
>      size_type __pos2, size_type __n)
>      { return this->insert(__pos1, __str._M_data()
>       + __str._M_check(__pos2, "basic_string::insert"),
>       __str._M_limit(__pos2, __n)); }
># 1032 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s, size_type __n);
># 1050 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, const _CharT* __s)
>      {
> ;
> return this->insert(__pos, __s, traits_type::length(__s));
>      }
># 1073 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      insert(size_type __pos, size_type __n, _CharT __c)
>      { return _M_replace_aux(_M_check(__pos, "basic_string::insert"),
>         size_type(0), __n, __c); }
># 1090 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      iterator
>      insert(iterator __p, _CharT __c)
>      {
> ;
> const size_type __pos = __p - _M_ibegin();
> _M_replace_aux(__pos, size_type(0), size_type(1), __c);
> _M_rep()->_M_set_leaked();
> return this->_M_ibegin() + __pos;
>      }
># 1114 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      erase(size_type __pos = 0, size_type __n = npos)
>      {
> _M_mutate(_M_check(__pos, "basic_string::erase"),
>    _M_limit(__pos, __n), size_type(0));
> return *this;
>      }
># 1130 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      iterator
>      erase(iterator __position)
>      {
> ;
>
> const size_type __pos = __position - _M_ibegin();
> _M_mutate(__pos, size_type(1), size_type(0));
> _M_rep()->_M_set_leaked();
> return _M_ibegin() + __pos;
>      }
># 1150 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      iterator
>      erase(iterator __first, iterator __last)
>      {
> ;
>
>        const size_type __pos = __first - _M_ibegin();
> _M_mutate(__pos, __last - __first, size_type(0));
> _M_rep()->_M_set_leaked();
> return _M_ibegin() + __pos;
>      }
># 1177 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n, const basic_string& __str)
>      { return this->replace(__pos, __n, __str._M_data(), __str.size()); }
># 1199 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos1, size_type __n1, const basic_string& __str,
>       size_type __pos2, size_type __n2)
>      { return this->replace(__pos1, __n1, __str._M_data()
>        + __str._M_check(__pos2, "basic_string::replace"),
>        __str._M_limit(__pos2, __n2)); }
># 1223 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2);
># 1242 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n1, const _CharT* __s)
>      {
> ;
> return this->replace(__pos, __n1, __s, traits_type::length(__s));
>      }
># 1265 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
>      { return _M_replace_aux(_M_check(__pos, "basic_string::replace"),
>         _M_limit(__pos, __n1), __n2, __c); }
># 1283 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(iterator __i1, iterator __i2, const basic_string& __str)
>      { return this->replace(__i1, __i2, __str._M_data(), __str.size()); }
># 1301 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n)
>      {
> ;
>
> return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
>      }
># 1322 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(iterator __i1, iterator __i2, const _CharT* __s)
>      {
> ;
> return this->replace(__i1, __i2, __s, traits_type::length(__s));
>      }
># 1343 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string&
>      replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
>      {
> ;
>
> return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
>      }
># 1365 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      template<class _InputIterator>
>        basic_string&
>        replace(iterator __i1, iterator __i2,
>  _InputIterator __k1, _InputIterator __k2)
>        {
>   ;
>
>   ;
>   typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>   return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
> }
>
>
>
>      basic_string&
>      replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2)
>      {
> ;
>
> ;
> return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
>        __k1, __k2 - __k1);
>      }
>
>      basic_string&
>      replace(iterator __i1, iterator __i2,
>       const _CharT* __k1, const _CharT* __k2)
>      {
> ;
>
> ;
> return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
>        __k1, __k2 - __k1);
>      }
>
>      basic_string&
>      replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
>      {
> ;
>
> ;
> return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
>        __k1.base(), __k2 - __k1);
>      }
>
>      basic_string&
>      replace(iterator __i1, iterator __i2,
>       const_iterator __k1, const_iterator __k2)
>      {
> ;
>
> ;
> return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
>        __k1.base(), __k2 - __k1);
>      }
>
>    private:
>      template<class _Integer>
> basic_string&
> _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
>       _Integer __val, __true_type)
>        { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
>
>      template<class _InputIterator>
> basic_string&
> _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
>       _InputIterator __k2, __false_type);
>
>      basic_string&
>      _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
>       _CharT __c);
>
>      basic_string&
>      _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
>        size_type __n2);
>
>
>
>      template<class _InIterator>
>        static _CharT*
>        _S_construct_aux(_InIterator __beg, _InIterator __end,
>    const _Alloc& __a, __false_type)
> {
>          typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
>          return _S_construct(__beg, __end, __a, _Tag());
> }
>
>      template<class _InIterator>
>        static _CharT*
>        _S_construct_aux(_InIterator __beg, _InIterator __end,
>    const _Alloc& __a, __true_type)
> { return _S_construct(static_cast<size_type>(__beg),
>         static_cast<value_type>(__end), __a); }
>
>      template<class _InIterator>
>        static _CharT*
>        _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)
> {
>   typedef typename std::__is_integer<_InIterator>::__type _Integral;
>   return _S_construct_aux(__beg, __end, __a, _Integral());
>        }
>
>
>      template<class _InIterator>
>        static _CharT*
>         _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
>        input_iterator_tag);
>
>
>
>      template<class _FwdIterator>
>        static _CharT*
>        _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a,
>       forward_iterator_tag);
>
>      static _CharT*
>      _S_construct(size_type __req, _CharT __c, const _Alloc& __a);
>
>    public:
># 1496 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
># 1506 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      void
>      swap(basic_string& __s);
># 1516 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      const _CharT*
>      c_str() const
>      { return _M_data(); }
>
>
>
>
>
>
>
>      const _CharT*
>      data() const
>      { return _M_data(); }
>
>
>
>
>      allocator_type
>      get_allocator() const
>      { return _M_dataplus; }
># 1548 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find(const _CharT* __s, size_type __pos, size_type __n) const;
># 1561 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find(const basic_string& __str, size_type __pos = 0) const
>      { return this->find(__str.data(), __pos, __str.size()); }
># 1575 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find(const _CharT* __s, size_type __pos = 0) const
>      {
> ;
> return this->find(__s, __pos, traits_type::length(__s));
>      }
># 1592 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find(_CharT __c, size_type __pos = 0) const;
># 1605 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      rfind(const basic_string& __str, size_type __pos = npos) const
>      { return this->rfind(__str.data(), __pos, __str.size()); }
># 1620 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      rfind(const _CharT* __s, size_type __pos, size_type __n) const;
># 1633 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      rfind(const _CharT* __s, size_type __pos = npos) const
>      {
> ;
> return this->rfind(__s, __pos, traits_type::length(__s));
>      }
># 1650 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      rfind(_CharT __c, size_type __pos = npos) const;
># 1663 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(const basic_string& __str, size_type __pos = 0) const
>      { return this->find_first_of(__str.data(), __pos, __str.size()); }
># 1678 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1691 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(const _CharT* __s, size_type __pos = 0) const
>      {
> ;
> return this->find_first_of(__s, __pos, traits_type::length(__s));
>      }
># 1710 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_of(_CharT __c, size_type __pos = 0) const
>      { return this->find(__c, __pos); }
># 1724 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(const basic_string& __str, size_type __pos = npos) const
>      { return this->find_last_of(__str.data(), __pos, __str.size()); }
># 1739 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
># 1752 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(const _CharT* __s, size_type __pos = npos) const
>      {
> ;
> return this->find_last_of(__s, __pos, traits_type::length(__s));
>      }
># 1771 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_of(_CharT __c, size_type __pos = npos) const
>      { return this->rfind(__c, __pos); }
># 1785 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(const basic_string& __str, size_type __pos = 0) const
>      { return this->find_first_not_of(__str.data(), __pos, __str.size()); }
># 1800 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(const _CharT* __s, size_type __pos,
>   size_type __n) const;
># 1814 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(const _CharT* __s, size_type __pos = 0) const
>      {
> ;
> return this->find_first_not_of(__s, __pos, traits_type::length(__s));
>      }
># 1831 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_first_not_of(_CharT __c, size_type __pos = 0) const;
># 1844 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(const basic_string& __str, size_type __pos = npos) const
>      { return this->find_last_not_of(__str.data(), __pos, __str.size()); }
># 1860 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(const _CharT* __s, size_type __pos,
>         size_type __n) const;
># 1873 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(const _CharT* __s, size_type __pos = npos) const
>      {
> ;
> return this->find_last_not_of(__s, __pos, traits_type::length(__s));
>      }
># 1890 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      size_type
>      find_last_not_of(_CharT __c, size_type __pos = npos) const;
># 1905 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      basic_string
>      substr(size_type __pos = 0, size_type __n = npos) const
>      { return basic_string(*this,
>       _M_check(__pos, "basic_string::substr"), __n); }
># 1923 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(const basic_string& __str) const
>      {
> const size_type __size = this->size();
> const size_type __osize = __str.size();
> const size_type __len = std::min(__size, __osize);
>
> int __r = traits_type::compare(_M_data(), __str.data(), __len);
> if (!__r)
>   __r = __size - __osize;
> return __r;
>      }
># 1953 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n, const basic_string& __str) const;
># 1977 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos1, size_type __n1, const basic_string& __str,
>       size_type __pos2, size_type __n2) const;
># 1995 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(const _CharT* __s) const;
># 2018 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s) const;
># 2043 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>      int
>      compare(size_type __pos, size_type __n1, const _CharT* __s,
>       size_type __n2) const;
>  };
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_string<_CharT, _Traits, _Alloc>::
>    basic_string()
>
>    : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }
># 2064 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>
>    operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    {
>      basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
>      __str.append(__rhs);
>      return __str;
>    }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT,_Traits,_Alloc>
>    operator+(const _CharT* __lhs,
>       const basic_string<_CharT,_Traits,_Alloc>& __rhs);
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT,_Traits,_Alloc>
>    operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs);
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_string<_CharT, _Traits, _Alloc>
>    operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>      const _CharT* __rhs)
>    {
>      basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
>      __str.append(__rhs);
>      return __str;
>    }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_string<_CharT, _Traits, _Alloc>
>    operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)
>    {
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>      __string_type __str(__lhs);
>      __str.append(__size_type(1), __rhs);
>      return __str;
>    }
># 2135 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __lhs.compare(__rhs) == 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator==(const _CharT* __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) == 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const _CharT* __rhs)
>    { return __lhs.compare(__rhs) == 0; }
># 2172 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) != 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator!=(const _CharT* __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) != 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const _CharT* __rhs)
>    { return __lhs.compare(__rhs) != 0; }
># 2209 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __lhs.compare(__rhs) < 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>       const _CharT* __rhs)
>    { return __lhs.compare(__rhs) < 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator<(const _CharT* __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) > 0; }
># 2246 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __lhs.compare(__rhs) > 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>       const _CharT* __rhs)
>    { return __lhs.compare(__rhs) > 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator>(const _CharT* __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) < 0; }
># 2283 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __lhs.compare(__rhs) <= 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const _CharT* __rhs)
>    { return __lhs.compare(__rhs) <= 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator<=(const _CharT* __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) >= 0; }
># 2320 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __lhs.compare(__rhs) >= 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
>        const _CharT* __rhs)
>    { return __lhs.compare(__rhs) >= 0; }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline bool
>    operator>=(const _CharT* __lhs,
>      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { return __rhs.compare(__lhs) <= 0; }
># 2357 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline void
>    swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,
>  basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    { __lhs.swap(__rhs); }
># 2374 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __is,
>        basic_string<_CharT, _Traits, _Alloc>& __str);
>
>  template<>
>    basic_istream<char>&
>    operator>>(basic_istream<char>& __is, basic_string<char>& __str);
># 2392 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __os,
>        const basic_string<_CharT, _Traits, _Alloc>& __str);
># 2410 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    getline(basic_istream<_CharT, _Traits>& __is,
>     basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim);
># 2427 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.h" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    inline basic_istream<_CharT, _Traits>&
>    getline(basic_istream<_CharT, _Traits>& __is,
>     basic_string<_CharT, _Traits, _Alloc>& __str);
>
>  template<>
>    basic_istream<char>&
>    getline(basic_istream<char>& __in, basic_string<char>& __str,
>     char __delim);
>
>
>  template<>
>    basic_istream<wchar_t>&
>    getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str,
>     wchar_t __delim);
>
>}
># 53 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 3
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 1 3
># 65 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 1 3
># 65 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>namespace std
>{
>
>
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    bool
>    __is_heap(_RandomAccessIterator __first, _Distance __n)
>    {
>      _Distance __parent = 0;
>      for (_Distance __child = 1; __child < __n; ++__child)
> {
>   if (__first[__parent] < __first[__child])
>     return false;
>   if ((__child & 1) == 0)
>     ++__parent;
> }
>      return true;
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance,
>           typename _StrictWeakOrdering>
>    bool
>    __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp,
>       _Distance __n)
>    {
>      _Distance __parent = 0;
>      for (_Distance __child = 1; __child < __n; ++__child)
> {
>   if (__comp(__first[__parent], __first[__child]))
>     return false;
>   if ((__child & 1) == 0)
>     ++__parent;
> }
>      return true;
>    }
>
>  template<typename _RandomAccessIterator>
>    bool
>    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    { return std::__is_heap(__first, std::distance(__first, __last)); }
>
>  template<typename _RandomAccessIterator, typename _StrictWeakOrdering>
>    bool
>    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>     _StrictWeakOrdering __comp)
>    { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
>
>
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
>    void
>    __push_heap(_RandomAccessIterator __first,
>  _Distance __holeIndex, _Distance __topIndex, _Tp __value)
>    {
>      _Distance __parent = (__holeIndex - 1) / 2;
>      while (__holeIndex > __topIndex && *(__first + __parent) < __value)
> {
>   *(__first + __holeIndex) = *(__first + __parent);
>   __holeIndex = __parent;
>   __parent = (__holeIndex - 1) / 2;
> }
>      *(__first + __holeIndex) = __value;
>    }
># 139 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>     
>      ;
>
>
>      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
>         _DistanceType(0), _ValueType(*(__last - 1)));
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Tp,
>     typename _Compare>
>    void
>    __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
>  _Distance __topIndex, _Tp __value, _Compare __comp)
>    {
>      _Distance __parent = (__holeIndex - 1) / 2;
>      while (__holeIndex > __topIndex
>      && __comp(*(__first + __parent), __value))
> {
>   *(__first + __holeIndex) = *(__first + __parent);
>   __holeIndex = __parent;
>   __parent = (__holeIndex - 1) / 2;
> }
>      *(__first + __holeIndex) = __value;
>    }
># 187 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>      ;
>      ;
>
>      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
>         _DistanceType(0), _ValueType(*(__last - 1)), __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
>    void
>    __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
>    _Distance __len, _Tp __value)
>    {
>      const _Distance __topIndex = __holeIndex;
>      _Distance __secondChild = 2 * __holeIndex + 2;
>      while (__secondChild < __len)
> {
>   if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
>     __secondChild--;
>   *(__first + __holeIndex) = *(__first + __secondChild);
>   __holeIndex = __secondChild;
>   __secondChild = 2 * (__secondChild + 1);
> }
>      if (__secondChild == __len)
> {
>   *(__first + __holeIndex) = *(__first + (__secondChild - 1));
>   __holeIndex = __secondChild - 1;
> }
>      std::__push_heap(__first, __holeIndex, __topIndex, __value);
>    }
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    inline void
>    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>        _RandomAccessIterator __result, _Tp __value)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>      *__result = *__first;
>      std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
>    __value);
>    }
># 251 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      std::__pop_heap(__first, __last - 1, __last - 1,
>        _ValueType(*(__last - 1)));
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance,
>    typename _Tp, typename _Compare>
>    void
>    __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
>    _Distance __len, _Tp __value, _Compare __comp)
>    {
>      const _Distance __topIndex = __holeIndex;
>      _Distance __secondChild = 2 * __holeIndex + 2;
>      while (__secondChild < __len)
> {
>   if (__comp(*(__first + __secondChild),
>       *(__first + (__secondChild - 1))))
>     __secondChild--;
>   *(__first + __holeIndex) = *(__first + __secondChild);
>   __holeIndex = __secondChild;
>   __secondChild = 2 * (__secondChild + 1);
> }
>      if (__secondChild == __len)
> {
>   *(__first + __holeIndex) = *(__first + (__secondChild - 1));
>   __holeIndex = __secondChild - 1;
> }
>      std::__push_heap(__first, __holeIndex, __topIndex, __value, __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
>    inline void
>    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>        _RandomAccessIterator __result, _Tp __value, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>      *__result = *__first;
>      std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
>    __value, __comp);
>    }
># 317 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    pop_heap(_RandomAccessIterator __first,
>      _RandomAccessIterator __last, _Compare __comp)
>    {
>
>     
>
>      ;
>      ;
>
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>      std::__pop_heap(__first, __last - 1, __last - 1,
>        _ValueType(*(__last - 1)), __comp);
>    }
># 342 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>     
>      ;
>
>      if (__last - __first < 2)
> return;
>
>      const _DistanceType __len = __last - __first;
>      _DistanceType __parent = (__len - 2) / 2;
>      while (true)
> {
>   std::__adjust_heap(__first, __parent, __len,
>        _ValueType(*(__first + __parent)));
>   if (__parent == 0)
>     return;
>   __parent--;
> }
>    }
># 382 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
>   _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
>   _DistanceType;
>
>
>     
>
>      ;
>
>      if (__last - __first < 2)
> return;
>
>      const _DistanceType __len = __last - __first;
>      _DistanceType __parent = (__len - 2) / 2;
>      while (true)
> {
>   std::__adjust_heap(__first, __parent, __len,
>        _ValueType(*(__first + __parent)), __comp);
>   if (__parent == 0)
>     return;
>   __parent--;
> }
>    }
># 420 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>
>     
>
>     
>
>      ;
>
>
>      while (__last - __first > 1)
> std::pop_heap(__first, __last--);
>    }
># 446 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_heap.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>
>     
>
>      ;
>      ;
>
>      while (__last - __first > 1)
> std::pop_heap(__first, __last--, __comp);
>    }
>
>}
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_tempbuf.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_tempbuf.h" 3
>namespace std
>{
>
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    class _Temporary_buffer
>    {
>
>     
>
> public:
>      typedef _Tp value_type;
>      typedef value_type* pointer;
>      typedef pointer iterator;
>      typedef ptrdiff_t size_type;
>
>    protected:
>      size_type _M_original_len;
>      size_type _M_len;
>      pointer _M_buffer;
>
>      void
>      _M_initialize_buffer(const _Tp&, __true_type) { }
>
>      void
>      _M_initialize_buffer(const _Tp& val, __false_type)
>      { std::uninitialized_fill_n(_M_buffer, _M_len, val); }
>
>    public:
>
>      size_type
>      size() const
>      { return _M_len; }
>
>
>      size_type
>      requested_size() const
>      { return _M_original_len; }
>
>
>      iterator
>      begin()
>      { return _M_buffer; }
>
>
>      iterator
>      end()
>      { return _M_buffer + _M_len; }
>
>
>
>
>
>      _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last);
>
>      ~_Temporary_buffer()
>      {
> std::_Destroy(_M_buffer, _M_buffer + _M_len);
> std::return_temporary_buffer(_M_buffer);
>      }
>
>    private:
>
>      _Temporary_buffer(const _Temporary_buffer&);
>
>      void
>      operator=(const _Temporary_buffer&);
>    };
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    _Temporary_buffer<_ForwardIterator, _Tp>::
>    _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)
>    : _M_original_len(std::distance(__first, __last)),
>      _M_len(0), _M_buffer(0)
>    {
>
>      typedef typename std::__is_scalar<_Tp>::__type _Trivial;
>
>      try
> {
>   pair<pointer, size_type> __p(get_temporary_buffer<
>           value_type>(_M_original_len));
>   _M_buffer = __p.first;
>   _M_len = __p.second;
>   if (_M_len > 0)
>     _M_initialize_buffer(*__first, _Trivial());
> }
>      catch(...)
> {
>   std::return_temporary_buffer(_M_buffer);
>   _M_buffer = 0;
>   _M_len = 0;
>   throw;
> }
>    }
>}
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 2 3
>
>
>
>
>namespace std
>{
># 85 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _Tp>
>    inline const _Tp&
>    __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)
>    {
>
>     
>      if (__a < __b)
> if (__b < __c)
>   return __b;
> else if (__a < __c)
>   return __c;
> else
>   return __a;
>      else if (__a < __c)
> return __a;
>      else if (__b < __c)
> return __c;
>      else
> return __b;
>    }
># 119 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
>    {
>
>     
>      if (__comp(__a, __b))
> if (__comp(__b, __c))
>   return __b;
> else if (__comp(__a, __c))
>   return __c;
> else
>   return __a;
>      else if (__comp(__a, __c))
> return __a;
>      else if (__comp(__b, __c))
> return __c;
>      else
> return __b;
>    }
># 151 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _Function>
>    _Function
>    for_each(_InputIterator __first, _InputIterator __last, _Function __f)
>    {
>
>     
>      ;
>      for ( ; __first != __last; ++__first)
> __f(*__first);
>      return __f;
>    }
>
>
>
>
>
>
>  template<typename _InputIterator, typename _Tp>
>    inline _InputIterator
>    __find(_InputIterator __first, _InputIterator __last,
>    const _Tp& __val, input_iterator_tag)
>    {
>      while (__first != __last && !(*__first == __val))
> ++__first;
>      return __first;
>    }
>
>
>
>
>
>
>  template<typename _InputIterator, typename _Predicate>
>    inline _InputIterator
>    __find_if(_InputIterator __first, _InputIterator __last,
>       _Predicate __pred, input_iterator_tag)
>    {
>      while (__first != __last && !__pred(*__first))
> ++__first;
>      return __first;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    _RandomAccessIterator
>    __find(_RandomAccessIterator __first, _RandomAccessIterator __last,
>    const _Tp& __val, random_access_iterator_tag)
>    {
>      typename iterator_traits<_RandomAccessIterator>::difference_type
> __trip_count = (__last - __first) >> 2;
>
>      for ( ; __trip_count > 0 ; --__trip_count)
> {
>   if (*__first == __val)
>     return __first;
>   ++__first;
>
>   if (*__first == __val)
>     return __first;
>   ++__first;
>
>   if (*__first == __val)
>     return __first;
>   ++__first;
>
>   if (*__first == __val)
>     return __first;
>   ++__first;
> }
>
>      switch (__last - __first)
> {
> case 3:
>   if (*__first == __val)
>     return __first;
>   ++__first;
> case 2:
>   if (*__first == __val)
>     return __first;
>   ++__first;
> case 1:
>   if (*__first == __val)
>     return __first;
>   ++__first;
> case 0:
> default:
>   return __last;
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Predicate>
>    _RandomAccessIterator
>    __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       _Predicate __pred, random_access_iterator_tag)
>    {
>      typename iterator_traits<_RandomAccessIterator>::difference_type
> __trip_count = (__last - __first) >> 2;
>
>      for ( ; __trip_count > 0 ; --__trip_count)
> {
>   if (__pred(*__first))
>     return __first;
>   ++__first;
>
>   if (__pred(*__first))
>     return __first;
>   ++__first;
>
>   if (__pred(*__first))
>     return __first;
>   ++__first;
>
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> }
>
>      switch (__last - __first)
> {
> case 3:
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> case 2:
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> case 1:
>   if (__pred(*__first))
>     return __first;
>   ++__first;
> case 0:
> default:
>   return __last;
> }
>    }
># 305 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _Tp>
>    inline _InputIterator
>    find(_InputIterator __first, _InputIterator __last,
>  const _Tp& __val)
>    {
>
>     
>     
>
>      ;
>      return std::__find(__first, __last, __val,
>           std::__iterator_category(__first));
>    }
># 327 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _Predicate>
>    inline _InputIterator
>    find_if(_InputIterator __first, _InputIterator __last,
>     _Predicate __pred)
>    {
>
>     
>     
>
>      ;
>      return std::__find_if(__first, __last, __pred,
>       std::__iterator_category(__first));
>    }
># 349 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator>
>    _ForwardIterator
>    adjacent_find(_ForwardIterator __first, _ForwardIterator __last)
>    {
>
>     
>     
>
>      ;
>      if (__first == __last)
> return __last;
>      _ForwardIterator __next = __first;
>      while(++__next != __last)
> {
>   if (*__first == *__next)
>     return __first;
>   __first = __next;
> }
>      return __last;
>    }
># 380 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _BinaryPredicate>
>    _ForwardIterator
>    adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
>    _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>
>
>      ;
>      if (__first == __last)
> return __last;
>      _ForwardIterator __next = __first;
>      while(++__next != __last)
> {
>   if (__binary_pred(*__first, *__next))
>     return __first;
>   __first = __next;
> }
>      return __last;
>    }
># 411 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _Tp>
>    typename iterator_traits<_InputIterator>::difference_type
>    count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
>    {
>
>     
>     
>
>      ;
>      typename iterator_traits<_InputIterator>::difference_type __n = 0;
>      for ( ; __first != __last; ++__first)
> if (*__first == __value)
>   ++__n;
>      return __n;
>    }
># 435 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _Predicate>
>    typename iterator_traits<_InputIterator>::difference_type
>    count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
>    {
>
>     
>     
>
>      ;
>      typename iterator_traits<_InputIterator>::difference_type __n = 0;
>      for ( ; __first != __last; ++__first)
> if (__pred(*__first))
>   ++__n;
>      return __n;
>    }
># 474 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    _ForwardIterator1
>    search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>    _ForwardIterator2 __first2, _ForwardIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>      if (__first1 == __last1 || __first2 == __last2)
> return __first1;
>
>
>      _ForwardIterator2 __tmp(__first2);
>      ++__tmp;
>      if (__tmp == __last2)
> return std::find(__first1, __last1, *__first2);
>
>
>      _ForwardIterator2 __p1, __p;
>      __p1 = __first2; ++__p1;
>      _ForwardIterator1 __current = __first1;
>
>      while (__first1 != __last1)
> {
>   __first1 = std::find(__first1, __last1, *__first2);
>   if (__first1 == __last1)
>     return __last1;
>
>   __p = __p1;
>   __current = __first1;
>   if (++__current == __last1)
>     return __last1;
>
>   while (*__current == *__p)
>     {
>       if (++__p == __last2)
>  return __first1;
>       if (++__current == __last1)
>  return __last1;
>     }
>   ++__first1;
> }
>      return __first1;
>    }
># 545 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2,
>    typename _BinaryPredicate>
>    _ForwardIterator1
>    search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>    _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>    _BinaryPredicate __predicate)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>
>      if (__first1 == __last1 || __first2 == __last2)
> return __first1;
>
>
>      _ForwardIterator2 __tmp(__first2);
>      ++__tmp;
>      if (__tmp == __last2)
> {
>   while (__first1 != __last1 && !__predicate(*__first1, *__first2))
>     ++__first1;
>   return __first1;
> }
>
>
>      _ForwardIterator2 __p1, __p;
>      __p1 = __first2; ++__p1;
>      _ForwardIterator1 __current = __first1;
>
>      while (__first1 != __last1)
> {
>   while (__first1 != __last1)
>     {
>       if (__predicate(*__first1, *__first2))
>  break;
>       ++__first1;
>     }
>   while (__first1 != __last1 && !__predicate(*__first1, *__first2))
>     ++__first1;
>   if (__first1 == __last1)
>     return __last1;
>
>   __p = __p1;
>   __current = __first1;
>   if (++__current == __last1)
>     return __last1;
>
>   while (__predicate(*__current, *__p))
>     {
>       if (++__p == __last2)
>  return __first1;
>       if (++__current == __last1)
>  return __last1;
>     }
>   ++__first1;
> }
>      return __first1;
>    }
># 617 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp>
>    _ForwardIterator
>    __search_n(_ForwardIterator __first, _ForwardIterator __last,
>        _Integer __count, const _Tp& __val,
>        std::forward_iterator_tag)
>    {
>      __first = std::find(__first, __last, __val);
>      while (__first != __last)
> {
>   typename iterator_traits<_ForwardIterator>::difference_type
>     __n = __count;
>   _ForwardIterator __i = __first;
>   ++__i;
>   while (__i != __last && __n != 1 && *__i == __val)
>     {
>       ++__i;
>       --__n;
>     }
>   if (__n == 1)
>     return __first;
>   if (__i == __last)
>     return __last;
>   __first = std::find(++__i, __last, __val);
> }
>      return __last;
>    }
># 651 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIter, typename _Integer, typename _Tp>
>    _RandomAccessIter
>    __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
>        _Integer __count, const _Tp& __val,
>        std::random_access_iterator_tag)
>    {
>
>      typedef typename std::iterator_traits<_RandomAccessIter>::difference_type
> _DistanceType;
>
>      _DistanceType __tailSize = __last - __first;
>      const _DistanceType __pattSize = __count;
>
>      if (__tailSize < __pattSize)
>        return __last;
>
>      const _DistanceType __skipOffset = __pattSize - 1;
>      _RandomAccessIter __lookAhead = __first + __skipOffset;
>      __tailSize -= __pattSize;
>
>      while (1)
> {
>
>
>   while (!(*__lookAhead == __val))
>     {
>       if (__tailSize < __pattSize)
>  return __last;
>       __lookAhead += __pattSize;
>       __tailSize -= __pattSize;
>     }
>   _DistanceType __remainder = __skipOffset;
>   for (_RandomAccessIter __backTrack = __lookAhead - 1;
>        *__backTrack == __val; --__backTrack)
>     {
>       if (--__remainder == 0)
>  return (__lookAhead - __skipOffset);
>     }
>   if (__remainder > __tailSize)
>     return __last;
>   __lookAhead += __remainder;
>   __tailSize -= __remainder;
> }
>    }
># 709 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp>
>    _ForwardIterator
>    search_n(_ForwardIterator __first, _ForwardIterator __last,
>      _Integer __count, const _Tp& __val)
>    {
>
>     
>     
>
>      ;
>
>      if (__count <= 0)
> return __first;
>      if (__count == 1)
> return std::find(__first, __last, __val);
>      return std::__search_n(__first, __last, __count, __val,
>        std::__iterator_category(__first));
>    }
># 736 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp,
>           typename _BinaryPredicate>
>    _ForwardIterator
>    __search_n(_ForwardIterator __first, _ForwardIterator __last,
>        _Integer __count, const _Tp& __val,
>        _BinaryPredicate __binary_pred, std::forward_iterator_tag)
>    {
>      while (__first != __last && !__binary_pred(*__first, __val))
>        ++__first;
>
>      while (__first != __last)
> {
>   typename iterator_traits<_ForwardIterator>::difference_type
>     __n = __count;
>   _ForwardIterator __i = __first;
>   ++__i;
>   while (__i != __last && __n != 1 && __binary_pred(*__i, __val))
>     {
>       ++__i;
>       --__n;
>     }
>   if (__n == 1)
>     return __first;
>   if (__i == __last)
>     return __last;
>   __first = ++__i;
>   while (__first != __last && !__binary_pred(*__first, __val))
>     ++__first;
> }
>      return __last;
>    }
># 776 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIter, typename _Integer, typename _Tp,
>    typename _BinaryPredicate>
>    _RandomAccessIter
>    __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
>        _Integer __count, const _Tp& __val,
>        _BinaryPredicate __binary_pred, std::random_access_iterator_tag)
>    {
>
>      typedef typename std::iterator_traits<_RandomAccessIter>::difference_type
> _DistanceType;
>
>      _DistanceType __tailSize = __last - __first;
>      const _DistanceType __pattSize = __count;
>
>      if (__tailSize < __pattSize)
>        return __last;
>
>      const _DistanceType __skipOffset = __pattSize - 1;
>      _RandomAccessIter __lookAhead = __first + __skipOffset;
>      __tailSize -= __pattSize;
>
>      while (1)
> {
>
>
>   while (!__binary_pred(*__lookAhead, __val))
>     {
>       if (__tailSize < __pattSize)
>  return __last;
>       __lookAhead += __pattSize;
>       __tailSize -= __pattSize;
>     }
>   _DistanceType __remainder = __skipOffset;
>   for (_RandomAccessIter __backTrack = __lookAhead - 1;
>        __binary_pred(*__backTrack, __val); --__backTrack)
>     {
>       if (--__remainder == 0)
>  return (__lookAhead - __skipOffset);
>     }
>   if (__remainder > __tailSize)
>     return __last;
>   __lookAhead += __remainder;
>   __tailSize -= __remainder;
> }
>    }
># 837 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Integer, typename _Tp,
>           typename _BinaryPredicate>
>    _ForwardIterator
>    search_n(_ForwardIterator __first, _ForwardIterator __last,
>      _Integer __count, const _Tp& __val,
>      _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>
>      ;
>
>      if (__count <= 0)
> return __first;
>      if (__count == 1)
> {
>   while (__first != __last && !__binary_pred(*__first, __val))
>     ++__first;
>   return __first;
> }
>      return std::__search_n(__first, __last, __count, __val, __binary_pred,
>        std::__iterator_category(__first));
>    }
># 873 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    _ForwardIterator2
>    swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>  _ForwardIterator2 __first2)
>    {
>
>     
>
>     
>
>     
>
>
>     
>
>
>      ;
>
>      for ( ; __first1 != __last1; ++__first1, ++__first2)
> std::iter_swap(__first1, __first2);
>      return __first2;
>    }
># 911 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _UnaryOperation>
>    _OutputIterator
>    transform(_InputIterator __first, _InputIterator __last,
>       _OutputIterator __result, _UnaryOperation __unary_op)
>    {
>
>     
>     
>
>
>      ;
>
>      for ( ; __first != __last; ++__first, ++__result)
> *__result = __unary_op(*__first);
>      return __result;
>    }
># 946 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _BinaryOperation>
>    _OutputIterator
>    transform(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _OutputIterator __result,
>       _BinaryOperation __binary_op)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      for ( ; __first1 != __last1; ++__first1, ++__first2, ++__result)
> *__result = __binary_op(*__first1, *__first2);
>      return __result;
>    }
># 978 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    replace(_ForwardIterator __first, _ForwardIterator __last,
>     const _Tp& __old_value, const _Tp& __new_value)
>    {
>
>     
>
>     
>
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first)
> if (*__first == __old_value)
>   *__first = __new_value;
>    }
># 1009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Predicate, typename _Tp>
>    void
>    replace_if(_ForwardIterator __first, _ForwardIterator __last,
>        _Predicate __pred, const _Tp& __new_value)
>    {
>
>     
>
>     
>
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first)
> if (__pred(*__first))
>   *__first = __new_value;
>    }
># 1042 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator, typename _Tp>
>    _OutputIterator
>    replace_copy(_InputIterator __first, _InputIterator __last,
>   _OutputIterator __result,
>   const _Tp& __old_value, const _Tp& __new_value)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first, ++__result)
> if (*__first == __old_value)
>   *__result = __new_value;
> else
>   *__result = *__first;
>      return __result;
>    }
># 1078 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _Predicate, typename _Tp>
>    _OutputIterator
>    replace_copy_if(_InputIterator __first, _InputIterator __last,
>      _OutputIterator __result,
>      _Predicate __pred, const _Tp& __new_value)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first, ++__result)
> if (__pred(*__first))
>   *__result = __new_value;
> else
>   *__result = *__first;
>      return __result;
>    }
># 1112 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Generator>
>    void
>    generate(_ForwardIterator __first, _ForwardIterator __last,
>      _Generator __gen)
>    {
>
>     
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first)
> *__first = __gen();
>    }
># 1138 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _OutputIterator, typename _Size, typename _Generator>
>    _OutputIterator
>    generate_n(_OutputIterator __first, _Size __n, _Generator __gen)
>    {
>
>     
>
>
>
>      for ( ; __n > 0; --__n, ++__first)
> *__first = __gen();
>      return __first;
>    }
># 1165 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator, typename _Tp>
>    _OutputIterator
>    remove_copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result, const _Tp& __value)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first)
> if (!(*__first == __value))
>   {
>     *__result = *__first;
>     ++__result;
>   }
>      return __result;
>    }
># 1201 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _Predicate>
>    _OutputIterator
>    remove_copy_if(_InputIterator __first, _InputIterator __last,
>     _OutputIterator __result, _Predicate __pred)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      for ( ; __first != __last; ++__first)
> if (!__pred(*__first))
>   {
>     *__result = *__first;
>     ++__result;
>   }
>      return __result;
>    }
># 1240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    _ForwardIterator
>    remove(_ForwardIterator __first, _ForwardIterator __last,
>    const _Tp& __value)
>    {
>
>     
>
>     
>
>      ;
>
>      __first = std::find(__first, __last, __value);
>      _ForwardIterator __i = __first;
>      return __first == __last ? __first
>          : std::remove_copy(++__i, __last,
>        __first, __value);
>    }
># 1275 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Predicate>
>    _ForwardIterator
>    remove_if(_ForwardIterator __first, _ForwardIterator __last,
>       _Predicate __pred)
>    {
>
>     
>
>     
>
>      ;
>
>      __first = std::find_if(__first, __last, __pred);
>      _ForwardIterator __i = __first;
>      return __first == __last ? __first
>          : std::remove_copy_if(++__i, __last,
>           __first, __pred);
>    }
># 1301 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    _OutputIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _OutputIterator __result,
>    output_iterator_tag)
>    {
>
>      typename iterator_traits<_InputIterator>::value_type __value = *__first;
>      *__result = __value;
>      while (++__first != __last)
> if (!(__value == *__first))
>   {
>     __value = *__first;
>     *++__result = __value;
>   }
>      return ++__result;
>    }
># 1326 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    _ForwardIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _ForwardIterator __result,
>    forward_iterator_tag)
>    {
>
>      *__result = *__first;
>      while (++__first != __last)
> if (!(*__result == *__first))
>   *++__result = *__first;
>      return ++__result;
>    }
># 1348 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _BinaryPredicate>
>    _OutputIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _OutputIterator __result,
>    _BinaryPredicate __binary_pred,
>    output_iterator_tag)
>    {
>
>     
>
>
>
>      typename iterator_traits<_InputIterator>::value_type __value = *__first;
>      *__result = __value;
>      while (++__first != __last)
> if (!__binary_pred(__value, *__first))
>   {
>     __value = *__first;
>     *++__result = __value;
>   }
>      return ++__result;
>    }
># 1380 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _BinaryPredicate>
>    _ForwardIterator
>    __unique_copy(_InputIterator __first, _InputIterator __last,
>    _ForwardIterator __result,
>    _BinaryPredicate __binary_pred,
>    forward_iterator_tag)
>    {
>
>     
>
>
>
>      *__result = *__first;
>      while (++__first != __last)
> if (!__binary_pred(*__result, *__first)) *++__result = *__first;
>      return ++__result;
>    }
># 1412 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    inline _OutputIterator
>    unique_copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      typedef typename iterator_traits<_OutputIterator>::iterator_category
> _IterType;
>
>      if (__first == __last) return __result;
>      return std::__unique_copy(__first, __last, __result, _IterType());
>    }
># 1447 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _OutputIterator,
>    typename _BinaryPredicate>
>    inline _OutputIterator
>    unique_copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result,
>  _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>
>      ;
>
>      typedef typename iterator_traits<_OutputIterator>::iterator_category
> _IterType;
>
>      if (__first == __last) return __result;
>      return std::__unique_copy(__first, __last, __result,
>    __binary_pred, _IterType());
>    }
># 1481 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator>
>    _ForwardIterator
>    unique(_ForwardIterator __first, _ForwardIterator __last)
>    {
>
>     
>
>     
>
>      ;
>
>
>      __first = std::adjacent_find(__first, __last);
>      if (__first == __last)
> return __last;
>
>
>      _ForwardIterator __dest = __first;
>      ++__first;
>      while (++__first != __last)
> if (!(*__dest == *__first))
>   *++__dest = *__first;
>      return ++__dest;
>    }
># 1520 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _BinaryPredicate>
>    _ForwardIterator
>    unique(_ForwardIterator __first, _ForwardIterator __last,
>           _BinaryPredicate __binary_pred)
>    {
>
>     
>
>     
>
>
>      ;
>
>
>      __first = std::adjacent_find(__first, __last, __binary_pred);
>      if (__first == __last)
> return __last;
>
>
>      _ForwardIterator __dest = __first;
>      ++__first;
>      while (++__first != __last)
> if (!__binary_pred(*__dest, *__first))
>   *++__dest = *__first;
>      return ++__dest;
>    }
># 1554 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    void
>    __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,
>       bidirectional_iterator_tag)
>    {
>      while (true)
> if (__first == __last || __first == --__last)
>   return;
> else
>   {
>     std::iter_swap(__first, __last);
>     ++__first;
>   }
>    }
># 1576 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,
>       random_access_iterator_tag)
>    {
>      if (__first == __last)
> return;
>      --__last;
>      while (__first < __last)
> {
>   std::iter_swap(__first, __last);
>   ++__first;
>   --__last;
> }
>    }
># 1603 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    inline void
>    reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
>    {
>
>     
>
>      ;
>      std::__reverse(__first, __last, std::__iterator_category(__first));
>    }
># 1629 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _OutputIterator>
>    _OutputIterator
>    reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,
>        _OutputIterator __result)
>    {
>
>     
>
>     
>
>      ;
>
>      while (__first != __last)
> {
>   --__last;
>   *__result = *__last;
>   ++__result;
> }
>      return __result;
>    }
># 1657 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _EuclideanRingElement>
>    _EuclideanRingElement
>    __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
>    {
>      while (__n != 0)
> {
>   _EuclideanRingElement __t = __m % __n;
>   __m = __n;
>   __n = __t;
> }
>      return __m;
>    }
>
>
>
>
>
>
>  template<typename _ForwardIterator>
>    void
>    __rotate(_ForwardIterator __first,
>      _ForwardIterator __middle,
>      _ForwardIterator __last,
>      forward_iterator_tag)
>    {
>      if (__first == __middle || __last == __middle)
> return;
>
>      _ForwardIterator __first2 = __middle;
>      do
> {
>   swap(*__first, *__first2);
>   ++__first;
>   ++__first2;
>   if (__first == __middle)
>     __middle = __first2;
> }
>      while (__first2 != __last);
>
>      __first2 = __middle;
>
>      while (__first2 != __last)
> {
>   swap(*__first, *__first2);
>   ++__first;
>   ++__first2;
>   if (__first == __middle)
>     __middle = __first2;
>   else if (__first2 == __last)
>     __first2 = __middle;
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator>
>    void
>    __rotate(_BidirectionalIterator __first,
>      _BidirectionalIterator __middle,
>      _BidirectionalIterator __last,
>       bidirectional_iterator_tag)
>    {
>
>     
>
>
>      if (__first == __middle || __last == __middle)
> return;
>
>      std::__reverse(__first, __middle, bidirectional_iterator_tag());
>      std::__reverse(__middle, __last, bidirectional_iterator_tag());
>
>      while (__first != __middle && __middle != __last)
> {
>   swap(*__first, *--__last);
>   ++__first;
> }
>
>      if (__first == __middle)
> std::__reverse(__middle, __last, bidirectional_iterator_tag());
>      else
> std::__reverse(__first, __middle, bidirectional_iterator_tag());
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __rotate(_RandomAccessIterator __first,
>      _RandomAccessIterator __middle,
>      _RandomAccessIterator __last,
>      random_access_iterator_tag)
>    {
>
>     
>
>
>      if (__first == __middle || __last == __middle)
> return;
>
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      const _Distance __n = __last - __first;
>      const _Distance __k = __middle - __first;
>      const _Distance __l = __n - __k;
>
>      if (__k == __l)
> {
>   std::swap_ranges(__first, __middle, __middle);
>   return;
> }
>
>      const _Distance __d = __gcd(__n, __k);
>
>      for (_Distance __i = 0; __i < __d; __i++)
> {
>   _ValueType __tmp = *__first;
>   _RandomAccessIterator __p = __first;
>
>   if (__k < __l)
>     {
>       for (_Distance __j = 0; __j < __l / __d; __j++)
>  {
>    if (__p > __first + __l)
>      {
>        *__p = *(__p - __l);
>        __p -= __l;
>      }
>
>    *__p = *(__p + __k);
>    __p += __k;
>  }
>     }
>   else
>     {
>       for (_Distance __j = 0; __j < __k / __d - 1; __j ++)
>  {
>    if (__p < __last - __k)
>      {
>        *__p = *(__p + __k);
>        __p += __k;
>      }
>    *__p = * (__p - __l);
>    __p -= __l;
>  }
>     }
>
>   *__p = __tmp;
>   ++__first;
> }
>    }
># 1836 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    rotate(_ForwardIterator __first, _ForwardIterator __middle,
>    _ForwardIterator __last)
>    {
>
>     
>
>      ;
>      ;
>
>      typedef typename iterator_traits<_ForwardIterator>::iterator_category
> _IterType;
>      std::__rotate(__first, __middle, __last, _IterType());
>    }
># 1869 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _OutputIterator>
>    _OutputIterator
>    rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
>                _ForwardIterator __last, _OutputIterator __result)
>    {
>
>     
>     
>
>      ;
>      ;
>
>      return std::copy(__first, __middle,
>                       std::copy(__middle, __last, __result));
>    }
># 1895 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>
>     
>
>      ;
>
>      if (__first != __last)
> for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
>   std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1)));
>    }
># 1922 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _RandomNumberGenerator>
>    void
>    random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
>     _RandomNumberGenerator& __rand)
>    {
>
>     
>
>      ;
>
>      if (__first == __last)
> return;
>      for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
> std::iter_swap(__i, __first + __rand((__i - __first) + 1));
>    }
>
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _Predicate>
>    _ForwardIterator
>    __partition(_ForwardIterator __first, _ForwardIterator __last,
>  _Predicate __pred,
>  forward_iterator_tag)
>    {
>      if (__first == __last)
> return __first;
>
>      while (__pred(*__first))
> if (++__first == __last)
>   return __first;
>
>      _ForwardIterator __next = __first;
>
>      while (++__next != __last)
> if (__pred(*__next))
>   {
>     swap(*__first, *__next);
>     ++__first;
>   }
>
>      return __first;
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator, typename _Predicate>
>    _BidirectionalIterator
>    __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,
>  _Predicate __pred,
>  bidirectional_iterator_tag)
>    {
>      while (true)
> {
>   while (true)
>     if (__first == __last)
>       return __first;
>     else if (__pred(*__first))
>       ++__first;
>     else
>       break;
>   --__last;
>   while (true)
>     if (__first == __last)
>       return __first;
>     else if (!__pred(*__last))
>       --__last;
>     else
>       break;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
># 2016 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Predicate>
>    inline _ForwardIterator
>    partition(_ForwardIterator __first, _ForwardIterator __last,
>       _Predicate __pred)
>    {
>
>     
>
>     
>
>      ;
>
>      return std::__partition(__first, __last, __pred,
>         std::__iterator_category(__first));
>    }
>
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _Predicate, typename _Distance>
>    _ForwardIterator
>    __inplace_stable_partition(_ForwardIterator __first,
>          _ForwardIterator __last,
>          _Predicate __pred, _Distance __len)
>    {
>      if (__len == 1)
> return __pred(*__first) ? __last : __first;
>      _ForwardIterator __middle = __first;
>      std::advance(__middle, __len / 2);
>      _ForwardIterator __begin = std::__inplace_stable_partition(__first,
>         __middle,
>         __pred,
>         __len / 2);
>      _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last,
>              __pred,
>              __len
>              - __len / 2);
>      std::rotate(__begin, __middle, __end);
>      std::advance(__begin, std::distance(__middle, __end));
>      return __begin;
>    }
>
>
>
>
>
>
>  template<typename _ForwardIterator, typename _Pointer, typename _Predicate,
>    typename _Distance>
>    _ForwardIterator
>    __stable_partition_adaptive(_ForwardIterator __first,
>    _ForwardIterator __last,
>    _Predicate __pred, _Distance __len,
>    _Pointer __buffer,
>    _Distance __buffer_size)
>    {
>      if (__len <= __buffer_size)
> {
>   _ForwardIterator __result1 = __first;
>   _Pointer __result2 = __buffer;
>   for ( ; __first != __last ; ++__first)
>     if (__pred(*__first))
>       {
>  *__result1 = *__first;
>  ++__result1;
>       }
>     else
>       {
>  *__result2 = *__first;
>  ++__result2;
>       }
>   std::copy(__buffer, __result2, __result1);
>   return __result1;
> }
>      else
> {
>   _ForwardIterator __middle = __first;
>   std::advance(__middle, __len / 2);
>   _ForwardIterator __begin =
>     std::__stable_partition_adaptive(__first, __middle, __pred,
>          __len / 2, __buffer,
>          __buffer_size);
>   _ForwardIterator __end =
>     std::__stable_partition_adaptive(__middle, __last, __pred,
>          __len - __len / 2,
>          __buffer, __buffer_size);
>   std::rotate(__begin, __middle, __end);
>   std::advance(__begin, std::distance(__middle, __end));
>   return __begin;
> }
>    }
># 2127 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Predicate>
>    _ForwardIterator
>    stable_partition(_ForwardIterator __first, _ForwardIterator __last,
>       _Predicate __pred)
>    {
>
>     
>
>     
>
>      ;
>
>      if (__first == __last)
> return __first;
>      else
> {
>   typedef typename iterator_traits<_ForwardIterator>::value_type
>     _ValueType;
>   typedef typename iterator_traits<_ForwardIterator>::difference_type
>     _DistanceType;
>
>   _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first,
>        __last);
> if (__buf.size() > 0)
>   return
>     std::__stable_partition_adaptive(__first, __last, __pred,
>       _DistanceType(__buf.requested_size()),
>       __buf.begin(), __buf.size());
> else
>   return
>     std::__inplace_stable_partition(__first, __last, __pred,
>      _DistanceType(__buf.requested_size()));
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    _RandomAccessIterator
>    __unguarded_partition(_RandomAccessIterator __first,
>     _RandomAccessIterator __last, _Tp __pivot)
>    {
>      while (true)
> {
>   while (*__first < __pivot)
>     ++__first;
>   --__last;
>   while (__pivot < *__last)
>     --__last;
>   if (!(__first < __last))
>     return __first;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
>    _RandomAccessIterator
>    __unguarded_partition(_RandomAccessIterator __first,
>     _RandomAccessIterator __last,
>     _Tp __pivot, _Compare __comp)
>    {
>      while (true)
> {
>   while (__comp(*__first, __pivot))
>     ++__first;
>   --__last;
>   while (__comp(__pivot, *__last))
>     --__last;
>   if (!(__first < __last))
>     return __first;
>   std::iter_swap(__first, __last);
>   ++__first;
> }
>    }
>
>
>
>
>
>
>
>  enum { _S_threshold = 16 };
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp>
>    void
>    __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)
>    {
>      _RandomAccessIterator __next = __last;
>      --__next;
>      while (__val < *__next)
> {
>   *__last = *__next;
>   __last = __next;
>   --__next;
> }
>      *__last = __val;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
>    void
>    __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,
>         _Compare __comp)
>    {
>      _RandomAccessIterator __next = __last;
>      --__next;
>      while (__comp(__val, *__next))
> {
>   *__last = *__next;
>   __last = __next;
>   --__next;
> }
>      *__last = __val;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __insertion_sort(_RandomAccessIterator __first,
>       _RandomAccessIterator __last)
>    {
>      if (__first == __last)
> return;
>
>      for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
> {
>   typename iterator_traits<_RandomAccessIterator>::value_type
>     __val = *__i;
>   if (__val < *__first)
>     {
>       std::copy_backward(__first, __i, __i + 1);
>       *__first = __val;
>     }
>   else
>     std::__unguarded_linear_insert(__i, __val);
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __insertion_sort(_RandomAccessIterator __first,
>       _RandomAccessIterator __last, _Compare __comp)
>    {
>      if (__first == __last) return;
>
>      for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
> {
>   typename iterator_traits<_RandomAccessIterator>::value_type
>     __val = *__i;
>   if (__comp(__val, *__first))
>     {
>       std::copy_backward(__first, __i, __i + 1);
>       *__first = __val;
>     }
>   else
>     std::__unguarded_linear_insert(__i, __val, __comp);
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator>
>    inline void
>    __unguarded_insertion_sort(_RandomAccessIterator __first,
>          _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
> std::__unguarded_linear_insert(__i, _ValueType(*__i));
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    __unguarded_insertion_sort(_RandomAccessIterator __first,
>          _RandomAccessIterator __last, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
> std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp);
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __final_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last)
>    {
>      if (__last - __first > int(_S_threshold))
> {
>   std::__insertion_sort(__first, __first + int(_S_threshold));
>   std::__unguarded_insertion_sort(__first + int(_S_threshold), __last);
> }
>      else
> std::__insertion_sort(__first, __last);
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __final_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last, _Compare __comp)
>    {
>      if (__last - __first > int(_S_threshold))
> {
>   std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
>   std::__unguarded_insertion_sort(__first + int(_S_threshold), __last,
>       __comp);
> }
>      else
> std::__insertion_sort(__first, __last, __comp);
>    }
>
>
>
>
>
>
>  template<typename _Size>
>    inline _Size
>    __lg(_Size __n)
>    {
>      _Size __k;
>      for (__k = 0; __n != 1; __n >>= 1)
> ++__k;
>      return __k;
>    }
># 2416 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    partial_sort(_RandomAccessIterator __first,
>   _RandomAccessIterator __middle,
>   _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      std::make_heap(__first, __middle);
>      for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
> if (*__i < *__first)
>   std::__pop_heap(__first, __middle, __i, _ValueType(*__i));
>      std::sort_heap(__first, __middle);
>    }
># 2457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    partial_sort(_RandomAccessIterator __first,
>   _RandomAccessIterator __middle,
>   _RandomAccessIterator __last,
>   _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      std::make_heap(__first, __middle, __comp);
>      for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
> if (__comp(*__i, *__first))
>   std::__pop_heap(__first, __middle, __i, _ValueType(*__i), __comp);
>      std::sort_heap(__first, __middle, __comp);
>    }
># 2499 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _RandomAccessIterator>
>    _RandomAccessIterator
>    partial_sort_copy(_InputIterator __first, _InputIterator __last,
>        _RandomAccessIterator __result_first,
>        _RandomAccessIterator __result_last)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _InputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _OutputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>     
>      ;
>      ;
>
>      if (__result_first == __result_last)
> return __result_last;
>      _RandomAccessIterator __result_real_last = __result_first;
>      while(__first != __last && __result_real_last != __result_last)
> {
>   *__result_real_last = *__first;
>   ++__result_real_last;
>   ++__first;
> }
>      std::make_heap(__result_first, __result_real_last);
>      while (__first != __last)
> {
>   if (*__first < *__result_first)
>     std::__adjust_heap(__result_first, _DistanceType(0),
>          _DistanceType(__result_real_last
>          - __result_first),
>          _InputValueType(*__first));
>   ++__first;
> }
>      std::sort_heap(__result_first, __result_real_last);
>      return __result_real_last;
>    }
># 2563 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare>
>    _RandomAccessIterator
>    partial_sort_copy(_InputIterator __first, _InputIterator __last,
>        _RandomAccessIterator __result_first,
>        _RandomAccessIterator __result_last,
>        _Compare __comp)
>    {
>      typedef typename iterator_traits<_InputIterator>::value_type
> _InputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _OutputValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>
>     
>
>      ;
>      ;
>
>      if (__result_first == __result_last)
> return __result_last;
>      _RandomAccessIterator __result_real_last = __result_first;
>      while(__first != __last && __result_real_last != __result_last)
> {
>   *__result_real_last = *__first;
>   ++__result_real_last;
>   ++__first;
> }
>      std::make_heap(__result_first, __result_real_last, __comp);
>      while (__first != __last)
> {
>   if (__comp(*__first, *__result_first))
>     std::__adjust_heap(__result_first, _DistanceType(0),
>          _DistanceType(__result_real_last
>          - __result_first),
>          _InputValueType(*__first),
>          __comp);
>   ++__first;
> }
>      std::sort_heap(__result_first, __result_real_last, __comp);
>      return __result_real_last;
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Size>
>    void
>    __introsort_loop(_RandomAccessIterator __first,
>       _RandomAccessIterator __last,
>       _Size __depth_limit)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      while (__last - __first > int(_S_threshold))
> {
>   if (__depth_limit == 0)
>     {
>       std::partial_sort(__first, __last, __last);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last
>          - 1))));
>   std::__introsort_loop(__cut, __last, __depth_limit);
>   __last = __cut;
> }
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Size, typename _Compare>
>    void
>    __introsort_loop(_RandomAccessIterator __first,
>       _RandomAccessIterator __last,
>       _Size __depth_limit, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>      while (__last - __first > int(_S_threshold))
> {
>   if (__depth_limit == 0)
>     {
>       std::partial_sort(__first, __last, __last, __comp);
>       return;
>     }
>   --__depth_limit;
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last - 1),
>        __comp)),
>           __comp);
>   std::__introsort_loop(__cut, __last, __depth_limit, __comp);
>   __last = __cut;
> }
>    }
># 2698 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>
>      if (__first != __last)
> {
>   std::__introsort_loop(__first, __last, __lg(__last - __first) * 2);
>   std::__final_insertion_sort(__first, __last);
> }
>    }
># 2732 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
>  _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>
>      if (__first != __last)
> {
>   std::__introsort_loop(__first, __last, __lg(__last - __first) * 2,
>    __comp);
>   std::__final_insertion_sort(__first, __last, __comp);
> }
>    }
># 2765 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    _ForwardIterator
>    lower_bound(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>
>
>
>
>     
>     
>     
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (*__middle < __val)
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else
>     __len = __half;
> }
>      return __first;
>    }
># 2820 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    _ForwardIterator
>    lower_bound(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val, _Compare __comp)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__comp(*__middle, __val))
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else
>     __len = __half;
> }
>      return __first;
>    }
># 2867 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    _ForwardIterator
>    upper_bound(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>
>     
>     
>     
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__val < *__middle)
>     __len = __half;
>   else
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
> }
>      return __first;
>    }
># 2919 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    _ForwardIterator
>    upper_bound(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val, _Compare __comp)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__comp(__val, *__middle))
>     __len = __half;
>   else
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
> }
>      return __first;
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator, typename _Distance>
>    void
>    __merge_without_buffer(_BidirectionalIterator __first,
>      _BidirectionalIterator __middle,
>      _BidirectionalIterator __last,
>      _Distance __len1, _Distance __len2)
>    {
>      if (__len1 == 0 || __len2 == 0)
> return;
>      if (__len1 + __len2 == 2)
> {
>   if (*__middle < *__first)
>     std::iter_swap(__first, __middle);
>   return;
> }
>      _BidirectionalIterator __first_cut = __first;
>      _BidirectionalIterator __second_cut = __middle;
>      _Distance __len11 = 0;
>      _Distance __len22 = 0;
>      if (__len1 > __len2)
> {
>   __len11 = __len1 / 2;
>   std::advance(__first_cut, __len11);
>   __second_cut = std::lower_bound(__middle, __last, *__first_cut);
>   __len22 = std::distance(__middle, __second_cut);
> }
>      else
> {
>   __len22 = __len2 / 2;
>   std::advance(__second_cut, __len22);
>   __first_cut = std::upper_bound(__first, __middle, *__second_cut);
>   __len11 = std::distance(__first, __first_cut);
> }
>      std::rotate(__first_cut, __middle, __second_cut);
>      _BidirectionalIterator __new_middle = __first_cut;
>      std::advance(__new_middle, std::distance(__middle, __second_cut));
>      std::__merge_without_buffer(__first, __first_cut, __new_middle,
>      __len11, __len22);
>      std::__merge_without_buffer(__new_middle, __second_cut, __last,
>      __len1 - __len11, __len2 - __len22);
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator, typename _Distance,
>    typename _Compare>
>    void
>    __merge_without_buffer(_BidirectionalIterator __first,
>                           _BidirectionalIterator __middle,
>      _BidirectionalIterator __last,
>      _Distance __len1, _Distance __len2,
>      _Compare __comp)
>    {
>      if (__len1 == 0 || __len2 == 0)
> return;
>      if (__len1 + __len2 == 2)
> {
>   if (__comp(*__middle, *__first))
>     std::iter_swap(__first, __middle);
>   return;
> }
>      _BidirectionalIterator __first_cut = __first;
>      _BidirectionalIterator __second_cut = __middle;
>      _Distance __len11 = 0;
>      _Distance __len22 = 0;
>      if (__len1 > __len2)
> {
>   __len11 = __len1 / 2;
>   std::advance(__first_cut, __len11);
>   __second_cut = std::lower_bound(__middle, __last, *__first_cut,
>       __comp);
>   __len22 = std::distance(__middle, __second_cut);
> }
>      else
> {
>   __len22 = __len2 / 2;
>   std::advance(__second_cut, __len22);
>   __first_cut = std::upper_bound(__first, __middle, *__second_cut,
>      __comp);
>   __len11 = std::distance(__first, __first_cut);
> }
>      std::rotate(__first_cut, __middle, __second_cut);
>      _BidirectionalIterator __new_middle = __first_cut;
>      std::advance(__new_middle, std::distance(__middle, __second_cut));
>      std::__merge_without_buffer(__first, __first_cut, __new_middle,
>      __len11, __len22, __comp);
>      std::__merge_without_buffer(__new_middle, __second_cut, __last,
>      __len1 - __len11, __len2 - __len22, __comp);
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator>
>    void
>    __inplace_stable_sort(_RandomAccessIterator __first,
>     _RandomAccessIterator __last)
>    {
>      if (__last - __first < 15)
> {
>   std::__insertion_sort(__first, __last);
>   return;
> }
>      _RandomAccessIterator __middle = __first + (__last - __first) / 2;
>      std::__inplace_stable_sort(__first, __middle);
>      std::__inplace_stable_sort(__middle, __last);
>      std::__merge_without_buffer(__first, __middle, __last,
>      __middle - __first,
>      __last - __middle);
>    }
>
>
>
>
>
>
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    __inplace_stable_sort(_RandomAccessIterator __first,
>     _RandomAccessIterator __last, _Compare __comp)
>    {
>      if (__last - __first < 15)
> {
>   std::__insertion_sort(__first, __last, __comp);
>   return;
> }
>      _RandomAccessIterator __middle = __first + (__last - __first) / 2;
>      std::__inplace_stable_sort(__first, __middle, __comp);
>      std::__inplace_stable_sort(__middle, __last, __comp);
>      std::__merge_without_buffer(__first, __middle, __last,
>      __middle - __first,
>      __last - __middle,
>      __comp);
>    }
># 3117 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    merge(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2, _InputIterator2 __last2,
>   _OutputIterator __result)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (*__first2 < *__first1)
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 3175 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    merge(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2, _InputIterator2 __last2,
>   _OutputIterator __result, _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (__comp(*__first2, *__first1))
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
>
>  template<typename _RandomAccessIterator1, typename _RandomAccessIterator2,
>    typename _Distance>
>    void
>    __merge_sort_loop(_RandomAccessIterator1 __first,
>        _RandomAccessIterator1 __last,
>        _RandomAccessIterator2 __result,
>        _Distance __step_size)
>    {
>      const _Distance __two_step = 2 * __step_size;
>
>      while (__last - __first >= __two_step)
> {
>   __result = std::merge(__first, __first + __step_size,
>    __first + __step_size, __first + __two_step,
>    __result);
>   __first += __two_step;
> }
>
>      __step_size = std::min(_Distance(__last - __first), __step_size);
>      std::merge(__first, __first + __step_size, __first + __step_size, __last,
>   __result);
>    }
>
>  template<typename _RandomAccessIterator1, typename _RandomAccessIterator2,
>    typename _Distance, typename _Compare>
>    void
>    __merge_sort_loop(_RandomAccessIterator1 __first,
>        _RandomAccessIterator1 __last,
>        _RandomAccessIterator2 __result, _Distance __step_size,
>        _Compare __comp)
>    {
>      const _Distance __two_step = 2 * __step_size;
>
>      while (__last - __first >= __two_step)
> {
>   __result = std::merge(__first, __first + __step_size,
>    __first + __step_size, __first + __two_step,
>    __result,
>    __comp);
>   __first += __two_step;
> }
>      __step_size = std::min(_Distance(__last - __first), __step_size);
>
>      std::merge(__first, __first + __step_size,
>   __first + __step_size, __last,
>   __result,
>   __comp);
>    }
>
>  enum { _S_chunk_size = 7 };
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    void
>    __chunk_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>      _Distance __chunk_size)
>    {
>      while (__last - __first >= __chunk_size)
> {
>   std::__insertion_sort(__first, __first + __chunk_size);
>   __first += __chunk_size;
> }
>      std::__insertion_sort(__first, __last);
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance, typename _Compare>
>    void
>    __chunk_insertion_sort(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>      _Distance __chunk_size, _Compare __comp)
>    {
>      while (__last - __first >= __chunk_size)
> {
>   std::__insertion_sort(__first, __first + __chunk_size, __comp);
>   __first += __chunk_size;
> }
>      std::__insertion_sort(__first, __last, __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer>
>    void
>    __merge_sort_with_buffer(_RandomAccessIterator __first,
>        _RandomAccessIterator __last,
>                             _Pointer __buffer)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>
>      const _Distance __len = __last - __first;
>      const _Pointer __buffer_last = __buffer + __len;
>
>      _Distance __step_size = _S_chunk_size;
>      std::__chunk_insertion_sort(__first, __last, __step_size);
>
>      while (__step_size < __len)
> {
>   std::__merge_sort_loop(__first, __last, __buffer, __step_size);
>   __step_size *= 2;
>   std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size);
>   __step_size *= 2;
> }
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer, typename _Compare>
>    void
>    __merge_sort_with_buffer(_RandomAccessIterator __first,
>        _RandomAccessIterator __last,
>                             _Pointer __buffer, _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _Distance;
>
>      const _Distance __len = __last - __first;
>      const _Pointer __buffer_last = __buffer + __len;
>
>      _Distance __step_size = _S_chunk_size;
>      std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
>
>      while (__step_size < __len)
> {
>   std::__merge_sort_loop(__first, __last, __buffer,
>     __step_size, __comp);
>   __step_size *= 2;
>   std::__merge_sort_loop(__buffer, __buffer_last, __first,
>     __step_size, __comp);
>   __step_size *= 2;
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _BidirectionalIterator3>
>    _BidirectionalIterator3
>    __merge_backward(_BidirectionalIterator1 __first1,
>       _BidirectionalIterator1 __last1,
>       _BidirectionalIterator2 __first2,
>       _BidirectionalIterator2 __last2,
>       _BidirectionalIterator3 __result)
>    {
>      if (__first1 == __last1)
> return std::copy_backward(__first2, __last2, __result);
>      if (__first2 == __last2)
> return std::copy_backward(__first1, __last1, __result);
>      --__last1;
>      --__last2;
>      while (true)
> {
>   if (*__last2 < *__last1)
>     {
>       *--__result = *__last1;
>       if (__first1 == __last1)
>  return std::copy_backward(__first2, ++__last2, __result);
>       --__last1;
>     }
>   else
>     {
>       *--__result = *__last2;
>       if (__first2 == __last2)
>  return std::copy_backward(__first1, ++__last1, __result);
>       --__last2;
>     }
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _BidirectionalIterator3, typename _Compare>
>    _BidirectionalIterator3
>    __merge_backward(_BidirectionalIterator1 __first1,
>       _BidirectionalIterator1 __last1,
>       _BidirectionalIterator2 __first2,
>       _BidirectionalIterator2 __last2,
>       _BidirectionalIterator3 __result,
>       _Compare __comp)
>    {
>      if (__first1 == __last1)
> return std::copy_backward(__first2, __last2, __result);
>      if (__first2 == __last2)
> return std::copy_backward(__first1, __last1, __result);
>      --__last1;
>      --__last2;
>      while (true)
> {
>   if (__comp(*__last2, *__last1))
>     {
>       *--__result = *__last1;
>       if (__first1 == __last1)
>  return std::copy_backward(__first2, ++__last2, __result);
>       --__last1;
>     }
>   else
>     {
>       *--__result = *__last2;
>       if (__first2 == __last2)
>  return std::copy_backward(__first1, ++__last1, __result);
>       --__last2;
>     }
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _Distance>
>    _BidirectionalIterator1
>    __rotate_adaptive(_BidirectionalIterator1 __first,
>        _BidirectionalIterator1 __middle,
>        _BidirectionalIterator1 __last,
>        _Distance __len1, _Distance __len2,
>        _BidirectionalIterator2 __buffer,
>        _Distance __buffer_size)
>    {
>      _BidirectionalIterator2 __buffer_end;
>      if (__len1 > __len2 && __len2 <= __buffer_size)
> {
>   __buffer_end = std::copy(__middle, __last, __buffer);
>   std::copy_backward(__first, __middle, __last);
>   return std::copy(__buffer, __buffer_end, __first);
> }
>      else if (__len1 <= __buffer_size)
> {
>   __buffer_end = std::copy(__first, __middle, __buffer);
>   std::copy(__middle, __last, __first);
>   return std::copy_backward(__buffer, __buffer_end, __last);
> }
>      else
> {
>   std::rotate(__first, __middle, __last);
>   std::advance(__first, std::distance(__middle, __last));
>   return __first;
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator, typename _Distance,
>    typename _Pointer>
>    void
>    __merge_adaptive(_BidirectionalIterator __first,
>                     _BidirectionalIterator __middle,
>       _BidirectionalIterator __last,
>       _Distance __len1, _Distance __len2,
>       _Pointer __buffer, _Distance __buffer_size)
>    {
>      if (__len1 <= __len2 && __len1 <= __buffer_size)
> {
>   _Pointer __buffer_end = std::copy(__first, __middle, __buffer);
>   std::merge(__buffer, __buffer_end, __middle, __last, __first);
> }
>      else if (__len2 <= __buffer_size)
> {
>   _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
>   std::__merge_backward(__first, __middle, __buffer,
>    __buffer_end, __last);
> }
>      else
> {
>   _BidirectionalIterator __first_cut = __first;
>   _BidirectionalIterator __second_cut = __middle;
>   _Distance __len11 = 0;
>   _Distance __len22 = 0;
>   if (__len1 > __len2)
>     {
>       __len11 = __len1 / 2;
>       std::advance(__first_cut, __len11);
>       __second_cut = std::lower_bound(__middle, __last,
>           *__first_cut);
>       __len22 = std::distance(__middle, __second_cut);
>     }
>   else
>     {
>       __len22 = __len2 / 2;
>       std::advance(__second_cut, __len22);
>       __first_cut = std::upper_bound(__first, __middle,
>          *__second_cut);
>       __len11 = std::distance(__first, __first_cut);
>     }
>   _BidirectionalIterator __new_middle =
>     std::__rotate_adaptive(__first_cut, __middle, __second_cut,
>       __len1 - __len11, __len22, __buffer,
>       __buffer_size);
>   std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
>    __len22, __buffer, __buffer_size);
>   std::__merge_adaptive(__new_middle, __second_cut, __last,
>    __len1 - __len11,
>    __len2 - __len22, __buffer, __buffer_size);
> }
>    }
>
>
>
>
>
>
>  template<typename _BidirectionalIterator, typename _Distance, typename _Pointer,
>    typename _Compare>
>    void
>    __merge_adaptive(_BidirectionalIterator __first,
>                     _BidirectionalIterator __middle,
>       _BidirectionalIterator __last,
>       _Distance __len1, _Distance __len2,
>       _Pointer __buffer, _Distance __buffer_size,
>       _Compare __comp)
>    {
>      if (__len1 <= __len2 && __len1 <= __buffer_size)
> {
>   _Pointer __buffer_end = std::copy(__first, __middle, __buffer);
>   std::merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
> }
>      else if (__len2 <= __buffer_size)
> {
>   _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
>   std::__merge_backward(__first, __middle, __buffer, __buffer_end,
>    __last, __comp);
> }
>      else
> {
>   _BidirectionalIterator __first_cut = __first;
>   _BidirectionalIterator __second_cut = __middle;
>   _Distance __len11 = 0;
>   _Distance __len22 = 0;
>   if (__len1 > __len2)
>     {
>       __len11 = __len1 / 2;
>       std::advance(__first_cut, __len11);
>       __second_cut = std::lower_bound(__middle, __last, *__first_cut,
>           __comp);
>       __len22 = std::distance(__middle, __second_cut);
>     }
>   else
>     {
>       __len22 = __len2 / 2;
>       std::advance(__second_cut, __len22);
>       __first_cut = std::upper_bound(__first, __middle, *__second_cut,
>          __comp);
>       __len11 = std::distance(__first, __first_cut);
>     }
>   _BidirectionalIterator __new_middle =
>     std::__rotate_adaptive(__first_cut, __middle, __second_cut,
>       __len1 - __len11, __len22, __buffer,
>       __buffer_size);
>   std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
>    __len22, __buffer, __buffer_size, __comp);
>   std::__merge_adaptive(__new_middle, __second_cut, __last,
>    __len1 - __len11,
>    __len2 - __len22, __buffer,
>    __buffer_size, __comp);
> }
>    }
># 3595 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    void
>    inplace_merge(_BidirectionalIterator __first,
>    _BidirectionalIterator __middle,
>    _BidirectionalIterator __last)
>    {
>      typedef typename iterator_traits<_BidirectionalIterator>::value_type
>          _ValueType;
>      typedef typename iterator_traits<_BidirectionalIterator>::difference_type
>          _DistanceType;
>
>
>     
>
>     
>      ;
>      ;
>
>      if (__first == __middle || __middle == __last)
> return;
>
>      _DistanceType __len1 = std::distance(__first, __middle);
>      _DistanceType __len2 = std::distance(__middle, __last);
>
>      _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first,
>          __last);
>      if (__buf.begin() == 0)
> std::__merge_without_buffer(__first, __middle, __last, __len1, __len2);
>      else
> std::__merge_adaptive(__first, __middle, __last, __len1, __len2,
>         __buf.begin(), _DistanceType(__buf.size()));
>    }
># 3649 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _Compare>
>    void
>    inplace_merge(_BidirectionalIterator __first,
>    _BidirectionalIterator __middle,
>    _BidirectionalIterator __last,
>    _Compare __comp)
>    {
>      typedef typename iterator_traits<_BidirectionalIterator>::value_type
>          _ValueType;
>      typedef typename iterator_traits<_BidirectionalIterator>::difference_type
>          _DistanceType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      if (__first == __middle || __middle == __last)
> return;
>
>      const _DistanceType __len1 = std::distance(__first, __middle);
>      const _DistanceType __len2 = std::distance(__middle, __last);
>
>      _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first,
>          __last);
>      if (__buf.begin() == 0)
> std::__merge_without_buffer(__first, __middle, __last, __len1,
>        __len2, __comp);
>      else
> std::__merge_adaptive(__first, __middle, __last, __len1, __len2,
>         __buf.begin(), _DistanceType(__buf.size()),
>         __comp);
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer,
>    typename _Distance>
>    void
>    __stable_sort_adaptive(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>                           _Pointer __buffer, _Distance __buffer_size)
>    {
>      const _Distance __len = (__last - __first + 1) / 2;
>      const _RandomAccessIterator __middle = __first + __len;
>      if (__len > __buffer_size)
> {
>   std::__stable_sort_adaptive(__first, __middle,
>          __buffer, __buffer_size);
>   std::__stable_sort_adaptive(__middle, __last,
>          __buffer, __buffer_size);
> }
>      else
> {
>   std::__merge_sort_with_buffer(__first, __middle, __buffer);
>   std::__merge_sort_with_buffer(__middle, __last, __buffer);
> }
>      std::__merge_adaptive(__first, __middle, __last,
>       _Distance(__middle - __first),
>       _Distance(__last - __middle),
>       __buffer, __buffer_size);
>    }
>
>  template<typename _RandomAccessIterator, typename _Pointer,
>    typename _Distance, typename _Compare>
>    void
>    __stable_sort_adaptive(_RandomAccessIterator __first,
>      _RandomAccessIterator __last,
>                           _Pointer __buffer, _Distance __buffer_size,
>                           _Compare __comp)
>    {
>      const _Distance __len = (__last - __first + 1) / 2;
>      const _RandomAccessIterator __middle = __first + __len;
>      if (__len > __buffer_size)
> {
>   std::__stable_sort_adaptive(__first, __middle, __buffer,
>          __buffer_size, __comp);
>   std::__stable_sort_adaptive(__middle, __last, __buffer,
>          __buffer_size, __comp);
> }
>      else
> {
>   std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
>   std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
> }
>      std::__merge_adaptive(__first, __middle, __last,
>       _Distance(__middle - __first),
>       _Distance(__last - __middle),
>       __buffer, __buffer_size,
>       __comp);
>    }
># 3758 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    inline void
>    stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>
>     
>      ;
>
>      _Temporary_buffer<_RandomAccessIterator, _ValueType>
> buf(__first, __last);
>      if (buf.begin() == 0)
> std::__inplace_stable_sort(__first, __last);
>      else
> std::__stable_sort_adaptive(__first, __last, buf.begin(),
>        _DistanceType(buf.size()));
>    }
># 3799 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    inline void
>    stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
>  _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> _DistanceType;
>
>
>     
>
>     
>
>
>      ;
>
>      _Temporary_buffer<_RandomAccessIterator, _ValueType> buf(__first, __last);
>      if (buf.begin() == 0)
> std::__inplace_stable_sort(__first, __last, __comp);
>      else
> std::__stable_sort_adaptive(__first, __last, buf.begin(),
>        _DistanceType(buf.size()), __comp);
>    }
># 3840 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator>
>    void
>    nth_element(_RandomAccessIterator __first,
>  _RandomAccessIterator __nth,
>  _RandomAccessIterator __last)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>      ;
>      ;
>
>      while (__last - __first > 3)
> {
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last
>          - 1))));
>   if (__cut <= __nth)
>     __first = __cut;
>   else
>     __last = __cut;
> }
>      std::__insertion_sort(__first, __last);
>    }
># 3891 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _RandomAccessIterator, typename _Compare>
>    void
>    nth_element(_RandomAccessIterator __first,
>  _RandomAccessIterator __nth,
>  _RandomAccessIterator __last,
>       _Compare __comp)
>    {
>      typedef typename iterator_traits<_RandomAccessIterator>::value_type
> _ValueType;
>
>
>     
>
>     
>
>      ;
>      ;
>
>      while (__last - __first > 3)
> {
>   _RandomAccessIterator __cut =
>     std::__unguarded_partition(__first, __last,
>           _ValueType(std::__median(*__first,
>        *(__first
>          + (__last
>             - __first)
>          / 2),
>        *(__last - 1),
>             __comp)), __comp);
>   if (__cut <= __nth)
>     __first = __cut;
>   else
>     __last = __cut;
> }
>      std::__insertion_sort(__first, __last, __comp);
>    }
># 3944 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    pair<_ForwardIterator, _ForwardIterator>
>    equal_range(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>
>     
>     
>     
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle, __left, __right;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (*__middle < __val)
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else if (__val < *__middle)
>     __len = __half;
>   else
>     {
>       __left = std::lower_bound(__first, __middle, __val);
>       std::advance(__first, __len);
>       __right = std::upper_bound(++__middle, __first, __val);
>       return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
>     }
> }
>      return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
>    }
># 4006 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    pair<_ForwardIterator, _ForwardIterator>
>    equal_range(_ForwardIterator __first, _ForwardIterator __last,
>  const _Tp& __val,
>  _Compare __comp)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
> _ValueType;
>      typedef typename iterator_traits<_ForwardIterator>::difference_type
> _DistanceType;
>
>
>     
>     
>
>     
>
>      ;
>
>      _DistanceType __len = std::distance(__first, __last);
>      _DistanceType __half;
>      _ForwardIterator __middle, __left, __right;
>
>      while (__len > 0)
> {
>   __half = __len >> 1;
>   __middle = __first;
>   std::advance(__middle, __half);
>   if (__comp(*__middle, __val))
>     {
>       __first = __middle;
>       ++__first;
>       __len = __len - __half - 1;
>     }
>   else if (__comp(__val, *__middle))
>     __len = __half;
>   else
>     {
>       __left = std::lower_bound(__first, __middle, __val, __comp);
>       std::advance(__first, __len);
>       __right = std::upper_bound(++__middle, __first, __val, __comp);
>       return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
>     }
> }
>      return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
>    }
># 4064 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    bool
>    binary_search(_ForwardIterator __first, _ForwardIterator __last,
>                  const _Tp& __val)
>    {
>
>
>     
>     
>
>     
>      ;
>
>      _ForwardIterator __i = std::lower_bound(__first, __last, __val);
>      return __i != __last && !(__val < *__i);
>    }
># 4096 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Tp, typename _Compare>
>    bool
>    binary_search(_ForwardIterator __first, _ForwardIterator __last,
>                  const _Tp& __val, _Compare __comp)
>    {
>
>     
>     
>
>     
>
>      ;
>
>      _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp);
>      return __i != __last && !__comp(__val, *__i);
>    }
># 4134 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    bool
>    includes(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _InputIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first2 < *__first1)
>   return false;
> else if(*__first1 < *__first2)
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 4180 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _Compare>
>    bool
>    includes(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first2, *__first1))
>   return false;
> else if(__comp(*__first1, *__first2))
>   ++__first1;
> else
>   ++__first1, ++__first2;
>
>      return __first2 == __last2;
>    }
># 4226 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_union(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (*__first1 < *__first2)
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   else if (*__first2 < *__first1)
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>       ++__first2;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 4288 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_union(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result, _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> {
>   if (__comp(*__first1, *__first2))
>     {
>       *__result = *__first1;
>       ++__first1;
>     }
>   else if (__comp(*__first2, *__first1))
>     {
>       *__result = *__first2;
>       ++__first2;
>     }
>   else
>     {
>       *__result = *__first1;
>       ++__first1;
>       ++__first2;
>     }
>   ++__result;
> }
>      return std::copy(__first2, __last2, std::copy(__first1, __last1,
>          __result));
>    }
># 4349 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   ++__first1;
> else if (*__first2 < *__first1)
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 4403 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _OutputIterator __result, _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   ++__first1;
> else if (__comp(*__first2, *__first1))
>   ++__first2;
> else
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__first2;
>     ++__result;
>   }
>      return __result;
>    }
># 4457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>     _InputIterator2 __first2, _InputIterator2 __last2,
>     _OutputIterator __result)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (*__first2 < *__first1)
>   ++__first2;
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first1, __last1, __result);
>    }
># 4515 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>     _InputIterator2 __first2, _InputIterator2 __last2,
>     _OutputIterator __result, _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (__comp(*__first2, *__first1))
>   ++__first2;
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first1, __last1, __result);
>    }
># 4569 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator>
>    _OutputIterator
>    set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>        _InputIterator2 __first2, _InputIterator2 __last2,
>        _OutputIterator __result)
>    {
>
>     
>     
>     
>
>     
>
>
>     
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (*__first1 < *__first2)
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (*__first2 < *__first1)
>   {
>     *__result = *__first2;
>     ++__first2;
>     ++__result;
>   }
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first2, __last2, std::copy(__first1,
>          __last1, __result));
>    }
># 4630 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _OutputIterator, typename _Compare>
>    _OutputIterator
>    set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
>        _InputIterator2 __first2, _InputIterator2 __last2,
>        _OutputIterator __result,
>        _Compare __comp)
>    {
>
>     
>     
>     
>
>
>     
>
>     
>
>
>      ;
>      ;
>
>      while (__first1 != __last1 && __first2 != __last2)
> if (__comp(*__first1, *__first2))
>   {
>     *__result = *__first1;
>     ++__first1;
>     ++__result;
>   }
> else if (__comp(*__first2, *__first1))
>   {
>     *__result = *__first2;
>     ++__first2;
>     ++__result;
>   }
> else
>   {
>     ++__first1;
>     ++__first2;
>   }
>      return std::copy(__first2, __last2, std::copy(__first1,
>          __last1, __result));
>    }
># 4683 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator>
>    _ForwardIterator
>    max_element(_ForwardIterator __first, _ForwardIterator __last)
>    {
>
>     
>     
>
>      ;
>
>      if (__first == __last)
> return __first;
>      _ForwardIterator __result = __first;
>      while (++__first != __last)
> if (*__result < *__first)
>   __result = __first;
>      return __result;
>    }
># 4710 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Compare>
>    _ForwardIterator
>    max_element(_ForwardIterator __first, _ForwardIterator __last,
>  _Compare __comp)
>    {
>
>     
>     
>
>
>      ;
>
>      if (__first == __last) return __first;
>      _ForwardIterator __result = __first;
>      while (++__first != __last)
> if (__comp(*__result, *__first)) __result = __first;
>      return __result;
>    }
>
>
>
>
>
>
>
>  template<typename _ForwardIterator>
>    _ForwardIterator
>    min_element(_ForwardIterator __first, _ForwardIterator __last)
>    {
>
>     
>     
>
>      ;
>
>      if (__first == __last)
> return __first;
>      _ForwardIterator __result = __first;
>      while (++__first != __last)
> if (*__first < *__result)
>   __result = __first;
>      return __result;
>    }
># 4762 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator, typename _Compare>
>    _ForwardIterator
>    min_element(_ForwardIterator __first, _ForwardIterator __last,
>  _Compare __comp)
>    {
>
>     
>     
>
>
>      ;
>
>      if (__first == __last)
> return __first;
>      _ForwardIterator __result = __first;
>      while (++__first != __last)
> if (__comp(*__first, *__result))
>   __result = __first;
>      return __result;
>    }
># 4797 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    bool
>    next_permutation(_BidirectionalIterator __first,
>       _BidirectionalIterator __last)
>    {
>
>     
>
>     
>
>      ;
>
>      if (__first == __last)
> return false;
>      _BidirectionalIterator __i = __first;
>      ++__i;
>      if (__i == __last)
> return false;
>      __i = __last;
>      --__i;
>
>      for(;;)
> {
>   _BidirectionalIterator __ii = __i;
>   --__i;
>   if (*__i < *__ii)
>     {
>       _BidirectionalIterator __j = __last;
>       while (!(*__i < *--__j))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 4853 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _Compare>
>    bool
>    next_permutation(_BidirectionalIterator __first,
>       _BidirectionalIterator __last, _Compare __comp)
>    {
>
>     
>
>     
>
>
>      ;
>
>      if (__first == __last)
> return false;
>      _BidirectionalIterator __i = __first;
>      ++__i;
>      if (__i == __last)
> return false;
>      __i = __last;
>      --__i;
>
>      for(;;)
> {
>   _BidirectionalIterator __ii = __i;
>   --__i;
>   if (__comp(*__i, *__ii))
>     {
>       _BidirectionalIterator __j = __last;
>       while (!__comp(*__i, *--__j))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 4908 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator>
>    bool
>    prev_permutation(_BidirectionalIterator __first,
>       _BidirectionalIterator __last)
>    {
>
>     
>
>     
>
>      ;
>
>      if (__first == __last)
> return false;
>      _BidirectionalIterator __i = __first;
>      ++__i;
>      if (__i == __last)
> return false;
>      __i = __last;
>      --__i;
>
>      for(;;)
> {
>   _BidirectionalIterator __ii = __i;
>   --__i;
>   if (*__ii < *__i)
>     {
>       _BidirectionalIterator __j = __last;
>       while (!(*--__j < *__i))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 4964 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _BidirectionalIterator, typename _Compare>
>    bool
>    prev_permutation(_BidirectionalIterator __first,
>       _BidirectionalIterator __last, _Compare __comp)
>    {
>
>     
>
>     
>
>
>      ;
>
>      if (__first == __last)
> return false;
>      _BidirectionalIterator __i = __first;
>      ++__i;
>      if (__i == __last)
> return false;
>      __i = __last;
>      --__i;
>
>      for(;;)
> {
>   _BidirectionalIterator __ii = __i;
>   --__i;
>   if (__comp(*__ii, *__i))
>     {
>       _BidirectionalIterator __j = __last;
>       while (!__comp(*--__j, *__i))
>  {}
>       std::iter_swap(__i, __j);
>       std::reverse(__ii, __last);
>       return true;
>     }
>   if (__i == __first)
>     {
>       std::reverse(__first, __last);
>       return false;
>     }
> }
>    }
># 5023 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    _InputIterator
>    find_first_of(_InputIterator __first1, _InputIterator __last1,
>    _ForwardIterator __first2, _ForwardIterator __last2)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>      for ( ; __first1 != __last1; ++__first1)
> for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
>   if (*__first1 == *__iter)
>     return __first1;
>      return __last1;
>    }
># 5059 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _BinaryPredicate>
>    _InputIterator
>    find_first_of(_InputIterator __first1, _InputIterator __last1,
>    _ForwardIterator __first2, _ForwardIterator __last2,
>    _BinaryPredicate __comp)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>      for ( ; __first1 != __last1; ++__first1)
> for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
>   if (__comp(*__first1, *__iter))
>     return __first1;
>      return __last1;
>    }
># 5089 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    _ForwardIterator1
>    __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>        _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>        forward_iterator_tag, forward_iterator_tag)
>    {
>      if (__first2 == __last2)
> return __last1;
>      else
> {
>   _ForwardIterator1 __result = __last1;
>   while (1)
>     {
>       _ForwardIterator1 __new_result
>  = std::search(__first1, __last1, __first2, __last2);
>       if (__new_result == __last1)
>  return __result;
>       else
>  {
>    __result = __new_result;
>    __first1 = __new_result;
>    ++__first1;
>  }
>     }
> }
>    }
>
>  template<typename _ForwardIterator1, typename _ForwardIterator2,
>    typename _BinaryPredicate>
>    _ForwardIterator1
>    __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>        _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>        forward_iterator_tag, forward_iterator_tag,
>        _BinaryPredicate __comp)
>    {
>      if (__first2 == __last2)
> return __last1;
>      else
> {
>   _ForwardIterator1 __result = __last1;
>   while (1)
>     {
>       _ForwardIterator1 __new_result
>  = std::search(__first1, __last1, __first2, __last2, __comp);
>       if (__new_result == __last1)
>  return __result;
>       else
>  {
>    __result = __new_result;
>    __first1 = __new_result;
>    ++__first1;
>  }
>     }
> }
>    }
>
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2>
>    _BidirectionalIterator1
>    __find_end(_BidirectionalIterator1 __first1,
>        _BidirectionalIterator1 __last1,
>        _BidirectionalIterator2 __first2,
>        _BidirectionalIterator2 __last2,
>        bidirectional_iterator_tag, bidirectional_iterator_tag)
>    {
>
>     
>
>     
>
>
>      typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1;
>      typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2;
>
>      _RevIterator1 __rlast1(__first1);
>      _RevIterator2 __rlast2(__first2);
>      _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1,
>         _RevIterator2(__last2), __rlast2);
>
>      if (__rresult == __rlast1)
> return __last1;
>      else
> {
>   _BidirectionalIterator1 __result = __rresult.base();
>   std::advance(__result, -std::distance(__first2, __last2));
>   return __result;
> }
>    }
>
>  template<typename _BidirectionalIterator1, typename _BidirectionalIterator2,
>    typename _BinaryPredicate>
>    _BidirectionalIterator1
>    __find_end(_BidirectionalIterator1 __first1,
>        _BidirectionalIterator1 __last1,
>        _BidirectionalIterator2 __first2,
>        _BidirectionalIterator2 __last2,
>        bidirectional_iterator_tag, bidirectional_iterator_tag,
>        _BinaryPredicate __comp)
>    {
>
>     
>
>     
>
>
>      typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1;
>      typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2;
>
>      _RevIterator1 __rlast1(__first1);
>      _RevIterator2 __rlast2(__first2);
>      _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1,
>         _RevIterator2(__last2), __rlast2,
>         __comp);
>
>      if (__rresult == __rlast1)
> return __last1;
>      else
> {
>   _BidirectionalIterator1 __result = __rresult.base();
>   std::advance(__result, -std::distance(__first2, __last2));
>   return __result;
> }
>    }
># 5239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    inline _ForwardIterator1
>    find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>      _ForwardIterator2 __first2, _ForwardIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>      return std::__find_end(__first1, __last1, __first2, __last2,
>        std::__iterator_category(__first1),
>        std::__iterator_category(__first2));
>    }
># 5284 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2,
>    typename _BinaryPredicate>
>    inline _ForwardIterator1
>    find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
>      _ForwardIterator2 __first2, _ForwardIterator2 __last2,
>      _BinaryPredicate __comp)
>    {
>
>     
>     
>     
>
>
>      ;
>      ;
>
>      return std::__find_end(__first1, __last1, __first2, __last2,
>        std::__iterator_category(__first1),
>        std::__iterator_category(__first2),
>        __comp);
>    }
>
>}
># 69 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/algorithm" 2 3
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 3
>       
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 3
>
>namespace std
>{
>  template<typename _Type>
>    inline bool
>    __is_null_pointer(_Type* __ptr)
>    { return __ptr == 0; }
>
>  template<typename _Type>
>    inline bool
>    __is_null_pointer(_Type)
>    { return false; }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    const typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4;
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    const _CharT
>    basic_string<_CharT, _Traits, _Alloc>::
>    _Rep::_S_terminal = _CharT();
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    const typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::npos;
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[
>    (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) /
>      sizeof(size_type)];
>
>
>
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template<typename _InIterator>
>      _CharT*
>      basic_string<_CharT, _Traits, _Alloc>::
>      _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
>     input_iterator_tag)
>      {
>
> if (__beg == __end && __a == _Alloc())
>   return _S_empty_rep()._M_refdata();
>
>
> _CharT __buf[128];
> size_type __len = 0;
> while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT))
>   {
>     __buf[__len++] = *__beg;
>     ++__beg;
>   }
> _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
> _M_copy(__r->_M_refdata(), __buf, __len);
> try
>   {
>     while (__beg != __end)
>       {
>  if (__len == __r->_M_capacity)
>    {
>
>      _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
>      _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
>      __r->_M_destroy(__a);
>      __r = __another;
>    }
>  __r->_M_refdata()[__len++] = *__beg;
>  ++__beg;
>       }
>   }
> catch(...)
>   {
>     __r->_M_destroy(__a);
>     throw;
>   }
> __r->_M_set_length_and_sharable(__len);
> return __r->_M_refdata();
>      }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template <typename _InIterator>
>      _CharT*
>      basic_string<_CharT, _Traits, _Alloc>::
>      _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
>     forward_iterator_tag)
>      {
>
> if (__beg == __end && __a == _Alloc())
>   return _S_empty_rep()._M_refdata();
>
>
> if (__builtin_expect(__is_null_pointer(__beg) && __beg != __end, 0))
>   __throw_logic_error(("basic_string::_S_construct NULL not valid"));
>
> const size_type __dnew = static_cast<size_type>(std::distance(__beg,
>              __end));
>
> _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);
> try
>   { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
> catch(...)
>   {
>     __r->_M_destroy(__a);
>     throw;
>   }
> __r->_M_set_length_and_sharable(__dnew);
> return __r->_M_refdata();
>      }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    _CharT*
>    basic_string<_CharT, _Traits, _Alloc>::
>    _S_construct(size_type __n, _CharT __c, const _Alloc& __a)
>    {
>
>      if (__n == 0 && __a == _Alloc())
> return _S_empty_rep()._M_refdata();
>
>
>      _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
>      if (__n)
> _M_assign(__r->_M_refdata(), __n, __c);
>
>      __r->_M_set_length_and_sharable(__n);
>      return __r->_M_refdata();
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const basic_string& __str)
>    : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()),
>       __str.get_allocator()),
>    __str.get_allocator())
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const _Alloc& __a)
>    : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a)
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const basic_string& __str, size_type __pos, size_type __n)
>    : _M_dataplus(_S_construct(__str._M_data()
>          + __str._M_check(__pos,
>      "basic_string::basic_string"),
>          __str._M_data() + __str._M_limit(__pos, __n)
>          + __pos, _Alloc()), _Alloc())
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const basic_string& __str, size_type __pos,
>   size_type __n, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__str._M_data()
>          + __str._M_check(__pos,
>      "basic_string::basic_string"),
>          __str._M_data() + __str._M_limit(__pos, __n)
>          + __pos, __a), __a)
>    { }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const _CharT* __s, size_type __n, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__s, __s + __n, __a), __a)
>    { }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(const _CharT* __s, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) :
>          __s + npos, __a), __a)
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(size_type __n, _CharT __c, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__n, __c, __a), __a)
>    { }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template<typename _InputIterator>
>    basic_string<_CharT, _Traits, _Alloc>::
>    basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a)
>    : _M_dataplus(_S_construct(__beg, __end, __a), __a)
>    { }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    assign(const basic_string& __str)
>    {
>      if (_M_rep() != __str._M_rep())
> {
>
>   const allocator_type __a = this->get_allocator();
>   _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator());
>   _M_rep()->_M_dispose(__a);
>   _M_data(__tmp);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    assign(const _CharT* __s, size_type __n)
>    {
>      ;
>      _M_check_length(this->size(), __n, "basic_string::assign");
>      if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
> return _M_replace_safe(size_type(0), this->size(), __s, __n);
>      else
> {
>
>   const size_type __pos = __s - _M_data();
>   if (__pos >= __n)
>     _M_copy(_M_data(), __s, __n);
>   else if (__pos)
>     _M_move(_M_data(), __s, __n);
>   _M_rep()->_M_set_length_and_sharable(__n);
>   return *this;
> }
>     }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(size_type __n, _CharT __c)
>    {
>      if (__n)
> {
>   _M_check_length(size_type(0), __n, "basic_string::append");
>   const size_type __len = __n + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     this->reserve(__len);
>   _M_assign(_M_data() + this->size(), __n, __c);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(const _CharT* __s, size_type __n)
>    {
>      ;
>      if (__n)
> {
>   _M_check_length(size_type(0), __n, "basic_string::append");
>   const size_type __len = __n + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     {
>       if (_M_disjunct(__s))
>  this->reserve(__len);
>       else
>  {
>    const size_type __off = __s - _M_data();
>    this->reserve(__len);
>    __s = _M_data() + __off;
>  }
>     }
>   _M_copy(_M_data() + this->size(), __s, __n);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(const basic_string& __str)
>    {
>      const size_type __size = __str.size();
>      if (__size)
> {
>   const size_type __len = __size + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     this->reserve(__len);
>   _M_copy(_M_data() + this->size(), __str._M_data(), __size);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    append(const basic_string& __str, size_type __pos, size_type __n)
>    {
>      __str._M_check(__pos, "basic_string::append");
>      __n = __str._M_limit(__pos, __n);
>      if (__n)
> {
>   const size_type __len = __n + this->size();
>   if (__len > this->capacity() || _M_rep()->_M_is_shared())
>     this->reserve(__len);
>   _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n);
>   _M_rep()->_M_set_length_and_sharable(__len);
> }
>      return *this;
>    }
>
>   template<typename _CharT, typename _Traits, typename _Alloc>
>     basic_string<_CharT, _Traits, _Alloc>&
>     basic_string<_CharT, _Traits, _Alloc>::
>     insert(size_type __pos, const _CharT* __s, size_type __n)
>     {
>       ;
>       _M_check(__pos, "basic_string::insert");
>       _M_check_length(size_type(0), __n, "basic_string::insert");
>       if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
>         return _M_replace_safe(__pos, size_type(0), __s, __n);
>       else
>         {
>
>           const size_type __off = __s - _M_data();
>           _M_mutate(__pos, 0, __n);
>           __s = _M_data() + __off;
>           _CharT* __p = _M_data() + __pos;
>           if (__s + __n <= __p)
>             _M_copy(__p, __s, __n);
>           else if (__s >= __p)
>             _M_copy(__p, __s + __n, __n);
>           else
>             {
>        const size_type __nleft = __p - __s;
>               _M_copy(__p, __s, __nleft);
>               _M_copy(__p + __nleft, __p + __n, __n - __nleft);
>             }
>           return *this;
>         }
>     }
>
>   template<typename _CharT, typename _Traits, typename _Alloc>
>     basic_string<_CharT, _Traits, _Alloc>&
>     basic_string<_CharT, _Traits, _Alloc>::
>     replace(size_type __pos, size_type __n1, const _CharT* __s,
>      size_type __n2)
>     {
>       ;
>       _M_check(__pos, "basic_string::replace");
>       __n1 = _M_limit(__pos, __n1);
>       _M_check_length(__n1, __n2, "basic_string::replace");
>       bool __left;
>       if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
>         return _M_replace_safe(__pos, __n1, __s, __n2);
>       else if ((__left = __s + __n2 <= _M_data() + __pos)
>  || _M_data() + __pos + __n1 <= __s)
>  {
>
>    size_type __off = __s - _M_data();
>    __left ? __off : (__off += __n2 - __n1);
>    _M_mutate(__pos, __n1, __n2);
>    _M_copy(_M_data() + __pos, _M_data() + __off, __n2);
>    return *this;
>  }
>       else
>  {
>
>    const basic_string __tmp(__s, __n2);
>    return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2);
>  }
>     }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::
>    _M_destroy(const _Alloc& __a) throw ()
>    {
>      const size_type __size = sizeof(_Rep_base) +
>                        (this->_M_capacity + 1) * sizeof(_CharT);
>      _Raw_bytes_alloc(__a).deallocate(reinterpret_cast<char*>(this), __size);
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_leak_hard()
>    {
>
>      if (_M_rep() == &_S_empty_rep())
> return;
>
>      if (_M_rep()->_M_is_shared())
> _M_mutate(0, 0, 0);
>      _M_rep()->_M_set_leaked();
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_mutate(size_type __pos, size_type __len1, size_type __len2)
>    {
>      const size_type __old_size = this->size();
>      const size_type __new_size = __old_size + __len2 - __len1;
>      const size_type __how_much = __old_size - __pos - __len1;
>
>      if (__new_size > this->capacity() || _M_rep()->_M_is_shared())
> {
>
>   const allocator_type __a = get_allocator();
>   _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a);
>
>   if (__pos)
>     _M_copy(__r->_M_refdata(), _M_data(), __pos);
>   if (__how_much)
>     _M_copy(__r->_M_refdata() + __pos + __len2,
>      _M_data() + __pos + __len1, __how_much);
>
>   _M_rep()->_M_dispose(__a);
>   _M_data(__r->_M_refdata());
> }
>      else if (__how_much && __len1 != __len2)
> {
>
>   _M_move(_M_data() + __pos + __len2,
>    _M_data() + __pos + __len1, __how_much);
> }
>      _M_rep()->_M_set_length_and_sharable(__new_size);
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    reserve(size_type __res)
>    {
>      if (__res != this->capacity() || _M_rep()->_M_is_shared())
>        {
>
>   if (__res < this->size())
>     __res = this->size();
>   const allocator_type __a = get_allocator();
>   _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size());
>   _M_rep()->_M_dispose(__a);
>   _M_data(__tmp);
>        }
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    swap(basic_string& __s)
>    {
>      if (_M_rep()->_M_is_leaked())
> _M_rep()->_M_set_sharable();
>      if (__s._M_rep()->_M_is_leaked())
> __s._M_rep()->_M_set_sharable();
>      if (this->get_allocator() == __s.get_allocator())
> {
>   _CharT* __tmp = _M_data();
>   _M_data(__s._M_data());
>   __s._M_data(__tmp);
> }
>
>      else
> {
>   const basic_string __tmp1(_M_ibegin(), _M_iend(),
>        __s.get_allocator());
>   const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
>        this->get_allocator());
>   *this = __tmp2;
>   __s = __tmp1;
> }
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::_Rep*
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::
>    _S_create(size_type __capacity, size_type __old_capacity,
>       const _Alloc& __alloc)
>    {
>
>
>      if (__capacity > _S_max_size)
> __throw_length_error(("basic_string::_S_create"));
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_string.tcc" 3
>      const size_type __pagesize = 4096;
>      const size_type __malloc_header_size = 4 * sizeof(void*);
>
>
>
>
>
>
>
>      if (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
> __capacity = 2 * __old_capacity;
>
>
>
>
>      size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep);
>
>      const size_type __adj_size = __size + __malloc_header_size;
>      if (__adj_size > __pagesize && __capacity > __old_capacity)
> {
>   const size_type __extra = __pagesize - __adj_size % __pagesize;
>   __capacity += __extra / sizeof(_CharT);
>
>   if (__capacity > _S_max_size)
>     __capacity = _S_max_size;
>   __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep);
> }
>
>
>
>      void* __place = _Raw_bytes_alloc(__alloc).allocate(__size);
>      _Rep *__p = new (__place) _Rep;
>      __p->_M_capacity = __capacity;
>
>
>
>
>
>
>
>      __p->_M_set_sharable();
>      return __p;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    _CharT*
>    basic_string<_CharT, _Traits, _Alloc>::_Rep::
>    _M_clone(const _Alloc& __alloc, size_type __res)
>    {
>
>      const size_type __requested_cap = this->_M_length + __res;
>      _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity,
>      __alloc);
>      if (this->_M_length)
> _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length);
>
>      __r->_M_set_length_and_sharable(this->_M_length);
>      return __r->_M_refdata();
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    void
>    basic_string<_CharT, _Traits, _Alloc>::
>    resize(size_type __n, _CharT __c)
>    {
>      const size_type __size = this->size();
>      _M_check_length(__size, __n, "basic_string::resize");
>      if (__size < __n)
> this->append(__n - __size, __c);
>      else if (__n < __size)
> this->erase(__n);
>
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    template<typename _InputIterator>
>      basic_string<_CharT, _Traits, _Alloc>&
>      basic_string<_CharT, _Traits, _Alloc>::
>      _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
>     _InputIterator __k2, __false_type)
>      {
> const basic_string __s(__k1, __k2);
> const size_type __n1 = __i2 - __i1;
> _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch");
> return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(),
>          __s.size());
>      }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
>     _CharT __c)
>    {
>      _M_check_length(__n1, __n2, "basic_string::_M_replace_aux");
>      _M_mutate(__pos1, __n1, __n2);
>      if (__n2)
> _M_assign(_M_data() + __pos1, __n2, __c);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>&
>    basic_string<_CharT, _Traits, _Alloc>::
>    _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
>      size_type __n2)
>    {
>      _M_mutate(__pos1, __n1, __n2);
>      if (__n2)
> _M_copy(_M_data() + __pos1, __s, __n2);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>
>    operator+(const _CharT* __lhs,
>       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    {
>      ;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>      const __size_type __len = _Traits::length(__lhs);
>      __string_type __str;
>      __str.reserve(__len + __rhs.size());
>      __str.append(__lhs, __len);
>      __str.append(__rhs);
>      return __str;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_string<_CharT, _Traits, _Alloc>
>    operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs)
>    {
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>      __string_type __str;
>      const __size_type __len = __rhs.size();
>      __str.reserve(__len + 1);
>      __str.append(__size_type(1), __lhs);
>      __str.append(__rhs);
>      return __str;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    copy(_CharT* __s, size_type __n, size_type __pos) const
>    {
>      _M_check(__pos, "basic_string::copy");
>      __n = _M_limit(__pos, __n);
>      ;
>      if (__n)
> _M_copy(__s, _M_data() + __pos, __n);
>
>      return __n;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      size_type __ret = npos;
>      const size_type __size = this->size();
>      if (__pos + __n <= __size)
> {
>   const _CharT* __data = _M_data();
>   const _CharT* __p = std::search(__data + __pos, __data + __size,
>       __s, __s + __n, traits_type::eq);
>   if (__p != __data + __size || __n == 0)
>     __ret = __p - __data;
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find(_CharT __c, size_type __pos) const
>    {
>      size_type __ret = npos;
>      const size_type __size = this->size();
>      if (__pos < __size)
> {
>   const _CharT* __data = _M_data();
>   const size_type __n = __size - __pos;
>   const _CharT* __p = traits_type::find(__data + __pos, __n, __c);
>   if (__p)
>     __ret = __p - __data;
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    rfind(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      const size_type __size = this->size();
>      if (__n <= __size)
> {
>   __pos = std::min(size_type(__size - __n), __pos);
>   const _CharT* __data = _M_data();
>   do
>     {
>       if (traits_type::compare(__data + __pos, __s, __n) == 0)
>  return __pos;
>     }
>   while (__pos-- > 0);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    rfind(_CharT __c, size_type __pos) const
>    {
>      size_type __size = this->size();
>      if (__size)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   for (++__size; __size-- > 0; )
>     if (traits_type::eq(_M_data()[__size], __c))
>       return __size;
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_first_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      for (; __n && __pos < this->size(); ++__pos)
> {
>   const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]);
>   if (__p)
>     return __pos;
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_last_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      size_type __size = this->size();
>      if (__size && __n)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   do
>     {
>       if (traits_type::find(__s, __n, _M_data()[__size]))
>  return __size;
>     }
>   while (__size-- != 0);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      for (; __pos < this->size(); ++__pos)
> if (!traits_type::find(__s, __n, _M_data()[__pos]))
>   return __pos;
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_first_not_of(_CharT __c, size_type __pos) const
>    {
>      for (; __pos < this->size(); ++__pos)
> if (!traits_type::eq(_M_data()[__pos], __c))
>   return __pos;
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const
>    {
>      ;
>      size_type __size = this->size();
>      if (__size)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   do
>     {
>       if (!traits_type::find(__s, __n, _M_data()[__size]))
>  return __size;
>     }
>   while (__size--);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    typename basic_string<_CharT, _Traits, _Alloc>::size_type
>    basic_string<_CharT, _Traits, _Alloc>::
>    find_last_not_of(_CharT __c, size_type __pos) const
>    {
>      size_type __size = this->size();
>      if (__size)
> {
>   if (--__size > __pos)
>     __size = __pos;
>   do
>     {
>       if (!traits_type::eq(_M_data()[__size], __c))
>  return __size;
>     }
>   while (__size--);
> }
>      return npos;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string<_CharT, _Traits, _Alloc>::
>    compare(size_type __pos, size_type __n, const basic_string& __str) const
>    {
>      _M_check(__pos, "basic_string::compare");
>      __n = _M_limit(__pos, __n);
>      const size_type __osize = __str.size();
>      const size_type __len = std::min(__n, __osize);
>      int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len);
>      if (!__r)
> __r = __n - __osize;
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string<_CharT, _Traits, _Alloc>::
>    compare(size_type __pos1, size_type __n1, const basic_string& __str,
>     size_type __pos2, size_type __n2) const
>    {
>      _M_check(__pos1, "basic_string::compare");
>      __str._M_check(__pos2, "basic_string::compare");
>      __n1 = _M_limit(__pos1, __n1);
>      __n2 = __str._M_limit(__pos2, __n2);
>      const size_type __len = std::min(__n1, __n2);
>      int __r = traits_type::compare(_M_data() + __pos1,
>         __str.data() + __pos2, __len);
>      if (!__r)
> __r = __n1 - __n2;
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string<_CharT, _Traits, _Alloc>::
>    compare(const _CharT* __s) const
>    {
>      ;
>      const size_type __size = this->size();
>      const size_type __osize = traits_type::length(__s);
>      const size_type __len = std::min(__size, __osize);
>      int __r = traits_type::compare(_M_data(), __s, __len);
>      if (!__r)
> __r = __size - __osize;
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string <_CharT, _Traits, _Alloc>::
>    compare(size_type __pos, size_type __n1, const _CharT* __s) const
>    {
>      ;
>      _M_check(__pos, "basic_string::compare");
>      __n1 = _M_limit(__pos, __n1);
>      const size_type __osize = traits_type::length(__s);
>      const size_type __len = std::min(__n1, __osize);
>      int __r = traits_type::compare(_M_data() + __pos, __s, __len);
>      if (!__r)
> __r = __n1 - __osize;
>      return __r;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    int
>    basic_string <_CharT, _Traits, _Alloc>::
>    compare(size_type __pos, size_type __n1, const _CharT* __s,
>     size_type __n2) const
>    {
>      ;
>      _M_check(__pos, "basic_string::compare");
>      __n1 = _M_limit(__pos, __n1);
>      const size_type __len = std::min(__n1, __n2);
>      int __r = traits_type::compare(_M_data() + __pos, __s, __len);
>      if (!__r)
> __r = __n1 - __n2;
>      return __r;
>    }
>
>
>
>
>
>  extern template class basic_string<char>;
>  extern template
>    basic_istream<char>&
>    operator>>(basic_istream<char>&, string&);
>  extern template
>    basic_ostream<char>&
>    operator<<(basic_ostream<char>&, const string&);
>  extern template
>    basic_istream<char>&
>    getline(basic_istream<char>&, string&, char);
>  extern template
>    basic_istream<char>&
>    getline(basic_istream<char>&, string&);
>
>
>  extern template class basic_string<wchar_t>;
>  extern template
>    basic_istream<wchar_t>&
>    operator>>(basic_istream<wchar_t>&, wstring&);
>  extern template
>    basic_ostream<wchar_t>&
>    operator<<(basic_ostream<wchar_t>&, const wstring&);
>  extern template
>    basic_istream<wchar_t>&
>    getline(basic_istream<wchar_t>&, wstring&, wchar_t);
>  extern template
>    basic_istream<wchar_t>&
>    getline(basic_istream<wchar_t>&, wstring&);
>
>
>}
># 57 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/string" 2 3
># 52 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 3
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/localefwd.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/localefwd.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/localefwd.h" 3
>
>
>
>
>
>
>namespace std
>{
>
>  class locale;
>
>
>  template<typename _CharT>
>    inline bool
>    isspace(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isprint(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    iscntrl(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isupper(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    islower(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isalpha(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isdigit(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    ispunct(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isxdigit(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isalnum(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline bool
>    isgraph(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline _CharT
>    toupper(_CharT, const locale&);
>
>  template<typename _CharT>
>    inline _CharT
>    tolower(_CharT, const locale&);
>
>
>  class ctype_base;
>  template<typename _CharT>
>    class ctype;
>  template<> class ctype<char>;
>
>  template<> class ctype<wchar_t>;
>
>  template<typename _CharT>
>    class ctype_byname;
>
>
>  class codecvt_base;
>  class __enc_traits;
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt;
>  template<> class codecvt<char, char, mbstate_t>;
>
>  template<> class codecvt<wchar_t, char, mbstate_t>;
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt_byname;
>
>
>
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class num_get;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class num_put;
>
>  template<typename _CharT> class numpunct;
>  template<typename _CharT> class numpunct_byname;
>
>
>  template<typename _CharT>
>    class collate;
>  template<typename _CharT> class
>    collate_byname;
>
>
>  class time_base;
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class time_get;
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class time_get_byname;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class time_put;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class time_put_byname;
>
>
>  class money_base;
>
>  template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> >
>    class money_get;
>  template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> >
>    class money_put;
>
>  template<typename _CharT, bool _Intl = false>
>    class moneypunct;
>  template<typename _CharT, bool _Intl = false>
>    class moneypunct_byname;
>
>
>  class messages_base;
>  template<typename _CharT>
>    class messages;
>  template<typename _CharT>
>    class messages_byname;
>
>  template<typename _Facet>
>    bool
>    has_facet(const locale& __loc) throw();
>
>  template<typename _Facet>
>    const _Facet&
>    use_facet(const locale& __loc);
>
>  template<typename _Facet>
>    inline const _Facet&
>    __check_facet(const _Facet* __f)
>    {
>      if (!__f)
> __throw_bad_cast();
>      return *__f;
>    }
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>
>
>
>
>
>
>
>namespace std
>{
># 67 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>  class locale
>  {
>  public:
>
>
>    typedef int category;
>
>
>    class facet;
>    class id;
>    class _Impl;
>
>    friend class facet;
>    friend class _Impl;
>
>    template<typename _Facet>
>      friend bool
>      has_facet(const locale&) throw();
>
>    template<typename _Facet>
>      friend const _Facet&
>      use_facet(const locale&);
>
>    template<typename _Cache>
>      friend struct __use_cache;
># 105 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    static const category none = 0;
>    static const category ctype = 1L << 0;
>    static const category numeric = 1L << 1;
>    static const category collate = 1L << 2;
>    static const category time = 1L << 3;
>    static const category monetary = 1L << 4;
>    static const category messages = 1L << 5;
>    static const category all = (ctype | numeric | collate |
>        time | monetary | messages);
># 124 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale() throw();
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale(const locale& __other) throw();
># 143 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    explicit
>    locale(const char* __s);
># 158 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale(const locale& __base, const char* __s, category __cat);
># 171 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    locale(const locale& __base, const locale& __add, category __cat);
># 183 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    template<typename _Facet>
>      locale(const locale& __other, _Facet* __f);
>
>
>    ~locale() throw();
># 197 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    const locale&
>    operator=(const locale& __other) throw();
># 212 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    template<typename _Facet>
>      locale
>      combine(const locale& __other) const;
>
>
>
>
>
>
>    string
>    name() const;
># 231 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    bool
>    operator==(const locale& __other) const throw ();
>
>
>
>
>
>
>
>    inline bool
>    operator!=(const locale& __other) const throw ()
>    { return !(this->operator==(__other)); }
># 259 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    template<typename _Char, typename _Traits, typename _Alloc>
>      bool
>      operator()(const basic_string<_Char, _Traits, _Alloc>& __s1,
>   const basic_string<_Char, _Traits, _Alloc>& __s2) const;
># 275 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    static locale
>    global(const locale&);
>
>
>
>
>    static const locale&
>    classic();
>
>  private:
>
>    _Impl* _M_impl;
>
>
>    static _Impl* _S_classic;
>
>
>    static _Impl* _S_global;
>
>
>
>
>
>    static const char* const* const _S_categories;
># 310 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    enum { _S_categories_size = 6 + 6 };
>
>
>    static __gthread_once_t _S_once;
>
>
>    explicit
>    locale(_Impl*) throw();
>
>    static void
>    _S_initialize();
>
>    static void
>    _S_initialize_once();
>
>    static category
>    _S_normalize_category(category);
>
>    void
>    _M_coalesce(const locale& __base, const locale& __add, category __cat);
>  };
># 343 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>  class locale::facet
>  {
>  private:
>    friend class locale;
>    friend class locale::_Impl;
>
>    mutable _Atomic_word _M_refcount;
>
>
>    static __c_locale _S_c_locale;
>
>
>    static const char _S_c_name[2];
>
>
>    static __gthread_once_t _S_once;
>
>
>    static void
>    _S_initialize_once();
>
>  protected:
># 374 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>    explicit
>    facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0)
>    { }
>
>
>    virtual
>    ~facet();
>
>    static void
>    _S_create_c_locale(__c_locale& __cloc, const char* __s,
>         __c_locale __old = 0);
>
>    static __c_locale
>    _S_clone_c_locale(__c_locale& __cloc);
>
>    static void
>    _S_destroy_c_locale(__c_locale& __cloc);
>
>
>
>    static __c_locale
>    _S_get_c_locale();
>
>    static const char*
>    _S_get_c_name();
>
>  private:
>    inline void
>    _M_add_reference() const throw()
>    { __gnu_cxx::__atomic_add(&_M_refcount, 1); }
>
>    inline void
>    _M_remove_reference() const throw()
>    {
>      if (__gnu_cxx::__exchange_and_add(&_M_refcount, -1) == 1)
> {
>   try
>     { delete this; }
>   catch (...)
>     { }
> }
>    }
>
>    facet(const facet&);
>
>    facet&
>    operator=(const facet&);
>  };
># 434 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_classes.h" 3
>  class locale::id
>  {
>  private:
>    friend class locale;
>    friend class locale::_Impl;
>
>    template<typename _Facet>
>      friend const _Facet&
>      use_facet(const locale&);
>
>    template<typename _Facet>
>      friend bool
>      has_facet(const locale&) throw ();
>
>
>
>
>    mutable size_t _M_index;
>
>
>    static _Atomic_word _S_refcount;
>
>    void
>    operator=(const id&);
>
>    id(const id&);
>
>  public:
>
>
>
>    id() { }
>
>    size_t
>    _M_id() const;
>  };
>
>
>
>  class locale::_Impl
>  {
>  public:
>
>    friend class locale;
>    friend class locale::facet;
>
>    template<typename _Facet>
>      friend bool
>      has_facet(const locale&) throw();
>
>    template<typename _Facet>
>      friend const _Facet&
>      use_facet(const locale&);
>
>    template<typename _Cache>
>      friend struct __use_cache;
>
>  private:
>
>    _Atomic_word _M_refcount;
>    const facet** _M_facets;
>    size_t _M_facets_size;
>    const facet** _M_caches;
>    char** _M_names;
>    static const locale::id* const _S_id_ctype[];
>    static const locale::id* const _S_id_numeric[];
>    static const locale::id* const _S_id_collate[];
>    static const locale::id* const _S_id_time[];
>    static const locale::id* const _S_id_monetary[];
>    static const locale::id* const _S_id_messages[];
>    static const locale::id* const* const _S_facet_categories[];
>
>    inline void
>    _M_add_reference() throw()
>    { __gnu_cxx::__atomic_add(&_M_refcount, 1); }
>
>    inline void
>    _M_remove_reference() throw()
>    {
>      if (__gnu_cxx::__exchange_and_add(&_M_refcount, -1) == 1)
> {
>   try
>     { delete this; }
>   catch(...)
>     { }
> }
>    }
>
>    _Impl(const _Impl&, size_t);
>    _Impl(const char*, size_t);
>    _Impl(size_t) throw();
>
>   ~_Impl() throw();
>
>    _Impl(const _Impl&);
>
>    void
>    operator=(const _Impl&);
>
>    inline bool
>    _M_check_same_name()
>    {
>      bool __ret = true;
>      if (_M_names[1])
>
> for (size_t __i = 0; __ret && __i < _S_categories_size - 1; ++__i)
>   __ret = std::strcmp(_M_names[__i], _M_names[__i + 1]) == 0;
>      return __ret;
>    }
>
>    void
>    _M_replace_categories(const _Impl*, category);
>
>    void
>    _M_replace_category(const _Impl*, const locale::id* const*);
>
>    void
>    _M_replace_facet(const _Impl*, const locale::id*);
>
>    void
>    _M_install_facet(const locale::id*, const facet*);
>
>    template<typename _Facet>
>      inline void
>      _M_init_facet(_Facet* __facet)
>      { _M_install_facet(&_Facet::id, __facet); }
>
>    void
>    _M_install_cache(const facet*, size_t);
>  };
>
>  template<typename _Facet>
>    locale::locale(const locale& __other, _Facet* __f)
>    {
>      _M_impl = new _Impl(*__other._M_impl, 1);
>
>      try
> { _M_impl->_M_install_facet(&_Facet::id, __f); }
>      catch(...)
> {
>   _M_impl->_M_remove_reference();
>   throw;
> }
>      delete [] _M_impl->_M_names[0];
>      _M_impl->_M_names[0] = 0;
>    }
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 2 3
>
>namespace std
>{
>
>
>
>
>  enum _Ios_Fmtflags
>    {
>      _S_boolalpha = 1L << 0,
>      _S_dec = 1L << 1,
>      _S_fixed = 1L << 2,
>      _S_hex = 1L << 3,
>      _S_internal = 1L << 4,
>      _S_left = 1L << 5,
>      _S_oct = 1L << 6,
>      _S_right = 1L << 7,
>      _S_scientific = 1L << 8,
>      _S_showbase = 1L << 9,
>      _S_showpoint = 1L << 10,
>      _S_showpos = 1L << 11,
>      _S_skipws = 1L << 12,
>      _S_unitbuf = 1L << 13,
>      _S_uppercase = 1L << 14,
>      _S_adjustfield = _S_left | _S_right | _S_internal,
>      _S_basefield = _S_dec | _S_oct | _S_hex,
>      _S_floatfield = _S_scientific | _S_fixed,
>      _S_ios_fmtflags_end = 1L << 16
>    };
>
>  inline _Ios_Fmtflags
>  operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
>  { return _Ios_Fmtflags(static_cast<int>(__a) & static_cast<int>(__b)); }
>
>  inline _Ios_Fmtflags
>  operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
>  { return _Ios_Fmtflags(static_cast<int>(__a) | static_cast<int>(__b)); }
>
>  inline _Ios_Fmtflags
>  operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
>  { return _Ios_Fmtflags(static_cast<int>(__a) ^ static_cast<int>(__b)); }
>
>  inline _Ios_Fmtflags&
>  operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
>  { return __a = __a | __b; }
>
>  inline _Ios_Fmtflags&
>  operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
>  { return __a = __a & __b; }
>
>  inline _Ios_Fmtflags&
>  operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)
>  { return __a = __a ^ __b; }
>
>  inline _Ios_Fmtflags
>  operator~(_Ios_Fmtflags __a)
>  { return _Ios_Fmtflags(~static_cast<int>(__a)); }
>
>
>  enum _Ios_Openmode
>    {
>      _S_app = 1L << 0,
>      _S_ate = 1L << 1,
>      _S_bin = 1L << 2,
>      _S_in = 1L << 3,
>      _S_out = 1L << 4,
>      _S_trunc = 1L << 5,
>      _S_ios_openmode_end = 1L << 16
>    };
>
>  inline _Ios_Openmode
>  operator&(_Ios_Openmode __a, _Ios_Openmode __b)
>  { return _Ios_Openmode(static_cast<int>(__a) & static_cast<int>(__b)); }
>
>  inline _Ios_Openmode
>  operator|(_Ios_Openmode __a, _Ios_Openmode __b)
>  { return _Ios_Openmode(static_cast<int>(__a) | static_cast<int>(__b)); }
>
>  inline _Ios_Openmode
>  operator^(_Ios_Openmode __a, _Ios_Openmode __b)
>  { return _Ios_Openmode(static_cast<int>(__a) ^ static_cast<int>(__b)); }
>
>  inline _Ios_Openmode&
>  operator|=(_Ios_Openmode& __a, _Ios_Openmode __b)
>  { return __a = __a | __b; }
>
>  inline _Ios_Openmode&
>  operator&=(_Ios_Openmode& __a, _Ios_Openmode __b)
>  { return __a = __a & __b; }
>
>  inline _Ios_Openmode&
>  operator^=(_Ios_Openmode& __a, _Ios_Openmode __b)
>  { return __a = __a ^ __b; }
>
>  inline _Ios_Openmode
>  operator~(_Ios_Openmode __a)
>  { return _Ios_Openmode(~static_cast<int>(__a)); }
>
>
>  enum _Ios_Iostate
>    {
>      _S_goodbit = 0,
>      _S_badbit = 1L << 0,
>      _S_eofbit = 1L << 1,
>      _S_failbit = 1L << 2,
>      _S_ios_iostate_end = 1L << 16
>    };
>
>  inline _Ios_Iostate
>  operator&(_Ios_Iostate __a, _Ios_Iostate __b)
>  { return _Ios_Iostate(static_cast<int>(__a) & static_cast<int>(__b)); }
>
>  inline _Ios_Iostate
>  operator|(_Ios_Iostate __a, _Ios_Iostate __b)
>  { return _Ios_Iostate(static_cast<int>(__a) | static_cast<int>(__b)); }
>
>  inline _Ios_Iostate
>  operator^(_Ios_Iostate __a, _Ios_Iostate __b)
>  { return _Ios_Iostate(static_cast<int>(__a) ^ static_cast<int>(__b)); }
>
>  inline _Ios_Iostate&
>  operator|=(_Ios_Iostate& __a, _Ios_Iostate __b)
>  { return __a = __a | __b; }
>
>  inline _Ios_Iostate&
>  operator&=(_Ios_Iostate& __a, _Ios_Iostate __b)
>  { return __a = __a & __b; }
>
>  inline _Ios_Iostate&
>  operator^=(_Ios_Iostate& __a, _Ios_Iostate __b)
>  { return __a = __a ^ __b; }
>
>  inline _Ios_Iostate
>  operator~(_Ios_Iostate __a)
>  { return _Ios_Iostate(~static_cast<int>(__a)); }
>
>  enum _Ios_Seekdir
>    {
>      _S_beg = 0,
>      _S_cur = 1,
>      _S_end = 2,
>      _S_ios_seekdir_end = 1L << 16
>    };
># 201 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>  class ios_base
>  {
>  public:
>
>
>
>    class failure : public exception
>    {
>    public:
>
>
>      explicit
>      failure(const string& __str) throw();
>
>
>
>      virtual
>      ~failure() throw();
>
>      virtual const char*
>      what() const throw();
>
>    private:
>      string _M_msg;
>    };
># 253 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    typedef _Ios_Fmtflags fmtflags;
>
>
>    static const fmtflags boolalpha = _S_boolalpha;
>
>
>    static const fmtflags dec = _S_dec;
>
>
>    static const fmtflags fixed = _S_fixed;
>
>
>    static const fmtflags hex = _S_hex;
>
>
>
>
>    static const fmtflags internal = _S_internal;
>
>
>
>    static const fmtflags left = _S_left;
>
>
>    static const fmtflags oct = _S_oct;
>
>
>
>    static const fmtflags right = _S_right;
>
>
>    static const fmtflags scientific = _S_scientific;
>
>
>
>    static const fmtflags showbase = _S_showbase;
>
>
>
>    static const fmtflags showpoint = _S_showpoint;
>
>
>    static const fmtflags showpos = _S_showpos;
>
>
>    static const fmtflags skipws = _S_skipws;
>
>
>    static const fmtflags unitbuf = _S_unitbuf;
>
>
>
>    static const fmtflags uppercase = _S_uppercase;
>
>
>    static const fmtflags adjustfield = _S_adjustfield;
>
>
>    static const fmtflags basefield = _S_basefield;
>
>
>    static const fmtflags floatfield = _S_floatfield;
># 328 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    typedef _Ios_Iostate iostate;
>
>
>
>    static const iostate badbit = _S_badbit;
>
>
>    static const iostate eofbit = _S_eofbit;
>
>
>
>
>    static const iostate failbit = _S_failbit;
>
>
>    static const iostate goodbit = _S_goodbit;
># 359 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    typedef _Ios_Openmode openmode;
>
>
>    static const openmode app = _S_app;
>
>
>    static const openmode ate = _S_ate;
>
>
>
>
>
>    static const openmode binary = _S_bin;
>
>
>    static const openmode in = _S_in;
>
>
>    static const openmode out = _S_out;
>
>
>    static const openmode trunc = _S_trunc;
># 392 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    typedef _Ios_Seekdir seekdir;
>
>
>    static const seekdir beg = _S_beg;
>
>
>    static const seekdir cur = _S_cur;
>
>
>    static const seekdir end = _S_end;
>
>
>    typedef int io_state;
>    typedef int open_mode;
>    typedef int seek_dir;
>
>    typedef std::streampos streampos;
>    typedef std::streamoff streamoff;
># 418 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    enum event
>    {
>      erase_event,
>      imbue_event,
>      copyfmt_event
>    };
># 435 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    typedef void (*event_callback) (event, ios_base&, int);
># 447 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    void
>    register_callback(event_callback __fn, int __index);
>
>  protected:
>
>
>
>
>
>
>    streamsize _M_precision;
>    streamsize _M_width;
>    fmtflags _M_flags;
>    iostate _M_exception;
>    iostate _M_streambuf_state;
>
>
>
>
>    struct _Callback_list
>    {
>
>      _Callback_list* _M_next;
>      ios_base::event_callback _M_fn;
>      int _M_index;
>      _Atomic_word _M_refcount;
>
>      _Callback_list(ios_base::event_callback __fn, int __index,
>       _Callback_list* __cb)
>      : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { }
>
>      void
>      _M_add_reference() { __gnu_cxx::__atomic_add(&_M_refcount, 1); }
>
>
>      int
>      _M_remove_reference()
>      { return __gnu_cxx::__exchange_and_add(&_M_refcount, -1); }
>    };
>
>     _Callback_list* _M_callbacks;
>
>    void
>    _M_call_callbacks(event __ev) throw();
>
>    void
>    _M_dispose_callbacks(void);
>
>
>    struct _Words
>    {
>      void* _M_pword;
>      long _M_iword;
>      _Words() : _M_pword(0), _M_iword(0) { }
>    };
>
>
>    _Words _M_word_zero;
>
>
>
>    enum { _S_local_word_size = 8 };
>    _Words _M_local_word[_S_local_word_size];
>
>
>    int _M_word_size;
>    _Words* _M_word;
>
>    _Words&
>    _M_grow_words(int __index, bool __iword);
>
>
>    locale _M_ios_locale;
>
>    void
>    _M_init();
>
>  public:
>
>
>
>
>
>    class Init
>    {
>      friend class ios_base;
>    public:
>      Init();
>      ~Init();
>
>    private:
>      static _Atomic_word _S_refcount;
>      static bool _S_synced_with_stdio;
>    };
>
>
>
>
>
>
>    inline fmtflags
>    flags() const { return _M_flags; }
># 557 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline fmtflags
>    flags(fmtflags __fmtfl)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags = __fmtfl;
>      return __old;
>    }
># 573 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline fmtflags
>    setf(fmtflags __fmtfl)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags |= __fmtfl;
>      return __old;
>    }
># 590 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline fmtflags
>    setf(fmtflags __fmtfl, fmtflags __mask)
>    {
>      fmtflags __old = _M_flags;
>      _M_flags &= ~__mask;
>      _M_flags |= (__fmtfl & __mask);
>      return __old;
>    }
>
>
>
>
>
>
>
>    inline void
>    unsetf(fmtflags __mask) { _M_flags &= ~__mask; }
># 617 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline streamsize
>    precision() const { return _M_precision; }
>
>
>
>
>
>
>    inline streamsize
>    precision(streamsize __prec)
>    {
>      streamsize __old = _M_precision;
>      _M_precision = __prec;
>      return __old;
>    }
>
>
>
>
>
>
>
>    inline streamsize
>    width() const { return _M_width; }
>
>
>
>
>
>
>    inline streamsize
>    width(streamsize __wide)
>    {
>      streamsize __old = _M_width;
>      _M_width = __wide;
>      return __old;
>    }
># 666 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    static bool
>    sync_with_stdio(bool __sync = true);
># 678 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    locale
>    imbue(const locale& __loc);
># 689 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline locale
>    getloc() const { return _M_ios_locale; }
># 699 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline const locale&
>    _M_getloc() const { return _M_ios_locale; }
># 717 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    static int
>    xalloc() throw();
># 733 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline long&
>    iword(int __ix)
>    {
>      _Words& __word = (__ix < _M_word_size)
>   ? _M_word[__ix] : _M_grow_words(__ix, true);
>      return __word._M_iword;
>    }
># 754 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    inline void*&
>    pword(int __ix)
>    {
>      _Words& __word = (__ix < _M_word_size)
>   ? _M_word[__ix] : _M_grow_words(__ix, false);
>      return __word._M_pword;
>    }
># 771 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ios_base.h" 3
>    virtual ~ios_base();
>
>  protected:
>    ios_base();
>
>
>
>  private:
>    ios_base(const ios_base&);
>
>    ios_base&
>    operator=(const ios_base&);
>  };
>
>
>
>  inline ios_base&
>  boolalpha(ios_base& __base)
>  {
>    __base.setf(ios_base::boolalpha);
>    return __base;
>  }
>
>
>  inline ios_base&
>  noboolalpha(ios_base& __base)
>  {
>    __base.unsetf(ios_base::boolalpha);
>    return __base;
>  }
>
>
>  inline ios_base&
>  showbase(ios_base& __base)
>  {
>    __base.setf(ios_base::showbase);
>    return __base;
>  }
>
>
>  inline ios_base&
>  noshowbase(ios_base& __base)
>  {
>    __base.unsetf(ios_base::showbase);
>    return __base;
>  }
>
>
>  inline ios_base&
>  showpoint(ios_base& __base)
>  {
>    __base.setf(ios_base::showpoint);
>    return __base;
>  }
>
>
>  inline ios_base&
>  noshowpoint(ios_base& __base)
>  {
>    __base.unsetf(ios_base::showpoint);
>    return __base;
>  }
>
>
>  inline ios_base&
>  showpos(ios_base& __base)
>  {
>    __base.setf(ios_base::showpos);
>    return __base;
>  }
>
>
>  inline ios_base&
>  noshowpos(ios_base& __base)
>  {
>    __base.unsetf(ios_base::showpos);
>    return __base;
>  }
>
>
>  inline ios_base&
>  skipws(ios_base& __base)
>  {
>    __base.setf(ios_base::skipws);
>    return __base;
>  }
>
>
>  inline ios_base&
>  noskipws(ios_base& __base)
>  {
>    __base.unsetf(ios_base::skipws);
>    return __base;
>  }
>
>
>  inline ios_base&
>  uppercase(ios_base& __base)
>  {
>    __base.setf(ios_base::uppercase);
>    return __base;
>  }
>
>
>  inline ios_base&
>  nouppercase(ios_base& __base)
>  {
>    __base.unsetf(ios_base::uppercase);
>    return __base;
>  }
>
>
>  inline ios_base&
>  unitbuf(ios_base& __base)
>  {
>     __base.setf(ios_base::unitbuf);
>     return __base;
>  }
>
>
>  inline ios_base&
>  nounitbuf(ios_base& __base)
>  {
>     __base.unsetf(ios_base::unitbuf);
>     return __base;
>  }
>
>
>
>  inline ios_base&
>  internal(ios_base& __base)
>  {
>     __base.setf(ios_base::internal, ios_base::adjustfield);
>     return __base;
>  }
>
>
>  inline ios_base&
>  left(ios_base& __base)
>  {
>    __base.setf(ios_base::left, ios_base::adjustfield);
>    return __base;
>  }
>
>
>  inline ios_base&
>  right(ios_base& __base)
>  {
>    __base.setf(ios_base::right, ios_base::adjustfield);
>    return __base;
>  }
>
>
>
>  inline ios_base&
>  dec(ios_base& __base)
>  {
>    __base.setf(ios_base::dec, ios_base::basefield);
>    return __base;
>  }
>
>
>  inline ios_base&
>  hex(ios_base& __base)
>  {
>    __base.setf(ios_base::hex, ios_base::basefield);
>    return __base;
>  }
>
>
>  inline ios_base&
>  oct(ios_base& __base)
>  {
>    __base.setf(ios_base::oct, ios_base::basefield);
>    return __base;
>  }
>
>
>
>  inline ios_base&
>  fixed(ios_base& __base)
>  {
>    __base.setf(ios_base::fixed, ios_base::floatfield);
>    return __base;
>  }
>
>
>  inline ios_base&
>  scientific(ios_base& __base)
>  {
>    __base.setf(ios_base::scientific, ios_base::floatfield);
>    return __base;
>  }
>}
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>
>
>
>
>
>
>namespace std
>{
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin,
>        basic_streambuf<_CharT, _Traits>* __sbout);
># 121 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>  template<typename _CharT, typename _Traits>
>    class basic_streambuf
>    {
>    public:
>
>
>
>
>
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
># 144 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      typedef basic_streambuf<char_type, traits_type> __streambuf_type;
>
>
>      friend class basic_ios<char_type, traits_type>;
>      friend class basic_istream<char_type, traits_type>;
>      friend class basic_ostream<char_type, traits_type>;
>      friend class istreambuf_iterator<char_type, traits_type>;
>      friend class ostreambuf_iterator<char_type, traits_type>;
>
>      friend streamsize
>      __copy_streambufs<>(__streambuf_type* __sbin,
>     __streambuf_type* __sbout);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_istream<_CharT2, _Traits2>&
>        operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);
>
>      template<typename _CharT2, typename _Traits2, typename _Alloc>
>        friend basic_istream<_CharT2, _Traits2>&
>        operator>>(basic_istream<_CharT2, _Traits2>&,
>     basic_string<_CharT2, _Traits2, _Alloc>&);
>
>      template<typename _CharT2, typename _Traits2, typename _Alloc>
>        friend basic_istream<_CharT2, _Traits2>&
>        getline(basic_istream<_CharT2, _Traits2>&,
>  basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2);
>
>    protected:
># 182 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      char_type* _M_in_beg;
>      char_type* _M_in_cur;
>      char_type* _M_in_end;
>      char_type* _M_out_beg;
>      char_type* _M_out_cur;
>      char_type* _M_out_end;
>
>
>
>
>
>
>      locale _M_buf_locale;
>
>  public:
>
>      virtual
>      ~basic_streambuf()
>      { }
># 210 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      locale
>      pubimbue(const locale &__loc)
>      {
> locale __tmp(this->getloc());
> this->imbue(__loc);
> _M_buf_locale = __loc;
> return __tmp;
>      }
># 227 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      locale
>      getloc() const
>      { return _M_buf_locale; }
># 240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      __streambuf_type*
>      pubsetbuf(char_type* __s, streamsize __n)
>      { return this->setbuf(__s, __n); }
>
>      pos_type
>      pubseekoff(off_type __off, ios_base::seekdir __way,
>   ios_base::openmode __mode = ios_base::in | ios_base::out)
>      { return this->seekoff(__off, __way, __mode); }
>
>      pos_type
>      pubseekpos(pos_type __sp,
>   ios_base::openmode __mode = ios_base::in | ios_base::out)
>      { return this->seekpos(__sp, __mode); }
>
>      int
>      pubsync() { return this->sync(); }
># 267 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      streamsize
>      in_avail()
>      {
> const streamsize __ret = this->egptr() - this->gptr();
> return __ret ? __ret : this->showmanyc();
>      }
># 281 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      int_type
>      snextc()
>      {
> int_type __ret = traits_type::eof();
> if (__builtin_expect(!traits_type::eq_int_type(this->sbumpc(),
>             __ret), true))
>   __ret = this->sgetc();
> return __ret;
>      }
># 299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      int_type
>      sbumpc()
>      {
> int_type __ret;
> if (__builtin_expect(this->gptr() < this->egptr(), true))
>   {
>     __ret = traits_type::to_int_type(*this->gptr());
>     this->gbump(1);
>   }
> else
>   __ret = this->uflow();
> return __ret;
>      }
># 321 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      int_type
>      sgetc()
>      {
> int_type __ret;
> if (__builtin_expect(this->gptr() < this->egptr(), true))
>   __ret = traits_type::to_int_type(*this->gptr());
> else
>   __ret = this->underflow();
> return __ret;
>      }
># 340 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      streamsize
>      sgetn(char_type* __s, streamsize __n)
>      { return this->xsgetn(__s, __n); }
># 354 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      int_type
>      sputbackc(char_type __c)
>      {
> int_type __ret;
> const bool __testpos = this->eback() < this->gptr();
> if (__builtin_expect(!__testpos ||
>        !traits_type::eq(__c, this->gptr()[-1]), false))
>   __ret = this->pbackfail(traits_type::to_int_type(__c));
> else
>   {
>     this->gbump(-1);
>     __ret = traits_type::to_int_type(*this->gptr());
>   }
> return __ret;
>      }
># 379 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      int_type
>      sungetc()
>      {
> int_type __ret;
> if (__builtin_expect(this->eback() < this->gptr(), true))
>   {
>     this->gbump(-1);
>     __ret = traits_type::to_int_type(*this->gptr());
>   }
> else
>   __ret = this->pbackfail();
> return __ret;
>      }
># 406 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      int_type
>      sputc(char_type __c)
>      {
> int_type __ret;
> if (__builtin_expect(this->pptr() < this->epptr(), true))
>   {
>     *this->pptr() = __c;
>     this->pbump(1);
>     __ret = traits_type::to_int_type(__c);
>   }
> else
>   __ret = this->overflow(traits_type::to_int_type(__c));
> return __ret;
>      }
># 432 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      streamsize
>      sputn(const char_type* __s, streamsize __n)
>      { return this->xsputn(__s, __n); }
>
>    protected:
># 446 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      basic_streambuf()
>      : _M_in_beg(0), _M_in_cur(0), _M_in_end(0),
>      _M_out_beg(0), _M_out_cur(0), _M_out_end(0),
>      _M_buf_locale(locale())
>      { }
># 464 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      char_type*
>      eback() const { return _M_in_beg; }
>
>      char_type*
>      gptr() const { return _M_in_cur; }
>
>      char_type*
>      egptr() const { return _M_in_end; }
># 480 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      gbump(int __n) { _M_in_cur += __n; }
># 491 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      setg(char_type* __gbeg, char_type* __gnext, char_type* __gend)
>      {
> _M_in_beg = __gbeg;
> _M_in_cur = __gnext;
> _M_in_end = __gend;
>      }
># 511 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      char_type*
>      pbase() const { return _M_out_beg; }
>
>      char_type*
>      pptr() const { return _M_out_cur; }
>
>      char_type*
>      epptr() const { return _M_out_end; }
># 527 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      pbump(int __n) { _M_out_cur += __n; }
># 537 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      void
>      setp(char_type* __pbeg, char_type* __pend)
>      {
> _M_out_beg = _M_out_cur = __pbeg;
> _M_out_end = __pend;
>      }
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual void
>      imbue(const locale&)
>      { }
># 573 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual basic_streambuf<char_type,_Traits>*
>      setbuf(char_type*, streamsize)
>      { return this; }
># 584 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual pos_type
>      seekoff(off_type, ios_base::seekdir,
>       ios_base::openmode = ios_base::in | ios_base::out)
>      { return pos_type(off_type(-1)); }
># 596 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual pos_type
>      seekpos(pos_type,
>       ios_base::openmode = ios_base::in | ios_base::out)
>      { return pos_type(off_type(-1)); }
># 609 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int
>      sync() { return 0; }
># 631 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual streamsize
>      showmanyc() { return 0; }
># 647 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual streamsize
>      xsgetn(char_type* __s, streamsize __n);
># 669 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      underflow()
>      { return traits_type::eof(); }
># 682 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      uflow()
>      {
> int_type __ret = traits_type::eof();
> const bool __testeof = traits_type::eq_int_type(this->underflow(),
>       __ret);
> if (!__testeof)
>   {
>     __ret = traits_type::to_int_type(*this->gptr());
>     this->gbump(1);
>   }
> return __ret;
>      }
># 706 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      pbackfail(int_type = traits_type::eof())
>      { return traits_type::eof(); }
># 724 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual streamsize
>      xsputn(const char_type* __s, streamsize __n);
># 749 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>      virtual int_type
>      overflow(int_type = traits_type::eof())
>      { return traits_type::eof(); }
># 778 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 3
>    private:
>
>
>      basic_streambuf(const __streambuf_type& __sb)
>      : _M_in_beg(__sb._M_in_beg), _M_in_cur(__sb._M_in_cur),
>      _M_in_end(__sb._M_in_end), _M_out_beg(__sb._M_out_beg),
>      _M_out_cur(__sb._M_out_cur), _M_out_end(__sb._M_out_cur),
>      _M_buf_locale(__sb._M_buf_locale)
>      { }
>
>      __streambuf_type&
>      operator=(const __streambuf_type&) { return *this; };
>    };
>
>
>  template<>
>    streamsize
>    __copy_streambufs(basic_streambuf<char>* __sbin,
>        basic_streambuf<char>* __sbout);
>
>  template<>
>    streamsize
>    __copy_streambufs(basic_streambuf<wchar_t>* __sbin,
>        basic_streambuf<wchar_t>* __sbout);
>
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf.tcc" 3
>
>namespace std
>{
>  template<typename _CharT, typename _Traits>
>    streamsize
>    basic_streambuf<_CharT, _Traits>::
>    xsgetn(char_type* __s, streamsize __n)
>    {
>      streamsize __ret = 0;
>      while (__ret < __n)
> {
>   const streamsize __buf_len = this->egptr() - this->gptr();
>   if (__buf_len)
>     {
>       const streamsize __remaining = __n - __ret;
>       const streamsize __len = std::min(__buf_len, __remaining);
>       traits_type::copy(__s, this->gptr(), __len);
>       __ret += __len;
>       __s += __len;
>       this->gbump(__len);
>     }
>
>   if (__ret < __n)
>     {
>       const int_type __c = this->uflow();
>       if (!traits_type::eq_int_type(__c, traits_type::eof()))
>  {
>    traits_type::assign(*__s++, traits_type::to_char_type(__c));
>    ++__ret;
>  }
>       else
>  break;
>     }
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    basic_streambuf<_CharT, _Traits>::
>    xsputn(const char_type* __s, streamsize __n)
>    {
>      streamsize __ret = 0;
>      while (__ret < __n)
> {
>   const streamsize __buf_len = this->epptr() - this->pptr();
>   if (__buf_len)
>     {
>       const streamsize __remaining = __n - __ret;
>       const streamsize __len = std::min(__buf_len, __remaining);
>       traits_type::copy(this->pptr(), __s, __len);
>       __ret += __len;
>       __s += __len;
>       this->pbump(__len);
>     }
>
>   if (__ret < __n)
>     {
>       int_type __c = this->overflow(traits_type::to_int_type(*__s));
>       if (!traits_type::eq_int_type(__c, traits_type::eof()))
>  {
>    ++__ret;
>    ++__s;
>  }
>       else
>  break;
>     }
> }
>      return __ret;
>    }
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin,
>        basic_streambuf<_CharT, _Traits>* __sbout)
>    {
>      streamsize __ret = 0;
>      typename _Traits::int_type __c = __sbin->sgetc();
>      while (!_Traits::eq_int_type(__c, _Traits::eof()))
> {
>   __c = __sbout->sputc(_Traits::to_char_type(__c));
>   if (_Traits::eq_int_type(__c, _Traits::eof()))
>     break;
>   ++__ret;
>   __c = __sbin->snextc();
> }
>      return __ret;
>    }
>
>
>
>
>
>  extern template class basic_streambuf<char>;
>  extern template
>    streamsize
>    __copy_streambufs(basic_streambuf<char>*, basic_streambuf<char>*);
>
>
>  extern template class basic_streambuf<wchar_t>;
>  extern template
>    streamsize
>    __copy_streambufs(basic_streambuf<wchar_t>*, basic_streambuf<wchar_t>*);
>
>
>}
># 807 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/streambuf" 2 3
># 50 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf_iterator.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf_iterator.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/streambuf_iterator.h" 3
>
>
>
>
>
>
>namespace std
>{
>
>
>  template<typename _CharT, typename _Traits>
>    class istreambuf_iterator
>    : public iterator<input_iterator_tag, _CharT, typename _Traits::off_type,
>        _CharT*, _CharT&>
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef typename _Traits::int_type int_type;
>      typedef basic_streambuf<_CharT, _Traits> streambuf_type;
>      typedef basic_istream<_CharT, _Traits> istream_type;
>
>
>    private:
>
>
>
>
>
>
>
>      mutable streambuf_type* _M_sbuf;
>      mutable int_type _M_c;
>
>    public:
>
>      istreambuf_iterator() throw()
>      : _M_sbuf(0), _M_c(traits_type::eof()) { }
>
>
>      istreambuf_iterator(istream_type& __s) throw()
>      : _M_sbuf(__s.rdbuf()), _M_c(traits_type::eof()) { }
>
>
>      istreambuf_iterator(streambuf_type* __s) throw()
>      : _M_sbuf(__s), _M_c(traits_type::eof()) { }
>
>
>
>
>      char_type
>      operator*() const
>      {
>
>
>
>
>
>
>
> return traits_type::to_char_type(_M_get());
>      }
>
>
>      istreambuf_iterator&
>      operator++()
>      {
> ;
>
>
> if (_M_sbuf)
>   {
>     _M_sbuf->sbumpc();
>     _M_c = traits_type::eof();
>   }
> return *this;
>      }
>
>
>      istreambuf_iterator
>      operator++(int)
>      {
> ;
>
>
>
> istreambuf_iterator __old = *this;
> if (_M_sbuf)
>   {
>     __old._M_c = _M_sbuf->sbumpc();
>     _M_c = traits_type::eof();
>   }
> return __old;
>      }
>
>
>
>
>
>      bool
>      equal(const istreambuf_iterator& __b) const
>      {
> const bool __thiseof = _M_at_eof();
> const bool __beof = __b._M_at_eof();
> return (__thiseof && __beof || (!__thiseof && !__beof));
>      }
>
>    private:
>      int_type
>      _M_get() const
>      {
> const int_type __eof = traits_type::eof();
> int_type __ret = __eof;
> if (_M_sbuf)
>   {
>     if (!traits_type::eq_int_type(_M_c, __eof))
>       __ret = _M_c;
>     else if (!traits_type::eq_int_type((__ret = _M_sbuf->sgetc()),
>            __eof))
>       _M_c = __ret;
>     else
>       _M_sbuf = 0;
>   }
> return __ret;
>      }
>
>      bool
>      _M_at_eof() const
>      {
> const int_type __eof = traits_type::eof();
> return traits_type::eq_int_type(_M_get(), __eof);
>      }
>    };
>
>  template<typename _CharT, typename _Traits>
>    inline bool
>    operator==(const istreambuf_iterator<_CharT, _Traits>& __a,
>        const istreambuf_iterator<_CharT, _Traits>& __b)
>    { return __a.equal(__b); }
>
>  template<typename _CharT, typename _Traits>
>    inline bool
>    operator!=(const istreambuf_iterator<_CharT, _Traits>& __a,
>        const istreambuf_iterator<_CharT, _Traits>& __b)
>    { return !__a.equal(__b); }
>
>
>  template<typename _CharT, typename _Traits>
>    class ostreambuf_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef basic_streambuf<_CharT, _Traits> streambuf_type;
>      typedef basic_ostream<_CharT, _Traits> ostream_type;
>
>
>    private:
>      streambuf_type* _M_sbuf;
>      bool _M_failed;
>
>    public:
>
>      ostreambuf_iterator(ostream_type& __s) throw ()
>      : _M_sbuf(__s.rdbuf()), _M_failed(!_M_sbuf) { }
>
>
>      ostreambuf_iterator(streambuf_type* __s) throw ()
>      : _M_sbuf(__s), _M_failed(!_M_sbuf) { }
>
>
>      ostreambuf_iterator&
>      operator=(_CharT __c)
>      {
> if (!_M_failed &&
>     _Traits::eq_int_type(_M_sbuf->sputc(__c), _Traits::eof()))
>   _M_failed = true;
> return *this;
>      }
>
>
>      ostreambuf_iterator&
>      operator*()
>      { return *this; }
>
>
>      ostreambuf_iterator&
>      operator++(int)
>      { return *this; }
>
>
>      ostreambuf_iterator&
>      operator++()
>      { return *this; }
>
>
>      bool
>      failed() const throw()
>      { return _M_failed; }
>
>      ostreambuf_iterator&
>      _M_put(const _CharT* __ws, streamsize __len)
>      {
> if (__builtin_expect(!_M_failed, true)
>     && __builtin_expect(this->_M_sbuf->sputn(__ws, __len) != __len,
>    false))
>   _M_failed = true;
> return *this;
>      }
>    };
>}
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 2 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 3
>
>
>
>
># 1 "/usr/include/wctype.h" 1 3 4
># 35 "/usr/include/wctype.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 36 "/usr/include/wctype.h" 2 3 4
># 45 "/usr/include/wctype.h" 3 4
>
># 63 "/usr/include/wctype.h" 3 4
>
>
>
>typedef unsigned long int wctype_t;
>
># 85 "/usr/include/wctype.h" 3 4
>enum
>{
>  __ISwupper = 0,
>  __ISwlower = 1,
>  __ISwalpha = 2,
>  __ISwdigit = 3,
>  __ISwxdigit = 4,
>  __ISwspace = 5,
>  __ISwprint = 6,
>  __ISwgraph = 7,
>  __ISwblank = 8,
>  __ISwcntrl = 9,
>  __ISwpunct = 10,
>  __ISwalnum = 11,
>
>  _ISwupper = ((__ISwupper) < 8 ? (int) ((1UL << (__ISwupper)) << 24) : ((__ISwupper) < 16 ? (int) ((1UL << (__ISwupper)) << 8) : ((__ISwupper) < 24 ? (int) ((1UL << (__ISwupper)) >> 8) : (int) ((1UL << (__ISwupper)) >> 24)))),
>  _ISwlower = ((__ISwlower) < 8 ? (int) ((1UL << (__ISwlower)) << 24) : ((__ISwlower) < 16 ? (int) ((1UL << (__ISwlower)) << 8) : ((__ISwlower) < 24 ? (int) ((1UL << (__ISwlower)) >> 8) : (int) ((1UL << (__ISwlower)) >> 24)))),
>  _ISwalpha = ((__ISwalpha) < 8 ? (int) ((1UL << (__ISwalpha)) << 24) : ((__ISwalpha) < 16 ? (int) ((1UL << (__ISwalpha)) << 8) : ((__ISwalpha) < 24 ? (int) ((1UL << (__ISwalpha)) >> 8) : (int) ((1UL << (__ISwalpha)) >> 24)))),
>  _ISwdigit = ((__ISwdigit) < 8 ? (int) ((1UL << (__ISwdigit)) << 24) : ((__ISwdigit) < 16 ? (int) ((1UL << (__ISwdigit)) << 8) : ((__ISwdigit) < 24 ? (int) ((1UL << (__ISwdigit)) >> 8) : (int) ((1UL << (__ISwdigit)) >> 24)))),
>  _ISwxdigit = ((__ISwxdigit) < 8 ? (int) ((1UL << (__ISwxdigit)) << 24) : ((__ISwxdigit) < 16 ? (int) ((1UL << (__ISwxdigit)) << 8) : ((__ISwxdigit) < 24 ? (int) ((1UL << (__ISwxdigit)) >> 8) : (int) ((1UL << (__ISwxdigit)) >> 24)))),
>  _ISwspace = ((__ISwspace) < 8 ? (int) ((1UL << (__ISwspace)) << 24) : ((__ISwspace) < 16 ? (int) ((1UL << (__ISwspace)) << 8) : ((__ISwspace) < 24 ? (int) ((1UL << (__ISwspace)) >> 8) : (int) ((1UL << (__ISwspace)) >> 24)))),
>  _ISwprint = ((__ISwprint) < 8 ? (int) ((1UL << (__ISwprint)) << 24) : ((__ISwprint) < 16 ? (int) ((1UL << (__ISwprint)) << 8) : ((__ISwprint) < 24 ? (int) ((1UL << (__ISwprint)) >> 8) : (int) ((1UL << (__ISwprint)) >> 24)))),
>  _ISwgraph = ((__ISwgraph) < 8 ? (int) ((1UL << (__ISwgraph)) << 24) : ((__ISwgraph) < 16 ? (int) ((1UL << (__ISwgraph)) << 8) : ((__ISwgraph) < 24 ? (int) ((1UL << (__ISwgraph)) >> 8) : (int) ((1UL << (__ISwgraph)) >> 24)))),
>  _ISwblank = ((__ISwblank) < 8 ? (int) ((1UL << (__ISwblank)) << 24) : ((__ISwblank) < 16 ? (int) ((1UL << (__ISwblank)) << 8) : ((__ISwblank) < 24 ? (int) ((1UL << (__ISwblank)) >> 8) : (int) ((1UL << (__ISwblank)) >> 24)))),
>  _ISwcntrl = ((__ISwcntrl) < 8 ? (int) ((1UL << (__ISwcntrl)) << 24) : ((__ISwcntrl) < 16 ? (int) ((1UL << (__ISwcntrl)) << 8) : ((__ISwcntrl) < 24 ? (int) ((1UL << (__ISwcntrl)) >> 8) : (int) ((1UL << (__ISwcntrl)) >> 24)))),
>  _ISwpunct = ((__ISwpunct) < 8 ? (int) ((1UL << (__ISwpunct)) << 24) : ((__ISwpunct) < 16 ? (int) ((1UL << (__ISwpunct)) << 8) : ((__ISwpunct) < 24 ? (int) ((1UL << (__ISwpunct)) >> 8) : (int) ((1UL << (__ISwpunct)) >> 24)))),
>  _ISwalnum = ((__ISwalnum) < 8 ? (int) ((1UL << (__ISwalnum)) << 24) : ((__ISwalnum) < 16 ? (int) ((1UL << (__ISwalnum)) << 8) : ((__ISwalnum) < 24 ? (int) ((1UL << (__ISwalnum)) >> 8) : (int) ((1UL << (__ISwalnum)) >> 24))))
>};
>
>
>
>extern "C" {
>
>
>
>
>
>
>
>
>extern int iswalnum (wint_t __wc) throw ();
>
>
>
>
>
>extern int iswalpha (wint_t __wc) throw ();
>
>
>extern int iswcntrl (wint_t __wc) throw ();
>
>
>
>extern int iswdigit (wint_t __wc) throw ();
>
>
>
>extern int iswgraph (wint_t __wc) throw ();
>
>
>
>
>extern int iswlower (wint_t __wc) throw ();
>
>
>extern int iswprint (wint_t __wc) throw ();
>
>
>
>
>extern int iswpunct (wint_t __wc) throw ();
>
>
>
>
>extern int iswspace (wint_t __wc) throw ();
>
>
>
>
>extern int iswupper (wint_t __wc) throw ();
>
>
>
>
>extern int iswxdigit (wint_t __wc) throw ();
>
>
>
>
>
>extern int iswblank (wint_t __wc) throw ();
># 185 "/usr/include/wctype.h" 3 4
>extern wctype_t wctype (__const char *__property) throw ();
>
>
>
>extern int iswctype (wint_t __wc, wctype_t __desc) throw ();
>
>
>
>
>
>
>
>
>
>
>typedef __const __int32_t *wctrans_t;
>
>
>
>
>
>
>
>extern wint_t towlower (wint_t __wc) throw ();
>
>
>extern wint_t towupper (wint_t __wc) throw ();
>
>
>}
># 227 "/usr/include/wctype.h" 3 4
>extern "C" {
>
>
>
>
>extern wctrans_t wctrans (__const char *__property) throw ();
>
>
>extern wint_t towctrans (wint_t __wc, wctrans_t __desc) throw ();
>
>
>
>
>
>
>
>
>extern int iswalnum_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>
>extern int iswalpha_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>extern int iswcntrl_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern int iswdigit_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern int iswgraph_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswlower_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>extern int iswprint_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswpunct_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswspace_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswupper_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswxdigit_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>
>extern int iswblank_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern wctype_t wctype_l (__const char *__property, __locale_t __locale)
>     throw ();
>
>
>
>extern int iswctype_l (wint_t __wc, wctype_t __desc, __locale_t __locale)
>     throw ();
>
>
>
>
>
>
>
>extern wint_t towlower_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>extern wint_t towupper_l (wint_t __wc, __locale_t __locale) throw ();
>
>
>
>extern wctrans_t wctrans_l (__const char *__property, __locale_t __locale)
>     throw ();
>
>
>extern wint_t towctrans_l (wint_t __wc, wctrans_t __desc,
>      __locale_t __locale) throw ();
>
>
>
>}
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 2 3
># 79 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cwctype" 3
>namespace std
>{
>  using ::wint_t;
>
>  using ::wctype_t;
>  using ::wctrans_t;
>
>  using ::iswalnum;
>  using ::iswalpha;
>
>  using ::iswblank;
>
>  using ::iswcntrl;
>  using ::iswctype;
>  using ::iswdigit;
>  using ::iswgraph;
>  using ::iswlower;
>  using ::iswprint;
>  using ::iswpunct;
>  using ::iswspace;
>  using ::iswupper;
>  using ::iswxdigit;
>  using ::towctrans;
>  using ::towlower;
>  using ::towupper;
>  using ::wctrans;
>  using ::wctype;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
>
>
>
>
>namespace std
>{
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _Tv>
>    void
>    __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err,
>     const __c_locale& __cloc);
>
>
>  template<>
>    void
>    __convert_to_v(const char*, float&, ios_base::iostate&,
>     const __c_locale&);
>
>  template<>
>    void
>    __convert_to_v(const char*, double&, ios_base::iostate&,
>     const __c_locale&);
>
>  template<>
>    void
>    __convert_to_v(const char*, long double&, ios_base::iostate&,
>     const __c_locale&);
>
>
>
>  template<typename _CharT, typename _Traits>
>    struct __pad
>    {
>      static void
>      _S_pad(ios_base& __io, _CharT __fill, _CharT* __news,
>      const _CharT* __olds, const streamsize __newlen,
>      const streamsize __oldlen, const bool __num);
>    };
>
>
>
>
>
>
>  template<typename _CharT>
>    _CharT*
>    __add_grouping(_CharT* __s, _CharT __sep,
>     const char* __gbeg, size_t __gsize,
>     const _CharT* __first, const _CharT* __last);
>
>
>
>
>  template<typename _CharT>
>    inline
>    ostreambuf_iterator<_CharT>
>    __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len)
>    {
>      __s._M_put(__ws, __len);
>      return __s;
>    }
>
>
>  template<typename _CharT, typename _OutIter>
>    inline
>    _OutIter
>    __write(_OutIter __s, const _CharT* __ws, int __len)
>    {
>      for (int __j = 0; __j < __len; __j++, ++__s)
> *__s = __ws[__j];
>      return __s;
>    }
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_base.h" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_base.h" 3
>  struct ctype_base
>  {
>
>    typedef const int* __to_type;
>
>
>
>    typedef unsigned short mask;
>    static const mask upper = _ISupper;
>    static const mask lower = _ISlower;
>    static const mask alpha = _ISalpha;
>    static const mask digit = _ISdigit;
>    static const mask xdigit = _ISxdigit;
>    static const mask space = _ISspace;
>    static const mask print = _ISprint;
>    static const mask graph = _ISalpha | _ISdigit | _ISpunct;
>    static const mask cntrl = _IScntrl;
>    static const mask punct = _ISpunct;
>    static const mask alnum = _ISalpha | _ISdigit;
>  };
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
># 144 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class __ctype_abstract_base : public locale::facet, public ctype_base
>    {
>    public:
>
>
>      typedef _CharT char_type;
># 162 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      bool
>      is(mask __m, char_type __c) const
>      { return this->do_is(__m, __c); }
># 179 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      is(const char_type *__lo, const char_type *__hi, mask *__vec) const
>      { return this->do_is(__lo, __hi, __vec); }
># 195 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      scan_is(mask __m, const char_type* __lo, const char_type* __hi) const
>      { return this->do_scan_is(__m, __lo, __hi); }
># 211 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      scan_not(mask __m, const char_type* __lo, const char_type* __hi) const
>      { return this->do_scan_not(__m, __lo, __hi); }
># 225 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      toupper(char_type __c) const
>      { return this->do_toupper(__c); }
># 240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      toupper(char_type *__lo, const char_type* __hi) const
>      { return this->do_toupper(__lo, __hi); }
># 254 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      tolower(char_type __c) const
>      { return this->do_tolower(__c); }
># 269 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      tolower(char_type* __lo, const char_type* __hi) const
>      { return this->do_tolower(__lo, __hi); }
># 286 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      widen(char __c) const
>      { return this->do_widen(__c); }
># 305 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char*
>      widen(const char* __lo, const char* __hi, char_type* __to) const
>      { return this->do_widen(__lo, __hi, __to); }
># 324 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char
>      narrow(char_type __c, char __dfault) const
>      { return this->do_narrow(__c, __dfault); }
># 346 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      narrow(const char_type* __lo, const char_type* __hi,
>       char __dfault, char *__to) const
>      { return this->do_narrow(__lo, __hi, __dfault, __to); }
>
>    protected:
>      explicit
>      __ctype_abstract_base(size_t __refs = 0): facet(__refs) { }
>
>      virtual
>      ~__ctype_abstract_base() { }
># 371 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual bool
>      do_is(mask __m, char_type __c) const = 0;
># 390 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_is(const char_type* __lo, const char_type* __hi,
>     mask* __vec) const = 0;
># 409 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_is(mask __m, const char_type* __lo,
>   const char_type* __hi) const = 0;
># 428 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_not(mask __m, const char_type* __lo,
>    const char_type* __hi) const = 0;
># 446 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const = 0;
># 463 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const = 0;
># 479 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const = 0;
># 496 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const = 0;
># 515 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char) const = 0;
># 536 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi,
>        char_type* __dest) const = 0;
># 558 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type, char __dfault) const = 0;
># 582 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char __dfault, char* __dest) const = 0;
>    };
># 605 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class ctype : public __ctype_abstract_base<_CharT>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef typename __ctype_abstract_base<_CharT>::mask mask;
>
>
>      static locale::id id;
>
>      explicit
>      ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { }
>
>   protected:
>      virtual
>      ~ctype();
>
>      virtual bool
>      do_is(mask __m, char_type __c) const;
>
>      virtual const char_type*
>      do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;
>
>      virtual const char_type*
>      do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;
>
>      virtual const char_type*
>      do_scan_not(mask __m, const char_type* __lo,
>    const char_type* __hi) const;
>
>      virtual char_type
>      do_toupper(char_type __c) const;
>
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
>
>      virtual char_type
>      do_tolower(char_type __c) const;
>
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
>
>      virtual char_type
>      do_widen(char __c) const;
>
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi, char_type* __dest) const;
>
>      virtual char
>      do_narrow(char_type, char __dfault) const;
>
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char __dfault, char* __dest) const;
>    };
>
>  template<typename _CharT>
>    locale::id ctype<_CharT>::id;
># 674 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<>
>    class ctype<char> : public locale::facet, public ctype_base
>    {
>    public:
>
>
>      typedef char char_type;
>
>    protected:
>
>      __c_locale _M_c_locale_ctype;
>      bool _M_del;
>      __to_type _M_toupper;
>      __to_type _M_tolower;
>      const mask* _M_table;
>      mutable char _M_widen_ok;
>      mutable char _M_widen[1 + static_cast<unsigned char>(-1)];
>      mutable char _M_narrow[1 + static_cast<unsigned char>(-1)];
>      mutable char _M_narrow_ok;
>
>
>    public:
>
>      static locale::id id;
>
>      static const size_t table_size = 1 + static_cast<unsigned char>(-1);
># 711 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);
># 724 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false,
>     size_t __refs = 0);
># 737 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline bool
>      is(mask __m, char __c) const;
># 752 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline const char*
>      is(const char* __lo, const char* __hi, mask* __vec) const;
># 766 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline const char*
>      scan_is(mask __m, const char* __lo, const char* __hi) const;
># 780 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      inline const char*
>      scan_not(mask __m, const char* __lo, const char* __hi) const;
># 795 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      toupper(char_type __c) const
>      { return this->do_toupper(__c); }
># 812 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      toupper(char_type *__lo, const char_type* __hi) const
>      { return this->do_toupper(__lo, __hi); }
># 828 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      tolower(char_type __c) const
>      { return this->do_tolower(__c); }
># 845 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      tolower(char_type* __lo, const char_type* __hi) const
>      { return this->do_tolower(__lo, __hi); }
># 865 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      widen(char __c) const
>      {
> if (_M_widen_ok)
>   return _M_widen[static_cast<unsigned char>(__c)];
> this->_M_widen_init();
> return this->do_widen(__c);
>      }
># 892 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char*
>      widen(const char* __lo, const char* __hi, char_type* __to) const
>      {
> if (_M_widen_ok == 1)
>   {
>     memcpy(__to, __lo, __hi - __lo);
>     return __hi;
>   }
> if (!_M_widen_ok)
>   _M_widen_init();
> return this->do_widen(__lo, __hi, __to);
>      }
># 923 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char
>      narrow(char_type __c, char __dfault) const
>      {
> if (_M_narrow[static_cast<unsigned char>(__c)])
>   return _M_narrow[static_cast<unsigned char>(__c)];
> const char __t = do_narrow(__c, __dfault);
> if (__t != __dfault)
>   _M_narrow[static_cast<unsigned char>(__c)] = __t;
> return __t;
>      }
># 956 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      const char_type*
>      narrow(const char_type* __lo, const char_type* __hi,
>      char __dfault, char *__to) const
>      {
> if (__builtin_expect(_M_narrow_ok == 1, true))
>   {
>     memcpy(__to, __lo, __hi - __lo);
>     return __hi;
>   }
> if (!_M_narrow_ok)
>   _M_narrow_init();
> return this->do_narrow(__lo, __hi, __dfault, __to);
>      }
>
>    protected:
>
>
>      const mask*
>      table() const throw()
>      { return _M_table; }
>
>
>      static const mask*
>      classic_table() throw();
>
>
>
>
>
>
>
>      virtual
>      ~ctype();
># 1003 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const;
># 1020 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
># 1036 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const;
># 1053 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
># 1073 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char __c) const
>      { return __c; }
># 1096 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi, char_type* __dest) const
>      {
> memcpy(__dest, __lo, __hi - __lo);
> return __hi;
>      }
># 1122 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type __c, char) const
>      { return __c; }
># 1148 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char, char* __dest) const
>      {
> memcpy(__dest, __lo, __hi - __lo);
> return __hi;
>      }
>
>    private:
>
>      void _M_widen_init() const
>      {
> char __tmp[sizeof(_M_widen)];
> for (size_t __i = 0; __i < sizeof(_M_widen); ++__i)
>   __tmp[__i] = __i;
> do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen);
>
> _M_widen_ok = 1;
>
> if (memcmp(__tmp, _M_widen, sizeof(_M_widen)))
>   _M_widen_ok = 2;
>      }
>
>
>
>
>      void _M_narrow_init() const
>      {
> char __tmp[sizeof(_M_narrow)];
> for (size_t __i = 0; __i < sizeof(_M_narrow); ++__i)
>   __tmp[__i] = __i;
> do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow);
>
> _M_narrow_ok = 1;
> if (memcmp(__tmp, _M_narrow, sizeof(_M_narrow)))
>   _M_narrow_ok = 2;
> else
>   {
>
>
>     char __c;
>     do_narrow(__tmp, __tmp + 1, 1, &__c);
>     if (__c == 1)
>       _M_narrow_ok = 2;
>   }
>      }
>    };
>
>  template<>
>    const ctype<char>&
>    use_facet<ctype<char> >(const locale& __loc);
># 1212 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<>
>    class ctype<wchar_t> : public __ctype_abstract_base<wchar_t>
>    {
>    public:
>
>
>      typedef wchar_t char_type;
>      typedef wctype_t __wmask_type;
>
>    protected:
>      __c_locale _M_c_locale_ctype;
>
>
>      bool _M_narrow_ok;
>      char _M_narrow[128];
>      wint_t _M_widen[1 + static_cast<unsigned char>(-1)];
>
>
>      mask _M_bit[16];
>      __wmask_type _M_wmask[16];
>
>    public:
>
>
>      static locale::id id;
># 1245 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(size_t __refs = 0);
># 1256 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      ctype(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      __wmask_type
>      _M_convert_to_wmask(const mask __m) const;
>
>
>      virtual
>      ~ctype();
># 1280 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual bool
>      do_is(mask __m, char_type __c) const;
># 1299 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;
># 1317 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;
># 1335 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_scan_not(mask __m, const char_type* __lo,
>    const char_type* __hi) const;
># 1352 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_toupper(char_type) const;
># 1369 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_toupper(char_type* __lo, const char_type* __hi) const;
># 1385 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_tolower(char_type) const;
># 1402 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_tolower(char_type* __lo, const char_type* __hi) const;
># 1422 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_widen(char) const;
># 1444 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char*
>      do_widen(const char* __lo, const char* __hi, char_type* __dest) const;
># 1467 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char
>      do_narrow(char_type, char __dfault) const;
># 1493 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual const char_type*
>      do_narrow(const char_type* __lo, const char_type* __hi,
>  char __dfault, char* __dest) const;
>
>
>      void
>      _M_initialize_ctype();
>    };
>
>  template<>
>    const ctype<wchar_t>&
>    use_facet<ctype<wchar_t> >(const locale& __loc);
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_inline.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/ctype_inline.h" 3
>  bool
>  ctype<char>::
>  is(mask __m, char __c) const
>  { return _M_table[static_cast<unsigned char>(__c)] & __m; }
>
>  const char*
>  ctype<char>::
>  is(const char* __low, const char* __high, mask* __vec) const
>  {
>    while (__low < __high)
>      *__vec++ = _M_table[static_cast<unsigned char>(*__low++)];
>    return __high;
>  }
>
>  const char*
>  ctype<char>::
>  scan_is(mask __m, const char* __low, const char* __high) const
>  {
>    while (__low < __high
>    && !(_M_table[static_cast<unsigned char>(*__low)] & __m))
>      ++__low;
>    return __low;
>  }
>
>  const char*
>  ctype<char>::
>  scan_not(mask __m, const char* __low, const char* __high) const
>  {
>    while (__low < __high
>    && (_M_table[static_cast<unsigned char>(*__low)] & __m) != 0)
>      ++__low;
>    return __low;
>  }
># 1509 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
>
>
>  template<typename _CharT>
>    class ctype_byname : public ctype<_CharT>
>    {
>    public:
>      typedef _CharT char_type;
>
>      explicit
>      ctype_byname(const char* __s, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~ctype_byname() { };
>    };
>
>
>  template<>
>    ctype_byname<char>::ctype_byname(const char*, size_t refs);
>
>  template<>
>    ctype_byname<wchar_t>::ctype_byname(const char*, size_t refs);
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 1 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>       
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>
>
>  class codecvt_base
>  {
>  public:
>    enum result
>    {
>      ok,
>      partial,
>      error,
>      noconv
>    };
>  };
># 69 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class __codecvt_abstract_base
>    : public locale::facet, public codecvt_base
>    {
>    public:
>
>      typedef codecvt_base::result result;
>      typedef _InternT intern_type;
>      typedef _ExternT extern_type;
>      typedef _StateT state_type;
># 117 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      result
>      out(state_type& __state, const intern_type* __from,
>   const intern_type* __from_end, const intern_type*& __from_next,
>   extern_type* __to, extern_type* __to_end,
>   extern_type*& __to_next) const
>      {
> return this->do_out(__state, __from, __from_end, __from_next,
>       __to, __to_end, __to_next);
>      }
># 156 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      result
>      unshift(state_type& __state, extern_type* __to, extern_type* __to_end,
>       extern_type*& __to_next) const
>      { return this->do_unshift(__state, __to,__to_end,__to_next); }
># 197 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      result
>      in(state_type& __state, const extern_type* __from,
>  const extern_type* __from_end, const extern_type*& __from_next,
>  intern_type* __to, intern_type* __to_end,
>  intern_type*& __to_next) const
>      {
> return this->do_in(__state, __from, __from_end, __from_next,
>      __to, __to_end, __to_next);
>      }
>
>      int
>      encoding() const throw()
>      { return this->do_encoding(); }
>
>      bool
>      always_noconv() const throw()
>      { return this->do_always_noconv(); }
>
>      int
>      length(state_type& __state, const extern_type* __from,
>      const extern_type* __end, size_t __max) const
>      { return this->do_length(__state, __from, __end, __max); }
>
>      int
>      max_length() const throw()
>      { return this->do_max_length(); }
>
>    protected:
>      explicit
>      __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { }
>
>      virtual
>      ~__codecvt_abstract_base() { }
># 238 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/codecvt.h" 3
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const = 0;
>
>      virtual result
>      do_unshift(state_type& __state, extern_type* __to,
>   extern_type* __to_end, extern_type*& __to_next) const = 0;
>
>      virtual result
>      do_in(state_type& __state, const extern_type* __from,
>     const extern_type* __from_end, const extern_type*& __from_next,
>     intern_type* __to, intern_type* __to_end,
>     intern_type*& __to_next) const = 0;
>
>      virtual int
>      do_encoding() const throw() = 0;
>
>      virtual bool
>      do_always_noconv() const throw() = 0;
>
>      virtual int
>      do_length(state_type&, const extern_type* __from,
>  const extern_type* __end, size_t __max) const = 0;
>
>      virtual int
>      do_max_length() const throw() = 0;
>    };
>
>
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt
>    : public __codecvt_abstract_base<_InternT, _ExternT, _StateT>
>    {
>    public:
>
>      typedef codecvt_base::result result;
>      typedef _InternT intern_type;
>      typedef _ExternT extern_type;
>      typedef _StateT state_type;
>
>    protected:
>      __c_locale _M_c_locale_codecvt;
>
>    public:
>      static locale::id id;
>
>      explicit
>      codecvt(size_t __refs = 0)
>      : __codecvt_abstract_base<_InternT, _ExternT, _StateT> (__refs) { }
>
>      explicit
>      codecvt(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~codecvt() { }
>
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const;
>
>      virtual result
>      do_unshift(state_type& __state, extern_type* __to,
>   extern_type* __to_end, extern_type*& __to_next) const;
>
>      virtual result
>      do_in(state_type& __state, const extern_type* __from,
>     const extern_type* __from_end, const extern_type*& __from_next,
>     intern_type* __to, intern_type* __to_end,
>     intern_type*& __to_next) const;
>
>      virtual int
>      do_encoding() const throw();
>
>      virtual bool
>      do_always_noconv() const throw();
>
>      virtual int
>      do_length(state_type&, const extern_type* __from,
>  const extern_type* __end, size_t __max) const;
>
>      virtual int
>      do_max_length() const throw();
>    };
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    locale::id codecvt<_InternT, _ExternT, _StateT>::id;
>
>
>  template<>
>    class codecvt<char, char, mbstate_t>
>    : public __codecvt_abstract_base<char, char, mbstate_t>
>    {
>    public:
>
>      typedef char intern_type;
>      typedef char extern_type;
>      typedef mbstate_t state_type;
>
>    protected:
>      __c_locale _M_c_locale_codecvt;
>
>    public:
>      static locale::id id;
>
>      explicit
>      codecvt(size_t __refs = 0);
>
>      explicit
>      codecvt(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~codecvt();
>
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const;
>
>      virtual result
>      do_unshift(state_type& __state, extern_type* __to,
>   extern_type* __to_end, extern_type*& __to_next) const;
>
>      virtual result
>      do_in(state_type& __state, const extern_type* __from,
>     const extern_type* __from_end, const extern_type*& __from_next,
>     intern_type* __to, intern_type* __to_end,
>     intern_type*& __to_next) const;
>
>      virtual int
>      do_encoding() const throw();
>
>      virtual bool
>      do_always_noconv() const throw();
>
>      virtual int
>      do_length(state_type&, const extern_type* __from,
>  const extern_type* __end, size_t __max) const;
>
>      virtual int
>      do_max_length() const throw();
>  };
>
>
>
>  template<>
>    class codecvt<wchar_t, char, mbstate_t>
>    : public __codecvt_abstract_base<wchar_t, char, mbstate_t>
>    {
>    public:
>
>      typedef wchar_t intern_type;
>      typedef char extern_type;
>      typedef mbstate_t state_type;
>
>    protected:
>      __c_locale _M_c_locale_codecvt;
>
>    public:
>      static locale::id id;
>
>      explicit
>      codecvt(size_t __refs = 0);
>
>      explicit
>      codecvt(__c_locale __cloc, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~codecvt();
>
>      virtual result
>      do_out(state_type& __state, const intern_type* __from,
>      const intern_type* __from_end, const intern_type*& __from_next,
>      extern_type* __to, extern_type* __to_end,
>      extern_type*& __to_next) const;
>
>      virtual result
>      do_unshift(state_type& __state,
>   extern_type* __to, extern_type* __to_end,
>   extern_type*& __to_next) const;
>
>      virtual result
>      do_in(state_type& __state,
>      const extern_type* __from, const extern_type* __from_end,
>      const extern_type*& __from_next,
>      intern_type* __to, intern_type* __to_end,
>      intern_type*& __to_next) const;
>
>      virtual
>      int do_encoding() const throw();
>
>      virtual
>      bool do_always_noconv() const throw();
>
>      virtual
>      int do_length(state_type&, const extern_type* __from,
>      const extern_type* __end, size_t __max) const;
>
>      virtual int
>      do_max_length() const throw();
>    };
>
>
>
>  template<typename _InternT, typename _ExternT, typename _StateT>
>    class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>
>    {
>    public:
>      explicit
>      codecvt_byname(const char* __s, size_t __refs = 0)
>      : codecvt<_InternT, _ExternT, _StateT>(__refs)
>      {
> if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>   {
>     this->_S_destroy_c_locale(this->_M_c_locale_codecvt);
>     this->_S_create_c_locale(this->_M_c_locale_codecvt, __s);
>   }
>      }
>
>    protected:
>      virtual
>      ~codecvt_byname() { }
>    };
># 1534 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
>
>
>  class __num_base
>  {
>  public:
>
>
>    enum
>      {
>        _S_ominus,
>        _S_oplus,
>        _S_ox,
>        _S_oX,
>        _S_odigits,
>        _S_odigits_end = _S_odigits + 16,
>        _S_oudigits = _S_odigits_end,
>        _S_oudigits_end = _S_oudigits + 16,
>        _S_oe = _S_odigits + 14,
>        _S_oE = _S_oudigits + 14,
> _S_oend = _S_oudigits_end
>      };
>
>
>
>
>
>
>    static const char* _S_atoms_out;
>
>
>
>    static const char* _S_atoms_in;
>
>    enum
>    {
>      _S_iminus,
>      _S_iplus,
>      _S_ix,
>      _S_iX,
>      _S_izero,
>      _S_ie = _S_izero + 14,
>      _S_iE = _S_izero + 20,
>      _S_iend = 26
>    };
>
>
>
>    static void
>    _S_format_float(const ios_base& __io, char* __fptr, char __mod);
>  };
>
>  template<typename _CharT>
>    struct __numpunct_cache : public locale::facet
>    {
>      const char* _M_grouping;
>      size_t _M_grouping_size;
>      bool _M_use_grouping;
>      const _CharT* _M_truename;
>      size_t _M_truename_size;
>      const _CharT* _M_falsename;
>      size_t _M_falsename_size;
>      _CharT _M_decimal_point;
>      _CharT _M_thousands_sep;
>
>
>
>
>
>      _CharT _M_atoms_out[__num_base::_S_oend];
>
>
>
>
>
>      _CharT _M_atoms_in[__num_base::_S_iend];
>
>      bool _M_allocated;
>
>      __numpunct_cache(size_t __refs = 0) : facet(__refs),
>      _M_grouping(__null), _M_grouping_size(0), _M_use_grouping(false),
>      _M_truename(__null), _M_truename_size(0), _M_falsename(__null),
>      _M_falsename_size(0), _M_decimal_point(_CharT()),
>      _M_thousands_sep(_CharT()), _M_allocated(false)
>      { }
>
>      ~__numpunct_cache();
>
>      void
>      _M_cache(const locale& __loc);
>
>    private:
>      __numpunct_cache&
>      operator=(const __numpunct_cache&);
>
>      explicit
>      __numpunct_cache(const __numpunct_cache&);
>    };
>
>  template<typename _CharT>
>    __numpunct_cache<_CharT>::~__numpunct_cache()
>    {
>      if (_M_allocated)
> {
>   delete [] _M_grouping;
>   delete [] _M_truename;
>   delete [] _M_falsename;
> }
>    }
># 1656 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class numpunct : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      typedef __numpunct_cache<_CharT> __cache_type;
>
>    protected:
>      __cache_type* _M_data;
>
>    public:
>
>      static locale::id id;
>
>
>
>
>
>
>      explicit
>      numpunct(size_t __refs = 0) : facet(__refs), _M_data(__null)
>      { _M_initialize_numpunct(); }
># 1693 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      numpunct(__cache_type* __cache, size_t __refs = 0)
>      : facet(__refs), _M_data(__cache)
>      { _M_initialize_numpunct(); }
># 1707 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      numpunct(__c_locale __cloc, size_t __refs = 0)
>      : facet(__refs), _M_data(__null)
>      { _M_initialize_numpunct(__cloc); }
># 1721 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      decimal_point() const
>      { return this->do_decimal_point(); }
># 1734 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      thousands_sep() const
>      { return this->do_thousands_sep(); }
># 1765 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string
>      grouping() const
>      { return this->do_grouping(); }
># 1778 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      truename() const
>      { return this->do_truename(); }
># 1791 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      falsename() const
>      { return this->do_falsename(); }
>
>    protected:
>
>      virtual
>      ~numpunct();
># 1808 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_decimal_point() const
>      { return _M_data->_M_decimal_point; }
># 1820 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_thousands_sep() const
>      { return _M_data->_M_thousands_sep; }
># 1833 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string
>      do_grouping() const
>      { return _M_data->_M_grouping; }
># 1846 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_truename() const
>      { return _M_data->_M_truename; }
># 1859 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_falsename() const
>      { return _M_data->_M_falsename; }
>
>
>      void
>      _M_initialize_numpunct(__c_locale __cloc = __null);
>    };
>
>  template<typename _CharT>
>    locale::id numpunct<_CharT>::id;
>
>  template<>
>    numpunct<char>::~numpunct();
>
>  template<>
>    void
>    numpunct<char>::_M_initialize_numpunct(__c_locale __cloc);
>
>
>  template<>
>    numpunct<wchar_t>::~numpunct();
>
>  template<>
>    void
>    numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc);
>
>
>
>  template<typename _CharT>
>    class numpunct_byname : public numpunct<_CharT>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      explicit
>      numpunct_byname(const char* __s, size_t __refs = 0)
>      : numpunct<_CharT>(__refs)
>      {
> if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>   {
>     __c_locale __tmp;
>     this->_S_create_c_locale(__tmp, __s);
>     this->_M_initialize_numpunct(__tmp);
>     this->_S_destroy_c_locale(__tmp);
>   }
>      }
>
>    protected:
>      virtual
>      ~numpunct_byname() { }
>    };
>
>
># 1926 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _InIter>
>    class num_get : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>
>
>
>      static locale::id id;
># 1947 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      num_get(size_t __refs = 0) : facet(__refs) { }
># 1973 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, bool& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
># 2009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, long& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, unsigned short& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, unsigned int& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, unsigned long& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, long long& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, unsigned long long& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
># 2068 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, float& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, double& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, long double& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
># 2110 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __in, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, void*& __v) const
>      { return this->do_get(__in, __end, __io, __err, __v); }
>
>    protected:
>
>      virtual ~num_get() { }
>
>      iter_type
>      _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&,
>         string& __xtrc) const;
>
>      template<typename _ValueT>
>        iter_type
>        _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&,
>         _ValueT& __v) const;
># 2143 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>       unsigned short&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      unsigned int&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      unsigned long&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      long long&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      unsigned long long&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      float&) const;
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      double&) const;
>
>
>
>
>
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      long double&) const;
>
>
>      virtual iter_type
>      do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,
>      void*&) const;
># 2202 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id num_get<_CharT, _InIter>::id;
># 2219 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _OutIter>
>    class num_put : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>
>
>
>      static locale::id id;
># 2240 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      num_put(size_t __refs = 0) : facet(__refs) { }
># 2258 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
># 2300 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   unsigned long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   unsigned long long __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
># 2363 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill, double __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   long double __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
># 2388 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __f, char_type __fill,
>   const void* __v) const
>      { return this->do_put(__s, __f, __fill, __v); }
>
>    protected:
>      template<typename _ValueT>
>        iter_type
>        _M_insert_float(iter_type, ios_base& __io, char_type __fill,
>   char __mod, _ValueT __v) const;
>
>      void
>      _M_group_float(const char* __grouping, size_t __grouping_size,
>       char_type __sep, const char_type* __p, char_type* __new,
>       char_type* __cs, int& __len) const;
>
>      template<typename _ValueT>
>        iter_type
>        _M_insert_int(iter_type, ios_base& __io, char_type __fill,
>        _ValueT __v) const;
>
>      void
>      _M_group_int(const char* __grouping, size_t __grouping_size,
>     char_type __sep, ios_base& __io, char_type* __new,
>     char_type* __cs, int& __len) const;
>
>      void
>      _M_pad(char_type __fill, streamsize __w, ios_base& __io,
>      char_type* __new, const char_type* __cs, int& __len) const;
>
>
>      virtual
>      ~num_put() { };
># 2436 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, bool __v) const;
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, long __v) const;
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, unsigned long) const;
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, long long __v) const;
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, unsigned long long) const;
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, double __v) const;
>
>
>
>
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, long double __v) const;
>
>
>      virtual iter_type
>      do_put(iter_type, ios_base&, char_type __fill, const void* __v) const;
>
>
>
>
>
>
>
>    };
>
>  template <typename _CharT, typename _OutIter>
>    locale::id num_put<_CharT, _OutIter>::id;
>
>
># 2493 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class collate : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>
>    protected:
>
>
>      __c_locale _M_c_locale_collate;
>
>    public:
>
>      static locale::id id;
># 2520 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      collate(size_t __refs = 0)
>      : facet(__refs), _M_c_locale_collate(_S_get_c_locale())
>      { }
># 2534 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      collate(__c_locale __cloc, size_t __refs = 0)
>      : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc))
>      { }
># 2551 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      int
>      compare(const _CharT* __lo1, const _CharT* __hi1,
>       const _CharT* __lo2, const _CharT* __hi2) const
>      { return this->do_compare(__lo1, __hi1, __lo2, __hi2); }
># 2570 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      transform(const _CharT* __lo, const _CharT* __hi) const
>      { return this->do_transform(__lo, __hi); }
># 2584 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      long
>      hash(const _CharT* __lo, const _CharT* __hi) const
>      { return this->do_hash(__lo, __hi); }
>
>
>      int
>      _M_compare(const _CharT*, const _CharT*) const;
>
>      size_t
>      _M_transform(_CharT*, const _CharT*, size_t) const;
>
>  protected:
>
>      virtual
>      ~collate()
>      { _S_destroy_c_locale(_M_c_locale_collate); }
># 2613 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual int
>      do_compare(const _CharT* __lo1, const _CharT* __hi1,
>   const _CharT* __lo2, const _CharT* __hi2) const;
># 2629 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_transform(const _CharT* __lo, const _CharT* __hi) const;
># 2642 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual long
>      do_hash(const _CharT* __lo, const _CharT* __hi) const;
>    };
>
>  template<typename _CharT>
>    locale::id collate<_CharT>::id;
>
>
>  template<>
>    int
>    collate<char>::_M_compare(const char*, const char*) const;
>
>  template<>
>    size_t
>    collate<char>::_M_transform(char*, const char*, size_t) const;
>
>
>  template<>
>    int
>    collate<wchar_t>::_M_compare(const wchar_t*, const wchar_t*) const;
>
>  template<>
>    size_t
>    collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const;
>
>
>
>  template<typename _CharT>
>    class collate_byname : public collate<_CharT>
>    {
>    public:
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>
>      explicit
>      collate_byname(const char* __s, size_t __refs = 0)
>      : collate<_CharT>(__refs)
>      {
> if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>   {
>     this->_S_destroy_c_locale(this->_M_c_locale_collate);
>     this->_S_create_c_locale(this->_M_c_locale_collate, __s);
>   }
>      }
>
>    protected:
>      virtual
>      ~collate_byname() { }
>    };
># 2702 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  class time_base
>  {
>  public:
>    enum dateorder { no_order, dmy, mdy, ymd, ydm };
>  };
>
>  template<typename _CharT>
>    struct __timepunct_cache : public locale::facet
>    {
>
>      static const _CharT* _S_timezones[14];
>
>      const _CharT* _M_date_format;
>      const _CharT* _M_date_era_format;
>      const _CharT* _M_time_format;
>      const _CharT* _M_time_era_format;
>      const _CharT* _M_date_time_format;
>      const _CharT* _M_date_time_era_format;
>      const _CharT* _M_am;
>      const _CharT* _M_pm;
>      const _CharT* _M_am_pm_format;
>
>
>      const _CharT* _M_day1;
>      const _CharT* _M_day2;
>      const _CharT* _M_day3;
>      const _CharT* _M_day4;
>      const _CharT* _M_day5;
>      const _CharT* _M_day6;
>      const _CharT* _M_day7;
>
>
>      const _CharT* _M_aday1;
>      const _CharT* _M_aday2;
>      const _CharT* _M_aday3;
>      const _CharT* _M_aday4;
>      const _CharT* _M_aday5;
>      const _CharT* _M_aday6;
>      const _CharT* _M_aday7;
>
>
>      const _CharT* _M_month01;
>      const _CharT* _M_month02;
>      const _CharT* _M_month03;
>      const _CharT* _M_month04;
>      const _CharT* _M_month05;
>      const _CharT* _M_month06;
>      const _CharT* _M_month07;
>      const _CharT* _M_month08;
>      const _CharT* _M_month09;
>      const _CharT* _M_month10;
>      const _CharT* _M_month11;
>      const _CharT* _M_month12;
>
>
>      const _CharT* _M_amonth01;
>      const _CharT* _M_amonth02;
>      const _CharT* _M_amonth03;
>      const _CharT* _M_amonth04;
>      const _CharT* _M_amonth05;
>      const _CharT* _M_amonth06;
>      const _CharT* _M_amonth07;
>      const _CharT* _M_amonth08;
>      const _CharT* _M_amonth09;
>      const _CharT* _M_amonth10;
>      const _CharT* _M_amonth11;
>      const _CharT* _M_amonth12;
>
>      bool _M_allocated;
>
>      __timepunct_cache(size_t __refs = 0) : facet(__refs),
>      _M_date_format(__null), _M_date_era_format(__null), _M_time_format(__null),
>      _M_time_era_format(__null), _M_date_time_format(__null),
>      _M_date_time_era_format(__null), _M_am(__null), _M_pm(__null),
>      _M_am_pm_format(__null), _M_day1(__null), _M_day2(__null), _M_day3(__null),
>      _M_day4(__null), _M_day5(__null), _M_day6(__null), _M_day7(__null),
>      _M_aday1(__null), _M_aday2(__null), _M_aday3(__null), _M_aday4(__null),
>      _M_aday5(__null), _M_aday6(__null), _M_aday7(__null), _M_month01(__null),
>      _M_month02(__null), _M_month03(__null), _M_month04(__null), _M_month05(__null),
>      _M_month06(__null), _M_month07(__null), _M_month08(__null), _M_month09(__null),
>      _M_month10(__null), _M_month11(__null), _M_month12(__null), _M_amonth01(__null),
>      _M_amonth02(__null), _M_amonth03(__null), _M_amonth04(__null),
>      _M_amonth05(__null), _M_amonth06(__null), _M_amonth07(__null),
>      _M_amonth08(__null), _M_amonth09(__null), _M_amonth10(__null),
>      _M_amonth11(__null), _M_amonth12(__null), _M_allocated(false)
>      { }
>
>      ~__timepunct_cache();
>
>      void
>      _M_cache(const locale& __loc);
>
>    private:
>      __timepunct_cache&
>      operator=(const __timepunct_cache&);
>
>      explicit
>      __timepunct_cache(const __timepunct_cache&);
>    };
>
>  template<typename _CharT>
>    __timepunct_cache<_CharT>::~__timepunct_cache()
>    {
>      if (_M_allocated)
> {
>
> }
>    }
>
>
>  template<>
>    const char*
>    __timepunct_cache<char>::_S_timezones[14];
>
>
>  template<>
>    const wchar_t*
>    __timepunct_cache<wchar_t>::_S_timezones[14];
>
>
>
>  template<typename _CharT>
>    const _CharT* __timepunct_cache<_CharT>::_S_timezones[14];
>
>  template<typename _CharT>
>    class __timepunct : public locale::facet
>    {
>    public:
>
>      typedef _CharT __char_type;
>      typedef basic_string<_CharT> __string_type;
>      typedef __timepunct_cache<_CharT> __cache_type;
>
>    protected:
>      __cache_type* _M_data;
>      __c_locale _M_c_locale_timepunct;
>      const char* _M_name_timepunct;
>
>    public:
>
>      static locale::id id;
>
>      explicit
>      __timepunct(size_t __refs = 0);
>
>      explicit
>      __timepunct(__cache_type* __cache, size_t __refs = 0);
># 2860 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0);
>
>
>
>      void
>      _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format,
>      const tm* __tm) const;
>
>      void
>      _M_date_formats(const _CharT** __date) const
>      {
>
> __date[0] = _M_data->_M_date_format;
> __date[1] = _M_data->_M_date_era_format;
>      }
>
>      void
>      _M_time_formats(const _CharT** __time) const
>      {
>
> __time[0] = _M_data->_M_time_format;
> __time[1] = _M_data->_M_time_era_format;
>      }
>
>      void
>      _M_date_time_formats(const _CharT** __dt) const
>      {
>
> __dt[0] = _M_data->_M_date_time_format;
> __dt[1] = _M_data->_M_date_time_era_format;
>      }
>
>      void
>      _M_am_pm_format(const _CharT* __ampm) const
>      { __ampm = _M_data->_M_am_pm_format; }
>
>      void
>      _M_am_pm(const _CharT** __ampm) const
>      {
> __ampm[0] = _M_data->_M_am;
> __ampm[1] = _M_data->_M_pm;
>      }
>
>      void
>      _M_days(const _CharT** __days) const
>      {
> __days[0] = _M_data->_M_day1;
> __days[1] = _M_data->_M_day2;
> __days[2] = _M_data->_M_day3;
> __days[3] = _M_data->_M_day4;
> __days[4] = _M_data->_M_day5;
> __days[5] = _M_data->_M_day6;
> __days[6] = _M_data->_M_day7;
>      }
>
>      void
>      _M_days_abbreviated(const _CharT** __days) const
>      {
> __days[0] = _M_data->_M_aday1;
> __days[1] = _M_data->_M_aday2;
> __days[2] = _M_data->_M_aday3;
> __days[3] = _M_data->_M_aday4;
> __days[4] = _M_data->_M_aday5;
> __days[5] = _M_data->_M_aday6;
> __days[6] = _M_data->_M_aday7;
>      }
>
>      void
>      _M_months(const _CharT** __months) const
>      {
> __months[0] = _M_data->_M_month01;
> __months[1] = _M_data->_M_month02;
> __months[2] = _M_data->_M_month03;
> __months[3] = _M_data->_M_month04;
> __months[4] = _M_data->_M_month05;
> __months[5] = _M_data->_M_month06;
> __months[6] = _M_data->_M_month07;
> __months[7] = _M_data->_M_month08;
> __months[8] = _M_data->_M_month09;
> __months[9] = _M_data->_M_month10;
> __months[10] = _M_data->_M_month11;
> __months[11] = _M_data->_M_month12;
>      }
>
>      void
>      _M_months_abbreviated(const _CharT** __months) const
>      {
> __months[0] = _M_data->_M_amonth01;
> __months[1] = _M_data->_M_amonth02;
> __months[2] = _M_data->_M_amonth03;
> __months[3] = _M_data->_M_amonth04;
> __months[4] = _M_data->_M_amonth05;
> __months[5] = _M_data->_M_amonth06;
> __months[6] = _M_data->_M_amonth07;
> __months[7] = _M_data->_M_amonth08;
> __months[8] = _M_data->_M_amonth09;
> __months[9] = _M_data->_M_amonth10;
> __months[10] = _M_data->_M_amonth11;
> __months[11] = _M_data->_M_amonth12;
>      }
>
>    protected:
>      virtual
>      ~__timepunct();
>
>
>      void
>      _M_initialize_timepunct(__c_locale __cloc = __null);
>    };
>
>  template<typename _CharT>
>    locale::id __timepunct<_CharT>::id;
>
>
>  template<>
>    void
>    __timepunct<char>::_M_initialize_timepunct(__c_locale __cloc);
>
>  template<>
>    void
>    __timepunct<char>::_M_put(char*, size_t, const char*, const tm*) const;
>
>
>  template<>
>    void
>    __timepunct<wchar_t>::_M_initialize_timepunct(__c_locale __cloc);
>
>  template<>
>    void
>    __timepunct<wchar_t>::_M_put(wchar_t*, size_t, const wchar_t*,
>     const tm*) const;
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/time_members.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/time_members.h" 3
>  template<typename _CharT>
>    __timepunct<_CharT>::__timepunct(size_t __refs)
>    : facet(__refs), _M_data(__null), _M_c_locale_timepunct(__null),
>      _M_name_timepunct(_S_get_c_name())
>    { _M_initialize_timepunct(); }
>
>  template<typename _CharT>
>    __timepunct<_CharT>::__timepunct(__cache_type* __cache, size_t __refs)
>    : facet(__refs), _M_data(__cache), _M_c_locale_timepunct(__null),
>      _M_name_timepunct(_S_get_c_name())
>    { _M_initialize_timepunct(); }
>
>  template<typename _CharT>
>    __timepunct<_CharT>::__timepunct(__c_locale __cloc, const char* __s,
>         size_t __refs)
>    : facet(__refs), _M_data(__null), _M_c_locale_timepunct(__null),
>      _M_name_timepunct(__null)
>    {
>      const size_t __len = std::strlen(__s) + 1;
>      char* __tmp = new char[__len];
>      std::memcpy(__tmp, __s, __len);
>      _M_name_timepunct = __tmp;
>
>      try
> { _M_initialize_timepunct(__cloc); }
>      catch(...)
> {
>   delete [] _M_name_timepunct;
>   throw;
> }
>    }
>
>  template<typename _CharT>
>    __timepunct<_CharT>::~__timepunct()
>    {
>      if (_M_name_timepunct != _S_get_c_name())
> delete [] _M_name_timepunct;
>      delete _M_data;
>      _S_destroy_c_locale(_M_c_locale_timepunct);
>    }
># 2996 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
># 3009 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _InIter>
>    class time_get : public locale::facet, public time_base
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>
>      typedef basic_string<_CharT> __string_type;
>
>
>      static locale::id id;
># 3031 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      time_get(size_t __refs = 0)
>      : facet (__refs) { }
># 3048 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      dateorder
>      date_order() const
>      { return this->do_date_order(); }
># 3072 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_time(iter_type __beg, iter_type __end, ios_base& __io,
>        ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_time(__beg, __end, __io, __err, __tm); }
># 3097 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_date(iter_type __beg, iter_type __end, ios_base& __io,
>        ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_date(__beg, __end, __io, __err, __tm); }
># 3125 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_weekday(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_weekday(__beg, __end, __io, __err, __tm); }
># 3154 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_monthname(iter_type __beg, iter_type __end, ios_base& __io,
>      ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_monthname(__beg, __end, __io, __err, __tm); }
># 3180 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get_year(iter_type __beg, iter_type __end, ios_base& __io,
>        ios_base::iostate& __err, tm* __tm) const
>      { return this->do_get_year(__beg, __end, __io, __err, __tm); }
>
>    protected:
>
>      virtual
>      ~time_get() { }
># 3200 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual dateorder
>      do_date_order() const;
># 3218 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_time(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const;
># 3237 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_date(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const;
># 3256 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_weekday(iter_type __beg, iter_type __end, ios_base&,
>       ios_base::iostate& __err, tm* __tm) const;
># 3275 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_monthname(iter_type __beg, iter_type __end, ios_base&,
>         ios_base::iostate& __err, tm* __tm) const;
># 3294 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get_year(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, tm* __tm) const;
>
>
>      iter_type
>      _M_extract_num(iter_type __beg, iter_type __end, int& __member,
>       int __min, int __max, size_t __len,
>       ios_base& __io, ios_base::iostate& __err) const;
>
>
>
>      iter_type
>      _M_extract_name(iter_type __beg, iter_type __end, int& __member,
>        const _CharT** __names, size_t __indexlen,
>        ios_base& __io, ios_base::iostate& __err) const;
>
>
>      iter_type
>      _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,
>       ios_base::iostate& __err, tm* __tm,
>       const _CharT* __format) const;
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id time_get<_CharT, _InIter>::id;
>
>
>  template<typename _CharT, typename _InIter>
>    class time_get_byname : public time_get<_CharT, _InIter>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>
>      explicit
>      time_get_byname(const char*, size_t __refs = 0)
>      : time_get<_CharT, _InIter>(__refs) { }
>
>    protected:
>      virtual
>      ~time_get_byname() { }
>    };
># 3350 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _OutIter>
>    class time_put : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>
>
>
>      static locale::id id;
># 3371 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      time_put(size_t __refs = 0)
>      : facet(__refs) { }
># 3390 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,
>   const _CharT* __beg, const _CharT* __end) const;
># 3410 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, ios_base& __io, char_type __fill,
>   const tm* __tm, char __format, char __mod = 0) const
>      { return this->do_put(__s, __io, __fill, __tm, __format, __mod); }
>
>    protected:
>
>      virtual
>      ~time_put()
>      { }
># 3437 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,
>      char __format, char __mod) const;
>    };
>
>  template<typename _CharT, typename _OutIter>
>    locale::id time_put<_CharT, _OutIter>::id;
>
>
>  template<typename _CharT, typename _OutIter>
>    class time_put_byname : public time_put<_CharT, _OutIter>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>
>      explicit
>      time_put_byname(const char*, size_t __refs = 0)
>      : time_put<_CharT, _OutIter>(__refs)
>      { };
>
>    protected:
>      virtual
>      ~time_put_byname() { }
>    };
># 3475 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  class money_base
>  {
>  public:
>    enum part { none, space, symbol, sign, value };
>    struct pattern { char field[4]; };
>
>    static const pattern _S_default_pattern;
>
>    enum
>    {
>      _S_minus,
>      _S_zero,
>      _S_end = 11
>    };
>
>
>
>    static const char* _S_atoms;
>
>
>
>    static pattern
>    _S_construct_pattern(char __precedes, char __space, char __posn);
>  };
>
>  template<typename _CharT, bool _Intl>
>    struct __moneypunct_cache : public locale::facet
>    {
>      const char* _M_grouping;
>      size_t _M_grouping_size;
>      bool _M_use_grouping;
>      _CharT _M_decimal_point;
>      _CharT _M_thousands_sep;
>      const _CharT* _M_curr_symbol;
>      size_t _M_curr_symbol_size;
>      const _CharT* _M_positive_sign;
>      size_t _M_positive_sign_size;
>      const _CharT* _M_negative_sign;
>      size_t _M_negative_sign_size;
>      int _M_frac_digits;
>      money_base::pattern _M_pos_format;
>      money_base::pattern _M_neg_format;
>
>
>
>
>      _CharT _M_atoms[money_base::_S_end];
>
>      bool _M_allocated;
>
>      __moneypunct_cache(size_t __refs = 0) : facet(__refs),
>      _M_grouping(__null), _M_grouping_size(0), _M_use_grouping(false),
>      _M_decimal_point(_CharT()), _M_thousands_sep(_CharT()),
>      _M_curr_symbol(__null), _M_curr_symbol_size(0),
>      _M_positive_sign(__null), _M_positive_sign_size(0),
>      _M_negative_sign(__null), _M_negative_sign_size(0),
>      _M_frac_digits(0),
>      _M_pos_format(money_base::pattern()),
>      _M_neg_format(money_base::pattern()), _M_allocated(false)
>      { }
>
>      ~__moneypunct_cache();
>
>      void
>      _M_cache(const locale& __loc);
>
>    private:
>      __moneypunct_cache&
>      operator=(const __moneypunct_cache&);
>
>      explicit
>      __moneypunct_cache(const __moneypunct_cache&);
>    };
>
>  template<typename _CharT, bool _Intl>
>    __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache()
>    {
>      if (_M_allocated)
> {
>   delete [] _M_grouping;
>   delete [] _M_curr_symbol;
>   delete [] _M_positive_sign;
>   delete [] _M_negative_sign;
> }
>    }
>
>
>
>
>
>
>
>  template<typename _CharT, bool _Intl>
>    class moneypunct : public locale::facet, public money_base
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      typedef __moneypunct_cache<_CharT, _Intl> __cache_type;
>
>    private:
>      __cache_type* _M_data;
>
>    public:
>
>
>      static const bool intl = _Intl;
>
>      static locale::id id;
># 3596 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(size_t __refs = 0) : facet(__refs), _M_data(__null)
>      { _M_initialize_moneypunct(); }
># 3608 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(__cache_type* __cache, size_t __refs = 0)
>      : facet(__refs), _M_data(__cache)
>      { _M_initialize_moneypunct(); }
># 3623 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0)
>      : facet(__refs), _M_data(__null)
>      { _M_initialize_moneypunct(__cloc, __s); }
># 3637 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      decimal_point() const
>      { return this->do_decimal_point(); }
># 3650 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      char_type
>      thousands_sep() const
>      { return this->do_thousands_sep(); }
># 3679 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string
>      grouping() const
>      { return this->do_grouping(); }
># 3692 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      curr_symbol() const
>      { return this->do_curr_symbol(); }
># 3709 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      positive_sign() const
>      { return this->do_positive_sign(); }
># 3726 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      negative_sign() const
>      { return this->do_negative_sign(); }
># 3742 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      int
>      frac_digits() const
>      { return this->do_frac_digits(); }
># 3777 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      pattern
>      pos_format() const
>      { return this->do_pos_format(); }
>
>      pattern
>      neg_format() const
>      { return this->do_neg_format(); }
>
>
>    protected:
>
>      virtual
>      ~moneypunct();
># 3799 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_decimal_point() const
>      { return _M_data->_M_decimal_point; }
># 3811 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual char_type
>      do_thousands_sep() const
>      { return _M_data->_M_thousands_sep; }
># 3824 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string
>      do_grouping() const
>      { return _M_data->_M_grouping; }
># 3837 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_curr_symbol() const
>      { return _M_data->_M_curr_symbol; }
># 3850 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_positive_sign() const
>      { return _M_data->_M_positive_sign; }
># 3863 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_negative_sign() const
>      { return _M_data->_M_negative_sign; }
># 3877 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual int
>      do_frac_digits() const
>      { return _M_data->_M_frac_digits; }
># 3891 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual pattern
>      do_pos_format() const
>      { return _M_data->_M_pos_format; }
># 3905 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual pattern
>      do_neg_format() const
>      { return _M_data->_M_neg_format; }
>
>
>       void
>       _M_initialize_moneypunct(__c_locale __cloc = __null,
>    const char* __name = __null);
>    };
>
>  template<typename _CharT, bool _Intl>
>    locale::id moneypunct<_CharT, _Intl>::id;
>
>  template<typename _CharT, bool _Intl>
>    const bool moneypunct<_CharT, _Intl>::intl;
>
>  template<>
>    moneypunct<char, true>::~moneypunct();
>
>  template<>
>    moneypunct<char, false>::~moneypunct();
>
>  template<>
>    void
>    moneypunct<char, true>::_M_initialize_moneypunct(__c_locale, const char*);
>
>  template<>
>    void
>    moneypunct<char, false>::_M_initialize_moneypunct(__c_locale, const char*);
>
>
>  template<>
>    moneypunct<wchar_t, true>::~moneypunct();
>
>  template<>
>    moneypunct<wchar_t, false>::~moneypunct();
>
>  template<>
>    void
>    moneypunct<wchar_t, true>::_M_initialize_moneypunct(__c_locale,
>       const char*);
>
>  template<>
>    void
>    moneypunct<wchar_t, false>::_M_initialize_moneypunct(__c_locale,
>        const char*);
>
>
>
>  template<typename _CharT, bool _Intl>
>    class moneypunct_byname : public moneypunct<_CharT, _Intl>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      static const bool intl = _Intl;
>
>      explicit
>      moneypunct_byname(const char* __s, size_t __refs = 0)
>      : moneypunct<_CharT, _Intl>(__refs)
>      {
> if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>   {
>     __c_locale __tmp;
>     this->_S_create_c_locale(__tmp, __s);
>     this->_M_initialize_moneypunct(__tmp);
>     this->_S_destroy_c_locale(__tmp);
>   }
>      }
>
>    protected:
>      virtual
>      ~moneypunct_byname() { }
>    };
>
>  template<typename _CharT, bool _Intl>
>    const bool moneypunct_byname<_CharT, _Intl>::intl;
>
>
># 3997 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _InIter>
>    class money_get : public locale::facet
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef _InIter iter_type;
>      typedef basic_string<_CharT> string_type;
>
>
>
>      static locale::id id;
># 4019 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      money_get(size_t __refs = 0) : facet(__refs) { }
># 4049 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>   ios_base::iostate& __err, long double& __units) const
>      { return this->do_get(__s, __end, __intl, __io, __err, __units); }
># 4079 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>   ios_base::iostate& __err, string_type& __digits) const
>      { return this->do_get(__s, __end, __intl, __io, __err, __digits); }
>
>    protected:
>
>      virtual
>      ~money_get() { }
># 4102 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>      ios_base::iostate& __err, long double& __units) const;
># 4114 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,
>      ios_base::iostate& __err, string_type& __digits) const;
># 4125 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      template<bool _Intl>
>        iter_type
>        _M_extract(iter_type __s, iter_type __end, ios_base& __io,
>     ios_base::iostate& __err, string& __digits) const;
>    };
>
>  template<typename _CharT, typename _InIter>
>    locale::id money_get<_CharT, _InIter>::id;
># 4146 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT, typename _OutIter>
>    class money_put : public locale::facet
>    {
>    public:
>
>
>      typedef _CharT char_type;
>      typedef _OutIter iter_type;
>      typedef basic_string<_CharT> string_type;
>
>
>
>      static locale::id id;
># 4167 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      money_put(size_t __refs = 0) : facet(__refs) { }
># 4187 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, bool __intl, ios_base& __io,
>   char_type __fill, long double __units) const
>      { return this->do_put(__s, __intl, __io, __fill, __units); }
># 4209 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      iter_type
>      put(iter_type __s, bool __intl, ios_base& __io,
>   char_type __fill, const string_type& __digits) const
>      { return this->do_put(__s, __intl, __io, __fill, __digits); }
>
>    protected:
>
>      virtual
>      ~money_put() { }
># 4243 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>      long double __units) const;
># 4266 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual iter_type
>      do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>      const string_type& __digits) const;
># 4277 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      template<bool _Intl>
>        iter_type
>        _M_insert(iter_type __s, ios_base& __io, char_type __fill,
>    const string_type& __digits) const;
>    };
>
>  template<typename _CharT, typename _OutIter>
>    locale::id money_put<_CharT, _OutIter>::id;
>
>
>
>
>
>
>  struct messages_base
>  {
>    typedef int catalog;
>  };
># 4316 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    class messages : public locale::facet, public messages_base
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>
>    protected:
>
>
>      __c_locale _M_c_locale_messages;
>      const char* _M_name_messages;
>
>    public:
>
>      static locale::id id;
># 4344 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      messages(size_t __refs = 0);
># 4358 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      explicit
>      messages(__c_locale __cloc, const char* __s, size_t __refs = 0);
># 4371 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      catalog
>      open(const basic_string<char>& __s, const locale& __loc) const
>      { return this->do_open(__s, __loc); }
># 4389 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      catalog
>      open(const basic_string<char>&, const locale&, const char*) const;
># 4407 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      string_type
>      get(catalog __c, int __set, int __msgid, const string_type& __s) const
>      { return this->do_get(__c, __set, __msgid, __s); }
># 4418 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      void
>      close(catalog __c) const
>      { return this->do_close(__c); }
>
>    protected:
>
>      virtual
>      ~messages();
># 4438 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual catalog
>      do_open(const basic_string<char>&, const locale&) const;
># 4457 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>      virtual string_type
>      do_get(catalog, int, int, const string_type& __dfault) const;
>
>
>
>
>
>
>      virtual void
>      do_close(catalog) const;
>
>
>      char*
>      _M_convert_to_char(const string_type& __msg) const
>      {
>
> return reinterpret_cast<char*>(const_cast<_CharT*>(__msg.c_str()));
>      }
>
>
>      string_type
>      _M_convert_from_char(char*) const
>      {
># 4514 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
> return string_type();
>      }
>     };
>
>  template<typename _CharT>
>    locale::id messages<_CharT>::id;
>
>
>  template<>
>    string
>    messages<char>::do_get(catalog, int, int, const string&) const;
>
>
>  template<>
>    wstring
>    messages<wchar_t>::do_get(catalog, int, int, const wstring&) const;
>
>
>
>   template<typename _CharT>
>    class messages_byname : public messages<_CharT>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef basic_string<_CharT> string_type;
>
>      explicit
>      messages_byname(const char* __s, size_t __refs = 0);
>
>    protected:
>      virtual
>      ~messages_byname()
>      { }
>    };
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/messages_members.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/i386-redhat-linux/bits/messages_members.h" 3
>  template<typename _CharT>
>     messages<_CharT>::messages(size_t __refs)
>     : facet(__refs), _M_c_locale_messages(_S_get_c_locale()),
>       _M_name_messages(_S_get_c_name())
>     { }
>
>  template<typename _CharT>
>     messages<_CharT>::messages(__c_locale __cloc, const char* __s,
>    size_t __refs)
>     : facet(__refs), _M_c_locale_messages(__null), _M_name_messages(__null)
>     {
>       const size_t __len = std::strlen(__s) + 1;
>       char* __tmp = new char[__len];
>       std::memcpy(__tmp, __s, __len);
>       _M_name_messages = __tmp;
>
>
>       _M_c_locale_messages = _S_clone_c_locale(__cloc);
>     }
>
>  template<typename _CharT>
>    typename messages<_CharT>::catalog
>    messages<_CharT>::open(const basic_string<char>& __s, const locale& __loc,
>      const char* __dir) const
>    {
>      bindtextdomain(__s.c_str(), __dir);
>      return this->do_open(__s, __loc);
>    }
>
>
>  template<typename _CharT>
>    messages<_CharT>::~messages()
>    {
>      if (_M_name_messages != _S_get_c_name())
> delete [] _M_name_messages;
>      _S_destroy_c_locale(_M_c_locale_messages);
>    }
>
>  template<typename _CharT>
>    typename messages<_CharT>::catalog
>    messages<_CharT>::do_open(const basic_string<char>& __s,
>         const locale&) const
>    {
>
>
>      textdomain(__s.c_str());
>      return 0;
>    }
>
>  template<typename _CharT>
>    void
>    messages<_CharT>::do_close(catalog) const
>    { }
>
>
>   template<typename _CharT>
>     messages_byname<_CharT>::messages_byname(const char* __s, size_t __refs)
>     : messages<_CharT>(__refs)
>     {
>       if (this->_M_name_messages != locale::facet::_S_get_c_name())
>  delete [] this->_M_name_messages;
>       char* __tmp = new char[std::strlen(__s) + 1];
>       std::strcpy(__tmp, __s);
>       this->_M_name_messages = __tmp;
>
>       if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0)
>  {
>    this->_S_destroy_c_locale(this->_M_c_locale_messages);
>    this->_S_create_c_locale(this->_M_c_locale_messages, __s);
>  }
>     }
># 4551 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 2 3
># 4559 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.h" 3
>  template<typename _CharT>
>    inline bool
>    isspace(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::space, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isprint(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::print, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    iscntrl(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::cntrl, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isupper(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::upper, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    islower(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::lower, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isalpha(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alpha, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isdigit(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::digit, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    ispunct(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::punct, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isxdigit(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::xdigit, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isalnum(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alnum, __c); }
>
>
>  template<typename _CharT>
>    inline bool
>    isgraph(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::graph, __c); }
>
>
>  template<typename _CharT>
>    inline _CharT
>    toupper(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).toupper(__c); }
>
>
>  template<typename _CharT>
>    inline _CharT
>    tolower(_CharT __c, const locale& __loc)
>    { return use_facet<ctype<_CharT> >(__loc).tolower(__c); }
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 2 3
>
>namespace std
>{
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    class basic_ios : public ios_base
>    {
>    public:
>
>
>
>
>
>
>      typedef _CharT char_type;
>      typedef typename _Traits::int_type int_type;
>      typedef typename _Traits::pos_type pos_type;
>      typedef typename _Traits::off_type off_type;
>      typedef _Traits traits_type;
># 78 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      typedef ctype<_CharT> __ctype_type;
>      typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> >
>           __num_put_type;
>      typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> >
>           __num_get_type;
>
>
>
>    protected:
>      basic_ostream<_CharT, _Traits>* _M_tie;
>      mutable char_type _M_fill;
>      mutable bool _M_fill_init;
>      basic_streambuf<_CharT, _Traits>* _M_streambuf;
>
>
>      const __ctype_type* _M_ctype;
>
>      const __num_put_type* _M_num_put;
>
>      const __num_get_type* _M_num_get;
>
>    public:
>
>
>
>
>
>
>
>      operator void*() const
>      { return this->fail() ? 0 : const_cast<basic_ios*>(this); }
>
>      bool
>      operator!() const
>      { return this->fail(); }
># 122 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      iostate
>      rdstate() const
>      { return _M_streambuf_state; }
># 133 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      void
>      clear(iostate __state = goodbit);
>
>
>
>
>
>
>
>      void
>      setstate(iostate __state)
>      { this->clear(this->rdstate() | __state); }
>
>
>
>
>      void
>      _M_setstate(iostate __state)
>      {
>
>
> _M_streambuf_state |= __state;
> if (this->exceptions() & __state)
>   throw;
>      }
>
>
>
>
>
>
>
>      bool
>      good() const
>      { return this->rdstate() == 0; }
>
>
>
>
>
>
>
>      bool
>      eof() const
>      { return (this->rdstate() & eofbit) != 0; }
># 186 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      bool
>      fail() const
>      { return (this->rdstate() & (badbit | failbit)) != 0; }
>
>
>
>
>
>
>
>      bool
>      bad() const
>      { return (this->rdstate() & badbit) != 0; }
># 207 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      iostate
>      exceptions() const
>      { return _M_exception; }
># 242 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      void
>      exceptions(iostate __except)
>      {
>        _M_exception = __except;
>        this->clear(_M_streambuf_state);
>      }
>
>
>
>
>
>
>
>      explicit
>      basic_ios(basic_streambuf<_CharT, _Traits>* __sb)
>      : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0),
>      _M_ctype(0), _M_num_put(0), _M_num_get(0)
>      { this->init(__sb); }
>
>
>
>
>
>
>
>      virtual
>      ~basic_ios() { }
># 280 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      basic_ostream<_CharT, _Traits>*
>      tie() const
>      { return _M_tie; }
># 292 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      basic_ostream<_CharT, _Traits>*
>      tie(basic_ostream<_CharT, _Traits>* __tiestr)
>      {
>        basic_ostream<_CharT, _Traits>* __old = _M_tie;
>        _M_tie = __tiestr;
>        return __old;
>      }
>
>
>
>
>
>
>
>      basic_streambuf<_CharT, _Traits>*
>      rdbuf() const
>      { return _M_streambuf; }
># 332 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      basic_streambuf<_CharT, _Traits>*
>      rdbuf(basic_streambuf<_CharT, _Traits>* __sb);
># 346 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      basic_ios&
>      copyfmt(const basic_ios& __rhs);
>
>
>
>
>
>
>
>      char_type
>      fill() const
>      {
> if (!_M_fill_init)
>   {
>     _M_fill = this->widen(' ');
>     _M_fill_init = true;
>   }
> return _M_fill;
>      }
># 375 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      char_type
>      fill(char_type __ch)
>      {
> char_type __old = this->fill();
> _M_fill = __ch;
> return __old;
>      }
># 395 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      locale
>      imbue(const locale& __loc);
># 415 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      char
>      narrow(char_type __c, char __dfault) const;
># 433 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 3
>      char_type
>      widen(char __c) const;
>
>    protected:
>
>
>
>
>
>
>
>      basic_ios()
>      : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false),
>      _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0)
>      { }
>
>
>
>
>
>
>
>      void
>      init(basic_streambuf<_CharT, _Traits>* __sb);
>
>      void
>      _M_cache_locale(const locale& __loc);
>    };
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 3
>       
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 3
>
>namespace std
>{
>  template<typename _CharT, typename _Traits>
>    void
>    basic_ios<_CharT, _Traits>::clear(iostate __state)
>    {
>      if (this->rdbuf())
> _M_streambuf_state = __state;
>      else
>   _M_streambuf_state = __state | badbit;
>      if (this->exceptions() & this->rdstate())
> __throw_ios_failure(("basic_ios::clear"));
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_streambuf<_CharT, _Traits>*
>    basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb)
>    {
>      basic_streambuf<_CharT, _Traits>* __old = _M_streambuf;
>      _M_streambuf = __sb;
>      this->clear();
>      return __old;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ios<_CharT, _Traits>&
>    basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs)
>    {
>
>
>      if (this != &__rhs)
> {
>
>
>
>
>   _Words* __words = (__rhs._M_word_size <= _S_local_word_size) ?
>                      _M_local_word : new _Words[__rhs._M_word_size];
>
>
>   _Callback_list* __cb = __rhs._M_callbacks;
>   if (__cb)
>     __cb->_M_add_reference();
>   _M_call_callbacks(erase_event);
>   if (_M_word != _M_local_word)
>     {
>       delete [] _M_word;
>       _M_word = 0;
>     }
>   _M_dispose_callbacks();
>
>
>   _M_callbacks = __cb;
>   for (int __i = 0; __i < __rhs._M_word_size; ++__i)
>     __words[__i] = __rhs._M_word[__i];
>   _M_word = __words;
>   _M_word_size = __rhs._M_word_size;
>
>   this->flags(__rhs.flags());
>   this->width(__rhs.width());
>   this->precision(__rhs.precision());
>   this->tie(__rhs.tie());
>   this->fill(__rhs.fill());
>   _M_ios_locale = __rhs.getloc();
>   _M_cache_locale(_M_ios_locale);
>
>   _M_call_callbacks(copyfmt_event);
>
>
>   this->exceptions(__rhs.exceptions());
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    char
>    basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const
>    { return __check_facet(_M_ctype).narrow(__c, __dfault); }
>
>  template<typename _CharT, typename _Traits>
>    _CharT
>    basic_ios<_CharT, _Traits>::widen(char __c) const
>    { return __check_facet(_M_ctype).widen(__c); }
>
>
>  template<typename _CharT, typename _Traits>
>    locale
>    basic_ios<_CharT, _Traits>::imbue(const locale& __loc)
>    {
>      locale __old(this->getloc());
>      ios_base::imbue(__loc);
>      _M_cache_locale(__loc);
>      if (this->rdbuf() != 0)
> this->rdbuf()->pubimbue(__loc);
>      return __old;
>    }
>
>  template<typename _CharT, typename _Traits>
>    void
>    basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb)
>    {
>
>      ios_base::_M_init();
>
>
>      _M_cache_locale(_M_ios_locale);
># 159 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.tcc" 3
>      _M_fill = _CharT();
>      _M_fill_init = false;
>
>      _M_tie = 0;
>      _M_exception = goodbit;
>      _M_streambuf = __sb;
>      _M_streambuf_state = __sb ? goodbit : badbit;
>    }
>
>  template<typename _CharT, typename _Traits>
>    void
>    basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc)
>    {
>      if (__builtin_expect(has_facet<__ctype_type>(__loc), true))
> _M_ctype = &use_facet<__ctype_type>(__loc);
>      else
> _M_ctype = 0;
>
>      if (__builtin_expect(has_facet<__num_put_type>(__loc), true))
> _M_num_put = &use_facet<__num_put_type>(__loc);
>      else
> _M_num_put = 0;
>
>      if (__builtin_expect(has_facet<__num_get_type>(__loc), true))
> _M_num_get = &use_facet<__num_get_type>(__loc);
>      else
> _M_num_get = 0;
>    }
>
>
>
>
>
>  extern template class basic_ios<char>;
>
>
>  extern template class basic_ios<wchar_t>;
>
>
>}
># 465 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/basic_ios.h" 2 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ios" 2 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 2 3
>
>namespace std
>{
># 56 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_ostream : virtual public basic_ios<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef typename _Traits::int_type int_type;
>      typedef typename _Traits::pos_type pos_type;
>      typedef typename _Traits::off_type off_type;
>      typedef _Traits traits_type;
>
>
>      typedef basic_streambuf<_CharT, _Traits> __streambuf_type;
>      typedef basic_ios<_CharT, _Traits> __ios_type;
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> >
>             __num_put_type;
>      typedef ctype<_CharT> __ctype_type;
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_ostream<_CharT2, _Traits2>&
>        operator<<(basic_ostream<_CharT2, _Traits2>&, _CharT2);
>
>      template<typename _Traits2>
>        friend basic_ostream<char, _Traits2>&
>        operator<<(basic_ostream<char, _Traits2>&, char);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_ostream<_CharT2, _Traits2>&
>        operator<<(basic_ostream<_CharT2, _Traits2>&, const _CharT2*);
>
>      template<typename _Traits2>
>        friend basic_ostream<char, _Traits2>&
>        operator<<(basic_ostream<char, _Traits2>&, const char*);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_ostream<_CharT2, _Traits2>&
>        operator<<(basic_ostream<_CharT2, _Traits2>&, const char*);
># 103 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      explicit
>      basic_ostream(__streambuf_type* __sb)
>      { this->init(__sb); }
>
>
>
>
>
>
>      virtual
>      ~basic_ostream() { }
>
>
>      class sentry;
>      friend class sentry;
># 129 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      inline __ostream_type&
>      operator<<(__ostream_type& (*__pf)(__ostream_type&));
>
>      inline __ostream_type&
>      operator<<(__ios_type& (*__pf)(__ios_type&));
>
>      inline __ostream_type&
>      operator<<(ios_base& (*__pf) (ios_base&));
># 166 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      operator<<(long __n);
>
>      __ostream_type&
>      operator<<(unsigned long __n);
>
>      __ostream_type&
>      operator<<(bool __n);
>
>      __ostream_type&
>      operator<<(short __n);
>
>      __ostream_type&
>      operator<<(unsigned short __n);
>
>      __ostream_type&
>      operator<<(int __n);
>
>      __ostream_type&
>      operator<<(unsigned int __n);
>
>
>      __ostream_type&
>      operator<<(long long __n);
>
>      __ostream_type&
>      operator<<(unsigned long long __n);
>
>
>      __ostream_type&
>      operator<<(double __f);
>
>      __ostream_type&
>      operator<<(float __f);
>
>      __ostream_type&
>      operator<<(long double __f);
>
>      __ostream_type&
>      operator<<(const void* __p);
># 228 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      operator<<(__streambuf_type* __sb);
># 261 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      put(char_type __c);
>
>
>      void
>      _M_write(const char_type* __s, streamsize __n)
>      {
> streamsize __put = this->rdbuf()->sputn(__s, __n);
> if (__put != __n)
>   this->setstate(ios_base::badbit);
>      }
># 289 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      write(const char_type* __s, streamsize __n);
># 302 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      flush();
># 313 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      pos_type
>      tellp();
># 324 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      __ostream_type&
>      seekp(pos_type);
># 336 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>       __ostream_type&
>      seekp(off_type, ios_base::seekdir);
>
>    protected:
>      explicit
>      basic_ostream() { }
>    };
># 354 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template <typename _CharT, typename _Traits>
>    class basic_ostream<_CharT, _Traits>::sentry
>    {
>
>      bool _M_ok;
>      basic_ostream<_CharT,_Traits>& _M_os;
>
>    public:
># 373 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      explicit
>      sentry(basic_ostream<_CharT,_Traits>& __os);
># 383 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      ~sentry()
>      {
>
> if (_M_os.flags() & ios_base::unitbuf && !uncaught_exception())
>   {
>
>     if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1)
>       _M_os.setstate(ios_base::badbit);
>   }
>      }
># 401 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>      operator bool() const
>      { return _M_ok; }
>    };
># 422 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c);
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, char __c)
>    { return (__out << __out.widen(__c)); }
>
>
>  template <class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, char __c);
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, signed char __c)
>    { return (__out << static_cast<char>(__c)); }
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c)
>    { return (__out << static_cast<char>(__c)); }
># 462 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s);
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits> &
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s);
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, const char* __s);
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s)
>    { return (__out << reinterpret_cast<const char*>(__s)); }
>
>  template<class _Traits>
>    basic_ostream<char, _Traits> &
>    operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s)
>    { return (__out << reinterpret_cast<const char*>(__s)); }
># 496 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 3
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    endl(basic_ostream<_CharT, _Traits>& __os)
>    { return flush(__os.put(__os.widen('\n'))); }
>
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    ends(basic_ostream<_CharT, _Traits>& __os)
>    { return __os.put(_CharT()); }
>
>
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    flush(basic_ostream<_CharT, _Traits>& __os)
>    { return __os.flush(); }
>
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 3
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 1 3
># 40 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace __cxxabiv1
>{
>  class __class_type_info;
>}
># 59 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 3
>namespace std
>{
>
>
>
>
>
>
>  class type_info
>  {
>  public:
>
>
>
>
>    virtual ~type_info();
>
>  private:
>
>    type_info& operator=(const type_info&);
>    type_info(const type_info&);
>
>  protected:
>    const char *__name;
>
>  protected:
>    explicit type_info(const char *__n): __name(__n) { }
>
>  public:
>
>
>
>    const char* name() const
>    { return __name; }
># 105 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/typeinfo" 3
>    bool before(const type_info& __arg) const
>    { return __name < __arg.__name; }
>    bool operator==(const type_info& __arg) const
>    { return __name == __arg.__name; }
>
>    bool operator!=(const type_info& __arg) const
>    { return !operator==(__arg); }
>
>
>  public:
>
>    virtual bool __is_pointer_p() const;
>
>    virtual bool __is_function_p() const;
>
>
>
>
>
>
>
>    virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj,
>       unsigned __outer) const;
>
>
>    virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target,
>        void **__obj_ptr) const;
>  };
>
>
>
>
>
>
>  class bad_cast : public exception
>  {
>  public:
>    bad_cast() throw() { }
>
>
>    virtual ~bad_cast() throw();
>  };
>
>
>  class bad_typeid : public exception
>  {
>  public:
>    bad_typeid () throw() { }
>
>
>    virtual ~bad_typeid() throw();
>  };
>}
>
>#pragma GCC visibility pop
>
>}
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 2 3
>
>
>namespace std
>{
>  template<typename _Facet>
>    locale
>    locale::combine(const locale& __other) const
>    {
>      _Impl* __tmp = new _Impl(*_M_impl, 1);
>      try
> {
>   __tmp->_M_replace_facet(__other._M_impl, &_Facet::id);
> }
>      catch(...)
> {
>   __tmp->_M_remove_reference();
>   throw;
> }
>      return locale(__tmp);
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    bool
>    locale::operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1,
>                       const basic_string<_CharT, _Traits, _Alloc>& __s2) const
>    {
>      typedef std::collate<_CharT> __collate_type;
>      const __collate_type& __collate = use_facet<__collate_type>(*this);
>      return (__collate.compare(__s1.data(), __s1.data() + __s1.length(),
>    __s2.data(), __s2.data() + __s2.length()) < 0);
>    }
># 86 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _Facet>
>    inline bool
>    has_facet(const locale& __loc) throw()
>    {
>      const size_t __i = _Facet::id._M_id();
>      const locale::facet** __facets = __loc._M_impl->_M_facets;
>      return (__i < __loc._M_impl->_M_facets_size && __facets[__i]);
>    }
># 108 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _Facet>
>    inline const _Facet&
>    use_facet(const locale& __loc)
>    {
>      const size_t __i = _Facet::id._M_id();
>      const locale::facet** __facets = __loc._M_impl->_M_facets;
>      if (!(__i < __loc._M_impl->_M_facets_size && __facets[__i]))
>        __throw_bad_cast();
>      return static_cast<const _Facet&>(*__facets[__i]);
>    }
>
>
>
>  template<typename _Facet>
>    struct __use_cache
>    {
>      const _Facet*
>      operator() (const locale& __loc) const;
>    };
>
>
>  template<typename _CharT>
>    struct __use_cache<__numpunct_cache<_CharT> >
>    {
>      const __numpunct_cache<_CharT>*
>      operator() (const locale& __loc) const
>      {
> const size_t __i = numpunct<_CharT>::id._M_id();
> const locale::facet** __caches = __loc._M_impl->_M_caches;
> if (!__caches[__i])
>   {
>     __numpunct_cache<_CharT>* __tmp = __null;
>     try
>       {
>  __tmp = new __numpunct_cache<_CharT>;
>  __tmp->_M_cache(__loc);
>       }
>     catch(...)
>       {
>  delete __tmp;
>  throw;
>       }
>     __loc._M_impl->_M_install_cache(__tmp, __i);
>   }
> return static_cast<const __numpunct_cache<_CharT>*>(__caches[__i]);
>      }
>    };
>
>  template<typename _CharT, bool _Intl>
>    struct __use_cache<__moneypunct_cache<_CharT, _Intl> >
>    {
>      const __moneypunct_cache<_CharT, _Intl>*
>      operator() (const locale& __loc) const
>      {
> const size_t __i = moneypunct<_CharT, _Intl>::id._M_id();
> const locale::facet** __caches = __loc._M_impl->_M_caches;
> if (!__caches[__i])
>   {
>     __moneypunct_cache<_CharT, _Intl>* __tmp = __null;
>     try
>       {
>  __tmp = new __moneypunct_cache<_CharT, _Intl>;
>  __tmp->_M_cache(__loc);
>       }
>     catch(...)
>       {
>  delete __tmp;
>  throw;
>       }
>     __loc._M_impl->_M_install_cache(__tmp, __i);
>   }
> return static_cast<
>   const __moneypunct_cache<_CharT, _Intl>*>(__caches[__i]);
>      }
>    };
>
>  template<typename _CharT>
>    void
>    __numpunct_cache<_CharT>::_M_cache(const locale& __loc)
>    {
>      _M_allocated = true;
>
>      const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc);
>
>      _M_grouping_size = __np.grouping().size();
>      char* __grouping = new char[_M_grouping_size];
>      __np.grouping().copy(__grouping, _M_grouping_size);
>      _M_grouping = __grouping;
>      _M_use_grouping = (_M_grouping_size
>    && static_cast<signed char>(__np.grouping()[0]) > 0);
>
>      _M_truename_size = __np.truename().size();
>      _CharT* __truename = new _CharT[_M_truename_size];
>      __np.truename().copy(__truename, _M_truename_size);
>      _M_truename = __truename;
>
>      _M_falsename_size = __np.falsename().size();
>      _CharT* __falsename = new _CharT[_M_falsename_size];
>      __np.falsename().copy(__falsename, _M_falsename_size);
>      _M_falsename = __falsename;
>
>      _M_decimal_point = __np.decimal_point();
>      _M_thousands_sep = __np.thousands_sep();
>
>      const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc);
>      __ct.widen(__num_base::_S_atoms_out,
>   __num_base::_S_atoms_out + __num_base::_S_oend, _M_atoms_out);
>      __ct.widen(__num_base::_S_atoms_in,
>   __num_base::_S_atoms_in + __num_base::_S_iend, _M_atoms_in);
>    }
>
>  template<typename _CharT, bool _Intl>
>    void
>    __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc)
>    {
>      _M_allocated = true;
>
>      const moneypunct<_CharT, _Intl>& __mp =
> use_facet<moneypunct<_CharT, _Intl> >(__loc);
>
>      _M_grouping_size = __mp.grouping().size();
>      char* __grouping = new char[_M_grouping_size];
>      __mp.grouping().copy(__grouping, _M_grouping_size);
>      _M_grouping = __grouping;
>      _M_use_grouping = (_M_grouping_size
>    && static_cast<signed char>(__mp.grouping()[0]) > 0);
>
>      _M_decimal_point = __mp.decimal_point();
>      _M_thousands_sep = __mp.thousands_sep();
>      _M_frac_digits = __mp.frac_digits();
>
>      _M_curr_symbol_size = __mp.curr_symbol().size();
>      _CharT* __curr_symbol = new _CharT[_M_curr_symbol_size];
>      __mp.curr_symbol().copy(__curr_symbol, _M_curr_symbol_size);
>      _M_curr_symbol = __curr_symbol;
>
>      _M_positive_sign_size = __mp.positive_sign().size();
>      _CharT* __positive_sign = new _CharT[_M_positive_sign_size];
>      __mp.positive_sign().copy(__positive_sign, _M_positive_sign_size);
>      _M_positive_sign = __positive_sign;
>
>      _M_negative_sign_size = __mp.negative_sign().size();
>      _CharT* __negative_sign = new _CharT[_M_negative_sign_size];
>      __mp.negative_sign().copy(__negative_sign, _M_negative_sign_size);
>      _M_negative_sign = __negative_sign;
>
>      _M_pos_format = __mp.pos_format();
>      _M_neg_format = __mp.neg_format();
>
>      const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc);
>      __ct.widen(money_base::_S_atoms,
>   money_base::_S_atoms + money_base::_S_end, _M_atoms);
>    }
># 271 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  static bool
>  __verify_grouping(const char* __grouping, size_t __grouping_size,
>      const string& __grouping_tmp);
>
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io,
>       ios_base::iostate& __err, string& __xtrc) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      typedef __numpunct_cache<_CharT> __cache_type;
>      __use_cache<__cache_type> __uc;
>      const locale& __loc = __io._M_getloc();
>      const __cache_type* __lc = __uc(__loc);
>      const _CharT* __lit = __lc->_M_atoms_in;
>      char_type __c = char_type();
>
>
>      bool __testeof = __beg == __end;
>
>
>      if (!__testeof)
> {
>   __c = *__beg;
>   const bool __plus = __c == __lit[__num_base::_S_iplus];
>   if ((__plus || __c == __lit[__num_base::_S_iminus])
>       && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep)
>       && !(__c == __lc->_M_decimal_point))
>     {
>       __xtrc += __plus ? '+' : '-';
>       if (++__beg != __end)
>  __c = *__beg;
>       else
>  __testeof = true;
>     }
> }
>
>
>      bool __found_mantissa = false;
>      int __sep_pos = 0;
>      while (!__testeof)
> {
>   if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep
>       || __c == __lc->_M_decimal_point)
>     break;
>   else if (__c == __lit[__num_base::_S_izero])
>     {
>       if (!__found_mantissa)
>  {
>    __xtrc += '0';
>    __found_mantissa = true;
>  }
>       ++__sep_pos;
>
>       if (++__beg != __end)
>  __c = *__beg;
>       else
>  __testeof = true;
>     }
>   else
>     break;
> }
>
>
>      bool __found_dec = false;
>      bool __found_sci = false;
>      string __found_grouping;
>      if (__lc->_M_use_grouping)
> __found_grouping.reserve(32);
>      const char_type* __q;
>      const char_type* __lit_zero = __lit + __num_base::_S_izero;
>      while (!__testeof)
>        {
>
>
>          if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep)
>     {
>       if (!__found_dec && !__found_sci)
>  {
>
>
>    if (__sep_pos)
>      {
>        __found_grouping += static_cast<char>(__sep_pos);
>        __sep_pos = 0;
>      }
>    else
>      {
>
>
>        __xtrc.clear();
>        break;
>      }
>  }
>       else
>  break;
>            }
>   else if (__c == __lc->_M_decimal_point)
>     {
>       if (!__found_dec && !__found_sci)
>  {
>
>
>
>    if (__found_grouping.size())
>      __found_grouping += static_cast<char>(__sep_pos);
>    __xtrc += '.';
>    __found_dec = true;
>  }
>       else
>  break;
>     }
>          else if ((__q = __traits_type::find(__lit_zero, 10, __c)))
>     {
>       __xtrc += __num_base::_S_atoms_in[__q - __lit];
>       __found_mantissa = true;
>       ++__sep_pos;
>     }
>   else if ((__c == __lit[__num_base::_S_ie]
>      || __c == __lit[__num_base::_S_iE])
>     && !__found_sci && __found_mantissa)
>     {
>
>       if (__found_grouping.size() && !__found_dec)
>  __found_grouping += static_cast<char>(__sep_pos);
>       __xtrc += 'e';
>       __found_sci = true;
>
>
>       if (++__beg != __end)
>  {
>    __c = *__beg;
>    const bool __plus = __c == __lit[__num_base::_S_iplus];
>    if ((__plus || __c == __lit[__num_base::_S_iminus])
>        && !(__lc->_M_use_grouping
>      && __c == __lc->_M_thousands_sep)
>        && !(__c == __lc->_M_decimal_point))
>      __xtrc += __plus ? '+' : '-';
>    else
>      continue;
>  }
>       else
>  {
>    __testeof = true;
>    break;
>  }
>     }
>   else
>
>     break;
>
>   if (++__beg != __end)
>     __c = *__beg;
>   else
>     __testeof = true;
>        }
>
>
>
>      if (__found_grouping.size())
>        {
>
>   if (!__found_dec && !__found_sci)
>     __found_grouping += static_cast<char>(__sep_pos);
>
>          if (!std::__verify_grouping(__lc->_M_grouping,
>          __lc->_M_grouping_size,
>          __found_grouping))
>     __err |= ios_base::failbit;
>        }
>
>
>      if (__testeof)
>        __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>
>
>  template<typename _ValueT>
>    struct __to_unsigned_type
>    { typedef _ValueT __type; };
>
>  template<>
>    struct __to_unsigned_type<long>
>    { typedef unsigned long __type; };
>
>
>  template<>
>    struct __to_unsigned_type<long long>
>    { typedef unsigned long long __type; };
>
>
>
>
>  template<typename _CharT, typename _InIter>
>    template<typename _ValueT>
>      _InIter
>      num_get<_CharT, _InIter>::
>      _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io,
>       ios_base::iostate& __err, _ValueT& __v) const
>      {
>        typedef char_traits<_CharT> __traits_type;
> typedef typename __to_unsigned_type<_ValueT>::__type __unsigned_type;
> typedef __numpunct_cache<_CharT> __cache_type;
> __use_cache<__cache_type> __uc;
> const locale& __loc = __io._M_getloc();
> const __cache_type* __lc = __uc(__loc);
> const _CharT* __lit = __lc->_M_atoms_in;
> char_type __c = char_type();
>
>
> const ios_base::fmtflags __basefield = __io.flags()
>                                        & ios_base::basefield;
> const bool __oct = __basefield == ios_base::oct;
> int __base = __oct ? 8 : (__basefield == ios_base::hex ? 16 : 10);
>
>
> bool __testeof = __beg == __end;
>
>
> bool __negative = false;
> if (!__testeof)
>   {
>     __c = *__beg;
>     if (numeric_limits<_ValueT>::is_signed)
>       __negative = __c == __lit[__num_base::_S_iminus];
>     if ((__negative || __c == __lit[__num_base::_S_iplus])
>  && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep)
>  && !(__c == __lc->_M_decimal_point))
>       {
>  if (++__beg != __end)
>    __c = *__beg;
>  else
>    __testeof = true;
>       }
>   }
>
>
>
> bool __found_zero = false;
> int __sep_pos = 0;
> while (!__testeof)
>   {
>     if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep
>  || __c == __lc->_M_decimal_point)
>       break;
>     else if (__c == __lit[__num_base::_S_izero]
>       && (!__found_zero || __base == 10))
>       {
>  __found_zero = true;
>  ++__sep_pos;
>  if (__basefield == 0)
>    __base = 8;
>  if (__base == 8)
>    __sep_pos = 0;
>       }
>     else if (__found_zero
>       && (__c == __lit[__num_base::_S_ix]
>    || __c == __lit[__num_base::_S_iX]))
>       {
>  if (__basefield == 0)
>    __base = 16;
>  if (__base == 16)
>    {
>      __found_zero = false;
>      __sep_pos = 0;
>    }
>  else
>    break;
>       }
>     else
>       break;
>
>     if (++__beg != __end)
>       {
>  __c = *__beg;
>  if (!__found_zero)
>    break;
>       }
>     else
>       __testeof = true;
>   }
>
>
>
> const size_t __len = (__base == 16 ? __num_base::_S_iend
>         - __num_base::_S_izero : __base);
>
>
> string __found_grouping;
> if (__lc->_M_use_grouping)
>   __found_grouping.reserve(32);
> bool __testfail = false;
> const __unsigned_type __max = __negative ?
>   -numeric_limits<_ValueT>::min() : numeric_limits<_ValueT>::max();
> const __unsigned_type __smax = __max / __base;
> __unsigned_type __result = 0;
> const char_type* __q;
> const char_type* __lit_zero = __lit + __num_base::_S_izero;
> while (!__testeof)
>   {
>
>
>     if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep)
>       {
>
>
>  if (__sep_pos)
>    {
>      __found_grouping += static_cast<char>(__sep_pos);
>      __sep_pos = 0;
>    }
>  else
>    {
>      __testfail = true;
>      break;
>    }
>       }
>     else if (__c == __lc->_M_decimal_point)
>       break;
>     else if ((__q = __traits_type::find(__lit_zero, __len, __c)))
>       {
>  int __digit = __q - __lit_zero;
>  if (__digit > 15)
>    __digit -= 6;
>  if (__result > __smax)
>    __testfail = true;
>  else
>    {
>      __result *= __base;
>      __testfail |= __result > __max - __digit;
>      __result += __digit;
>      ++__sep_pos;
>    }
>       }
>     else
>
>       break;
>
>     if (++__beg != __end)
>       __c = *__beg;
>     else
>       __testeof = true;
>   }
>
>
>
> if (__found_grouping.size())
>   {
>
>     __found_grouping += static_cast<char>(__sep_pos);
>
>     if (!std::__verify_grouping(__lc->_M_grouping,
>     __lc->_M_grouping_size,
>     __found_grouping))
>       __err |= ios_base::failbit;
>   }
>
> if (!__testfail && (__sep_pos || __found_zero
>       || __found_grouping.size()))
>   __v = __negative ? -__result : __result;
> else
>   __err |= ios_base::failbit;
>
> if (__testeof)
>   __err |= ios_base::eofbit;
> return __beg;
>      }
>
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, bool& __v) const
>    {
>      if (!(__io.flags() & ios_base::boolalpha))
>        {
>
>
>
>   long __l = -1;
>          __beg = _M_extract_int(__beg, __end, __io, __err, __l);
>   if (__l == 0 || __l == 1)
>     __v = __l;
>   else
>            __err |= ios_base::failbit;
>        }
>      else
>        {
>
>   typedef __numpunct_cache<_CharT> __cache_type;
>   __use_cache<__cache_type> __uc;
>   const locale& __loc = __io._M_getloc();
>   const __cache_type* __lc = __uc(__loc);
>
>   bool __testf = true;
>   bool __testt = true;
>   size_t __n;
>   bool __testeof = __beg == __end;
>          for (__n = 0; !__testeof; ++__n)
>            {
>       const char_type __c = *__beg;
>
>       if (__testf)
>  if (__n < __lc->_M_falsename_size)
>    __testf = __c == __lc->_M_falsename[__n];
>  else
>    break;
>
>       if (__testt)
>  if (__n < __lc->_M_truename_size)
>    __testt = __c == __lc->_M_truename[__n];
>  else
>    break;
>
>       if (!__testf && !__testt)
>  break;
>
>       if (++__beg == __end)
>  __testeof = true;
>            }
>   if (__testf && __n == __lc->_M_falsename_size)
>     __v = 0;
>   else if (__testt && __n == __lc->_M_truename_size)
>     __v = 1;
>   else
>     __err |= ios_base::failbit;
>
>          if (__testeof)
>            __err |= ios_base::eofbit;
>        }
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, unsigned short& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, unsigned int& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, unsigned long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, long long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, unsigned long long& __v) const
>    { return _M_extract_int(__beg, __end, __io, __err, __v); }
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>    ios_base::iostate& __err, float& __v) const
>    {
>      string __xtrc;
>      __xtrc.reserve(32);
>      __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc);
>      std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale());
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, double& __v) const
>    {
>      string __xtrc;
>      __xtrc.reserve(32);
>      __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc);
>      std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale());
>      return __beg;
>    }
># 796 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, long double& __v) const
>    {
>      string __xtrc;
>      __xtrc.reserve(32);
>      __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc);
>      std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale());
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    num_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, ios_base& __io,
>           ios_base::iostate& __err, void*& __v) const
>    {
>
>      typedef ios_base::fmtflags fmtflags;
>      const fmtflags __fmt = __io.flags();
>      __io.flags(__fmt & ~ios_base::basefield | ios_base::hex);
>
>      unsigned long __ul;
>      __beg = _M_extract_int(__beg, __end, __io, __err, __ul);
>
>
>      __io.flags(__fmt);
>
>      if (!(__err & ios_base::failbit))
> __v = reinterpret_cast<void*>(__ul);
>      return __beg;
>    }
>
>
>
>  template<typename _CharT, typename _OutIter>
>    void
>    num_put<_CharT, _OutIter>::
>    _M_pad(_CharT __fill, streamsize __w, ios_base& __io,
>    _CharT* __new, const _CharT* __cs, int& __len) const
>    {
>
>
>      __pad<_CharT, char_traits<_CharT> >::_S_pad(__io, __fill, __new, __cs,
>        __w, __len, true);
>      __len = static_cast<int>(__w);
>    }
>
>
>
>
>
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, long __v, const _CharT* __lit,
>    ios_base::fmtflags __flags)
>    {
>      unsigned long __ul = __v;
>      const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
>      if (__builtin_expect(__basefield != ios_base::oct
>      && __basefield != ios_base::hex, true))
> __ul = __v < 0 ? -__v : __ul;
>      return __int_to_char(__bufend, __ul, __lit, __flags, false);
>    }
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, unsigned long __v, const _CharT* __lit,
>    ios_base::fmtflags __flags)
>    { return __int_to_char(__bufend, __v, __lit, __flags, false); }
>
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, long long __v, const _CharT* __lit,
>    ios_base::fmtflags __flags)
>    {
>      unsigned long long __ull = __v;
>      const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
>      if (__builtin_expect(__basefield != ios_base::oct
>      && __basefield != ios_base::hex, true))
> __ull = __v < 0 ? -__v : __ull;
>      return __int_to_char(__bufend, __ull, __lit, __flags, false);
>    }
>
>  template<typename _CharT>
>    inline int
>    __int_to_char(_CharT* __bufend, unsigned long long __v,
>    const _CharT* __lit, ios_base::fmtflags __flags)
>    { return __int_to_char(__bufend, __v, __lit, __flags, false); }
>
>
>
>  template<typename _CharT, typename _ValueT>
>    int
>    __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit,
>    ios_base::fmtflags __flags, bool)
>    {
>      const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
>      _CharT* __buf = __bufend;
>
>      if (__builtin_expect(__basefield != ios_base::oct
>      && __basefield != ios_base::hex, true))
> {
>
>   do
>     {
>       *--__buf = __lit[(__v % 10) + __num_base::_S_odigits];
>       __v /= 10;
>     }
>   while (__v != 0);
> }
>      else if (__basefield == ios_base::oct)
> {
>
>   do
>     {
>       *--__buf = __lit[(__v & 0x7) + __num_base::_S_odigits];
>       __v >>= 3;
>     }
>   while (__v != 0);
> }
>      else
> {
>
>   const bool __uppercase = __flags & ios_base::uppercase;
>   const int __case_offset = __uppercase ? __num_base::_S_oudigits
>                                         : __num_base::_S_odigits;
>   do
>     {
>       *--__buf = __lit[(__v & 0xf) + __case_offset];
>       __v >>= 4;
>     }
>   while (__v != 0);
> }
>      return __bufend - __buf;
>    }
>
>
>
>  template<typename _CharT, typename _OutIter>
>    void
>    num_put<_CharT, _OutIter>::
>    _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep,
>   ios_base&, _CharT* __new, _CharT* __cs, int& __len) const
>    {
>      _CharT* __p = std::__add_grouping(__new, __sep, __grouping,
>     __grouping_size, __cs, __cs + __len);
>      __len = __p - __new;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    template<typename _ValueT>
>      _OutIter
>      num_put<_CharT, _OutIter>::
>      _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill,
>      _ValueT __v) const
>      {
> typedef __numpunct_cache<_CharT> __cache_type;
> __use_cache<__cache_type> __uc;
> const locale& __loc = __io._M_getloc();
> const __cache_type* __lc = __uc(__loc);
> const _CharT* __lit = __lc->_M_atoms_out;
> const ios_base::fmtflags __flags = __io.flags();
>
>
> const int __ilen = 5 * sizeof(_ValueT);
> _CharT* __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>            * __ilen));
>
>
>
> int __len = __int_to_char(__cs + __ilen, __v, __lit, __flags);
> __cs += __ilen - __len;
>
>
> if (__lc->_M_use_grouping)
>   {
>
>
>     _CharT* __cs2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>          * (__len + 1)
>          * 2));
>     _M_group_int(__lc->_M_grouping, __lc->_M_grouping_size,
>    __lc->_M_thousands_sep, __io, __cs2 + 2, __cs, __len);
>     __cs = __cs2 + 2;
>   }
>
>
> const ios_base::fmtflags __basefield = __flags & ios_base::basefield;
> if (__builtin_expect(__basefield != ios_base::oct
>        && __basefield != ios_base::hex, true))
>   {
>
>     if (__v > 0)
>       {
>  if (__flags & ios_base::showpos
>      && numeric_limits<_ValueT>::is_signed)
>    *--__cs = __lit[__num_base::_S_oplus], ++__len;
>       }
>     else if (__v)
>       *--__cs = __lit[__num_base::_S_ominus], ++__len;
>   }
> else if (__flags & ios_base::showbase && __v)
>   {
>     if (__basefield == ios_base::oct)
>       *--__cs = __lit[__num_base::_S_odigits], ++__len;
>     else
>       {
>
>  const bool __uppercase = __flags & ios_base::uppercase;
>  *--__cs = __lit[__num_base::_S_ox + __uppercase];
>
>  *--__cs = __lit[__num_base::_S_odigits];
>  __len += 2;
>       }
>   }
>
>
> const streamsize __w = __io.width();
> if (__w > static_cast<streamsize>(__len))
>   {
>     _CharT* __cs3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>          * __w));
>     _M_pad(__fill, __w, __io, __cs3, __cs, __len);
>     __cs = __cs3;
>   }
> __io.width(0);
>
>
>
> return std::__write(__s, __cs, __len);
>      }
>
>  template<typename _CharT, typename _OutIter>
>    void
>    num_put<_CharT, _OutIter>::
>    _M_group_float(const char* __grouping, size_t __grouping_size,
>     _CharT __sep, const _CharT* __p, _CharT* __new,
>     _CharT* __cs, int& __len) const
>    {
>
>
>
>      const int __declen = __p ? __p - __cs : __len;
>      _CharT* __p2 = std::__add_grouping(__new, __sep, __grouping,
>      __grouping_size,
>      __cs, __cs + __declen);
>
>
>      int __newlen = __p2 - __new;
>      if (__p)
> {
>   char_traits<_CharT>::copy(__p2, __p, __len - __declen);
>   __newlen += __len - __declen;
> }
>      __len = __newlen;
>    }
># 1068 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _OutIter>
>    template<typename _ValueT>
>      _OutIter
>      num_put<_CharT, _OutIter>::
>      _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod,
>         _ValueT __v) const
>      {
> typedef __numpunct_cache<_CharT> __cache_type;
> __use_cache<__cache_type> __uc;
> const locale& __loc = __io._M_getloc();
> const __cache_type* __lc = __uc(__loc);
>
>
> streamsize __prec = __io.precision();
> if (__prec < static_cast<streamsize>(0))
>   __prec = static_cast<streamsize>(6);
>
> const int __max_digits = numeric_limits<_ValueT>::digits10;
>
>
> int __len;
>
> char __fbuf[16];
>
>
>
>
> int __cs_size = __max_digits * 3;
> char* __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>
> __num_base::_S_format_float(__io, __fbuf, __mod);
> __len = std::__convert_from_v(__cs, __cs_size, __fbuf, __v,
>          _S_get_c_locale(), __prec);
>
>
> if (__len >= __cs_size)
>   {
>     __cs_size = __len + 1;
>     __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>     __len = std::__convert_from_v(__cs, __cs_size, __fbuf, __v,
>       _S_get_c_locale(), __prec);
>   }
># 1132 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
> const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
> _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>            * __len));
> __ctype.widen(__cs, __cs + __len, __ws);
>
>
> const _CharT __cdec = __ctype.widen('.');
> const _CharT __dec = __lc->_M_decimal_point;
> const _CharT* __p = char_traits<_CharT>::find(__ws, __len, __cdec);
> if (__p)
>   __ws[__p - __ws] = __dec;
>
>
>
>
> if (__lc->_M_use_grouping
>     && (__p || __len < 3 || (__cs[1] <= '9' && __cs[2] <= '9'
>         && __cs[1] >= '0' && __cs[2] >= '0')))
>   {
>
>
>     _CharT* __ws2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>          * __len * 2));
>
>     streamsize __off = 0;
>     if (__cs[0] == '-' || __cs[0] == '+')
>       {
>  __off = 1;
>  __ws2[0] = __ws[0];
>  __len -= 1;
>       }
>
>     _M_group_float(__lc->_M_grouping, __lc->_M_grouping_size,
>      __lc->_M_thousands_sep, __p, __ws2 + __off,
>      __ws + __off, __len);
>     __len += __off;
>
>     __ws = __ws2;
>   }
>
>
> const streamsize __w = __io.width();
> if (__w > static_cast<streamsize>(__len))
>   {
>     _CharT* __ws3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>          * __w));
>     _M_pad(__fill, __w, __io, __ws3, __ws, __len);
>     __ws = __ws3;
>   }
> __io.width(0);
>
>
>
> return std::__write(__s, __ws, __len);
>      }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const
>    {
>      const ios_base::fmtflags __flags = __io.flags();
>      if ((__flags & ios_base::boolalpha) == 0)
>        {
>          const long __l = __v;
>          __s = _M_insert_int(__s, __io, __fill, __l);
>        }
>      else
>        {
>   typedef __numpunct_cache<_CharT> __cache_type;
>   __use_cache<__cache_type> __uc;
>   const locale& __loc = __io._M_getloc();
>   const __cache_type* __lc = __uc(__loc);
>
>   const _CharT* __name = __v ? __lc->_M_truename
>                              : __lc->_M_falsename;
>   int __len = __v ? __lc->_M_truename_size
>                   : __lc->_M_falsename_size;
>
>   const streamsize __w = __io.width();
>   if (__w > static_cast<streamsize>(__len))
>     {
>       _CharT* __cs
>  = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>       * __w));
>       _M_pad(__fill, __w, __io, __cs, __name, __len);
>       __name = __cs;
>     }
>   __io.width(0);
>   __s = std::__write(__s, __name, __len);
> }
>      return __s;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill,
>           unsigned long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill,
>           unsigned long long __v) const
>    { return _M_insert_int(__s, __io, __fill, __v); }
>
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const
>    { return _M_insert_float(__s, __io, __fill, char(), __v); }
># 1269 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill,
>    long double __v) const
>    { return _M_insert_float(__s, __io, __fill, 'L', __v); }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    num_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type __fill,
>           const void* __v) const
>    {
>      const ios_base::fmtflags __flags = __io.flags();
>      const ios_base::fmtflags __fmt = ~(ios_base::basefield
>      | ios_base::uppercase
>      | ios_base::internal);
>      __io.flags(__flags & __fmt | (ios_base::hex | ios_base::showbase));
>
>      __s = _M_insert_int(__s, __io, __fill,
>     reinterpret_cast<unsigned long>(__v));
>      __io.flags(__flags);
>      return __s;
>    }
>
>  template<typename _CharT, typename _InIter>
>    template<bool _Intl>
>      _InIter
>      money_get<_CharT, _InIter>::
>      _M_extract(iter_type __beg, iter_type __end, ios_base& __io,
>   ios_base::iostate& __err, string& __units) const
>      {
> typedef char_traits<_CharT> __traits_type;
> typedef typename string_type::size_type size_type;
> typedef money_base::part part;
> typedef __moneypunct_cache<_CharT, _Intl> __cache_type;
>
> const locale& __loc = __io._M_getloc();
> const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
> __use_cache<__cache_type> __uc;
> const __cache_type* __lc = __uc(__loc);
> const char_type* __lit = __lc->_M_atoms;
>
>
> bool __negative = false;
>
> size_type __sign_size = 0;
>
> const bool __mandatory_sign = (__lc->_M_positive_sign_size
>           && __lc->_M_negative_sign_size);
>
> string __grouping_tmp;
> if (__lc->_M_use_grouping)
>   __grouping_tmp.reserve(32);
>
> int __last_pos = 0;
>
> int __n = 0;
>
> bool __testvalid = true;
>
> bool __testdecfound = false;
>
>
> string __res;
> __res.reserve(32);
>
> const char_type* __lit_zero = __lit + money_base::_S_zero;
> const money_base::pattern __p = __lc->_M_neg_format;
> for (int __i = 0; __i < 4 && __testvalid; ++__i)
>   {
>     const part __which = static_cast<part>(__p.field[__i]);
>     switch (__which)
>       {
>       case money_base::symbol:
>
>
>
>
>  if (__io.flags() & ios_base::showbase || __sign_size > 1
>      || __i == 0
>      || (__i == 1 && (__mandatory_sign
>         || (static_cast<part>(__p.field[0])
>      == money_base::sign)
>         || (static_cast<part>(__p.field[2])
>      == money_base::space)))
>      || (__i == 2 && ((static_cast<part>(__p.field[3])
>          == money_base::value)
>         || __mandatory_sign
>         && (static_cast<part>(__p.field[3])
>      == money_base::sign))))
>    {
>      const size_type __len = __lc->_M_curr_symbol_size;
>      size_type __j = 0;
>      for (; __beg != __end && __j < __len
>      && *__beg == __lc->_M_curr_symbol[__j];
>    ++__beg, ++__j);
>      if (__j != __len
>   && (__j || __io.flags() & ios_base::showbase))
>        __testvalid = false;
>    }
>  break;
>       case money_base::sign:
>
>  if (__lc->_M_positive_sign_size && __beg != __end
>      && *__beg == __lc->_M_positive_sign[0])
>    {
>      __sign_size = __lc->_M_positive_sign_size;
>      ++__beg;
>    }
>  else if (__lc->_M_negative_sign_size && __beg != __end
>    && *__beg == __lc->_M_negative_sign[0])
>    {
>      __negative = true;
>      __sign_size = __lc->_M_negative_sign_size;
>      ++__beg;
>    }
>  else if (__lc->_M_positive_sign_size
>    && !__lc->_M_negative_sign_size)
>
>
>    __negative = true;
>  else if (__mandatory_sign)
>    __testvalid = false;
>  break;
>       case money_base::value:
>
>
>  for (; __beg != __end; ++__beg)
>    {
>      const char_type __c = *__beg;
>      const char_type* __q = __traits_type::find(__lit_zero,
>              10, __c);
>      if (__q != 0)
>        {
>   __res += money_base::_S_atoms[__q - __lit];
>   ++__n;
>        }
>      else if (__c == __lc->_M_decimal_point
>        && !__testdecfound)
>        {
>   __last_pos = __n;
>   __n = 0;
>   __testdecfound = true;
>        }
>      else if (__lc->_M_use_grouping
>        && __c == __lc->_M_thousands_sep
>        && !__testdecfound)
>        {
>   if (__n)
>     {
>
>       __grouping_tmp += static_cast<char>(__n);
>       __n = 0;
>     }
>   else
>     {
>       __testvalid = false;
>       break;
>     }
>        }
>      else
>        break;
>    }
>  if (__res.empty())
>    __testvalid = false;
>  break;
>       case money_base::space:
>
>  if (__beg != __end && __ctype.is(ctype_base::space, *__beg))
>    ++__beg;
>  else
>    __testvalid = false;
>       case money_base::none:
>
>  if (__i != 3)
>    for (; __beg != __end
>    && __ctype.is(ctype_base::space, *__beg); ++__beg);
>  break;
>       }
>   }
>
>
> if (__sign_size > 1 && __testvalid)
>   {
>     const char_type* __sign = __negative ? __lc->_M_negative_sign
>                                          : __lc->_M_positive_sign;
>     size_type __i = 1;
>     for (; __beg != __end && __i < __sign_size
>     && *__beg == __sign[__i]; ++__beg, ++__i);
>
>     if (__i != __sign_size)
>       __testvalid = false;
>   }
>
> if (__testvalid)
>   {
>
>     if (__res.size() > 1)
>       {
>  const size_type __first = __res.find_first_not_of('0');
>  const bool __only_zeros = __first == string::npos;
>  if (__first)
>    __res.erase(0, __only_zeros ? __res.size() - 1 : __first);
>       }
>
>
>     if (__negative && __res[0] != '0')
>       __res.insert(__res.begin(), '-');
>
>
>     if (__grouping_tmp.size())
>       {
>
>  __grouping_tmp += static_cast<char>(__testdecfound ? __last_pos
>                         : __n);
>  if (!std::__verify_grouping(__lc->_M_grouping,
>         __lc->_M_grouping_size,
>         __grouping_tmp))
>    __err |= ios_base::failbit;
>       }
>
>
>     if (__testdecfound && __lc->_M_frac_digits > 0
>  && __n != __lc->_M_frac_digits)
>       __testvalid = false;
>   }
>
>
> if (!__testvalid)
>   __err |= ios_base::failbit;
> else
>   __units.swap(__res);
>
>
> if (__beg == __end)
>   __err |= ios_base::eofbit;
> return __beg;
>      }
># 1527 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _InIter>
>    _InIter
>    money_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,
>    ios_base::iostate& __err, long double& __units) const
>    {
>      string __str;
>      if (__intl)
> __beg = _M_extract<true>(__beg, __end, __io, __err, __str);
>      else
> __beg = _M_extract<false>(__beg, __end, __io, __err, __str);
>      std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale());
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    money_get<_CharT, _InIter>::
>    do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,
>    ios_base::iostate& __err, string_type& __units) const
>    {
>      typedef typename string::size_type size_type;
>
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>      string __str;
>      const iter_type __ret = __intl ? _M_extract<true>(__beg, __end, __io,
>       __err, __str)
>                              : _M_extract<false>(__beg, __end, __io,
>        __err, __str);
>      const size_type __len = __str.size();
>      if (__len)
> {
>   _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>              * __len));
>   __ctype.widen(__str.data(), __str.data() + __len, __ws);
>   __units.assign(__ws, __len);
> }
>
>      return __ret;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    template<bool _Intl>
>      _OutIter
>      money_put<_CharT, _OutIter>::
>      _M_insert(iter_type __s, ios_base& __io, char_type __fill,
>  const string_type& __digits) const
>      {
> typedef typename string_type::size_type size_type;
> typedef money_base::part part;
> typedef __moneypunct_cache<_CharT, _Intl> __cache_type;
>
> const locale& __loc = __io._M_getloc();
> const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
> __use_cache<__cache_type> __uc;
> const __cache_type* __lc = __uc(__loc);
> const char_type* __lit = __lc->_M_atoms;
>
>
>
> const char_type* __beg = __digits.data();
>
> money_base::pattern __p;
> const char_type* __sign;
> size_type __sign_size;
> if (!(*__beg == __lit[money_base::_S_minus]))
>   {
>     __p = __lc->_M_pos_format;
>     __sign = __lc->_M_positive_sign;
>     __sign_size = __lc->_M_positive_sign_size;
>   }
> else
>   {
>     __p = __lc->_M_neg_format;
>     __sign = __lc->_M_negative_sign;
>     __sign_size = __lc->_M_negative_sign_size;
>     if (__digits.size())
>       ++__beg;
>   }
>
>
> size_type __len = __ctype.scan_not(ctype_base::digit, __beg,
>        __beg + __digits.size()) - __beg;
> if (__len)
>   {
>
>
>
>     string_type __value;
>     __value.reserve(2 * __len);
>
>
>
>     int __paddec = __len - __lc->_M_frac_digits;
>     if (__paddec > 0)
>         {
>  if (__lc->_M_frac_digits < 0)
>    __paddec = __len;
>    if (__lc->_M_grouping_size)
>      {
>      _CharT* __ws =
>          static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>             * 2 * __len));
>        _CharT* __ws_end =
>        std::__add_grouping(__ws, __lc->_M_thousands_sep,
>       __lc->_M_grouping,
>       __lc->_M_grouping_size,
>       __beg, __beg + __paddec);
>      __value.assign(__ws, __ws_end - __ws);
>      }
>    else
>    __value.assign(__beg, __paddec);
>       }
>
>
>     if (__lc->_M_frac_digits > 0)
>       {
>  __value += __lc->_M_decimal_point;
>  if (__paddec >= 0)
>    __value.append(__beg + __paddec, __lc->_M_frac_digits);
>  else
>    {
>
>      __value.append(-__paddec, __lit[money_base::_S_zero]);
>      __value.append(__beg, __len);
>    }
>         }
>
>
>     const ios_base::fmtflags __f = __io.flags()
>                                    & ios_base::adjustfield;
>     __len = __value.size() + __sign_size;
>     __len += ((__io.flags() & ios_base::showbase)
>        ? __lc->_M_curr_symbol_size : 0);
>
>     string_type __res;
>     __res.reserve(2 * __len);
>
>     const size_type __width = static_cast<size_type>(__io.width());
>     const bool __testipad = (__f == ios_base::internal
>         && __len < __width);
>
>     for (int __i = 0; __i < 4; ++__i)
>       {
>  const part __which = static_cast<part>(__p.field[__i]);
>  switch (__which)
>    {
>    case money_base::symbol:
>      if (__io.flags() & ios_base::showbase)
>        __res.append(__lc->_M_curr_symbol,
>       __lc->_M_curr_symbol_size);
>      break;
>    case money_base::sign:
>
>
>
>      if (__sign_size)
>        __res += __sign[0];
>      break;
>    case money_base::value:
>      __res += __value;
>      break;
>    case money_base::space:
>
>
>
>      if (__testipad)
>        __res.append(__width - __len, __fill);
>      else
>        __res += __fill;
>      break;
>    case money_base::none:
>      if (__testipad)
>        __res.append(__width - __len, __fill);
>      break;
>    }
>       }
>
>
>     if (__sign_size > 1)
>       __res.append(__sign + 1, __sign_size - 1);
>
>
>     __len = __res.size();
>     if (__width > __len)
>       {
>  if (__f == ios_base::left)
>
>    __res.append(__width - __len, __fill);
>  else
>
>    __res.insert(0, __width - __len, __fill);
>  __len = __width;
>       }
>
>
>     __s = std::__write(__s, __res.data(), __len);
>   }
> __io.width(0);
> return __s;
>      }
># 1743 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    money_put<_CharT, _OutIter>::
>    do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>    long double __units) const
>    {
>      const locale __loc = __io.getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>
>      int __cs_size = 64;
>      char* __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>
>
>      int __len = std::__convert_from_v(__cs, __cs_size, "%.*Lf", __units,
>     _S_get_c_locale(), 0);
>
>      if (__len >= __cs_size)
> {
>   __cs_size = __len + 1;
>   __cs = static_cast<char*>(__builtin_alloca(__cs_size));
>   __len = std::__convert_from_v(__cs, __cs_size, "%.*Lf", __units,
>     _S_get_c_locale(), 0);
> }
>
>
>
>
>
>
>
>      _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>          * __cs_size));
>      __ctype.widen(__cs, __cs + __len, __ws);
>      const string_type __digits(__ws, __len);
>      return __intl ? _M_insert<true>(__s, __io, __fill, __digits)
>             : _M_insert<false>(__s, __io, __fill, __digits);
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    money_put<_CharT, _OutIter>::
>    do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,
>    const string_type& __digits) const
>    { return __intl ? _M_insert<true>(__s, __io, __fill, __digits)
>             : _M_insert<false>(__s, __io, __fill, __digits); }
>
>
>
>
>
>
>  template<typename _CharT, typename _InIter>
>    time_base::dateorder
>    time_get<_CharT, _InIter>::do_date_order() const
>    { return time_base::no_order; }
>
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,
>     ios_base::iostate& __err, tm* __tm,
>     const _CharT* __format) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>      const size_t __len = char_traits<_CharT>::length(__format);
>
>      for (size_t __i = 0; __beg != __end && __i < __len && !__err; ++__i)
> {
>   if (__ctype.narrow(__format[__i], 0) == '%')
>     {
>
>       char __c = __ctype.narrow(__format[++__i], 0);
>       int __mem = 0;
>       if (__c == 'E' || __c == 'O')
>  __c = __ctype.narrow(__format[++__i], 0);
>       switch (__c)
>  {
>    const char* __cs;
>    _CharT __wcs[10];
>  case 'a':
>
>    const char_type* __days1[7];
>    __tp._M_days_abbreviated(__days1);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days1,
>       7, __io, __err);
>    break;
>  case 'A':
>
>    const char_type* __days2[7];
>    __tp._M_days(__days2);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days2,
>       7, __io, __err);
>    break;
>  case 'h':
>  case 'b':
>
>    const char_type* __months1[12];
>    __tp._M_months_abbreviated(__months1);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_mon,
>       __months1, 12, __io, __err);
>    break;
>  case 'B':
>
>    const char_type* __months2[12];
>    __tp._M_months(__months2);
>    __beg = _M_extract_name(__beg, __end, __tm->tm_mon,
>       __months2, 12, __io, __err);
>    break;
>  case 'c':
>
>    const char_type* __dt[2];
>    __tp._M_date_time_formats(__dt);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __dt[0]);
>    break;
>  case 'd':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 1, 31, 2,
>      __io, __err);
>    break;
>  case 'e':
>
>
>    if (__ctype.is(ctype_base::space, *__beg))
>      __beg = _M_extract_num(++__beg, __end, __tm->tm_mday, 1, 9,
>        1, __io, __err);
>    else
>      __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 10, 31,
>        2, __io, __err);
>    break;
>  case 'D':
>
>    __cs = "%m/%d/%y";
>    __ctype.widen(__cs, __cs + 9, __wcs);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __wcs);
>    break;
>  case 'H':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 0, 23, 2,
>      __io, __err);
>    break;
>  case 'I':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 1, 12, 2,
>      __io, __err);
>    break;
>  case 'm':
>
>    __beg = _M_extract_num(__beg, __end, __mem, 1, 12, 2,
>      __io, __err);
>    if (!__err)
>      __tm->tm_mon = __mem - 1;
>    break;
>  case 'M':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_min, 0, 59, 2,
>      __io, __err);
>    break;
>  case 'n':
>    if (__ctype.narrow(*__beg, 0) == '\n')
>      ++__beg;
>    else
>      __err |= ios_base::failbit;
>    break;
>  case 'R':
>
>    __cs = "%H:%M";
>    __ctype.widen(__cs, __cs + 6, __wcs);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __wcs);
>    break;
>  case 'S':
>
>
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_sec, 0, 60, 2,
>
>
>
>      __io, __err);
>    break;
>  case 't':
>    if (__ctype.narrow(*__beg, 0) == '\t')
>      ++__beg;
>    else
>      __err |= ios_base::failbit;
>    break;
>  case 'T':
>
>    __cs = "%H:%M:%S";
>    __ctype.widen(__cs, __cs + 9, __wcs);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __wcs);
>    break;
>  case 'x':
>
>    const char_type* __dates[2];
>    __tp._M_date_formats(__dates);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __dates[0]);
>    break;
>  case 'X':
>
>    const char_type* __times[2];
>    __tp._M_time_formats(__times);
>    __beg = _M_extract_via_format(__beg, __end, __io, __err,
>      __tm, __times[0]);
>    break;
>  case 'y':
>  case 'C':
>
>    __beg = _M_extract_num(__beg, __end, __tm->tm_year, 0, 99, 2,
>      __io, __err);
>    break;
>  case 'Y':
>
>    __beg = _M_extract_num(__beg, __end, __mem, 0, 9999, 4,
>      __io, __err);
>    if (!__err)
>      __tm->tm_year = __mem - 1900;
>    break;
>  case 'Z':
>
>    if (__ctype.is(ctype_base::upper, *__beg))
>      {
>        int __tmp;
>        __beg = _M_extract_name(__beg, __end, __tmp,
>           __timepunct_cache<_CharT>::_S_timezones,
>           14, __io, __err);
>
>
>        if (__beg != __end && !__err && __tmp == 0
>     && (*__beg == __ctype.widen('-')
>         || *__beg == __ctype.widen('+')))
>   {
>     __beg = _M_extract_num(__beg, __end, __tmp, 0, 23, 2,
>       __io, __err);
>     __beg = _M_extract_num(__beg, __end, __tmp, 0, 59, 2,
>       __io, __err);
>   }
>      }
>    else
>      __err |= ios_base::failbit;
>    break;
>  default:
>
>    __err |= ios_base::failbit;
>  }
>     }
>   else
>     {
>
>       if (__format[__i] == *__beg)
>  ++__beg;
>       else
>  __err |= ios_base::failbit;
>     }
> }
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    _M_extract_num(iter_type __beg, iter_type __end, int& __member,
>     int __min, int __max, size_t __len,
>     ios_base& __io, ios_base::iostate& __err) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>
>      int __mult = __len == 2 ? 10 : (__len == 4 ? 1000 : 1);
>
>      ++__min;
>      size_t __i = 0;
>      int __value = 0;
>      for (; __beg != __end && __i < __len; ++__beg, ++__i)
> {
>   const char __c = __ctype.narrow(*__beg, '*');
>   if (__c >= '0' && __c <= '9')
>     {
>       __value = __value * 10 + (__c - '0');
>       const int __valuec = __value * __mult;
>       if (__valuec > __max || __valuec + __mult < __min)
>  break;
>       __mult /= 10;
>     }
>   else
>     break;
> }
>      if (__i == __len)
> __member = __value;
>      else
> __err |= ios_base::failbit;
>      return __beg;
>    }
>
>
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    _M_extract_name(iter_type __beg, iter_type __end, int& __member,
>      const _CharT** __names, size_t __indexlen,
>      ios_base& __io, ios_base::iostate& __err) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>      int* __matches = static_cast<int*>(__builtin_alloca(sizeof(int)
>         * __indexlen));
>      size_t __nmatches = 0;
>      size_t __pos = 0;
>      bool __testvalid = true;
>      const char_type* __name;
>
>
>
>
>
>      if (__beg != __end)
> {
>   const char_type __c = *__beg;
>   for (size_t __i1 = 0; __i1 < __indexlen; ++__i1)
>     if (__c == __names[__i1][0]
>  || __c == __ctype.toupper(__names[__i1][0]))
>       __matches[__nmatches++] = __i1;
> }
>
>      while (__nmatches > 1)
> {
>
>   size_t __minlen = __traits_type::length(__names[__matches[0]]);
>   for (size_t __i2 = 1; __i2 < __nmatches; ++__i2)
>     __minlen = std::min(__minlen,
>         __traits_type::length(__names[__matches[__i2]]));
>   ++__beg, ++__pos;
>   if (__pos < __minlen && __beg != __end)
>     for (size_t __i3 = 0; __i3 < __nmatches;)
>       {
>  __name = __names[__matches[__i3]];
>  if (!(__name[__pos] == *__beg))
>    __matches[__i3] = __matches[--__nmatches];
>  else
>    ++__i3;
>       }
>   else
>     break;
> }
>
>      if (__nmatches == 1)
> {
>
>   ++__beg, ++__pos;
>   __name = __names[__matches[0]];
>   const size_t __len = __traits_type::length(__name);
>   while (__pos < __len && __beg != __end && __name[__pos] == *__beg)
>     ++__beg, ++__pos;
>
>   if (__len == __pos)
>     __member = __matches[0];
>   else
>     __testvalid = false;
> }
>      else
> __testvalid = false;
>      if (!__testvalid)
> __err |= ios_base::failbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_time(iter_type __beg, iter_type __end, ios_base& __io,
>  ios_base::iostate& __err, tm* __tm) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const char_type* __times[2];
>      __tp._M_time_formats(__times);
>      __beg = _M_extract_via_format(__beg, __end, __io, __err,
>        __tm, __times[0]);
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_date(iter_type __beg, iter_type __end, ios_base& __io,
>  ios_base::iostate& __err, tm* __tm) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const char_type* __dates[2];
>      __tp._M_date_formats(__dates);
>      __beg = _M_extract_via_format(__beg, __end, __io, __err,
>        __tm, __dates[0]);
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_weekday(iter_type __beg, iter_type __end, ios_base& __io,
>     ios_base::iostate& __err, tm* __tm) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>      const char_type* __days[7];
>      __tp._M_days_abbreviated(__days);
>      int __tmpwday;
>      __beg = _M_extract_name(__beg, __end, __tmpwday, __days, 7, __io, __err);
>
>
>
>
>
>
>
>      if (!__err && __beg != __end)
> {
>   size_t __pos = __traits_type::length(__days[__tmpwday]);
>   __tp._M_days(__days);
>   const char_type* __name = __days[__tmpwday];
>   if (__name[__pos] == *__beg)
>     {
>
>       const size_t __len = __traits_type::length(__name);
>       while (__pos < __len && __beg != __end
>       && __name[__pos] == *__beg)
>  ++__beg, ++__pos;
>       if (__len != __pos)
>  __err |= ios_base::failbit;
>     }
> }
>      if (!__err)
> __tm->tm_wday = __tmpwday;
>
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>     }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_monthname(iter_type __beg, iter_type __end,
>                     ios_base& __io, ios_base::iostate& __err, tm* __tm) const
>    {
>      typedef char_traits<_CharT> __traits_type;
>      const locale& __loc = __io._M_getloc();
>      const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc);
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>      const char_type* __months[12];
>      __tp._M_months_abbreviated(__months);
>      int __tmpmon;
>      __beg = _M_extract_name(__beg, __end, __tmpmon, __months, 12,
>         __io, __err);
>
>
>
>
>
>
>
>      if (!__err && __beg != __end)
> {
>   size_t __pos = __traits_type::length(__months[__tmpmon]);
>   __tp._M_months(__months);
>   const char_type* __name = __months[__tmpmon];
>   if (__name[__pos] == *__beg)
>     {
>
>       const size_t __len = __traits_type::length(__name);
>       while (__pos < __len && __beg != __end
>       && __name[__pos] == *__beg)
>  ++__beg, ++__pos;
>       if (__len != __pos)
>  __err |= ios_base::failbit;
>     }
> }
>      if (!__err)
> __tm->tm_mon = __tmpmon;
>
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _InIter>
>    _InIter
>    time_get<_CharT, _InIter>::
>    do_get_year(iter_type __beg, iter_type __end, ios_base& __io,
>  ios_base::iostate& __err, tm* __tm) const
>    {
>      const locale& __loc = __io._M_getloc();
>      const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>      size_t __i = 0;
>      int __value = 0;
>      for (; __beg != __end && __i < 4; ++__beg, ++__i)
> {
>   const char __c = __ctype.narrow(*__beg, '*');
>   if (__c >= '0' && __c <= '9')
>     __value = __value * 10 + (__c - '0');
>   else
>     break;
> }
>      if (__i == 2 || __i == 4)
> __tm->tm_year = __i == 2 ? __value : __value - 1900;
>      else
> __err |= ios_base::failbit;
>      if (__beg == __end)
> __err |= ios_base::eofbit;
>      return __beg;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    time_put<_CharT, _OutIter>::
>    put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,
> const _CharT* __beg, const _CharT* __end) const
>    {
>      const locale& __loc = __io._M_getloc();
>      ctype<_CharT> const& __ctype = use_facet<ctype<_CharT> >(__loc);
>      for (; __beg != __end; ++__beg)
> if (__ctype.narrow(*__beg, 0) != '%')
>   {
>     *__s = *__beg;
>     ++__s;
>   }
> else if (++__beg != __end)
>   {
>     char __format;
>     char __mod = 0;
>     const char __c = __ctype.narrow(*__beg, 0);
>     if (__c != 'E' && __c != 'O')
>       __format = __c;
>     else if (++__beg != __end)
>       {
>  __mod = __c;
>  __format = __ctype.narrow(*__beg, 0);
>       }
>     else
>       break;
>     __s = this->do_put(__s, __io, __fill, __tm, __format, __mod);
>   }
> else
>   break;
>      return __s;
>    }
>
>  template<typename _CharT, typename _OutIter>
>    _OutIter
>    time_put<_CharT, _OutIter>::
>    do_put(iter_type __s, ios_base& __io, char_type, const tm* __tm,
>    char __format, char __mod) const
>    {
>      const locale& __loc = __io._M_getloc();
>      ctype<_CharT> const& __ctype = use_facet<ctype<_CharT> >(__loc);
>      __timepunct<_CharT> const& __tp = use_facet<__timepunct<_CharT> >(__loc);
>
>
>
>      const size_t __maxlen = 128;
>      char_type* __res =
>       static_cast<char_type*>(__builtin_alloca(sizeof(char_type) * __maxlen));
>
>
>
>
>
>
>      char_type __fmt[4];
>      __fmt[0] = __ctype.widen('%');
>      if (!__mod)
> {
>   __fmt[1] = __format;
>   __fmt[2] = char_type();
> }
>      else
> {
>   __fmt[1] = __mod;
>   __fmt[2] = __format;
>   __fmt[3] = char_type();
> }
>
>      __tp._M_put(__res, __maxlen, __fmt, __tm);
>
>
>      return std::__write(__s, __res, char_traits<char_type>::length(__res));
>    }
>
>
>  template<typename _CharT>
>    int
>    collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const
>    { return 0; }
>
>
>  template<typename _CharT>
>    size_t
>    collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const
>    { return 0; }
>
>  template<typename _CharT>
>    int
>    collate<_CharT>::
>    do_compare(const _CharT* __lo1, const _CharT* __hi1,
>        const _CharT* __lo2, const _CharT* __hi2) const
>    {
>
>
>      const string_type __one(__lo1, __hi1);
>      const string_type __two(__lo2, __hi2);
>
>      const _CharT* __p = __one.c_str();
>      const _CharT* __pend = __one.data() + __one.length();
>      const _CharT* __q = __two.c_str();
>      const _CharT* __qend = __two.data() + __two.length();
>
>
>
>
>      for (;;)
> {
>   const int __res = _M_compare(__p, __q);
>   if (__res)
>     return __res;
>
>   __p += char_traits<_CharT>::length(__p);
>   __q += char_traits<_CharT>::length(__q);
>   if (__p == __pend && __q == __qend)
>     return 0;
>   else if (__p == __pend)
>     return -1;
>   else if (__q == __qend)
>     return 1;
>
>   __p++;
>   __q++;
> }
>    }
>
>  template<typename _CharT>
>    typename collate<_CharT>::string_type
>    collate<_CharT>::
>    do_transform(const _CharT* __lo, const _CharT* __hi) const
>    {
>
>      string_type __str(__lo, __hi);
>
>      const _CharT* __p = __str.c_str();
>      const _CharT* __pend = __str.data() + __str.length();
>
>      size_t __len = (__hi - __lo) * 2;
>
>      string_type __ret;
>
>
>
>
>      for (;;)
> {
>
>   _CharT* __c =
>     static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __len));
>   size_t __res = _M_transform(__c, __p, __len);
>
>
>   if (__res >= __len)
>     {
>       __len = __res + 1;
>       __c = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>         * __len));
>       __res = _M_transform(__c, __p, __len);
>     }
>
>   __ret.append(__c, __res);
>   __p += char_traits<_CharT>::length(__p);
>   if (__p == __pend)
>     return __ret;
>
>   __p++;
>   __ret.push_back(_CharT());
> }
>    }
>
>  template<typename _CharT>
>    long
>    collate<_CharT>::
>    do_hash(const _CharT* __lo, const _CharT* __hi) const
>    {
>      unsigned long __val = 0;
>      for (; __lo < __hi; ++__lo)
> __val = *__lo + ((__val << 7) |
>         (__val >> (numeric_limits<unsigned long>::digits - 7)));
>      return static_cast<long>(__val);
>    }
># 2469 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/locale_facets.tcc" 3
>  template<typename _CharT, typename _Traits>
>    void
>    __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill,
>       _CharT* __news, const _CharT* __olds,
>       const streamsize __newlen,
>       const streamsize __oldlen, const bool __num)
>    {
>      const size_t __plen = static_cast<size_t>(__newlen - __oldlen);
>      const ios_base::fmtflags __adjust = __io.flags() & ios_base::adjustfield;
>
>
>      if (__adjust == ios_base::left)
> {
>   _Traits::copy(__news, const_cast<_CharT*>(__olds), __oldlen);
>   _Traits::assign(__news + __oldlen, __plen, __fill);
>   return;
> }
>
>      size_t __mod = 0;
>      if (__adjust == ios_base::internal && __num)
> {
>
>
>
>          const locale& __loc = __io._M_getloc();
>   const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc);
>
>   const bool __testsign = (__ctype.widen('-') == __olds[0]
>       || __ctype.widen('+') == __olds[0]);
>   const bool __testhex = (__ctype.widen('0') == __olds[0]
>      && __oldlen > 1
>      && (__ctype.widen('x') == __olds[1]
>          || __ctype.widen('X') == __olds[1]));
>   if (__testhex)
>     {
>       __news[0] = __olds[0];
>       __news[1] = __olds[1];
>       __mod = 2;
>       __news += 2;
>     }
>   else if (__testsign)
>     {
>       __news[0] = __olds[0];
>       __mod = 1;
>       ++__news;
>     }
>
> }
>      _Traits::assign(__news, __plen, __fill);
>      _Traits::copy(__news + __plen, const_cast<_CharT*>(__olds + __mod),
>      __oldlen - __mod);
>    }
>
>  bool
>  __verify_grouping(const char* __grouping, size_t __grouping_size,
>      const string& __grouping_tmp)
>  {
>    const size_t __n = __grouping_tmp.size() - 1;
>    const size_t __min = std::min(__n, size_t(__grouping_size - 1));
>    size_t __i = __n;
>    bool __test = true;
>
>
>
>
>    for (size_t __j = 0; __j < __min && __test; --__i, ++__j)
>      __test = __grouping_tmp[__i] == __grouping[__j];
>    for (; __i && __test; --__i)
>      __test = __grouping_tmp[__i] == __grouping[__min];
>
>
>
>    if (static_cast<signed char>(__grouping[__min]) > 0)
>      __test &= __grouping_tmp[0] <= __grouping[__min];
>    return __test;
>  }
>
>  template<typename _CharT>
>    _CharT*
>    __add_grouping(_CharT* __s, _CharT __sep,
>     const char* __gbeg, size_t __gsize,
>     const _CharT* __first, const _CharT* __last)
>    {
>      if (__last - __first > *__gbeg
>   && static_cast<signed char>(*__gbeg) > 0)
> {
>   const bool __bump = __gsize != 1;
>   __s = std::__add_grouping(__s, __sep, __gbeg + __bump,
>        __gsize - __bump, __first,
>        __last - *__gbeg);
>   __first = __last - *__gbeg;
>   *__s++ = __sep;
> }
>      do
> *__s++ = *__first++;
>      while (__first != __last);
>      return __s;
>    }
>
>
>
>
>
>  extern template class moneypunct<char, false>;
>  extern template class moneypunct<char, true>;
>  extern template class moneypunct_byname<char, false>;
>  extern template class moneypunct_byname<char, true>;
>  extern template class money_get<char>;
>  extern template class money_put<char>;
>  extern template class numpunct<char>;
>  extern template class numpunct_byname<char>;
>  extern template class num_get<char>;
>  extern template class num_put<char>;
>  extern template class __timepunct<char>;
>  extern template class time_put<char>;
>  extern template class time_put_byname<char>;
>  extern template class time_get<char>;
>  extern template class time_get_byname<char>;
>  extern template class messages<char>;
>  extern template class messages_byname<char>;
>  extern template class ctype_byname<char>;
>  extern template class codecvt_byname<char, char, mbstate_t>;
>  extern template class collate<char>;
>  extern template class collate_byname<char>;
>
>  extern template
>    const codecvt<char, char, mbstate_t>&
>    use_facet<codecvt<char, char, mbstate_t> >(const locale&);
>
>  extern template
>    const collate<char>&
>    use_facet<collate<char> >(const locale&);
>
>  extern template
>    const numpunct<char>&
>    use_facet<numpunct<char> >(const locale&);
>
>  extern template
>    const num_put<char>&
>    use_facet<num_put<char> >(const locale&);
>
>  extern template
>    const num_get<char>&
>    use_facet<num_get<char> >(const locale&);
>
>  extern template
>    const moneypunct<char, true>&
>    use_facet<moneypunct<char, true> >(const locale&);
>
>  extern template
>    const moneypunct<char, false>&
>    use_facet<moneypunct<char, false> >(const locale&);
>
>  extern template
>    const money_put<char>&
>    use_facet<money_put<char> >(const locale&);
>
>  extern template
>    const money_get<char>&
>    use_facet<money_get<char> >(const locale&);
>
>  extern template
>    const __timepunct<char>&
>    use_facet<__timepunct<char> >(const locale&);
>
>  extern template
>    const time_put<char>&
>    use_facet<time_put<char> >(const locale&);
>
>  extern template
>    const time_get<char>&
>    use_facet<time_get<char> >(const locale&);
>
>  extern template
>    const messages<char>&
>    use_facet<messages<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<ctype<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<codecvt<char, char, mbstate_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<collate<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<numpunct<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<num_put<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<num_get<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<moneypunct<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_put<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_get<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<__timepunct<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_put<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_get<char> >(const locale&);
>
>  extern template
>    bool
>    has_facet<messages<char> >(const locale&);
>
>
>  extern template class moneypunct<wchar_t, false>;
>  extern template class moneypunct<wchar_t, true>;
>  extern template class moneypunct_byname<wchar_t, false>;
>  extern template class moneypunct_byname<wchar_t, true>;
>  extern template class money_get<wchar_t>;
>  extern template class money_put<wchar_t>;
>  extern template class numpunct<wchar_t>;
>  extern template class numpunct_byname<wchar_t>;
>  extern template class num_get<wchar_t>;
>  extern template class num_put<wchar_t>;
>  extern template class __timepunct<wchar_t>;
>  extern template class time_put<wchar_t>;
>  extern template class time_put_byname<wchar_t>;
>  extern template class time_get<wchar_t>;
>  extern template class time_get_byname<wchar_t>;
>  extern template class messages<wchar_t>;
>  extern template class messages_byname<wchar_t>;
>  extern template class ctype_byname<wchar_t>;
>  extern template class codecvt_byname<wchar_t, char, mbstate_t>;
>  extern template class collate<wchar_t>;
>  extern template class collate_byname<wchar_t>;
>
>  extern template
>    const codecvt<wchar_t, char, mbstate_t>&
>    use_facet<codecvt<wchar_t, char, mbstate_t> >(locale const&);
>
>  extern template
>    const collate<wchar_t>&
>    use_facet<collate<wchar_t> >(const locale&);
>
>  extern template
>    const numpunct<wchar_t>&
>    use_facet<numpunct<wchar_t> >(const locale&);
>
>  extern template
>    const num_put<wchar_t>&
>    use_facet<num_put<wchar_t> >(const locale&);
>
>  extern template
>    const num_get<wchar_t>&
>    use_facet<num_get<wchar_t> >(const locale&);
>
>  extern template
>    const moneypunct<wchar_t, true>&
>    use_facet<moneypunct<wchar_t, true> >(const locale&);
>
>  extern template
>    const moneypunct<wchar_t, false>&
>    use_facet<moneypunct<wchar_t, false> >(const locale&);
>
>  extern template
>    const money_put<wchar_t>&
>    use_facet<money_put<wchar_t> >(const locale&);
>
>  extern template
>    const money_get<wchar_t>&
>    use_facet<money_get<wchar_t> >(const locale&);
>
>  extern template
>    const __timepunct<wchar_t>&
>    use_facet<__timepunct<wchar_t> >(const locale&);
>
>  extern template
>    const time_put<wchar_t>&
>    use_facet<time_put<wchar_t> >(const locale&);
>
>  extern template
>    const time_get<wchar_t>&
>    use_facet<time_get<wchar_t> >(const locale&);
>
>  extern template
>    const messages<wchar_t>&
>    use_facet<messages<wchar_t> >(const locale&);
>
> extern template
>    bool
>    has_facet<ctype<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<codecvt<wchar_t, char, mbstate_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<collate<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<numpunct<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<num_put<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<num_get<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<moneypunct<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_put<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<money_get<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<__timepunct<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_put<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<time_get<wchar_t> >(const locale&);
>
>  extern template
>    bool
>    has_facet<messages<wchar_t> >(const locale&);
>
>
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/locale" 2 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/ostream.tcc" 2 3
>
>namespace std
>{
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>::sentry::
>    sentry(basic_ostream<_CharT, _Traits>& __os)
>    : _M_ok(false), _M_os(__os)
>    {
>
>      if (__os.tie() && __os.good())
> __os.tie()->flush();
>
>      if (__os.good())
> _M_ok = true;
>      else
> __os.setstate(ios_base::failbit);
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(__ostream_type& (*__pf)(__ostream_type&))
>    {
>
>
>
>      return __pf(*this);
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(__ios_type& (*__pf)(__ios_type&))
>    {
>
>
>
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(ios_base& (*__pf)(ios_base&))
>    {
>
>
>
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(bool __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(short __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       long __l;
>       const ios_base::fmtflags __fmt = (this->flags()
>      & ios_base::basefield);
>       if (__fmt == ios_base::oct || __fmt == ios_base::hex)
>  __l = static_cast<long>(static_cast<unsigned short>(__n));
>       else
>  __l = static_cast<long>(__n);
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __l).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(unsigned short __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(),
>      static_cast<unsigned long>(__n)).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(int __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       long __l;
>       const ios_base::fmtflags __fmt = (this->flags()
>      & ios_base::basefield);
>       if (__fmt == ios_base::oct || __fmt == ios_base::hex)
>  __l = static_cast<long>(static_cast<unsigned int>(__n));
>       else
>  __l = static_cast<long>(__n);
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __l).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(unsigned int __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(),
>      static_cast<unsigned long>(__n)).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(unsigned long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(long long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(unsigned long long __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(float __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(),
>      static_cast<double>(__n)).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(double __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(long double __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(const void* __n)
>    {
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_put_type& __np = __check_facet(this->_M_num_put);
>       if (__np.put(*this, *this, this->fill(), __n).failed())
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    operator<<(__streambuf_type* __sbin)
>    {
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this);
>      if (__cerb && __sbin)
> {
>   try
>     {
>       if (!__copy_streambufs(__sbin, this->rdbuf()))
>  __err |= ios_base::failbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::failbit); }
> }
>      else if (!__sbin)
> __err |= ios_base::badbit;
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    put(char_type __c)
>    {
>
>
>
>
>
>
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const int_type __put = this->rdbuf()->sputc(__c);
>       if (traits_type::eq_int_type(__put, traits_type::eof()))
>  __err |= ios_base::badbit;
>     }
>   catch (...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    write(const _CharT* __s, streamsize __n)
>    {
>
>
>
>
>
>
>
>      sentry __cerb(*this);
>      if (__cerb)
> {
>   try
>     { _M_write(__s, __n); }
>   catch (...)
>     { this->_M_setstate(ios_base::badbit); }
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    flush()
>    {
>
>
>
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      try
> {
>   if (this->rdbuf() && this->rdbuf()->pubsync() == -1)
>     __err |= ios_base::badbit;
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_ostream<_CharT, _Traits>::pos_type
>    basic_ostream<_CharT, _Traits>::
>    tellp()
>    {
>      pos_type __ret = pos_type(-1);
>      try
> {
>   if (!this->fail())
>     __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out);
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    seekp(pos_type __pos)
>    {
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      try
> {
>   if (!this->fail())
>     {
>
>
>       const pos_type __p = this->rdbuf()->pubseekpos(__pos,
>            ios_base::out);
>
>
>       if (__p == pos_type(off_type(-1)))
>  __err |= ios_base::failbit;
>     }
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    basic_ostream<_CharT, _Traits>::
>    seekp(off_type __off, ios_base::seekdir __dir)
>    {
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      try
> {
>   if (!this->fail())
>     {
>
>
>       const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir,
>            ios_base::out);
>
>
>       if (__p == pos_type(off_type(-1)))
>  __err |= ios_base::failbit;
>     }
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = 1;
>       _CharT* __cs = &__c;
>       if (__w > __len)
>  {
>    __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>              * __w));
>    __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       &__c, __w, __len, false);
>    __len = __w;
>  }
>       __out._M_write(__cs, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      return __out;
>    }
>
>
>  template <class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, char __c)
>    {
>      typedef basic_ostream<char, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = 1;
>       char* __cs = &__c;
>       if (__w > __len)
>  {
>    __cs = static_cast<char*>(__builtin_alloca(__w));
>    __pad<char, _Traits>::_S_pad(__out, __out.fill(), __cs,
>            &__c, __w, __len, false);
>    __len = __w;
>  }
>       __out._M_write(__cs, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      return __out;
>     }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb && __s)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = static_cast<streamsize>(_Traits::length(__s));
>       if (__w > __len)
>  {
>    _CharT* __cs = (static_cast<
>      _CharT*>(__builtin_alloca(sizeof(_CharT)
>           * __w)));
>    __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       __s, __w, __len, false);
>    __s = __cs;
>    __len = __w;
>  }
>       __out._M_write(__s, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      else if (!__s)
> __out.setstate(ios_base::badbit);
>      return __out;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>
>
>
>      typedef char_traits<char> __traits_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb && __s)
> {
>   size_t __clen = __traits_type::length(__s);
>   _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
>              * __clen));
>   for (size_t __i = 0; __i < __clen; ++__i)
>     __ws[__i] = __out.widen(__s[__i]);
>   _CharT* __str = __ws;
>
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = static_cast<streamsize>(__clen);
>       if (__w > __len)
>  {
>    _CharT* __cs = (static_cast<
>      _CharT*>(__builtin_alloca(sizeof(_CharT)
>           * __w)));
>    __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       __ws, __w, __len, false);
>    __str = __cs;
>    __len = __w;
>  }
>       __out._M_write(__str, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      else if (!__s)
> __out.setstate(ios_base::badbit);
>      return __out;
>    }
>
>
>  template<class _Traits>
>    basic_ostream<char, _Traits>&
>    operator<<(basic_ostream<char, _Traits>& __out, const char* __s)
>    {
>      typedef basic_ostream<char, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb && __s)
> {
>   try
>     {
>       const streamsize __w = __out.width();
>       streamsize __len = static_cast<streamsize>(_Traits::length(__s));
>       if (__w > __len)
>  {
>    char* __cs = static_cast<char*>(__builtin_alloca(__w));
>    __pad<char, _Traits>::_S_pad(__out, __out.fill(), __cs,
>       __s, __w, __len, false);
>    __s = __cs;
>    __len = __w;
>  }
>       __out._M_write(__s, __len);
>       __out.width(0);
>     }
>   catch(...)
>     { __out._M_setstate(ios_base::badbit); }
> }
>      else if (!__s)
> __out.setstate(ios_base::badbit);
>      return __out;
>    }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __out,
>        const basic_string<_CharT, _Traits, _Alloc>& __str)
>    {
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>      typename __ostream_type::sentry __cerb(__out);
>      if (__cerb)
> {
>   const streamsize __w = __out.width();
>   streamsize __len = static_cast<streamsize>(__str.size());
>   const _CharT* __s = __str.data();
>
>
>
>   if (__w > __len)
>     {
>       _CharT* __cs = (static_cast<
>         _CharT*>(__builtin_alloca(sizeof(_CharT) * __w)));
>       __pad<_CharT, _Traits>::_S_pad(__out, __out.fill(), __cs, __s,
>          __w, __len, false);
>       __s = __cs;
>       __len = __w;
>     }
>   __out._M_write(__s, __len);
>   __out.width(0);
> }
>      return __out;
>    }
>
>
>
>
>
>  extern template class basic_ostream<char>;
>  extern template ostream& endl(ostream&);
>  extern template ostream& ends(ostream&);
>  extern template ostream& flush(ostream&);
>  extern template ostream& operator<<(ostream&, char);
>  extern template ostream& operator<<(ostream&, unsigned char);
>  extern template ostream& operator<<(ostream&, signed char);
>  extern template ostream& operator<<(ostream&, const char*);
>  extern template ostream& operator<<(ostream&, const unsigned char*);
>  extern template ostream& operator<<(ostream&, const signed char*);
>
>
>  extern template class basic_ostream<wchar_t>;
>  extern template wostream& endl(wostream&);
>  extern template wostream& ends(wostream&);
>  extern template wostream& flush(wostream&);
>  extern template wostream& operator<<(wostream&, wchar_t);
>  extern template wostream& operator<<(wostream&, char);
>  extern template wostream& operator<<(wostream&, const wchar_t*);
>  extern template wostream& operator<<(wostream&, const char*);
>
>
>}
># 526 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/ostream" 2 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>
>
>
>
>namespace std
>{
># 57 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_istream : virtual public basic_ios<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef typename _Traits::int_type int_type;
>      typedef typename _Traits::pos_type pos_type;
>      typedef typename _Traits::off_type off_type;
>      typedef _Traits traits_type;
>
>
>      typedef basic_streambuf<_CharT, _Traits> __streambuf_type;
>      typedef basic_ios<_CharT, _Traits> __ios_type;
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> >
>        __num_get_type;
>      typedef ctype<_CharT> __ctype_type;
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_istream<_CharT2, _Traits2>&
>        operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2&);
>
>      template<typename _CharT2, typename _Traits2>
>        friend basic_istream<_CharT2, _Traits2>&
>        operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);
>
>    protected:
>
>
>
>
>
>
>
>      streamsize _M_gcount;
>
>    public:
># 103 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      explicit
>      basic_istream(__streambuf_type* __sb): _M_gcount(streamsize(0))
>      { this->init(__sb); }
>
>
>
>
>
>
>      virtual
>      ~basic_istream()
>      { _M_gcount = streamsize(0); }
>
>
>      class sentry;
>      friend class sentry;
># 130 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      operator>>(__istream_type& (*__pf)(__istream_type&));
>
>      inline __istream_type&
>      operator>>(__ios_type& (*__pf)(__ios_type&));
>
>      inline __istream_type&
>      operator>>(ios_base& (*__pf)(ios_base&));
># 168 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      operator>>(bool& __n);
>
>      __istream_type&
>      operator>>(short& __n);
>
>      __istream_type&
>      operator>>(unsigned short& __n);
>
>      __istream_type&
>      operator>>(int& __n);
>
>      __istream_type&
>      operator>>(unsigned int& __n);
>
>      __istream_type&
>      operator>>(long& __n);
>
>      __istream_type&
>      operator>>(unsigned long& __n);
>
>
>      __istream_type&
>      operator>>(long long& __n);
>
>      __istream_type&
>      operator>>(unsigned long long& __n);
>
>
>      __istream_type&
>      operator>>(float& __f);
>
>      __istream_type&
>      operator>>(double& __f);
>
>      __istream_type&
>      operator>>(long double& __f);
>
>      __istream_type&
>      operator>>(void*& __p);
># 229 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      operator>>(__streambuf_type* __sb);
># 239 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline streamsize
>      gcount() const
>      { return _M_gcount; }
># 271 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      int_type
>      get();
># 285 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      get(char_type& __c);
># 312 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      get(char_type* __s, streamsize __n, char_type __delim);
># 323 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      get(char_type* __s, streamsize __n)
>      { return this->get(__s, __n, this->widen('\n')); }
># 346 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      get(__streambuf_type& __sb, char_type __delim);
># 356 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      get(__streambuf_type& __sb)
>      { return this->get(__sb, this->widen('\n')); }
># 385 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      getline(char_type* __s, streamsize __n, char_type __delim);
># 396 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      inline __istream_type&
>      getline(char_type* __s, streamsize __n)
>      { return this->getline(__s, __n, this->widen('\n')); }
># 420 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      ignore();
>
>      __istream_type&
>      ignore(streamsize __n);
>
>      __istream_type&
>      ignore(streamsize __n, int_type __delim);
># 437 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      int_type
>      peek();
># 455 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      read(char_type* __s, streamsize __n);
># 474 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      streamsize
>      readsome(char_type* __s, streamsize __n);
># 490 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      putback(char_type __c);
># 505 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      unget();
># 523 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      int
>      sync();
># 537 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      pos_type
>      tellg();
># 552 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      seekg(pos_type);
># 568 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      __istream_type&
>      seekg(off_type, ios_base::seekdir);
>
>
>    protected:
>      explicit
>      basic_istream(): _M_gcount(streamsize(0)) { }
>    };
>
>
>  template<>
>    basic_istream<char>&
>    basic_istream<char>::
>    getline(char_type* __s, streamsize __n, char_type __delim);
>
>  template<>
>    basic_istream<char>&
>    basic_istream<char>::
>    ignore(streamsize __n);
>
>  template<>
>    basic_istream<char>&
>    basic_istream<char>::
>    ignore(streamsize __n, int_type __delim);
>
>
>  template<>
>    basic_istream<wchar_t>&
>    basic_istream<wchar_t>::
>    getline(char_type* __s, streamsize __n, char_type __delim);
>
>  template<>
>    basic_istream<wchar_t>&
>    basic_istream<wchar_t>::
>    ignore(streamsize __n);
>
>  template<>
>    basic_istream<wchar_t>&
>    basic_istream<wchar_t>::
>    ignore(streamsize __n, int_type __delim);
># 621 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_istream<_CharT, _Traits>::sentry
>    {
>    public:
>
>      typedef _Traits traits_type;
>      typedef basic_streambuf<_CharT, _Traits> __streambuf_type;
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef typename _Traits::int_type __int_type;
># 653 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      explicit
>      sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);
># 663 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>      operator bool() const { return _M_ok; }
>
>    private:
>      bool _M_ok;
>    };
># 682 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c);
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c)
>    { return (__in >> reinterpret_cast<char&>(__c)); }
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, signed char& __c)
>    { return (__in >> reinterpret_cast<char&>(__c)); }
># 723 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s);
>
>
>  template<>
>    basic_istream<char>&
>    operator>>(basic_istream<char>& __in, char* __s);
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s)
>    { return (__in >> reinterpret_cast<char*>(__s)); }
>
>  template<class _Traits>
>    basic_istream<char, _Traits>&
>    operator>>(basic_istream<char, _Traits>& __in, signed char* __s)
>    { return (__in >> reinterpret_cast<char*>(__s)); }
># 750 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    class basic_iostream
>    : public basic_istream<_CharT, _Traits>,
>      public basic_ostream<_CharT, _Traits>
>    {
>    public:
>
>
>
>      typedef _CharT char_type;
>      typedef typename _Traits::int_type int_type;
>      typedef typename _Traits::pos_type pos_type;
>      typedef typename _Traits::off_type off_type;
>      typedef _Traits traits_type;
>
>
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef basic_ostream<_CharT, _Traits> __ostream_type;
>
>
>
>
>
>
>
>      explicit
>      basic_iostream(basic_streambuf<_CharT, _Traits>* __sb)
>      : __istream_type(), __ostream_type()
>      { this->init(__sb); }
>
>
>
>
>      virtual
>      ~basic_iostream() { }
>
>    protected:
>      explicit
>      basic_iostream() : __istream_type(), __ostream_type()
>      { }
>    };
># 813 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 3
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    ws(basic_istream<_CharT, _Traits>& __is);
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 3
>
>
>
>
>namespace std
>{
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>::sentry::
>    sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false)
>    {
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      if (__in.good())
> {
>   if (__in.tie())
>     __in.tie()->flush();
>   if (!__noskip && (__in.flags() & ios_base::skipws))
>     {
>       const __int_type __eof = traits_type::eof();
>       __streambuf_type* __sb = __in.rdbuf();
>       __int_type __c = __sb->sgetc();
>
>       const __ctype_type& __ct = __check_facet(__in._M_ctype);
>       while (!traits_type::eq_int_type(__c, __eof)
>       && __ct.is(ctype_base::space,
>    traits_type::to_char_type(__c)))
>  __c = __sb->snextc();
>
>
>
>
>       if (traits_type::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>     }
> }
>
>      if (__in.good() && __err == ios_base::goodbit)
> _M_ok = true;
>      else
> {
>   __err |= ios_base::failbit;
>   __in.setstate(__err);
> }
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(__istream_type& (*__pf)(__istream_type&))
>    { return __pf(*this); }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(__ios_type& (*__pf)(__ios_type&))
>    {
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(ios_base& (*__pf)(ios_base&))
>    {
>      __pf(*this);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(bool& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(short& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       long __l;
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __l);
>
>
>       if (!(__err & ios_base::failbit)
>    && (numeric_limits<short>::min() <= __l
>        && __l <= numeric_limits<short>::max()))
>  __n = __l;
>       else
>                __err |= ios_base::failbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(unsigned short& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(int& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       long __l;
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __l);
>
>
>       if (!(__err & ios_base::failbit)
>    && (numeric_limits<int>::min() <= __l
>        && __l <= numeric_limits<int>::max()))
>  __n = __l;
>       else
>                __err |= ios_base::failbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(unsigned int& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(unsigned long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(long long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(unsigned long long& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(float& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(double& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(long double& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(void*& __n)
>    {
>      sentry __cerb(*this, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __num_get_type& __ng = __check_facet(this->_M_num_get);
>       __ng.get(*this, 0, *this, __err, __n);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    operator>>(__streambuf_type* __sbout)
>    {
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this, false);
>      if (__cerb && __sbout)
> {
>   try
>     {
>       if (!__copy_streambufs(this->rdbuf(), __sbout))
>  __err |= ios_base::failbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::failbit); }
> }
>      else if (!__sbout)
> __err |= ios_base::failbit;
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_istream<_CharT, _Traits>::int_type
>    basic_istream<_CharT, _Traits>::
>    get(void)
>    {
>      const int_type __eof = traits_type::eof();
>      int_type __c = __eof;
>      _M_gcount = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   try
>     {
>       __c = this->rdbuf()->sbumpc();
>
>       if (!traits_type::eq_int_type(__c, __eof))
>  _M_gcount = 1;
>       else
>  __err |= ios_base::eofbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
> }
>      if (!_M_gcount)
> __err |= ios_base::failbit;
>      if (__err)
> this->setstate(__err);
>      return __c;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    get(char_type& __c)
>    {
>      _M_gcount = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   try
>     {
>       const int_type __cb = this->rdbuf()->sbumpc();
>
>       if (!traits_type::eq_int_type(__cb, traits_type::eof()))
>  {
>    _M_gcount = 1;
>    __c = traits_type::to_char_type(__cb);
>  }
>       else
>  __err |= ios_base::eofbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
> }
>      if (!_M_gcount)
> __err |= ios_base::failbit;
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    get(char_type* __s, streamsize __n, char_type __delim)
>    {
>      _M_gcount = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   try
>     {
>       const int_type __idelim = traits_type::to_int_type(__delim);
>       const int_type __eof = traits_type::eof();
>       __streambuf_type* __sb = this->rdbuf();
>       int_type __c = __sb->sgetc();
>
>       while (_M_gcount + 1 < __n
>       && !traits_type::eq_int_type(__c, __eof)
>       && !traits_type::eq_int_type(__c, __idelim))
>  {
>    *__s++ = traits_type::to_char_type(__c);
>    ++_M_gcount;
>    __c = __sb->snextc();
>  }
>       if (traits_type::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
> }
>
>
>      if (__n > 0)
> *__s = char_type();
>      if (!_M_gcount)
> __err |= ios_base::failbit;
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    get(__streambuf_type& __sb, char_type __delim)
>    {
>      _M_gcount = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   try
>     {
>       const int_type __idelim = traits_type::to_int_type(__delim);
>       const int_type __eof = traits_type::eof();
>       __streambuf_type* __this_sb = this->rdbuf();
>       int_type __c = __this_sb->sgetc();
>       char_type __c2 = traits_type::to_char_type(__c);
>
>       while (!traits_type::eq_int_type(__c, __eof)
>       && !traits_type::eq_int_type(__c, __idelim)
>       && !traits_type::eq_int_type(__sb.sputc(__c2), __eof))
>  {
>    ++_M_gcount;
>    __c = __this_sb->snextc();
>    __c2 = traits_type::to_char_type(__c);
>  }
>       if (traits_type::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
> }
>      if (!_M_gcount)
> __err |= ios_base::failbit;
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    getline(char_type* __s, streamsize __n, char_type __delim)
>    {
>      _M_gcount = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      sentry __cerb(*this, true);
>      if (__cerb)
>        {
>          try
>            {
>              const int_type __idelim = traits_type::to_int_type(__delim);
>              const int_type __eof = traits_type::eof();
>              __streambuf_type* __sb = this->rdbuf();
>              int_type __c = __sb->sgetc();
>
>              while (_M_gcount + 1 < __n
>                     && !traits_type::eq_int_type(__c, __eof)
>                     && !traits_type::eq_int_type(__c, __idelim))
>                {
>                  *__s++ = traits_type::to_char_type(__c);
>                  __c = __sb->snextc();
>                  ++_M_gcount;
>                }
>              if (traits_type::eq_int_type(__c, __eof))
>                __err |= ios_base::eofbit;
>              else
>                {
>                  if (traits_type::eq_int_type(__c, __idelim))
>                    {
>                      __sb->sbumpc();
>                      ++_M_gcount;
>                    }
>                  else
>                    __err |= ios_base::failbit;
>                }
>            }
>          catch(...)
>            { this->_M_setstate(ios_base::badbit); }
>        }
>
>
>      if (__n > 0)
> *__s = char_type();
>      if (!_M_gcount)
>        __err |= ios_base::failbit;
>      if (__err)
>        this->setstate(__err);
>      return *this;
>    }
>
>
>
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    ignore(void)
>    {
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const int_type __eof = traits_type::eof();
>       __streambuf_type* __sb = this->rdbuf();
>
>       if (traits_type::eq_int_type(__sb->sbumpc(), __eof))
>  __err |= ios_base::eofbit;
>       else
>  _M_gcount = 1;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    ignore(streamsize __n)
>    {
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb && __n > 0)
>        {
>          ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>          try
>            {
>              const int_type __eof = traits_type::eof();
>              __streambuf_type* __sb = this->rdbuf();
>              int_type __c = __sb->sgetc();
># 692 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/istream.tcc" 3
>       bool __large_ignore = false;
>       while (true)
>  {
>    while (_M_gcount < __n
>    && !traits_type::eq_int_type(__c, __eof))
>      {
>        ++_M_gcount;
>        __c = __sb->snextc();
>      }
>    if (__n == numeric_limits<streamsize>::max()
>        && !traits_type::eq_int_type(__c, __eof))
>      {
>        _M_gcount = numeric_limits<streamsize>::min();
>        __large_ignore = true;
>      }
>    else
>      break;
>  }
>
>       if (__large_ignore)
>  _M_gcount = numeric_limits<streamsize>::max();
>
>       if (traits_type::eq_int_type(__c, __eof))
>                __err |= ios_base::eofbit;
>            }
>          catch(...)
>            { this->_M_setstate(ios_base::badbit); }
>          if (__err)
>            this->setstate(__err);
>        }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    ignore(streamsize __n, int_type __delim)
>    {
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb && __n > 0)
>        {
>          ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>          try
>            {
>              const int_type __eof = traits_type::eof();
>              __streambuf_type* __sb = this->rdbuf();
>              int_type __c = __sb->sgetc();
>
>
>       bool __large_ignore = false;
>       while (true)
>  {
>    while (_M_gcount < __n
>    && !traits_type::eq_int_type(__c, __eof)
>    && !traits_type::eq_int_type(__c, __delim))
>      {
>        ++_M_gcount;
>        __c = __sb->snextc();
>      }
>    if (__n == numeric_limits<streamsize>::max()
>        && !traits_type::eq_int_type(__c, __eof)
>        && !traits_type::eq_int_type(__c, __delim))
>      {
>        _M_gcount = numeric_limits<streamsize>::min();
>        __large_ignore = true;
>      }
>    else
>      break;
>  }
>
>       if (__large_ignore)
>  _M_gcount = numeric_limits<streamsize>::max();
>
>              if (traits_type::eq_int_type(__c, __eof))
>                __err |= ios_base::eofbit;
>       else if (traits_type::eq_int_type(__c, __delim))
>  {
>    if (_M_gcount < numeric_limits<streamsize>::max())
>      ++_M_gcount;
>    __sb->sbumpc();
>  }
>            }
>          catch(...)
>            { this->_M_setstate(ios_base::badbit); }
>          if (__err)
>            this->setstate(__err);
>        }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_istream<_CharT, _Traits>::int_type
>    basic_istream<_CharT, _Traits>::
>    peek(void)
>    {
>      int_type __c = traits_type::eof();
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       __c = this->rdbuf()->sgetc();
>       if (traits_type::eq_int_type(__c, traits_type::eof()))
>  __err |= ios_base::eofbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return __c;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    read(char_type* __s, streamsize __n)
>    {
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       _M_gcount = this->rdbuf()->sgetn(__s, __n);
>       if (_M_gcount != __n)
>  __err |= (ios_base::eofbit | ios_base::failbit);
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    streamsize
>    basic_istream<_CharT, _Traits>::
>    readsome(char_type* __s, streamsize __n)
>    {
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>
>       const streamsize __num = this->rdbuf()->in_avail();
>       if (__num > 0)
>  _M_gcount = this->rdbuf()->sgetn(__s, std::min(__num, __n));
>       else if (__num == -1)
>  __err |= ios_base::eofbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return _M_gcount;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    putback(char_type __c)
>    {
>
>
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const int_type __eof = traits_type::eof();
>       __streambuf_type* __sb = this->rdbuf();
>       if (!__sb
>    || traits_type::eq_int_type(__sb->sputbackc(__c), __eof))
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    unget(void)
>    {
>
>
>      _M_gcount = 0;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const int_type __eof = traits_type::eof();
>       __streambuf_type* __sb = this->rdbuf();
>       if (!__sb
>    || traits_type::eq_int_type(__sb->sungetc(), __eof))
>  __err |= ios_base::badbit;
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    int
>    basic_istream<_CharT, _Traits>::
>    sync(void)
>    {
>
>
>      int __ret = -1;
>      sentry __cerb(*this, true);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       __streambuf_type* __sb = this->rdbuf();
>       if (__sb)
>  {
>    if (__sb->pubsync() == -1)
>      __err |= ios_base::badbit;
>    else
>      __ret = 0;
>  }
>     }
>   catch(...)
>     { this->_M_setstate(ios_base::badbit); }
>   if (__err)
>     this->setstate(__err);
> }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    typename basic_istream<_CharT, _Traits>::pos_type
>    basic_istream<_CharT, _Traits>::
>    tellg(void)
>    {
>
>
>      pos_type __ret = pos_type(-1);
>      try
> {
>   if (!this->fail())
>     __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::in);
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      return __ret;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    seekg(pos_type __pos)
>    {
>
>
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      try
> {
>   if (!this->fail())
>     {
>
>       const pos_type __p = this->rdbuf()->pubseekpos(__pos,
>            ios_base::in);
>
>
>       if (__p == pos_type(off_type(-1)))
>  __err |= ios_base::failbit;
>     }
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    basic_istream<_CharT, _Traits>::
>    seekg(off_type __off, ios_base::seekdir __dir)
>    {
>
>
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      try
> {
>   if (!this->fail())
>     {
>
>       const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir,
>            ios_base::in);
>
>
>       if (__p == pos_type(off_type(-1)))
>  __err |= ios_base::failbit;
>     }
> }
>      catch(...)
> { this->_M_setstate(ios_base::badbit); }
>      if (__err)
> this->setstate(__err);
>      return *this;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef typename __istream_type::int_type __int_type;
>
>      typename __istream_type::sentry __cerb(__in, false);
>      if (__cerb)
> {
>   ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>   try
>     {
>       const __int_type __cb = __in.rdbuf()->sbumpc();
>       if (!_Traits::eq_int_type(__cb, _Traits::eof()))
>  __c = _Traits::to_char_type(__cb);
>       else
>  __err |= (ios_base::eofbit | ios_base::failbit);
>     }
>   catch(...)
>     { __in._M_setstate(ios_base::badbit); }
>   if (__err)
>     __in.setstate(__err);
> }
>      return __in;
>    }
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename _Traits::int_type int_type;
>      typedef _CharT char_type;
>      typedef ctype<_CharT> __ctype_type;
>
>      streamsize __extracted = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      typename __istream_type::sentry __cerb(__in, false);
>      if (__cerb)
> {
>   try
>     {
>
>       streamsize __num = __in.width();
>       if (__num <= 0)
>  __num = numeric_limits<streamsize>::max();
>
>       const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc());
>
>       const int_type __eof = _Traits::eof();
>       __streambuf_type* __sb = __in.rdbuf();
>       int_type __c = __sb->sgetc();
>
>       while (__extracted < __num - 1
>       && !_Traits::eq_int_type(__c, __eof)
>       && !__ct.is(ctype_base::space,
>     _Traits::to_char_type(__c)))
>  {
>    *__s++ = _Traits::to_char_type(__c);
>    ++__extracted;
>    __c = __sb->snextc();
>  }
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>
>
>
>       *__s = char_type();
>       __in.width(0);
>     }
>   catch(...)
>     { __in._M_setstate(ios_base::badbit); }
> }
>      if (!__extracted)
> __err |= ios_base::failbit;
>      if (__err)
> __in.setstate(__err);
>      return __in;
>    }
>
>
>  template<typename _CharT, typename _Traits>
>    basic_istream<_CharT,_Traits>&
>    ws(basic_istream<_CharT,_Traits>& __in)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef typename __istream_type::int_type __int_type;
>
>      const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc());
>      const __int_type __eof = _Traits::eof();
>      __streambuf_type* __sb = __in.rdbuf();
>      __int_type __c = __sb->sgetc();
>
>      while (!_Traits::eq_int_type(__c, __eof)
>      && __ct.is(ctype_base::space, _Traits::to_char_type(__c)))
> __c = __sb->snextc();
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __in.setstate(ios_base::eofbit);
>      return __in;
>    }
>
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __in,
>        basic_string<_CharT, _Traits, _Alloc>& __str)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef typename __istream_type::int_type __int_type;
>      typedef typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>
>      __size_type __extracted = 0;
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      typename __istream_type::sentry __cerb(__in, false);
>      if (__cerb)
> {
>   try
>     {
>
>       __str.erase();
>       _CharT __buf[128];
>       __size_type __len = 0;
>       const streamsize __w = __in.width();
>       const __size_type __n = __w > 0 ? static_cast<__size_type>(__w)
>                                : __str.max_size();
>       const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc());
>       const __int_type __eof = _Traits::eof();
>       __streambuf_type* __sb = __in.rdbuf();
>       __int_type __c = __sb->sgetc();
>
>       while (__extracted < __n
>       && !_Traits::eq_int_type(__c, __eof)
>       && !__ct.is(ctype_base::space, _Traits::to_char_type(__c)))
>  {
>    if (__len == sizeof(__buf) / sizeof(_CharT))
>      {
>        __str.append(__buf, sizeof(__buf) / sizeof(_CharT));
>        __len = 0;
>      }
>    __buf[__len++] = _Traits::to_char_type(__c);
>    ++__extracted;
>    __c = __sb->snextc();
>  }
>       __str.append(__buf, __len);
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>       __in.width(0);
>     }
>   catch(...)
>     {
>
>
>
>       __in._M_setstate(ios_base::badbit);
>     }
> }
>
>      if (!__extracted)
> __err |= ios_base::failbit;
>      if (__err)
> __in.setstate(__err);
>      return __in;
>    }
>
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    basic_istream<_CharT, _Traits>&
>    getline(basic_istream<_CharT, _Traits>& __in,
>     basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim)
>    {
>      typedef basic_istream<_CharT, _Traits> __istream_type;
>      typedef typename __istream_type::int_type __int_type;
>      typedef typename __istream_type::__streambuf_type __streambuf_type;
>      typedef typename __istream_type::__ctype_type __ctype_type;
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>
>      __size_type __extracted = 0;
>      const __size_type __n = __str.max_size();
>      ios_base::iostate __err = ios_base::iostate(ios_base::goodbit);
>      typename __istream_type::sentry __cerb(__in, true);
>      if (__cerb)
> {
>   try
>     {
>       __str.erase();
>       const __int_type __idelim = _Traits::to_int_type(__delim);
>       const __int_type __eof = _Traits::eof();
>       __streambuf_type* __sb = __in.rdbuf();
>       __int_type __c = __sb->sgetc();
>
>       while (__extracted < __n
>       && !_Traits::eq_int_type(__c, __eof)
>       && !_Traits::eq_int_type(__c, __idelim))
>  {
>    __str += _Traits::to_char_type(__c);
>    ++__extracted;
>    __c = __sb->snextc();
>  }
>
>       if (_Traits::eq_int_type(__c, __eof))
>  __err |= ios_base::eofbit;
>       else if (_Traits::eq_int_type(__c, __idelim))
>  {
>    ++__extracted;
>    __sb->sbumpc();
>  }
>       else
>  __err |= ios_base::failbit;
>     }
>   catch(...)
>     {
>
>
>
>       __in._M_setstate(ios_base::badbit);
>     }
> }
>      if (!__extracted)
> __err |= ios_base::failbit;
>      if (__err)
> __in.setstate(__err);
>      return __in;
>    }
>
>  template<class _CharT, class _Traits, class _Alloc>
>    inline basic_istream<_CharT,_Traits>&
>    getline(basic_istream<_CharT, _Traits>& __in,
>     basic_string<_CharT,_Traits,_Alloc>& __str)
>    { return getline(__in, __str, __in.widen('\n')); }
>
>
>
>
>
>  extern template class basic_istream<char>;
>  extern template istream& ws(istream&);
>  extern template istream& operator>>(istream&, char&);
>  extern template istream& operator>>(istream&, char*);
>  extern template istream& operator>>(istream&, unsigned char&);
>  extern template istream& operator>>(istream&, signed char&);
>  extern template istream& operator>>(istream&, unsigned char*);
>  extern template istream& operator>>(istream&, signed char*);
>
>  extern template class basic_iostream<char>;
>
>
>  extern template class basic_istream<wchar_t>;
>  extern template wistream& ws(wistream&);
>  extern template wistream& operator>>(wistream&, wchar_t&);
>  extern template wistream& operator>>(wistream&, wchar_t*);
>
>  extern template class basic_iostream<wchar_t>;
>
>
>}
># 820 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/istream" 2 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 2 3
>
>namespace std
>{
># 62 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iostream" 3
>  extern istream cin;
>  extern ostream cout;
>  extern ostream cerr;
>  extern ostream clog;
>
>
>  extern wistream wcin;
>  extern wostream wcout;
>  extern wostream wcerr;
>  extern wostream wclog;
>
>
>
>
>  static ios_base::Init __ioinit;
>}
># 56 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/functional" 1 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/functional" 3
>       
># 52 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/functional" 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 2 3
>
>namespace std
>{
>
>
>
>  struct _Resetiosflags { ios_base::fmtflags _M_mask; };
># 62 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>  inline _Resetiosflags
>  resetiosflags(ios_base::fmtflags __mask)
>  {
>    _Resetiosflags __x;
>    __x._M_mask = __mask;
>    return __x;
>  }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_istream<_CharT,_Traits>&
>    operator>>(basic_istream<_CharT,_Traits>& __is, _Resetiosflags __f)
>    {
>      __is.setf(ios_base::fmtflags(0), __f._M_mask);
>      return __is;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_ostream<_CharT,_Traits>&
>    operator<<(basic_ostream<_CharT,_Traits>& __os, _Resetiosflags __f)
>    {
>      __os.setf(ios_base::fmtflags(0), __f._M_mask);
>      return __os;
>    }
>
>
>  struct _Setiosflags { ios_base::fmtflags _M_mask; };
># 96 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>  inline _Setiosflags
>  setiosflags(ios_base::fmtflags __mask)
>  {
>    _Setiosflags __x;
>    __x._M_mask = __mask;
>    return __x;
>  }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_istream<_CharT,_Traits>&
>    operator>>(basic_istream<_CharT,_Traits>& __is, _Setiosflags __f)
>    {
>      __is.setf(__f._M_mask);
>      return __is;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_ostream<_CharT,_Traits>&
>    operator<<(basic_ostream<_CharT,_Traits>& __os, _Setiosflags __f)
>    {
>      __os.setf(__f._M_mask);
>      return __os;
>    }
>
>
>  struct _Setbase { int _M_base; };
># 131 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>  inline _Setbase
>  setbase(int __base)
>  {
>    _Setbase __x;
>    __x._M_base = __base;
>    return __x;
>  }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_istream<_CharT,_Traits>&
>    operator>>(basic_istream<_CharT,_Traits>& __is, _Setbase __f)
>    {
>      __is.setf(__f._M_base == 8 ? ios_base::oct :
>       __f._M_base == 10 ? ios_base::dec :
>       __f._M_base == 16 ? ios_base::hex :
>       ios_base::fmtflags(0), ios_base::basefield);
>      return __is;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_ostream<_CharT,_Traits>&
>    operator<<(basic_ostream<_CharT,_Traits>& __os, _Setbase __f)
>    {
>      __os.setf(__f._M_base == 8 ? ios_base::oct :
>  __f._M_base == 10 ? ios_base::dec :
>  __f._M_base == 16 ? ios_base::hex :
>  ios_base::fmtflags(0), ios_base::basefield);
>      return __os;
>    }
>
>
>  template<typename _CharT>
>    struct _Setfill { _CharT _M_c; };
># 172 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>  template<typename _CharT>
>    inline _Setfill<_CharT>
>    setfill(_CharT __c)
>    {
>      _Setfill<_CharT> __x;
>      __x._M_c = __c;
>      return __x;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_istream<_CharT,_Traits>&
>    operator>>(basic_istream<_CharT,_Traits>& __is, _Setfill<_CharT> __f)
>    {
>      __is.fill(__f._M_c);
>      return __is;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_ostream<_CharT,_Traits>&
>    operator<<(basic_ostream<_CharT,_Traits>& __os, _Setfill<_CharT> __f)
>    {
>      __os.fill(__f._M_c);
>      return __os;
>    }
>
>
>  struct _Setprecision { int _M_n; };
># 207 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>  inline _Setprecision
>  setprecision(int __n)
>  {
>    _Setprecision __x;
>    __x._M_n = __n;
>    return __x;
>  }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_istream<_CharT,_Traits>&
>    operator>>(basic_istream<_CharT,_Traits>& __is, _Setprecision __f)
>    {
>      __is.precision(__f._M_n);
>      return __is;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_ostream<_CharT,_Traits>&
>    operator<<(basic_ostream<_CharT,_Traits>& __os, _Setprecision __f)
>    {
>      __os.precision(__f._M_n);
>      return __os;
>    }
>
>
>  struct _Setw { int _M_n; };
># 241 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iomanip" 3
>  inline _Setw
>  setw(int __n)
>  {
>    _Setw __x;
>    __x._M_n = __n;
>    return __x;
>  }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_istream<_CharT,_Traits>&
>    operator>>(basic_istream<_CharT,_Traits>& __is, _Setw __f)
>    {
>      __is.width(__f._M_n);
>      return __is;
>    }
>
>  template<typename _CharT, typename _Traits>
>    inline basic_ostream<_CharT,_Traits>&
>    operator<<(basic_ostream<_CharT,_Traits>& __os, _Setw __f)
>    {
>      __os.width(__f._M_n);
>      return __os;
>    }
>
>
>
>
>
>  extern template ostream& operator<<(ostream&, _Setfill<char>);
>  extern template ostream& operator<<(ostream&, _Setiosflags);
>  extern template ostream& operator<<(ostream&, _Resetiosflags);
>  extern template ostream& operator<<(ostream&, _Setbase);
>  extern template ostream& operator<<(ostream&, _Setprecision);
>  extern template ostream& operator<<(ostream&, _Setw);
>  extern template istream& operator>>(istream&, _Setfill<char>);
>  extern template istream& operator>>(istream&, _Setiosflags);
>  extern template istream& operator>>(istream&, _Resetiosflags);
>  extern template istream& operator>>(istream&, _Setbase);
>  extern template istream& operator>>(istream&, _Setprecision);
>  extern template istream& operator>>(istream&, _Setw);
>
>
>  extern template wostream& operator<<(wostream&, _Setfill<wchar_t>);
>  extern template wostream& operator<<(wostream&, _Setiosflags);
>  extern template wostream& operator<<(wostream&, _Resetiosflags);
>  extern template wostream& operator<<(wostream&, _Setbase);
>  extern template wostream& operator<<(wostream&, _Setprecision);
>  extern template wostream& operator<<(wostream&, _Setw);
>  extern template wistream& operator>>(wistream&, _Setfill<wchar_t>);
>  extern template wistream& operator>>(wistream&, _Setiosflags);
>  extern template wistream& operator>>(wistream&, _Resetiosflags);
>  extern template wistream& operator>>(wistream&, _Setbase);
>  extern template wistream& operator>>(wistream&, _Setprecision);
>  extern template wistream& operator>>(wistream&, _Setw);
>
>
>}
># 57 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 1 3
># 48 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 3
>       
># 49 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 3
>
>
>
>
># 1 "/usr/include/math.h" 1 3 4
># 30 "/usr/include/math.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/huge_val.h" 1 3 4
># 35 "/usr/include/math.h" 2 3 4
>
># 1 "/usr/include/bits/huge_valf.h" 1 3 4
># 37 "/usr/include/math.h" 2 3 4
># 1 "/usr/include/bits/huge_vall.h" 1 3 4
># 38 "/usr/include/math.h" 2 3 4
>
>
># 1 "/usr/include/bits/inf.h" 1 3 4
># 41 "/usr/include/math.h" 2 3 4
>
>
># 1 "/usr/include/bits/nan.h" 1 3 4
># 44 "/usr/include/math.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/mathdef.h" 1 3 4
># 36 "/usr/include/bits/mathdef.h" 3 4
>typedef long double float_t;
>
>typedef long double double_t;
># 48 "/usr/include/math.h" 2 3 4
># 71 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathcalls.h" 1 3 4
># 53 "/usr/include/bits/mathcalls.h" 3 4
>
>
>extern double acos (double __x) throw (); extern double __acos (double __x) throw ();
>
>extern double asin (double __x) throw (); extern double __asin (double __x) throw ();
>
>extern double atan (double __x) throw (); extern double __atan (double __x) throw ();
>
>extern double atan2 (double __y, double __x) throw (); extern double __atan2 (double __y, double __x) throw ();
>
>
>extern double cos (double __x) throw (); extern double __cos (double __x) throw ();
>
>extern double sin (double __x) throw (); extern double __sin (double __x) throw ();
>
>extern double tan (double __x) throw (); extern double __tan (double __x) throw ();
>
>
>
>
>extern double cosh (double __x) throw (); extern double __cosh (double __x) throw ();
>
>extern double sinh (double __x) throw (); extern double __sinh (double __x) throw ();
>
>extern double tanh (double __x) throw (); extern double __tanh (double __x) throw ();
>
>
>
>
>extern void sincos (double __x, double *__sinx, double *__cosx) throw (); extern void __sincos (double __x, double *__sinx, double *__cosx) throw ();
>
>
>
>
>
>
>extern double acosh (double __x) throw (); extern double __acosh (double __x) throw ();
>
>extern double asinh (double __x) throw (); extern double __asinh (double __x) throw ();
>
>extern double atanh (double __x) throw (); extern double __atanh (double __x) throw ();
>
>
>
>
>
>
>
>extern double exp (double __x) throw (); extern double __exp (double __x) throw ();
>
>
>extern double frexp (double __x, int *__exponent) throw (); extern double __frexp (double __x, int *__exponent) throw ();
>
>
>extern double ldexp (double __x, int __exponent) throw (); extern double __ldexp (double __x, int __exponent) throw ();
>
>
>extern double log (double __x) throw (); extern double __log (double __x) throw ();
>
>
>extern double log10 (double __x) throw (); extern double __log10 (double __x) throw ();
>
>
>extern double modf (double __x, double *__iptr) throw (); extern double __modf (double __x, double *__iptr) throw ();
>
>
>
>
>extern double exp10 (double __x) throw (); extern double __exp10 (double __x) throw ();
>
>extern double pow10 (double __x) throw (); extern double __pow10 (double __x) throw ();
>
>
>
>
>
>extern double expm1 (double __x) throw (); extern double __expm1 (double __x) throw ();
>
>
>extern double log1p (double __x) throw (); extern double __log1p (double __x) throw ();
>
>
>extern double logb (double __x) throw (); extern double __logb (double __x) throw ();
>
>
>
>
>
>
>extern double exp2 (double __x) throw (); extern double __exp2 (double __x) throw ();
>
>
>extern double log2 (double __x) throw (); extern double __log2 (double __x) throw ();
>
>
>
>
>
>
>
>
>extern double pow (double __x, double __y) throw (); extern double __pow (double __x, double __y) throw ();
>
>
>extern double sqrt (double __x) throw (); extern double __sqrt (double __x) throw ();
>
>
>
>
>
>extern double hypot (double __x, double __y) throw (); extern double __hypot (double __x, double __y) throw ();
>
>
>
>
>
>
>extern double cbrt (double __x) throw (); extern double __cbrt (double __x) throw ();
>
>
>
>
>
>
>
>
>extern double ceil (double __x) throw () __attribute__ ((__const__)); extern double __ceil (double __x) throw () __attribute__ ((__const__));
>
>
>extern double fabs (double __x) throw () __attribute__ ((__const__)); extern double __fabs (double __x) throw () __attribute__ ((__const__));
>
>
>extern double floor (double __x) throw () __attribute__ ((__const__)); extern double __floor (double __x) throw () __attribute__ ((__const__));
>
>
>extern double fmod (double __x, double __y) throw (); extern double __fmod (double __x, double __y) throw ();
>
>
>
>
>extern int __isinf (double __value) throw () __attribute__ ((__const__));
>
>
>extern int __finite (double __value) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int isinf (double __value) throw () __attribute__ ((__const__));
>
>
>extern int finite (double __value) throw () __attribute__ ((__const__));
>
>
>extern double drem (double __x, double __y) throw (); extern double __drem (double __x, double __y) throw ();
>
>
>
>extern double significand (double __x) throw (); extern double __significand (double __x) throw ();
>
>
>
>
>
>extern double copysign (double __x, double __y) throw () __attribute__ ((__const__)); extern double __copysign (double __x, double __y) throw () __attribute__ ((__const__));
>
>
>
>
>
>
>extern double nan (__const char *__tagb) throw () __attribute__ ((__const__)); extern double __nan (__const char *__tagb) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int __isnan (double __value) throw () __attribute__ ((__const__));
>
>
>
>extern int isnan (double __value) throw () __attribute__ ((__const__));
>
>
>extern double j0 (double) throw (); extern double __j0 (double) throw ();
>extern double j1 (double) throw (); extern double __j1 (double) throw ();
>extern double jn (int, double) throw (); extern double __jn (int, double) throw ();
>extern double y0 (double) throw (); extern double __y0 (double) throw ();
>extern double y1 (double) throw (); extern double __y1 (double) throw ();
>extern double yn (int, double) throw (); extern double __yn (int, double) throw ();
>
>
>
>
>
>
>extern double erf (double) throw (); extern double __erf (double) throw ();
>extern double erfc (double) throw (); extern double __erfc (double) throw ();
>extern double lgamma (double) throw (); extern double __lgamma (double) throw ();
>
>
>
>
>
>
>extern double tgamma (double) throw (); extern double __tgamma (double) throw ();
>
>
>
>
>
>extern double gamma (double) throw (); extern double __gamma (double) throw ();
>
>
>
>
>
>
>extern double lgamma_r (double, int *__signgamp) throw (); extern double __lgamma_r (double, int *__signgamp) throw ();
>
>
>
>
>
>
>
>extern double rint (double __x) throw (); extern double __rint (double __x) throw ();
>
>
>extern double nextafter (double __x, double __y) throw () __attribute__ ((__const__)); extern double __nextafter (double __x, double __y) throw () __attribute__ ((__const__));
>
>extern double nexttoward (double __x, long double __y) throw () __attribute__ ((__const__)); extern double __nexttoward (double __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>extern double remainder (double __x, double __y) throw (); extern double __remainder (double __x, double __y) throw ();
>
>
>
>extern double scalbn (double __x, int __n) throw (); extern double __scalbn (double __x, int __n) throw ();
>
>
>
>extern int ilogb (double __x) throw (); extern int __ilogb (double __x) throw ();
>
>
>
>
>extern double scalbln (double __x, long int __n) throw (); extern double __scalbln (double __x, long int __n) throw ();
>
>
>
>extern double nearbyint (double __x) throw (); extern double __nearbyint (double __x) throw ();
>
>
>
>extern double round (double __x) throw () __attribute__ ((__const__)); extern double __round (double __x) throw () __attribute__ ((__const__));
>
>
>
>extern double trunc (double __x) throw () __attribute__ ((__const__)); extern double __trunc (double __x) throw () __attribute__ ((__const__));
>
>
>
>
>extern double remquo (double __x, double __y, int *__quo) throw (); extern double __remquo (double __x, double __y, int *__quo) throw ();
>
>
>
>
>
>
>extern long int lrint (double __x) throw (); extern long int __lrint (double __x) throw ();
>extern long long int llrint (double __x) throw (); extern long long int __llrint (double __x) throw ();
>
>
>
>extern long int lround (double __x) throw (); extern long int __lround (double __x) throw ();
>extern long long int llround (double __x) throw (); extern long long int __llround (double __x) throw ();
>
>
>
>extern double fdim (double __x, double __y) throw (); extern double __fdim (double __x, double __y) throw ();
>
>
>extern double fmax (double __x, double __y) throw (); extern double __fmax (double __x, double __y) throw ();
>
>
>extern double fmin (double __x, double __y) throw (); extern double __fmin (double __x, double __y) throw ();
>
>
>
>extern int __fpclassify (double __value) throw ()
>     __attribute__ ((__const__));
>
>
>extern int __signbit (double __value) throw ()
>     __attribute__ ((__const__));
>
>
>
>extern double fma (double __x, double __y, double __z) throw (); extern double __fma (double __x, double __y, double __z) throw ();
>
>
>
>
>
>
>
>
>extern double scalb (double __x, double __n) throw (); extern double __scalb (double __x, double __n) throw ();
># 72 "/usr/include/math.h" 2 3 4
># 94 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathcalls.h" 1 3 4
># 53 "/usr/include/bits/mathcalls.h" 3 4
>
>
>extern float acosf (float __x) throw (); extern float __acosf (float __x) throw ();
>
>extern float asinf (float __x) throw (); extern float __asinf (float __x) throw ();
>
>extern float atanf (float __x) throw (); extern float __atanf (float __x) throw ();
>
>extern float atan2f (float __y, float __x) throw (); extern float __atan2f (float __y, float __x) throw ();
>
>
>extern float cosf (float __x) throw (); extern float __cosf (float __x) throw ();
>
>extern float sinf (float __x) throw (); extern float __sinf (float __x) throw ();
>
>extern float tanf (float __x) throw (); extern float __tanf (float __x) throw ();
>
>
>
>
>extern float coshf (float __x) throw (); extern float __coshf (float __x) throw ();
>
>extern float sinhf (float __x) throw (); extern float __sinhf (float __x) throw ();
>
>extern float tanhf (float __x) throw (); extern float __tanhf (float __x) throw ();
>
>
>
>
>extern void sincosf (float __x, float *__sinx, float *__cosx) throw (); extern void __sincosf (float __x, float *__sinx, float *__cosx) throw ();
>
>
>
>
>
>
>extern float acoshf (float __x) throw (); extern float __acoshf (float __x) throw ();
>
>extern float asinhf (float __x) throw (); extern float __asinhf (float __x) throw ();
>
>extern float atanhf (float __x) throw (); extern float __atanhf (float __x) throw ();
>
>
>
>
>
>
>
>extern float expf (float __x) throw (); extern float __expf (float __x) throw ();
>
>
>extern float frexpf (float __x, int *__exponent) throw (); extern float __frexpf (float __x, int *__exponent) throw ();
>
>
>extern float ldexpf (float __x, int __exponent) throw (); extern float __ldexpf (float __x, int __exponent) throw ();
>
>
>extern float logf (float __x) throw (); extern float __logf (float __x) throw ();
>
>
>extern float log10f (float __x) throw (); extern float __log10f (float __x) throw ();
>
>
>extern float modff (float __x, float *__iptr) throw (); extern float __modff (float __x, float *__iptr) throw ();
>
>
>
>
>extern float exp10f (float __x) throw (); extern float __exp10f (float __x) throw ();
>
>extern float pow10f (float __x) throw (); extern float __pow10f (float __x) throw ();
>
>
>
>
>
>extern float expm1f (float __x) throw (); extern float __expm1f (float __x) throw ();
>
>
>extern float log1pf (float __x) throw (); extern float __log1pf (float __x) throw ();
>
>
>extern float logbf (float __x) throw (); extern float __logbf (float __x) throw ();
>
>
>
>
>
>
>extern float exp2f (float __x) throw (); extern float __exp2f (float __x) throw ();
>
>
>extern float log2f (float __x) throw (); extern float __log2f (float __x) throw ();
>
>
>
>
>
>
>
>
>extern float powf (float __x, float __y) throw (); extern float __powf (float __x, float __y) throw ();
>
>
>extern float sqrtf (float __x) throw (); extern float __sqrtf (float __x) throw ();
>
>
>
>
>
>extern float hypotf (float __x, float __y) throw (); extern float __hypotf (float __x, float __y) throw ();
>
>
>
>
>
>
>extern float cbrtf (float __x) throw (); extern float __cbrtf (float __x) throw ();
>
>
>
>
>
>
>
>
>extern float ceilf (float __x) throw () __attribute__ ((__const__)); extern float __ceilf (float __x) throw () __attribute__ ((__const__));
>
>
>extern float fabsf (float __x) throw () __attribute__ ((__const__)); extern float __fabsf (float __x) throw () __attribute__ ((__const__));
>
>
>extern float floorf (float __x) throw () __attribute__ ((__const__)); extern float __floorf (float __x) throw () __attribute__ ((__const__));
>
>
>extern float fmodf (float __x, float __y) throw (); extern float __fmodf (float __x, float __y) throw ();
>
>
>
>
>extern int __isinff (float __value) throw () __attribute__ ((__const__));
>
>
>extern int __finitef (float __value) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int isinff (float __value) throw () __attribute__ ((__const__));
>
>
>extern int finitef (float __value) throw () __attribute__ ((__const__));
>
>
>extern float dremf (float __x, float __y) throw (); extern float __dremf (float __x, float __y) throw ();
>
>
>
>extern float significandf (float __x) throw (); extern float __significandf (float __x) throw ();
>
>
>
>
>
>extern float copysignf (float __x, float __y) throw () __attribute__ ((__const__)); extern float __copysignf (float __x, float __y) throw () __attribute__ ((__const__));
>
>
>
>
>
>
>extern float nanf (__const char *__tagb) throw () __attribute__ ((__const__)); extern float __nanf (__const char *__tagb) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int __isnanf (float __value) throw () __attribute__ ((__const__));
>
>
>
>extern int isnanf (float __value) throw () __attribute__ ((__const__));
>
>
>extern float j0f (float) throw (); extern float __j0f (float) throw ();
>extern float j1f (float) throw (); extern float __j1f (float) throw ();
>extern float jnf (int, float) throw (); extern float __jnf (int, float) throw ();
>extern float y0f (float) throw (); extern float __y0f (float) throw ();
>extern float y1f (float) throw (); extern float __y1f (float) throw ();
>extern float ynf (int, float) throw (); extern float __ynf (int, float) throw ();
>
>
>
>
>
>
>extern float erff (float) throw (); extern float __erff (float) throw ();
>extern float erfcf (float) throw (); extern float __erfcf (float) throw ();
>extern float lgammaf (float) throw (); extern float __lgammaf (float) throw ();
>
>
>
>
>
>
>extern float tgammaf (float) throw (); extern float __tgammaf (float) throw ();
>
>
>
>
>
>extern float gammaf (float) throw (); extern float __gammaf (float) throw ();
>
>
>
>
>
>
>extern float lgammaf_r (float, int *__signgamp) throw (); extern float __lgammaf_r (float, int *__signgamp) throw ();
>
>
>
>
>
>
>
>extern float rintf (float __x) throw (); extern float __rintf (float __x) throw ();
>
>
>extern float nextafterf (float __x, float __y) throw () __attribute__ ((__const__)); extern float __nextafterf (float __x, float __y) throw () __attribute__ ((__const__));
>
>extern float nexttowardf (float __x, long double __y) throw () __attribute__ ((__const__)); extern float __nexttowardf (float __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>extern float remainderf (float __x, float __y) throw (); extern float __remainderf (float __x, float __y) throw ();
>
>
>
>extern float scalbnf (float __x, int __n) throw (); extern float __scalbnf (float __x, int __n) throw ();
>
>
>
>extern int ilogbf (float __x) throw (); extern int __ilogbf (float __x) throw ();
>
>
>
>
>extern float scalblnf (float __x, long int __n) throw (); extern float __scalblnf (float __x, long int __n) throw ();
>
>
>
>extern float nearbyintf (float __x) throw (); extern float __nearbyintf (float __x) throw ();
>
>
>
>extern float roundf (float __x) throw () __attribute__ ((__const__)); extern float __roundf (float __x) throw () __attribute__ ((__const__));
>
>
>
>extern float truncf (float __x) throw () __attribute__ ((__const__)); extern float __truncf (float __x) throw () __attribute__ ((__const__));
>
>
>
>
>extern float remquof (float __x, float __y, int *__quo) throw (); extern float __remquof (float __x, float __y, int *__quo) throw ();
>
>
>
>
>
>
>extern long int lrintf (float __x) throw (); extern long int __lrintf (float __x) throw ();
>extern long long int llrintf (float __x) throw (); extern long long int __llrintf (float __x) throw ();
>
>
>
>extern long int lroundf (float __x) throw (); extern long int __lroundf (float __x) throw ();
>extern long long int llroundf (float __x) throw (); extern long long int __llroundf (float __x) throw ();
>
>
>
>extern float fdimf (float __x, float __y) throw (); extern float __fdimf (float __x, float __y) throw ();
>
>
>extern float fmaxf (float __x, float __y) throw (); extern float __fmaxf (float __x, float __y) throw ();
>
>
>extern float fminf (float __x, float __y) throw (); extern float __fminf (float __x, float __y) throw ();
>
>
>
>extern int __fpclassifyf (float __value) throw ()
>     __attribute__ ((__const__));
>
>
>extern int __signbitf (float __value) throw ()
>     __attribute__ ((__const__));
>
>
>
>extern float fmaf (float __x, float __y, float __z) throw (); extern float __fmaf (float __x, float __y, float __z) throw ();
>
>
>
>
>
>
>
>
>extern float scalbf (float __x, float __n) throw (); extern float __scalbf (float __x, float __n) throw ();
># 95 "/usr/include/math.h" 2 3 4
># 141 "/usr/include/math.h" 3 4
># 1 "/usr/include/bits/mathcalls.h" 1 3 4
># 53 "/usr/include/bits/mathcalls.h" 3 4
>
>
>extern long double acosl (long double __x) throw (); extern long double __acosl (long double __x) throw ();
>
>extern long double asinl (long double __x) throw (); extern long double __asinl (long double __x) throw ();
>
>extern long double atanl (long double __x) throw (); extern long double __atanl (long double __x) throw ();
>
>extern long double atan2l (long double __y, long double __x) throw (); extern long double __atan2l (long double __y, long double __x) throw ();
>
>
>extern long double cosl (long double __x) throw (); extern long double __cosl (long double __x) throw ();
>
>extern long double sinl (long double __x) throw (); extern long double __sinl (long double __x) throw ();
>
>extern long double tanl (long double __x) throw (); extern long double __tanl (long double __x) throw ();
>
>
>
>
>extern long double coshl (long double __x) throw (); extern long double __coshl (long double __x) throw ();
>
>extern long double sinhl (long double __x) throw (); extern long double __sinhl (long double __x) throw ();
>
>extern long double tanhl (long double __x) throw (); extern long double __tanhl (long double __x) throw ();
>
>
>
>
>extern void sincosl (long double __x, long double *__sinx, long double *__cosx) throw (); extern void __sincosl (long double __x, long double *__sinx, long double *__cosx) throw ();
>
>
>
>
>
>
>extern long double acoshl (long double __x) throw (); extern long double __acoshl (long double __x) throw ();
>
>extern long double asinhl (long double __x) throw (); extern long double __asinhl (long double __x) throw ();
>
>extern long double atanhl (long double __x) throw (); extern long double __atanhl (long double __x) throw ();
>
>
>
>
>
>
>
>extern long double expl (long double __x) throw (); extern long double __expl (long double __x) throw ();
>
>
>extern long double frexpl (long double __x, int *__exponent) throw (); extern long double __frexpl (long double __x, int *__exponent) throw ();
>
>
>extern long double ldexpl (long double __x, int __exponent) throw (); extern long double __ldexpl (long double __x, int __exponent) throw ();
>
>
>extern long double logl (long double __x) throw (); extern long double __logl (long double __x) throw ();
>
>
>extern long double log10l (long double __x) throw (); extern long double __log10l (long double __x) throw ();
>
>
>extern long double modfl (long double __x, long double *__iptr) throw (); extern long double __modfl (long double __x, long double *__iptr) throw ();
>
>
>
>
>extern long double exp10l (long double __x) throw (); extern long double __exp10l (long double __x) throw ();
>
>extern long double pow10l (long double __x) throw (); extern long double __pow10l (long double __x) throw ();
>
>
>
>
>
>extern long double expm1l (long double __x) throw (); extern long double __expm1l (long double __x) throw ();
>
>
>extern long double log1pl (long double __x) throw (); extern long double __log1pl (long double __x) throw ();
>
>
>extern long double logbl (long double __x) throw (); extern long double __logbl (long double __x) throw ();
>
>
>
>
>
>
>extern long double exp2l (long double __x) throw (); extern long double __exp2l (long double __x) throw ();
>
>
>extern long double log2l (long double __x) throw (); extern long double __log2l (long double __x) throw ();
>
>
>
>
>
>
>
>
>extern long double powl (long double __x, long double __y) throw (); extern long double __powl (long double __x, long double __y) throw ();
>
>
>extern long double sqrtl (long double __x) throw (); extern long double __sqrtl (long double __x) throw ();
>
>
>
>
>
>extern long double hypotl (long double __x, long double __y) throw (); extern long double __hypotl (long double __x, long double __y) throw ();
>
>
>
>
>
>
>extern long double cbrtl (long double __x) throw (); extern long double __cbrtl (long double __x) throw ();
>
>
>
>
>
>
>
>
>extern long double ceill (long double __x) throw () __attribute__ ((__const__)); extern long double __ceill (long double __x) throw () __attribute__ ((__const__));
>
>
>extern long double fabsl (long double __x) throw () __attribute__ ((__const__)); extern long double __fabsl (long double __x) throw () __attribute__ ((__const__));
>
>
>extern long double floorl (long double __x) throw () __attribute__ ((__const__)); extern long double __floorl (long double __x) throw () __attribute__ ((__const__));
>
>
>extern long double fmodl (long double __x, long double __y) throw (); extern long double __fmodl (long double __x, long double __y) throw ();
>
>
>
>
>extern int __isinfl (long double __value) throw () __attribute__ ((__const__));
>
>
>extern int __finitel (long double __value) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int isinfl (long double __value) throw () __attribute__ ((__const__));
>
>
>extern int finitel (long double __value) throw () __attribute__ ((__const__));
>
>
>extern long double dreml (long double __x, long double __y) throw (); extern long double __dreml (long double __x, long double __y) throw ();
>
>
>
>extern long double significandl (long double __x) throw (); extern long double __significandl (long double __x) throw ();
>
>
>
>
>
>extern long double copysignl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __copysignl (long double __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>
>
>
>extern long double nanl (__const char *__tagb) throw () __attribute__ ((__const__)); extern long double __nanl (__const char *__tagb) throw () __attribute__ ((__const__));
>
>
>
>
>
>extern int __isnanl (long double __value) throw () __attribute__ ((__const__));
>
>
>
>extern int isnanl (long double __value) throw () __attribute__ ((__const__));
>
>
>extern long double j0l (long double) throw (); extern long double __j0l (long double) throw ();
>extern long double j1l (long double) throw (); extern long double __j1l (long double) throw ();
>extern long double jnl (int, long double) throw (); extern long double __jnl (int, long double) throw ();
>extern long double y0l (long double) throw (); extern long double __y0l (long double) throw ();
>extern long double y1l (long double) throw (); extern long double __y1l (long double) throw ();
>extern long double ynl (int, long double) throw (); extern long double __ynl (int, long double) throw ();
>
>
>
>
>
>
>extern long double erfl (long double) throw (); extern long double __erfl (long double) throw ();
>extern long double erfcl (long double) throw (); extern long double __erfcl (long double) throw ();
>extern long double lgammal (long double) throw (); extern long double __lgammal (long double) throw ();
>
>
>
>
>
>
>extern long double tgammal (long double) throw (); extern long double __tgammal (long double) throw ();
>
>
>
>
>
>extern long double gammal (long double) throw (); extern long double __gammal (long double) throw ();
>
>
>
>
>
>
>extern long double lgammal_r (long double, int *__signgamp) throw (); extern long double __lgammal_r (long double, int *__signgamp) throw ();
>
>
>
>
>
>
>
>extern long double rintl (long double __x) throw (); extern long double __rintl (long double __x) throw ();
>
>
>extern long double nextafterl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __nextafterl (long double __x, long double __y) throw () __attribute__ ((__const__));
>
>extern long double nexttowardl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __nexttowardl (long double __x, long double __y) throw () __attribute__ ((__const__));
>
>
>
>extern long double remainderl (long double __x, long double __y) throw (); extern long double __remainderl (long double __x, long double __y) throw ();
>
>
>
>extern long double scalbnl (long double __x, int __n) throw (); extern long double __scalbnl (long double __x, int __n) throw ();
>
>
>
>extern int ilogbl (long double __x) throw (); extern int __ilogbl (long double __x) throw ();
>
>
>
>
>extern long double scalblnl (long double __x, long int __n) throw (); extern long double __scalblnl (long double __x, long int __n) throw ();
>
>
>
>extern long double nearbyintl (long double __x) throw (); extern long double __nearbyintl (long double __x) throw ();
>
>
>
>extern long double roundl (long double __x) throw () __attribute__ ((__const__)); extern long double __roundl (long double __x) throw () __attribute__ ((__const__));
>
>
>
>extern long double truncl (long double __x) throw () __attribute__ ((__const__)); extern long double __truncl (long double __x) throw () __attribute__ ((__const__));
>
>
>
>
>extern long double remquol (long double __x, long double __y, int *__quo) throw (); extern long double __remquol (long double __x, long double __y, int *__quo) throw ();
>
>
>
>
>
>
>extern long int lrintl (long double __x) throw (); extern long int __lrintl (long double __x) throw ();
>extern long long int llrintl (long double __x) throw (); extern long long int __llrintl (long double __x) throw ();
>
>
>
>extern long int lroundl (long double __x) throw (); extern long int __lroundl (long double __x) throw ();
>extern long long int llroundl (long double __x) throw (); extern long long int __llroundl (long double __x) throw ();
>
>
>
>extern long double fdiml (long double __x, long double __y) throw (); extern long double __fdiml (long double __x, long double __y) throw ();
>
>
>extern long double fmaxl (long double __x, long double __y) throw (); extern long double __fmaxl (long double __x, long double __y) throw ();
>
>
>extern long double fminl (long double __x, long double __y) throw (); extern long double __fminl (long double __x, long double __y) throw ();
>
>
>
>extern int __fpclassifyl (long double __value) throw ()
>     __attribute__ ((__const__));
>
>
>extern int __signbitl (long double __value) throw ()
>     __attribute__ ((__const__));
>
>
>
>extern long double fmal (long double __x, long double __y, long double __z) throw (); extern long double __fmal (long double __x, long double __y, long double __z) throw ();
>
>
>
>
>
>
>
>
>extern long double scalbl (long double __x, long double __n) throw (); extern long double __scalbl (long double __x, long double __n) throw ();
># 142 "/usr/include/math.h" 2 3 4
># 157 "/usr/include/math.h" 3 4
>extern int signgam;
># 198 "/usr/include/math.h" 3 4
>enum
>  {
>    FP_NAN,
>
>    FP_INFINITE,
>
>    FP_ZERO,
>
>    FP_SUBNORMAL,
>
>    FP_NORMAL
>
>  };
># 284 "/usr/include/math.h" 3 4
>typedef enum
>{
>  _IEEE_ = -1,
>  _SVID_,
>  _XOPEN_,
>  _POSIX_,
>  _ISOC_
>} _LIB_VERSION_TYPE;
>
>
>
>
>extern _LIB_VERSION_TYPE _LIB_VERSION;
># 307 "/usr/include/math.h" 3 4
>struct __exception
>
>
>
>  {
>    int type;
>    char *name;
>    double arg1;
>    double arg2;
>    double retval;
>  };
>
>
>extern int matherr (struct __exception *__exc) throw ();
># 465 "/usr/include/math.h" 3 4
>}
># 54 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 2 3
># 82 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 3
>namespace std
>{
>
>
>  template<typename _Tp> _Tp __cmath_power(_Tp, unsigned int);
>
>  inline double
>  abs(double __x)
>  { return __builtin_fabs(__x); }
>
>  inline float
>  abs(float __x)
>  { return __builtin_fabsf(__x); }
>
>  inline long double
>  abs(long double __x)
>  { return __builtin_fabsl(__x); }
>
>  using ::acos;
>
>  inline float
>  acos(float __x)
>  { return __builtin_acosf(__x); }
>
>  inline long double
>  acos(long double __x)
>  { return __builtin_acosl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    acos(_Tp __x)
>    {
>      return __builtin_acos(__x);
>    }
>
>  using ::asin;
>
>  inline float
>  asin(float __x)
>  { return __builtin_asinf(__x); }
>
>  inline long double
>  asin(long double __x)
>  { return __builtin_asinl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    asin(_Tp __x)
>    { return __builtin_asin(__x); }
>
>  using ::atan;
>
>  inline float
>  atan(float __x)
>  { return __builtin_atanf(__x); }
>
>  inline long double
>  atan(long double __x)
>  { return __builtin_atanl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    atan(_Tp __x)
>    { return __builtin_atan(__x); }
>
>  using ::atan2;
>
>  inline float
>  atan2(float __y, float __x)
>  { return __builtin_atan2f(__y, __x); }
>
>  inline long double
>  atan2(long double __y, long double __x)
>  { return __builtin_atan2l(__y, __x); }
>
>  template<typename _Tp, typename _Up>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value
>                                        && __is_integer<_Up>::__value>::__type
>    atan2(_Tp __y, _Up __x)
>    { return __builtin_atan2(__y, __x); }
>
>  using ::ceil;
>
>  inline float
>  ceil(float __x)
>  { return __builtin_ceilf(__x); }
>
>  inline long double
>  ceil(long double __x)
>  { return __builtin_ceill(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    ceil(_Tp __x)
>    { return __builtin_ceil(__x); }
>
>  using ::cos;
>
>  inline float
>  cos(float __x)
>  { return __builtin_cosf(__x); }
>
>  inline long double
>  cos(long double __x)
>  { return __builtin_cosl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    cos(_Tp __x)
>    { return __builtin_cos(__x); }
>
>  using ::cosh;
>
>  inline float
>  cosh(float __x)
>  { return __builtin_coshf(__x); }
>
>  inline long double
>  cosh(long double __x)
>  { return __builtin_coshl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    cosh(_Tp __x)
>    { return __builtin_cosh(__x); }
>
>  using ::exp;
>
>  inline float
>  exp(float __x)
>  { return __builtin_expf(__x); }
>
>  inline long double
>  exp(long double __x)
>  { return __builtin_expl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    exp(_Tp __x)
>    { return __builtin_exp(__x); }
>
>  using ::fabs;
>
>  inline float
>  fabs(float __x)
>  { return __builtin_fabsf(__x); }
>
>  inline long double
>  fabs(long double __x)
>  { return __builtin_fabsl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    fabs(_Tp __x)
>    { return __builtin_fabs(__x); }
>
>  using ::floor;
>
>  inline float
>  floor(float __x)
>  { return __builtin_floorf(__x); }
>
>  inline long double
>  floor(long double __x)
>  { return __builtin_floorl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    floor(_Tp __x)
>    { return __builtin_floor(__x); }
>
>  using ::fmod;
>
>  inline float
>  fmod(float __x, float __y)
>  { return __builtin_fmodf(__x, __y); }
>
>  inline long double
>  fmod(long double __x, long double __y)
>  { return __builtin_fmodl(__x, __y); }
>
>  using ::frexp;
>
>  inline float
>  frexp(float __x, int* __exp)
>  { return __builtin_frexpf(__x, __exp); }
>
>  inline long double
>  frexp(long double __x, int* __exp)
>  { return __builtin_frexpl(__x, __exp); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    frexp(_Tp __x, int* __exp)
>    { return __builtin_frexp(__x, __exp); }
>
>  using ::ldexp;
>
>  inline float
>  ldexp(float __x, int __exp)
>  { return __builtin_ldexpf(__x, __exp); }
>
>  inline long double
>  ldexp(long double __x, int __exp)
>  { return __builtin_ldexpl(__x, __exp); }
>
>  template<typename _Tp>
>  inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>  ldexp(_Tp __x, int __exp)
>  { return __builtin_ldexp(__x, __exp); }
>
>  using ::log;
>
>  inline float
>  log(float __x)
>  { return __builtin_logf(__x); }
>
>  inline long double
>  log(long double __x)
>  { return __builtin_logl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    log(_Tp __x)
>    { return __builtin_log(__x); }
>
>  using ::log10;
>
>  inline float
>  log10(float __x)
>  { return __builtin_log10f(__x); }
>
>  inline long double
>  log10(long double __x)
>  { return __builtin_log10l(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    log10(_Tp __x)
>    { return __builtin_log10(__x); }
>
>  using ::modf;
>
>  inline float
>  modf(float __x, float* __iptr)
>  { return __builtin_modff(__x, __iptr); }
>
>  inline long double
>  modf(long double __x, long double* __iptr)
>  { return __builtin_modfl(__x, __iptr); }
>
>  template<typename _Tp>
>    inline _Tp
>    __pow_helper(_Tp __x, int __n)
>    {
>      return __n < 0
>        ? _Tp(1)/__cmath_power(__x, -__n)
>        : __cmath_power(__x, __n);
>    }
>
>  using ::pow;
>
>  inline float
>  pow(float __x, float __y)
>  { return __builtin_powf(__x, __y); }
>
>  inline long double
>  pow(long double __x, long double __y)
>  { return __builtin_powl(__x, __y); }
>
>  inline double
>  pow(double __x, int __i)
>  { return __builtin_powi(__x, __i); }
>
>  inline float
>  pow(float __x, int __n)
>  { return __builtin_powif(__x, __n); }
>
>  inline long double
>  pow(long double __x, int __n)
>  { return __builtin_powil(__x, __n); }
>
>  using ::sin;
>
>  inline float
>  sin(float __x)
>  { return __builtin_sinf(__x); }
>
>  inline long double
>  sin(long double __x)
>  { return __builtin_sinl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    sin(_Tp __x)
>    { return __builtin_sin(__x); }
>
>  using ::sinh;
>
>  inline float
>  sinh(float __x)
>  { return __builtin_sinhf(__x); }
>
>  inline long double
>  sinh(long double __x)
>  { return __builtin_sinhl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    sinh(_Tp __x)
>    { return __builtin_sinh(__x); }
>
>  using ::sqrt;
>
>  inline float
>  sqrt(float __x)
>  { return __builtin_sqrtf(__x); }
>
>  inline long double
>  sqrt(long double __x)
>  { return __builtin_sqrtl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    sqrt(_Tp __x)
>    { return __builtin_sqrt(__x); }
>
>  using ::tan;
>
>  inline float
>  tan(float __x)
>  { return __builtin_tanf(__x); }
>
>  inline long double
>  tan(long double __x)
>  { return __builtin_tanl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    tan(_Tp __x)
>    { return __builtin_tan(__x); }
>
>  using ::tanh;
>
>  inline float
>  tanh(float __x)
>  { return __builtin_tanhf(__x); }
>
>  inline long double
>  tanh(long double __x)
>  { return __builtin_tanhl(__x); }
>
>  template<typename _Tp>
>    inline typename __enable_if<double, __is_integer<_Tp>::__value>::__type
>    tanh(_Tp __x)
>    { return __builtin_tanh(__x); }
>}
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>  template<typename _Tp>
>    inline int
>    __capture_fpclassify(_Tp __f) { return (sizeof (__f) == sizeof (float) ? __fpclassifyf (__f) : sizeof (__f) == sizeof (double) ? __fpclassify (__f) : __fpclassifyl (__f)); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isfinite(_Tp __f) { return (sizeof (__f) == sizeof (float) ? __finitef (__f) : sizeof (__f) == sizeof (double) ? __finite (__f) : __finitel (__f)); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isinf(_Tp __f) { return (sizeof (__f) == sizeof (float) ? __isinff (__f) : sizeof (__f) == sizeof (double) ? __isinf (__f) : __isinfl (__f)); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isnan(_Tp __f) { return (sizeof (__f) == sizeof (float) ? __isnanf (__f) : sizeof (__f) == sizeof (double) ? __isnan (__f) : __isnanl (__f)); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isnormal(_Tp __f) { return ((sizeof (__f) == sizeof (float) ? __fpclassifyf (__f) : sizeof (__f) == sizeof (double) ? __fpclassify (__f) : __fpclassifyl (__f)) == FP_NORMAL); }
>
>  template<typename _Tp>
>    inline int
>    __capture_signbit(_Tp __f) { return (sizeof (__f) == sizeof (float) ? __signbitf (__f) : sizeof (__f) == sizeof (double) ? __signbit (__f) : __signbitl (__f)); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isgreater(_Tp __f1, _Tp __f2)
>    { return __builtin_isgreater(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isgreaterequal(_Tp __f1, _Tp __f2)
>    { return __builtin_isgreaterequal(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isless(_Tp __f1, _Tp __f2) { return __builtin_isless(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    __capture_islessequal(_Tp __f1, _Tp __f2)
>    { return __builtin_islessequal(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    __capture_islessgreater(_Tp __f1, _Tp __f2)
>    { return __builtin_islessgreater(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    __capture_isunordered(_Tp __f1, _Tp __f2)
>    { return __builtin_isunordered(__f1, __f2); }
>}
># 515 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 3
>namespace std
>{
>  template<typename _Tp>
>    inline int
>    fpclassify(_Tp __f) { return __gnu_cxx::__capture_fpclassify(__f); }
>
>  template<typename _Tp>
>    inline int
>    isfinite(_Tp __f) { return __gnu_cxx::__capture_isfinite(__f); }
>
>  template<typename _Tp>
>    inline int
>    isinf(_Tp __f) { return __gnu_cxx::__capture_isinf(__f); }
>
>  template<typename _Tp>
>    inline int
>    isnan(_Tp __f) { return __gnu_cxx::__capture_isnan(__f); }
>
>  template<typename _Tp>
>    inline int
>    isnormal(_Tp __f) { return __gnu_cxx::__capture_isnormal(__f); }
>
>  template<typename _Tp>
>    inline int
>    signbit(_Tp __f) { return __gnu_cxx::__capture_signbit(__f); }
>
>  template<typename _Tp>
>    inline int
>    isgreater(_Tp __f1, _Tp __f2)
>    { return __gnu_cxx::__capture_isgreater(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    isgreaterequal(_Tp __f1, _Tp __f2)
>    { return __gnu_cxx::__capture_isgreaterequal(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    isless(_Tp __f1, _Tp __f2)
>    { return __gnu_cxx::__capture_isless(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    islessequal(_Tp __f1, _Tp __f2)
>    { return __gnu_cxx::__capture_islessequal(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    islessgreater(_Tp __f1, _Tp __f2)
>    { return __gnu_cxx::__capture_islessgreater(__f1, __f2); }
>
>  template<typename _Tp>
>    inline int
>    isunordered(_Tp __f1, _Tp __f2)
>    { return __gnu_cxx::__capture_isunordered(__f1, __f2); }
>}
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cmath.tcc" 1 3
># 35 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/cmath.tcc" 3
>namespace std
>{
>  template<typename _Tp>
>    inline _Tp
>    __cmath_power(_Tp __x, unsigned int __n)
>    {
>      _Tp __y = __n % 2 ? __x : 1;
>
>      while (__n >>= 1)
>        {
>          __x = __x * __x;
>          if (__n % 2)
>            __y = __y * __x;
>        }
>
>      return __y;
>    }
>}
># 576 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/cmath" 2 3
># 64 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 1 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>       
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>
>
>
>
>namespace std
>{
># 61 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_stringbuf : public basic_streambuf<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>      typedef basic_streambuf<char_type, traits_type> __streambuf_type;
>      typedef basic_string<char_type, _Traits, _Alloc> __string_type;
>      typedef typename __string_type::size_type __size_type;
>
>    protected:
>
>
>
>
>
>      ios_base::openmode _M_mode;
>
>
>      __string_type _M_string;
>
>    public:
># 99 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out)
>      : __streambuf_type(), _M_mode(__mode), _M_string()
>      { }
># 112 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_stringbuf(const __string_type& __str,
>        ios_base::openmode __mode = ios_base::in | ios_base::out)
>      : __streambuf_type(), _M_mode(), _M_string(__str.data(), __str.size())
>      { _M_stringbuf_init(__mode); }
># 127 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      __string_type
>      str() const
>      {
> __string_type __ret;
> if (this->pptr())
>   {
>
>     if (this->pptr() > this->egptr())
>       __ret = __string_type(this->pbase(), this->pptr());
>     else
>        __ret = __string_type(this->pbase(), this->egptr());
>   }
> else
>   __ret = _M_string;
> return __ret;
>      }
># 151 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      void
>      str(const __string_type& __s)
>      {
>
> _M_string.assign(__s.data(), __s.size());
> _M_stringbuf_init(_M_mode);
>      }
>
>    protected:
>
>      void
>      _M_stringbuf_init(ios_base::openmode __mode)
>      {
> _M_mode = __mode;
> __size_type __len = 0;
> if (_M_mode & (ios_base::ate | ios_base::app))
>   __len = _M_string.size();
> _M_sync(const_cast<char_type*>(_M_string.data()), 0, __len);
>      }
>
>      virtual streamsize
>      showmanyc()
>      {
> streamsize __ret = -1;
> if (_M_mode & ios_base::in)
>   {
>     _M_update_egptr();
>     __ret = this->egptr() - this->gptr();
>   }
> return __ret;
>      }
>
>      virtual int_type
>      underflow();
>
>      virtual int_type
>      pbackfail(int_type __c = traits_type::eof());
>
>      virtual int_type
>      overflow(int_type __c = traits_type::eof());
># 203 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      virtual __streambuf_type*
>      setbuf(char_type* __s, streamsize __n)
>      {
> if (__s && __n >= 0)
>   {
>
>
>
>
>
>
>     _M_string.clear();
>
>
>     _M_sync(__s, __n, 0);
>   }
> return this;
>      }
>
>      virtual pos_type
>      seekoff(off_type __off, ios_base::seekdir __way,
>       ios_base::openmode __mode = ios_base::in | ios_base::out);
>
>      virtual pos_type
>      seekpos(pos_type __sp,
>       ios_base::openmode __mode = ios_base::in | ios_base::out);
>
>
>
>
>      void
>      _M_sync(char_type* __base, __size_type __i, __size_type __o);
>
>
>
>      void
>      _M_update_egptr()
>      {
> const bool __testin = _M_mode & ios_base::in;
> if (this->pptr() && this->pptr() > this->egptr())
>   if (__testin)
>     this->setg(this->eback(), this->gptr(), this->pptr());
>   else
>     this->setg(this->pptr(), this->pptr(), this->pptr());
>      }
>    };
># 260 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>  template<typename _CharT, typename _Traits, typename _Alloc>
>    class basic_istringstream : public basic_istream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;
>      typedef basic_istream<char_type, traits_type> __istream_type;
>
>    private:
>      __stringbuf_type _M_stringbuf;
>
>    public:
># 298 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_istringstream(ios_base::openmode __mode = ios_base::in)
>      : __istream_type(), _M_stringbuf(__mode | ios_base::in)
>      { this->init(&_M_stringbuf); }
># 318 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_istringstream(const __string_type& __str,
>     ios_base::openmode __mode = ios_base::in)
>      : __istream_type(), _M_stringbuf(__str, __mode | ios_base::in)
>      { this->init(&_M_stringbuf); }
>
>
>
>
>
>
>
>      ~basic_istringstream()
>      { }
># 340 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      __stringbuf_type*
>      rdbuf() const
>      { return const_cast<__stringbuf_type*>(&_M_stringbuf); }
>
>
>
>
>
>      __string_type
>      str() const
>      { return _M_stringbuf.str(); }
>
>
>
>
>
>
>
>      void
>      str(const __string_type& __s)
>      { _M_stringbuf.str(__s); }
>    };
># 373 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>  template <typename _CharT, typename _Traits, typename _Alloc>
>    class basic_ostringstream : public basic_ostream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;
>      typedef basic_ostream<char_type, traits_type> __ostream_type;
>
>    private:
>      __stringbuf_type _M_stringbuf;
>
>    public:
># 411 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_ostringstream(ios_base::openmode __mode = ios_base::out)
>      : __ostream_type(), _M_stringbuf(__mode | ios_base::out)
>      { this->init(&_M_stringbuf); }
># 431 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_ostringstream(const __string_type& __str,
>     ios_base::openmode __mode = ios_base::out)
>      : __ostream_type(), _M_stringbuf(__str, __mode | ios_base::out)
>      { this->init(&_M_stringbuf); }
>
>
>
>
>
>
>
>      ~basic_ostringstream()
>      { }
># 453 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      __stringbuf_type*
>      rdbuf() const
>      { return const_cast<__stringbuf_type*>(&_M_stringbuf); }
>
>
>
>
>
>      __string_type
>      str() const
>      { return _M_stringbuf.str(); }
>
>
>
>
>
>
>
>      void
>      str(const __string_type& __s)
>      { _M_stringbuf.str(__s); }
>    };
># 486 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>  template <typename _CharT, typename _Traits, typename _Alloc>
>    class basic_stringstream : public basic_iostream<_CharT, _Traits>
>    {
>    public:
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>
>
>      typedef _Alloc allocator_type;
>      typedef typename traits_type::int_type int_type;
>      typedef typename traits_type::pos_type pos_type;
>      typedef typename traits_type::off_type off_type;
>
>
>      typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
>      typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;
>      typedef basic_iostream<char_type, traits_type> __iostream_type;
>
>    private:
>      __stringbuf_type _M_stringbuf;
>
>    public:
># 522 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in)
>      : __iostream_type(), _M_stringbuf(__m)
>      { this->init(&_M_stringbuf); }
># 540 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      explicit
>      basic_stringstream(const __string_type& __str,
>    ios_base::openmode __m = ios_base::out | ios_base::in)
>      : __iostream_type(), _M_stringbuf(__str, __m)
>      { this->init(&_M_stringbuf); }
>
>
>
>
>
>
>
>      ~basic_stringstream()
>      { }
># 562 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 3
>      __stringbuf_type*
>      rdbuf() const
>      { return const_cast<__stringbuf_type*>(&_M_stringbuf); }
>
>
>
>
>
>      __string_type
>      str() const
>      { return _M_stringbuf.str(); }
>
>
>
>
>
>
>
>      void
>      str(const __string_type& __s)
>      { _M_stringbuf.str(__s); }
>    };
>}
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/sstream.tcc" 1 3
># 43 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/sstream.tcc" 3
>       
># 44 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/sstream.tcc" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/sstream.tcc" 2 3
>
>namespace std
>{
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    pbackfail(int_type __c)
>    {
>      int_type __ret = traits_type::eof();
>      if (this->eback() < this->gptr())
> {
>
>
>   const bool __testeof = traits_type::eq_int_type(__c, __ret);
>   if (!__testeof)
>     {
>       const bool __testeq = traits_type::eq(traits_type::
>          to_char_type(__c),
>          this->gptr()[-1]);
>       const bool __testout = this->_M_mode & ios_base::out;
>       if (__testeq || __testout)
>  {
>    this->gbump(-1);
>    if (!__testeq)
>      *this->gptr() = traits_type::to_char_type(__c);
>    __ret = __c;
>  }
>     }
>   else
>     {
>       this->gbump(-1);
>       __ret = traits_type::not_eof(__c);
>     }
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    overflow(int_type __c)
>    {
>      const bool __testout = this->_M_mode & ios_base::out;
>      if (__builtin_expect(!__testout, false))
> return traits_type::eof();
>
>      const bool __testeof = traits_type::eq_int_type(__c, traits_type::eof());
>      if (__builtin_expect(__testeof, false))
> return traits_type::not_eof(__c);
>
>      const __size_type __capacity = _M_string.capacity();
>      const __size_type __max_size = _M_string.max_size();
>      const bool __testput = this->pptr() < this->epptr();
>      if (__builtin_expect(!__testput && __capacity == __max_size, false))
> return traits_type::eof();
>
>
>
>      if (!__testput)
> {
>
>
>
>
>
>
>   const __size_type __opt_len = std::max(__size_type(2 * __capacity),
>       __size_type(512));
>   const __size_type __len = std::min(__opt_len, __max_size);
>   __string_type __tmp;
>   __tmp.reserve(__len);
>   if (this->pbase())
>     __tmp.assign(this->pbase(), this->epptr() - this->pbase());
>   _M_string.swap(__tmp);
>   _M_sync(const_cast<char_type*>(_M_string.data()),
>    this->gptr() - this->eback(), this->pptr() - this->pbase());
> }
>      return this->sputc(traits_type::to_char_type(__c));
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    underflow()
>    {
>      int_type __ret = traits_type::eof();
>      const bool __testin = this->_M_mode & ios_base::in;
>      if (__testin)
> {
>
>   _M_update_egptr();
>
>   if (this->gptr() < this->egptr())
>     __ret = traits_type::to_int_type(*this->gptr());
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode)
>    {
>      pos_type __ret = pos_type(off_type(-1));
>      bool __testin = (ios_base::in & this->_M_mode & __mode) != 0;
>      bool __testout = (ios_base::out & this->_M_mode & __mode) != 0;
>      const bool __testboth = __testin && __testout && __way != ios_base::cur;
>      __testin &= !(__mode & ios_base::out);
>      __testout &= !(__mode & ios_base::in);
>
>
>
>      const char_type* __beg = __testin ? this->eback() : this->pbase();
>      if ((__beg || !__off) && (__testin || __testout || __testboth))
> {
>   _M_update_egptr();
>
>   off_type __newoffi = __off;
>   off_type __newoffo = __newoffi;
>   if (__way == ios_base::cur)
>     {
>       __newoffi += this->gptr() - __beg;
>       __newoffo += this->pptr() - __beg;
>     }
>   else if (__way == ios_base::end)
>     __newoffo = __newoffi += this->egptr() - __beg;
>
>   if ((__testin || __testboth)
>       && __newoffi >= 0
>       && this->egptr() - __beg >= __newoffi)
>     {
>       this->gbump((__beg + __newoffi) - this->gptr());
>       __ret = pos_type(__newoffi);
>     }
>   if ((__testout || __testboth)
>       && __newoffo >= 0
>       && this->egptr() - __beg >= __newoffo)
>     {
>       this->pbump((__beg + __newoffo) - this->pptr());
>       __ret = pos_type(__newoffo);
>     }
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    seekpos(pos_type __sp, ios_base::openmode __mode)
>    {
>      pos_type __ret = pos_type(off_type(-1));
>      const bool __testin = (ios_base::in & this->_M_mode & __mode) != 0;
>      const bool __testout = (ios_base::out & this->_M_mode & __mode) != 0;
>
>      const char_type* __beg = __testin ? this->eback() : this->pbase();
>      if ((__beg || !off_type(__sp)) && (__testin || __testout))
> {
>   _M_update_egptr();
>
>   const off_type __pos(__sp);
>   const bool __testpos = 0 <= __pos
>                          && __pos <= this->egptr() - __beg;
>   if (__testpos)
>     {
>       if (__testin)
>  this->gbump((__beg + __pos) - this->gptr());
>       if (__testout)
>                this->pbump((__beg + __pos) - this->pptr());
>       __ret = __sp;
>     }
> }
>      return __ret;
>    }
>
>  template <class _CharT, class _Traits, class _Alloc>
>    void
>    basic_stringbuf<_CharT, _Traits, _Alloc>::
>    _M_sync(char_type* __base, __size_type __i, __size_type __o)
>    {
>      const bool __testin = _M_mode & ios_base::in;
>      const bool __testout = _M_mode & ios_base::out;
>      char_type* __endg = __base + _M_string.size();
>      char_type* __endp = __base + _M_string.capacity();
>
>      if (__base != _M_string.data())
> {
>
>   __endg += __i;
>   __i = 0;
>   __endp = __endg;
> }
>
>      if (__testin)
> this->setg(__base, __base + __i, __endg);
>      if (__testout)
> {
>   this->setp(__base, __endp);
>   this->pbump(__o);
>
>
>
>   if (!__testin)
>     this->setg(__endg, __endg, __endg);
> }
>    }
>
>
>
>
>
>  extern template class basic_stringbuf<char>;
>  extern template class basic_istringstream<char>;
>  extern template class basic_ostringstream<char>;
>  extern template class basic_stringstream<char>;
>
>
>  extern template class basic_stringbuf<wchar_t>;
>  extern template class basic_istringstream<wchar_t>;
>  extern template class basic_ostringstream<wchar_t>;
>  extern template class basic_stringstream<wchar_t>;
>
>
>}
># 588 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/sstream" 2 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 2 3
>
>namespace std
>{
>
>  template<typename _Tp> class complex;
>  template<> class complex<float>;
>  template<> class complex<double>;
>  template<> class complex<long double>;
>
>
>  template<typename _Tp> _Tp abs(const complex<_Tp>&);
>
>  template<typename _Tp> _Tp arg(const complex<_Tp>&);
>
>  template<typename _Tp> _Tp norm(const complex<_Tp>&);
>
>
>  template<typename _Tp> complex<_Tp> conj(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> polar(const _Tp&, const _Tp& = 0);
>
>
>
>  template<typename _Tp> complex<_Tp> cos(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> cosh(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> exp(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> log(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> log10(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> pow(const complex<_Tp>&, int);
>
>  template<typename _Tp> complex<_Tp> pow(const complex<_Tp>&, const _Tp&);
>
>  template<typename _Tp> complex<_Tp> pow(const complex<_Tp>&,
>                                          const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> pow(const _Tp&, const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> sin(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> sinh(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> sqrt(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> tan(const complex<_Tp>&);
>
>  template<typename _Tp> complex<_Tp> tanh(const complex<_Tp>&);
># 114 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    struct complex
>    {
>
>      typedef _Tp value_type;
>
>
>
>      complex(const _Tp& = _Tp(), const _Tp & = _Tp());
>
>
>
>
>      template<typename _Up>
>        complex(const complex<_Up>&);
>
>
>      _Tp& real();
>
>      const _Tp& real() const;
>
>      _Tp& imag();
>
>      const _Tp& imag() const;
>
>
>      complex<_Tp>& operator=(const _Tp&);
>
>      complex<_Tp>& operator+=(const _Tp&);
>
>      complex<_Tp>& operator-=(const _Tp&);
>
>      complex<_Tp>& operator*=(const _Tp&);
>
>      complex<_Tp>& operator/=(const _Tp&);
>
>
>
>
>
>      template<typename _Up>
>        complex<_Tp>& operator=(const complex<_Up>&);
>
>      template<typename _Up>
>        complex<_Tp>& operator+=(const complex<_Up>&);
>
>      template<typename _Up>
>        complex<_Tp>& operator-=(const complex<_Up>&);
>
>      template<typename _Up>
>        complex<_Tp>& operator*=(const complex<_Up>&);
>
>      template<typename _Up>
>        complex<_Tp>& operator/=(const complex<_Up>&);
>
>      const complex& __rep() const;
>
>    private:
>      _Tp _M_real;
>      _Tp _M_imag;
>    };
>
>  template<typename _Tp>
>    inline _Tp&
>    complex<_Tp>::real() { return _M_real; }
>
>  template<typename _Tp>
>    inline const _Tp&
>    complex<_Tp>::real() const { return _M_real; }
>
>  template<typename _Tp>
>    inline _Tp&
>    complex<_Tp>::imag() { return _M_imag; }
>
>  template<typename _Tp>
>    inline const _Tp&
>    complex<_Tp>::imag() const { return _M_imag; }
>
>  template<typename _Tp>
>    inline
>    complex<_Tp>::complex(const _Tp& __r, const _Tp& __i)
>    : _M_real(__r), _M_imag(__i) { }
>
>  template<typename _Tp>
>    template<typename _Up>
>    inline
>    complex<_Tp>::complex(const complex<_Up>& __z)
>    : _M_real(__z.real()), _M_imag(__z.imag()) { }
>
>  template<typename _Tp>
>    complex<_Tp>&
>    complex<_Tp>::operator=(const _Tp& __t)
>    {
>     _M_real = __t;
>     _M_imag = _Tp();
>     return *this;
>    }
>
>
>  template<typename _Tp>
>    inline complex<_Tp>&
>    complex<_Tp>::operator+=(const _Tp& __t)
>    {
>      _M_real += __t;
>      return *this;
>    }
>
>
>  template<typename _Tp>
>    inline complex<_Tp>&
>    complex<_Tp>::operator-=(const _Tp& __t)
>    {
>      _M_real -= __t;
>      return *this;
>    }
>
>
>  template<typename _Tp>
>    complex<_Tp>&
>    complex<_Tp>::operator*=(const _Tp& __t)
>    {
>      _M_real *= __t;
>      _M_imag *= __t;
>      return *this;
>    }
>
>
>  template<typename _Tp>
>    complex<_Tp>&
>    complex<_Tp>::operator/=(const _Tp& __t)
>    {
>      _M_real /= __t;
>      _M_imag /= __t;
>      return *this;
>    }
>
>  template<typename _Tp>
>    template<typename _Up>
>    complex<_Tp>&
>    complex<_Tp>::operator=(const complex<_Up>& __z)
>    {
>      _M_real = __z.real();
>      _M_imag = __z.imag();
>      return *this;
>    }
>
>
>  template<typename _Tp>
>    template<typename _Up>
>    complex<_Tp>&
>    complex<_Tp>::operator+=(const complex<_Up>& __z)
>    {
>      _M_real += __z.real();
>      _M_imag += __z.imag();
>      return *this;
>    }
>
>
>  template<typename _Tp>
>    template<typename _Up>
>    complex<_Tp>&
>    complex<_Tp>::operator-=(const complex<_Up>& __z)
>    {
>      _M_real -= __z.real();
>      _M_imag -= __z.imag();
>      return *this;
>    }
>
>
>
>  template<typename _Tp>
>    template<typename _Up>
>    complex<_Tp>&
>    complex<_Tp>::operator*=(const complex<_Up>& __z)
>    {
>      const _Tp __r = _M_real * __z.real() - _M_imag * __z.imag();
>      _M_imag = _M_real * __z.imag() + _M_imag * __z.real();
>      _M_real = __r;
>      return *this;
>    }
>
>
>
>  template<typename _Tp>
>    template<typename _Up>
>    complex<_Tp>&
>    complex<_Tp>::operator/=(const complex<_Up>& __z)
>    {
>      const _Tp __r = _M_real * __z.real() + _M_imag * __z.imag();
>      const _Tp __n = std::norm(__z);
>      _M_imag = (_M_imag * __z.real() - _M_real * __z.imag()) / __n;
>      _M_real = __r / __n;
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline const complex<_Tp>&
>    complex<_Tp>::__rep() const { return *this; }
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r += __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator+(const complex<_Tp>& __x, const _Tp& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r.real() += __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator+(const _Tp& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __y;
>      __r.real() += __x;
>      return __r;
>    }
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r -= __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator-(const complex<_Tp>& __x, const _Tp& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r.real() -= __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator-(const _Tp& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r(__x, -__y.imag());
>      __r.real() -= __y.real();
>      return __r;
>    }
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator*(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r *= __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator*(const complex<_Tp>& __x, const _Tp& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r *= __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator*(const _Tp& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __y;
>      __r *= __x;
>      return __r;
>    }
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator/(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r /= __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator/(const complex<_Tp>& __x, const _Tp& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r /= __y;
>      return __r;
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator/(const _Tp& __x, const complex<_Tp>& __y)
>    {
>      complex<_Tp> __r = __x;
>      __r /= __y;
>      return __r;
>    }
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator+(const complex<_Tp>& __x)
>    { return __x; }
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    operator-(const complex<_Tp>& __x)
>    { return complex<_Tp>(-__x.real(), -__x.imag()); }
>
>
>
>  template<typename _Tp>
>    inline bool
>    operator==(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    { return __x.real() == __y.real() && __x.imag() == __y.imag(); }
>
>  template<typename _Tp>
>    inline bool
>    operator==(const complex<_Tp>& __x, const _Tp& __y)
>    { return __x.real() == __y && __x.imag() == _Tp(); }
>
>  template<typename _Tp>
>    inline bool
>    operator==(const _Tp& __x, const complex<_Tp>& __y)
>    { return __x == __y.real() && _Tp() == __y.imag(); }
>
>
>
>
>  template<typename _Tp>
>    inline bool
>    operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    { return __x.real() != __y.real() || __x.imag() != __y.imag(); }
>
>  template<typename _Tp>
>    inline bool
>    operator!=(const complex<_Tp>& __x, const _Tp& __y)
>    { return __x.real() != __y || __x.imag() != _Tp(); }
>
>  template<typename _Tp>
>    inline bool
>    operator!=(const _Tp& __x, const complex<_Tp>& __y)
>    { return __x != __y.real() || _Tp() != __y.imag(); }
>
>
>
>  template<typename _Tp, typename _CharT, class _Traits>
>    basic_istream<_CharT, _Traits>&
>    operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
>    {
>      _Tp __re_x, __im_x;
>      _CharT __ch;
>      __is >> __ch;
>      if (__ch == '(')
> {
>   __is >> __re_x >> __ch;
>   if (__ch == ',')
>     {
>       __is >> __im_x >> __ch;
>       if (__ch == ')')
>  __x = complex<_Tp>(__re_x, __im_x);
>       else
>  __is.setstate(ios_base::failbit);
>     }
>   else if (__ch == ')')
>     __x = __re_x;
>   else
>     __is.setstate(ios_base::failbit);
> }
>      else
> {
>   __is.putback(__ch);
>   __is >> __re_x;
>   __x = __re_x;
> }
>      return __is;
>    }
>
>
>  template<typename _Tp, typename _CharT, class _Traits>
>    basic_ostream<_CharT, _Traits>&
>    operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x)
>    {
>      basic_ostringstream<_CharT, _Traits> __s;
>      __s.flags(__os.flags());
>      __s.imbue(__os.getloc());
>      __s.precision(__os.precision());
>      __s << '(' << __x.real() << ',' << __x.imag() << ')';
>      return __os << __s.str();
>    }
>
>
>  template<typename _Tp>
>    inline _Tp&
>    real(complex<_Tp>& __z)
>    { return __z.real(); }
>
>  template<typename _Tp>
>    inline const _Tp&
>    real(const complex<_Tp>& __z)
>    { return __z.real(); }
>
>  template<typename _Tp>
>    inline _Tp&
>    imag(complex<_Tp>& __z)
>    { return __z.imag(); }
>
>  template<typename _Tp>
>    inline const _Tp&
>    imag(const complex<_Tp>& __z)
>    { return __z.imag(); }
>
>
>  template<typename _Tp>
>    inline _Tp
>    __complex_abs(const complex<_Tp>& __z)
>    {
>      _Tp __x = __z.real();
>      _Tp __y = __z.imag();
>      const _Tp __s = std::max(abs(__x), abs(__y));
>      if (__s == _Tp())
>        return __s;
>      __x /= __s;
>      __y /= __s;
>      return __s * sqrt(__x * __x + __y * __y);
>    }
>
>
>  inline float
>  __complex_abs(__complex__ float __z) { return __builtin_cabsf(__z); }
>
>  inline double
>  __complex_abs(__complex__ double __z) { return __builtin_cabs(__z); }
>
>  inline long double
>  __complex_abs(const __complex__ long double& __z)
>  { return __builtin_cabsl(__z); }
>
>  template<typename _Tp>
>    inline _Tp
>    abs(const complex<_Tp>& __z) { return __complex_abs(__z.__rep()); }
># 586 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    inline _Tp
>    __complex_arg(const complex<_Tp>& __z)
>    { return atan2(__z.imag(), __z.real()); }
>
>
>  inline float
>  __complex_arg(__complex__ float __z) { return __builtin_cargf(__z); }
>
>  inline double
>  __complex_arg(__complex__ double __z) { return __builtin_carg(__z); }
>
>  inline long double
>  __complex_arg(const __complex__ long double& __z)
>  { return __builtin_cargl(__z); }
>
>  template<typename _Tp>
>    inline _Tp
>    arg(const complex<_Tp>& __z) { return __complex_arg(__z.__rep()); }
># 616 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<bool>
>    struct _Norm_helper
>    {
>      template<typename _Tp>
>        static inline _Tp _S_do_it(const complex<_Tp>& __z)
>        {
>          const _Tp __x = __z.real();
>          const _Tp __y = __z.imag();
>          return __x * __x + __y * __y;
>        }
>    };
>
>  template<>
>    struct _Norm_helper<true>
>    {
>      template<typename _Tp>
>        static inline _Tp _S_do_it(const complex<_Tp>& __z)
>        {
>          _Tp __res = std::abs(__z);
>          return __res * __res;
>        }
>    };
>
>  template<typename _Tp>
>    inline _Tp
>    norm(const complex<_Tp>& __z)
>    {
>      return _Norm_helper<__is_floating<_Tp>::__value
> && !0>::_S_do_it(__z);
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    polar(const _Tp& __rho, const _Tp& __theta)
>    { return complex<_Tp>(__rho * cos(__theta), __rho * sin(__theta)); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    conj(const complex<_Tp>& __z)
>    { return complex<_Tp>(__z.real(), -__z.imag()); }
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_cos(const complex<_Tp>& __z)
>    {
>      const _Tp __x = __z.real();
>      const _Tp __y = __z.imag();
>      return complex<_Tp>(cos(__x) * cosh(__y), -sin(__x) * sinh(__y));
>    }
>
>
>  inline __complex__ float
>  __complex_cos(__complex__ float __z) { return __builtin_ccosf(__z); }
>
>  inline __complex__ double
>  __complex_cos(__complex__ double __z) { return __builtin_ccos(__z); }
>
>  inline __complex__ long double
>  __complex_cos(const __complex__ long double& __z)
>  { return __builtin_ccosl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    cos(const complex<_Tp>& __z) { return __complex_cos(__z.__rep()); }
>
>
>
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_cosh(const complex<_Tp>& __z)
>    {
>      const _Tp __x = __z.real();
>      const _Tp __y = __z.imag();
>      return complex<_Tp>(cosh(__x) * cos(__y), sinh(__x) * sin(__y));
>    }
>
>
>  inline __complex__ float
>  __complex_cosh(__complex__ float __z) { return __builtin_ccoshf(__z); }
>
>  inline __complex__ double
>  __complex_cosh(__complex__ double __z) { return __builtin_ccosh(__z); }
>
>  inline __complex__ long double
>  __complex_cosh(const __complex__ long double& __z)
>  { return __builtin_ccoshl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    cosh(const complex<_Tp>& __z) { return __complex_cosh(__z.__rep()); }
>
>
>
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_exp(const complex<_Tp>& __z)
>    { return std::polar(exp(__z.real()), __z.imag()); }
>
>
>  inline __complex__ float
>  __complex_exp(__complex__ float __z) { return __builtin_cexpf(__z); }
>
>  inline __complex__ double
>  __complex_exp(__complex__ double __z) { return __builtin_cexp(__z); }
>
>  inline __complex__ long double
>  __complex_exp(const __complex__ long double& __z)
>  { return __builtin_cexpl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    exp(const complex<_Tp>& __z) { return __complex_exp(__z.__rep()); }
># 747 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_log(const complex<_Tp>& __z)
>    { return complex<_Tp>(log(std::abs(__z)), std::arg(__z)); }
>
>
>  inline __complex__ float
>  __complex_log(__complex__ float __z) { return __builtin_clogf(__z); }
>
>  inline __complex__ double
>  __complex_log(__complex__ double __z) { return __builtin_clog(__z); }
>
>  inline __complex__ long double
>  __complex_log(const __complex__ long double& __z)
>  { return __builtin_clogl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    log(const complex<_Tp>& __z) { return __complex_log(__z.__rep()); }
>
>
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    log10(const complex<_Tp>& __z)
>    { return std::log(__z) / log(_Tp(10.0)); }
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_sin(const complex<_Tp>& __z)
>    {
>      const _Tp __x = __z.real();
>      const _Tp __y = __z.imag();
>      return complex<_Tp>(sin(__x) * cosh(__y), cos(__x) * sinh(__y));
>    }
>
>
>  inline __complex__ float
>  __complex_sin(__complex__ float __z) { return __builtin_csinf(__z); }
>
>  inline __complex__ double
>  __complex_sin(__complex__ double __z) { return __builtin_csin(__z); }
>
>  inline __complex__ long double
>  __complex_sin(const __complex__ long double& __z)
>  { return __builtin_csinl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    sin(const complex<_Tp>& __z) { return __complex_sin(__z.__rep()); }
>
>
>
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_sinh(const complex<_Tp>& __z)
>    {
>      const _Tp __x = __z.real();
>      const _Tp __y = __z.imag();
>      return complex<_Tp>(sinh(__x) * cos(__y), cosh(__x) * sin(__y));
>    }
>
>
>  inline __complex__ float
>  __complex_sinh(__complex__ float __z) { return __builtin_csinhf(__z); }
>
>  inline __complex__ double
>  __complex_sinh(__complex__ double __z) { return __builtin_csinh(__z); }
>
>  inline __complex__ long double
>  __complex_sinh(const __complex__ long double& __z)
>  { return __builtin_csinhl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    sinh(const complex<_Tp>& __z) { return __complex_sinh(__z.__rep()); }
># 839 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    complex<_Tp>
>    __complex_sqrt(const complex<_Tp>& __z)
>    {
>      _Tp __x = __z.real();
>      _Tp __y = __z.imag();
>
>      if (__x == _Tp())
>        {
>          _Tp __t = sqrt(abs(__y) / 2);
>          return complex<_Tp>(__t, __y < _Tp() ? -__t : __t);
>        }
>      else
>        {
>          _Tp __t = sqrt(2 * (std::abs(__z) + abs(__x)));
>          _Tp __u = __t / 2;
>          return __x > _Tp()
>            ? complex<_Tp>(__u, __y / __t)
>            : complex<_Tp>(abs(__y) / __t, __y < _Tp() ? -__u : __u);
>        }
>    }
>
>
>  inline __complex__ float
>  __complex_sqrt(__complex__ float __z) { return __builtin_csqrtf(__z); }
>
>  inline __complex__ double
>  __complex_sqrt(__complex__ double __z) { return __builtin_csqrt(__z); }
>
>  inline __complex__ long double
>  __complex_sqrt(const __complex__ long double& __z)
>  { return __builtin_csqrtl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z.__rep()); }
># 883 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_tan(const complex<_Tp>& __z)
>    { return std::sin(__z) / std::cos(__z); }
>
>
>  inline __complex__ float
>  __complex_tan(__complex__ float __z) { return __builtin_ctanf(__z); }
>
>  inline __complex__ double
>  __complex_tan(__complex__ double __z) { return __builtin_ctan(__z); }
>
>  inline __complex__ long double
>  __complex_tan(const __complex__ long double& __z)
>  { return __builtin_ctanl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    tan(const complex<_Tp>& __z) { return __complex_tan(__z.__rep()); }
># 911 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_tanh(const complex<_Tp>& __z)
>    { return std::sinh(__z) / std::cosh(__z); }
>
>
>  inline __complex__ float
>  __complex_tanh(__complex__ float __z) { return __builtin_ctanhf(__z); }
>
>  inline __complex__ double
>  __complex_tanh(__complex__ double __z) { return __builtin_ctanh(__z); }
>
>  inline __complex__ long double
>  __complex_tanh(const __complex__ long double& __z)
>  { return __builtin_ctanhl(__z); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    tanh(const complex<_Tp>& __z) { return __complex_tanh(__z.__rep()); }
># 940 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/complex" 3
>  template<typename _Tp>
>    inline complex<_Tp>
>    pow(const complex<_Tp>& __z, int __n)
>    { return std::__pow_helper(__z, __n); }
>
>  template<typename _Tp>
>    complex<_Tp>
>    pow(const complex<_Tp>& __x, const _Tp& __y)
>    {
>
>
>
>
>      if (__x.imag() == _Tp() && __x.real() > _Tp())
>        return pow(__x.real(), __y);
>
>      complex<_Tp> __t = std::log(__x);
>      return std::polar(exp(__y * __t.real()), __y * __t.imag());
>    }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    { return __x == _Tp() ? _Tp() : std::exp(__y * std::log(__x)); }
>
>
>  inline __complex__ float
>  __complex_pow(__complex__ float __x, __complex__ float __y)
>  { return __builtin_cpowf(__x, __y); }
>
>  inline __complex__ double
>  __complex_pow(__complex__ double __x, __complex__ double __y)
>  { return __builtin_cpow(__x, __y); }
>
>  inline __complex__ long double
>  __complex_pow(const __complex__ long double& __x,
>  const __complex__ long double& __y)
>  { return __builtin_cpowl(__x, __y); }
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    pow(const complex<_Tp>& __x, const complex<_Tp>& __y)
>    { return __complex_pow(__x.__rep(), __y.__rep()); }
>
>
>
>
>
>
>
>  template<typename _Tp>
>    inline complex<_Tp>
>    pow(const _Tp& __x, const complex<_Tp>& __y)
>    {
>      return __x > _Tp() ? std::polar(pow(__x, __y.real()),
>          __y.imag() * log(__x))
>                  : std::pow(complex<_Tp>(__x, _Tp()), __y);
>    }
>
>
>
>  template<>
>    struct complex<float>
>    {
>      typedef float value_type;
>      typedef __complex__ float _ComplexT;
>
>      complex(_ComplexT __z) : _M_value(__z) { }
>
>      complex(float = 0.0f, float = 0.0f);
>
>      explicit complex(const complex<double>&);
>      explicit complex(const complex<long double>&);
>
>      float& real();
>      const float& real() const;
>      float& imag();
>      const float& imag() const;
>
>      complex<float>& operator=(float);
>      complex<float>& operator+=(float);
>      complex<float>& operator-=(float);
>      complex<float>& operator*=(float);
>      complex<float>& operator/=(float);
>
>
>
>
>      template<typename _Tp>
>        complex<float>&operator=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<float>& operator+=(const complex<_Tp>&);
>      template<class _Tp>
>        complex<float>& operator-=(const complex<_Tp>&);
>      template<class _Tp>
>        complex<float>& operator*=(const complex<_Tp>&);
>      template<class _Tp>
>        complex<float>&operator/=(const complex<_Tp>&);
>
>      const _ComplexT& __rep() const { return _M_value; }
>
>    private:
>      _ComplexT _M_value;
>    };
>
>  inline float&
>  complex<float>::real()
>  { return __real__ _M_value; }
>
>  inline const float&
>  complex<float>::real() const
>  { return __real__ _M_value; }
>
>  inline float&
>  complex<float>::imag()
>  { return __imag__ _M_value; }
>
>  inline const float&
>  complex<float>::imag() const
>  { return __imag__ _M_value; }
>
>  inline
>  complex<float>::complex(float r, float i)
>  {
>    __real__ _M_value = r;
>    __imag__ _M_value = i;
>  }
>
>  inline complex<float>&
>  complex<float>::operator=(float __f)
>  {
>    __real__ _M_value = __f;
>    __imag__ _M_value = 0.0f;
>    return *this;
>  }
>
>  inline complex<float>&
>  complex<float>::operator+=(float __f)
>  {
>    __real__ _M_value += __f;
>    return *this;
>  }
>
>  inline complex<float>&
>  complex<float>::operator-=(float __f)
>  {
>    __real__ _M_value -= __f;
>    return *this;
>  }
>
>  inline complex<float>&
>  complex<float>::operator*=(float __f)
>  {
>    _M_value *= __f;
>    return *this;
>  }
>
>  inline complex<float>&
>  complex<float>::operator/=(float __f)
>  {
>    _M_value /= __f;
>    return *this;
>  }
>
>  template<typename _Tp>
>  inline complex<float>&
>  complex<float>::operator=(const complex<_Tp>& __z)
>  {
>    __real__ _M_value = __z.real();
>    __imag__ _M_value = __z.imag();
>    return *this;
>  }
>
>  template<typename _Tp>
>  inline complex<float>&
>  complex<float>::operator+=(const complex<_Tp>& __z)
>  {
>    __real__ _M_value += __z.real();
>    __imag__ _M_value += __z.imag();
>    return *this;
>  }
>
>  template<typename _Tp>
>    inline complex<float>&
>    complex<float>::operator-=(const complex<_Tp>& __z)
>    {
>     __real__ _M_value -= __z.real();
>     __imag__ _M_value -= __z.imag();
>     return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<float>&
>    complex<float>::operator*=(const complex<_Tp>& __z)
>    {
>      _ComplexT __t;
>      __real__ __t = __z.real();
>      __imag__ __t = __z.imag();
>      _M_value *= __t;
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<float>&
>    complex<float>::operator/=(const complex<_Tp>& __z)
>    {
>      _ComplexT __t;
>      __real__ __t = __z.real();
>      __imag__ __t = __z.imag();
>      _M_value /= __t;
>      return *this;
>    }
>
>
>
>  template<>
>    struct complex<double>
>    {
>      typedef double value_type;
>      typedef __complex__ double _ComplexT;
>
>      complex(_ComplexT __z) : _M_value(__z) { }
>
>      complex(double = 0.0, double = 0.0);
>
>      complex(const complex<float>&);
>      explicit complex(const complex<long double>&);
>
>      double& real();
>      const double& real() const;
>      double& imag();
>      const double& imag() const;
>
>      complex<double>& operator=(double);
>      complex<double>& operator+=(double);
>      complex<double>& operator-=(double);
>      complex<double>& operator*=(double);
>      complex<double>& operator/=(double);
>
>
>
>      template<typename _Tp>
>        complex<double>& operator=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<double>& operator+=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<double>& operator-=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<double>& operator*=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<double>& operator/=(const complex<_Tp>&);
>
>      const _ComplexT& __rep() const { return _M_value; }
>
>    private:
>      _ComplexT _M_value;
>    };
>
>  inline double&
>  complex<double>::real()
>  { return __real__ _M_value; }
>
>  inline const double&
>  complex<double>::real() const
>  { return __real__ _M_value; }
>
>  inline double&
>  complex<double>::imag()
>  { return __imag__ _M_value; }
>
>  inline const double&
>  complex<double>::imag() const
>  { return __imag__ _M_value; }
>
>  inline
>  complex<double>::complex(double __r, double __i)
>  {
>    __real__ _M_value = __r;
>    __imag__ _M_value = __i;
>  }
>
>  inline complex<double>&
>  complex<double>::operator=(double __d)
>  {
>    __real__ _M_value = __d;
>    __imag__ _M_value = 0.0;
>    return *this;
>  }
>
>  inline complex<double>&
>  complex<double>::operator+=(double __d)
>  {
>    __real__ _M_value += __d;
>    return *this;
>  }
>
>  inline complex<double>&
>  complex<double>::operator-=(double __d)
>  {
>    __real__ _M_value -= __d;
>    return *this;
>  }
>
>  inline complex<double>&
>  complex<double>::operator*=(double __d)
>  {
>    _M_value *= __d;
>    return *this;
>  }
>
>  inline complex<double>&
>  complex<double>::operator/=(double __d)
>  {
>    _M_value /= __d;
>    return *this;
>  }
>
>  template<typename _Tp>
>    inline complex<double>&
>    complex<double>::operator=(const complex<_Tp>& __z)
>    {
>      __real__ _M_value = __z.real();
>      __imag__ _M_value = __z.imag();
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<double>&
>    complex<double>::operator+=(const complex<_Tp>& __z)
>    {
>      __real__ _M_value += __z.real();
>      __imag__ _M_value += __z.imag();
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<double>&
>    complex<double>::operator-=(const complex<_Tp>& __z)
>    {
>      __real__ _M_value -= __z.real();
>      __imag__ _M_value -= __z.imag();
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<double>&
>    complex<double>::operator*=(const complex<_Tp>& __z)
>    {
>      _ComplexT __t;
>      __real__ __t = __z.real();
>      __imag__ __t = __z.imag();
>      _M_value *= __t;
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<double>&
>    complex<double>::operator/=(const complex<_Tp>& __z)
>    {
>      _ComplexT __t;
>      __real__ __t = __z.real();
>      __imag__ __t = __z.imag();
>      _M_value /= __t;
>      return *this;
>    }
>
>
>
>  template<>
>    struct complex<long double>
>    {
>      typedef long double value_type;
>      typedef __complex__ long double _ComplexT;
>
>      complex(_ComplexT __z) : _M_value(__z) { }
>
>      complex(long double = 0.0L, long double = 0.0L);
>
>      complex(const complex<float>&);
>      complex(const complex<double>&);
>
>      long double& real();
>      const long double& real() const;
>      long double& imag();
>      const long double& imag() const;
>
>      complex<long double>& operator= (long double);
>      complex<long double>& operator+= (long double);
>      complex<long double>& operator-= (long double);
>      complex<long double>& operator*= (long double);
>      complex<long double>& operator/= (long double);
>
>
>
>      template<typename _Tp>
>        complex<long double>& operator=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<long double>& operator+=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<long double>& operator-=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<long double>& operator*=(const complex<_Tp>&);
>      template<typename _Tp>
>        complex<long double>& operator/=(const complex<_Tp>&);
>
>      const _ComplexT& __rep() const { return _M_value; }
>
>    private:
>      _ComplexT _M_value;
>    };
>
>  inline
>  complex<long double>::complex(long double __r, long double __i)
>  {
>    __real__ _M_value = __r;
>    __imag__ _M_value = __i;
>  }
>
>  inline long double&
>  complex<long double>::real()
>  { return __real__ _M_value; }
>
>  inline const long double&
>  complex<long double>::real() const
>  { return __real__ _M_value; }
>
>  inline long double&
>  complex<long double>::imag()
>  { return __imag__ _M_value; }
>
>  inline const long double&
>  complex<long double>::imag() const
>  { return __imag__ _M_value; }
>
>  inline complex<long double>&
>  complex<long double>::operator=(long double __r)
>  {
>    __real__ _M_value = __r;
>    __imag__ _M_value = 0.0L;
>    return *this;
>  }
>
>  inline complex<long double>&
>  complex<long double>::operator+=(long double __r)
>  {
>    __real__ _M_value += __r;
>    return *this;
>  }
>
>  inline complex<long double>&
>  complex<long double>::operator-=(long double __r)
>  {
>    __real__ _M_value -= __r;
>    return *this;
>  }
>
>  inline complex<long double>&
>  complex<long double>::operator*=(long double __r)
>  {
>    _M_value *= __r;
>    return *this;
>  }
>
>  inline complex<long double>&
>  complex<long double>::operator/=(long double __r)
>  {
>    _M_value /= __r;
>    return *this;
>  }
>
>  template<typename _Tp>
>    inline complex<long double>&
>    complex<long double>::operator=(const complex<_Tp>& __z)
>    {
>      __real__ _M_value = __z.real();
>      __imag__ _M_value = __z.imag();
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<long double>&
>    complex<long double>::operator+=(const complex<_Tp>& __z)
>    {
>      __real__ _M_value += __z.real();
>      __imag__ _M_value += __z.imag();
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<long double>&
>    complex<long double>::operator-=(const complex<_Tp>& __z)
>    {
>      __real__ _M_value -= __z.real();
>      __imag__ _M_value -= __z.imag();
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<long double>&
>    complex<long double>::operator*=(const complex<_Tp>& __z)
>    {
>      _ComplexT __t;
>      __real__ __t = __z.real();
>      __imag__ __t = __z.imag();
>      _M_value *= __t;
>      return *this;
>    }
>
>  template<typename _Tp>
>    inline complex<long double>&
>    complex<long double>::operator/=(const complex<_Tp>& __z)
>    {
>      _ComplexT __t;
>      __real__ __t = __z.real();
>      __imag__ __t = __z.imag();
>      _M_value /= __t;
>      return *this;
>    }
>
>
>
>
>
>  inline
>  complex<float>::complex(const complex<double>& __z)
>  : _M_value(__z.__rep()) { }
>
>  inline
>  complex<float>::complex(const complex<long double>& __z)
>  : _M_value(__z.__rep()) { }
>
>  inline
>  complex<double>::complex(const complex<float>& __z)
>  : _M_value(__z.__rep()) { }
>
>  inline
>  complex<double>::complex(const complex<long double>& __z)
>    : _M_value(__z.__rep()) { }
>
>  inline
>  complex<long double>::complex(const complex<float>& __z)
>  : _M_value(__z.__rep()) { }
>
>  inline
>  complex<long double>::complex(const complex<double>& __z)
>  : _M_value(__z.__rep()) { }
>}
># 70 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
>
>
>
>
>namespace blitz {
>
>
> using namespace std;
># 88 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h"
>}
># 125 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzdebug.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzdebug.h"
># 1 "/usr/include/assert.h" 1 3 4
># 65 "/usr/include/assert.h" 3 4
>extern "C" {
>
>
>extern void __assert_fail (__const char *__assertion, __const char *__file,
>      unsigned int __line, __const char *__function)
>     throw () __attribute__ ((__noreturn__));
>
>
>extern void __assert_perror_fail (int __errnum, __const char *__file,
>      unsigned int __line,
>      __const char *__function)
>     throw () __attribute__ ((__noreturn__));
>
>
>
>
>extern void __assert (const char *__assertion, const char *__file, int __line)
>     throw () __attribute__ ((__noreturn__));
>
>
>}
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzdebug.h" 2
>
>
>
>
>
>namespace blitz {
>
>
>
>
>
>
>
>extern bool assertFailMode ;
>extern int assertFailCount ;
>extern int assertSuccessCount ;
># 225 "/mn/anatu/cma-u3/tmac/usr/include/blitz/bzdebug.h"
>}
># 126 "/mn/anatu/cma-u3/tmac/usr/include/blitz/blitz.h" 2
># 42 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.h"
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/include/stddef.h" 1 3 4
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.h" 2
>
>
>
>
>
>namespace blitz {
>
>enum preexistingMemoryPolicy {
>  duplicateData,
>  deleteDataWhenDone,
>  neverDeleteData
>};
>
>
>template<typename T_type> class MemoryBlockReference;
>
>
>
>
>
>template<typename P_type>
>class MemoryBlock {
>
>    friend class MemoryBlockReference<P_type>;
>
>public:
>    typedef P_type T_type;
>
>protected:
>    MemoryBlock()
>    {
>        length_ = 0;
>        data_ = 0;
>        dataBlockAddress_ = 0;
>        references_ = 0;
>
>        pthread_mutex_init(&mutex,__null);
>    }
>
>    explicit MemoryBlock(size_t items)
>    {
>        length_ = items;
>        allocate(length_);
>
>
>
>
>
>
>        ;
>
>        references_ = 0;
>
>        pthread_mutex_init(&mutex,__null);
>    }
>
>    MemoryBlock(size_t length, T_type* data)
>    {
>        length_ = length;
>        data_ = data;
>        dataBlockAddress_ = data;
>        references_ = 0;
>        pthread_mutex_init(&mutex,__null);
>    }
>
>    virtual ~MemoryBlock()
>    {
>        if (dataBlockAddress_)
>        {
>
>
>
>
>
>
>            deallocate();
>        }
>
>        pthread_mutex_destroy(&mutex);
>    }
>
>    void addReference()
>    {
>        pthread_mutex_lock(&mutex);
>        ++references_;
>
>
>
>
>
>
>        pthread_mutex_unlock(&mutex);
>
>    }
>
>    T_type* __restrict__ data()
>    {
>        return data_;
>    }
>
>    const T_type* __restrict__ data() const
>    {
>        return data_;
>    }
>
>    T_type*& dataBlockAddress()
>    {
>        return dataBlockAddress_;
>    }
>
>    size_t length() const
>    {
>        return length_;
>    }
>
>    int removeReference()
>    {
>
>        pthread_mutex_lock(&mutex);
>        int refcount = --references_;
>
>
>
>
>
>
>        pthread_mutex_unlock(&mutex);
>        return refcount;
>    }
>
>    int references() const
>    {
>        pthread_mutex_lock(&mutex);
>        int refcount = references_;
>        pthread_mutex_unlock(&mutex);
>
>        return refcount;
>    }
>
>protected:
>    inline void allocate(size_t length);
>    void deallocate();
>
>private:
>    MemoryBlock(const MemoryBlock<T_type>&)
>    { }
>
>    void operator=(const MemoryBlock<T_type>&)
>    { }
>
>private:
>    T_type * __restrict__ data_;
>    T_type * dataBlockAddress_;
>
>
>
>
>    volatile int references_;
>
>
>    mutable pthread_mutex_t mutex;
>    size_t length_;
>};
>
>template<typename P_type>
>class UnownedMemoryBlock : public MemoryBlock<P_type> {
>public:
>    UnownedMemoryBlock(size_t length, P_type* data)
>        : MemoryBlock<P_type>(length,data)
>    {
>
>
>        MemoryBlock<P_type>::dataBlockAddress() = 0;
>    }
>
>    virtual ~UnownedMemoryBlock()
>    {
>    }
>};
>
>template<typename P_type>
>class NullMemoryBlock : public MemoryBlock<P_type> {
>public:
>    NullMemoryBlock()
>    {
>
>
>        MemoryBlock<P_type>::addReference();
>    }
>
>    virtual ~NullMemoryBlock()
>    { }
>};
>
>template<typename P_type>
>class MemoryBlockReference {
>
>public:
>    typedef P_type T_type;
>
>protected:
>    T_type * __restrict__ data_;
>
>private:
>    MemoryBlock<T_type>* block_;
>    static NullMemoryBlock<T_type> nullBlock_;
>
>public:
>
>    MemoryBlockReference()
>    {
>        block_ = &nullBlock_;
>        block_->addReference();
>        data_ = 0;
>    }
>
>    MemoryBlockReference(MemoryBlockReference<T_type>& ref, size_t offset=0)
>    {
>        block_ = ref.block_;
>        block_->addReference();
>        data_ = ref.data_ + offset;
>    }
>
>    MemoryBlockReference(size_t length, T_type* data,
>        preexistingMemoryPolicy deletionPolicy)
>    {
>
>
>
>
>
>
>
>        if ((deletionPolicy == neverDeleteData)
>          || (deletionPolicy == duplicateData))
>            block_ = new UnownedMemoryBlock<T_type>(length, data);
>        else if (deletionPolicy == deleteDataWhenDone)
>            block_ = new MemoryBlock<T_type>(length, data);
>        block_->addReference();
>
>
>
>
>
>
>        data_ = data;
>    }
>
>    explicit MemoryBlockReference(size_t items)
>    {
>        block_ = new MemoryBlock<T_type>(items);
>        block_->addReference();
>        data_ = block_->data();
>
>
>
>
>
>
>    }
>
>    void blockRemoveReference()
>    {
>        int refcount = block_->removeReference();
>        if ((refcount == 0) && (block_ != &nullBlock_))
>        {
>
>
>
>
>
>            delete block_;
>        }
>    }
>
>   ~MemoryBlockReference()
>    {
>        blockRemoveReference();
>    }
>
>    int numReferences() const
>    {
>        return block_->references();
>    }
>
>
>protected:
>
>    void changeToNullBlock()
>    {
>        blockRemoveReference();
>        block_ = &nullBlock_;
>        block_->addReference();
>        data_ = 0;
>    }
>
>    void changeBlock(MemoryBlockReference<T_type>& ref, size_t offset=0)
>    {
>        blockRemoveReference();
>        block_ = ref.block_;
>        block_->addReference();
>        data_ = ref.data_ + offset;
>    }
>
>    void newBlock(size_t items)
>    {
>        blockRemoveReference();
>        block_ = new MemoryBlock<T_type>(items);
>        block_->addReference();
>        data_ = block_->data();
>
>
>
>
>
>    }
>
>private:
>    void operator=(const MemoryBlockReference<T_type>&)
>    { }
>};
>
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.cc" 1
># 11 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.cc"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numtrait.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numtrait.h"
>namespace blitz {
># 48 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numtrait.h"
>template<typename P_numtype>
>class NumericTypeTraits {
>public:
>    typedef P_numtype T_sumtype;
>    typedef P_numtype T_difftype;
>    typedef P_numtype T_floattype;
>
>    typedef P_numtype T_signedtype;
>    enum { hasTrivialCtor = 0 };
>};
># 71 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numtrait.h"
>    template<> class NumericTypeTraits<bool> { public: typedef unsigned T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef int T_signedtype; enum { hasTrivialCtor = 1 }; };
>
>
>template<> class NumericTypeTraits<char> { public: typedef int T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef char T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<unsigned char> { public: typedef unsigned T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef int T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<short int> { public: typedef int T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef short int T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<short unsigned int> { public: typedef unsigned int T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef int T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<int> { public: typedef long T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef int T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<unsigned int> { public: typedef unsigned long T_sumtype; typedef int T_difftype; typedef float T_floattype; typedef long T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<long> { public: typedef long T_sumtype; typedef long T_difftype; typedef double T_floattype; typedef long T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<unsigned long> { public: typedef unsigned long T_sumtype; typedef long T_difftype; typedef double T_floattype; typedef long T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<float> { public: typedef double T_sumtype; typedef float T_difftype; typedef float T_floattype; typedef float T_signedtype; enum { hasTrivialCtor = 1 }; };
>template<> class NumericTypeTraits<double> { public: typedef double T_sumtype; typedef double T_difftype; typedef double T_floattype; typedef double T_signedtype; enum { hasTrivialCtor = 1 }; };
># 92 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numtrait.h"
>}
># 12 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.cc" 2
>
>namespace blitz {
>
>
>template<typename P_type>
>NullMemoryBlock<P_type> MemoryBlockReference<P_type>::nullBlock_;
>
>template<typename P_type>
>void MemoryBlock<P_type>::deallocate()
>{
>
>    delete [] dataBlockAddress_;
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.cc"
>}
>
>template<typename P_type>
>inline void MemoryBlock<P_type>::allocate(size_t length)
>{
>    ;
>
>    ;
>
>
>    dataBlockAddress_ = new T_type[length];
>    data_ = dataBlockAddress_;
># 84 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.cc"
>}
>
>
>}
># 359 "/mn/anatu/cma-u3/tmac/usr/include/blitz/memblock.h" 2
># 43 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/range.h" 1
># 35 "/mn/anatu/cma-u3/tmac/usr/include/blitz/range.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecexprwrap.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecexprwrap.h"
>namespace blitz {
>
>template<typename P_expr>
>class _bz_VecExpr {
>
>public:
>    typedef P_expr T_expr;
>    typedef typename T_expr::T_numtype T_numtype;
>
>
>    _bz_VecExpr(T_expr a)
>        : iter_(a)
>    { }
>
>
>
>
>
>
>
>    _bz_VecExpr(const _bz_VecExpr<T_expr>& a)
>        : iter_(a.iter_)
>    { }
>
>
>    T_numtype operator[](int i) const
>    { return iter_[i]; }
>
>    T_numtype operator()(int i) const
>    { return iter_(i); }
>
>    int length(int recommendedLength) const
>    { return iter_.length(recommendedLength); }
>
>    static const int
>        _bz_staticLengthCount = P_expr::_bz_staticLengthCount,
>        _bz_dynamicLengthCount = P_expr::_bz_dynamicLengthCount,
>        _bz_staticLength = P_expr::_bz_staticLength;
>
>    int _bz_suggestLength() const
>    { return iter_._bz_suggestLength(); }
>
>    bool _bz_hasFastAccess() const
>    { return iter_._bz_hasFastAccess(); }
>
>    T_numtype _bz_fastAccess(int i) const
>    { return iter_._bz_fastAccess(i); }
>
>private:
>    _bz_VecExpr();
>
>    T_expr iter_;
>};
>
>}
># 36 "/mn/anatu/cma-u3/tmac/usr/include/blitz/range.h" 2
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/wrap-climits.h" 1
># 39 "/mn/anatu/cma-u3/tmac/usr/include/blitz/range.h" 2
>
>namespace blitz {
># 50 "/mn/anatu/cma-u3/tmac/usr/include/blitz/range.h"
>enum { fromStart = (-2147483647 - 1), toEnd = (-2147483647 - 1) };
>
>
>class Range {
>
>public:
>
>
>
>
>    typedef int T_numtype;
>
>    enum { fromStart = (-2147483647 - 1), toEnd = (-2147483647 - 1) };
>
>    Range()
>    {
>        first_ = fromStart;
>        last_ = toEnd;
>        stride_ = 1;
>    }
>
>
>
>    Range(const Range& r)
>    {
>        first_ = r.first_;
>        last_ = r.last_;
>        stride_ = r.stride_;
>    }
>
>
>    explicit Range(int slicePosition)
>    {
>        first_ = slicePosition;
>        last_ = slicePosition;
>        stride_ = 1;
>    }
>
>    Range(int first, int last, int stride=1)
>        : first_(first), last_(last), stride_(stride)
>    {
>        ;
>
>
>
>        ;
>
>    }
>
>    int first(int lowRange = 0) const
>    {
>        if (first_ == fromStart)
>            return lowRange;
>        return first_;
>    }
>
>    int last(int highRange = 0) const
>    {
>        if (last_ == toEnd)
>            return highRange;
>        return last_;
>    }
>
>    unsigned length(int =0) const
>    {
>        ;
>        ;
>        ;
>        return (last_ - first_) / stride_ + 1;
>    }
>
>    int stride() const
>    { return stride_; }
>
>    bool isAscendingContiguous() const
>    {
>        return ((first_ < last_) && (stride_ == 1) || (first_ == last_));
>    }
>
>    void setRange(int first, int last, int stride=1)
>    {
>        ;
>
>
>        ;
>        first_ = first;
>        last_ = last;
>        stride_ = stride;
>    }
>
>    static Range all()
>    { return Range(fromStart,toEnd,1); }
>
>    bool isUnitStride() const
>    { return stride_ == 1; }
>
>
>    Range operator-(int shift) const
>    {
>        ;
>        ;
>        return Range(first_ - shift, last_ - shift, stride_);
>    }
>
>    Range operator+(int shift) const
>    {
>        ;
>        ;
>        return Range(first_ + shift, last_ + shift, stride_);
>    }
>
>    int operator[](unsigned i) const
>    {
>        return first_ + i * stride_;
>    }
>
>    int operator()(unsigned i) const
>    {
>        return first_ + i * stride_;
>    }
>
>    friend inline ostream& operator<<(ostream& os, const Range& range)
>    {
>        os << "Range(" << range.first() << "," << range.last() << ","
>           << range.stride() << ")";
>
>        return os;
>    }
>
>
>
>
>
>
>
>    static const int
>        _bz_staticLengthCount = 0,
>        _bz_dynamicLengthCount = 0,
>        _bz_staticLength = 0;
>
>    bool _bz_hasFastAccess() const
>    { return stride_ == 1; }
>
>    T_numtype _bz_fastAccess(unsigned i) const
>    { return first_ + i; }
>
>    unsigned _bz_suggestLength() const
>    {
>        return length();
>    }
>
>    _bz_VecExpr<Range> _bz_asVecExpr() const
>    { return _bz_VecExpr<Range>(*this); }
>
>private:
>    int first_, last_, stride_;
>};
>
>}
># 44 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/listinit.h" 1
># 39 "/mn/anatu/cma-u3/tmac/usr/include/blitz/listinit.h"
>namespace blitz {
>
>template<typename T_numtype, typename T_iterator>
>class ListInitializer {
>
>public:
>    ListInitializer(T_iterator iter)
>        : iter_(iter)
>    {
>    }
>
>    ListInitializer<T_numtype, T_iterator> operator,(T_numtype x)
>    {
>        *iter_ = x;
>        return ListInitializer<T_numtype, T_iterator>(iter_ + 1);
>    }
>
>private:
>    ListInitializer();
>
>protected:
>    T_iterator iter_;
>};
>
>template<typename T_array, typename T_iterator = typename T_array::T_numtype*>
>class ListInitializationSwitch {
>
>public:
>    typedef typename T_array::T_numtype T_numtype;
>
>    ListInitializationSwitch(const ListInitializationSwitch<T_array>& lis)
>        : array_(lis.array_), value_(lis.value_),
>          wipeOnDestruct_(true)
>    {
>        lis.disable();
>    }
>
>    ListInitializationSwitch(T_array& array, T_numtype value)
>        : array_(array), value_(value), wipeOnDestruct_(true)
>    { }
>
>    ~ListInitializationSwitch()
>    {
>        if (wipeOnDestruct_)
>            array_.initialize(value_);
>    }
>
>    ListInitializer<T_numtype, T_iterator> operator,(T_numtype x)
>    {
>        wipeOnDestruct_ = false;
>        T_iterator iter = array_.getInitializationIterator();
>        *iter = value_;
>        T_iterator iter2 = iter + 1;
>        *iter2 = x;
>        return ListInitializer<T_numtype, T_iterator>(iter2 + 1);
>    }
>
>    void disable() const
>    {
>        wipeOnDestruct_ = false;
>    }
>
>private:
>    ListInitializationSwitch();
>
>protected:
>    T_array& array_;
>    T_numtype value_;
>    mutable bool wipeOnDestruct_;
>};
>
>}
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tiny.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tiny.h"
>namespace blitz {
>
>class _bz_tinyBase {
>};
>
>}
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
>
>namespace blitz {
>
>
>
>
>
>template<typename P_numtype, int N_length, int N_stride = 1 >
>class TinyVectorIter;
>
>template<typename P_numtype, int N_length, int N_stride = 1 >
>class TinyVectorIterConst;
>
>template<typename P_numtype>
>class Vector;
>
>template<typename P_expr>
>class _bz_VecExpr;
>
>template<typename P_distribution>
>class Random;
>
>template<typename P_numtype>
>class VectorPick;
>
>template<typename T_numtype1, typename T_numtype2, int N_rows, int N_columns,
>    int N_vecStride>
>class _bz_matrixVectorProduct;
>
>
>
>
>
>
>
>template<typename P_numtype, int N_length>
>class TinyVector {
>public:
>
>
>
>
>
>    typedef P_numtype T_numtype;
>    typedef TinyVector<T_numtype,N_length> T_vector;
>    typedef TinyVectorIter<T_numtype,N_length,1> T_iterator;
>    typedef TinyVectorIterConst<T_numtype,N_length,1> T_constIterator;
>    typedef T_numtype* iterator;
>    typedef const T_numtype* const_iterator;
>    enum { numElements = N_length };
>
>    TinyVector() { }
>    ~TinyVector() { }
>
>    inline TinyVector(const TinyVector<T_numtype,N_length>& x);
>
>    template <typename T_numtype2>
>    inline TinyVector(const TinyVector<T_numtype2,N_length>& x);
>
>    inline TinyVector(const T_numtype initValue);
>
>    inline TinyVector(const T_numtype x[]) {
>        memcpy(data_,x,N_length*sizeof(T_numtype));
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4, T_numtype x5)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>        data_[5] = x5;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4, T_numtype x5, T_numtype x6)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>        data_[5] = x5;
>        data_[6] = x6;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4, T_numtype x5, T_numtype x6,
>        T_numtype x7)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>        data_[5] = x5;
>        data_[6] = x6;
>        data_[7] = x7;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4, T_numtype x5, T_numtype x6,
>        T_numtype x7, T_numtype x8)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>        data_[5] = x5;
>        data_[6] = x6;
>        data_[7] = x7;
>        data_[8] = x8;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4, T_numtype x5, T_numtype x6,
>        T_numtype x7, T_numtype x8, T_numtype x9)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>        data_[5] = x5;
>        data_[6] = x6;
>        data_[7] = x7;
>        data_[8] = x8;
>        data_[9] = x9;
>    }
>
>    TinyVector(T_numtype x0, T_numtype x1, T_numtype x2,
>        T_numtype x3, T_numtype x4, T_numtype x5, T_numtype x6,
>        T_numtype x7, T_numtype x8, T_numtype x9, T_numtype x10)
>    {
>        data_[0] = x0;
>        data_[1] = x1;
>        data_[2] = x2;
>        data_[3] = x3;
>        data_[4] = x4;
>        data_[5] = x5;
>        data_[6] = x6;
>        data_[7] = x7;
>        data_[8] = x8;
>        data_[9] = x9;
>        data_[10] = x10;
>    }
>
>
>    template<typename P_expr>
>    inline TinyVector(_bz_VecExpr<P_expr> expr);
>
>    T_iterator beginFast() { return T_iterator(*this); }
>    T_constIterator beginFast() const { return T_constIterator(*this); }
>
>    iterator begin() { return data_; }
>    const_iterator begin() const { return data_; }
>
>    iterator end() { return data_ + N_length; }
>    const_iterator end() const { return data_ + N_length; }
>
>    T_numtype * __restrict__ data()
>    { return data_; }
>
>    const T_numtype * __restrict__ data() const
>    { return data_; }
>
>    T_numtype * __restrict__ dataFirst()
>    { return data_; }
>
>    const T_numtype * __restrict__ dataFirst() const
>    { return data_; }
>
>    unsigned length() const
>    { return N_length; }
>
>
>
>
>
>
>
>    unsigned _bz_suggestLength() const
>    { return N_length; }
>
>    bool _bz_hasFastAccess() const
>    { return true; }
>
>    T_numtype& __restrict__ _bz_fastAccess(unsigned i)
>    { return data_[i]; }
>
>    T_numtype _bz_fastAccess(unsigned i) const
>    { return data_[i]; }
>
>    template<typename P_expr, typename P_updater>
>    void _bz_assign(P_expr, P_updater);
>
>    _bz_VecExpr<T_constIterator> _bz_asVecExpr() const
>    { return _bz_VecExpr<T_constIterator>(beginFast()); }
>
>
>
>
>
>    bool lengthCheck(unsigned i) const
>    {
>        ;
>
>
>        return true;
>    }
>
>    const T_numtype& operator()(unsigned i) const
>    {
>        ;
>        return data_[i];
>    }
>
>    T_numtype& __restrict__ operator()(unsigned i)
>    {
>        ;
>        return data_[i];
>    }
>
>    const T_numtype& operator[](unsigned i) const
>    {
>        ;
>        return data_[i];
>    }
>
>    T_numtype& __restrict__ operator[](unsigned i)
>    {
>        ;
>        return data_[i];
>    }
>
>
>
>
>
>
>    ListInitializationSwitch<T_vector,T_numtype*> operator=(T_numtype x)
>    {
>        return ListInitializationSwitch<T_vector,T_numtype*>(*this, x);
>    }
>
>    T_vector& initialize(const T_numtype);
>    T_vector& operator+=(const T_numtype);
>    T_vector& operator-=(const T_numtype);
>    T_vector& operator*=(const T_numtype);
>    T_vector& operator/=(const T_numtype);
>    T_vector& operator%=(const T_numtype);
>    T_vector& operator^=(const T_numtype);
>    T_vector& operator&=(const T_numtype);
>    T_vector& operator|=(const T_numtype);
>    T_vector& operator>>=(const int);
>    T_vector& operator<<=(const int);
>
>    template<typename P_numtype2>
>    T_vector& operator=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator+=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator-=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator*=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator/=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator%=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator^=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator&=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator|=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator>>=(const TinyVector<P_numtype2, N_length> &);
>    template<typename P_numtype2>
>    T_vector& operator<<=(const TinyVector<P_numtype2, N_length> &);
>
>    template<typename P_numtype2> T_vector& operator=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator+=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator-=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator*=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator/=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator%=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator^=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator&=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator|=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator>>=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator<<=(const Vector<P_numtype2> &);
>
>
>    template<typename P_expr> T_vector& operator=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator+=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator-=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator*=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator/=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator%=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator^=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator&=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator|=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator>>=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator<<=(_bz_VecExpr<P_expr>);
>
>
>    template<typename P_numtype2>
>    T_vector& operator=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator+=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator-=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator*=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator/=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator%=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator^=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator&=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator|=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator>>=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator<<=(const VectorPick<P_numtype2> &);
>
>
>    T_vector& operator=(const Range&);
>    T_vector& operator+=(const Range&);
>    T_vector& operator-=(const Range&);
>    T_vector& operator*=(const Range&);
>    T_vector& operator/=(const Range&);
>    T_vector& operator%=(const Range&);
>    T_vector& operator^=(const Range&);
>    T_vector& operator&=(const Range&);
>    T_vector& operator|=(const Range&);
>    T_vector& operator>>=(const Range&);
>    T_vector& operator<<=(const Range&);
>
>    T_numtype* __restrict__ getInitializationIterator()
>    { return dataFirst(); }
>
>private:
>    T_numtype data_[N_length];
>};
>
>
>
>
>
>template<typename T>
>class TinyVector<T,0> {
>};
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyveciter.h" 1
># 39 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyveciter.h"
>namespace blitz {
>
>
>template<typename P_numtype, int N_length, int N_stride>
>class TinyVectorIter {
>public:
>    typedef P_numtype T_numtype;
>
>    explicit TinyVectorIter(TinyVector<T_numtype, N_length>& x)
>        : data_(x.data())
>    { }
>
>
>    TinyVectorIter(const TinyVectorIter<T_numtype, N_length, N_stride>& iter)
>        : data_(iter.data_)
>    {
>    }
>
>
>    T_numtype operator[](int i) const
>    {
>        ;
>        return data_[i * N_stride];
>    }
>
>    T_numtype& __restrict__ operator[](int i)
>    {
>        ;
>        return data_[i * N_stride];
>    }
>
>    T_numtype operator()(int i) const
>    {
>        ;
>        return data_[i * N_stride];
>    }
>
>    T_numtype& __restrict__ operator()(int i)
>    {
>        ;
>        return data_[i * N_stride];
>    }
>
>    int length(int) const
>    { return N_length; }
>
>    static const int _bz_staticLengthCount = 1,
>                     _bz_dynamicLengthCount = 0,
>                     _bz_staticLength = 0;
>
>    bool _bz_hasFastAccess() const
>    { return true; }
>
>    T_numtype _bz_fastAccess(int i) const
>    { return data_[i * N_stride]; }
>
>    T_numtype& _bz_fastAccess(int i)
>    { return data_[i * N_stride]; }
>
>    int _bz_suggestLength() const
>    { return N_length; }
>
>private:
>    T_numtype * __restrict__ data_;
>};
>
>
>template<typename P_numtype, int N_length, int N_stride>
>class TinyVectorIterConst {
>public:
>    typedef P_numtype T_numtype;
>
>    explicit TinyVectorIterConst(const TinyVector<T_numtype, N_length>& x)
>        : data_(x.data())
>    { }
>
>
>    TinyVectorIterConst(const TinyVectorIterConst<T_numtype, N_length,
>        N_stride>& iter)
>        : data_(iter.data_)
>    {
>    }
>
>    void operator=(const TinyVectorIterConst<T_numtype, N_length, N_stride>&
>        iter)
>    {
>        data_ = iter.data_;
>    }
>
>
>    T_numtype operator[](int i) const
>    {
>        ;
>        return data_[i * N_stride];
>    }
>
>    T_numtype operator()(int i) const
>    {
>        ;
>        return data_[i * N_stride];
>    }
>
>    int length(int) const
>    { return N_length; }
>
>    static const int _bz_staticLengthCount = 1,
>                     _bz_dynamicLengthCount = 0,
>                     _bz_staticLength = 0;
>
>    bool _bz_hasFastAccess() const
>    { return true; }
>
>    T_numtype _bz_fastAccess(int i) const
>    { return data_[i * N_stride]; }
>
>    int _bz_suggestLength() const
>    { return N_length; }
>
>private:
>    const T_numtype * __restrict__ data_;
>};
>
>}
># 429 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h" 1
># 28 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/metaprog.h" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/metaprog.h"
>namespace blitz {
>
>
>
>class _bz_meta_nullOperand {
>public:
>    _bz_meta_nullOperand() { }
>};
>
>template<typename T> inline T operator+(const T& a, _bz_meta_nullOperand)
>{ return a; }
>template<typename T> inline T operator*(const T& a, _bz_meta_nullOperand)
>{ return a; }
>
>
>
>template<int N1, int N2>
>class _bz_meta_max {
>public:
>    static const int max = (N1 > N2) ? N1 : N2;
>};
>
>
>
>template<int N1, int N2>
>class _bz_meta_min {
>public:
>    static const int min = (N1 < N2) ? N1 : N2;
>};
>
>}
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h" 2
>
>
>
>
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvcross.h" 1
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvcross.h"
>namespace blitz {
># 42 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvcross.h"
>template<typename T_numtype>
>TinyVector<T_numtype,3> cross(const TinyVector<T_numtype,3>& x,
>    const TinyVector<T_numtype,3>& y)
>{
>    return TinyVector<T_numtype,3>(x[1]*y[2] - y[1]*x[2],
>        y[0]*x[2] - x[0]*y[2], x[0]*y[1] - y[0]*x[1]);
>}
>
>
>}
># 36 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/dot.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/dot.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h"
>namespace blitz {
># 47 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h"
>template<typename T>
>struct precision_trait {
>    static const int precisionRank = 0;
>    static const bool knowPrecisionRank = false;
>};
># 60 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h"
>template<> struct precision_trait< int > { static const int precisionRank = 100; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< unsigned int > { static const int precisionRank = 200; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< long > { static const int precisionRank = 300; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< unsigned long > { static const int precisionRank = 400; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< float > { static const int precisionRank = 500; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< double > { static const int precisionRank = 600; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< long double > { static const int precisionRank = 700; static const bool knowPrecisionRank = true; };
>
>
>template<> struct precision_trait< complex<float> > { static const int precisionRank = 800; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< complex<double> > { static const int precisionRank = 900; static const bool knowPrecisionRank = true; };
>template<> struct precision_trait< complex<long double> > { static const int precisionRank = 1000; static const bool knowPrecisionRank = true; };
>
>
>template<typename T>
>struct autopromote_trait {
>    typedef T T_numtype;
>};
># 88 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h"
>template<> struct autopromote_trait<bool> { typedef int T_numtype; };
>template<> struct autopromote_trait<char> { typedef int T_numtype; };
>template<> struct autopromote_trait<unsigned char> { typedef int T_numtype; };
>template<> struct autopromote_trait<short int> { typedef int T_numtype; };
>template<> struct autopromote_trait<short unsigned int> { typedef unsigned int T_numtype; };
>
>template<typename T1, typename T2, bool promoteToT1>
>struct _bz_promote2 {
>    typedef T1 T_promote;
>};
>
>template<typename T1, typename T2>
>struct _bz_promote2<T1,T2,false> {
>    typedef T2 T_promote;
>};
>
>template<typename T1_orig, typename T2_orig>
>struct promote_trait {
>
>    typedef typename autopromote_trait<T1_orig>::T_numtype T1;
>    typedef typename autopromote_trait<T2_orig>::T_numtype T2;
>
>
>    static const bool
>        T1IsBetter =
>            precision_trait<T1>::precisionRank >
>            precision_trait<T2>::precisionRank;
>
>
>    static const bool
>        knowBothRanks =
>            precision_trait<T1>::knowPrecisionRank &&
>            precision_trait<T2>::knowPrecisionRank;
>
>
>    static const bool
>        knowT1butNotT2 =
>            precision_trait<T1>::knowPrecisionRank &&
>            !precision_trait<T2>::knowPrecisionRank;
>
>
>    static const bool
>        knowT2butNotT1 =
>            precision_trait<T2>::knowPrecisionRank &&
>            !precision_trait<T1>::knowPrecisionRank;
>
>
>    static const bool
>        T1IsLarger = sizeof(T1) >= sizeof(T2);
># 148 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h"
>    static const bool
>        promoteToT1 = knowBothRanks ? T1IsBetter : (knowT1butNotT2 ? false :
>            (knowT2butNotT1 ? true : T1IsLarger));
>
>
>
>    typedef typename _bz_promote2<T1,T2,promoteToT1>::T_promote T_promote;
>};
># 164 "/mn/anatu/cma-u3/tmac/usr/include/blitz/promote.h"
>}
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/dot.h" 2
>
>
>
>
>
>
>namespace blitz {
>
>template<int N, int I>
>class _bz_meta_vectorDot {
>public:
>    static const int loopFlag = (I < N-1) ? 1 : 0;
>
>    template<typename T_expr1, typename T_expr2>
>    static inline typename blitz::promote_trait<typename T_expr1::T_numtype,typename T_expr2::T_numtype>::T_promote
>
>    f(const T_expr1& a, const T_expr2& b)
>    {
>        return a[I] * b[I]
>            + _bz_meta_vectorDot<loopFlag * N, loopFlag * (I+1)>::f(a,b);
>    }
>
>    template<typename T_expr1, typename T_expr2>
>    static inline typename blitz::promote_trait<typename T_expr1::T_numtype,typename T_expr2::T_numtype>::T_promote
>
>    f_value_ref(T_expr1 a, const T_expr2& b)
>    {
>        return a[I] * b[I]
>            + _bz_meta_vectorDot<loopFlag * N, loopFlag * (I+1)>::f(a,b);
>    }
>
>    template<typename T_expr1, typename T_expr2>
>    static inline typename blitz::promote_trait<typename T_expr1::T_numtype,typename T_expr2::T_numtype>::T_promote
>
>    f_ref_value(const T_expr1& a, T_expr2 b)
>    {
>        return a[I] * b[I]
>            + _bz_meta_vectorDot<loopFlag * N, loopFlag * (I+1)>::f(a,b);
>    }
>
>    template<typename T_expr1, typename P_numtype2>
>    static inline typename blitz::promote_trait<typename T_expr1::T_numtype,P_numtype2>::T_promote
>
>    dotWithArgs(const T_expr1& a, P_numtype2 i1, P_numtype2 i2=0,
>        P_numtype2 i3=0, P_numtype2 i4=0, P_numtype2 i5=0, P_numtype2 i6=0,
>        P_numtype2 i7=0, P_numtype2 i8=0, P_numtype2 i9=0, P_numtype2 i10=0)
>    {
>        return a[I] * i1
>            + _bz_meta_vectorDot<loopFlag * N, loopFlag * (I+1)>::dotWithArgs
>                 (a, i2, i3, i4, i5, i6, i7, i8, i9);
>    }
>};
>
>template<>
>class _bz_meta_vectorDot<0,0> {
>public:
>    template<typename T_expr1, typename T_expr2>
>    static inline _bz_meta_nullOperand f(const T_expr1&, const T_expr2&)
>    { return _bz_meta_nullOperand(); }
>
>    template<typename T_expr1, typename P_numtype2>
>    static inline _bz_meta_nullOperand
>    dotWithArgs(const T_expr1& a, P_numtype2 i1, P_numtype2 i2=0,
>        P_numtype2 i3=0, P_numtype2 i4=0, P_numtype2 i5=0, P_numtype2 i6=0,
>        P_numtype2 i7=0, P_numtype2 i8=0, P_numtype2 i9=0, P_numtype2 i10=0)
>    {
>        return _bz_meta_nullOperand();
>    }
>
>};
>
>}
># 37 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/product.h" 1
># 38 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/product.h"
>namespace blitz {
>
>template<int N, int I>
>class _bz_meta_vectorProduct {
>public:
>    static const int loopFlag = (I < N-1) ? 1 : 0;
>
>    template<typename T_expr1>
>    static inline typename NumericTypeTraits<typename T_expr1::T_numtype>::T_sumtype
>    f(const T_expr1& a)
>    {
>        return a[I] * _bz_meta_vectorProduct<loopFlag * N,
>            loopFlag * (I+1)>::f(a);
>    }
>};
>
>template<>
>class _bz_meta_vectorProduct<0,0> {
>public:
>    template<typename T_expr1>
>    static inline _bz_meta_nullOperand f(const T_expr1&)
>    { return _bz_meta_nullOperand(); }
>};
>
>}
># 38 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/sum.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/sum.h"
>namespace blitz {
>
>template<int N, int I>
>class _bz_meta_vectorSum {
>public:
>    static const int loopFlag = (I < N-1) ? 1 : 0;
>
>    template<typename T_expr1>
>    static inline typename T_expr1::T_numtype
>    f(const T_expr1& a)
>    {
>        return a[I] +
>            _bz_meta_vectorSum<loopFlag * N, loopFlag * (I+1)>::f(a);
>    }
>};
>
>template<>
>class _bz_meta_vectorSum<0,0> {
>public:
>    template<typename T_expr1>
>    static inline _bz_meta_nullOperand f(const T_expr1&)
>    { return _bz_meta_nullOperand(); }
>
>};
>
>}
># 39 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tvecglobs.h" 2
>
>namespace blitz {
>
>template<typename T_numtype1, typename T_numtype2, int N_length>
>inline typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote
>dot(const TinyVector<T_numtype1, N_length>& a,
>    const TinyVector<T_numtype2, N_length>& b)
>{
>    return _bz_meta_vectorDot<N_length, 0>::f(a,b);
>}
>
>template<typename T_expr1, typename T_numtype2, int N_length>
>inline typename blitz::promote_trait<typename T_expr1::T_numtype,T_numtype2>::T_promote
>dot(_bz_VecExpr<T_expr1> a, const TinyVector<T_numtype2, N_length>& b)
>{
>    return _bz_meta_vectorDot<N_length, 0>::f_value_ref(a,b);
>}
>
>template<typename T_numtype1, typename T_expr2, int N_length>
>inline typename blitz::promote_trait<T_numtype1,typename T_expr2::T_numtype>::T_promote
>dot(const TinyVector<T_numtype1, N_length>& a, _bz_VecExpr<T_expr2> b)
>{
>    return _bz_meta_vectorDot<N_length, 0>::f_ref_value(a,b);
>}
>
>template<typename T_numtype1, int N_length>
>inline typename NumericTypeTraits<T_numtype1>::T_sumtype
>product(const TinyVector<T_numtype1, N_length>& a)
>{
>    return _bz_meta_vectorProduct<N_length, 0>::f(a);
>}
>
>template<typename T_numtype, int N_length>
>inline T_numtype
>sum(const TinyVector<T_numtype, N_length>& a)
>{
>    return _bz_meta_vectorSum<N_length, 0>::f(a);
>}
>
>}
># 430 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 1
># 45 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h"
>namespace blitz {
>
>
>template<typename P_numtype> class VectorIter;
>template<typename P_numtype> class VectorIterConst;
>template<typename P_expr> class _bz_VecExpr;
>template<typename P_numtype> class VectorPick;
>template<typename P_numtype> class Random;
>
>
>
>template<typename P_numtype>
>class Vector : protected MemoryBlockReference<P_numtype> {
>
>private:
>    typedef MemoryBlockReference<P_numtype> T_base;
>    using T_base::data_;
>
>public:
>
>
>
>
>    typedef P_numtype T_numtype;
>    typedef Vector<T_numtype> T_vector;
>    typedef VectorIter<T_numtype> T_iterator;
>    typedef VectorIterConst<T_numtype> T_constIterator;
>    typedef VectorPick<T_numtype> T_pick;
>    typedef Vector<int> T_indexVector;
># 82 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h"
>    Vector()
>    {
>        length_ = 0;
>        stride_ = 0;
>    }
>
>
>
>    Vector(const Vector<T_numtype>& vec)
>        : MemoryBlockReference<T_numtype>(const_cast<Vector<T_numtype>&>(vec))
>    {
>        length_ = vec.length_;
>        stride_ = vec.stride_;
>    }
>
>    explicit Vector(int length)
>        : MemoryBlockReference<T_numtype>(length)
>    {
>        length_ = length;
>        stride_ = 1;
>    }
>
>    Vector(const Vector<T_numtype>& vec, Range r)
>        : MemoryBlockReference<T_numtype>(const_cast<Vector<T_numtype>&>(vec),
>                                          r.first() * vec.stride())
>    {
>        ;
>        ;
>
>        length_ = (r.last(vec.length()-1) - r.first()) / r.stride() + 1;
>        stride_ = vec.stride() * r.stride();
>    }
>
>    Vector(int length, T_numtype initValue)
>        : MemoryBlockReference<T_numtype>(length)
>    {
>        length_ = length;
>        stride_ = 1;
>        (*this) = initValue;
>    }
>
>    Vector(int length, T_numtype firstValue, T_numtype delta)
>        : MemoryBlockReference<T_numtype>(length)
>    {
>        length_ = length;
>        stride_ = 1;
>        for (int i=0; i < length; ++i)
>            data_[i] = firstValue + i * delta;
>    }
>
>    template<typename P_distribution>
>    Vector(int length, Random<P_distribution>& random)
>        : MemoryBlockReference<T_numtype>(length)
>    {
>        length_ = length;
>        stride_ = 1;
>        (*this) = random;
>    }
>
>    template<typename P_expr>
>    Vector(_bz_VecExpr<P_expr> expr)
>        : MemoryBlockReference<T_numtype>(expr._bz_suggestLength())
>    {
>        length_ = expr._bz_suggestLength();
>        stride_ = 1;
>        (*this) = expr;
>    }
>
>
>
>
>    Vector(int length, T_numtype* __restrict__ data, int stride = 1)
>        : MemoryBlockReference<T_numtype>(length, data, neverDeleteData)
>    {
>        length_ = length;
>        stride_ = stride;
>    }
>
>
>    Vector(Range r)
>        : MemoryBlockReference<T_numtype>(r._bz_suggestLength())
>    {
>        length_ = r._bz_suggestLength();
>        stride_ = 1;
>        (*this) = _bz_VecExpr<Range>(r);
>    }
># 180 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h"
>    void assertUnitStride()
>    {
>        ;
>        stride_ = 1;
>    }
>
>    T_iterator beginFast() { return T_iterator(*this); }
>    T_constIterator beginFast() const { return T_constIterator(*this); }
>
>    T_vector copy() const;
>
>
>
>
>    T_numtype * __restrict__ data()
>    { return data_; }
>
>    const T_numtype * __restrict__ data() const
>    { return data_; }
>
>    bool isUnitStride() const
>    { return stride_ == 1; }
>
>    int length() const
>    { return length_; }
>
>    void makeUnique();
>
>
>
>
>
>    void reference(T_vector&);
>
>    void resize(int length);
>
>    void resizeAndPreserve(int newLength);
>
>
>
>    T_vector reverse()
>    { return T_vector(*this,Range(length()-1,0,-1)); }
>
>    int stride() const
>    { return stride_; }
>
>    operator _bz_VecExpr<VectorIterConst<T_numtype> > () const
>    { return _bz_VecExpr<VectorIterConst<T_numtype> >(beginFast()); }
>
>
>
>
>
>
>
>    int _bz_suggestLength() const
>    { return length_; }
>
>    bool _bz_hasFastAccess() const
>    { return stride_ == 1; }
>
>    T_numtype& _bz_fastAccess(int i)
>    { return data_[i]; }
>
>    T_numtype _bz_fastAccess(int i) const
>    { return data_[i]; }
>
>    template<typename P_expr, typename P_updater>
>    void _bz_assign(P_expr, P_updater);
>
>    _bz_VecExpr<T_constIterator> _bz_asVecExpr() const
>    { return _bz_VecExpr<T_constIterator>(beginFast()); }
>
>
>
>
>
>
>
>    T_numtype operator()(int i) const
>    {
>        ;
>        ;
>        return data_[i];
>    }
>
>
>
>    T_numtype& __restrict__ operator()(int i)
>    {
>        ;
>        ;
>        return data_[i];
>    }
>
>    T_numtype operator[](int i) const
>    {
>        ;
>        return data_[i * stride_];
>    }
>
>    T_numtype& __restrict__ operator[](int i)
>    {
>        ;
>        return data_[i * stride_];
>    }
>
>    T_vector operator()(Range r)
>    {
>        return T_vector(*this, r);
>    }
>
>    T_vector operator[](Range r)
>    {
>        return T_vector(*this, r);
>    }
>
>    T_pick operator()(T_indexVector i)
>    {
>        return T_pick(*this, i);
>    }
>
>    T_pick operator[](T_indexVector i)
>    {
>        return T_pick(*this, i);
>    }
># 314 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h"
>    ListInitializationSwitch<T_vector,T_iterator> operator=(T_numtype x)
>    {
>        return ListInitializationSwitch<T_vector,T_iterator>(*this, x);
>    }
>
>    T_iterator getInitializationIterator()
>    { return beginFast(); }
>
>    T_vector& initialize(T_numtype);
>    T_vector& operator+=(T_numtype);
>    T_vector& operator-=(T_numtype);
>    T_vector& operator*=(T_numtype);
>    T_vector& operator/=(T_numtype);
>    T_vector& operator%=(T_numtype);
>    T_vector& operator^=(T_numtype);
>    T_vector& operator&=(T_numtype);
>    T_vector& operator|=(T_numtype);
>    T_vector& operator>>=(int);
>    T_vector& operator<<=(int);
>
>
>
>    template<typename P_numtype2> T_vector& operator=(const Vector<P_numtype2> &);
>
>
>
>
>
>
>    template<typename P_numtype2> T_vector& operator+=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator-=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator*=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator/=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator%=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator^=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator&=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator|=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator>>=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_vector& operator<<=(const Vector<P_numtype2> &);
>
>
>    template<typename P_expr> T_vector& operator=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator+=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator-=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator*=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator/=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator%=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator^=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator&=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator|=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator>>=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_vector& operator<<=(_bz_VecExpr<P_expr>);
>
>
>    template<typename P_numtype2>
>    T_vector& operator=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator+=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator-=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator*=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator/=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator%=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator^=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator&=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator|=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator>>=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_vector& operator<<=(const VectorPick<P_numtype2> &);
>
>
>    T_vector& operator=(Range);
>    T_vector& operator+=(Range);
>    T_vector& operator-=(Range);
>    T_vector& operator*=(Range);
>    T_vector& operator/=(Range);
>    T_vector& operator%=(Range);
>    T_vector& operator^=(Range);
>    T_vector& operator&=(Range);
>    T_vector& operator|=(Range);
>    T_vector& operator>>=(Range);
>    T_vector& operator<<=(Range);
>
>
>    template<typename P_distribution>
>    T_vector& operator=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator+=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator-=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator*=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator/=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator%=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator^=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator&=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_vector& operator|=(Random<P_distribution>& random);
># 433 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h"
>private:
>    int length_;
>    int stride_;
>};
>
>
>
>template<typename P_numtype>
>ostream& operator<<(ostream& os, const Vector<P_numtype>& x);
>
>template<typename P_expr>
>ostream& operator<<(ostream& os, _bz_VecExpr<P_expr> expr);
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/veciter.h" 1
># 35 "/mn/anatu/cma-u3/tmac/usr/include/blitz/veciter.h"
>namespace blitz {
>
>
>template<typename P_numtype>
>class VectorIter {
>public:
>    typedef P_numtype T_numtype;
>
>    explicit VectorIter(Vector<P_numtype>& x)
>        : data_(x.data())
>    {
>        stride_ = x.stride();
>        length_ = x.length();
>    }
>
>    VectorIter(P_numtype* __restrict__ data, int stride, int length)
>        : data_(data), stride_(stride), length_(length)
>    { }
>
>
>    VectorIter(const VectorIter<P_numtype>& x)
>    {
>        data_ = x.data_;
>        stride_ = x.stride_;
>        length_ = x.length_;
>    }
>
>
>    P_numtype operator[](int i) const
>    {
>        ;
>        return data_[i*stride_];
>    }
>
>    P_numtype& __restrict__ operator[](int i)
>    {
>        ;
>        return data_[i*stride_];
>    }
>
>    P_numtype operator()(int i) const
>    {
>        ;
>        return data_[i*stride_];
>    }
>
>    P_numtype& __restrict__ operator()(int i)
>    {
>        ;
>        return data_[i*stride_];
>    }
>
>    P_numtype operator*() const
>    { return *data_; }
>
>    P_numtype& operator*()
>    { return *data_; }
>
>    VectorIter<P_numtype> operator+(int i)
>    {
>
>        return VectorIter<P_numtype>(data_+i*stride_, stride_, length_-i);
>    }
>
>    int length(int) const
>    { return length_; }
>
>    bool isUnitStride() const
>    { return (stride_ == 1); }
>
>
>
>
>
>
>
>    static const int
>        _bz_staticLengthCount = 0,
>        _bz_dynamicLengthCount = 1,
>        _bz_staticLength = 0;
>
>    bool _bz_hasFastAccess() const
>    { return isUnitStride(); }
>
>    P_numtype _bz_fastAccess(int i) const
>    { return data_[i]; }
>
>    P_numtype& __restrict__ _bz_fastAccess(int i)
>    { return data_[i]; }
>
>    int _bz_suggestLength() const
>    { return length_; }
>
>private:
>    VectorIter() { }
>    P_numtype * __restrict__ data_;
>    int stride_;
>    int length_;
>};
>
>
>template<typename P_numtype>
>class VectorIterConst {
>public:
>    typedef P_numtype T_numtype;
>
>    explicit VectorIterConst(const Vector<P_numtype>& x)
>        : data_(x.data())
>    {
>        stride_ = x.stride();
>        length_ = x.length();
>    }
>
>
>    VectorIterConst(const VectorIterConst<P_numtype>& x)
>    {
>        data_ = x.data_;
>        stride_ = x.stride_;
>        length_ = x.length_;
>    }
>
>
>    P_numtype operator[](int i) const
>    {
>        ;
>        return data_[i*stride_];
>    }
>
>    P_numtype operator()(int i) const
>    {
>        ;
>        return data_[i*stride_];
>    }
>
>    int length(int) const
>    { return length_; }
>
>    bool isUnitStride() const
>    { return (stride_ == 1); }
>
>
>
>
>
>
>
>    static const int
>        _bz_staticLengthCount = 0,
>        _bz_dynamicLengthCount = 1,
>        _bz_staticLength = 0;
>
>    bool _bz_hasFastAccess() const
>    { return isUnitStride(); }
>
>    P_numtype _bz_fastAccess(int i) const
>    {
>        return data_[i];
>    }
>
>    int _bz_suggestLength() const
>    { return length_; }
>
>private:
>    const P_numtype * __restrict__ data_;
>    int stride_;
>    int length_;
>};
>
>}
># 449 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h" 1
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h" 2
>
>namespace blitz {
>
>
>
>template<typename P_numtype> class VectorPickIter;
>template<typename P_numtype> class VectorPickIterConst;
>
>
>
>template<typename P_numtype>
>class VectorPick {
>
>public:
>
>
>
>
>    typedef P_numtype T_numtype;
>    typedef Vector<T_numtype> T_vector;
>    typedef Vector<int> T_indexVector;
>    typedef VectorPick<T_numtype> T_pick;
>    typedef VectorPickIter<T_numtype> T_iterator;
>    typedef VectorPickIterConst<T_numtype> T_constIterator;
>
>
>
>
>
>    VectorPick(T_vector& vector, T_indexVector& indexarg)
>        : vector_(vector), index_(indexarg)
>    { }
>
>    VectorPick(const T_pick& vecpick)
>        : vector_(const_cast<T_vector&>(vecpick.vector_)),
>          index_(const_cast<T_indexVector&>(vecpick.index_))
>    { }
>
>    VectorPick(T_pick& vecpick, Range r)
>        : vector_(vecpick.vector_), index_(vecpick.index_[r])
>    { }
>
>
>
>
>
>    T_iterator beginFast()
>    { return VectorPickIter<T_numtype>(*this); }
>
>    T_constIterator beginFast() const
>    { return VectorPickIterConst<T_numtype>(*this); }
>
>
>
>
>
>
>
>    T_indexVector& indexSet()
>    { return index_; }
>
>    const T_indexVector& indexSet() const
>    { return index_; }
>
>    int length() const
>    { return index_.length(); }
>
>    void setVector(Vector<T_numtype>& x)
>    { vector_.reference(x); }
>
>    void setIndex(Vector<int>& index)
>    { index_.reference(index); }
>
>    T_vector& vector()
>    { return vector_; }
>
>    const T_vector& vector() const
>    { return vector_; }
>
>
>
>
>
>
>
>    int _bz_suggestLength() const
>    { return index_.length(); }
>
>    bool _bz_hasFastAccess() const
>    { return vector_._bz_hasFastAccess() && index_._bz_hasFastAccess(); }
>
>    T_numtype& _bz_fastAccess(int i)
>    { return vector_._bz_fastAccess(index_._bz_fastAccess(i)); }
>
>    T_numtype _bz_fastAccess(int i) const
>    { return vector_._bz_fastAccess(index_._bz_fastAccess(i)); }
>
>    _bz_VecExpr<T_constIterator> _bz_asVecExpr() const
>    { return _bz_VecExpr<T_constIterator>(beginFast()); }
>
>
>
>
>
>    T_numtype operator()(int i) const
>    {
>        ;
>        ;
>        ;
>        ;
>        return vector_(index_(i));
>    }
>
>    T_numtype& operator()(int i)
>    {
>        ;
>        ;
>        ;
>        ;
>        return vector_(index_(i));
>    }
>
>    T_numtype operator[](int i) const
>    {
>        ;
>        ;
>        ;
>        ;
>        return vector_[index_[i]];
>    }
>
>    T_numtype& operator[](int i)
>    {
>        ;
>        ;
>        ;
>        ;
>        return vector_[index_[i]];
>    }
>
>    T_pick operator()(Range r)
>    {
>        return T_pick(*this, index_[r]);
>    }
>
>    T_pick operator[](Range r)
>    {
>        return T_pick(*this, index_[r]);
>    }
>
>
>
>
>
>
>    T_pick& operator=(T_numtype);
>    T_pick& operator+=(T_numtype);
>    T_pick& operator-=(T_numtype);
>    T_pick& operator*=(T_numtype);
>    T_pick& operator/=(T_numtype);
>    T_pick& operator%=(T_numtype);
>    T_pick& operator^=(T_numtype);
>    T_pick& operator&=(T_numtype);
>    T_pick& operator|=(T_numtype);
>    T_pick& operator>>=(int);
>    T_pick& operator<<=(int);
>
>
>    template<typename P_numtype2> T_pick& operator=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator+=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator-=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator*=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator/=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator%=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator^=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator&=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator|=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator>>=(const Vector<P_numtype2> &);
>    template<typename P_numtype2> T_pick& operator<<=(const Vector<P_numtype2> &);
>
>
>    template<typename P_expr> T_pick& operator=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator+=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator-=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator*=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator/=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator%=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator^=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator&=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator|=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator>>=(_bz_VecExpr<P_expr>);
>    template<typename P_expr> T_pick& operator<<=(_bz_VecExpr<P_expr>);
>
>
>    T_pick& operator=(Range);
>    T_pick& operator+=(Range);
>    T_pick& operator-=(Range);
>    T_pick& operator*=(Range);
>    T_pick& operator/=(Range);
>    T_pick& operator%=(Range);
>    T_pick& operator^=(Range);
>    T_pick& operator&=(Range);
>    T_pick& operator|=(Range);
>    T_pick& operator>>=(Range);
>    T_pick& operator<<=(Range);
>
>
>    template<typename P_numtype2>
>    T_pick& operator=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator+=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator-=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator*=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator/=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator%=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator^=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator&=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator|=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator>>=(const VectorPick<P_numtype2> &);
>    template<typename P_numtype2>
>    T_pick& operator<<=(const VectorPick<P_numtype2> &);
>
>
>    template<typename P_distribution>
>    T_pick& operator=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator+=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator-=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator*=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator/=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator%=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator^=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator&=(Random<P_distribution>& random);
>    template<typename P_distribution>
>    T_pick& operator|=(Random<P_distribution>& random);
>
>private:
>    VectorPick() { }
>
>    template<typename P_expr, typename P_updater>
>    inline void _bz_assign(P_expr, P_updater);
>
>private:
>    T_vector vector_;
>    T_indexVector index_;
>};
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc" 1
># 13 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h" 1
># 14 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/update.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/update.h"
>namespace blitz {
>
>class _bz_updater_base { };
># 46 "/mn/anatu/cma-u3/tmac/usr/include/blitz/update.h"
>template<typename X, typename Y>
>class _bz_update : public _bz_updater_base {
>  public:
>    static inline void update(X& __restrict__ x, Y y)
>    { x = (X)y; }
>
>    static void prettyPrint(std::string &str)
>    { str += "="; }
>};
>
>template<typename X, typename Y> class _bz_plus_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x += y; } static void prettyPrint(std::string &str) { str += "+="; } };
>template<typename X, typename Y> class _bz_minus_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x -= y; } static void prettyPrint(std::string &str) { str += "-="; } };
>template<typename X, typename Y> class _bz_multiply_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x *= y; } static void prettyPrint(std::string &str) { str += "*="; } };
>template<typename X, typename Y> class _bz_divide_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x /= y; } static void prettyPrint(std::string &str) { str += "/="; } };
>template<typename X, typename Y> class _bz_mod_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x %= y; } static void prettyPrint(std::string &str) { str += "%="; } };
>template<typename X, typename Y> class _bz_xor_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x ^= y; } static void prettyPrint(std::string &str) { str += "^="; } };
>template<typename X, typename Y> class _bz_bitand_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x &= y; } static void prettyPrint(std::string &str) { str += "&="; } };
>template<typename X, typename Y> class _bz_bitor_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x |= y; } static void prettyPrint(std::string &str) { str += "|="; } };
>template<typename X, typename Y> class _bz_shiftl_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x <<= y; } static void prettyPrint(std::string &str) { str += "<<="; } };
>template<typename X, typename Y> class _bz_shiftr_update : public _bz_updater_base { public: static inline void update(X& __restrict__ x, Y y) { x >>= y; } static void prettyPrint(std::string &str) { str += ">>="; } };
>
>}
># 15 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/random.h" 1
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/random.h"
>namespace blitz {
>
>template<typename P_distribution>
>class Random {
>
>public:
>    typedef P_distribution T_distribution;
>    typedef typename T_distribution::T_numtype T_numtype;
>
>    Random(double parm1=0.0, double parm2=1.0, double parm3=0.0)
>        : generator_(parm1, parm2, parm3)
>    { }
>
>    void randomize()
>    { generator_.randomize(); }
>
>    T_numtype random()
>    { return generator_.random(); }
>
>    operator T_numtype()
>    { return generator_.random(); }
>
>protected:
>    T_distribution generator_;
>};
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/randref.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/randref.h"
>namespace blitz {
>
>template<typename P_distribution>
>class _bz_VecExprRandom {
>
>public:
>    typedef typename Random<P_distribution>::T_numtype T_numtype;
>
>    _bz_VecExprRandom(Random<P_distribution>& random)
>        : random_(random)
>    { }
>
>
>    _bz_VecExprRandom(_bz_VecExprRandom<P_distribution>& x)
>        : random_(x.random_)
>    { }
>
>
>    T_numtype operator[](unsigned) const
>    { return random_.random(); }
>
>    T_numtype operator()(unsigned) const
>    { return random_.random(); }
>
>    unsigned length(unsigned recommendedLength) const
>    { return recommendedLength; }
>
>    unsigned _bz_suggestLength() const
>    { return 0; }
>
>    bool _bz_hasFastAccess() const
>    { return 1; }
>
>    T_numtype _bz_fastAccess(unsigned) const
>    { return random_.random(); }
>
>private:
>    _bz_VecExprRandom() : random_( Random<P_distribution>() ) { }
>
>    Random<P_distribution>& random_;
>};
>
>}
># 62 "/mn/anatu/cma-u3/tmac/usr/include/blitz/random.h" 2
># 16 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecexpr.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecexpr.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/applics.h" 1
># 41 "/mn/anatu/cma-u3/tmac/usr/include/blitz/applics.h"
>namespace blitz {
>
>
>
>
>class ApplicativeTemplatesBase { };
>class TwoOperandApplicativeTemplatesBase : public ApplicativeTemplatesBase { };
>class OneOperandApplicativeTemplatesBase : public ApplicativeTemplatesBase { };
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Add : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x + y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Subtract : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x - y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Multiply : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x * y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Divide : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x / y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Mod : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x % y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_BitwiseXOR : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x ^ y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_BitwiseAnd : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x & y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_BitwiseOr : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x | y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_ShiftRight : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x >> y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_ShiftLeft : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x << y; }
>};
>
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Min : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return (x < y ? x : y); }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Max : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return (x > y ? x : y); }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Greater : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x > y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Less : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x < y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_GreaterOrEqual : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x >= y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_LessOrEqual : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x <= y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_Equal : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x == y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_NotEqual : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x != y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_LogicalAnd : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x && y; }
>};
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_LogicalOr : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline T_promote apply(P_numtype1 x, P_numtype2 y)
>    { return x || y; }
>};
>
>
>template<typename P_numtype_in, typename P_numtype_out>
>class _bz_Cast : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype_in T_numtype1;
>    typedef P_numtype_out T_promote;
>    typedef T_promote T_numtype;
>
>    static inline P_numtype_out apply(P_numtype_in x)
>    { return P_numtype_out(x); }
>};
>
>template<typename P_numtype>
>class _bz_LogicalNot : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype T_numtype1;
>    typedef bool T_promote;
>    typedef T_promote T_numtype;
>
>    static inline P_numtype apply(P_numtype x)
>    { return !x; }
>};
>
>template<typename P_numtype>
>class _bz_BitwiseNot : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype T_numtype1;
>    typedef T_numtype1 T_promote;
>    typedef T_promote T_numtype;
>
>    static inline P_numtype apply(P_numtype x)
>    { return ~x; }
>};
># 397 "/mn/anatu/cma-u3/tmac/usr/include/blitz/applics.h"
>}
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h" 1
># 12 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/prettyprint.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/prettyprint.h"
>namespace blitz {
>
>class prettyPrintFormat {
>
>public:
>    prettyPrintFormat(const bool terse = false)
>        : tersePrintingSelected_(terse)
>    {
>        arrayOperandCounter_ = 0;
>        scalarOperandCounter_ = 0;
>        dumpArrayShapes_ = false;
>    }
>
>    void setDumpArrayShapesMode() { dumpArrayShapes_ = true; }
>    char nextArrayOperandSymbol()
>    {
>        return static_cast<char>('A' + ((arrayOperandCounter_++) % 26));
>    }
>    char nextScalarOperandSymbol()
>    {
>        return static_cast<char>('s' + ((scalarOperandCounter_++) % 26));
>    }
>
>    bool tersePrintingSelected() const { return tersePrintingSelected_; }
>    bool dumpArrayShapesMode() const { return dumpArrayShapes_; }
>
>private:
>    bool tersePrintingSelected_;
>    bool dumpArrayShapes_;
>    int arrayOperandCounter_;
>    int scalarOperandCounter_;
>};
>
>}
># 13 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h" 2
>
>
>namespace blitz {
>
>
>template<typename P_numtype1>
>class _bz_abs : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::abs(x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "abs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_abs<long> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long T_numtype1;
>    typedef long T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::labs((long)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "labs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_abs<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::fabs((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "fabs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_abs<double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef double T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::fabs((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "fabs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_abs<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::fabs((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "fabs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_abs<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::abs((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "abs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_abs<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::abs((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "abs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_abs<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::abs((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "abs(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_acos : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::acos((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "acos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_acos<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::acos((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "acos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_acos<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::acos((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "acos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 311 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_acosh : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::acosh((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "acosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_asin : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::asin((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "asin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_asin<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::asin((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "asin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_asin<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::asin((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "asin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 459 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_asinh : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::asinh((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "asinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_arg : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return 0; }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "0(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_arg<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::arg((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "arg(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_arg<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::arg((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "arg(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_arg<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::arg((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "arg(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_atan : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::atan((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "atan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_atan<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::atan((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "atan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_atan<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::atan((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "atan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 695 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_atanh : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::atanh((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "atanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_atan2 : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::atan2((double)x,(double)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "atan2(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_atan2<float, float > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype2;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::atan2((float)x,(float)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "atan2(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_atan2<long double, long double > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype2;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::atan2((long double)x,(long double)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "atan2(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 808 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_cbrt : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::cbrt((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cbrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_ceil : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::ceil((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "ceil(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_ceil<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::ceil((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "ceil(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_ceil<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::ceil((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "ceil(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_conj : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::conj(x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "conj(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_cos : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cos((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_cos<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cos((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_cos<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cos((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_cos<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cos((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_cos<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cos((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_cos<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cos((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cos(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 1064 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_cosh : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cosh((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_cosh<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cosh((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_cosh<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cosh((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_cosh<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cosh((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_cosh<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cosh((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_cosh<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::cosh((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cosh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 1217 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_exp : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::exp((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "exp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_exp<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::exp((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "exp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_exp<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::exp((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "exp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_exp<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::exp((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "exp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_exp<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::exp((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "exp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_exp<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::exp((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "exp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<typename P_numtype1>
>class _bz_expm1 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::expm1((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "expm1(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_erf : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::erf((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "erf(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_erfc : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::erfc((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "erfc(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_floor : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::floor((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "floor(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_floor<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::floor((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "floor(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_floor<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::floor((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "floor(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_fmod : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::fmod((double)x,(double)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "fmod(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 1520 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_ilogb : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef int T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::ilogb(x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "ilogb(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_blitz_isnan : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef int T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>
>        return std::isnan(x);
>
>
>
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "blitz_isnan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 1592 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_j0 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::j0((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "j0(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_j1 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::j1((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "j1(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_lgamma : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::lgamma((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "lgamma(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_log : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_log<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_log<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_log<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_log<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_log<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<typename P_numtype1>
>class _bz_logb : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::logb((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "logb(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_log1p : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::log1p((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log1p(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_log10 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log10((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log10(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_log10<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log10((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log10(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_log10<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::log10((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "log10(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 2001 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype>
>class _bz_negate : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef typename NumericTypeTraits<P_numtype>::T_signedtype T_numtype;
>
>    static inline T_numtype apply(T_numtype x)
>    { return -x; }
>
>        template<typename T1>
>        static void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& a)
>        {
>                str += "-(";
>                       a.prettyPrint(str,format);
>                       str += ")";
>        }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_norm : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::norm(x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "norm(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_polar : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef complex<T_numtype1> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::polar(x,y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "polar(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1, typename P_numtype2>
>class _bz_pow : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype2 T_numtype2;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::pow((double)x,(double)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "pow(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_pow<float, float > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype2;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::pow((float)x,(float)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "pow(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_pow<long double, long double > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype2;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::pow((long double)x,(long double)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "pow(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_pow<complex<float>, complex<float> > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype2;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::pow((complex<float>)x,(complex<float>)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "pow(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_pow<complex<double>, complex<double> > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype2;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::pow((complex<double>)x,(complex<double>)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "pow(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_pow<complex<long double>, complex<long double> > : public TwoOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype2;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x, T_numtype2 y)
>    { return std::pow((complex<long double>)x,(complex<long double>)y); }
>
>    template<typename T1, typename T2>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a, const T2& b)
>    {
>        str += "pow(";
>        a.prettyPrint(str,format);
>        str += ",";
>        b.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 2240 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_rint : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::rint((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "rint(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 2308 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_sin : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sin((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_sin<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sin((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_sin<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sin((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_sin<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sin((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_sin<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sin((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_sin<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sin((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sin(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_sinh : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sinh((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_sinh<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sinh((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_sinh<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sinh((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_sinh<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sinh((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_sinh<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sinh((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_sinh<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sinh((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sinh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype>
>class _bz_sqr : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype T_numtype;
>
>    static inline T_numtype apply(T_numtype x)
>    { return x*x; }
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqr(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename T>
>class _bz_sqr<complex<T> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<T> T_numtype;
>
>    static inline T_numtype apply(T_numtype x)
>    {
>        T r = x.real(); T i = x.imag();
>        return T_numtype(r*r-i*i, 2*r*i);
>    }
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqr(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_sqrt : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sqrt((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_sqrt<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sqrt((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_sqrt<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sqrt((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_sqrt<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sqrt((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_sqrt<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sqrt((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_sqrt<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::sqrt((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "sqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_tan : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tan((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_tan<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tan((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_tan<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tan((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_tan<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tan((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_tan<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tan((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_tan<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tan((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tan(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_tanh : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tanh((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_tanh<float> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tanh((float)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<>
>class _bz_tanh<long double> : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tanh((long double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<>
>class _bz_tanh<complex<float> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<float> T_numtype1;
>    typedef complex<float> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tanh((complex<float> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<>
>class _bz_tanh<complex<double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<double> T_numtype1;
>    typedef complex<double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tanh((complex<double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<>
>class _bz_tanh<complex<long double> > : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef complex<long double> T_numtype1;
>    typedef complex<long double> T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return std::tanh((complex<long double> )x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "tanh(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 3036 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathfunc.h"
>template<typename P_numtype1>
>class _bz_y0 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::y0((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "y0(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename P_numtype1>
>class _bz_y1 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return ::y1((double)x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "y1(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>
>}
># 401 "/mn/anatu/cma-u3/tmac/usr/include/blitz/applics.h" 2
>
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathf2.h" 1
># 36 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathf2.h"
>namespace blitz {
>
>
>template<typename P_numtype1>
>class _bz_cexp : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return _bz_exp<T_numtype1>::apply(x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "cexp(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_csqrt : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    { return _bz_sqrt<T_numtype1>::apply(x); }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "csqrt(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_pow2 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        return x * x;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow2(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_pow3 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        return x * x *
>          x;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow3(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_pow4 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        T_numtype t1 = x * x;
>        return t1 * t1;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow4(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_pow5 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        T_numtype t1 = x * x;
>        return t1 * t1
>            * t1;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow5(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_pow6 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        T_numtype t1 = x * x
>            * x;
>        return t1 * t1;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow6(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>
>template<typename P_numtype1>
>class _bz_pow7 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        T_numtype t1 = x * x
>            * x;
>        return t1 * t1
>            * x;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow7(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
>
>
>template<typename P_numtype1>
>class _bz_pow8 : public OneOperandApplicativeTemplatesBase {
>public:
>    typedef P_numtype1 T_numtype1;
>    typedef P_numtype1 T_numtype;
>
>    static inline T_numtype apply(T_numtype1 x)
>    {
>        T_numtype t1 = x * x;
>        T_numtype t2 = t1 * t1;
>        return t2 * t2;
>    }
>
>    template<typename T1>
>    static void prettyPrint(std::string &str, prettyPrintFormat& format,
>        const T1& a)
>    {
>        str += "pow8(";
>        a.prettyPrint(str,format);
>        str += ")";
>    }
>};
># 263 "/mn/anatu/cma-u3/tmac/usr/include/blitz/mathf2.h"
>inline int pow2(int x) { return x*x; } inline int pow3(int x) { return x*x*x; } inline int pow4(int x) { int t1 = x*x; return t1*t1; } inline int pow5(int x) { int t1 = x*x; return t1*t1*x; } inline int pow6(int x) { int t1 = x*x*x; return t1*t1; } inline int pow7(int x) { int t1 = x*x; return t1*t1*t1*x; } inline int pow8(int x) { int t1 = x*x, t2=t1*t1; return t2*t2; }
>inline float pow2(float x) { return x*x; } inline float pow3(float x) { return x*x*x; } inline float pow4(float x) { float t1 = x*x; return t1*t1; } inline float pow5(float x) { float t1 = x*x; return t1*t1*x; } inline float pow6(float x) { float t1 = x*x*x; return t1*t1; } inline float pow7(float x) { float t1 = x*x; return t1*t1*t1*x; } inline float pow8(float x) { float t1 = x*x, t2=t1*t1; return t2*t2; }
>inline double pow2(double x) { return x*x; } inline double pow3(double x) { return x*x*x; } inline double pow4(double x) { double t1 = x*x; return t1*t1; } inline double pow5(double x) { double t1 = x*x; return t1*t1*x; } inline double pow6(double x) { double t1 = x*x*x; return t1*t1; } inline double pow7(double x) { double t1 = x*x; return t1*t1*t1*x; } inline double pow8(double x) { double t1 = x*x, t2=t1*t1; return t2*t2; }
>inline long double pow2(long double x) { return x*x; } inline long double pow3(long double x) { return x*x*x; } inline long double pow4(long double x) { long double t1 = x*x; return t1*t1; } inline long double pow5(long double x) { long double t1 = x*x; return t1*t1*x; } inline long double pow6(long double x) { long double t1 = x*x*x; return t1*t1; } inline long double pow7(long double x) { long double t1 = x*x; return t1*t1*t1*x; } inline long double pow8(long double x) { long double t1 = x*x, t2=t1*t1; return t2*t2; }
>
>
>inline complex<float> pow2(complex<float> x) { return x*x; } inline complex<float> pow3(complex<float> x) { return x*x*x; } inline complex<float> pow4(complex<float> x) { complex<float> t1 = x*x; return t1*t1; } inline complex<float> pow5(complex<float> x) { complex<float> t1 = x*x; return t1*t1*x; } inline complex<float> pow6(complex<float> x) { complex<float> t1 = x*x*x; return t1*t1; } inline complex<float> pow7(complex<float> x) { complex<float> t1 = x*x; return t1*t1*t1*x; } inline complex<float> pow8(complex<float> x) { complex<float> t1 = x*x, t2=t1*t1; return t2*t2; }
>inline complex<double> pow2(complex<double> x) { return x*x; } inline complex<double> pow3(complex<double> x) { return x*x*x; } inline complex<double> pow4(complex<double> x) { complex<double> t1 = x*x; return t1*t1; } inline complex<double> pow5(complex<double> x) { complex<double> t1 = x*x; return t1*t1*x; } inline complex<double> pow6(complex<double> x) { complex<double> t1 = x*x*x; return t1*t1; } inline complex<double> pow7(complex<double> x) { complex<double> t1 = x*x; return t1*t1*t1*x; } inline complex<double> pow8(complex<double> x) { complex<double> t1 = x*x, t2=t1*t1; return t2*t2; }
>inline complex<long double> pow2(complex<long double> x) { return x*x; } inline complex<long double> pow3(complex<long double> x) { return x*x*x; } inline complex<long double> pow4(complex<long double> x) { complex<long double> t1 = x*x; return t1*t1; } inline complex<long double> pow5(complex<long double> x) { complex<long double> t1 = x*x; return t1*t1*x; } inline complex<long double> pow6(complex<long double> x) { complex<long double> t1 = x*x*x; return t1*t1; } inline complex<long double> pow7(complex<long double> x) { complex<long double> t1 = x*x; return t1*t1*t1*x; } inline complex<long double> pow8(complex<long double> x) { complex<long double> t1 = x*x, t2=t1*t1; return t2*t2; }
>
>
>}
># 405 "/mn/anatu/cma-u3/tmac/usr/include/blitz/applics.h" 2
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecexpr.h" 2
>
>
>
>namespace blitz {
>
>template<typename P_expr1, typename P_expr2, typename P_op>
>class _bz_VecExprOp {
>
>public:
>    typedef P_expr1 T_expr1;
>    typedef P_expr2 T_expr2;
>    typedef typename T_expr1::T_numtype T_numtype1;
>    typedef typename T_expr2::T_numtype T_numtype2;
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype;
>    typedef P_op T_op;
>
>
>    _bz_VecExprOp(T_expr1 a, T_expr2 b)
>        : iter1_(a), iter2_(b)
>    { }
>
>
>
>
>
>
>
>    _bz_VecExprOp(const _bz_VecExprOp<P_expr1, P_expr2, P_op>& x)
>        : iter1_(x.iter1_), iter2_(x.iter2_)
>    { }
>
>
>    T_numtype operator[](int i) const
>    { return T_op::apply(iter1_[i], iter2_[i]); }
>
>    T_numtype operator()(int i) const
>    { return T_op::apply(iter1_(i), iter2_(i)); }
>
>    int length(int recommendedLength) const
>    {
>        ;
>
>        return iter1_.length(recommendedLength);
>    }
>
>    static const int
>        _bz_staticLengthCount = P_expr1::_bz_staticLengthCount
>                              + P_expr2::_bz_staticLengthCount,
>        _bz_dynamicLengthCount = P_expr1::_bz_dynamicLengthCount
>                               + P_expr2::_bz_dynamicLengthCount,
>        _bz_staticLength =
>            (P_expr1::_bz_staticLength > P_expr2::_bz_staticLength) ?
>            P_expr1::_bz_staticLength : P_expr2::_bz_staticLength;
>
>
>
>    int _bz_suggestLength() const
>    {
>        int length1 = iter1_._bz_suggestLength();
>        if (length1 != 0)
>            return length1;
>        return iter2_._bz_suggestLength();
>    }
>
>    bool _bz_hasFastAccess() const
>    { return iter1_._bz_hasFastAccess() && iter2_._bz_hasFastAccess(); }
>
>    T_numtype _bz_fastAccess(int i) const
>    {
>        return T_op::apply(iter1_._bz_fastAccess(i),
>            iter2_._bz_fastAccess(i));
>    }
>
>private:
>    _bz_VecExprOp();
>
>    T_expr1 iter1_;
>    T_expr2 iter2_;
>};
>
>template<typename P_expr, typename P_unaryOp>
>class _bz_VecExprUnaryOp {
>
>public:
>    typedef P_expr T_expr;
>    typedef P_unaryOp T_unaryOp;
>    typedef typename T_unaryOp::T_numtype T_numtype;
>
>
>    _bz_VecExprUnaryOp(T_expr iter)
>        : iter_(iter)
>    { }
>
>
>
>
>
>
>
>    _bz_VecExprUnaryOp(const _bz_VecExprUnaryOp<P_expr, P_unaryOp>& x)
>        : iter_(x.iter_)
>    { }
>
>
>    T_numtype operator[](int i) const
>    { return T_unaryOp::apply(iter_[i]); }
>
>    T_numtype operator()(int i) const
>    { return T_unaryOp::apply(iter_(i)); }
>
>    int length(int recommendedLength) const
>    { return iter_.length(recommendedLength); }
>
>    static const int
>        _bz_staticLengthCount = P_expr::_bz_staticLengthCount,
>        _bz_dynamicLengthCount = P_expr::_bz_dynamicLengthCount,
>        _bz_staticLength = P_expr::_bz_staticLength;
>
>    int _bz_suggestLength() const
>    { return iter_._bz_suggestLength(); }
>
>    bool _bz_hasFastAccess() const
>    { return iter_._bz_hasFastAccess(); }
>
>    T_numtype _bz_fastAccess(int i) const
>    { return T_unaryOp::apply(iter_._bz_fastAccess(i)); }
>
>private:
>    _bz_VecExprUnaryOp() { }
>
>    T_expr iter_;
>};
>
>template<typename P_numtype>
>class _bz_VecExprConstant {
>public:
>    typedef P_numtype T_numtype;
>
>    _bz_VecExprConstant(P_numtype value)
>        : value_(value)
>    {
>    }
>
>
>    _bz_VecExprConstant(const _bz_VecExprConstant<P_numtype>& x)
>        : value_(x.value_)
>    { }
>
>
>    T_numtype operator[](int) const
>    { return value_; }
>
>    T_numtype operator()(int) const
>    { return value_; }
>
>    int length(int recommendedLength) const
>    { return recommendedLength; }
>
>    static const int
>        _bz_staticLengthCount = 0,
>        _bz_dynamicLengthCount = 0,
>        _bz_staticLength = 0;
>
>    int _bz_suggestLength() const
>    { return 0; }
>
>    bool _bz_hasFastAccess() const
>    { return 1; }
>
>    T_numtype _bz_fastAccess(int) const
>    { return value_; }
>
>private:
>
>    _bz_VecExprConstant() { }
>
>    T_numtype value_;
>};
>
>}
>
>
>
>
>
>
>
>namespace blitz {
>
>
>
>template<typename P_expr>
>inline
>_bz_VecExpr<_bz_VecExprUnaryOp<_bz_VecExpr<P_expr>,
>    _bz_negate<typename P_expr::T_numtype> > >
>operator-(_bz_VecExpr<P_expr> a)
>{
>    typedef _bz_VecExprUnaryOp<_bz_VecExpr<P_expr>,
>        _bz_negate<typename P_expr::T_numtype> > T_expr;
>    return _bz_VecExpr<T_expr>(T_expr(a));
>}
>
>template<typename P_numtype>
>inline
>_bz_VecExpr<_bz_VecExprUnaryOp<VectorIterConst<P_numtype>,
>    _bz_negate<P_numtype> > >
>operator-(const Vector<P_numtype>& a)
>{
>    typedef _bz_VecExprUnaryOp<VectorIterConst<P_numtype>,
>        _bz_negate<P_numtype> > T_expr;
>
>    return _bz_VecExpr<T_expr>(T_expr(a.beginFast()));
>}
>
>inline
>_bz_VecExpr<_bz_VecExprUnaryOp<Range, _bz_negate<Range::T_numtype> > >
>operator-(Range r)
>{
>    typedef _bz_VecExprUnaryOp<Range, _bz_negate<Range::T_numtype> > T_expr;
>
>    return _bz_VecExpr<T_expr>(T_expr(r));
>}
>
>template<typename P_numtype>
>inline
>_bz_VecExpr<_bz_VecExprUnaryOp<VectorPickIterConst<P_numtype>,
>    _bz_negate<P_numtype> > >
>operator-(const VectorPick<P_numtype>& a)
>{
>    typedef _bz_VecExprUnaryOp<VectorPickIterConst<P_numtype>,
>        _bz_negate<P_numtype> > T_expr;
>
>    return _bz_VecExpr<T_expr>(T_expr(a.beginFast()));
>}
>
>template<typename P_numtype, int N_length>
>inline
>_bz_VecExpr<_bz_VecExprUnaryOp<TinyVectorIterConst<P_numtype,N_length>,
>    _bz_negate<P_numtype> > >
>operator-(const TinyVector<P_numtype,N_length>& a)
>{
>    typedef _bz_VecExprUnaryOp<TinyVectorIterConst<P_numtype,N_length>,
>        _bz_negate<P_numtype> > T_expr;
>
>    return _bz_VecExpr<T_expr>(T_expr(a.beginFast()));
>}
>
>}
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc" 2
>
>namespace blitz {
>
>
>
>
>
>template<typename P_numtype> template<typename P_expr, typename P_updater>
>inline
>void VectorPick<P_numtype>::_bz_assign(P_expr expr, P_updater)
>{
>    ;
>
>
>
>
>    if (_bz_hasFastAccess() && expr._bz_hasFastAccess())
>    {
>
>        for (int i=0; i < length(); ++i)
>            P_updater::update(vector_(index_(i)), expr._bz_fastAccess(i));
># 55 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc"
>    }
>    else {
>
>
>        for (int i=0; i < length(); ++i)
>            P_updater::update(vector_[index_[i]], expr[i]);
>    }
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator=(_bz_VecExpr<P_expr> expr)
>{
>    ;
>
>
>
>
>    if (_bz_hasFastAccess() && expr._bz_hasFastAccess())
>    {
>
>        for (int i=0; i < length(); ++i)
>            (*this)(i) = expr._bz_fastAccess(i);
># 95 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.cc"
>    }
>    else {
>
>
>        for (int i=0; i < length(); ++i)
>            (*this)[i] = expr[i];
>    }
>    return *this;
>}
>
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator+=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_plus_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator-=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_minus_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator*=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_multiply_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator/=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_divide_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator%=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_mod_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator^=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_xor_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator&=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_bitand_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator|=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_bitor_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator>>=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_shiftr_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator<<=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_shiftl_update<P_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) = _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator+=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) += _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator-=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) -= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator*=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) *= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator/=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) /= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator%=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) %= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator^=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) ^= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator&=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) &= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator|=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) |= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator>>=(int x)
>{
>    typedef _bz_VecExprConstant<int> T_expr;
>    (*this) >>= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator<<=(int x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) <<= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator=(const Vector<P_numtype2>& x)
>{
>    (*this) = _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator+=(const Vector<P_numtype2>& x)
>{
>    (*this) += _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator-=(const Vector<P_numtype2>& x)
>{
>    (*this) -= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator*=(const Vector<P_numtype2>& x)
>{
>    (*this) *= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator/=(const Vector<P_numtype2>& x)
>{
>    (*this) /= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator%=(const Vector<P_numtype2>& x)
>{
>    (*this) %= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator^=(const Vector<P_numtype2>& x)
>{
>    (*this) ^= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator&=(const Vector<P_numtype2>& x)
>{
>    (*this) &= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator|=(const Vector<P_numtype2>& x)
>{
>    (*this) |= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator<<=(const Vector<P_numtype2>& x)
>{
>    (*this) <<= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator>>=(const Vector<P_numtype2>& x)
>{
>    (*this) >>= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator=(Range r)
>{
>    (*this) = _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator+=(Range r)
>{
>    (*this) += _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator-=(Range r)
>{
>    (*this) -= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator*=(Range r)
>{
>    (*this) *= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator/=(Range r)
>{
>    (*this) /= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator%=(Range r)
>{
>    (*this) %= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator^=(Range r)
>{
>    (*this) ^= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator&=(Range r)
>{
>    (*this) &= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator|=(Range r)
>{
>    (*this) |= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator>>=(Range r)
>{
>    (*this) >>= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator<<=(Range r)
>{
>    (*this) <<= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) = _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator+=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) += _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator-=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) -= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator*=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) *= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator/=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) /= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator%=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) %= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator^=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) ^= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator&=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) &= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline VectorPick<P_numtype>& VectorPick<P_numtype>::operator|=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) |= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator=(Random<P_distribution>& rand)
>{
>    (*this) = _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator+=(Random<P_distribution>& rand)
>{
>    (*this) += _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator-=(Random<P_distribution>& rand)
>{
>    (*this) -= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator*=(Random<P_distribution>& rand)
>{
>    (*this) *= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator/=(Random<P_distribution>& rand)
>{
>    (*this) /= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator%=(Random<P_distribution>& rand)
>{
>    (*this) %= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator^=(Random<P_distribution>& rand)
>{
>    (*this) ^= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator&=(Random<P_distribution>& rand)
>{
>    (*this) &= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_distribution>
>VectorPick<P_numtype>&
>VectorPick<P_numtype>::operator|=(Random<P_distribution>& rand)
>{
>    (*this) |= _bz_VecExpr<_bz_VecExprRandom<P_distribution> >
>        (_bz_VecExprRandom<P_distribution>(rand));
>    return *this;
>}
>
>}
># 294 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpickio.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpickio.cc"
>namespace blitz {
>
>template<typename P_numtype>
>ostream& operator<<(ostream& os, const VectorPick<P_numtype>& x)
>{
>    Vector<P_numtype> y(x.length());
>    y = x;
>    os << y;
>    return os;
>}
>
>}
># 295 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpickiter.h" 1
># 35 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpickiter.h"
>namespace blitz {
>
>template<typename P_numtype>
>class VectorPickIter {
>
>public:
>    typedef P_numtype T_numtype;
>
>    explicit VectorPickIter(VectorPick<T_numtype>& x)
>        : data_(x.vector().data()), index_(x.indexSet().data())
>    {
>        dataStride_ = x.vector().stride();
>        indexStride_ = x.indexSet().stride();
>        length_ = x.indexSet().length();
>    }
>
>
>    VectorPickIter(const VectorPickIter<T_numtype>& x)
>    {
>        data_ = x.data_;
>        index_ = x.index_;
>        dataStride_ = x.dataStride_;
>        indexStride_ = x.indexStride_;
>        length_ = x.length_;
>    }
>
>
>    T_numtype operator[](int i) const
>    {
>        ;
>        return data_[dataStride_ * index_[i * indexStride_]];
>    }
>
>    T_numtype& operator[](int i)
>    {
>        ;
>        return data_[dataStride_ * index_[i * indexStride_]];
>    }
>
>    int length(int) const
>    { return length_; }
>
>    int _bz_suggestLength() const
>    { return length_; }
>
>    bool isUnitStride() const
>    { return (dataStride_ == 1) && (indexStride_ == 1); }
>
>    bool _bz_hasFastAccess() const
>    { return isUnitStride(); }
>
>    T_numtype _bz_fastAccess(int i) const
>    {
>         return data_[index_[i]];
>    }
>
>    T_numtype& _bz_fastAccess(int i)
>    {
>         return data_[index_[i]];
>    }
>
>    static const int
>        _bz_staticLengthCount = 0,
>        _bz_dynamicLengthCount = 1,
>        _bz_staticLength = 0;
>
>private:
>    T_numtype * __restrict__ data_;
>    int dataStride_;
>    const int * __restrict__ index_;
>    int indexStride_;
>    int length_;
>};
>
>template<typename P_numtype>
>class VectorPickIterConst {
>
>public:
>    typedef P_numtype T_numtype;
>
>    explicit VectorPickIterConst(const VectorPick<T_numtype>& x)
>        : data_(x.vector().data()), index_(x.indexSet().data())
>    {
>        dataStride_ = x.vector().stride();
>        indexStride_ = x.indexSet().stride();
>        length_ = x.indexSet().length();
>    }
>
>
>    VectorPickIterConst(const VectorPickIterConst<T_numtype>& x)
>    {
>        data_ = x.data_;
>        index_ = x.index_;
>        dataStride_ = x.dataStride_;
>        indexStride_ = x.indexStride_;
>        length_ = x.length_;
>    }
>
>
>    T_numtype operator[](int i) const
>    {
>        ;
>        return data_[dataStride_ * index_[i * indexStride_]];
>    }
>
>    int length(int) const
>    { return length_; }
>
>    int _bz_suggestLength() const
>    { return length_; }
>
>    bool isUnitStride() const
>    { return (dataStride_ == 1) && (indexStride_ == 1); }
>
>    bool _bz_hasFastAccess() const
>    { return isUnitStride(); }
>
>    T_numtype _bz_fastAccess(int i) const
>    {
>         return data_[index_[i]];
>    }
>
>    static const int
>        _bz_staticLengthCount = 0,
>        _bz_dynamicLengthCount = 1,
>        _bz_staticLength = 0;
>
>private:
>    const T_numtype * __restrict__ data_;
>    int dataStride_;
>    const int * __restrict__ index_;
>    int indexStride_;
>    int length_;
>};
>
>}
># 296 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecpick.h" 2
># 450 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 2
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.h" 1
># 42 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/extremum.h" 1
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/extremum.h"
>namespace blitz {
>
>
>
>
>
>
>template<typename P_numtype, typename P_index>
>class Extremum {
>public:
>    typedef P_numtype T_numtype;
>    typedef P_index T_index;
>
>    Extremum(T_numtype value, T_index index)
>        : value_(value), index_(index)
>    { }
>
>    T_numtype value() const
>    { return value_; }
>
>    T_index index() const
>    { return index_; }
>
>    void setValue(T_numtype value)
>    { value_ = value; }
>
>    void setIndex(T_index index)
>    { index_ = index; }
>
>    operator T_numtype() const
>    { return value_; }
>
>protected:
>    T_numtype value_;
>    T_index index_;
>};
>
>}
># 43 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.h" 2
>
>
>
>namespace blitz {
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecaccum.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecaccum.cc"
>namespace blitz {
>
>template<typename P>
>inline
>Vector<typename NumericTypeTraits<typename P::T_numtype>::T_sumtype> _bz_vec_accumulate(P expr)
>{
>    typedef typename NumericTypeTraits<typename P::T_numtype>::T_sumtype T_sumtype;
>    int length = expr._bz_suggestLength();
>    Vector<T_sumtype> z(length);
>    T_sumtype sum = 0;
>
>    if (expr._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>        {
>            sum += expr._bz_fastAccess(i);
>            z[i] = sum;
>        }
>    }
>    else {
>        for (int i=0; i < length; ++i)
>        {
>            sum += expr(i);
>            z[i] = sum;
>        }
>    }
>
>    return z;
>}
>template<typename P_numtype>
>Vector<typename NumericTypeTraits<P_numtype>::T_sumtype> accumulate(const Vector<P_numtype>& x)
>{
>    return _bz_vec_accumulate(x);
>}
>
>template<typename P_expr>
>Vector<typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype>
>accumulate(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_accumulate(x);
>}
>
>template<typename P_numtype>
>Vector<typename NumericTypeTraits<P_numtype>::T_sumtype> accumulate(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_accumulate(x);
>}
>
>}
># 18 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecdelta.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecdelta.cc"
>namespace blitz {
>
>template<typename P>
>inline
>Vector<typename NumericTypeTraits<typename P::T_numtype>::T_difftype> _bz_vec_delta(P expr)
>{
>    typedef typename P::T_numtype T_numtype;
>    typedef typename NumericTypeTraits<T_numtype>::T_difftype T_difftype;
>
>    int length = expr._bz_suggestLength();
>    Vector<T_difftype> z(length);
>    T_numtype currentElement = 0;
>    T_numtype previousElement = 0;
>
>    if (expr._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>        {
>            currentElement = expr._bz_fastAccess(i);
>            z[i] = currentElement - previousElement;
>            previousElement = currentElement;
>        }
>    }
>    else {
>        for (int i=1; i < length; ++i)
>        {
>            currentElement = expr(i);
>            z[i] = currentElement - previousElement;
>            previousElement = currentElement;
>        }
>    }
>
>    return z;
>}
>
>template<typename P_numtype>
>Vector<typename NumericTypeTraits<P_numtype>::T_difftype> delta(const Vector<P_numtype>& x)
>{
>    return _bz_vec_delta(x);
>}
>
>
>template<typename P_expr>
>Vector<typename NumericTypeTraits<typename P_expr::T_numtype>::T_difftype> delta(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_delta(x);
>}
>
>
>template<typename P_numtype>
>Vector<typename NumericTypeTraits<P_numtype>::T_difftype> delta(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_delta(x);
>}
>
>}
># 19 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecmin.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecmin.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline
>Extremum<typename P_expr::T_numtype, int> _bz_vec_min(P_expr vector)
>{
>    typedef typename P_expr::T_numtype T_numtype;
>
>    T_numtype minValue = vector(0);
>    int minIndex = 0;
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=1; i < length; ++i)
>        {
>            T_numtype value = vector._bz_fastAccess(i);
>            if (value < minValue)
>            {
>                minValue = value;
>                minIndex = i;
>            }
>        }
>    }
>    else {
>        for (int i=1; i < length; ++i)
>        {
>            T_numtype value = vector(i);
>            if (value < minValue)
>            {
>                minValue = value;
>                minIndex = i;
>            }
>        }
>    }
>
>    return Extremum<T_numtype, int>(minValue, minIndex);
>}
>
>
>template<typename P_numtype>
>inline
>Extremum<P_numtype,int> (min)(const Vector<P_numtype>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr());
>}
>
>
>template<typename P_expr>
>inline
>Extremum<typename P_expr::T_numtype,int> (min)(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_min(x);
>}
>
>
>template<typename P_numtype>
>inline
>Extremum<P_numtype, int> (min)(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr());
>}
>
>
>template<typename P_numtype, int N_length>
>inline
>Extremum<P_numtype, int> (min)(const TinyVector<P_numtype, N_length>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr());
>}
>
>
>template<typename P_numtype>
>inline
>int minIndex(const Vector<P_numtype>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr()).index();
>}
>
>
>template<typename P_expr>
>inline
>int minIndex(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_min(x).index();
>}
>
>
>template<typename P_numtype>
>int minIndex(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr()).index();
>}
>
>
>template<typename P_numtype, int N_length>
>int minIndex(const TinyVector<P_numtype, N_length>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr()).index();
>}
>
>
>template<typename P_numtype>
>inline
>int minValue(const Vector<P_numtype>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr()).value();
>}
>
>
>template<typename P_expr>
>inline
>int minValue(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_min(x).value();
>}
>
>
>template<typename P_numtype>
>int minValue(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr()).value();
>}
>
>
>template<typename P_numtype, int N_length>
>int minValue(const TinyVector<P_numtype, N_length>& x)
>{
>    return _bz_vec_min(x._bz_asVecExpr()).value();
>}
>
>}
># 20 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecmax.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecmax.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline
>Extremum<typename P_expr::T_numtype, int> _bz_vec_max(P_expr vector)
>{
>    typedef typename P_expr::T_numtype T_numtype;
>
>    T_numtype maxValue = vector(0);
>    int maxIndex = 0;
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=1; i < length; ++i)
>        {
>            T_numtype value = vector._bz_fastAccess(i);
>            if (value > maxValue)
>            {
>                maxValue = value;
>                maxIndex = i;
>            }
>        }
>    }
>    else {
>        for (int i=1; i < length; ++i)
>        {
>            T_numtype value = vector(i);
>            if (value > maxValue)
>            {
>                maxValue = value;
>                maxIndex = i;
>            }
>        }
>    }
>
>    return Extremum<T_numtype, int>(maxValue, maxIndex);
>}
>
>
>template<typename P_numtype>
>inline
>Extremum<P_numtype, int> (max)(const Vector<P_numtype>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr());
>}
>
>
>template<typename P_expr>
>inline
>Extremum<typename P_expr::T_numtype,int> (max)(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_max(x);
>}
>
>
>template<typename P_numtype>
>inline
>Extremum<P_numtype, int> (max)(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr());
>}
>
>
>template<typename P_numtype, int N_length>
>inline
>Extremum<P_numtype, int> (max)(const TinyVector<P_numtype, N_length>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr());
>}
>
>
>
>template<typename P_numtype>
>inline
>int maxIndex(const Vector<P_numtype>& x)
>{
>    return _bz_vec_max(x).index();
>}
>
>
>template<typename P_expr>
>inline
>int maxIndex(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_max(x._bz_asVecExpr()).index();
>}
>
>
>template<typename P_numtype>
>int maxIndex(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr()).index();
>}
>
>
>template<typename P_numtype, int N_length>
>int maxIndex(const TinyVector<P_numtype, N_length>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr()).index();
>}
>
>
>template<typename P_numtype>
>inline
>int maxValue(const Vector<P_numtype>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr()).value();
>}
>
>
>template<typename P_expr>
>inline
>int maxValue(_bz_VecExpr<P_expr> x)
>{
>    return _bz_vec_max(x).value();
>}
>
>
>template<typename P_numtype>
>int maxValue(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr()).value();
>}
>
>
>template<typename P_numtype, int N_length>
>int maxValue(const TinyVector<P_numtype, N_length>& x)
>{
>    return _bz_vec_max(x._bz_asVecExpr()).value();
>}
>
>}
># 21 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecsum.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecsum.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline
>typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype
>_bz_vec_sum(P_expr vector)
>{
>    typedef typename P_expr::T_numtype T_numtype;
>    typedef typename NumericTypeTraits<T_numtype>::T_sumtype T_sumtype;
>
>    T_sumtype sum = 0;
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>            sum += vector._bz_fastAccess(i);
>    }
>    else {
>        for (int i=0; i < length; ++i)
>            sum += vector(i);
>    }
>
>    return sum;
>}
>
>template<typename P_numtype>
>inline
>typename NumericTypeTraits<P_numtype>::T_sumtype sum(const Vector<P_numtype>& x)
>{
>    return _bz_vec_sum(x._bz_asVecExpr());
>}
>
>
>template<typename P_expr>
>inline
>typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype
>sum(_bz_VecExpr<P_expr> expr)
>{
>    return _bz_vec_sum(expr);
>}
>
>
>template<typename P_numtype>
>inline
>typename NumericTypeTraits<P_numtype>::T_sumtype
>sum(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_sum(x._bz_asVecExpr());
>}
>
>
>template<typename P_numtype>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype mean(const Vector<P_numtype>& x)
>{
>    ;
>
>    typedef typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype T_floattype;
>    return _bz_vec_sum(x._bz_asVecExpr()) / (T_floattype) x.length();
>}
>
>
>template<typename P_expr>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype>::T_floattype
>mean(_bz_VecExpr<P_expr> expr)
>{
>    ;
>
>    typedef typename NumericTypeTraits<typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype>::T_floattype
>        T_floattype;
>    return _bz_vec_sum(expr) / (T_floattype) expr._bz_suggestLength();
>}
>
>
>template<typename P_numtype>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype
>mean(const VectorPick<P_numtype>& x)
>{
>    ;
>
>    typedef typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype T_floattype;
>    return _bz_vec_sum(x._bz_asVecExpr()) / (T_floattype) x.length();
>}
>
>}
># 22 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecdot.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecdot.cc"
>namespace blitz {
>
>template<typename P1, typename P2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<typename P1::T_numtype,typename P2::T_numtype>::T_promote>::T_sumtype
>_bz_dot(P1 vector1, P2 vector2)
>{
>    ;
>
>    typedef typename NumericTypeTraits<typename blitz::promote_trait<typename P1::T_numtype,typename P2::T_numtype>::T_promote>::T_sumtype T_sumtype;
>
>
>    T_sumtype sum = 0;
>    int length = vector1._bz_suggestLength();
>
>    if (vector1._bz_hasFastAccess() && vector2._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>            sum += vector1._bz_fastAccess(i)
>                * vector2._bz_fastAccess(i);
>    }
>    else {
>        for (int i=0; i < length; ++i)
>            sum += vector1[i] * vector2[i];
>    }
>
>    return sum;
>}
>
>
>
>template<typename P_numtype1, typename P_numtype2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<P_numtype1,P_numtype2>::T_promote>::T_sumtype
>dot(const Vector<P_numtype1>& a, const Vector<P_numtype2>& b)
>{
>    return _bz_dot(a, b);
>}
>
>
>template<typename P_expr1, typename P_expr2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<typename P_expr1::T_numtype,typename P_expr2::T_numtype>::T_promote>::T_sumtype
>
>dot(_bz_VecExpr<P_expr1> expr1, _bz_VecExpr<P_expr2> expr2)
>{
>    return _bz_dot(expr1, expr2);
>}
>
>
>template<typename P_expr1, typename P_numtype2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<typename P_expr1::T_numtype,P_numtype2>::T_promote>::T_sumtype
>dot(_bz_VecExpr<P_expr1> expr1, const Vector<P_numtype2>& vector2)
>{
>    return _bz_dot(vector2, expr1);
>}
>
>
>template<typename P_numtype1, typename P_expr2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<P_numtype1,typename P_expr2::T_numtype>::T_promote>::T_sumtype
>dot(const Vector<P_numtype1>& vector1, _bz_VecExpr<P_expr2> expr2)
>{
>    return _bz_dot(vector1, expr2);
>}
>
>
>template<typename P_numtype1, typename P_numtype2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<P_numtype1,P_numtype2>::T_promote>::T_sumtype
>dot(const Vector<P_numtype1>& vector1, const VectorPick<P_numtype2>& vector2)
>{
>    return _bz_dot(vector1, vector2);
>}
>
>
>template<typename P_numtype1, typename P_numtype2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<P_numtype1,P_numtype2>::T_promote>::T_sumtype
>dot(const VectorPick<P_numtype1>& vector1, const Vector<P_numtype2>& vector2)
>{
>    return _bz_dot(vector1, vector2);
>}
>
>
>template<typename P_numtype1, typename P_numtype2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<P_numtype1,P_numtype2>::T_promote>::T_sumtype
>dot(const VectorPick<P_numtype1>& vector1, const VectorPick<P_numtype2>& vector2)
>{
>    return _bz_dot(vector1, vector2);
>}
>
>
>template<typename P_expr1, typename P_numtype2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<typename P_expr1::T_numtype,P_numtype2>::T_promote>::T_sumtype
>dot(_bz_VecExpr<P_expr1> expr1, const VectorPick<P_numtype2>& vector2)
>{
>    return _bz_dot(expr1, vector2);
>}
>
>
>template<typename P_numtype1, typename P_expr2>
>inline
>typename NumericTypeTraits<typename blitz::promote_trait<P_numtype1,typename P_expr2::T_numtype>::T_promote>::T_sumtype
>dot(const VectorPick<P_numtype1>& vector1, _bz_VecExpr<P_expr2> expr2)
>{
>    return _bz_dot(vector1, expr2);
>}
>
>}
># 23 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecnorm.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecnorm.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype>::T_floattype
>_bz_vec_norm(P_expr vector)
>{
>
>
>
>
>
>    typedef typename P_expr::T_numtype T_numtype;
>    typedef typename NumericTypeTraits<T_numtype>::T_sumtype T_sumtype;
>    typedef typename NumericTypeTraits<T_sumtype>::T_floattype T_floattype;
>
>    T_sumtype sum = 0;
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>        {
>            T_numtype value = vector._bz_fastAccess(i);
>            sum += value * T_sumtype(value);
>        }
>    }
>    else {
>        for (int i=0; i < length; ++i)
>        {
>            T_numtype value = vector(i);
>            sum += value * T_sumtype(value);
>        }
>    }
>
>    return _bz_sqrt<T_floattype>::apply(sum);
>}
>
>template<typename P_numtype>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype norm(const Vector<P_numtype>& x)
>{
>    return _bz_vec_norm(x._bz_asVecExpr());
>}
>
>
>template<typename P_expr>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype>::T_floattype
>norm(_bz_VecExpr<P_expr> expr)
>{
>    return _bz_vec_norm(expr);
>}
>
>
>template<typename P_numtype>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype
>norm(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_norm(x._bz_asVecExpr());
>}
>
>
>template<typename P_numtype, int N_dimensions>
>inline
>typename NumericTypeTraits<typename NumericTypeTraits<P_numtype>::T_sumtype>::T_floattype
>norm(const TinyVector<P_numtype, N_dimensions>& x)
>{
>    return _bz_vec_norm(x._bz_asVecExpr());
>}
>
>}
># 24 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecnorm1.cc" 1
># 19 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecnorm1.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline
>typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype
>_bz_vec_norm1(P_expr vector)
>{
>    typedef typename P_expr::T_numtype T_numtype;
>    typedef typename NumericTypeTraits<T_numtype>::T_sumtype T_sumtype;
>
>    T_sumtype sum = 0;
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>            sum += _bz_abs<T_numtype>::apply(vector._bz_fastAccess(i));
>    }
>    else {
>        for (int i=0; i < length; ++i)
>            sum += _bz_abs<T_numtype>::apply(vector(i));
>    }
>
>    return sum;
>}
>
>
>template<typename P_numtype>
>typename NumericTypeTraits<P_numtype>::T_sumtype norm1(const Vector<P_numtype>& x)
>{
>    return _bz_vec_norm1(x._bz_asVecExpr());
>}
>
>
>template<typename P_expr>
>typename NumericTypeTraits<typename P_expr::T_numtype>::T_sumtype norm1(_bz_VecExpr<P_expr> expr)
>{
>    return _bz_vec_norm1(expr);
>}
>
>
>template<typename P_numtype>
>typename NumericTypeTraits<P_numtype>::T_sumtype norm1(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_norm1(x._bz_asVecExpr());
>}
>
>
>template<typename P_numtype, int N_dimensions>
>typename NumericTypeTraits<P_numtype>::T_sumtype norm1(const TinyVector<P_numtype, N_dimensions>& x)
>{
>    return _bz_vec_norm1(x._bz_asVecExpr());
>}
>
>
>}
># 25 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecany.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecany.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline bool _bz_vec_any(P_expr vector)
>{
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>            if (vector._bz_fastAccess(i))
>                return true;
>    }
>    else {
>        for (int i=0; i < length; ++i)
>            if (vector[i])
>                return true;
>    }
>
>    return false;
>}
>
>template<typename P_numtype>
>inline bool any(const Vector<P_numtype>& x)
>{
>    return _bz_vec_any(x._bz_asVecExpr());
>}
>
>template<typename P_expr>
>inline bool any(_bz_VecExpr<P_expr> expr)
>{
>    return _bz_vec_any(expr);
>}
>
>template<typename P_numtype>
>inline bool any(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_any(x._bz_asVecExpr());
>}
>
>template<typename P_numtype, int N_dimensions>
>inline bool any(const TinyVector<P_numtype, N_dimensions>& x)
>{
>    return _bz_vec_any(x._bz_asVecExpr());
>}
>
>}
># 26 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecall.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecall.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline bool _bz_vec_all(P_expr vector)
>{
>    int length = vector._bz_suggestLength();
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>            if (!vector._bz_fastAccess(i))
>                return false;
>    }
>    else {
>        for (int i=0; i < length; ++i)
>            if (!vector[i])
>                return false;
>    }
>
>    return true;
>}
>
>template<typename P_numtype>
>inline bool all(const Vector<P_numtype>& x)
>{
>    return _bz_vec_all(x._bz_asVecExpr());
>}
>
>template<typename P_expr>
>inline bool all(_bz_VecExpr<P_expr> expr)
>{
>    return _bz_vec_all(expr);
>}
>
>template<typename P_numtype>
>inline bool all(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_all(x._bz_asVecExpr());
>}
>
>template<typename P_numtype, int N_dimensions>
>inline bool all(const TinyVector<P_numtype, N_dimensions>& x)
>{
>    return _bz_vec_all(x._bz_asVecExpr());
>}
>
>}
># 27 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/veccount.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/veccount.cc"
>namespace blitz {
>
>template<typename P_expr>
>inline int _bz_vec_count(P_expr vector)
>{
>    int length = vector._bz_suggestLength();
>    int count = 0;
>
>    if (vector._bz_hasFastAccess())
>    {
>        for (int i=0; i < length; ++i)
>            if (vector._bz_fastAccess(i))
>                ++count;
>    }
>    else {
>        for (int i=0; i < length; ++i)
>            if (vector[i])
>                ++count;
>    }
>
>    return count;
>}
>
>template<typename P_numtype>
>inline int count(const Vector<P_numtype>& x)
>{
>    return _bz_vec_count(x._bz_asVecExpr());
>}
>
>template<typename P_expr>
>inline int count(_bz_VecExpr<P_expr> expr)
>{
>    return _bz_vec_count(expr);
>}
>
>template<typename P_numtype>
>inline int count(const VectorPick<P_numtype>& x)
>{
>    return _bz_vec_count(x._bz_asVecExpr());
>}
>
>template<typename P_numtype, int N_dimensions>
>inline int count(const TinyVector<P_numtype, N_dimensions>& x)
>{
>    return _bz_vec_count(x._bz_asVecExpr());
>}
>
>}
># 28 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.cc" 2
># 51 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecglobs.h" 2
># 452 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc" 1
># 16 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>namespace blitz {
>
>template<typename P_numtype>
>Vector<P_numtype> Vector<P_numtype>::copy() const
>{
>    Vector<P_numtype> newCopy(length_);
>
>    if (stride_ == 1)
>    {
>        memcpy(newCopy.data(), data(), length_ * sizeof(P_numtype));
>    }
>    else {
>        for (int i=0; i < length_; ++i)
>        {
>
>
>
>            newCopy(i) = (*this)[i];
>        }
>    }
>
>    return newCopy;
>}
>
>template<typename P_numtype>
>void Vector<P_numtype>::makeUnique()
>{
>    if ((stride_ != 1) || (this->numReferences() > 1))
>    {
>        Vector<P_numtype> tmp = copy();
>        reference(tmp);
>    }
>}
>
>template<typename P_numtype>
>void Vector<P_numtype>::reference(Vector<P_numtype>& x)
>{
>    MemoryBlockReference<P_numtype>::changeBlock(x);
>    length_ = x.length_;
>    stride_ = x.stride_;
>}
>
>template<typename P_numtype>
>void Vector<P_numtype>::resize(int length)
>{
>    if (length != length_)
>    {
>        MemoryBlockReference<P_numtype>::newBlock(length);
>        length_ = length;
>        stride_ = 1;
>    }
>}
>
>template<typename P_numtype>
>void Vector<P_numtype>::resizeAndPreserve(int newLength)
>{
>    Vector<P_numtype> newVector(newLength);
>
>    if (newLength > length_)
>        newVector(Range(0,length_-1)) = (*this);
>    else
>        newVector(Range(0,newLength-1)) = (*this);
>
>    reference(newVector);
>}
>
>
>
>
>
>template<typename P_numtype> template<typename P_expr, typename P_updater>
>inline
>void Vector<P_numtype>::_bz_assign(P_expr expr, P_updater)
>{
>    ;
>
>
>
>
>    if ((stride_ == 1) && (expr._bz_hasFastAccess()))
>    {
>
>        for (int i=0; i < length_; ++i)
>            P_updater::update(data_[i], expr._bz_fastAccess(i));
># 132 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>    }
>    else {
>
>
>        for (int i=0; i < length_; ++i)
>            P_updater::update((*this)[i], expr[i]);
>    }
>}
>
>template<typename P_numtype> template<typename P_expr>
>inline Vector<P_numtype>& Vector<P_numtype>::operator=(_bz_VecExpr<P_expr> expr)
>{
>    ;
>
>
>
>
>    if ((stride_ == 1) && (expr._bz_hasFastAccess()))
>    {
>
>        for (int i=0; i < length_; ++i)
>            data_[i] = (P_numtype)expr._bz_fastAccess(i);
># 186 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>    }
>    else {
>
>
>        for (int i=0; i < length_; ++i)
>            (*this)[i] = (P_numtype)expr[i];
>    }
>    return *this;
>}
># 294 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator += (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] += expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] += expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator -= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] -= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] -= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator *= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] *= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] *= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator /= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] /= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] /= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator %= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] %= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] %= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator ^= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] ^= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] ^= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator &= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] &= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] &= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator |= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] |= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] |= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator >>= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] >>= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] >>= expr[i]; } return *this; }
>template<typename P_numtype> template<typename P_expr> inline Vector<P_numtype>& Vector<P_numtype>:: operator <<= (_bz_VecExpr<P_expr> expr) { ; if ((stride_ == 1) && (expr._bz_hasFastAccess())) { for (int i=0; i < length_; ++i) data_[i] <<= expr._bz_fastAccess(i); } else { for (int i=0; i < length_; ++i) (*this)[i] <<= expr[i]; } return *this; }
># 392 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::initialize(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) = _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator+=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) += _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator-=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) -= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator*=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) *= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator/=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) /= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator%=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) %= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator^=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) ^= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator&=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) &= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator|=(P_numtype x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) |= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator>>=(int x)
>{
>    typedef _bz_VecExprConstant<int> T_expr;
>    (*this) >>= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator<<=(int x)
>{
>    typedef _bz_VecExprConstant<P_numtype> T_expr;
>    (*this) <<= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
># 502 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator=(const Vector<P_numtype2>& x)
>{
>    (*this) = _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator+=(const Vector<P_numtype2>& x)
>{
>    (*this) += _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator-=(const Vector<P_numtype2>& x)
>{
>    (*this) -= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator*=(const Vector<P_numtype2>& x)
>{
>    (*this) *= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator/=(const Vector<P_numtype2>& x)
>{
>    (*this) /= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator%=(const Vector<P_numtype2>& x)
>{
>    (*this) %= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator^=(const Vector<P_numtype2>& x)
>{
>    (*this) ^= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator&=(const Vector<P_numtype2>& x)
>{
>    (*this) &= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator|=(const Vector<P_numtype2>& x)
>{
>    (*this) |= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator<<=(const Vector<P_numtype2>& x)
>{
>    (*this) <<= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>&
>Vector<P_numtype>::operator>>=(const Vector<P_numtype2>& x)
>{
>    (*this) >>= _bz_VecExpr<VectorIterConst<P_numtype2> >(x.beginFast());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator=(Range r)
>{
>    (*this) = _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator+=(Range r)
>{
>    (*this) += _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator-=(Range r)
>{
>    (*this) -= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator*=(Range r)
>{
>    (*this) *= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator/=(Range r)
>{
>    (*this) /= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator%=(Range r)
>{
>    (*this) %= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator^=(Range r)
>{
>    (*this) ^= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator&=(Range r)
>{
>    (*this) &= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator|=(Range r)
>{
>    (*this) |= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator>>=(Range r)
>{
>    (*this) >>= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>template<typename P_numtype>
>inline Vector<P_numtype>& Vector<P_numtype>::operator<<=(Range r)
>{
>    (*this) <<= _bz_VecExpr<Range>(r);
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) = _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator+=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) += _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator-=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) -= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator*=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) *= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator/=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) /= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator%=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) %= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator^=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) ^= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator&=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) &= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype> template<typename P_numtype2>
>inline Vector<P_numtype>& Vector<P_numtype>::operator|=(const
>    VectorPick<P_numtype2>& x)
>{
>    typedef VectorPickIterConst<P_numtype2> T_expr;
>    (*this) |= _bz_VecExpr<T_expr>(x.beginFast());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype> template<typename P_distribution>
>Vector<P_numtype>& Vector<P_numtype>::operator=(Random<P_distribution>& rand)
>{
>    for (int i=0; i < length_; ++i)
>        (*this)[i] = rand.random();
>    return *this;
>}
># 845 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.cc"
>}
># 453 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecio.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vecio.cc"
>namespace blitz {
>
>
>
>
>
>template<typename P_numtype>
>ostream& operator<<(ostream& os, const Vector<P_numtype>& x)
>{
>    os << "[ ";
>    for (int i=0; i < x.length(); ++i)
>    {
>        os << setw(10) << x[i];
>        if (!((i+1)%7))
>            os << endl << "  ";
>    }
>    os << " ]";
>    return os;
>}
>
>template<typename P_expr>
>ostream& operator<<(ostream& os, _bz_VecExpr<P_expr> expr)
>{
>    Vector<typename P_expr::T_numtype> result(expr);
>    os << result;
>    return os;
>}
>
>}
># 454 "/mn/anatu/cma-u3/tmac/usr/include/blitz/vector.h" 2
># 431 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.cc" 1
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.cc"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.cc" 2
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/vecassign.h" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/vecassign.h"
>namespace blitz {
>
>template<int N, int I>
>class _bz_meta_vecAssign {
>public:
>    static const int loopFlag = (I < N-1) ? 1 : 0;
>
>    template<typename T_vector, typename T_expr, typename T_updater>
>    static inline void fastAssign(T_vector& vec, T_expr expr, T_updater u)
>    {
>        u.update(vec[I], expr._bz_fastAccess(I));
>        _bz_meta_vecAssign<N * loopFlag, (I+1) * loopFlag>
>           ::fastAssign(vec,expr,u);
>    }
>
>    template<typename T_vector, typename T_expr, typename T_updater>
>    static inline void assign(T_vector& vec, T_expr expr, T_updater u)
>    {
>        u.update(vec[I], expr[I]);
>        _bz_meta_vecAssign<N * loopFlag, (I+1) * loopFlag>
>           ::assign(vec,expr,u);
>    }
>
>    template<typename T_vector, typename T_numtype, typename T_updater>
>    static inline void assignWithArgs(T_vector& vec, T_updater u,
>        T_numtype x0, T_numtype x1=0, T_numtype x2=0, T_numtype x3=0,
>        T_numtype x4=0, T_numtype x5=0, T_numtype x6=0, T_numtype x7=0,
>        T_numtype x8=0, T_numtype x9=0)
>    {
>        u.update(vec[I], x0);
>        _bz_meta_vecAssign<N * loopFlag, (I+1) * loopFlag>
>            ::assignWithArgs(vec, u, x1, x2, x3, x4, x5, x6, x7, x8, x9);
>    }
>
>};
>
>template<>
>class _bz_meta_vecAssign<0,0> {
>public:
>    template<typename T_vector, typename T_expr, typename T_updater>
>    static inline void fastAssign(T_vector&, T_expr, T_updater)
>    { }
>
>    template<typename T_vector, typename T_expr, typename T_updater>
>    static inline void assign(T_vector&, T_expr, T_updater)
>    { }
>
>    template<typename T_vector, typename T_numtype, typename T_updater>
>    static inline void assignWithArgs(T_vector&, T_updater,
>        T_numtype, T_numtype =0, T_numtype =0, T_numtype =0,
>        T_numtype =0, T_numtype =0, T_numtype =0, T_numtype =0,
>        T_numtype =0, T_numtype =0)
>    {
>    }
>};
>
>}
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.cc" 2
>
>namespace blitz {
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>::TinyVector(const T_numtype initValue) {
>    for (int i=0; i < N_length; ++i)
>        data_[i] = initValue;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>::TinyVector(const TinyVector<T_numtype, N_length>& x) {
>    for (int i=0; i < N_length; ++i)
>        data_[i] = x.data_[i];
>}
>
>template<typename P_numtype, int N_length>
>template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>::TinyVector(const TinyVector<P_numtype2, N_length>& x) {
>    for (int i=0; i < N_length; ++i)
>        data_[i] = static_cast<P_numtype>(x[i]);
>}
>
>template<typename P_numtype, int N_length>
>template<typename P_expr, typename P_updater>
>inline void TinyVector<P_numtype, N_length>::_bz_assign(P_expr expr, P_updater up) {
>    ;
>
>
>
>
>
>    if (expr._bz_hasFastAccess()) {
>        _bz_meta_vecAssign<N_length, 0>::fastAssign(*this, expr, up);
>    } else {
>        _bz_meta_vecAssign<N_length, 0>::assign(*this, expr, up);
>    }
>}
>
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>::TinyVector(_bz_VecExpr<P_expr> expr)
>{
>  _bz_assign(expr, _bz_update<T_numtype, typename P_expr::T_numtype>());
>}
>
>
>
>
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_update<T_numtype, typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator+=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_plus_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator-=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_minus_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator*=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_multiply_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator/=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_divide_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator%=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_mod_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator^=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_xor_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator&=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_bitand_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator|=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_bitor_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator<<=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_shiftl_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_expr>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator>>=(_bz_VecExpr<P_expr> expr)
>{
>    _bz_assign(expr, _bz_shiftr_update<T_numtype,
>        typename P_expr::T_numtype>());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::initialize(const T_numtype x)
>{
>
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) = _bz_VecExpr<T_expr>(T_expr(x));
>
>
>
>
>
>
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator+=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) += _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator-=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) -= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator*=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) *= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator/=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) /= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator%=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) %= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator^=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) ^= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator&=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) &= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator|=(const T_numtype x)
>{
>    typedef _bz_VecExprConstant<T_numtype> T_expr;
>    (*this) |= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator<<=(const int x)
>{
>    typedef _bz_VecExprConstant<int> T_expr;
>    (*this) <<= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator>>=(const int x)
>{
>    typedef _bz_VecExprConstant<int> T_expr;
>    (*this) >>= _bz_VecExpr<T_expr>(T_expr(x));
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) = _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator+=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) += _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator-=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) -= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator*=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) *= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator/=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) /= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator%=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) %= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator^=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) ^= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator&=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) &= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator|=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) |= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator<<=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) <<= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator>>=(const TinyVector<P_numtype2, N_length>& x) {
>    (*this) >>= _bz_VecExpr<typename
>        TinyVector<P_numtype2, N_length>::T_constIterator>(x.beginFast());
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator=(const Vector<P_numtype2>& x) {
>    (*this) = x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator+=(const Vector<P_numtype2>& x) {
>    (*this) += x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator-=(const Vector<P_numtype2>& x) {
>    (*this) -= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator*=(const Vector<P_numtype2>& x) {
>    (*this) *= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator/=(const Vector<P_numtype2>& x) {
>    (*this) /= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator%=(const Vector<P_numtype2>& x) {
>    (*this) %= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator^=(const Vector<P_numtype2>& x) {
>    (*this) ^= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator&=(const Vector<P_numtype2>& x) {
>    (*this) &= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator|=(const Vector<P_numtype2>& x) {
>    (*this) |= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator<<=(const Vector<P_numtype2>& x) {
>    (*this) <<= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator>>=(const Vector<P_numtype2>& x) {
>    (*this) >>= x._bz_asVecExpr();
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator=(const Range& r) {
>    (*this) = r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator+=(const Range& r) {
>    (*this) += r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator-=(const Range& r) {
>    (*this) -= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator*=(const Range& r) {
>    (*this) *= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator/=(const Range& r) {
>    (*this) /= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator%=(const Range& r) {
>    (*this) %= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator^=(const Range& r) {
>    (*this) ^= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator&=(const Range& r) {
>    (*this) &= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator|=(const Range& r) {
>    (*this) |= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator<<=(const Range& r) {
>    (*this) <<= r._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator>>=(const Range& r) {
>    (*this) >>= r._bz_asVecExpr();
>    return *this;
>}
>
>
>
>
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator=(const VectorPick<P_numtype2>& x)
>{
>    (*this) = x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator+=(const VectorPick<P_numtype2>& x)
>{
>    (*this) += x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator-=(const VectorPick<P_numtype2>& x)
>{
>    (*this) -= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator*=(const VectorPick<P_numtype2>& x)
>{
>    (*this) *= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator/=(const VectorPick<P_numtype2>& x)
>{
>    (*this) /= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator%=(const VectorPick<P_numtype2>& x)
>{
>    (*this) %= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator^=(const VectorPick<P_numtype2>& x)
>{
>    (*this) ^= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator&=(const VectorPick<P_numtype2>& x)
>{
>    (*this) &= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator|=(const VectorPick<P_numtype2>& x)
>{
>    (*this) |= x._bz_asVecExpr();
>    return *this;
>}
>
>template<typename P_numtype, int N_length> template<typename P_numtype2>
>inline TinyVector<P_numtype, N_length>&
>TinyVector<P_numtype, N_length>::operator>>=(const VectorPick<P_numtype2>& x)
>{
>    (*this) <<= x._bz_asVecExpr();
>    return *this;
>}
>
>}
># 432 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvecio.cc" 1
># 17 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvecio.cc"
>namespace blitz {
>
>
>
>template<typename P_numtype, int N_length>
>ostream& operator<<(ostream& os, const TinyVector<P_numtype, N_length>& x)
>{
>    os << N_length << " [ ";
>    for (int i=0; i < N_length; ++i)
>    {
>        os << setw(10) << x[i];
>        if (!((i+1)%7))
>            os << endl << "  ";
>    }
>    os << " ]";
>    return os;
>}
>
>
>template <typename T_numtype, int N_length>
>istream& operator>>(istream& is, TinyVector<T_numtype, N_length>& x)
>{
>    int length;
>    char sep;
>
>    is >> length;
>    is >> sep;
>    ;
>
>
>    ;
>    for (int i = 0; i < N_length; ++i)
>    {
>        ;
>        is >> x(i);
>    }
>    is >> sep;
>    ;
>
>
>    return is;
>}
>
>}
># 433 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinyvec.h" 2
># 45 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
>
>
>
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/indexexpr.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/indexexpr.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/etbase.h" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/etbase.h"
>namespace blitz {
>
>template<typename T>
>class ETBase {
>public:
>    ETBase()
>    { }
>
>    ETBase(const ETBase<T>&)
>    { }
>
>    T& unwrap() { return static_cast<T&>(*this); }
>
>    const T& unwrap() const { return static_cast<const T&>(*this); }
>};
>
>}
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/indexexpr.h" 2
>
>namespace blitz {
>
>template<int N>
>class IndexPlaceholder
>
>  : public ETBase<IndexPlaceholder<N> >
>
>{
>public:
>    IndexPlaceholder()
>    { }
>
>
>    IndexPlaceholder(const IndexPlaceholder<N>& x)
>        : ETBase< IndexPlaceholder<N> >(x)
>    { }
>
>
>
>
>
>    ~IndexPlaceholder()
>    { }
>
>    void operator=(const IndexPlaceholder<N>&)
>    { }
>
>    typedef int T_numtype;
>    typedef int T_ctorArg1;
>    typedef int T_ctorArg2;
>
>    static const int
>        numArrayOperands = 0,
>        numIndexPlaceholders = 1,
>        rank = N+1;
>
>
>
>
>
>    int operator*() {
>        ;
>        return 0;
>    }
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i) { return i[N]; }
>
>
>    int ascending(int) const { return (-2147483647 - 1); }
>    int ordering(int) const { return (-2147483647 - 1); }
>    int lbound(int) const { return (-2147483647 - 1); }
>    int ubound(int) const { return 2147483647; }
>
>
>
>    void push(int) { ; }
>    void pop(int) { ; }
>    void advance() { ; }
>    void advance(int) { ; }
>    void loadStride(int) { ; }
>
>    bool isUnitStride(int) const {
>        ;
>        return false;
>    }
>
>    void advanceUnitStride() { ; }
>
>    bool canCollapse(int,int) const {
>        ;
>        return false;
>    }
>
>    T_numtype operator[](int) {
>        ;
>        return T_numtype();
>    }
>
>    T_numtype fastRead(int) {
>        ;
>        return T_numtype();
>    }
>
>    int suggestStride(int) const {
>        ;
>        return 0;
>    }
>
>    bool isStride(int,int) const {
>        ;
>        return true;
>    }
>
>    void prettyPrint(std::string &str, prettyPrintFormat&) const {
>
>        str += "index-expr[NEEDS_WORK]";
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape&) const { return true; }
>};
>
>typedef IndexPlaceholder<0> firstIndex;
>typedef IndexPlaceholder<1> secondIndex;
>typedef IndexPlaceholder<2> thirdIndex;
>typedef IndexPlaceholder<3> fourthIndex;
>typedef IndexPlaceholder<4> fifthIndex;
>typedef IndexPlaceholder<5> sixthIndex;
>typedef IndexPlaceholder<6> seventhIndex;
>typedef IndexPlaceholder<7> eighthIndex;
>typedef IndexPlaceholder<8> ninthIndex;
>typedef IndexPlaceholder<9> tenthIndex;
>typedef IndexPlaceholder<10> eleventhIndex;
>
>
>
>namespace tensor {
>    extern blitz::IndexPlaceholder<0> i;
>    extern blitz::IndexPlaceholder<1> j;
>    extern blitz::IndexPlaceholder<2> k;
>    extern blitz::IndexPlaceholder<3> l;
>    extern blitz::IndexPlaceholder<4> m;
>    extern blitz::IndexPlaceholder<5> n;
>    extern blitz::IndexPlaceholder<6> o;
>    extern blitz::IndexPlaceholder<7> p;
>    extern blitz::IndexPlaceholder<8> q;
>    extern blitz::IndexPlaceholder<9> r;
>    extern blitz::IndexPlaceholder<10> s;
>    extern blitz::IndexPlaceholder<11> t;
>}
>
>
>
>}
># 51 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slice.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slice.h"
>namespace blitz {
>
>
>template<typename T, int N>
>class Array;
>
>
>
>class nilArraySection { };
>
>template<typename T>
>class ArraySectionInfo {
>public:
>    static const int isValidType = 0, rank = 0, isPick = 0;
>};
>
>template<>
>class ArraySectionInfo<Range> {
>public:
>    static const int isValidType = 1, rank = 1, isPick = 0;
>};
>
>template<>
>class ArraySectionInfo<int> {
>public:
>    static const int isValidType = 1, rank = 0, isPick = 0;
>};
>
>template<>
>class ArraySectionInfo<nilArraySection> {
>public:
>    static const int isValidType = 1, rank = 0, isPick = 0;
>};
>
>template<typename T_numtype, typename T1, typename T2 = nilArraySection,
>    class T3 = nilArraySection, typename T4 = nilArraySection,
>    class T5 = nilArraySection, typename T6 = nilArraySection,
>    class T7 = nilArraySection, typename T8 = nilArraySection,
>    class T9 = nilArraySection, typename T10 = nilArraySection,
>    class T11 = nilArraySection>
>class SliceInfo {
>public:
>    static const int
>        numValidTypes = ArraySectionInfo<T1>::isValidType
>                      + ArraySectionInfo<T2>::isValidType
>                      + ArraySectionInfo<T3>::isValidType
>                      + ArraySectionInfo<T4>::isValidType
>                      + ArraySectionInfo<T5>::isValidType
>                      + ArraySectionInfo<T6>::isValidType
>                      + ArraySectionInfo<T7>::isValidType
>                      + ArraySectionInfo<T8>::isValidType
>                      + ArraySectionInfo<T9>::isValidType
>                      + ArraySectionInfo<T10>::isValidType
>                      + ArraySectionInfo<T11>::isValidType,
>
>        rank = ArraySectionInfo<T1>::rank
>                      + ArraySectionInfo<T2>::rank
>                      + ArraySectionInfo<T3>::rank
>                      + ArraySectionInfo<T4>::rank
>                      + ArraySectionInfo<T5>::rank
>                      + ArraySectionInfo<T6>::rank
>                      + ArraySectionInfo<T7>::rank
>                      + ArraySectionInfo<T8>::rank
>                      + ArraySectionInfo<T9>::rank
>                      + ArraySectionInfo<T10>::rank
>                      + ArraySectionInfo<T11>::rank,
>
>        isPick = ArraySectionInfo<T1>::isPick
>                      + ArraySectionInfo<T2>::isPick
>                      + ArraySectionInfo<T3>::isPick
>                      + ArraySectionInfo<T4>::isPick
>                      + ArraySectionInfo<T5>::isPick
>                      + ArraySectionInfo<T6>::isPick
>                      + ArraySectionInfo<T7>::isPick
>                      + ArraySectionInfo<T8>::isPick
>                      + ArraySectionInfo<T9>::isPick
>                      + ArraySectionInfo<T10>::isPick
>                      + ArraySectionInfo<T11>::isPick;
>
>    typedef Array<T_numtype,numValidTypes> T_array;
>    typedef Array<T_numtype,rank> T_slice;
>};
>
>}
># 54 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/map.h" 1
># 47 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/map.h"
>namespace blitz {
>
>
>
>
>
>
>template<int N_rank>
>struct _bz_doArrayIndexMapping {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, N_rank>&,
>        const TinyVector<int,N_destRank>&, int, int, int, int, int, int,
>        int, int, int, int, int)
>    {
>
>
>
>        ;
>        return T_numtype();
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<1> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 1>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int, int, int, int,
>        int, int, int, int, int, int)
>    {
>        return array(index[i0]);
>    }
>};
>
>
>template<>
>struct _bz_doArrayIndexMapping<2> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 2>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int,
>        int, int, int, int, int, int, int, int)
>    {
>        return array(index[i0], index[i1]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<3> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 3>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int, int, int, int, int, int, int, int)
>    {
>        return array(index[i0], index[i1], index[i2]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<4> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 4>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int, int, int, int, int, int, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<5> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 5>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int, int, int, int, int, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<6> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 6>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int i5, int, int, int, int, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4],
>            index[i5]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<7> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 7>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int i5, int i6, int, int, int, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4],
>            index[i5], index[i6]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<8> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 8>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int i5, int i6, int i7, int, int, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4],
>            index[i5], index[i6], index[i7]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<9> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 9>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int i5, int i6, int i7, int i8, int, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4],
>            index[i5], index[i6], index[i7], index[i8]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<10> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 10>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int i5, int i6, int i7, int i8, int i9, int)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4],
>            index[i5], index[i6], index[i7], index[i8], index[i9]);
>    }
>};
>
>template<>
>struct _bz_doArrayIndexMapping<11> {
>    template<typename T_numtype, int N_destRank>
>    static T_numtype map(const Array<T_numtype, 11>& array,
>        const TinyVector<int,N_destRank>& index, int i0, int i1, int i2,
>        int i3, int i4, int i5, int i6, int i7, int i8, int i9, int i10)
>    {
>        return array(index[i0], index[i1], index[i2], index[i3], index[i4],
>            index[i5], index[i6], index[i7], index[i8], index[i9],
>            index[i10]);
>    }
>};
>
>template<typename P_numtype, int N_rank, int N_map0, int N_map1=0, int N_map2=0,
>    int N_map3=0, int N_map4=0, int N_map5=0, int N_map6=0, int N_map7=0,
>    int N_map8=0, int N_map9=0, int N_map10=0>
>class ArrayIndexMapping {
>public:
>    typedef P_numtype T_numtype;
>    typedef const Array<T_numtype,N_rank>& T_ctorArg1;
>    typedef int T_ctorArg2;
>
>
>
>
>
>
>
>    static const int
>        maxRank1 = (N_map0 > N_map1) ? N_map0 : N_map1,
>        maxRank2 = (N_map2 > maxRank1) ? N_map2 : maxRank1,
>        maxRank3 = (N_map3 > maxRank2) ? N_map3 : maxRank2,
>        maxRank4 = (N_map4 > maxRank3) ? N_map4 : maxRank3,
>        maxRank5 = (N_map5 > maxRank4) ? N_map5 : maxRank4,
>        maxRank6 = (N_map6 > maxRank5) ? N_map6 : maxRank5,
>        maxRank7 = (N_map7 > maxRank6) ? N_map7 : maxRank6,
>        maxRank8 = (N_map8 > maxRank7) ? N_map8 : maxRank7,
>        maxRank9 = (N_map9 > maxRank8) ? N_map9 : maxRank8,
>        maxRank10 = (N_map10 > maxRank9) ? N_map10 : maxRank9;
>
>    static const int
>        numArrayOperands = 1,
>        numIndexPlaceholders = 1,
>        rank = maxRank10 + 1;
>
>    ArrayIndexMapping(const Array<T_numtype, N_rank>& array)
>        : array_(array)
>    {
>    }
>
>    ArrayIndexMapping(const ArrayIndexMapping<T_numtype,N_rank,N_map0,
>        N_map1,N_map2,N_map3,N_map4,N_map5,N_map6,N_map7,N_map8,N_map9,
>        N_map10>& z)
>        : array_(z.array_)
>    {
>    }
># 251 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/map.h"
>    template<int N_destRank>
>    T_numtype operator()(const TinyVector<int, N_destRank>& i)
>    {
>        return _bz_doArrayIndexMapping<N_rank>::map(array_, i,
>            N_map0, N_map1, N_map2, N_map3, N_map4, N_map5, N_map6,
>            N_map7, N_map8, N_map9, N_map10);
>    }
>
>
>    int ascending(int rank)
>    {
>        if (N_map0 == rank)
>            return array_.isRankStoredAscending(0);
>        else if ((N_map1 == rank) && (N_rank > 1))
>            return array_.isRankStoredAscending(1);
>        else if ((N_map2 == rank) && (N_rank > 2))
>            return array_.isRankStoredAscending(2);
>        else if ((N_map3 == rank) && (N_rank > 3))
>            return array_.isRankStoredAscending(3);
>        else if ((N_map4 == rank) && (N_rank > 4))
>            return array_.isRankStoredAscending(4);
>        else if ((N_map5 == rank) && (N_rank > 5))
>            return array_.isRankStoredAscending(5);
>        else if ((N_map6 == rank) && (N_rank > 6))
>            return array_.isRankStoredAscending(6);
>        else if ((N_map7 == rank) && (N_rank > 7))
>            return array_.isRankStoredAscending(7);
>        else if ((N_map8 == rank) && (N_rank > 8))
>            return array_.isRankStoredAscending(8);
>        else if ((N_map9 == rank) && (N_rank > 9))
>            return array_.isRankStoredAscending(9);
>        else if ((N_map10 == rank) && (N_rank > 10))
>            return array_.isRankStoredAscending(10);
>        else
>            return (-2147483647 - 1);
>    }
>
>    int ordering(int rank)
>    {
>        if (N_map0 == rank)
>            return array_.ordering(0);
>        else if ((N_map1 == rank) && (N_rank > 1))
>            return array_.ordering(1);
>        else if ((N_map2 == rank) && (N_rank > 2))
>            return array_.ordering(2);
>        else if ((N_map3 == rank) && (N_rank > 3))
>            return array_.ordering(3);
>        else if ((N_map4 == rank) && (N_rank > 4))
>            return array_.ordering(4);
>        else if ((N_map5 == rank) && (N_rank > 5))
>            return array_.ordering(5);
>        else if ((N_map6 == rank) && (N_rank > 6))
>            return array_.ordering(6);
>        else if ((N_map7 == rank) && (N_rank > 7))
>            return array_.ordering(7);
>        else if ((N_map8 == rank) && (N_rank > 8))
>            return array_.ordering(8);
>        else if ((N_map9 == rank) && (N_rank > 9))
>            return array_.ordering(9);
>        else if ((N_map10 == rank) && (N_rank > 10))
>            return array_.ordering(10);
>        else
>            return (-2147483647 - 1);
>    }
>
>    int lbound(int rank)
>    {
>        if (N_map0 == rank)
>            return array_.lbound(0);
>        else if ((N_map1 == rank) && (N_rank > 1))
>            return array_.lbound(1);
>        else if ((N_map2 == rank) && (N_rank > 2))
>            return array_.lbound(2);
>        else if ((N_map3 == rank) && (N_rank > 3))
>            return array_.lbound(3);
>        else if ((N_map4 == rank) && (N_rank > 4))
>            return array_.lbound(4);
>        else if ((N_map5 == rank) && (N_rank > 5))
>            return array_.lbound(5);
>        else if ((N_map6 == rank) && (N_rank > 6))
>            return array_.lbound(6);
>        else if ((N_map7 == rank) && (N_rank > 7))
>            return array_.lbound(7);
>        else if ((N_map8 == rank) && (N_rank > 8))
>            return array_.lbound(8);
>        else if ((N_map9 == rank) && (N_rank > 9))
>            return array_.lbound(9);
>        else if ((N_map10 == rank) && (N_rank > 10))
>            return array_.lbound(10);
>        else
>            return (-2147483647 - 1);
>    }
>
>    int ubound(int rank)
>    {
>        if (N_map0 == rank)
>            return array_.ubound(0);
>        else if ((N_map1 == rank) && (N_rank > 1))
>            return array_.ubound(1);
>        else if ((N_map2 == rank) && (N_rank > 2))
>            return array_.ubound(2);
>        else if ((N_map3 == rank) && (N_rank > 3))
>            return array_.ubound(3);
>        else if ((N_map4 == rank) && (N_rank > 4))
>            return array_.ubound(4);
>        else if ((N_map5 == rank) && (N_rank > 5))
>            return array_.ubound(5);
>        else if ((N_map6 == rank) && (N_rank > 6))
>            return array_.ubound(6);
>        else if ((N_map7 == rank) && (N_rank > 7))
>            return array_.ubound(7);
>        else if ((N_map8 == rank) && (N_rank > 8))
>            return array_.ubound(8);
>        else if ((N_map9 == rank) && (N_rank > 9))
>            return array_.ubound(9);
>        else if ((N_map10 == rank) && (N_rank > 10))
>            return array_.ubound(10);
>        else
>            return 2147483647;
>    }
>
>
>
>
>
>    int operator*()
>    {
>        ;
>        return 0;
>    }
>
>
>    void push(int)
>    {
>        ;
>    }
>
>
>    void pop(int)
>    {
>        ;
>    }
>
>
>    void advance()
>    {
>        ;
>    }
>
>
>    void advance(int)
>    {
>        ;
>    }
>
>
>    void loadStride(int)
>    {
>        ;
>    }
>
>    bool isUnitStride(int) const
>    {
>        ;
>        return false;
>    }
>
>    void advanceUnitStride()
>    {
>        ;
>    }
>
>    bool canCollapse(int,int) const
>    { ; return false; }
>
>    T_numtype operator[](int)
>    {
>        ;
>        return T_numtype();
>    }
>
>    T_numtype fastRead(int)
>    {
>        ;
>        return T_numtype();
>    }
>
>    int suggestStride(int) const
>    {
>        ;
>        return 0;
>    }
>
>    bool isStride(int,int) const
>    {
>        ;
>        return true;
>    }
>
>    template<int N_rank2>
>    void moveTo(const TinyVector<int,N_rank2>&)
>    {
>        ;
>        return ;
>    }
>
>    void prettyPrint(std::string &str, prettyPrintFormat&) const
>    {
>
>        str += "map[NEEDS_WORK]";
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape&) const
>    {
>
>        return true;
>    }
>
>private:
>    ArrayIndexMapping() : array_( Array<T_numtype, N_rank>() ) { }
>
>    const Array<T_numtype, N_rank>& array_;
>};
>
>}
># 55 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/multi.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/multi.h"
>namespace blitz {
># 45 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/multi.h"
>template<typename T_component>
>struct multicomponent_traits {
>    typedef T_component T_element;
>    static const int numComponents = 0;
>};
>
>
>template<typename T_numtype, int N_rank>
>struct multicomponent_traits<TinyVector<T_numtype,N_rank> > {
>    typedef T_numtype T_element;
>    static const int numComponents = N_rank;
>};
>
>
>
>template<typename T>
>struct multicomponent_traits<complex<T> > {
>    typedef T T_element;
>    static const int numComponents = 2;
>};
># 79 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/multi.h"
>}
># 56 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/domain.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/domain.h"
>namespace blitz {
>
>template<int N_rank>
>class RectDomain {
>
>    typedef TinyVector<int,N_rank> Bounds;
>
>public:
>
>    RectDomain() { }
>    RectDomain(const Bounds& lbound,const Bounds& ubound): lbound_(lbound),ubound_(ubound) { }
>    RectDomain(const TinyVector<Range,N_rank>& bounds): lbound_(),ubound_() {
>        for (int i=0;i<N_rank;++i) {
>            lbound_(i) = bounds(i).first();
>            ubound_(i) = bounds(i).last();
>        }
>    }
>
>
>
>
>
>          Bounds& lbound() { return lbound_; }
>          Bounds& ubound() { return ubound_; }
>    const Bounds& lbound() const { return lbound_; }
>    const Bounds& ubound() const { return ubound_; }
>
>    int& lbound(const int i) { return lbound_(i); }
>    int& ubound(const int i) { return ubound_(i); }
>    int lbound(const int i) const { return lbound_(i); }
>    int ubound(const int i) const { return ubound_(i); }
>
>    Range operator[](const int rank) const { return Range(lbound_(rank), ubound_(rank)); }
>
>    void shrink(const int amount) {
>        lbound_ += amount;
>        ubound_ -= amount;
>    }
>
>    void shrink(const int dim,const int amount) {
>        lbound_(dim) += amount;
>        ubound_(dim) -= amount;
>    }
>
>    void expand(const int amount) {
>        lbound_ -= amount;
>        ubound_ += amount;
>    }
>
>    void expand(const int dim,const int amount) {
>        lbound_(dim) -= amount;
>        ubound_(dim) += amount;
>    }
>
>private:
>
>    Bounds lbound_;
>    Bounds ubound_;
>};
>
>
>
>
>
>template<int N_rank>
>class StridedDomain {
>
>    typedef TinyVector<int,N_rank> Bounds;
>    typedef TinyVector<int,N_rank> Strides;
>
>public:
>
>    StridedDomain(const Bounds& lbound,const Bounds& ubound,const Strides& stride):
>        lbound_(lbound),ubound_(ubound),stride_(stride) { }
>
>
>
>
>
>    const Bounds& lbound() const { return lbound_; }
>    const Bounds& ubound() const { return ubound_; }
>    const Strides& stride() const { return stride_; }
>
>    int lbound(const int i) const { return lbound_(i); }
>    int ubound(const int i) const { return ubound_(i); }
>    int stride(const int i) const { return stride_(i); }
>
>    Range operator[](const int rank) const { return Range(lbound_(rank),ubound_(rank),stride_(rank)); }
>
>    void shrink(const int amount) {
>        lbound_ += amount*stride_;
>        ubound_ -= amount*stride_;
>    }
>
>    void shrink(const int dim,const int amount) {
>        lbound_(dim) += amount*stride_(dim);
>        ubound_(dim) -= amount*stride_(dim);
>    }
>
>    void expand(const int amount) {
>        lbound_ -= amount*stride_;
>        ubound_ += amount*stride_;
>    }
>
>    void expand(const int dim,const int amount) {
>        lbound_(dim) -= amount*stride_(dim);
>        ubound_(dim) += amount*stride_(dim);
>    }
>
>private:
>
>    Bounds lbound_;
>    Bounds ubound_;
>    Strides stride_;
>};
>
>
>template<int N_rank>
>inline RectDomain<N_rank>
>strip(const TinyVector<int,N_rank>& startPosition,const int stripDimension,const int ubound) {
>    ;
>    ;
>
>    TinyVector<int,N_rank> endPosition = startPosition;
>    endPosition(stripDimension) = ubound;
>    return RectDomain<N_rank>(startPosition, endPosition);
>}
>
>}
># 57 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/storage.h" 1
># 26 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/storage.h"
>namespace blitz {
># 49 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/storage.h"
>template<int N_rank>
>class GeneralArrayStorage {
>public:
>    class noInitializeFlag { };
>
>    GeneralArrayStorage(noInitializeFlag)
>    { }
>
>    GeneralArrayStorage()
>    {
>        for (int i=0; i < N_rank; ++i)
>          ordering_(i) = N_rank - 1 - i;
>        ascendingFlag_ = true;
>        base_ = 0;
>    }
>
>    GeneralArrayStorage(const GeneralArrayStorage<N_rank>& x)
>        : ordering_(x.ordering_), ascendingFlag_(x.ascendingFlag_),
>          base_(x.base_)
>    {
>    }
>
>    GeneralArrayStorage(TinyVector<int,N_rank> ordering,
>        TinyVector<bool,N_rank> ascendingFlag)
>      : ordering_(ordering), ascendingFlag_(ascendingFlag)
>    {
>        base_ = 0;
>    }
>
>    ~GeneralArrayStorage()
>    { }
>
>    GeneralArrayStorage<N_rank>& operator=(
>        const GeneralArrayStorage<N_rank>& rhs)
>    {
>        ordering_ = rhs.ordering();
>        ascendingFlag_ = rhs.ascendingFlag();
>        base_ = rhs.base();
>        return *this;
>    }
>
>    TinyVector<int, N_rank>& ordering()
>    { return ordering_; }
>
>    const TinyVector<int, N_rank>& ordering() const
>    { return ordering_; }
>
>    int ordering(int i) const
>    { return ordering_[i]; }
>
>    void setOrdering(int i, int order)
>    { ordering_[i] = order; }
>
>    bool allRanksStoredAscending() const
>    {
>        bool result = true;
>        for (int i=0; i < N_rank; ++i)
>            result &= ascendingFlag_[i];
>        return result;
>    }
>
>    bool isRankStoredAscending(int i) const
>    { return ascendingFlag_[i]; }
>
>    TinyVector<bool, N_rank>& ascendingFlag()
>    { return ascendingFlag_; }
>
>    const TinyVector<bool, N_rank>& ascendingFlag() const
>    { return ascendingFlag_; }
>
>    void setAscendingFlag(int i, bool ascendingFlag)
>    { ascendingFlag_[i] = ascendingFlag; }
>
>    TinyVector<int, N_rank>& base()
>    { return base_; }
>
>    const TinyVector<int, N_rank>& base() const
>    { return base_; }
>
>    int base(int i) const
>    { return base_[i]; }
>
>    void setBase(int i, int base)
>    { base_[i] = base; }
>
>    void setBase(const TinyVector<int, N_rank>& base)
>    { base_ = base; }
>
>protected:
># 159 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/storage.h"
>    TinyVector<int, N_rank> ordering_;
>    TinyVector<bool, N_rank> ascendingFlag_;
>    TinyVector<int, N_rank> base_;
>};
># 171 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/storage.h"
>template<int N_rank>
>class FortranArray : public GeneralArrayStorage<N_rank> {
>private:
>    typedef GeneralArrayStorage<N_rank> T_base;
>    typedef typename T_base::noInitializeFlag noInitializeFlag;
>    using T_base::ordering_;
>    using T_base::ascendingFlag_;
>    using T_base::base_;
>public:
>    FortranArray()
>        : GeneralArrayStorage<N_rank>(noInitializeFlag())
>    {
>        for (int i=0; i < N_rank; ++i)
>          ordering_(i) = i;
>        ascendingFlag_ = true;
>        base_ = 1;
>    }
>};
># 198 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/storage.h"
>class _bz_fortranTag {
>public:
>    operator GeneralArrayStorage<1>()
>    { return FortranArray<1>(); }
>
>    operator GeneralArrayStorage<2>()
>    { return FortranArray<2>(); }
>
>    operator GeneralArrayStorage<3>()
>    { return FortranArray<3>(); }
>
>    operator GeneralArrayStorage<4>()
>    { return FortranArray<4>(); }
>
>    operator GeneralArrayStorage<5>()
>    { return FortranArray<5>(); }
>
>    operator GeneralArrayStorage<6>()
>    { return FortranArray<6>(); }
>
>    operator GeneralArrayStorage<7>()
>    { return FortranArray<7>(); }
>
>    operator GeneralArrayStorage<8>()
>    { return FortranArray<8>(); }
>
>    operator GeneralArrayStorage<9>()
>    { return FortranArray<9>(); }
>
>    operator GeneralArrayStorage<10>()
>    { return FortranArray<10>(); }
>
>    operator GeneralArrayStorage<11>()
>    { return FortranArray<11>(); }
>};
>
>
>
>
>extern _bz_fortranTag fortranArray;
>
>
>
>
>
>
>
>template<int N_rank>
>class ColumnMajorArray : public GeneralArrayStorage<N_rank> {
>private:
>    typedef GeneralArrayStorage<N_rank> T_base;
>    typedef typename T_base::noInitializeFlag noInitializeFlag;
>    using T_base::ordering_;
>    using T_base::ascendingFlag_;
>    using T_base::base_;
>public:
>    ColumnMajorArray()
>        : GeneralArrayStorage<N_rank>(noInitializeFlag())
>    {
>        ordering_ = Range(0, N_rank - 1);
>        ascendingFlag_ = true;
>        base_ = 0;
>    }
>};
>
>}
># 58 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
>
>
>namespace blitz {
>
>
>
>
>
>template<typename T_numtype, int N_rank>
>class ArrayIterator;
>
>template<typename T_numtype, int N_rank>
>class ConstArrayIterator;
>
>template<typename T_numtype, int N_rank>
>class FastArrayIterator;
>
>template<typename P_expr>
>class _bz_ArrayExpr;
>
>template<typename T_array, typename T_index>
>class IndirectArray;
>
>template <typename P_numtype,int N_rank>
>void swap(Array<P_numtype,N_rank>&,Array<P_numtype,N_rank>&);
>
>template <typename P_numtype, int N_rank>
>void find(Array<TinyVector<int,N_rank>,1>&,const Array<P_numtype,N_rank>&);
># 95 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>template<typename P_numtype, int N_rank>
>class Array : public MemoryBlockReference<P_numtype>
>
>    , public ETBase<Array<P_numtype,N_rank> >
>
>{
>
>private:
>    typedef MemoryBlockReference<P_numtype> T_base;
>    using T_base::data_;
>    using T_base::changeToNullBlock;
>    using T_base::numReferences;
>
>public:
># 124 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    typedef P_numtype T_numtype;
>    typedef TinyVector<int, N_rank> T_index;
>    typedef Array<T_numtype, N_rank> T_array;
>    typedef FastArrayIterator<T_numtype, N_rank> T_iterator;
>
>    typedef ArrayIterator<T_numtype,N_rank> iterator;
>    typedef ConstArrayIterator<T_numtype,N_rank> const_iterator;
>
>    static const int _bz_rank = N_rank;
># 143 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    template<typename T_expr>
>    explicit Array(_bz_ArrayExpr<T_expr> expr);
># 153 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    Array(GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        length_ = 0;
>        stride_ = 0;
>        zeroOffset_ = 0;
>    }
>
>    explicit Array(int length0,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        length_[0] = length0;
>        setupStorage(0);
>    }
>
>    Array(int length0, int length1,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        ;
>
>        ;
>
>        length_[0] = length0;
>        length_[1] = length1;
>        setupStorage(1);
>    }
>
>    Array(int length0, int length1, int length2,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        setupStorage(2);
>    }
>
>    Array(int length0, int length1, int length2, int length3,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        setupStorage(3);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        setupStorage(4);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        int length5,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        length_[5] = length5;
>        setupStorage(5);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        int length5, int length6,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        length_[5] = length5;
>        length_[6] = length6;
>        setupStorage(6);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        int length5, int length6, int length7,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        length_[5] = length5;
>        length_[6] = length6;
>        length_[7] = length7;
>        setupStorage(7);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        int length5, int length6, int length7, int length8,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        length_[5] = length5;
>        length_[6] = length6;
>        length_[7] = length7;
>        length_[8] = length8;
>        setupStorage(8);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        int length5, int length6, int length7, int length8, int length9,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        length_[5] = length5;
>        length_[6] = length6;
>        length_[7] = length7;
>        length_[8] = length8;
>        length_[9] = length9;
>        setupStorage(9);
>    }
>
>    Array(int length0, int length1, int length2, int length3, int length4,
>        int length5, int length6, int length7, int length8, int length9,
>        int length10,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>        length_[0] = length0;
>        length_[1] = length1;
>        length_[2] = length2;
>        length_[3] = length3;
>        length_[4] = length4;
>        length_[5] = length5;
>        length_[6] = length6;
>        length_[7] = length7;
>        length_[8] = length8;
>        length_[9] = length9;
>        length_[10] = length10;
>        setupStorage(10);
>    }
>
>
>
>
>
>    Array(T_numtype* __restrict__ dataFirst, TinyVector<int, N_rank> shape,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>      : MemoryBlockReference<T_numtype>(product(shape), dataFirst,
>          neverDeleteData),
>        storage_(storage)
>    {
>        ;
>
>        length_ = shape;
>        computeStrides();
>        data_ += zeroOffset_;
>    }
>
>
>
>
>
>
>    Array(T_numtype* __restrict__ dataFirst, TinyVector<int, N_rank> shape,
>        TinyVector<int, N_rank> stride,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>      : MemoryBlockReference<T_numtype>(product(shape), dataFirst,
>          neverDeleteData),
>        storage_(storage)
>    {
>        ;
>
>        length_ = shape;
>        stride_ = stride;
>        calculateZeroOffset();
>        data_ += zeroOffset_;
>    }
>
>
>
>
>    Array(T_numtype* __restrict__ dataFirst, TinyVector<int, N_rank> shape,
>        preexistingMemoryPolicy deletionPolicy,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>      : MemoryBlockReference<T_numtype>(product(shape), dataFirst,
>            deletionPolicy),
>        storage_(storage)
>    {
>        ;
>
>        length_ = shape;
>        computeStrides();
>        data_ += zeroOffset_;
>
>        if (deletionPolicy == duplicateData)
>            reference(copy());
>    }
>
>
>
>
>
>    Array(T_numtype* __restrict__ dataFirst, TinyVector<int, N_rank> shape,
>        TinyVector<int, N_rank> stride,
>        preexistingMemoryPolicy deletionPolicy,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>      : MemoryBlockReference<T_numtype>(product(shape), dataFirst,
>          deletionPolicy),
>        storage_(storage)
>    {
>        ;
>
>        length_ = shape;
>        stride_ = stride;
>        calculateZeroOffset();
>        data_ += zeroOffset_;
>
>        if (deletionPolicy == duplicateData)
>            reference(copy());
>    }
>
>
>
>
>
>    Array(const TinyVector<int, N_rank>& extent,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        length_ = extent;
>        setupStorage(N_rank - 1);
>    }
>
>
>
>
>
>
>    Array(const TinyVector<int, N_rank>& lbounds,
>        const TinyVector<int, N_rank>& extent,
>        const GeneralArrayStorage<N_rank>& storage
>           = GeneralArrayStorage<N_rank>());
>
>
>
>
>
>
>    Array(Range r0,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        setupStorage(0);
>    }
>
>    Array(Range r0, Range r1,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>
>        setupStorage(1);
>    }
>
>    Array(Range r0, Range r1, Range r2,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>
>        setupStorage(2);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>
>        setupStorage(3);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>
>        setupStorage(4);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4, Range r5,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>        length_[5] = r5.length();
>        storage_.setBase(5, r5.first());
>
>        setupStorage(5);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4, Range r5,
>        Range r6,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>        length_[5] = r5.length();
>        storage_.setBase(5, r5.first());
>        length_[6] = r6.length();
>        storage_.setBase(6, r6.first());
>
>        setupStorage(6);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4, Range r5,
>        Range r6, Range r7,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>        length_[5] = r5.length();
>        storage_.setBase(5, r5.first());
>        length_[6] = r6.length();
>        storage_.setBase(6, r6.first());
>        length_[7] = r7.length();
>        storage_.setBase(7, r7.first());
>
>        setupStorage(7);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4, Range r5,
>        Range r6, Range r7, Range r8,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>        length_[5] = r5.length();
>        storage_.setBase(5, r5.first());
>        length_[6] = r6.length();
>        storage_.setBase(6, r6.first());
>        length_[7] = r7.length();
>        storage_.setBase(7, r7.first());
>        length_[8] = r8.length();
>        storage_.setBase(8, r8.first());
>
>        setupStorage(8);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4, Range r5,
>        Range r6, Range r7, Range r8, Range r9,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>        length_[5] = r5.length();
>        storage_.setBase(5, r5.first());
>        length_[6] = r6.length();
>        storage_.setBase(6, r6.first());
>        length_[7] = r7.length();
>        storage_.setBase(7, r7.first());
>        length_[8] = r8.length();
>        storage_.setBase(8, r8.first());
>        length_[9] = r9.length();
>        storage_.setBase(9, r9.first());
>
>        setupStorage(9);
>    }
>
>    Array(Range r0, Range r1, Range r2, Range r3, Range r4, Range r5,
>        Range r6, Range r7, Range r8, Range r9, Range r10,
>        GeneralArrayStorage<N_rank> storage = GeneralArrayStorage<N_rank>())
>        : storage_(storage)
>    {
>        ;
>
>
>
>
>
>
>        length_[0] = r0.length();
>        storage_.setBase(0, r0.first());
>        length_[1] = r1.length();
>        storage_.setBase(1, r1.first());
>        length_[2] = r2.length();
>        storage_.setBase(2, r2.first());
>        length_[3] = r3.length();
>        storage_.setBase(3, r3.first());
>        length_[4] = r4.length();
>        storage_.setBase(4, r4.first());
>        length_[5] = r5.length();
>        storage_.setBase(5, r5.first());
>        length_[6] = r6.length();
>        storage_.setBase(6, r6.first());
>        length_[7] = r7.length();
>        storage_.setBase(7, r7.first());
>        length_[8] = r8.length();
>        storage_.setBase(8, r8.first());
>        length_[9] = r9.length();
>        storage_.setBase(9, r9.first());
>        length_[10] = r10.length();
>        storage_.setBase(10, r10.first());
>
>        setupStorage(10);
>    }
>
>
>
>
>    Array(const Array<T_numtype, N_rank>& array)
>
>        : MemoryBlockReference<T_numtype>(),
>          ETBase< Array<T_numtype, N_rank> >(array)
>
>
>
>    {
>
>        reference(const_cast<T_array&>(array));
>    }
>
>
>
>
>
>    Array(const TinyVector<int,N_rank-1>& shape,
>        int lastExtent, const GeneralArrayStorage<N_rank>& storage);
># 741 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    Array(Array<T_numtype, N_rank>& array, Range r0)
>    {
>        constructSubarray(array, r0);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1)
>    {
>        constructSubarray(array, r0, r1);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2)
>    {
>        constructSubarray(array, r0, r1, r2);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3)
>    {
>        constructSubarray(array, r0, r1, r2, r3);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4, Range r5)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4, r5);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4, Range r5, Range r6)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4, r5, r6);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4, Range r5, Range r6, Range r7)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4, r5, r6, r7);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4, Range r5, Range r6, Range r7, Range r8)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4, r5, r6, r7, r8);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4, r5, r6, r7, r8, r9);
>    }
>
>    Array(Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2,
>        Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9,
>        Range r10)
>    {
>        constructSubarray(array, r0, r1, r2, r3, r4, r5, r6, r7, r8, r9, r10);
>    }
>
>    Array(Array<T_numtype, N_rank>& array,
>        const RectDomain<N_rank>& subdomain)
>    {
>        constructSubarray(array, subdomain);
>    }
>
>
>    Array(Array<T_numtype, N_rank>& array,
>        const StridedDomain<N_rank>& subdomain)
>    {
>        constructSubarray(array, subdomain);
>    }
>
>
>
>
>
>
>    template<int N_rank2, typename R0, typename R1, typename R2, typename R3, typename R4,
>        typename R5, typename R6, typename R7, typename R8, typename R9, typename R10>
>    Array(Array<T_numtype,N_rank2>& array, R0 r0, R1 r1, R2 r2,
>        R3 r3, R4 r4, R5 r5, R6 r6, R7 r7, R8 r8, R9 r9, R10 r10)
>    {
>        constructSlice(array, r0, r1, r2, r3, r4, r5, r6, r7, r8, r9, r10);
>    }
>
>
>
>
>
>    const TinyVector<int, N_rank>& base() const
>    { return storage_.base(); }
>
>    int base(int rank) const
>    { return storage_.base(rank); }
>
>    iterator begin()
>    { return iterator(*this); }
>
>    const_iterator begin() const
>    { return const_iterator(*this); }
>
>    T_iterator beginFast() const
>    { return T_iterator(*this); }
>
>
>    template<typename P_numtype2>
>    Array<P_numtype2,N_rank> chopComponent(P_numtype2 a, int compNum,
>                                          int numComponents) const
>    { return extractComponent(a, compNum, numComponents); }
>
>    int cols() const
>    { return length_[1]; }
>
>    int columns() const
>    { return length_[1]; }
>
>    T_array copy() const;
>
>
>
>
>
>
>
>    int dataOffset() const
>    {
>        return dot(storage_.base(), stride_);
>    }
>
>    const T_numtype* __restrict__ data() const
>    { return data_ + dataOffset(); }
>
>    T_numtype* __restrict__ data()
>    { return data_ + dataOffset(); }
>
>
>
>
>    const T_numtype* __restrict__ dataZero() const
>    { return data_; }
>
>    T_numtype* __restrict__ dataZero()
>    { return data_; }
>
>
>
>
>    int dataFirstOffset() const
>    {
>        int pos = 0;
>
>
>
>
>
>        for (int i=0; i < N_rank; ++i)
>           pos += (storage_.base(i) + (1-storage_.isRankStoredAscending(i)) *
>              (length_(i)-1)) * stride_(i);
>
>        return pos;
>    }
>
>    const T_numtype* __restrict__ dataFirst() const
>    {
>        return data_ + dataFirstOffset();
>    }
>
>    T_numtype* __restrict__ dataFirst()
>    {
>        return data_ + dataFirstOffset();
>    }
>
>    int depth() const
>    { return length_[2]; }
>
>    int dimensions() const
>    { return N_rank; }
>
>    RectDomain<N_rank> domain() const
>    {
>        return RectDomain<N_rank>(lbound(), ubound());
>    }
>
>    void dumpStructureInformation(ostream& os = cout) const;
>
>    iterator end()
>    {
>        return iterator();
>    }
>
>    const_iterator end() const
>    {
>        return const_iterator();
>    }
>
>    int extent(int rank) const
>    { return length_[rank]; }
>
>    const TinyVector<int,N_rank>& extent() const
>    { return length_; }
>
>    template<typename P_numtype2>
>    Array<P_numtype2,N_rank> extractComponent(P_numtype2, int compNum,
>                                          int numComponents) const;
>
>    void free()
>    {
>        changeToNullBlock();
>        length_ = 0;
>    }
>
>    bool isMajorRank(int rank) const { return storage_.ordering(rank) == 0; }
>    bool isMinorRank(int rank) const { return storage_.ordering(rank) != 0; }
>    bool isRankStoredAscending(int rank) const {
>        return storage_.isRankStoredAscending(rank);
>    }
>
>    bool isStorageContiguous() const;
>
>    int lbound(int rank) const { return base(rank); }
>    TinyVector<int,N_rank> lbound() const { return base(); }
>
>    int length(int rank) const { return length_[rank]; }
>    const TinyVector<int, N_rank>& length() const { return length_; }
>
>    void makeUnique();
>
>    int numElements() const { return product(length_); }
># 983 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    int ordering(int storageRankIndex) const
>    { return storage_.ordering(storageRankIndex); }
>
>    const TinyVector<int, N_rank>& ordering() const
>    { return storage_.ordering(); }
>
>    void transposeSelf(int r0, int r1, int r2=0,
>        int r3=0, int r4=0, int r5=0, int r6=0, int r7=0, int r8=0, int
>        r9=0, int r10=0);
>    T_array transpose(int r0, int r1, int r2=0,
>        int r3=0, int r4=0, int r5=0, int r6=0, int r7=0, int r8=0, int
>        r9=0, int r10=0);
>
>    int rank() const
>    { return N_rank; }
>
>    void reference(const T_array&);
>
>
>    T_array reindex(const TinyVector<int,N_rank>&);
>    void reindexSelf(const
>                                                TinyVector<int,N_rank>&);
>
>    void resize(int extent);
>    void resize(int extent1, int extent2);
>    void resize(int extent1, int extent2,
>                                        int extent3);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5,
>                                        int extent6);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5,
>                                        int extent6, int extent7);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5,
>                                        int extent6, int extent7, int extent8);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5,
>                                        int extent6, int extent7, int extent8,
>                                        int extent9);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5,
>                                        int extent6, int extent7, int extent8,
>                                        int extent9, int extent10);
>    void resize(int extent1, int extent2,
>                                        int extent3, int extent4, int extent5,
>                                        int extent6, int extent7, int extent8,
>                                        int extent9, int extent10,
>                                        int extent11);
>
>
>    void resize(Range r1);
>    void resize(Range r1, Range r2);
>    void resize(Range r1, Range r2, Range r3);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5, Range r6);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5, Range r6,
>                                        Range r7);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5, Range r6,
>                                        Range r7, Range r8);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5, Range r6,
>                                        Range r7, Range r8, Range r9);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5, Range r6,
>                                        Range r7, Range r8, Range r9,
>                                        Range r10);
>    void resize(Range r1, Range r2, Range r3,
>                                        Range r4, Range r5, Range r6,
>                                        Range r7, Range r8, Range r9,
>                                        Range r10, Range r11);
>
>    void resize(const TinyVector<int,N_rank>&);
>
>
>    void resizeAndPreserve(const TinyVector<int,
>                                                                   N_rank>&);
>    void resizeAndPreserve(int extent);
>    void resizeAndPreserve(int extent1,
>                                        int extent2);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5, int extent6);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5, int extent6, int extent7);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5, int extent6, int extent7,
>                                        int extent8);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5, int extent6, int extent7,
>                                        int extent8, int extent9);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5, int extent6, int extent7,
>                                        int extent8, int extent9,
>                                        int extent10);
>    void resizeAndPreserve(int extent1,
>                                        int extent2, int extent3, int extent4,
>                                        int extent5, int extent6, int extent7,
>                                        int extent8, int extent9, int extent10,
>                                        int extent11);
>
>
>
>
>    T_array reverse(int rank);
>    void reverseSelf(int rank);
>
>    int rows() const
>    { return length_[0]; }
>
>    void setStorage(GeneralArrayStorage<N_rank>);
>
>    void slice(int rank, Range r);
>
>    const TinyVector<int, N_rank>& shape() const
>    { return length_; }
>
>    int size() const
>    { return numElements(); }
>
>    const TinyVector<int, N_rank>& stride() const
>    { return stride_; }
>
>    int stride(int rank) const
>    { return stride_[rank]; }
>
>    int ubound(int rank) const
>    { return base(rank) + length_(rank) - 1; }
>
>    TinyVector<int, N_rank> ubound() const
>    {
>        TinyVector<int, N_rank> ub;
>        for (int i=0; i < N_rank; ++i)
>          ub(i) = base(i) + extent(i) - 1;
>
>        return ub;
>    }
>
>    int zeroOffset() const
>    { return zeroOffset_; }
>
>
>
>
>
>    bool isInRangeForDim(int i, int d) const {
>        return i >= base(d) && (i - base(d)) < length_[d];
>    }
>
>    bool isInRange(int i0) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0];
>    }
>
>    bool isInRange(int i0, int i1) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1];
>    }
>
>    bool isInRange(int i0, int i1, int i2) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4, int i5) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4]
>            && i5 >= base(5) && (i5 - base(5)) < length_[5];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4, int i5, int i6) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4]
>            && i5 >= base(5) && (i5 - base(5)) < length_[5]
>            && i6 >= base(6) && (i6 - base(6)) < length_[6];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4,
>        int i5, int i6, int i7) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4]
>            && i5 >= base(5) && (i5 - base(5)) < length_[5]
>            && i6 >= base(6) && (i6 - base(6)) < length_[6]
>            && i7 >= base(7) && (i7 - base(7)) < length_[7];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4,
>        int i5, int i6, int i7, int i8) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4]
>            && i5 >= base(5) && (i5 - base(5)) < length_[5]
>            && i6 >= base(6) && (i6 - base(6)) < length_[6]
>            && i7 >= base(7) && (i7 - base(7)) < length_[7]
>            && i8 >= base(8) && (i8 - base(8)) < length_[8];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4,
>        int i5, int i6, int i7, int i8, int i9) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4]
>            && i5 >= base(5) && (i5 - base(5)) < length_[5]
>            && i6 >= base(6) && (i6 - base(6)) < length_[6]
>            && i7 >= base(7) && (i7 - base(7)) < length_[7]
>            && i8 >= base(8) && (i8 - base(8)) < length_[8]
>            && i9 >= base(9) && (i9 - base(9)) < length_[9];
>    }
>
>    bool isInRange(int i0, int i1, int i2, int i3, int i4,
>        int i5, int i6, int i7, int i8, int i9, int i10) const {
>        return i0 >= base(0) && (i0 - base(0)) < length_[0]
>            && i1 >= base(1) && (i1 - base(1)) < length_[1]
>            && i2 >= base(2) && (i2 - base(2)) < length_[2]
>            && i3 >= base(3) && (i3 - base(3)) < length_[3]
>            && i4 >= base(4) && (i4 - base(4)) < length_[4]
>            && i5 >= base(5) && (i5 - base(5)) < length_[5]
>            && i6 >= base(6) && (i6 - base(6)) < length_[6]
>            && i7 >= base(7) && (i7 - base(7)) < length_[7]
>            && i8 >= base(8) && (i8 - base(8)) < length_[8]
>            && i9 >= base(9) && (i9 - base(9)) < length_[9]
>            && i10 >= base(10) && (i10 - base(10)) < length_[10];
>    }
>
>    bool isInRange(const T_index& index) const {
>        for (int i=0; i < N_rank; ++i)
>            if (index[i] < base(i) || (index[i] - base(i)) >= length_[i])
>                return false;
>
>        return true;
>    }
>
>    bool assertInRange(const T_index& ) const {
>        ;
>
>
>        return true;
>    }
>
>    bool assertInRange(int ) const {
>        ;
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ) const {
>        ;
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int ) const
>    {
>        ;
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int ) const
>    {
>        ;
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int ,
>        int ) const
>    {
>        ;
>
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int , int ,
>        int ) const
>    {
>        ;
>
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int , int ,
>        int , int ) const
>    {
>        ;
>
>
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int , int ,
>        int , int ,
>        int ) const
>    {
>        ;
>
>
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int , int ,
>        int , int , int ,
>        int ) const
>    {
>        ;
>
>
>
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int , int ,
>        int , int , int ,
>        int , int ) const
>    {
>        ;
>
>
>
>
>
>
>        return true;
>    }
>
>    bool assertInRange(int , int ,
>        int , int , int ,
>        int , int , int ,
>        int , int ,
>        int ) const
>    {
>        ;
>
>
>
>
>
>
>        return true;
>    }
>
>
>
>
>
>    template<int N_rank2>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,N_rank2>& index) const
>    {
>        assertInRange(index);
>        return data_[dot(index, stride_)];
>    }
>
>    template<int N_rank2>
>    T_numtype& __restrict__ operator()(const TinyVector<int,N_rank2>& index)
>    {
>        assertInRange(index);
>        return data_[dot(index, stride_)];
>    }
>
>    const T_numtype& __restrict__ operator()(TinyVector<int,1> index) const
>    {
>        assertInRange(index[0]);
>        return data_[index[0] * stride_[0]];
>    }
>
>    T_numtype& operator()(TinyVector<int,1> index)
>    {
>        assertInRange(index[0]);
>        return data_[index[0] * stride_[0]];
>    }
>
>    const T_numtype& __restrict__ operator()(TinyVector<int,2> index) const
>    {
>        assertInRange(index[0], index[1]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]];
>    }
>
>    T_numtype& operator()(TinyVector<int,2> index)
>    {
>        assertInRange(index[0], index[1]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]];
>    }
>
>    const T_numtype& __restrict__ operator()(TinyVector<int,3> index) const
>    {
>        assertInRange(index[0], index[1], index[2]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2]];
>    }
>
>    T_numtype& operator()(TinyVector<int,3> index)
>    {
>        assertInRange(index[0], index[1], index[2]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,4>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,4>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,5>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,5>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,6>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,6>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,7>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,7>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,8>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,8>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,9>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7], index[8]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]
>            + index[8] * stride_[8]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,9>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7], index[8]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]
>            + index[8] * stride_[8]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,10>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7], index[8], index[9]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]
>            + index[8] * stride_[8] + index[9] * stride_[9]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,10>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7], index[8], index[9]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]
>            + index[8] * stride_[8] + index[9] * stride_[9]];
>    }
>
>    const T_numtype& __restrict__ operator()(const TinyVector<int,11>& index) const
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7], index[8], index[9],
>            index[10]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]
>            + index[8] * stride_[8] + index[9] * stride_[9]
>            + index[10] * stride_[10]];
>    }
>
>    T_numtype& operator()(const TinyVector<int,11>& index)
>    {
>        assertInRange(index[0], index[1], index[2], index[3],
>            index[4], index[5], index[6], index[7], index[8], index[9],
>            index[10]);
>        return data_[index[0] * stride_[0] + index[1] * stride_[1]
>            + index[2] * stride_[2] + index[3] * stride_[3]
>            + index[4] * stride_[4] + index[5] * stride_[5]
>            + index[6] * stride_[6] + index[7] * stride_[7]
>            + index[8] * stride_[8] + index[9] * stride_[9]
>            + index[10] * stride_[10]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0) const
>    {
>        assertInRange(i0);
>        return data_[i0 * stride_[0]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0)
>    {
>        assertInRange(i0);
>        return data_[i0 * stride_[0]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1) const
>    {
>        assertInRange(i0, i1);
>        return data_[i0 * stride_[0] + i1 * stride_[1]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1)
>    {
>        assertInRange(i0, i1);
>        return data_[i0 * stride_[0] + i1 * stride_[1]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2) const
>    {
>        assertInRange(i0, i1, i2);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2)
>    {
>        assertInRange(i0, i1, i2);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3) const
>    {
>        assertInRange(i0, i1, i2, i3);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3)
>    {
>        assertInRange(i0, i1, i2, i3);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4) const
>    {
>        assertInRange(i0, i1, i2, i3, i4);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4)
>    {
>        assertInRange(i0, i1, i2, i3, i4);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5) const
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5)
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6) const
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6)
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7) const
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7)
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7, int i8) const
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7, i8);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]
>            + i8 * stride_[8]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7, int i8)
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7, i8);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]
>            + i8 * stride_[8]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7, int i8, int i9) const
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7, i8, i9);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]
>            + i8 * stride_[8] + i9 * stride_[9]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7, int i8, int i9)
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7, i8, i9);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]
>            + i8 * stride_[8] + i9 * stride_[9]];
>    }
>
>    const T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7, int i8, int i9, int i10) const
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7, i8,
>            i9, i10);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]
>            + i8 * stride_[8] + i9 * stride_[9] + i10 * stride_[10]];
>    }
>
>    T_numtype& __restrict__ operator()(int i0, int i1, int i2, int i3,
>        int i4, int i5, int i6, int i7, int i8, int i9, int i10)
>    {
>        assertInRange(i0, i1, i2, i3, i4, i5, i6, i7, i8,
>            i9, i10);
>        return data_[i0 * stride_[0] + i1 * stride_[1]
>            + i2 * stride_[2] + i3 * stride_[3] + i4 * stride_[4]
>            + i5 * stride_[5] + i6 * stride_[6] + i7 * stride_[7]
>            + i8 * stride_[8] + i9 * stride_[9] + i10 * stride_[10]];
>    }
>
>
>
>
>
>
>    T_array& noConst() const
>    { return const_cast<T_array&>(*this); }
>
>    T_array operator()(const RectDomain<N_rank>& subdomain) const
>    {
>        return T_array(noConst(), subdomain);
>    }
>
>
>    T_array operator()(const StridedDomain<N_rank>& subdomain) const
>    {
>        return T_array(noConst(), subdomain);
>    }
>
>    T_array operator()(Range r0) const
>    {
>        return T_array(noConst(), r0);
>    }
>
>    T_array operator()(Range r0, Range r1) const
>    {
>        return T_array(noConst(), r0, r1);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2) const
>    {
>        return T_array(noConst(), r0, r1, r2);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4,
>        Range r5) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4, r5);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4,
>        Range r5, Range r6) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4, r5, r6);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4,
>        Range r5, Range r6, Range r7) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4, r5, r6, r7);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4,
>        Range r5, Range r6, Range r7, Range r8) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4, r5, r6, r7, r8);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4,
>        Range r5, Range r6, Range r7, Range r8, Range r9) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4, r5, r6, r7, r8, r9);
>    }
>
>    T_array operator()(Range r0, Range r1, Range r2, Range r3, Range r4,
>        Range r5, Range r6, Range r7, Range r8, Range r9, Range r10) const
>    {
>        return T_array(noConst(), r0, r1, r2, r3, r4, r5, r6, r7, r8, r9, r10);
>    }
># 1908 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    template<typename T1, typename T2>
>    typename SliceInfo<T_numtype,T1,T2>::T_slice
>    operator()(T1 r1, T2 r2) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2>::T_slice slice;
>        return slice(noConst(), r1, r2, nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3>
>    typename SliceInfo<T_numtype,T1,T2,T3>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, nilArraySection(),
>            nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5, T6 r6) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, r6, nilArraySection(), nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6,
>        typename T7>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5, T6 r6, T7 r7) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, r6, r7, nilArraySection(), nilArraySection(),
>            nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6,
>        typename T7, typename T8>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5, T6 r6, T7 r7, T8 r8) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, r6, r7, r8,
>            nilArraySection(), nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6,
>        typename T7, typename T8, typename T9>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8,T9>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5, T6 r6, T7 r7, T8 r8, T9 r9) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8,T9>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, r6, r7, r8, r9, nilArraySection(), nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6,
>        typename T7, typename T8, typename T9, typename T10>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5, T6 r6, T7 r7, T8 r8, T9 r9, T10 r10) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, nilArraySection());
>    }
>
>    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6,
>        typename T7, typename T8, typename T9, typename T10, typename T11>
>    typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_slice
>    operator()(T1 r1, T2 r2, T3 r3, T4 r4, T5 r5, T6 r6, T7 r7, T8 r8, T9 r9, T10 r10, T11 r11) const
>    {
>        typedef typename SliceInfo<T_numtype,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_slice slice;
>        return slice(noConst(), r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11);
>    }
># 2017 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    template<int N0>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0> >
>    operator()(IndexPlaceholder<N0>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0> >
>            (noConst());
>    }
>
>    template<int N0, int N1>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1> >(noConst());
>    }
>
>    template<int N0, int N1, int N2>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3, N4> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>,
>        IndexPlaceholder<N4>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4, int N5>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3,
>        N4, N5> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>, IndexPlaceholder<N4>,
>        IndexPlaceholder<N5>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4, N5> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4, int N5, int N6>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3,
>        N4, N5, N6> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>, IndexPlaceholder<N4>,
>        IndexPlaceholder<N5>, IndexPlaceholder<N6>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4, N5, N6> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4, int N5, int N6,
>        int N7>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3,
>        N4, N5, N6, N7> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>, IndexPlaceholder<N4>,
>        IndexPlaceholder<N5>, IndexPlaceholder<N6>,
>        IndexPlaceholder<N7>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4, N5, N6, N7> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4, int N5, int N6,
>        int N7, int N8>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3,
>        N4, N5, N6, N7, N8> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>, IndexPlaceholder<N4>,
>        IndexPlaceholder<N5>, IndexPlaceholder<N6>, IndexPlaceholder<N7>,
>        IndexPlaceholder<N8>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4, N5, N6, N7, N8> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4, int N5, int N6,
>        int N7, int N8, int N9>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3,
>        N4, N5, N6, N7, N8, N9> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>, IndexPlaceholder<N4>,
>        IndexPlaceholder<N5>, IndexPlaceholder<N6>, IndexPlaceholder<N7>,
>        IndexPlaceholder<N8>, IndexPlaceholder<N9>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4, N5, N6, N7, N8, N9> >(noConst());
>    }
>
>    template<int N0, int N1, int N2, int N3, int N4, int N5, int N6,
>        int N7, int N8, int N9, int N10>
>    _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0, N1, N2, N3,
>        N4, N5, N6, N7, N8, N9, N10> >
>    operator()(IndexPlaceholder<N0>, IndexPlaceholder<N1>,
>        IndexPlaceholder<N2>, IndexPlaceholder<N3>, IndexPlaceholder<N4>,
>        IndexPlaceholder<N5>, IndexPlaceholder<N6>, IndexPlaceholder<N7>,
>        IndexPlaceholder<N8>, IndexPlaceholder<N9>,
>        IndexPlaceholder<N10>) const
>    {
>        return _bz_ArrayExpr<ArrayIndexMapping<T_numtype, N_rank, N0,
>            N1, N2, N3, N4, N5, N6, N7, N8, N9, N10> >(noConst());
>    }
># 2145 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    Array<typename multicomponent_traits<T_numtype>::T_element,N_rank>
>    operator[](const unsigned component) {
>        typedef typename multicomponent_traits<T_numtype>::T_element T_compType;
>
>        return extractComponent(T_compType(),component,
>                                multicomponent_traits<T_numtype>::numComponents);
>    }
>
>    const Array<typename multicomponent_traits<T_numtype>::T_element,N_rank>
>    operator[](const unsigned component) const {
>        typedef typename multicomponent_traits<T_numtype>::T_element T_compType;
>
>        return extractComponent(T_compType(),component,
>                                multicomponent_traits<T_numtype>::numComponents);
>    }
>
>    Array<typename multicomponent_traits<T_numtype>::T_element,N_rank>
>    operator[](const int component) {
>        return operator[](static_cast<unsigned>(component));
>    }
>
>    const Array<typename multicomponent_traits<T_numtype>::T_element,N_rank>
>    operator[](const int component) const {
>        return operator[](static_cast<unsigned>(component));
>    }
>
>
>
>
>
>    template<typename T_indexContainer>
>    IndirectArray<T_array, T_indexContainer>
>    operator[](const T_indexContainer& index)
>    {
>        return IndirectArray<T_array, T_indexContainer>(*this,
>            const_cast<T_indexContainer&>(index));
>    }
># 2190 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    ListInitializationSwitch<T_array,T_numtype*> operator=(T_numtype x)
>    {
>        return ListInitializationSwitch<T_array,T_numtype*>(*this, x);
>    }
>
>    T_array& initialize(T_numtype);
>
>
>
>
>
>    template<typename T_expr>
>    T_array& operator=(const ETBase<T_expr>&);
>    T_array& operator=(const Array<T_numtype,N_rank>&);
>
>    template<typename T> T_array& operator+=(const T&);
>    template<typename T> T_array& operator-=(const T&);
>    template<typename T> T_array& operator*=(const T&);
>    template<typename T> T_array& operator/=(const T&);
>    template<typename T> T_array& operator%=(const T&);
>    template<typename T> T_array& operator^=(const T&);
>    template<typename T> T_array& operator&=(const T&);
>    template<typename T> T_array& operator|=(const T&);
>    template<typename T> T_array& operator>>=(const T&);
>    template<typename T> T_array& operator<<=(const T&);
># 2283 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>public:
>
>
>    template<typename T_expr, typename T_update>
>    inline T_array& evaluate(T_expr expr, T_update);
># 2299 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    template<typename T_expr, typename T_update>
>    inline T_array& evaluateWithTiled2DTraversal(
>        T_expr expr, T_update);
>
>
>    template<typename T_expr, typename T_update>
>    inline T_array& evaluateWithIndexTraversal1(
>        T_expr expr, T_update);
>
>    template<typename T_expr, typename T_update>
>    inline T_array& evaluateWithIndexTraversalN(
>        T_expr expr, T_update);
>
>    template<typename T_expr, typename T_update>
>    inline T_array& evaluateWithStackTraversal1(
>        T_expr expr, T_update);
>
>    template<typename T_expr, typename T_update>
>    inline T_array& evaluateWithStackTraversalN(
>        T_expr expr, T_update);
>
>
>    T_numtype* __restrict__ getInitializationIterator() { return dataFirst(); }
>
>    bool canCollapse(int outerRank, int innerRank) const {
>
>
>
>
>
>        return (stride(innerRank) * extent(innerRank) == stride(outerRank));
>    }
>
>protected:
>
>
>
>
>    inline void computeStrides();
>    inline void setupStorage(int rank);
>    void constructSubarray(Array<T_numtype, N_rank>& array,
>        const RectDomain<N_rank>&);
>    void constructSubarray(Array<T_numtype, N_rank>& array,
>        const StridedDomain<N_rank>&);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0, Range r1);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4, Range r5);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4, Range r5, Range r6);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4, Range r5, Range r6,
>        Range r7);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4, Range r5, Range r6,
>        Range r7, Range r8);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4, Range r5, Range r6,
>        Range r7, Range r8, Range r9);
>    void constructSubarray(Array<T_numtype, N_rank>& array, Range r0,
>        Range r1, Range r2, Range r3, Range r4, Range r5, Range r6,
>        Range r7, Range r8, Range r9, Range r10);
>
>    void calculateZeroOffset();
>
>    template<int N_rank2, typename R0, typename R1, typename R2, typename R3, typename R4,
>        typename R5, typename R6, typename R7, typename R8, typename R9, typename R10>
>    void constructSlice(Array<T_numtype, N_rank2>& array, R0 r0, R1 r1, R2 r2,
>        R3 r3, R4 r4, R5 r5, R6 r6, R7 r7, R8 r8, R9 r9, R10 r10);
>
>    template<int N_rank2>
>    void slice(int& setRank, Range r, Array<T_numtype,N_rank2>& array,
>        TinyVector<int,N_rank2>& rankMap, int sourceRank);
>
>    template<int N_rank2>
>    void slice(int& setRank, int i, Array<T_numtype,N_rank2>& array,
>        TinyVector<int,N_rank2>& rankMap, int sourceRank);
>
>    template<int N_rank2>
>    void slice(int&, nilArraySection, Array<T_numtype,N_rank2>&,
>        TinyVector<int,N_rank2>&, int)
>    { }
>
>    void doTranspose(int destRank, int sourceRank, T_array& array);
>
>protected:
># 2412 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>    GeneralArrayStorage<N_rank> storage_;
>    TinyVector<int, N_rank> length_;
>    TinyVector<int, N_rank> stride_;
>    int zeroOffset_;
>};
># 2430 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h"
>const int firstRank = 0;
>const int secondRank = 1;
>const int thirdRank = 2;
>const int fourthRank = 3;
>const int fifthRank = 4;
>const int sixthRank = 5;
>const int seventhRank = 6;
>const int eighthRank = 7;
>const int ninthRank = 8;
>const int tenthRank = 9;
>const int eleventhRank = 10;
>
>const int firstDim = 0;
>const int secondDim = 1;
>const int thirdDim = 2;
>const int fourthDim = 3;
>const int fifthDim = 4;
>const int sixthDim = 5;
>const int seventhDim = 6;
>const int eighthDim = 7;
>const int ninthDim = 8;
>const int tenthDim = 9;
>const int eleventhDim = 10;
>
>
>
>
>
>template<typename T_numtype>
>ostream& operator<<(ostream&, const Array<T_numtype,1>&);
>
>template<typename T_numtype>
>ostream& operator<<(ostream&, const Array<T_numtype,2>&);
>
>template<typename T_numtype, int N_rank>
>ostream& operator<<(ostream&, const Array<T_numtype,N_rank>&);
>
>template<typename T_numtype, int N_rank>
>istream& operator>>(istream& is, Array<T_numtype,N_rank>& x);
>
>template <typename P_numtype,int N_rank>
>void swap(Array<P_numtype,N_rank>& a,Array<P_numtype,N_rank>& b) {
>    Array<P_numtype,N_rank> c(a);
>    a.reference(b);
>    b.reference(c);
>}
>
>template <typename P_expr>
>void find(Array<TinyVector<int,P_expr::rank>,1>& indices,
>          const _bz_ArrayExpr<P_expr>& expr) {
>    find(indices,
>         static_cast< Array<typename P_expr::T_numtype,P_expr::rank> >(expr));
>}
>
>template <typename P_numtype, int N_rank>
>void find(Array<TinyVector<int,N_rank>,1>& indices,
>          const Array<P_numtype,N_rank>& exprVals) {
>    indices.resize(exprVals.size());
>    typename Array<P_numtype,N_rank>::const_iterator it, end = exprVals.end();
>    int j=0;
>    for (it = exprVals.begin(); it != end; ++it)
>        if (*it)
>            indices(j++) = it.position();
>    if (j)
>        indices.resizeAndPreserve(j);
>    else
>        indices.free();
>    return;
>}
>
>
>}
>
>
>
>
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/iter.h" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/iter.h"
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iterator" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iterator" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iterator" 3
># 72 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iterator" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stream_iterator.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stream_iterator.h" 3
>       
># 39 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stream_iterator.h" 3
>
>
>
>namespace std
>{
>
>  template<typename _Tp, typename _CharT = char,
>           typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t>
>    class istream_iterator
>    : public iterator<input_iterator_tag, _Tp, _Dist, const _Tp*, const _Tp&>
>    {
>    public:
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef basic_istream<_CharT, _Traits> istream_type;
>
>    private:
>      istream_type* _M_stream;
>      _Tp _M_value;
>      bool _M_ok;
>
>    public:
>
>      istream_iterator()
>      : _M_stream(0), _M_value(), _M_ok(false) {}
>
>
>      istream_iterator(istream_type& __s)
>      : _M_stream(&__s)
>      { _M_read(); }
>
>      istream_iterator(const istream_iterator& __obj)
>      : _M_stream(__obj._M_stream), _M_value(__obj._M_value),
>        _M_ok(__obj._M_ok)
>      { }
>
>      const _Tp&
>      operator*() const
>      {
> ;
>
>
> return _M_value;
>      }
>
>      const _Tp*
>      operator->() const { return &(operator*()); }
>
>      istream_iterator&
>      operator++()
>      {
> ;
>
>
> _M_read();
> return *this;
>      }
>
>      istream_iterator
>      operator++(int)
>      {
> ;
>
>
> istream_iterator __tmp = *this;
> _M_read();
> return __tmp;
>      }
>
>      bool
>      _M_equal(const istream_iterator& __x) const
>      { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); }
>
>    private:
>      void
>      _M_read()
>      {
> _M_ok = (_M_stream && *_M_stream) ? true : false;
> if (_M_ok)
>   {
>     *_M_stream >> _M_value;
>     _M_ok = *_M_stream ? true : false;
>   }
>      }
>    };
>
>
>  template<typename _Tp, typename _CharT, typename _Traits, typename _Dist>
>    inline bool
>    operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,
>        const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)
>    { return __x._M_equal(__y); }
>
>
>  template <class _Tp, class _CharT, class _Traits, class _Dist>
>    inline bool
>    operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,
>        const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)
>    { return !__x._M_equal(__y); }
># 150 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stream_iterator.h" 3
>  template<typename _Tp, typename _CharT = char,
>           typename _Traits = char_traits<_CharT> >
>    class ostream_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    public:
>
>
>      typedef _CharT char_type;
>      typedef _Traits traits_type;
>      typedef basic_ostream<_CharT, _Traits> ostream_type;
>
>
>    private:
>      ostream_type* _M_stream;
>      const _CharT* _M_string;
>
>    public:
>
>      ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {}
># 181 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stream_iterator.h" 3
>      ostream_iterator(ostream_type& __s, const _CharT* __c)
>      : _M_stream(&__s), _M_string(__c) { }
>
>
>      ostream_iterator(const ostream_iterator& __obj)
>      : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { }
>
>
>
>      ostream_iterator&
>      operator=(const _Tp& __value)
>      {
> ;
>
>
> *_M_stream << __value;
> if (_M_string) *_M_stream << _M_string;
> return *this;
>      }
>
>      ostream_iterator&
>      operator*()
>      { return *this; }
>
>      ostream_iterator&
>      operator++()
>      { return *this; }
>
>      ostream_iterator&
>      operator++(int)
>      { return *this; }
>    };
>}
># 73 "/usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/iterator" 2 3
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/iter.h" 2
>
>
>namespace blitz {
>
>
>template<typename P_numtype, int N_rank>
>class ConstPointerStack {
>public:
>    typedef P_numtype T_numtype;
>
>    void operator=(const ConstPointerStack<P_numtype,N_rank>& rhs)
>    {
>        for (int i=0; i<N_rank; ++i)
>            stack_[i] = rhs.stack_[i];
>    }
>
>    const T_numtype*& operator[](int position)
>    {
>        return stack_[position];
>    }
>
>private:
>    const T_numtype * stack_[N_rank];
>};
>
>
>template<typename T, int N>
>class ConstArrayIterator {
>public:
>    ConstArrayIterator() : data_(0) { }
>
>    ConstArrayIterator(const Array<T,N>& array)
>    {
>
>
>        strides_ = array.stride();
>        lbound_ = array.lbound();
>        extent_ = array.extent();
>        order_ = array.ordering();
>        data_ = const_cast<T*>(array.dataFirst());
>
>        maxRank_ = order_(0);
>        stride_ = strides_(maxRank_);
>
>        for (int i=0; i < N; ++i)
>        {
>            stack_[i] = data_;
>            last_[i] = data_ + extent_(order_(i)) * strides_(order_(i));
>        }
>
>        pos_ = lbound_;
>    }
>
>    bool operator==(const ConstArrayIterator<T,N>& x) const
>    {
>        return data_ == x.data_;
>    }
>
>    bool operator!=(const ConstArrayIterator<T,N>& x) const
>    {
>        return data_ != x.data_;
>    }
>
>    const T& operator*() const
>    {
>        ;
>
>        return *data_;
>    }
>
>    const T* __restrict__ operator->() const
>    {
>        ;
>
>        return data_;
>    }
>
>    ConstArrayIterator<T,N>& operator++();
>
>    ConstArrayIterator<T,N> operator++(int)
>    {
>        ConstArrayIterator<T,N> tmp = *this;
>        ++(*this);
>        return tmp;
>    }
>
>
>    const TinyVector<int,N>& position() const
>    {
>        ;
>
>        return pos_;
>    }
>
>private:
>    TinyVector<int,N> strides_, lbound_, extent_, order_;
>    ConstPointerStack<T,N> stack_;
>    ConstPointerStack<T,N> last_;
>    int stride_;
>    int maxRank_;
>
>protected:
>    TinyVector<int,N> pos_;
>    T * __restrict__ data_;
>};
>
>
>template<typename T, int N>
>class ArrayIterator : public ConstArrayIterator<T,N> {
>private:
>    typedef ConstArrayIterator<T,N> T_base;
>    using T_base::data_;
>
>public:
>    ArrayIterator() { }
>
>    ArrayIterator(Array<T,N>& x) : T_base(x) { }
>
>    T& operator*() const
>    {
>        ;
>
>        return *data_;
>    }
>
>    T* __restrict__ operator->() const
>    {
>        ;
>
>        return data_;
>    }
>
>    ArrayIterator<T,N>& operator++()
>    {
>        T_base::operator++();
>        return *this;
>    }
>
>    ArrayIterator<T,N> operator++(int)
>    {
>        ArrayIterator<T,N> tmp = *this;
>        ++(*this);
>        return tmp;
>    }
>};
>
>
>template<typename T, int N>
>ConstArrayIterator<T,N>& ConstArrayIterator<T,N>::operator++()
>{
>    ;
>
>    data_ += stride_;
>
>    if (data_ != last_[0])
>    {
>
>        ++pos_[maxRank_];
>        return *this;
>    }
>
>
>
>
>    int j = 1;
>    for (; j < N; ++j)
>    {
>        int r = order_(j);
>        data_ = const_cast<T*>(stack_[j]);
>        data_ += strides_[r];
>        ++pos_(r);
>
>        if (data_ != last_[j])
>            break;
>    }
>
>
>    if (j == N)
>    {
>
>
>        data_ = 0;
>        return *this;
>    }
>
>    stack_[j] = data_;
>
>
>    for (--j; j >= 0; --j)
>    {
>        int r2 = order_(j);
>        stack_[j] = data_;
>        last_[j] = data_ + extent_(r2) * strides_(r2);
>        pos_(r2) = lbound_(r2);
>    }
>
>    return *this;
>}
>
>
>}
>
>
>
>
>namespace std {
>
>template <typename T, int N>
>struct iterator_traits< blitz::ConstArrayIterator<T,N> >
>{
>    typedef forward_iterator_tag iterator_category;
>    typedef T value_type;
>    typedef ptrdiff_t difference_type;
>    typedef const T* pointer;
>    typedef const T& reference;
>};
>
>template <typename T, int N>
>struct iterator_traits< blitz::ArrayIterator<T,N> >
>{
>    typedef forward_iterator_tag iterator_category;
>    typedef T value_type;
>    typedef ptrdiff_t difference_type;
>    typedef T* pointer;
>    typedef T& reference;
>};
>
>}
># 2509 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/fastiter.h" 1
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/fastiter.h"
>namespace blitz {
>
>
>
>
>
>template<typename P_numtype, int N_rank>
>class FastArrayIterator {
>public:
>    typedef P_numtype T_numtype;
>    typedef Array<T_numtype, N_rank> T_array;
>    typedef FastArrayIterator<P_numtype, N_rank> T_iterator;
>    typedef const T_array& T_ctorArg1;
>    typedef int T_ctorArg2;
>
>    static const int
>        numArrayOperands = 1,
>        numIndexPlaceholders = 0,
>        rank = N_rank;
>
>
>
>    FastArrayIterator(const FastArrayIterator<P_numtype, N_rank>& x)
>        : data_(x.data_), array_(x.array_)
>    { }
>
>    void operator=(const FastArrayIterator<P_numtype, N_rank>& x)
>    {
>        array_ = x.array_;
>        data_ = x.data_;
>        stack_ = x.stack_;
>        stride_ = x.stride_;
>    }
>
>    FastArrayIterator(const T_array& array)
>        : array_(array)
>    {
>        data_ = array.data();
>    }
>
>    ~FastArrayIterator()
>    { }
>
>
>
>
>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return array_(i); }
>
>
>    int ascending(int rank)
>    {
>        if (rank < N_rank)
>            return array_.isRankStoredAscending(rank);
>        else
>            return (-2147483647 - 1);
>    }
>
>    int ordering(int rank)
>    {
>        if (rank < N_rank)
>            return array_.ordering(rank);
>        else
>            return (-2147483647 - 1);
>    }
>
>    int lbound(int rank)
>    {
>        if (rank < N_rank)
>            return array_.lbound(rank);
>        else
>            return (-2147483647 - 1);
>    }
>
>    int ubound(int rank)
>    {
>        if (rank < N_rank)
>            return array_.ubound(rank);
>        else
>            return 2147483647;
>    }
>
>    T_numtype operator*()
>    { return *data_; }
>
>    T_numtype operator[](int i)
>    { return data_[i * stride_]; }
>
>    T_numtype fastRead(int i)
>    { return data_[i]; }
>
>    int suggestStride(int rank) const
>    { return array_.stride(rank); }
>
>    bool isStride(int rank, int stride) const
>    { return array_.stride(rank) == stride; }
>
>    void push(int position)
>    {
>        stack_[position] = data_;
>    }
>
>    void pop(int position)
>    {
>        data_ = stack_[position];
>    }
>
>    void advance()
>    {
>        data_ += stride_;
>    }
>
>    void advance(int n)
>    {
>        data_ += n * stride_;
>    }
>
>    void loadStride(int rank)
>    {
>        stride_ = array_.stride(rank);
>    }
>
>    const T_numtype * __restrict__ data() const
>    { return data_; }
>
>    void _bz_setData(const T_numtype* ptr)
>    { data_ = ptr; }
>
>    int stride() const
>    { return stride_; }
>
>    bool isUnitStride(int rank) const
>    { return array_.stride(rank) == 1; }
>
>    void advanceUnitStride()
>    { ++data_; }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    { return array_.canCollapse(outerLoopRank, innerLoopRank); }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        if (format.tersePrintingSelected())
>            str += format.nextArrayOperandSymbol();
>        else if (format.dumpArrayShapesMode())
>        {
>
>     std::ostringstream ostr;
>
>
>
>            ostr << array_.shape();
>            str += ostr.str();
>        }
>        else {
>            str += "Array<";
>            str += typeid(T_numtype).name();
>            str += ",";
>
>            char tmpBuf[10];
>            sprintf(tmpBuf, "%d", N_rank);
>
>            str += tmpBuf;
>            str += ">";
>        }
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    { return areShapesConformable(shape, array_.length()); }
>
>
>
>    T_numtype& operator()(int i)
>    {
>        return (T_numtype&)data_[i*array_.stride(0)];
>    }
>
>
>    T_numtype& operator()(int i, int j)
>    {
>        return (T_numtype&)data_[i*array_.stride(0) + j*array_.stride(1)];
>    }
>
>
>    T_numtype& operator()(int i, int j, int k)
>    {
>        return (T_numtype&)data_[i*array_.stride(0) + j*array_.stride(1)
>          + k*array_.stride(2)];
>    }
>
>
>
>    void moveTo(int i, int j)
>    {
>        data_ = &const_cast<T_array&>(array_)(i,j);
>    }
>
>    void moveTo(int i, int j, int k)
>    {
>        data_ = &const_cast<T_array&>(array_)(i,j,k);
>    }
>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        data_ = &const_cast<T_array&>(array_)(i);
>    }
>
>
>    void operator=(T_numtype x)
>    { *const_cast<T_numtype*>(data_) = x; }
>
>
>    template<typename T_value>
>    void operator=(T_value x)
>    { *const_cast<T_numtype*>(data_) = x; }
>
>
>    template<typename T_value>
>    void operator+=(T_value x)
>    { *const_cast<T_numtype*>(data_) += x; }
>
>
>
>
>    operator T_numtype() const
>    { return *data_; }
>
>
>    T_numtype shift(int offset, int dim)
>    {
>        return data_[offset*array_.stride(dim)];
>    }
>
>
>    T_numtype shift(int offset1, int dim1, int offset2, int dim2)
>    {
>        return data_[offset1*array_.stride(dim1)
>            + offset2*array_.stride(dim2)];
>    }
>
>private:
>    const T_numtype * __restrict__ data_;
>    const T_array& array_;
>    ConstPointerStack<T_numtype,N_rank> stack_;
>    int stride_;
>};
>
>}
># 2510 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/ops.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/ops.h"
>namespace blitz {
># 88 "/mn/anatu/cma-u3/tmac/usr/include/blitz/ops.h"
>template<typename T_numtype1> struct BitwiseNot { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ~ a; } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "~"; t1.prettyPrint(str, format); } };
>template<typename T_numtype1> struct UnaryPlus { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return + a; } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "+"; t1.prettyPrint(str, format); } };
>template<typename T_numtype1> struct UnaryMinus { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return - a; } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "-"; t1.prettyPrint(str, format); } };
># 112 "/mn/anatu/cma-u3/tmac/usr/include/blitz/ops.h"
>template<typename T_numtype1> struct LogicalNot { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a) { return ! a; } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "!"; t1.prettyPrint(str, format); } };
># 139 "/mn/anatu/cma-u3/tmac/usr/include/blitz/ops.h"
>template<typename T_numtype1, typename T_numtype2> struct Add { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a + b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "+"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Subtract { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a - b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "-"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Multiply { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a * b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "*"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Divide { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a / b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "/"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Modulo { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a % b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "%"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct BitwiseXor { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a ^ b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "^"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct BitwiseAnd { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a & b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "&"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct BitwiseOr { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a | b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "|"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct ShiftRight { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a >> b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += ">>"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct ShiftLeft { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a << b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "<<"; t2.prettyPrint(str, format); str += ")"; } };
># 174 "/mn/anatu/cma-u3/tmac/usr/include/blitz/ops.h"
>template<typename T_numtype1, typename T_numtype2> struct Greater { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a > b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += ">"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Less { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a < b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "<"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct GreaterOrEqual { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a >= b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += ">="; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct LessOrEqual { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a <= b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "<="; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Equal { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a == b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "=="; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct NotEqual { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a != b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "!="; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct LogicalAnd { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a && b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "&&"; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct LogicalOr { typedef bool T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return a || b; } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "("; t1.prettyPrint(str, format); str += "||"; t2.prettyPrint(str, format); str += ")"; } };
>
>
>}
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h" 2
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/shapecheck.h" 1
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/shapecheck.h"
>namespace blitz {
># 40 "/mn/anatu/cma-u3/tmac/usr/include/blitz/shapecheck.h"
>template<typename T_shape1, typename T_shape2>
>inline bool areShapesConformable(const T_shape1&, const T_shape2&)
>{
>
>
>
>
>    return false;
>}
>
>template<typename T_shape>
>inline bool areShapesConformable(const T_shape& a, const T_shape& b)
>{
>
>
>
>
>
>
>    for (unsigned i=0; i < a.length(); ++i)
>    {
>        if (a[i] != b[i])
>        {
>            ;
>
>            return false;
>        }
>    }
>
>    return true;
>}
>
>}
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numinquire.h" 1
># 56 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numinquire.h"
>namespace blitz {
># 65 "/mn/anatu/cma-u3/tmac/usr/include/blitz/numinquire.h"
>template<typename T_numtype>
>struct _bz_OneZeroTraits {
>    static inline T_numtype zero() { return 0; }
>    static inline T_numtype one() { return 1; }
>};
>
>
>
>template<>
>struct _bz_OneZeroTraits<complex<float> > {
>    static inline complex<float> zero() { return complex<float>(0.0f,0.0f); }
>    static inline complex<float> one() { return complex<float>(1.0f,0.0f); }
>};
>
>template<>
>struct _bz_OneZeroTraits<complex<double> > {
>    static inline complex<double> zero() { return complex<double>(0.0,0.0); }
>    static inline complex<double> one() { return complex<double>(1.0,0.0); }
>};
>
>template<>
>struct _bz_OneZeroTraits<complex<long double> > {
>    static inline complex<long double> zero()
>    { return complex<long double>(0.0,0.0); }
>
>    static inline complex<long double> one()
>    { return complex<long double>(1.0,0.0); }
>};
>
>
>
>template<typename T>
>inline T zero(T)
>{
>    return _bz_OneZeroTraits<T>::zero();
>}
>
>template<typename T>
>inline T one(T)
>{
>    return _bz_OneZeroTraits<T>::one();
>}
>
>template<typename T>
>inline int digits(T)
>{
>    return numeric_limits<T>::digits;
>}
>
>template<typename T>
>inline int digits10(T)
>{
>    return numeric_limits<T>::digits10;
>}
>
>template<typename T>
>inline T epsilon(T)
>{
>    return numeric_limits<T>::epsilon();
>}
>
>
>
>template<typename T>
>inline T neghuge(T)
>{
>    return numeric_limits<T>::is_integer ? numeric_limits<T>::min()
>                                         : - numeric_limits<T>::max();
>}
>
>template<typename T>
>inline T huge(T)
>{
>    return numeric_limits<T>::max();
>}
>
>template<typename T>
>inline T tiny(T)
>{
>    return numeric_limits<T>::min();
>}
>
>template<typename T>
>inline int max_exponent(T)
>{
>    return numeric_limits<T>::max_exponent;
>}
>
>template<typename T>
>inline int min_exponent(T)
>{
>    return numeric_limits<T>::min_exponent;
>}
>
>template<typename T>
>inline int min_exponent10(T)
>{
>    return numeric_limits<T>::min_exponent10;
>}
>
>template<typename T>
>inline int max_exponent10(T)
>{
>    return numeric_limits<T>::max_exponent10;
>}
>
>template<typename T>
>inline int precision(T)
>{
>    return numeric_limits<T>::digits10;
>}
>
>template<typename T>
>inline int radix(T)
>{
>    return numeric_limits<T>::radix;
>}
>
>template<typename T>
>inline Range range(T)
>{
>    return Range(numeric_limits<T>::min_exponent10,
>        numeric_limits<T>::max_exponent10);
>}
>
>template<typename T>
>inline bool is_signed(T) {
>    return numeric_limits<T>::is_signed;
>}
>
>template<typename T>
>inline bool is_integer(T) {
>    return numeric_limits<T>::is_integer;
>}
>
>template<typename T>
>inline bool is_exact(T) {
>    return numeric_limits<T>::is_exact;
>}
>
>template<typename T>
>inline T round_error(T)
>{
>    return numeric_limits<T>::round_error();
>}
>
>template<typename T>
>inline bool has_infinity(T) {
>    return numeric_limits<T>::has_infinity;
>}
>
>template<typename T>
>inline bool has_quiet_NaN(T) {
>    return numeric_limits<T>::has_quiet_NaN;
>}
>
>template<typename T>
>inline bool has_signaling_NaN(T) {
>    return numeric_limits<T>::has_signaling_NaN;
>}
>
>
>template<typename T>
>inline bool has_signalling_NaN(T) {
>    return numeric_limits<T>::has_signaling_NaN;
>}
>
>template<typename T>
>inline bool has_denorm(T) {
>    return numeric_limits<T>::has_denorm;
>}
>
>template<typename T>
>inline bool has_denorm_loss(T) {
>    return numeric_limits<T>::has_denorm_loss;
>}
>
>template<typename T>
>inline T infinity(T)
>{
>    return numeric_limits<T>::infinity();
>}
>
>template<typename T>
>inline T quiet_NaN(T)
>{
>    return numeric_limits<T>::quiet_NaN();
>}
>
>template<typename T>
>inline T signaling_NaN(T)
>{
>    return numeric_limits<T>::signaling_NaN();
>}
>
>template<typename T>
>inline T signalling_NaN(T)
>{
>    return numeric_limits<T>::signaling_NaN();
>}
>
>template<typename T>
>inline T denorm_min(T)
>{
>    return numeric_limits<T>::denorm_min();
>}
>
>template<typename T>
>inline bool is_iec559(T) {
>    return numeric_limits<T>::is_iec559;
>}
>
>template<typename T>
>inline bool is_bounded(T) {
>    return numeric_limits<T>::is_bounded;
>}
>
>template<typename T>
>inline bool is_modulo(T) {
>    return numeric_limits<T>::is_modulo;
>}
>
>template<typename T>
>inline bool traps(T) {
>    return numeric_limits<T>::traps;
>}
>
>template<typename T>
>inline bool tinyness_before(T) {
>    return numeric_limits<T>::tinyness_before;
>}
>
>template<typename T>
>inline std::float_round_style round_style(T)
>{
>    return numeric_limits<T>::round_style;
>}
>
>}
># 35 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h" 2
># 51 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h"
>namespace blitz {
>
>template<typename T1, typename T2>
>class _bz_ExprPair {
>public:
>    _bz_ExprPair(const T1& a, const T2& b)
>        : first_(a), second_(b)
>    { }
>
>    const T1& first() const
>    { return first_; }
>
>    const T2& second() const
>    { return second_; }
>
>protected:
>    T1 first_;
>    T2 second_;
>};
>
>template<typename T1, typename T2>
>inline _bz_ExprPair<T1,T2> makeExprPair(const T1& a, const T2& b)
>{
>    return _bz_ExprPair<T1,T2>(a,b);
>}
>
>template<typename P_expr>
>class _bz_ArrayExpr
>
>    : public ETBase<_bz_ArrayExpr<P_expr> >
>
>{
>
>public:
>    typedef P_expr T_expr;
>    typedef typename T_expr::T_numtype T_numtype;
>    typedef T_expr T_ctorArg1;
>    typedef int T_ctorArg2;
>
>    static const int
>        numArrayOperands = T_expr::numArrayOperands,
>        numIndexPlaceholders = T_expr::numIndexPlaceholders,
>        rank = T_expr::rank;
>
>    _bz_ArrayExpr(const _bz_ArrayExpr<T_expr>& a)
>
>        : ETBase< _bz_ArrayExpr<T_expr> >(a), iter_(a.iter_)
>
>
>
>    { }
>
>
>    template<typename T>
>    _bz_ArrayExpr(const T& a)
>        : iter_(a)
>    { }
># 120 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h"
>    template<typename T1, typename T2>
>    _bz_ArrayExpr(const T1& a, const T2& b)
>        : iter_(a, b)
>    { }
>
>    template<typename T1, typename T2, typename T3>
>    _bz_ArrayExpr(const T1& a, const T2& b, const T3& c)
>        : iter_(a, b, c)
>    { }
>
>    template<typename T1, typename T2, typename T3, typename T4>
>    _bz_ArrayExpr(const T1& a, const T2& b, const T3& c,
>        const T4& d) : iter_(a, b, c, d)
>    { }
>
>    template<typename T1, typename T2>
>    _bz_ArrayExpr(const _bz_ExprPair<T1,T2>& pair)
>        : iter_(pair.first(), pair.second())
>    { }
>
>    T_numtype operator*()
>    { return *iter_; }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return iter_(i); }
>
>
>    int ascending(int rank)
>    { return iter_.ascending(rank); }
>
>    int ordering(int rank)
>    { return iter_.ordering(rank); }
>
>    int lbound(int rank)
>    { return iter_.lbound(rank); }
>
>    int ubound(int rank)
>    { return iter_.ubound(rank); }
>
>    void push(int position)
>    { iter_.push(position); }
>
>    void pop(int position)
>    { iter_.pop(position); }
>
>    void advance()
>    { iter_.advance(); }
>
>    void advance(int n)
>    { iter_.advance(n); }
>
>    void loadStride(int rank)
>    { iter_.loadStride(rank); }
>
>    bool isUnitStride(int rank) const
>    { return iter_.isUnitStride(rank); }
>
>    void advanceUnitStride()
>    { iter_.advanceUnitStride(); }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>
>        return iter_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return iter_[i]; }
>
>    T_numtype fastRead(int i)
>    { return iter_.fastRead(i); }
>
>    int suggestStride(int rank) const
>    { return iter_.suggestStride(rank); }
>
>    bool isStride(int rank, int stride) const
>    { return iter_.isStride(rank,stride); }
>
>    void prettyPrint(std::string &str) const
>    {
>        prettyPrintFormat format(true);
>        iter_.prettyPrint(str, format);
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    { iter_.prettyPrint(str, format); }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    { return iter_.shapeCheck(shape); }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter_.moveTo(i);
>    }
>
>protected:
>    _bz_ArrayExpr() { }
>
>    T_expr iter_;
>};
>
>struct bounds {
>    static int compute_ascending(int ,
>                                 int ascending1, int ascending2)
>    {
>
>
>
>
>
>        if (ascending1 == ascending2)
>            return ascending1;
>        else if (ascending1 == (-2147483647 - 1))
>            return ascending2;
>        else if (ascending2 == (-2147483647 - 1))
>            return ascending1;
>
>        ;
>
>
>
>        ;
>        return 0;
>    }
>
>    static int compute_ordering(int ,
>                                int order1, int order2)
>    {
>
>
>
>
>
>        if (order1 == order2)
>            return order1;
>        else if (order1 == (-2147483647 - 1))
>            return order2;
>        else if (order2 == (-2147483647 - 1))
>            return order1;
>
>        ;
>
>
>        ;
>        return 0;
>    }
>
>    static int compute_lbound(int ,
>                              int lbound1, int lbound2)
>    {
>
>
>
>
>
>        if (lbound1 == lbound2)
>            return lbound1;
>        else if (lbound1 == (-2147483647 - 1))
>            return lbound2;
>        else if (lbound2 == (-2147483647 - 1))
>            return lbound1;
>
>        ;
>
>
>        ;
>        return 0;
>    }
>
>    static int compute_ubound(int ,
>                              int ubound1, int ubound2)
>    {
>
>
>
>
>
>        if (ubound1 == ubound2)
>            return ubound1;
>        else if (ubound1 == 2147483647)
>            return ubound2;
>        else if (ubound2 == 2147483647)
>            return ubound1;
>
>        ;
>
>
>        ;
>        return 0;
>    }
>};
>
>template<typename P_expr, typename P_op>
>class _bz_ArrayExprUnaryOp {
>public:
>    typedef P_expr T_expr;
>    typedef P_op T_op;
>    typedef typename T_expr::T_numtype T_numtype1;
>    typedef typename T_op::T_numtype T_numtype;
>    typedef T_expr T_ctorArg1;
>    typedef int T_ctorArg2;
>
>    static const int
>        numArrayOperands = T_expr::numArrayOperands,
>        numIndexPlaceholders = T_expr::numIndexPlaceholders,
>        rank = T_expr::rank;
>
>    _bz_ArrayExprUnaryOp(const _bz_ArrayExprUnaryOp<T_expr, T_op>& a)
>        : iter_(a.iter_)
>    { }
>
>    _bz_ArrayExprUnaryOp(const T_expr& a)
>        : iter_(a)
>    { }
>
>    _bz_ArrayExprUnaryOp(typename T_expr::T_ctorArg1 a)
>        : iter_(a)
>    { }
># 355 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h"
>    int ascending(int rank)
>    { return iter_.ascending(rank); }
>
>    int ordering(int rank)
>    { return iter_.ordering(rank); }
>
>    int lbound(int rank)
>    { return iter_.lbound(rank); }
>
>    int ubound(int rank)
>    { return iter_.ubound(rank); }
>
>    T_numtype operator*()
>    { return T_op::apply(*iter_); }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return T_op::apply(iter_(i)); }
>
>
>    void push(int position)
>    {
>        iter_.push(position);
>    }
>
>    void pop(int position)
>    {
>        iter_.pop(position);
>    }
>
>    void advance()
>    {
>        iter_.advance();
>    }
>
>    void advance(int n)
>    {
>        iter_.advance(n);
>    }
>
>    void loadStride(int rank)
>    {
>        iter_.loadStride(rank);
>    }
>
>    bool isUnitStride(int rank) const
>    { return iter_.isUnitStride(rank); }
>
>    void advanceUnitStride()
>    {
>        iter_.advanceUnitStride();
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter_.moveTo(i);
>    }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>
>        return iter_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return T_op::apply(iter_[i]); }
>
>    T_numtype fastRead(int i)
>    { return T_op::apply(iter_.fastRead(i)); }
>
>    int suggestStride(int rank) const
>    { return iter_.suggestStride(rank); }
>
>    bool isStride(int rank, int stride) const
>    { return iter_.isStride(rank,stride); }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    { T_op::prettyPrint(str, format, iter_); }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    { return iter_.shapeCheck(shape); }
>
>protected:
>    _bz_ArrayExprUnaryOp() { }
>
>    T_expr iter_;
>};
>
>
>template<typename P_expr1, typename P_expr2, typename P_op>
>class _bz_ArrayExprBinaryOp {
>public:
>    typedef P_expr1 T_expr1;
>    typedef P_expr2 T_expr2;
>    typedef P_op T_op;
>    typedef typename T_expr1::T_numtype T_numtype1;
>    typedef typename T_expr2::T_numtype T_numtype2;
>    typedef typename T_op::T_numtype T_numtype;
>    typedef T_expr1 T_ctorArg1;
>    typedef T_expr2 T_ctorArg2;
>
>    static const int
>        numArrayOperands = T_expr1::numArrayOperands
>                         + T_expr2::numArrayOperands,
>        numIndexPlaceholders = T_expr1::numIndexPlaceholders
>                             + T_expr2::numIndexPlaceholders,
>        rank = (T_expr1::rank > T_expr2::rank)
>             ? T_expr1::rank : T_expr2::rank;
>
>    _bz_ArrayExprBinaryOp(
>        const _bz_ArrayExprBinaryOp<T_expr1, T_expr2, T_op>& a)
>        : iter1_(a.iter1_), iter2_(a.iter2_)
>    { }
>
>    template<typename T1, typename T2>
>    _bz_ArrayExprBinaryOp(const T1& a, const T2& b)
>        : iter1_(a), iter2_(b)
>    { }
>
>    T_numtype operator*()
>    { return T_op::apply(*iter1_, *iter2_); }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return T_op::apply(iter1_(i), iter2_(i)); }
>
>
>    int ascending(int rank)
>    {
>        return bounds::compute_ascending(rank, iter1_.ascending(rank),
>            iter2_.ascending(rank));
>    }
>
>    int ordering(int rank)
>    {
>        return bounds::compute_ordering(rank, iter1_.ordering(rank),
>            iter2_.ordering(rank));
>    }
>
>    int lbound(int rank)
>    {
>        return bounds::compute_lbound(rank, iter1_.lbound(rank),
>            iter2_.lbound(rank));
>    }
>
>    int ubound(int rank)
>    {
>        return bounds::compute_ubound(rank, iter1_.ubound(rank),
>            iter2_.ubound(rank));
>    }
>
>    void push(int position)
>    {
>        iter1_.push(position);
>        iter2_.push(position);
>    }
>
>    void pop(int position)
>    {
>        iter1_.pop(position);
>        iter2_.pop(position);
>    }
>
>    void advance()
>    {
>        iter1_.advance();
>        iter2_.advance();
>    }
>
>    void advance(int n)
>    {
>        iter1_.advance(n);
>        iter2_.advance(n);
>    }
>
>    void loadStride(int rank)
>    {
>        iter1_.loadStride(rank);
>        iter2_.loadStride(rank);
>    }
>
>    bool isUnitStride(int rank) const
>    { return iter1_.isUnitStride(rank) && iter2_.isUnitStride(rank); }
>
>    void advanceUnitStride()
>    {
>        iter1_.advanceUnitStride();
>        iter2_.advanceUnitStride();
>    }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>
>        return iter1_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter2_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return T_op::apply(iter1_[i], iter2_[i]); }
>
>    T_numtype fastRead(int i)
>    { return T_op::apply(iter1_.fastRead(i), iter2_.fastRead(i)); }
>
>    int suggestStride(int rank) const
>    {
>        int stride1 = iter1_.suggestStride(rank);
>        int stride2 = iter2_.suggestStride(rank);
>        return (stride1 > stride2) ? stride1 : stride2;
>    }
>
>    bool isStride(int rank, int stride) const
>    {
>        return iter1_.isStride(rank,stride) && iter2_.isStride(rank,stride);
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter1_.moveTo(i);
>        iter2_.moveTo(i);
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        T_op::prettyPrint(str, format, iter1_, iter2_);
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    { return iter1_.shapeCheck(shape) && iter2_.shapeCheck(shape); }
>
>protected:
>    _bz_ArrayExprBinaryOp() { }
>
>    T_expr1 iter1_;
>    T_expr2 iter2_;
>};
>
>template<typename P_expr1, typename P_expr2, typename P_expr3, typename P_op>
>class _bz_ArrayExprTernaryOp {
>public:
>    typedef P_expr1 T_expr1;
>    typedef P_expr2 T_expr2;
>    typedef P_expr3 T_expr3;
>    typedef P_op T_op;
>    typedef typename T_expr1::T_numtype T_numtype1;
>    typedef typename T_expr2::T_numtype T_numtype2;
>    typedef typename T_expr3::T_numtype T_numtype3;
>    typedef typename T_op::T_numtype T_numtype;
>    typedef T_expr1 T_ctorArg1;
>    typedef T_expr2 T_ctorArg2;
>    typedef T_expr3 T_ctorArg3;
>
>    static const int
>        numArrayOperands = T_expr1::numArrayOperands
>                         + T_expr2::numArrayOperands
>                         + T_expr3::numArrayOperands,
>        numIndexPlaceholders = T_expr1::numIndexPlaceholders
>                             + T_expr2::numIndexPlaceholders
>                             + T_expr3::numIndexPlaceholders,
>        rank = (T_expr1::rank > T_expr2::rank)
>             ? ((T_expr1::rank > T_expr3::rank)
>                ? T_expr1::rank : T_expr3::rank)
>             : ((T_expr2::rank > T_expr3::rank)
>                ? T_expr2::rank : T_expr3::rank);
>
>    _bz_ArrayExprTernaryOp(
>        const _bz_ArrayExprTernaryOp<T_expr1, T_expr2, T_expr3, T_op>& a)
>        : iter1_(a.iter1_), iter2_(a.iter2_), iter3_(a.iter3_)
>    { }
>
>    template<typename T1, typename T2, typename T3>
>    _bz_ArrayExprTernaryOp(const T1& a, const T2& b, const T3& c)
>        : iter1_(a), iter2_(b), iter3_(c)
>    { }
>
>    T_numtype operator*()
>    { return T_op::apply(*iter1_, *iter2_, *iter3_); }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return T_op::apply(iter1_(i), iter2_(i), iter3_(i)); }
>
>
>    int ascending(int rank)
>    {
>        return bounds::compute_ascending(rank, bounds::compute_ascending(
>            rank, iter1_.ascending(rank), iter2_.ascending(rank)),
>            iter3_.ascending(rank));
>    }
>
>    int ordering(int rank)
>    {
>        return bounds::compute_ordering(rank, bounds::compute_ordering(
>            rank, iter1_.ordering(rank), iter2_.ordering(rank)),
>            iter3_.ordering(rank));
>    }
>
>    int lbound(int rank)
>    {
>        return bounds::compute_lbound(rank, bounds::compute_lbound(
>            rank, iter1_.lbound(rank), iter2_.lbound(rank)),
>            iter3_.lbound(rank));
>    }
>
>    int ubound(int rank)
>    {
>        return bounds::compute_ubound(rank, bounds::compute_ubound(
>            rank, iter1_.ubound(rank), iter2_.ubound(rank)),
>            iter3_.ubound(rank));
>    }
>
>    void push(int position)
>    {
>        iter1_.push(position);
>        iter2_.push(position);
>        iter3_.push(position);
>    }
>
>    void pop(int position)
>    {
>        iter1_.pop(position);
>        iter2_.pop(position);
>        iter3_.pop(position);
>    }
>
>    void advance()
>    {
>        iter1_.advance();
>        iter2_.advance();
>        iter3_.advance();
>    }
>
>    void advance(int n)
>    {
>        iter1_.advance(n);
>        iter2_.advance(n);
>        iter3_.advance(n);
>    }
>
>    void loadStride(int rank)
>    {
>        iter1_.loadStride(rank);
>        iter2_.loadStride(rank);
>        iter3_.loadStride(rank);
>    }
>
>    bool isUnitStride(int rank) const
>    {
>        return iter1_.isUnitStride(rank)
>            && iter2_.isUnitStride(rank)
>            && iter3_.isUnitStride(rank);
>    }
>
>    void advanceUnitStride()
>    {
>        iter1_.advanceUnitStride();
>        iter2_.advanceUnitStride();
>        iter3_.advanceUnitStride();
>    }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>
>        return iter1_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter2_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter3_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return T_op::apply(iter1_[i], iter2_[i], iter3_[i]); }
>
>    T_numtype fastRead(int i)
>    {
>        return T_op::apply(iter1_.fastRead(i),
>                           iter2_.fastRead(i),
>                           iter3_.fastRead(i));
>    }
>
>    int suggestStride(int rank) const
>    {
>        int stride1 = iter1_.suggestStride(rank);
>        int stride2 = iter2_.suggestStride(rank);
>        int stride3 = iter3_.suggestStride(rank);
>        return stride1 > ( stride2 = (stride2>stride3 ? stride2 : stride3) ) ?
>            stride1 : stride2;
>    }
>
>    bool isStride(int rank, int stride) const
>    {
>        return iter1_.isStride(rank,stride)
>            && iter2_.isStride(rank,stride)
>            && iter3_.isStride(rank,stride);
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter1_.moveTo(i);
>        iter2_.moveTo(i);
>        iter3_.moveTo(i);
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        T_op::prettyPrint(str, format, iter1_, iter2_, iter3_);
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    {
>        return iter1_.shapeCheck(shape)
>            && iter2_.shapeCheck(shape)
>            && iter3_.shapeCheck(shape);
>    }
>
>protected:
>    _bz_ArrayExprTernaryOp() { }
>
>    T_expr1 iter1_;
>    T_expr2 iter2_;
>    T_expr3 iter3_;
>};
>
>
>template<typename P_numtype>
>class _bz_ArrayExprConstant {
>public:
>    typedef P_numtype T_numtype;
>    typedef T_numtype T_ctorArg1;
>    typedef int T_ctorArg2;
>
>    static const int
>        numArrayOperands = 0,
>        numIndexPlaceholders = 0,
>        rank = 0;
>
>    _bz_ArrayExprConstant(const _bz_ArrayExprConstant<T_numtype>& a)
>        : value_(a.value_)
>    { }
>
>    _bz_ArrayExprConstant(T_numtype value)
>        : value_(value)
>    {
>    }
>
>
>
>
>
>
>    int ascending(int)
>    { return (-2147483647 - 1); }
>
>    int ordering(int)
>    { return (-2147483647 - 1); }
>
>    int lbound(int)
>    { return (-2147483647 - 1); }
>
>    int ubound(int)
>    { return 2147483647; }
>
>
>
>    T_numtype operator*()
>    { return value_; }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int,N_rank>&)
>    { return value_; }
>
>
>    void push(int) { }
>    void pop(int) { }
>    void advance() { }
>    void advance(int) { }
>    void loadStride(int) { }
>
>    bool isUnitStride(int) const
>    { return true; }
>
>    void advanceUnitStride()
>    { }
>
>    bool canCollapse(int,int) const
>    { return true; }
>
>    T_numtype operator[](int)
>    { return value_; }
>
>    T_numtype fastRead(int)
>    { return value_; }
>
>    int suggestStride(int) const
>    { return 1; }
>
>    bool isStride(int,int) const
>    { return true; }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>&)
>    {
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        if (format.tersePrintingSelected())
>            str += format.nextScalarOperandSymbol();
>        else
>            str += typeid(T_numtype).name();
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape&)
>    { return true; }
>
>protected:
>    _bz_ArrayExprConstant() { }
>
>    T_numtype value_;
>};
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/asexpr.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/asexpr.h"
>namespace blitz {
>
>
>
>
>
>
>template <typename T>
>struct asExpr {
>    typedef _bz_ArrayExprConstant<T> T_expr;
>    static T_expr getExpr(const T& x) { return T_expr(x); }
>};
>
>
>
>template <typename T>
>struct asExpr<_bz_ArrayExpr<T> > {
>    typedef _bz_ArrayExpr<T> T_expr;
>    static const T_expr& getExpr(const T_expr& x) { return x; }
>};
>
>
>
>template <typename T,int N>
>struct asExpr<Array<T,N> > {
>    typedef FastArrayIterator<T,N> T_expr;
>    static T_expr getExpr(const Array<T,N>& x) { return x.beginFast(); }
>};
>
>
>
>template <int N>
>struct asExpr<IndexPlaceholder<N> > {
>    typedef IndexPlaceholder<N> T_expr;
>    static T_expr getExpr(T_expr x) { return x; }
>};
>
>
>
>
>
>template <template <typename T1> class OP, typename O1>
>struct BzUnaryExprResult {
>    typedef _bz_ArrayExpr<_bz_ArrayExprUnaryOp<
>        typename asExpr<O1>::T_expr,
>        OP<typename asExpr<O1>::T_expr::T_numtype> > > T_result;
>};
>
>template <template <typename T1, typename T2> class OP,
>          typename O1, typename O2>
>struct BzBinaryExprResult {
>    typedef _bz_ArrayExpr<_bz_ArrayExprBinaryOp<
>        typename asExpr<O1>::T_expr,
>        typename asExpr<O2>::T_expr,
>        OP<typename asExpr<O1>::T_expr::T_numtype,
>           typename asExpr<O2>::T_expr::T_numtype> > > T_result;
>};
>
>template <template <typename T1, typename T2, typename T3> class OP,
>          typename O1, typename O2, typename O3>
>struct BzTernaryExprResult {
>    typedef _bz_ArrayExpr<_bz_ArrayExprTernaryOp<
>        typename asExpr<O1>::T_expr,
>        typename asExpr<O2>::T_expr,
>        typename asExpr<O3>::T_expr,
>        OP<typename asExpr<O1>::T_expr::T_numtype,
>           typename asExpr<O2>::T_expr::T_numtype,
>           typename asExpr<O3>::T_expr::T_numtype> > > T_result;
>};
>
>
>
>}
># 907 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/expr.h" 2
># 2511 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/methods.cc" 1
>
>
>
>
>
>
>
>namespace blitz {
>
>template<typename P_numtype, int N_rank> template<typename T_expr>
>Array<P_numtype,N_rank>::Array(_bz_ArrayExpr<T_expr> expr)
>{
>
>
>    TinyVector<int,N_rank> lbound, extent, ordering;
>    TinyVector<bool,N_rank> ascendingFlag;
>    TinyVector<bool,N_rank> in_ordering;
>    in_ordering = false;
>
>    int j = 0;
>    for (int i=0; i < N_rank; ++i)
>    {
>        lbound(i) = expr.lbound(i);
>        int ubound = expr.ubound(i);
>        extent(i) = ubound - lbound(i) + 1;
>        int orderingj = expr.ordering(i);
>        if (orderingj != (-2147483647 - 1) && orderingj < N_rank &&
>            !in_ordering( orderingj )) {
>            in_ordering( orderingj ) = true;
>            ordering(j++) = orderingj;
>        }
>        int ascending = expr.ascending(i);
>        ascendingFlag(i) = (ascending == 1);
># 47 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/methods.cc"
>    }
>
>
>
>
>    for (int i = N_rank-1; j < N_rank; ++j) {
>        while (in_ordering(i))
>          --i;
>        ordering(j) = i--;
>    }
>
>    Array<T_numtype,N_rank> A(lbound,extent,
>        GeneralArrayStorage<N_rank>(ordering,ascendingFlag));
>    A = expr;
>    reference(A);
>}
>
>template<typename P_numtype, int N_rank>
>Array<P_numtype,N_rank>::Array(const TinyVector<int, N_rank>& lbounds,
>    const TinyVector<int, N_rank>& extent,
>    const GeneralArrayStorage<N_rank>& storage)
>    : storage_(storage)
>{
>    length_ = extent;
>    storage_.setBase(lbounds);
>    setupStorage(N_rank - 1);
>}
># 82 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/methods.cc"
>template<typename P_numtype, int N_rank>
>inline void Array<P_numtype, N_rank>::computeStrides()
>{
>    if (N_rank > 1)
>    {
>      int stride = 1;
>
>
>
>      bool allAscending = storage_.allRanksStoredAscending();
>
>
>      int n;
>      for (n=0; n < N_rank; ++n)
>      {
>          int strideSign = +1;
>
>
>
>          if (!allAscending)
>          {
>            if (!isRankStoredAscending(ordering(n)))
>                strideSign = -1;
>          }
>
>
>
>          stride_[ordering(n)] = stride * strideSign;
>
>          stride *= length_[ordering(n)];
>      }
>    }
>    else {
>
>
>
>
>        if (isRankStoredAscending(0))
>            stride_[0] = 1;
>        else
>            stride_[0] = -1;
>    }
>
>    calculateZeroOffset();
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::calculateZeroOffset()
>{
>
>    zeroOffset_ = 0;
>
>
>
>    for (int n=0; n < N_rank; ++n)
>    {
>        if (!isRankStoredAscending(n))
>            zeroOffset_ -= (length_[n] - 1 + base(n)) * stride_[n];
>        else
>            zeroOffset_ -= stride_[n] * base(n);
>    }
>}
>
>template<typename P_numtype, int N_rank>
>bool Array<P_numtype, N_rank>::isStorageContiguous() const
>{
># 156 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/methods.cc"
>    int numStridesMissing = 0;
>    bool haveUnitStride = false;
>
>    for (int i=0; i < N_rank; ++i)
>    {
>        int stride = std::abs(stride_[i]);
>        if (stride == 1)
>            haveUnitStride = true;
>
>        int vi = stride * length_[i];
>
>        int j = 0;
>        for (j=0; j < N_rank; ++j)
>            if (std::abs(stride_[j]) == vi)
>                break;
>
>        if (j == N_rank)
>        {
>            ++numStridesMissing;
>            if (numStridesMissing == 2)
>                return false;
>        }
>    }
>
>    return haveUnitStride;
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::dumpStructureInformation(ostream& os) const
>{
>    os << "Dump of Array<" << typeid(P_numtype).name()
>       << ", " << N_rank << ">:" << endl
>       << "ordering_      = " << storage_.ordering() << endl
>       << "ascendingFlag_ = " << storage_.ascendingFlag() << endl
>       << "base_          = " << storage_.base() << endl
>       << "length_        = " << length_ << endl
>       << "stride_        = " << stride_ << endl
>       << "zeroOffset_    = " << zeroOffset_ << endl
>       << "numElements()  = " << numElements() << endl
>       << "isStorageContiguous() = " << isStorageContiguous() << endl;
>}
>
>
>
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::reference(const Array<P_numtype, N_rank>& array)
>{
>    storage_ = array.storage_;
>    length_ = array.length_;
>    stride_ = array.stride_;
>    zeroOffset_ = array.zeroOffset_;
>
>    MemoryBlockReference<P_numtype>::changeBlock(array.noConst());
>}
>
>
>
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::setStorage(GeneralArrayStorage<N_rank> x)
>{
>
>
>
>
>
>
>    storage_ = x;
>    return;
>}
>
>
>
>
>template<typename P_numtype, int N_rank>
>inline void Array<P_numtype, N_rank>::setupStorage(int lastRankInitialized)
>{
>    ;
>
>    ;
>
>
>
>
>
>
>
>    for (int i=lastRankInitialized + 1; i < N_rank; ++i)
>    {
>        storage_.setBase(i, storage_.base(lastRankInitialized));
>        length_[i] = length_[lastRankInitialized];
>    }
>
>
>    computeStrides();
>
>
>    int numElem = numElements();
>    if (numElem==0)
>        MemoryBlockReference<P_numtype>::changeToNullBlock();
>    else
>        MemoryBlockReference<P_numtype>::newBlock(numElem);
>
>
>
>    data_ += zeroOffset_;
>}
>
>template<typename P_numtype, int N_rank>
>Array<P_numtype, N_rank> Array<P_numtype, N_rank>::copy() const
>{
>    if (numElements())
>    {
>        Array<T_numtype, N_rank> z(length_, storage_);
>        z = *this;
>        return z;
>    }
>    else {
>
>        return *this;
>    }
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::makeUnique()
>{
>    if (numReferences() > 1)
>    {
>        T_array tmp = copy();
>        reference(tmp);
>    }
>}
>
>template<typename P_numtype, int N_rank>
>Array<P_numtype, N_rank> Array<P_numtype, N_rank>::transpose(int r0, int r1,
>    int r2, int r3, int r4, int r5, int r6, int r7, int r8, int r9, int r10)
>{
>    T_array B(*this);
>    B.transposeSelf(r0,r1,r2,r3,r4,r5,r6,r7,r8,r9,r10);
>    return B;
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::transposeSelf(int r0, int r1, int r2, int r3,
>    int r4, int r5, int r6, int r7, int r8, int r9, int r10)
>{
>    ;
>
>
>
>
>
>    Array<T_numtype, N_rank> x(*this);
>
>
>    doTranspose(0, r0, x);
>    doTranspose(1, r1, x);
>    doTranspose(2, r2, x);
>    doTranspose(3, r3, x);
>    doTranspose(4, r4, x);
>    doTranspose(5, r5, x);
>    doTranspose(6, r6, x);
>    doTranspose(7, r7, x);
>    doTranspose(8, r8, x);
>    doTranspose(9, r9, x);
>    doTranspose(10, r10, x);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::doTranspose(int destRank, int sourceRank,
>    Array<T_numtype, N_rank>& array)
>{
>
>
>    if (destRank >= N_rank)
>        return;
>
>    length_[destRank] = array.length_[sourceRank];
>    stride_[destRank] = array.stride_[sourceRank];
>    storage_.setAscendingFlag(destRank,
>        array.isRankStoredAscending(sourceRank));
>    storage_.setBase(destRank, array.base(sourceRank));
>
>
>
>
>
>
>    int i=0;
>    for (; i < N_rank; ++i)
>        if (array.storage_.ordering(i) == sourceRank)
>            break;
>
>    storage_.setOrdering(i, destRank);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::reverseSelf(int rank)
>{
>    ;
>
>    storage_.setAscendingFlag(rank, !isRankStoredAscending(rank));
>
>    int adjustment = stride_[rank] * (lbound(rank) + ubound(rank));
>    zeroOffset_ += adjustment;
>    data_ += adjustment;
>    stride_[rank] *= -1;
>}
>
>template<typename P_numtype, int N_rank>
>Array<P_numtype, N_rank> Array<P_numtype,N_rank>::reverse(int rank)
>{
>    T_array B(*this);
>    B.reverseSelf(rank);
>    return B;
>}
>
>template<typename P_numtype, int N_rank> template<typename P_numtype2>
>Array<P_numtype2,N_rank> Array<P_numtype,N_rank>::extractComponent(P_numtype2,
>    int componentNumber, int numComponents) const
>{
>    ;
>
>
>    TinyVector<int,N_rank> stride2;
>    for (int i=0; i < N_rank; ++i)
>      stride2(i) = stride_(i) * numComponents;
>    const P_numtype2* dataFirst2 =
>        ((const P_numtype2*)dataFirst()) + componentNumber;
>    return Array<P_numtype2,N_rank>(const_cast<P_numtype2*>(dataFirst2),
>        length_, stride2, storage_);
>}
>
>
>
>
>
>
>
>template<typename P_numtype, int N_rank>
>inline void Array<P_numtype, N_rank>::reindexSelf(const
>    TinyVector<int, N_rank>& newBase)
>{
>    int delta = 0;
>    for (int i=0; i < N_rank; ++i)
>      delta += (base(i) - newBase(i)) * stride_(i);
>
>    data_ += delta;
>
>
>
>    storage_.setBase(newBase);
>    calculateZeroOffset();
>}
>
>template<typename P_numtype, int N_rank>
>inline Array<P_numtype, N_rank>
>Array<P_numtype, N_rank>::reindex(const TinyVector<int, N_rank>& newBase)
>{
>    T_array B(*this);
>    B.reindexSelf(newBase);
>    return B;
>}
>
>}
># 2512 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc" 1
>
>
>
>
>
>
>
>namespace blitz {
># 92 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>template<typename T_numtype, int N_rank> template<typename T_expr, typename T_update>
>inline Array<T_numtype, N_rank>&
>Array<T_numtype, N_rank>::evaluate(T_expr expr,
>    T_update)
>{
># 124 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    ;
>
>
>    ;
># 138 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    if (numElements() == 0)
>        return *this;
># 165 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    if (T_expr::numIndexPlaceholders > 0)
>    {
>
>
>
>        if (N_rank == 1)
>            return evaluateWithIndexTraversal1(expr, T_update());
>        else
>            return evaluateWithIndexTraversalN(expr, T_update());
>    }
>    else {
># 198 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>        if ((N_rank == 2) && (T_expr::numArrayOperands >= 5))
>        {
># 211 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>            int cacheNeeded = 3 * 3 * sizeof(T_numtype) * length(ordering(0));
>            if (cacheNeeded > 8192)
>                return evaluateWithTiled2DTraversal(expr, T_update());
>        }
>
>
>
>
>
>        if (N_rank == 1)
>            return evaluateWithStackTraversal1(expr, T_update());
>        else
>            return evaluateWithStackTraversalN(expr, T_update());
>    }
>}
>
>template<typename T_numtype, int N_rank> template<typename T_expr, typename T_update>
>inline Array<T_numtype, N_rank>&
>Array<T_numtype, N_rank>::evaluateWithStackTraversal1(
>    T_expr expr, T_update)
>{
>
>
>
>
>    FastArrayIterator<T_numtype, N_rank> iter(*this);
>    iter.loadStride(firstRank);
>    expr.loadStride(firstRank);
>
>    bool useUnitStride = iter.isUnitStride(firstRank)
>          && expr.isUnitStride(firstRank);
>
>
>    int commonStride = expr.suggestStride(firstRank);
>    if (iter.suggestStride(firstRank) > commonStride)
>        commonStride = iter.suggestStride(firstRank);
>    bool useCommonStride = iter.isStride(firstRank,commonStride)
>        && expr.isStride(firstRank,commonStride);
># 260 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    const T_numtype * last = iter.data() + length(firstRank)
>        * stride(firstRank);
>
>    if (useUnitStride || useCommonStride)
>    {
>
>
>
>
>
>        int ubound = length(firstRank) * commonStride;
>        T_numtype* __restrict__ data = const_cast<T_numtype*>(iter.data());
>
>        if (commonStride == 1)
>        {
>
>            for (int i=0; i < ubound; ++i)
>                T_update::update(*data++, expr.fastRead(i));
># 311 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>        }
>
>        else {
>
>
>            for (int i=0; i != ubound; i += commonStride)
>                T_update::update(data[i], expr.fastRead(i));
># 337 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>        }
># 352 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    }
>    else {
>        while (iter.data() != last)
>        {
>            T_update::update(*const_cast<T_numtype*>(iter.data()), *expr);
>            iter.advance();
>            expr.advance();
>        }
>    }
>
>    return *this;
>}
>
>template<typename T_numtype, int N_rank> template<typename T_expr, typename T_update>
>inline Array<T_numtype, N_rank>&
>Array<T_numtype, N_rank>::evaluateWithStackTraversalN(
>    T_expr expr, T_update)
>{
># 406 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    const int maxRank = ordering(0);
>
>
>
>    FastArrayIterator<T_numtype, N_rank> iter(*this);
>
>
>
>
>    int i;
>    for (i=1; i < N_rank; ++i)
>    {
>        iter.push(i);
>        expr.push(i);
>    }
>
>
>    iter.loadStride(maxRank);
>    expr.loadStride(maxRank);
>
>
>
>
>
>
>    bool useUnitStride = iter.isUnitStride(maxRank)
>                          && expr.isUnitStride(maxRank);
>
>
>
>
>
>
>
>    int commonStride = expr.suggestStride(maxRank);
>    if (iter.suggestStride(maxRank) > commonStride)
>        commonStride = iter.suggestStride(maxRank);
>    bool useCommonStride = iter.isStride(maxRank,commonStride)
>        && expr.isStride(maxRank,commonStride);
># 461 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    const T_numtype* last[N_rank];
>
>
>    for (i=1; i < N_rank; ++i)
>        last[i] = iter.data() + length(ordering(i)) * stride(ordering(i));
>
>    int lastLength = length(maxRank);
>    int firstNoncollapsedLoop = 1;
># 484 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    for (i=1; i < N_rank; ++i)
>    {
>
>        int outerLoopRank = ordering(i);
>        int innerLoopRank = ordering(i-1);
>
>
>
>
>
>
>
>        if (canCollapse(outerLoopRank,innerLoopRank)
>          && expr.canCollapse(outerLoopRank,innerLoopRank))
>        {
>
>
>
>
>            lastLength *= length(outerLoopRank);
>            firstNoncollapsedLoop = i+1;
>        }
>        else
>            break;
>    }
># 520 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    while (true) {
>
>
>
>
>
>
>
>        if ((useUnitStride) || (useCommonStride))
>        {
># 540 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>            int ubound = lastLength * commonStride;
># 550 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>            T_numtype* __restrict__ data = const_cast<T_numtype*>(iter.data());
>
>
>
>
>            if (commonStride == 1)
>            {
>                for (int i=0; i < ubound; ++i)
>                    T_update::update(*data++, expr.fastRead(i));
>            }
>
>            else {
>                for (int i=0; i != ubound; i += commonStride)
>                    T_update::update(data[i], expr.fastRead(i));
>            }
>
>
>
>
>
>
>            iter.advance(lastLength * commonStride);
>            expr.advance(lastLength * commonStride);
># 588 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>        }
>        else {
>
>
>
>
>
>            T_numtype * __restrict__ end = const_cast<T_numtype*>(iter.data())
>                + lastLength * stride(maxRank);
>
>            while (iter.data() != end)
>            {
>                T_update::update(*const_cast<T_numtype*>(iter.data()), *expr);
>                iter.advance();
>                expr.advance();
>            }
>        }
>
>
>
>
>
>
>        int j = firstNoncollapsedLoop;
>        for (; j < N_rank; ++j)
>        {
>
>            int r = ordering(j);
>
>
>
>            iter.pop(j);
>            expr.pop(j);
>
>
>
>            iter.loadStride(r);
>            expr.loadStride(r);
>            iter.advance();
>            expr.advance();
>
>
>            if (iter.data() != last[j])
>                break;
>        }
>
>
>        if (j == N_rank)
>            break;
>
>
>        for (; j >= firstNoncollapsedLoop; --j)
>        {
>            int r2 = ordering(j-1);
>            iter.push(j);
>            expr.push(j);
>            last[j-1] = iter.data() + length(r2) * stride(r2);
>        }
>
>
>        iter.loadStride(maxRank);
>        expr.loadStride(maxRank);
>    }
>
>    return *this;
>}
>
>template<typename T_numtype, int N_rank> template<typename T_expr, typename T_update>
>inline Array<T_numtype, N_rank>&
>Array<T_numtype, N_rank>::evaluateWithIndexTraversal1(
>    T_expr expr, T_update)
>{
>    TinyVector<int,N_rank> index;
>
>    if (stride(firstRank) == 1)
>    {
>        T_numtype * __restrict__ iter = data_ + lbound(firstRank);
>        int last = ubound(firstRank);
>
>        for (index[0] = lbound(firstRank); index[0] <= last;
>            ++index[0])
>        {
>            T_update::update(*iter++, expr(index));
>        }
>    }
>    else {
>        FastArrayIterator<T_numtype, N_rank> iter(*this);
>        iter.loadStride(0);
>        int last = ubound(firstRank);
>
>        for (index[0] = lbound(firstRank); index[0] <= last;
>            ++index[0])
>        {
>            T_update::update(*const_cast<T_numtype*>(iter.data()),
>                expr(index));
>            iter.advance();
>        }
>    }
>
>    return *this;
>}
>
>template<typename T_numtype, int N_rank> template<typename T_expr, typename T_update>
>inline Array<T_numtype, N_rank>&
>Array<T_numtype, N_rank>::evaluateWithIndexTraversalN(
>    T_expr expr, T_update)
>{
>
>
>
>    const int maxRank = ordering(0);
># 708 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>    FastArrayIterator<T_numtype, N_rank> iter(*this);
>    for (int i=1; i < N_rank; ++i)
>        iter.push(ordering(i));
>
>    iter.loadStride(maxRank);
>
>    TinyVector<int,N_rank> index, last;
>
>    index = storage_.base();
>
>    for (int i=0; i < N_rank; ++i)
>      last(i) = storage_.base(i) + length_(i);
>
>
>
>    while (true) {
>
>        for (index[maxRank] = base(maxRank);
>             index[maxRank] < last[maxRank];
>             ++index[maxRank])
>        {
>
>
>
>
>
>
>
>            T_update::update(*const_cast<T_numtype*>(iter.data()), expr(index));
>            iter.advance();
>        }
>
>        int j = 1;
>        for (; j < N_rank; ++j)
>        {
>            iter.pop(ordering(j));
>            iter.loadStride(ordering(j));
>            iter.advance();
>
>            index[ordering(j-1)] = base(ordering(j-1));
>            ++index[ordering(j)];
>            if (index[ordering(j)] != last[ordering(j)])
>                break;
>        }
>
>        if (j == N_rank)
>            break;
>
>        for (; j > 0; --j)
>        {
>            iter.push(ordering(j));
>        }
>        iter.loadStride(maxRank);
>    }
>
>    return *this;
>}
># 1102 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/eval.cc"
>template<typename T_numtype, int N_rank> template<typename T_expr, typename T_update>
>inline Array<T_numtype, N_rank>&
>Array<T_numtype, N_rank>::evaluateWithTiled2DTraversal(
>    T_expr expr, T_update)
>{
>    const int minorRank = ordering(0);
>    const int majorRank = ordering(1);
>
>    const int blockSize = 16;
>
>    FastArrayIterator<T_numtype, N_rank> iter(*this);
>    iter.push(0);
>    expr.push(0);
>
>    bool useUnitStride = iter.isUnitStride(minorRank)
>                          && expr.isUnitStride(minorRank);
>
>
>    int commonStride = expr.suggestStride(minorRank);
>    if (iter.suggestStride(minorRank) > commonStride)
>        commonStride = iter.suggestStride(minorRank);
>    bool useCommonStride = iter.isStride(minorRank,commonStride)
>        && expr.isStride(minorRank,commonStride);
>
>
>
>
>
>    int maxi = length(majorRank);
>    int maxj = length(minorRank);
>
>    int bi, bj;
>    for (bi=0; bi < maxi; bi += blockSize)
>    {
>        int ni = bi + blockSize;
>        if (ni > maxi)
>            ni = maxi;
>
>        for (bj=0; bj < maxj; bj += blockSize)
>        {
>            int nj = bj + blockSize;
>            if (nj > maxj)
>                nj = maxj;
>
>
>            iter.pop(0);
>            expr.pop(0);
>
>
>            iter.loadStride(majorRank);
>            iter.advance(bi);
>            iter.loadStride(minorRank);
>            iter.advance(bj);
>
>            expr.loadStride(majorRank);
>            expr.advance(bi);
>            expr.loadStride(minorRank);
>            expr.advance(bj);
>
>
>            for (int i=bi; i < ni; ++i)
>            {
>
>                iter.push(1);
>                expr.push(1);
>
>
>                iter.loadStride(minorRank);
>                expr.loadStride(minorRank);
>
>                if (useUnitStride)
>                {
>                    T_numtype* __restrict__ data = const_cast<T_numtype*>
>                        (iter.data());
>
>                    int ubound = (nj-bj);
>                    for (int j=0; j < ubound; ++j)
>                        T_update::update(*data++, expr.fastRead(j));
>                }
>
>                else if (useCommonStride)
>                {
>                    int ubound = (nj-bj) * commonStride;
>                    T_numtype* __restrict__ data = const_cast<T_numtype*>
>                        (iter.data());
>
>                    for (int j=0; j < ubound; j += commonStride)
>                        T_update::update(data[j], expr.fastRead(j));
>                }
>
>                else {
>                    for (int j=bj; j < nj; ++j)
>                    {
>
>                        T_update::update(*const_cast<T_numtype*>(iter.data()),
>                            *expr);
>                        iter.advance();
>                        expr.advance();
>                    }
>                }
>
>
>
>                iter.pop(1);
>                iter.loadStride(majorRank);
>                iter.advance(1);
>
>                expr.pop(1);
>                expr.loadStride(majorRank);
>                expr.advance(1);
>            }
>        }
>    }
>
>    return *this;
>}
>
>
>
>}
># 2513 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.cc" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.cc"
>namespace blitz {
>
>
>
>
>
>template<typename P_numtype, int N_rank>
>Array<P_numtype, N_rank>& Array<P_numtype,N_rank>::initialize(T_numtype x)
>{
>    (*this) = _bz_ArrayExpr<_bz_ArrayExprConstant<T_numtype> >(x);
>    return *this;
>}
>
>
>
>template<typename P_numtype, int N_rank> template<typename T_expr>
>inline Array<P_numtype,N_rank>&
>Array<P_numtype,N_rank>::operator=(const ETBase<T_expr>& expr)
>{
>    evaluate(expr.unwrap(),
>        _bz_update<T_numtype, typename T_expr::T_numtype>());
>    return *this;
>}
>
>template<typename P_numtype, int N_rank>
>inline Array<P_numtype, N_rank>&
>Array<P_numtype, N_rank>::operator=(const Array<T_numtype,N_rank>& x)
>{
>    (*this) = _bz_ArrayExpr<FastArrayIterator<T_numtype, N_rank> >
>        (x.beginFast());
>    return *this;
>}
># 76 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.cc"
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator +=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_plus_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator -=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_minus_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator *=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_multiply_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator /=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_divide_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator %=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_mod_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator ^=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_xor_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator &=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_bitand_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator |=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_bitor_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator <<=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_shiftl_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
>template<typename P_numtype, int N_rank> template<typename T> inline Array<P_numtype,N_rank>& Array<P_numtype,N_rank>::operator >>=(const T& expr) { evaluate(typename asExpr<T>::T_expr(expr), _bz_shiftr_update<T_numtype, typename asExpr<T>::T_expr::T_numtype>()); return *this; }
># 372 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.cc"
>}
># 2514 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/io.cc" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/io.cc"
>namespace blitz {
>
>template<typename T_numtype>
>ostream& operator<<(ostream& os, const Array<T_numtype,1>& x)
>{
>    os << x.extent(firstRank) << endl;
>    os << " [ ";
>    for (int i=x.lbound(firstRank); i <= x.ubound(firstRank); ++i)
>    {
>        os << setw(9) << x(i) << " ";
>        if (!((i+1-x.lbound(firstRank))%7))
>            os << endl << "  ";
>    }
>    os << " ]";
>    return os;
>}
>
>template<typename T_numtype>
>ostream& operator<<(ostream& os, const Array<T_numtype,2>& x)
>{
>    os << x.rows() << " x " << x.columns() << endl;
>    os << "[ ";
>    for (int i=x.lbound(firstRank); i <= x.ubound(firstRank); ++i)
>    {
>        for (int j=x.lbound(secondRank); j <= x.ubound(secondRank); ++j)
>        {
>            os << setw(9) << x(i,j) << " ";
>            if (!((j+1-x.lbound(secondRank)) % 7))
>                os << endl << "  ";
>        }
>
>        if (i != x.ubound(firstRank))
>           os << endl << "  ";
>    }
>
>    os << "]" << endl;
>
>    return os;
>}
>
>template<typename T_numtype, int N_rank>
>ostream& operator<<(ostream& os, const Array<T_numtype,N_rank>& x)
>{
>    for (int i=0; i < N_rank; ++i)
>    {
>        os << x.extent(i);
>        if (i != N_rank - 1)
>            os << " x ";
>    }
>
>    os << endl << "[ ";
>
>    typename Array<T_numtype, N_rank>::const_iterator iter = x.begin();
>    typename Array<T_numtype, N_rank>::const_iterator end = x.end();
>    int p = 0;
>
>    while (iter != end) {
>        os << setw(9) << (*iter) << " ";
>        ++iter;
>
>
>        ++p;
>        if (!(p % 7))
>            os << endl << "  ";
>    }
>
>    os << "]" << endl;
>    return os;
>}
>
>
>
>
>
>template<typename T_numtype, int N_rank>
>istream& operator>>(istream& is, Array<T_numtype,N_rank>& x)
>{
>    TinyVector<int,N_rank> extent;
>    char sep;
>
>
>
>
>    for (int i=0; i < N_rank; ++i)
>    {
>        is >> extent(i);
>
>        ;
>
>        if (i != N_rank - 1)
>        {
>            is >> sep;
>            ;
>
>        }
>    }
>
>    is >> sep;
>    ;
>
>
>    x.resize(extent);
>
>    typename Array<T_numtype,N_rank>::iterator iter = x.begin();
>    typename Array<T_numtype,N_rank>::iterator end = x.end();
>
>    while (iter != end) {
>        ;
>
>        is >> (*iter);
>        ++iter;
>    }
>
>    is >> sep;
>    ;
>
>
>    return is;
>}
>
>}
># 2515 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/et.h" 1
># 27 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/et.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet.h" 1
># 28 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.h" 1
># 28 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet-macros.h" 1
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet-macros.h"
>namespace blitz {
># 318 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet-macros.h"
>}
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.h" 2
>
>namespace blitz {
>
>
>
>template <typename T1> typename BzUnaryExprResult<BitwiseNot,T1>::T_result operator~(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<BitwiseNot,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<LogicalNot,T1>::T_result operator!(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<LogicalNot,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<UnaryPlus,T1>::T_result operator+(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<UnaryPlus,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<UnaryMinus,T1>::T_result operator-(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<UnaryMinus,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>
>
>
>
>
>
>
>template <typename T1,typename T2> typename BzBinaryExprResult<Add,T1,T2>::T_result operator+(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Add,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Subtract,T1,T2>::T_result operator-(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Subtract,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Multiply,T1,T2>::T_result operator*(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Multiply,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Divide,T1,T2>::T_result operator/(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Divide,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Modulo,T1,T2>::T_result operator%(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Modulo,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<BitwiseXor,T1,T2>::T_result operator^(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<BitwiseAnd,T1,T2>::T_result operator&(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<BitwiseOr,T1,T2>::T_result operator|(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>
>
>template <typename T1,typename T2> typename BzBinaryExprResult<Greater,T1,T2>::T_result operator>(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Greater,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Less,T1,T2>::T_result operator<(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Less,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<GreaterOrEqual,T1,T2>::T_result operator>=(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<LessOrEqual,T1,T2>::T_result operator<=(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Equal,T1,T2>::T_result operator==(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Equal,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<NotEqual,T1,T2>::T_result operator!=(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<NotEqual,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<LogicalAnd,T1,T2>::T_result operator&&(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<LogicalOr,T1,T2>::T_result operator||(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<LogicalOr,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>
>template <typename T1,typename T2> typename BzBinaryExprResult<_bz_Min,T1,T2>::T_result min(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<_bz_Min,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<_bz_Max,T1,T2>::T_result max(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<_bz_Max,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>
>
>
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Add,TinyVector<T2,N>,T1>::T_result operator+(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Add,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Add,T1,TinyVector<T2,N> >::T_result operator+(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Add,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Subtract,TinyVector<T2,N>,T1>::T_result operator-(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Subtract,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Subtract,T1,TinyVector<T2,N> >::T_result operator-(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Subtract,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Multiply,TinyVector<T2,N>,T1>::T_result operator*(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Multiply,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Multiply,T1,TinyVector<T2,N> >::T_result operator*(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Multiply,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Divide,TinyVector<T2,N>,T1>::T_result operator/(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Divide,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Divide,T1,TinyVector<T2,N> >::T_result operator/(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Divide,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Modulo,TinyVector<T2,N>,T1>::T_result operator%(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Modulo,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Modulo,T1,TinyVector<T2,N> >::T_result operator%(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Modulo,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<BitwiseXor,TinyVector<T2,N>,T1>::T_result operator^(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<BitwiseXor,T1,TinyVector<T2,N> >::T_result operator^(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<BitwiseXor,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<BitwiseAnd,TinyVector<T2,N>,T1>::T_result operator&(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<BitwiseAnd,T1,TinyVector<T2,N> >::T_result operator&(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<BitwiseOr,TinyVector<T2,N>,T1>::T_result operator|(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<BitwiseOr,T1,TinyVector<T2,N> >::T_result operator|(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<BitwiseOr,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Greater,TinyVector<T2,N>,T1>::T_result operator>(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Greater,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Greater,T1,TinyVector<T2,N> >::T_result operator>(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Greater,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Less,TinyVector<T2,N>,T1>::T_result operator<(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Less,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Less,T1,TinyVector<T2,N> >::T_result operator<(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Less,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<GreaterOrEqual,TinyVector<T2,N>,T1>::T_result operator>=(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<GreaterOrEqual,T1,TinyVector<T2,N> >::T_result operator>=(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<LessOrEqual,TinyVector<T2,N>,T1>::T_result operator<=(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<LessOrEqual,T1,TinyVector<T2,N> >::T_result operator<=(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<LessOrEqual,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<Equal,TinyVector<T2,N>,T1>::T_result operator==(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<Equal,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<Equal,T1,TinyVector<T2,N> >::T_result operator==(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<Equal,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<NotEqual,TinyVector<T2,N>,T1>::T_result operator!=(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<NotEqual,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<NotEqual,T1,TinyVector<T2,N> >::T_result operator!=(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<NotEqual,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<LogicalAnd,TinyVector<T2,N>,T1>::T_result operator&&(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<LogicalAnd,T1,TinyVector<T2,N> >::T_result operator&&(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<LogicalAnd,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<LogicalOr,TinyVector<T2,N>,T1>::T_result operator||(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<LogicalOr,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<LogicalOr,T1,TinyVector<T2,N> >::T_result operator||(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<LogicalOr,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<_bz_Min,TinyVector<T2,N>,T1>::T_result min(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<_bz_Min,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<_bz_Min,T1,TinyVector<T2,N> >::T_result min(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<_bz_Min,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
>template <typename T1, typename T2, int N> typename BzBinaryExprResult<_bz_Max,TinyVector<T2,N>,T1>::T_result max(const TinyVector<T2,N> d1, const ETBase<T1>& d2) { typedef typename BzBinaryExprResult<_bz_Max,TinyVector<T2,N>,T1>::T_result result; return result(asExpr<TinyVector<T2,N> >::getExpr(d1), asExpr<T1>::getExpr(d2.unwrap())); } template <typename T1, typename T2, int N> typename BzBinaryExprResult<_bz_Max,T1,TinyVector<T2,N> >::T_result max(const ETBase<T1>& d1, const TinyVector<T2,N> d2) { typedef typename BzBinaryExprResult<_bz_Max,T1,TinyVector<T2,N> >::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<TinyVector<T2,N> >::getExpr(d2)); }
># 111 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/ops.h"
>template<typename T> typename BzBinaryExprResult<Add,char,T>::T_result operator+(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,char >::T_result operator+(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Add,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,char,T>::T_result operator-(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,char >::T_result operator-(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Subtract,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,char,T>::T_result operator*(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,char >::T_result operator*(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Multiply,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,char,T>::T_result operator/(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,char >::T_result operator/(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Divide,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,char,T>::T_result operator%(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,char >::T_result operator%(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Modulo,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,char,T>::T_result operator^(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,char >::T_result operator^(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,char,T>::T_result operator&(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,char >::T_result operator&(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,char,T>::T_result operator|(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,char >::T_result operator|(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,char,T>::T_result operator>(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,char >::T_result operator>(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Greater,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,char,T>::T_result operator<(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,char >::T_result operator<(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Less,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,char,T>::T_result operator>=(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,char >::T_result operator>=(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,char,T>::T_result operator<=(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,char >::T_result operator<=(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,char,T>::T_result operator==(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,char >::T_result operator==(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<Equal,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,char,T>::T_result operator!=(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,char >::T_result operator!=(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<NotEqual,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,char,T>::T_result operator&&(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,char >::T_result operator&&(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,char,T>::T_result operator||(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,char >::T_result operator||(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<LogicalOr,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,char,T>::T_result min(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,char >::T_result min(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<_bz_Min,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,char,T>::T_result max(const char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,char,T>::T_result result; return result(asExpr<char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,char >::T_result max(const ETBase<T>& d1, const char d2) { typedef typename BzBinaryExprResult<_bz_Max,T,char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<char >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,unsigned char,T>::T_result operator+(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,unsigned char >::T_result operator+(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Add,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,unsigned char,T>::T_result operator-(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,unsigned char >::T_result operator-(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Subtract,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,unsigned char,T>::T_result operator*(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,unsigned char >::T_result operator*(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Multiply,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,unsigned char,T>::T_result operator/(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,unsigned char >::T_result operator/(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Divide,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,unsigned char,T>::T_result operator%(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,unsigned char >::T_result operator%(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Modulo,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,unsigned char,T>::T_result operator^(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,unsigned char >::T_result operator^(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,unsigned char,T>::T_result operator&(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,unsigned char >::T_result operator&(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,unsigned char,T>::T_result operator|(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,unsigned char >::T_result operator|(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,unsigned char,T>::T_result operator>(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,unsigned char >::T_result operator>(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Greater,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,unsigned char,T>::T_result operator<(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,unsigned char >::T_result operator<(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Less,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,unsigned char,T>::T_result operator>=(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,unsigned char >::T_result operator>=(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,unsigned char,T>::T_result operator<=(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,unsigned char >::T_result operator<=(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,unsigned char,T>::T_result operator==(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,unsigned char >::T_result operator==(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<Equal,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,unsigned char,T>::T_result operator!=(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,unsigned char >::T_result operator!=(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<NotEqual,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,unsigned char,T>::T_result operator&&(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,unsigned char >::T_result operator&&(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,unsigned char,T>::T_result operator||(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,unsigned char >::T_result operator||(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<LogicalOr,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,unsigned char,T>::T_result min(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,unsigned char >::T_result min(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<_bz_Min,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,unsigned char,T>::T_result max(const unsigned char d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,unsigned char,T>::T_result result; return result(asExpr<unsigned char >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,unsigned char >::T_result max(const ETBase<T>& d1, const unsigned char d2) { typedef typename BzBinaryExprResult<_bz_Max,T,unsigned char >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned char >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,short,T>::T_result operator+(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,short >::T_result operator+(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Add,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,short,T>::T_result operator-(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,short >::T_result operator-(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Subtract,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,short,T>::T_result operator*(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,short >::T_result operator*(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Multiply,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,short,T>::T_result operator/(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,short >::T_result operator/(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Divide,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,short,T>::T_result operator%(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,short >::T_result operator%(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Modulo,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,short,T>::T_result operator^(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,short >::T_result operator^(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,short,T>::T_result operator&(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,short >::T_result operator&(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,short,T>::T_result operator|(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,short >::T_result operator|(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,short,T>::T_result operator>(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,short >::T_result operator>(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Greater,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,short,T>::T_result operator<(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,short >::T_result operator<(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Less,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,short,T>::T_result operator>=(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,short >::T_result operator>=(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,short,T>::T_result operator<=(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,short >::T_result operator<=(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,short,T>::T_result operator==(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,short >::T_result operator==(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<Equal,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,short,T>::T_result operator!=(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,short >::T_result operator!=(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<NotEqual,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,short,T>::T_result operator&&(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,short >::T_result operator&&(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,short,T>::T_result operator||(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,short >::T_result operator||(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<LogicalOr,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,short,T>::T_result min(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,short >::T_result min(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<_bz_Min,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,short,T>::T_result max(const short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,short,T>::T_result result; return result(asExpr<short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,short >::T_result max(const ETBase<T>& d1, const short d2) { typedef typename BzBinaryExprResult<_bz_Max,T,short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<short >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,unsigned short,T>::T_result operator+(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,unsigned short >::T_result operator+(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Add,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,unsigned short,T>::T_result operator-(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,unsigned short >::T_result operator-(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Subtract,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,unsigned short,T>::T_result operator*(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,unsigned short >::T_result operator*(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Multiply,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,unsigned short,T>::T_result operator/(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,unsigned short >::T_result operator/(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Divide,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,unsigned short,T>::T_result operator%(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,unsigned short >::T_result operator%(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Modulo,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,unsigned short,T>::T_result operator^(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,unsigned short >::T_result operator^(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,unsigned short,T>::T_result operator&(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,unsigned short >::T_result operator&(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,unsigned short,T>::T_result operator|(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,unsigned short >::T_result operator|(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,unsigned short,T>::T_result operator>(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,unsigned short >::T_result operator>(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Greater,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,unsigned short,T>::T_result operator<(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,unsigned short >::T_result operator<(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Less,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,unsigned short,T>::T_result operator>=(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,unsigned short >::T_result operator>=(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,unsigned short,T>::T_result operator<=(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,unsigned short >::T_result operator<=(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,unsigned short,T>::T_result operator==(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,unsigned short >::T_result operator==(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<Equal,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,unsigned short,T>::T_result operator!=(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,unsigned short >::T_result operator!=(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<NotEqual,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,unsigned short,T>::T_result operator&&(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,unsigned short >::T_result operator&&(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,unsigned short,T>::T_result operator||(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,unsigned short >::T_result operator||(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<LogicalOr,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,unsigned short,T>::T_result min(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,unsigned short >::T_result min(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<_bz_Min,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,unsigned short,T>::T_result max(const unsigned short d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,unsigned short,T>::T_result result; return result(asExpr<unsigned short >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,unsigned short >::T_result max(const ETBase<T>& d1, const unsigned short d2) { typedef typename BzBinaryExprResult<_bz_Max,T,unsigned short >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned short >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,int,T>::T_result operator+(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,int >::T_result operator+(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Add,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,int,T>::T_result operator-(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,int >::T_result operator-(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Subtract,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,int,T>::T_result operator*(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,int >::T_result operator*(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Multiply,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,int,T>::T_result operator/(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,int >::T_result operator/(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Divide,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,int,T>::T_result operator%(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,int >::T_result operator%(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Modulo,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,int,T>::T_result operator^(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,int >::T_result operator^(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,int,T>::T_result operator&(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,int >::T_result operator&(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,int,T>::T_result operator|(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,int >::T_result operator|(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,int,T>::T_result operator>(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,int >::T_result operator>(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Greater,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,int,T>::T_result operator<(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,int >::T_result operator<(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Less,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,int,T>::T_result operator>=(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,int >::T_result operator>=(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,int,T>::T_result operator<=(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,int >::T_result operator<=(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,int,T>::T_result operator==(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,int >::T_result operator==(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Equal,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,int,T>::T_result operator!=(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,int >::T_result operator!=(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<NotEqual,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,int,T>::T_result operator&&(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,int >::T_result operator&&(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,int,T>::T_result operator||(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,int >::T_result operator||(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<LogicalOr,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,int,T>::T_result min(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,int >::T_result min(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<_bz_Min,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,int,T>::T_result max(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,int >::T_result max(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<_bz_Max,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,unsigned int,T>::T_result operator+(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,unsigned int >::T_result operator+(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Add,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,unsigned int,T>::T_result operator-(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,unsigned int >::T_result operator-(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Subtract,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,unsigned int,T>::T_result operator*(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,unsigned int >::T_result operator*(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Multiply,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,unsigned int,T>::T_result operator/(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,unsigned int >::T_result operator/(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Divide,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,unsigned int,T>::T_result operator%(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,unsigned int >::T_result operator%(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Modulo,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,unsigned int,T>::T_result operator^(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,unsigned int >::T_result operator^(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,unsigned int,T>::T_result operator&(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,unsigned int >::T_result operator&(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,unsigned int,T>::T_result operator|(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,unsigned int >::T_result operator|(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,unsigned int,T>::T_result operator>(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,unsigned int >::T_result operator>(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Greater,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,unsigned int,T>::T_result operator<(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,unsigned int >::T_result operator<(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Less,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,unsigned int,T>::T_result operator>=(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,unsigned int >::T_result operator>=(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,unsigned int,T>::T_result operator<=(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,unsigned int >::T_result operator<=(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,unsigned int,T>::T_result operator==(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,unsigned int >::T_result operator==(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<Equal,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,unsigned int,T>::T_result operator!=(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,unsigned int >::T_result operator!=(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<NotEqual,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,unsigned int,T>::T_result operator&&(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,unsigned int >::T_result operator&&(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,unsigned int,T>::T_result operator||(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,unsigned int >::T_result operator||(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<LogicalOr,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,unsigned int,T>::T_result min(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,unsigned int >::T_result min(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<_bz_Min,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,unsigned int,T>::T_result max(const unsigned int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,unsigned int,T>::T_result result; return result(asExpr<unsigned int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,unsigned int >::T_result max(const ETBase<T>& d1, const unsigned int d2) { typedef typename BzBinaryExprResult<_bz_Max,T,unsigned int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned int >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,long,T>::T_result operator+(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,long >::T_result operator+(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Add,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,long,T>::T_result operator-(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,long >::T_result operator-(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Subtract,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,long,T>::T_result operator*(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,long >::T_result operator*(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Multiply,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,long,T>::T_result operator/(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,long >::T_result operator/(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Divide,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,long,T>::T_result operator%(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,long >::T_result operator%(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Modulo,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,long,T>::T_result operator^(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,long >::T_result operator^(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,long,T>::T_result operator&(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,long >::T_result operator&(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,long,T>::T_result operator|(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,long >::T_result operator|(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,long,T>::T_result operator>(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,long >::T_result operator>(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Greater,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,long,T>::T_result operator<(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,long >::T_result operator<(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Less,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,long,T>::T_result operator>=(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,long >::T_result operator>=(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,long,T>::T_result operator<=(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,long >::T_result operator<=(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,long,T>::T_result operator==(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,long >::T_result operator==(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<Equal,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,long,T>::T_result operator!=(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,long >::T_result operator!=(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<NotEqual,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,long,T>::T_result operator&&(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,long >::T_result operator&&(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,long,T>::T_result operator||(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,long >::T_result operator||(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<LogicalOr,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,long,T>::T_result min(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,long >::T_result min(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<_bz_Min,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,long,T>::T_result max(const long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,long,T>::T_result result; return result(asExpr<long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,long >::T_result max(const ETBase<T>& d1, const long d2) { typedef typename BzBinaryExprResult<_bz_Max,T,long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,unsigned long,T>::T_result operator+(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,unsigned long >::T_result operator+(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Add,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,unsigned long,T>::T_result operator-(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,unsigned long >::T_result operator-(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Subtract,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,unsigned long,T>::T_result operator*(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,unsigned long >::T_result operator*(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Multiply,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,unsigned long,T>::T_result operator/(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,unsigned long >::T_result operator/(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Divide,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,unsigned long,T>::T_result operator%(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,unsigned long >::T_result operator%(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Modulo,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,unsigned long,T>::T_result operator^(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,unsigned long >::T_result operator^(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,unsigned long,T>::T_result operator&(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,unsigned long >::T_result operator&(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,unsigned long,T>::T_result operator|(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,unsigned long >::T_result operator|(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,unsigned long,T>::T_result operator>(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,unsigned long >::T_result operator>(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Greater,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,unsigned long,T>::T_result operator<(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,unsigned long >::T_result operator<(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Less,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,unsigned long,T>::T_result operator>=(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,unsigned long >::T_result operator>=(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,unsigned long,T>::T_result operator<=(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,unsigned long >::T_result operator<=(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,unsigned long,T>::T_result operator==(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,unsigned long >::T_result operator==(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<Equal,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,unsigned long,T>::T_result operator!=(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,unsigned long >::T_result operator!=(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<NotEqual,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,unsigned long,T>::T_result operator&&(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,unsigned long >::T_result operator&&(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,unsigned long,T>::T_result operator||(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,unsigned long >::T_result operator||(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<LogicalOr,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,unsigned long,T>::T_result min(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,unsigned long >::T_result min(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<_bz_Min,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,unsigned long,T>::T_result max(const unsigned long d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,unsigned long,T>::T_result result; return result(asExpr<unsigned long >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,unsigned long >::T_result max(const ETBase<T>& d1, const unsigned long d2) { typedef typename BzBinaryExprResult<_bz_Max,T,unsigned long >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<unsigned long >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,float,T>::T_result operator+(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,float >::T_result operator+(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Add,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,float,T>::T_result operator-(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,float >::T_result operator-(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Subtract,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,float,T>::T_result operator*(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,float >::T_result operator*(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Multiply,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,float,T>::T_result operator/(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,float >::T_result operator/(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Divide,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,float,T>::T_result operator%(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,float >::T_result operator%(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Modulo,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,float,T>::T_result operator^(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,float >::T_result operator^(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,float,T>::T_result operator&(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,float >::T_result operator&(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,float,T>::T_result operator|(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,float >::T_result operator|(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,float,T>::T_result operator>(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,float >::T_result operator>(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Greater,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,float,T>::T_result operator<(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,float >::T_result operator<(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Less,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,float,T>::T_result operator>=(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,float >::T_result operator>=(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,float,T>::T_result operator<=(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,float >::T_result operator<=(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,float,T>::T_result operator==(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,float >::T_result operator==(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Equal,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,float,T>::T_result operator!=(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,float >::T_result operator!=(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<NotEqual,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,float,T>::T_result operator&&(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,float >::T_result operator&&(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,float,T>::T_result operator||(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,float >::T_result operator||(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<LogicalOr,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,float,T>::T_result min(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,float >::T_result min(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<_bz_Min,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,float,T>::T_result max(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,float >::T_result max(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<_bz_Max,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,double,T>::T_result operator+(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,double >::T_result operator+(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Add,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,double,T>::T_result operator-(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,double >::T_result operator-(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Subtract,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,double,T>::T_result operator*(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,double >::T_result operator*(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Multiply,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,double,T>::T_result operator/(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,double >::T_result operator/(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Divide,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,double,T>::T_result operator%(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,double >::T_result operator%(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Modulo,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,double,T>::T_result operator^(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,double >::T_result operator^(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,double,T>::T_result operator&(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,double >::T_result operator&(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,double,T>::T_result operator|(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,double >::T_result operator|(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,double,T>::T_result operator>(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,double >::T_result operator>(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Greater,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,double,T>::T_result operator<(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,double >::T_result operator<(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Less,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,double,T>::T_result operator>=(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,double >::T_result operator>=(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,double,T>::T_result operator<=(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,double >::T_result operator<=(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,double,T>::T_result operator==(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,double >::T_result operator==(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Equal,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,double,T>::T_result operator!=(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,double >::T_result operator!=(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<NotEqual,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,double,T>::T_result operator&&(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,double >::T_result operator&&(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,double,T>::T_result operator||(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,double >::T_result operator||(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<LogicalOr,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,double,T>::T_result min(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,double >::T_result min(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<_bz_Min,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,double,T>::T_result max(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,double >::T_result max(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<_bz_Max,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,long double,T>::T_result operator+(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,long double >::T_result operator+(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Add,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,long double,T>::T_result operator-(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,long double >::T_result operator-(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Subtract,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,long double,T>::T_result operator*(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,long double >::T_result operator*(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Multiply,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,long double,T>::T_result operator/(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,long double >::T_result operator/(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Divide,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,long double,T>::T_result operator%(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,long double >::T_result operator%(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Modulo,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,long double,T>::T_result operator^(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,long double >::T_result operator^(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,long double,T>::T_result operator&(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,long double >::T_result operator&(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,long double,T>::T_result operator|(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,long double >::T_result operator|(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,long double,T>::T_result operator>(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,long double >::T_result operator>(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Greater,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,long double,T>::T_result operator<(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,long double >::T_result operator<(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Less,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,long double,T>::T_result operator>=(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,long double >::T_result operator>=(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,long double,T>::T_result operator<=(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,long double >::T_result operator<=(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,long double,T>::T_result operator==(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,long double >::T_result operator==(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Equal,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,long double,T>::T_result operator!=(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,long double >::T_result operator!=(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<NotEqual,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,long double,T>::T_result operator&&(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,long double >::T_result operator&&(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,long double,T>::T_result operator||(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,long double >::T_result operator||(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<LogicalOr,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,long double,T>::T_result min(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,long double >::T_result min(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<_bz_Min,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,long double,T>::T_result max(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,long double >::T_result max(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<_bz_Max,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); }
>
>template<typename T> typename BzBinaryExprResult<Add,complex<float>,T>::T_result operator+(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,complex<float> >::T_result operator+(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Add,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,complex<float>,T>::T_result operator-(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,complex<float> >::T_result operator-(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Subtract,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,complex<float>,T>::T_result operator*(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,complex<float> >::T_result operator*(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Multiply,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,complex<float>,T>::T_result operator/(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,complex<float> >::T_result operator/(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Divide,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,complex<float>,T>::T_result operator%(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,complex<float> >::T_result operator%(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Modulo,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,complex<float>,T>::T_result operator^(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,complex<float> >::T_result operator^(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,complex<float>,T>::T_result operator&(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,complex<float> >::T_result operator&(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,complex<float>,T>::T_result operator|(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,complex<float> >::T_result operator|(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,complex<float>,T>::T_result operator>(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,complex<float> >::T_result operator>(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Greater,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,complex<float>,T>::T_result operator<(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,complex<float> >::T_result operator<(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Less,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,complex<float>,T>::T_result operator>=(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,complex<float> >::T_result operator>=(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,complex<float>,T>::T_result operator<=(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,complex<float> >::T_result operator<=(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,complex<float>,T>::T_result operator==(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,complex<float> >::T_result operator==(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<Equal,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,complex<float>,T>::T_result operator!=(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,complex<float> >::T_result operator!=(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<NotEqual,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,complex<float>,T>::T_result operator&&(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,complex<float> >::T_result operator&&(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,complex<float>,T>::T_result operator||(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,complex<float> >::T_result operator||(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<LogicalOr,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,complex<float>,T>::T_result min(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,complex<float> >::T_result min(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<_bz_Min,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,complex<float>,T>::T_result max(const complex<float> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,complex<float>,T>::T_result result; return result(asExpr<complex<float> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,complex<float> >::T_result max(const ETBase<T>& d1, const complex<float> d2) { typedef typename BzBinaryExprResult<_bz_Max,T,complex<float> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<float> >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,complex<double>,T>::T_result operator+(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,complex<double> >::T_result operator+(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Add,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,complex<double>,T>::T_result operator-(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,complex<double> >::T_result operator-(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Subtract,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,complex<double>,T>::T_result operator*(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,complex<double> >::T_result operator*(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Multiply,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,complex<double>,T>::T_result operator/(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,complex<double> >::T_result operator/(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Divide,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,complex<double>,T>::T_result operator%(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,complex<double> >::T_result operator%(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Modulo,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,complex<double>,T>::T_result operator^(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,complex<double> >::T_result operator^(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,complex<double>,T>::T_result operator&(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,complex<double> >::T_result operator&(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,complex<double>,T>::T_result operator|(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,complex<double> >::T_result operator|(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,complex<double>,T>::T_result operator>(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,complex<double> >::T_result operator>(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Greater,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,complex<double>,T>::T_result operator<(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,complex<double> >::T_result operator<(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Less,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,complex<double>,T>::T_result operator>=(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,complex<double> >::T_result operator>=(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,complex<double>,T>::T_result operator<=(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,complex<double> >::T_result operator<=(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,complex<double>,T>::T_result operator==(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,complex<double> >::T_result operator==(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<Equal,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,complex<double>,T>::T_result operator!=(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,complex<double> >::T_result operator!=(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<NotEqual,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,complex<double>,T>::T_result operator&&(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,complex<double> >::T_result operator&&(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,complex<double>,T>::T_result operator||(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,complex<double> >::T_result operator||(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<LogicalOr,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,complex<double>,T>::T_result min(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,complex<double> >::T_result min(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<_bz_Min,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,complex<double>,T>::T_result max(const complex<double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,complex<double>,T>::T_result result; return result(asExpr<complex<double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,complex<double> >::T_result max(const ETBase<T>& d1, const complex<double> d2) { typedef typename BzBinaryExprResult<_bz_Max,T,complex<double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<double> >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Add,complex<long double>,T>::T_result operator+(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Add,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Add,T,complex<long double> >::T_result operator+(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Add,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Subtract,complex<long double>,T>::T_result operator-(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Subtract,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Subtract,T,complex<long double> >::T_result operator-(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Subtract,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Multiply,complex<long double>,T>::T_result operator*(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Multiply,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Multiply,T,complex<long double> >::T_result operator*(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Multiply,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Divide,complex<long double>,T>::T_result operator/(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Divide,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Divide,T,complex<long double> >::T_result operator/(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Divide,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Modulo,complex<long double>,T>::T_result operator%(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Modulo,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Modulo,T,complex<long double> >::T_result operator%(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Modulo,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseXor,complex<long double>,T>::T_result operator^(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseXor,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseXor,T,complex<long double> >::T_result operator^(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<BitwiseXor,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,complex<long double>,T>::T_result operator&(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseAnd,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseAnd,T,complex<long double> >::T_result operator&(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<BitwiseAnd,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<BitwiseOr,complex<long double>,T>::T_result operator|(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<BitwiseOr,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<BitwiseOr,T,complex<long double> >::T_result operator|(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<BitwiseOr,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Greater,complex<long double>,T>::T_result operator>(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Greater,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Greater,T,complex<long double> >::T_result operator>(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Greater,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Less,complex<long double>,T>::T_result operator<(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Less,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Less,T,complex<long double> >::T_result operator<(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Less,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,complex<long double>,T>::T_result operator>=(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<GreaterOrEqual,T,complex<long double> >::T_result operator>=(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<GreaterOrEqual,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LessOrEqual,complex<long double>,T>::T_result operator<=(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LessOrEqual,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LessOrEqual,T,complex<long double> >::T_result operator<=(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<LessOrEqual,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Equal,complex<long double>,T>::T_result operator==(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Equal,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Equal,T,complex<long double> >::T_result operator==(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<Equal,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<NotEqual,complex<long double>,T>::T_result operator!=(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<NotEqual,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<NotEqual,T,complex<long double> >::T_result operator!=(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<NotEqual,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalAnd,complex<long double>,T>::T_result operator&&(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalAnd,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalAnd,T,complex<long double> >::T_result operator&&(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<LogicalAnd,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<LogicalOr,complex<long double>,T>::T_result operator||(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<LogicalOr,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<LogicalOr,T,complex<long double> >::T_result operator||(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<LogicalOr,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Min,complex<long double>,T>::T_result min(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Min,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Min,T,complex<long double> >::T_result min(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<_bz_Min,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<_bz_Max,complex<long double>,T>::T_result max(const complex<long double> d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<_bz_Max,complex<long double>,T>::T_result result; return result(asExpr<complex<long double> >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<_bz_Max,T,complex<long double> >::T_result max(const ETBase<T>& d1, const complex<long double> d2) { typedef typename BzBinaryExprResult<_bz_Max,T,complex<long double> >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<complex<long double> >::getExpr(d2)); }
>
>
>
>}
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/funcs.h" 1
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/funcs.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>namespace blitz {
>
>
>
>template <typename T>
>inline T blitz_sqr(T x)
>{ return x*x; }
>
>template <typename T>
>inline T blitz_cube(T x)
>{ return x*x*x; }
>
>template <typename T>
>inline T blitz_pow4(T x)
>{ return x*x*x*x; }
>
>template <typename T>
>inline T blitz_pow5(T x)
>{ return x*x*x*x*x; }
>
>template <typename T>
>inline T blitz_pow6(T x)
>{ return x*x*x*x*x*x; }
>
>template <typename T>
>inline T blitz_pow7(T x)
>{ return x*x*x*x*x*x*x; }
>
>template <typename T>
>inline T blitz_pow8(T x)
>{ return x*x*x*x*x*x*x*x; }
># 89 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1> struct Fn_acos { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::acos(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(acos)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_asin { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::asin(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(asin)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_atan { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::atan(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(atan)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_ceil { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::ceil(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(ceil)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_cos { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::cos(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(cos)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_cosh { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::cosh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(cosh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_exp { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::exp(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(exp)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_fabs { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::fabs(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(fabs)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_floor { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::floor(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(floor)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_log { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::log(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(log)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_log10 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::log10(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(log10)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_sin { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::sin(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(sin)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_sinh { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::sinh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(sinh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_sqrt { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::sqrt(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(sqrt)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_tan { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::tan(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(tan)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_tanh { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::tanh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_MATHFN_SCOPE(tanh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>
>
>template<typename T_numtype1> struct Fn_acosh { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::acosh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(acosh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_asinh { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::asinh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(asinh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_atanh { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::atanh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(atanh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_cbrt { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::cbrt(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(cbrt)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_erf { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::erf(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(erf)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_erfc { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::erfc(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(erfc)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_expm1 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::expm1(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(expm1)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_j0 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::j0(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(j0)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_j1 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::j1(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(j1)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_lgamma { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::lgamma(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(lgamma)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_logb { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::logb(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(logb)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_log1p { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::log1p(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(log1p)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_rint { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::rint(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(rint)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_y0 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::y0(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(y0)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_y1 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::y1(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(y1)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
># 130 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1> struct Fn_sqr { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_sqr(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_sqr)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_cube { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_cube(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_cube)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_pow4 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow4(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow4)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_pow5 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow5(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow5)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_pow6 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow6(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow6)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_pow7 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow7(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow7)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_pow8 { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow8(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow8)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
># 161 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1> struct Fn_ilogb { typedef int T_numtype; static inline T_numtype apply(T_numtype1 a) { return ::ilogb(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_IEEEMATHFN_SCOPE(ilogb)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
># 195 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1> struct Fn_conj { typedef T_numtype1 T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::conj(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(conj)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>
>
>
>template<typename T> struct Fn_cos< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::cos(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(cos)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_cosh< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::cosh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(cosh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_exp< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::exp(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(exp)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_log< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::log(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(log)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_log10< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::log10(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(log10)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_sin< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::sin(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(sin)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_sinh< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::sinh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(sinh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_sqrt< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::sqrt(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(sqrt)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_tan< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::tan(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(tan)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_tanh< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::tanh(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(tanh)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>
>
>template<typename T> struct Fn_sqr< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_sqr(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_sqr)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_cube< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_cube(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_cube)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_pow4< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow4(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow4)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_pow5< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow5(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow5)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_pow6< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow6(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow6)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_pow7< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow7(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow7)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T> struct Fn_pow8< complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a) { return blitz::blitz_pow8(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_BLITZ_SCOPE(blitz_pow8)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
># 246 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1> struct Fn_arg; template<typename T> struct Fn_arg< complex<T> > { typedef complex<T> T_numtype1; typedef T T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::arg(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(arg)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_imag; template<typename T> struct Fn_imag< complex<T> > { typedef complex<T> T_numtype1; typedef T T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::imag(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(imag)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_norm; template<typename T> struct Fn_norm< complex<T> > { typedef complex<T> T_numtype1; typedef T T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::norm(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(norm)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1> struct Fn_real; template<typename T> struct Fn_real< complex<T> > { typedef complex<T> T_numtype1; typedef T T_numtype; static inline T_numtype apply(T_numtype1 a) { return std::real(a); } template<typename T1> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1) { str += "BZ_CMATHFN_SCOPE(real)"; str += "("; t1.prettyPrint(str, format); str += ")"; } };
># 279 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1, typename T_numtype2> struct Fn_atan2 { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::atan2(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_MATHFN_SCOPE(atan2)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Fn_fmod { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::fmod(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_MATHFN_SCOPE(fmod)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } };
>template<typename T_numtype1, typename T_numtype2> struct Fn_pow { typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::pow(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_MATHFN_SCOPE(pow)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } };
># 398 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T> struct Fn_pow< complex<T>, complex<T> > { typedef complex<T> T_numtype1; typedef complex<T> T_numtype2; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::pow(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_CMATHFN_SCOPE(pow)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } }; template<typename T> struct Fn_pow< complex<T>, T > { typedef complex<T> T_numtype1; typedef T T_numtype2; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::pow(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_CMATHFN_SCOPE(pow)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } }; template<typename T> struct Fn_pow< T, complex<T> > { typedef T T_numtype1; typedef complex<T> T_numtype2; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::pow(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_CMATHFN_SCOPE(pow)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } };
># 432 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1, typename T_numtype2> struct Fn_polar; template<typename T> struct Fn_polar<T, T> { typedef T T_numtype1; typedef T T_numtype2; typedef complex<T> T_numtype; static inline T_numtype apply(T_numtype1 a, T_numtype2 b) { return std::polar(a,b); } template<typename T1, typename T2> static inline void prettyPrint(std::string &str, prettyPrintFormat& format, const T1& t1, const T2& t2) { str += "BZ_CMATHFN_SCOPE(polar)"; str += "("; t1.prettyPrint(str, format); str += ","; t2.prettyPrint(str, format); str += ")"; } };
># 498 "/mn/anatu/cma-u3/tmac/usr/include/blitz/funcs.h"
>template<typename T_numtype1>
>struct Fn_abs;
>
>
>template<>
>struct Fn_abs< int > {
>    typedef int T_numtype1;
>    typedef int T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return std::abs(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "abs";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>template<>
>struct Fn_abs< long int > {
>    typedef long int T_numtype1;
>    typedef long int T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return std::labs(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "abs";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>template<>
>struct Fn_abs< float > {
>    typedef float T_numtype1;
>    typedef float T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return std::fabs(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "abs";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>template<>
>struct Fn_abs< double > {
>    typedef double T_numtype1;
>    typedef double T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return std::fabs(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "abs";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>template<>
>struct Fn_abs< long double > {
>    typedef long double T_numtype1;
>    typedef long double T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return std::fabs(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "abs";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>
>template<typename T>
>struct Fn_abs< complex<T> > {
>    typedef complex<T> T_numtype1;
>    typedef T T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return std::abs(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "abs";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>
>
>
>template<typename T_numtype1>
>struct Fn_isnan {
>    typedef int T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    {
>
>        return std::isnan(a);
>
>
>
>    }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += "isnan";
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>
>
>template<typename T_numtype1, typename T_cast>
>struct Cast {
>    typedef T_cast T_numtype;
>
>    static inline T_numtype
>    apply(T_numtype1 a)
>    { return T_numtype(a); }
>
>    template<typename T1>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T1& t1)
>    {
>        str += typeid(T_cast).name();
>        str += "(";
>        t1.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>
>}
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/funcs.h" 2
>
>
>namespace blitz {
>
>
>
>template <typename T1> typename BzUnaryExprResult<Fn_abs,T1>::T_result abs(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_abs,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_acos,T1>::T_result acos(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_acos,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_asin,T1>::T_result asin(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_asin,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_atan,T1>::T_result atan(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_atan,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_ceil,T1>::T_result ceil(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_ceil,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_exp,T1>::T_result cexp(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_exp,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_cos,T1>::T_result cos(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_cos,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_cosh,T1>::T_result cosh(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_cosh,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_sqrt,T1>::T_result csqrt(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_sqrt,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_cube,T1>::T_result cube(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_cube,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_exp,T1>::T_result exp(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_exp,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_fabs,T1>::T_result fabs(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_fabs,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_floor,T1>::T_result floor(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_floor,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_log,T1>::T_result log(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_log,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_log10,T1>::T_result log10(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_log10,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_sqr,T1>::T_result pow2(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_sqr,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_cube,T1>::T_result pow3(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_cube,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_pow4,T1>::T_result pow4(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_pow4,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_pow5,T1>::T_result pow5(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_pow5,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_pow6,T1>::T_result pow6(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_pow6,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_pow7,T1>::T_result pow7(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_pow7,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_pow8,T1>::T_result pow8(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_pow8,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_sin,T1>::T_result sin(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_sin,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_sinh,T1>::T_result sinh(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_sinh,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_sqr,T1>::T_result sqr(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_sqr,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_sqrt,T1>::T_result sqrt(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_sqrt,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_tan,T1>::T_result tan(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_tan,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_tanh,T1>::T_result tanh(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_tanh,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>
>
>template <typename T1> typename BzUnaryExprResult<Fn_arg,T1>::T_result arg(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_arg,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_conj,T1>::T_result conj(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_conj,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_imag,T1>::T_result imag(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_imag,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_norm,T1>::T_result norm(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_norm,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_real,T1>::T_result real(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_real,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>
>
>
>
>template <typename T1> typename BzUnaryExprResult<Fn_acosh,T1>::T_result acosh(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_acosh,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_asinh,T1>::T_result asinh(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_asinh,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_atanh,T1>::T_result atanh(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_atanh,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_cbrt,T1>::T_result cbrt(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_cbrt,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_erf,T1>::T_result erf(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_erf,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_erfc,T1>::T_result erfc(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_erfc,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_expm1,T1>::T_result expm1(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_expm1,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>
>template <typename T1> typename BzUnaryExprResult<Fn_ilogb,T1>::T_result ilogb(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_ilogb,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_isnan,T1>::T_result blitz_isnan(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_isnan,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_j0,T1>::T_result j0(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_j0,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_j1,T1>::T_result j1(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_j1,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_lgamma,T1>::T_result lgamma(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_lgamma,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_logb,T1>::T_result logb(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_logb,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_log1p,T1>::T_result log1p(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_log1p,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_rint,T1>::T_result rint(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_rint,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>
>template <typename T1> typename BzUnaryExprResult<Fn_y0,T1>::T_result y0(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_y0,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
>template <typename T1> typename BzUnaryExprResult<Fn_y1,T1>::T_result y1(const ETBase<T1>& d1) { typedef typename BzUnaryExprResult<Fn_y1,T1>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap())); }
># 106 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/funcs.h"
>template<typename T_cast, typename T1>
>
>_bz_ArrayExpr<_bz_ArrayExprUnaryOp<typename asExpr<T1>::T_expr,
>    Cast<typename asExpr<T1>::T_expr::T_numtype, T_cast> > >
>cast(const ETBase<T1>& expr)
>{
>    return _bz_ArrayExpr<_bz_ArrayExprUnaryOp<
>        typename asExpr<T1>::T_expr,
>        Cast<typename asExpr<T1>::T_expr::T_numtype,T_cast> > >
>        (expr.unwrap());
>}
>
>
>
>template <typename T1,typename T2> typename BzBinaryExprResult<Fn_atan2,T1,T2>::T_result atan2(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Fn_atan2,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Fn_fmod,T1,T2>::T_result fmod(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Fn_fmod,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>template <typename T1,typename T2> typename BzBinaryExprResult<Fn_pow,T1,T2>::T_result pow(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Fn_pow,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
>
>
>template <typename T1,typename T2> typename BzBinaryExprResult<Fn_polar,T1,T2>::T_result polar(const ETBase<T1>& d1,const ETBase<T2>& d2) { typedef typename BzBinaryExprResult<Fn_polar,T1,T2>::T_result result; return result(asExpr<T1>::getExpr(d1.unwrap()), asExpr<T2>::getExpr(d2.unwrap())); }
># 163 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/funcs.h"
>template<typename T> typename BzBinaryExprResult<Fn_atan2,int,T>::T_result atan2(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_atan2,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_atan2,T,int >::T_result atan2(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Fn_atan2,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_fmod,int,T>::T_result fmod(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_fmod,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_fmod,T,int >::T_result fmod(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Fn_fmod,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_pow,int,T>::T_result pow(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_pow,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_pow,T,int >::T_result pow(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Fn_pow,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Fn_atan2,float,T>::T_result atan2(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_atan2,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_atan2,T,float >::T_result atan2(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Fn_atan2,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_fmod,float,T>::T_result fmod(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_fmod,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_fmod,T,float >::T_result fmod(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Fn_fmod,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_pow,float,T>::T_result pow(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_pow,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_pow,T,float >::T_result pow(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Fn_pow,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Fn_atan2,double,T>::T_result atan2(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_atan2,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_atan2,T,double >::T_result atan2(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Fn_atan2,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_fmod,double,T>::T_result fmod(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_fmod,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_fmod,T,double >::T_result fmod(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Fn_fmod,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_pow,double,T>::T_result pow(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_pow,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_pow,T,double >::T_result pow(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Fn_pow,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Fn_atan2,long double,T>::T_result atan2(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_atan2,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_atan2,T,long double >::T_result atan2(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Fn_atan2,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_fmod,long double,T>::T_result fmod(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_fmod,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_fmod,T,long double >::T_result fmod(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Fn_fmod,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); } template<typename T> typename BzBinaryExprResult<Fn_pow,long double,T>::T_result pow(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_pow,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_pow,T,long double >::T_result pow(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Fn_pow,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); }
>
>
>template<typename T> typename BzBinaryExprResult<Fn_polar,int,T>::T_result polar(const int d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_polar,int,T>::T_result result; return result(asExpr<int >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_polar,T,int >::T_result polar(const ETBase<T>& d1, const int d2) { typedef typename BzBinaryExprResult<Fn_polar,T,int >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<int >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Fn_polar,float,T>::T_result polar(const float d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_polar,float,T>::T_result result; return result(asExpr<float >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_polar,T,float >::T_result polar(const ETBase<T>& d1, const float d2) { typedef typename BzBinaryExprResult<Fn_polar,T,float >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<float >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Fn_polar,double,T>::T_result polar(const double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_polar,double,T>::T_result result; return result(asExpr<double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_polar,T,double >::T_result polar(const ETBase<T>& d1, const double d2) { typedef typename BzBinaryExprResult<Fn_polar,T,double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<double >::getExpr(d2)); }
>template<typename T> typename BzBinaryExprResult<Fn_polar,long double,T>::T_result polar(const long double d1, const ETBase<T>& d2) { typedef typename BzBinaryExprResult<Fn_polar,long double,T>::T_result result; return result(asExpr<long double >::getExpr(d1), asExpr<T>::getExpr(d2.unwrap())); } template<typename T> typename BzBinaryExprResult<Fn_polar,T,long double >::T_result polar(const ETBase<T>& d1, const long double d2) { typedef typename BzBinaryExprResult<Fn_polar,T,long double >::T_result result; return result(asExpr<T>::getExpr(d1.unwrap()), asExpr<long double >::getExpr(d2)); }
>
>template<typename T1, typename T2>
>inline _bz_ArrayExprBinaryOp<
>    typename asExpr<complex<T1> >::T_expr,
>    typename asExpr<T2>::T_expr,
>    Fn_pow<complex<T1>,typename asExpr<T2>::T_expr::T_numtype> >
>pow(const complex<T1> d1, const ETBase<T2>& d2)
>{
>    return _bz_ArrayExprBinaryOp<
>        typename asExpr<complex<T1> >::T_expr,
>        typename asExpr<T2>::T_expr,
>        Fn_pow<complex<T1>,typename asExpr<T2>::T_expr::T_numtype> >
>        (asExpr<complex<T1> >::getExpr(d1),
>         asExpr<T2>::getExpr(d2.unwrap()));
>}
>
>
>
>}
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet.h" 2
>
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/functorExpr.h" 1
># 99 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/functorExpr.h"
>namespace blitz {
>
>template<typename P_functor, typename P_expr, typename P_result>
>class _bz_FunctorExpr {
>public:
>    typedef P_functor T_functor;
>    typedef P_expr T_expr;
>    typedef typename T_expr::T_numtype T_numtype1;
>    typedef P_result T_numtype;
>    typedef T_expr T_ctorArg1;
>    typedef int T_ctorArg2;
>    typedef int T_ctorArg3;
>
>    static const int
>        numArrayOperands = T_expr::numArrayOperands,
> numIndexPlaceholders = T_expr::numIndexPlaceholders,
> rank = T_expr::rank;
>
>    _bz_FunctorExpr(const _bz_FunctorExpr<P_functor,P_expr,P_result>& a)
>        : f_(a.f_), iter_(a.iter_)
>    { }
>
>    _bz_FunctorExpr(const T_functor& f, const T_expr& a)
>        : f_(f), iter_(a)
>    { }
>
>    _bz_FunctorExpr(const T_functor& f, typename T_expr::T_ctorArg1 a)
>        : f_(f), iter_(a)
>    { }
># 136 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/functorExpr.h"
>    T_numtype operator*()
>    { return f_(*iter_); }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int,N_rank>& i)
>    { return f_(iter_(i)); }
>
>
>    int ascending(int rank)
>    { return iter_.ascending(rank); }
>
>    int ordering(int rank)
>    { return iter_.ordering(rank); }
>
>    int lbound(int rank)
>    { return iter_.lbound(rank); }
>
>    int ubound(int rank)
>    { return iter_.ubound(rank); }
>
>    void push(int position)
>    { iter_.push(position); }
>
>    void pop(int position)
>    { iter_.pop(position); }
>
>    void advance()
>    { iter_.advance(); }
>
>    void advance(int n)
>    { iter_.advance(n); }
>
>    void loadStride(int rank)
>    { iter_.loadStride(rank); }
>
>    bool isUnitStride(int rank) const
>    { return iter_.isUnitStride(rank); }
>
>    void advanceUnitStride()
>    { iter_.advanceUnitStride(); }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>        return iter_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return f_(iter_[i]); }
>
>    T_numtype fastRead(int i)
>    { return f_(iter_.fastRead(i)); }
>
>    int suggestStride(int rank) const
>    { return iter_.suggestStride(rank); }
>
>    bool isStride(int rank, int stride) const
>    { return iter_.isStride(rank,stride); }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        str += typeid(T_functor).name();
>        str += "(";
>        iter_.prettyPrint(str, format);
>        str += ")";
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    { return iter_.shapeCheck(shape); }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter_.moveTo(i);
>    }
>
>protected:
>    _bz_FunctorExpr() { }
>
>    T_functor f_;
>    T_expr iter_;
>};
>
>template<typename P_functor, typename P_expr1, typename P_expr2, typename P_result>
>class _bz_FunctorExpr2
>{
>public:
>    typedef P_functor T_functor;
>    typedef P_expr1 T_expr1;
>    typedef P_expr2 T_expr2;
>    typedef typename T_expr1::T_numtype T_numtype1;
>    typedef typename T_expr2::T_numtype T_numtype2;
>    typedef P_result T_numtype;
>    typedef T_expr1 T_ctorArg1;
>    typedef T_expr1 T_ctorArg2;
>    typedef int T_ctorArg3;
>
>    static const int
>        numArrayOperands = T_expr1::numArrayOperands
>                         + T_expr2::numArrayOperands,
> numIndexPlaceholders = T_expr1::numIndexPlaceholders
>                      + T_expr2::numIndexPlaceholders,
> rank = T_expr1::rank > T_expr2::rank
>             ? T_expr1::rank : T_expr2::rank;
>
>    _bz_FunctorExpr2(const _bz_FunctorExpr2<P_functor, P_expr1, P_expr2,
>        P_result>& a)
>        : f_(a.f_), iter1_(a.iter1_), iter2_(a.iter2_)
>    { }
>
>    _bz_FunctorExpr2(const T_functor& f, const T_expr1& a,
>        const T_expr2& b)
>        : f_(f), iter1_(a), iter2_(b)
>    { }
>
>    template<typename T1, typename T2>
>    _bz_FunctorExpr2(const T_functor& f, const T1& a, const T2& b)
>        : f_(f), iter1_(a), iter2_(b)
>    { }
>
>    T_numtype operator*()
>    { return f_(*iter1_, *iter2_); }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return f_(iter1_(i), iter2_(i)); }
>
>
>    int ascending(int rank)
>    {
>        return bounds::compute_ascending(rank, iter1_.ascending(rank),
>            iter2_.ascending(rank));
>    }
>
>    int ordering(int rank)
>    {
>        return bounds::compute_ordering(rank, iter1_.ordering(rank),
>            iter2_.ordering(rank));
>    }
>
>    int lbound(int rank)
>    {
>        return bounds::compute_lbound(rank, iter1_.lbound(rank),
>            iter2_.lbound(rank));
>    }
>
>    int ubound(int rank)
>    {
>        return bounds::compute_ubound(rank, iter1_.ubound(rank),
>            iter2_.ubound(rank));
>    }
>
>    void push(int position)
>    {
>        iter1_.push(position);
>        iter2_.push(position);
>    }
>
>    void pop(int position)
>    {
>        iter1_.pop(position);
>        iter2_.pop(position);
>    }
>
>    void advance()
>    {
>        iter1_.advance();
>        iter2_.advance();
>    }
>
>    void advance(int n)
>    {
>        iter1_.advance(n);
>        iter2_.advance(n);
>    }
>
>    void loadStride(int rank)
>    {
>        iter1_.loadStride(rank);
>        iter2_.loadStride(rank);
>    }
>
>    bool isUnitStride(int rank) const
>    { return iter1_.isUnitStride(rank) && iter2_.isUnitStride(rank); }
>
>    void advanceUnitStride()
>    {
>        iter1_.advanceUnitStride();
>        iter2_.advanceUnitStride();
>    }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>        return iter1_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter2_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return f_(iter1_[i], iter2_[i]); }
>
>    T_numtype fastRead(int i)
>    { return f_(iter1_.fastRead(i), iter2_.fastRead(i)); }
>
>    int suggestStride(int rank) const
>    {
>        int stride1 = iter1_.suggestStride(rank);
>        int stride2 = iter2_.suggestStride(rank);
>        return ( stride1>stride2 ? stride1 : stride2 );
>    }
>
>    bool isStride(int rank, int stride) const
>    {
>        return iter1_.isStride(rank,stride) && iter2_.isStride(rank,stride);
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        str += typeid(T_functor).name();
>        str += "(";
>        iter1_.prettyPrint(str, format);
>        str += ",";
>        iter2_.prettyPrint(str, format);
>        str += ")";
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter1_.moveTo(i);
>        iter2_.moveTo(i);
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    { return iter1_.shapeCheck(shape) && iter2_.shapeCheck(shape); }
>
>protected:
>    _bz_FunctorExpr2() { }
>
>    T_functor f_;
>    T_expr1 iter1_;
>    T_expr2 iter2_;
>};
>
>template<typename P_functor, typename P_expr1, typename P_expr2, typename P_expr3,
>    class P_result>
>class _bz_FunctorExpr3
>{
>public:
>    typedef P_functor T_functor;
>    typedef P_expr1 T_expr1;
>    typedef P_expr2 T_expr2;
>    typedef P_expr3 T_expr3;
>    typedef typename T_expr1::T_numtype T_numtype1;
>    typedef typename T_expr2::T_numtype T_numtype2;
>    typedef typename T_expr3::T_numtype T_numtype3;
>    typedef P_result T_numtype;
>    typedef T_expr1 T_ctorArg1;
>    typedef T_expr2 T_ctorArg2;
>    typedef T_expr3 T_ctorArg3;
>
>    static const int
>        numArrayOperands = T_expr1::numArrayOperands
>                         + T_expr2::numArrayOperands
>                         + T_expr3::numArrayOperands,
> numIndexPlaceholders = T_expr1::numIndexPlaceholders
>                      + T_expr2::numIndexPlaceholders
>                      + T_expr3::numIndexPlaceholders,
> rank12 = T_expr1::rank > T_expr2::rank
>        ? T_expr1::rank : T_expr2::rank,
> rank = rank12 > T_expr3::rank ? rank12 : T_expr3::rank;
>
>    _bz_FunctorExpr3(const _bz_FunctorExpr3<P_functor, P_expr1, P_expr2,
>        P_expr3, P_result>& a)
>        : f_(a.f_), iter1_(a.iter1_), iter2_(a.iter2_), iter3_(a.iter3_)
>    { }
>
>    _bz_FunctorExpr3(const T_functor& f, const T_expr1& a,
>        const T_expr2& b, const T_expr3& c)
>        : f_(f), iter1_(a), iter2_(b), iter3_(c)
>    { }
>
>    template<typename T1, typename T2, typename T3>
>    _bz_FunctorExpr3(const T_functor& f, const T1& a, const T2& b,
>        const T3& c)
>        : f_(f), iter1_(a), iter2_(b), iter3_(c)
>    { }
>
>    T_numtype operator*()
>    { return f_(*iter1_, *iter2_, *iter3_); }
>
>
>
>
>
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return f_(iter1_(i), iter2_(i), iter3_(i)); }
>
>
>    int ascending(int rank)
>    {
>        return bounds::compute_ascending(rank, iter1_.ascending(rank),
>            bounds::compute_ascending(rank, iter2_.ascending(rank),
>            iter3_.ascending(rank)));
>    }
>
>    int ordering(int rank)
>    {
>        return bounds::compute_ordering(rank, iter1_.ordering(rank),
>            bounds::compute_ordering(rank, iter2_.ordering(rank),
>     iter3_.ordering(rank)));
>    }
>
>    int lbound(int rank)
>    {
>        return bounds::compute_lbound(rank, iter1_.lbound(rank),
>            bounds::compute_lbound(rank, iter2_.lbound(rank),
>     iter3_.lbound(rank)));
>    }
>
>    int ubound(int rank)
>    {
>        return bounds::compute_ubound(rank, iter1_.ubound(rank),
>            bounds::compute_ubound(rank, iter2_.ubound(rank),
>     iter3_.ubound(rank)));
>    }
>
>    void push(int position)
>    {
>        iter1_.push(position);
>        iter2_.push(position);
>        iter3_.push(position);
>    }
>
>    void pop(int position)
>    {
>        iter1_.pop(position);
>        iter2_.pop(position);
>        iter3_.pop(position);
>    }
>
>    void advance()
>    {
>        iter1_.advance();
>        iter2_.advance();
>        iter3_.advance();
>    }
>
>    void advance(int n)
>    {
>        iter1_.advance(n);
>        iter2_.advance(n);
>        iter3_.advance(n);
>    }
>
>    void loadStride(int rank)
>    {
>        iter1_.loadStride(rank);
>        iter2_.loadStride(rank);
>        iter3_.loadStride(rank);
>    }
>
>    bool isUnitStride(int rank) const
>    {
>        return iter1_.isUnitStride(rank) && iter2_.isUnitStride(rank)
>            && iter3_.isUnitStride(rank);
>    }
>
>    void advanceUnitStride()
>    {
>        iter1_.advanceUnitStride();
>        iter2_.advanceUnitStride();
>        iter3_.advanceUnitStride();
>    }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>        return iter1_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter2_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter3_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    T_numtype operator[](int i)
>    { return f_(iter1_[i], iter2_[i], iter3_[i]); }
>
>    T_numtype fastRead(int i)
>    { return f_(iter1_.fastRead(i), iter2_.fastRead(i), iter3_.fastRead(i)); }
>
>    int suggestStride(int rank) const
>    {
>        int stride1 = iter1_.suggestStride(rank);
>        int stride2 = iter2_.suggestStride(rank);
>        int stride3 = iter3_.suggestStride(rank);
> return ( stride1 > (stride2 = (stride2>stride3 ? stride2 : stride3)) ?
>            stride1 : stride2 );
>    }
>
>    bool isStride(int rank, int stride) const
>    {
>        return iter1_.isStride(rank,stride) && iter2_.isStride(rank,stride)
>            && iter3_.isStride(rank,stride);
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        str += typeid(T_functor).name();
>        str += "(";
>        iter1_.prettyPrint(str, format);
>        str += ",";
>        iter2_.prettyPrint(str, format);
>        str += ",";
>        iter3_.prettyPrint(str, format);
>        str += ")";
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter1_.moveTo(i);
>        iter2_.moveTo(i);
>        iter3_.moveTo(i);
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    {
>        return iter1_.shapeCheck(shape) && iter2_.shapeCheck(shape)
>            && iter3_.shapeCheck(shape);
>    }
>
>protected:
>    _bz_FunctorExpr3() { }
>
>    T_functor f_;
>    T_expr1 iter1_;
>    T_expr2 iter2_;
>    T_expr3 iter3_;
>};
>
>template<typename P_functor, typename P_expr>
>
>_bz_ArrayExpr<_bz_FunctorExpr<P_functor, typename asExpr<P_expr>::T_expr,
>    typename asExpr<P_expr>::T_expr::T_numtype> >
>applyFunctor(const P_functor& f, const ETBase<P_expr>& a)
>{
>    typedef _bz_FunctorExpr<P_functor,
>        typename asExpr<P_expr>::T_expr,
>        typename asExpr<P_expr>::T_expr::T_numtype> f1;
>    return _bz_ArrayExpr<f1>(f, a.unwrap());
>}
>
>template<typename P_functor, typename P_expr1, typename P_expr2>
>
>_bz_ArrayExpr<_bz_FunctorExpr2<P_functor,
>    typename asExpr<P_expr1>::T_expr,
>    typename asExpr<P_expr2>::T_expr,
>    typename blitz::promote_trait<typename asExpr<P_expr1>::T_expr::T_numtype,typename asExpr<P_expr2>::T_expr::T_numtype>::T_promote> >
>
>applyFunctor(const P_functor& f,
>    const ETBase<P_expr1>& a, const ETBase<P_expr2>& b)
>{
>    typedef _bz_FunctorExpr2<P_functor,
>        typename asExpr<P_expr1>::T_expr,
>        typename asExpr<P_expr2>::T_expr,
>        typename blitz::promote_trait<typename asExpr<P_expr1>::T_expr::T_numtype,typename asExpr<P_expr2>::T_expr::T_numtype>::T_promote> f2;
>
>    return _bz_ArrayExpr<f2>(f, a.unwrap(), b.unwrap());
>}
>
>template<typename P_functor, typename P_expr1, typename P_expr2, typename P_expr3>
>
>_bz_ArrayExpr<_bz_FunctorExpr3<P_functor,
>    typename asExpr<P_expr1>::T_expr,
>    typename asExpr<P_expr2>::T_expr,
>    typename asExpr<P_expr3>::T_expr,
>    typename blitz::promote_trait<typename asExpr<P_expr1>::T_expr::T_numtype,typename blitz::promote_trait<typename asExpr<P_expr2>::T_expr::T_numtype,typename asExpr<P_expr3>::T_expr::T_numtype>::T_promote>::T_promote> >
>
>
>applyFunctor(const P_functor& f, const ETBase<P_expr1>& a,
>    const ETBase<P_expr2>& b, const ETBase<P_expr3>& c)
>{
>    typedef _bz_FunctorExpr3<P_functor,
>        typename asExpr<P_expr1>::T_expr,
>        typename asExpr<P_expr2>::T_expr,
>        typename asExpr<P_expr3>::T_expr,
>        typename blitz::promote_trait<typename asExpr<P_expr1>::T_expr::T_numtype,typename blitz::promote_trait<typename asExpr<P_expr2>::T_expr::T_numtype,typename asExpr<P_expr3>::T_expr::T_numtype>::T_promote>::T_promote> f3;
>
>
>    return _bz_ArrayExpr<f3>(f, a.unwrap(), b.unwrap(), c.unwrap());
>}
>
>}
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/newet.h" 2
># 28 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/et.h" 2
># 2516 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h" 1
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/reduce.h" 1
># 43 "/mn/anatu/cma-u3/tmac/usr/include/blitz/reduce.h"
>namespace blitz {
>
>template<typename P_sourcetype, typename P_resulttype = typename NumericTypeTraits<P_sourcetype>::T_sumtype>
>class ReduceSum {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef P_resulttype T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = true;
>
>    ReduceSum()
>    { reset(); }
>
>    ReduceSum(T_resulttype initialValue)
>    { sum_ = initialValue; }
>
>    bool operator()(T_sourcetype x)
>    {
>        sum_ += x;
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        sum_ += x;
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return sum_; }
>
>    void reset()
>    { sum_ = zero(T_resulttype()); }
>
>    void reset(T_resulttype initialValue)
>    { sum_ = initialValue; }
>
>    static const char* name()
>    { return "sum"; }
>
>protected:
>    T_resulttype sum_;
>};
>
>template<typename P_sourcetype, typename P_resulttype = typename NumericTypeTraits<P_sourcetype>::T_floattype>
>class ReduceMean {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef P_resulttype T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = false;
>
>    ReduceMean()
>    { reset(); }
>
>    ReduceMean(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        sum_ += x;
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        sum_ += x;
>        return true;
>    }
>
>    T_resulttype result(int count)
>    { return sum_ / count; }
>
>    void reset()
>    { sum_ = zero(T_resulttype()); }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "mean"; }
>
>protected:
>    T_resulttype sum_;
>};
>
>template<typename P_sourcetype>
>class ReduceMin {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef P_sourcetype T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = false;
>
>    ReduceMin()
>    { reset(); }
>
>    ReduceMin(T_resulttype min)
>    {
>        min_ = min;
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        if (x < min_)
>            min_ = x;
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        if (x < min_)
>            min_ = x;
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return min_; }
>
>    void reset()
>    { min_ = huge(P_sourcetype()); }
>
>    void reset(T_resulttype initialValue)
>    { min_ = initialValue; }
>
>    static const char* name()
>    { return "min"; }
>
>protected:
>    T_resulttype min_;
>};
>
>template<typename P_sourcetype>
>class ReduceMax {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef P_sourcetype T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = true;
>
>    ReduceMax()
>    { reset(); }
>
>    ReduceMax(T_resulttype max)
>    {
>        max_ = max;
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        if (x > max_)
>            max_ = x;
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        if (x > max_)
>            max_ = x;
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return max_; }
>
>    void reset()
>    { max_ = neghuge(P_sourcetype()); }
>
>    void reset(T_resulttype initialValue)
>    { max_ = initialValue; }
>
>    static const char* name()
>    { return "max"; }
>
>protected:
>    T_resulttype max_;
>};
>
>template<typename P_sourcetype>
>class ReduceMinIndex {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef int T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = true, canProvideInitialValue = false;
>
>    ReduceMinIndex()
>    { reset(); }
>
>    ReduceMinIndex(T_resulttype min)
>    {
>        reset(min);
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype x, int index)
>    {
>        if (x < min_)
>        {
>            min_ = x;
>            index_ = index;
>        }
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return index_; }
>
>    void reset()
>    {
>        min_ = huge(T_sourcetype());
>        index_ = tiny(int());
>    }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "minIndex"; }
>
>protected:
>    T_sourcetype min_;
>    int index_;
>};
>
>template<typename P_sourcetype, int N>
>class ReduceMinIndexVector {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef TinyVector<int,N> T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool canProvideInitialValue = false;
>
>    ReduceMinIndexVector()
>    { reset(); }
>
>    ReduceMinIndexVector(T_resulttype min)
>    {
>        reset(min);
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype, int)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype x, const TinyVector<int,N>& index)
>    {
>        if (x < min_)
>        {
>            min_ = x;
>            index_ = index;
>        }
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return index_; }
>
>    void reset()
>    {
>        min_ = huge(T_sourcetype());
>        index_ = tiny(int());
>    }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "minIndex"; }
>
>protected:
>    T_sourcetype min_;
>    TinyVector<int,N> index_;
>};
>
>template<typename P_sourcetype>
>class ReduceMaxIndex {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef int T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = true, canProvideInitialValue = false;
>
>    ReduceMaxIndex()
>    { reset(); }
>
>    ReduceMaxIndex(T_resulttype max)
>    {
>        reset(max);
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype x, int index)
>    {
>        if (x > max_)
>        {
>            max_ = x;
>            index_ = index;
>        }
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return index_; }
>
>    void reset()
>    {
>        max_ = neghuge(T_sourcetype());
>        index_ = tiny(int());
>    }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "maxIndex"; }
>
>protected:
>    T_sourcetype max_;
>    int index_;
>};
>
>template<typename P_sourcetype, int N_rank>
>class ReduceMaxIndexVector {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef TinyVector<int,N_rank> T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool canProvideInitialValue = false;
>
>    ReduceMaxIndexVector()
>    { reset(); }
>
>    ReduceMaxIndexVector(T_resulttype max)
>    {
>        reset(max);
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype x, const TinyVector<int,N_rank>& index)
>    {
>        if (x > max_)
>        {
>            max_ = x;
>            index_ = index;
>        }
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return index_; }
>
>    void reset()
>    {
>        max_ = neghuge(T_sourcetype());
>        index_ = tiny(int());
>    }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "maxIndex"; }
>
>protected:
>    T_sourcetype max_;
>    TinyVector<int,N_rank> index_;
>};
>
>template<typename P_sourcetype>
>class ReduceFirst {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef int T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = true, canProvideInitialValue = false;
>
>    ReduceFirst()
>    { reset(); }
>
>    ReduceFirst(T_resulttype)
>    {
>        ;
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype x, int index)
>    {
>        if (x)
>        {
>            index_ = index;
>            return false;
>        }
>        else
>            return true;
>    }
>
>    T_resulttype result(int)
>    { return index_; }
>
>    void reset()
>    {
>        index_ = tiny(int());
>    }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "first"; }
>
>protected:
>    int index_;
>};
>
>template<typename P_sourcetype>
>class ReduceLast {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef int T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = true, canProvideInitialValue = false;
>
>    ReduceLast()
>    { reset(); }
>
>    ReduceLast(T_resulttype)
>    {
>        ;
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        ;
>        return false;
>    }
>
>    bool operator()(T_sourcetype x, int index)
>    {
>        if (x)
>        {
>            index_ = index;
>            return true;
>        }
>        else
>            return true;
>    }
>
>    T_resulttype result(int)
>    { return index_; }
>
>    void reset()
>    {
>        index_ = huge(int());
>    }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "last"; }
>
>protected:
>    int index_;
>};
>
>template<typename P_sourcetype, typename P_resulttype = typename NumericTypeTraits<P_sourcetype>::T_sumtype>
>class ReduceProduct {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef P_resulttype T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = true;
>
>    ReduceProduct()
>    { product_ = one(T_resulttype()); }
>
>    ReduceProduct(T_resulttype initialValue)
>    { product_ = initialValue; }
>
>    bool operator()(T_sourcetype x)
>    {
>        product_ *= x;
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        product_ *= x;
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return product_; }
>
>    void reset()
>    { product_ = one(T_resulttype()); }
>
>    void reset(T_resulttype initialValue)
>    { product_ = initialValue; }
>
>    static const char* name()
>    { return "product"; }
>
>protected:
>    T_resulttype product_;
>};
>
>template<typename P_sourcetype>
>class ReduceCount {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef int T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = true;
>
>    ReduceCount()
>    { reset(); }
>
>    ReduceCount(T_resulttype count)
>    {
>        count_ = count;
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        if (x)
>            ++count_;
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        if (x)
>            ++count_;
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return count_; }
>
>    void reset()
>    { count_ = zero(T_resulttype()); }
>
>    void reset(T_resulttype initialValue)
>    { count_ = initialValue; }
>
>    static const char* name()
>    { return "count"; }
>
>protected:
>    T_resulttype count_;
>};
>
>template<typename P_sourcetype>
>class ReduceAny {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef bool T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = false;
>
>    ReduceAny()
>    { reset(); }
>
>    ReduceAny(T_resulttype initialValue)
>    {
>        reset(initialValue);
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        if (x)
>        {
>            any_ = true;
>            return false;
>        }
>
>        return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        if (x)
>        {
>            any_ = true;
>            return false;
>        }
>
>        return true;
>    }
>
>    T_resulttype result(int)
>    { return any_; }
>
>    void reset()
>    { any_ = false; }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "any"; }
>
>protected:
>    T_resulttype any_;
>};
>
>template<typename P_sourcetype>
>class ReduceAll {
>
>public:
>    typedef P_sourcetype T_sourcetype;
>    typedef bool T_resulttype;
>    typedef T_resulttype T_numtype;
>
>    static const bool needIndex = false, canProvideInitialValue = false;
>
>    ReduceAll()
>    { reset(); }
>
>    ReduceAll(T_resulttype initialValue)
>    {
>        reset(initialValue);
>    }
>
>    bool operator()(T_sourcetype x)
>    {
>        if (!bool(x))
>        {
>            all_ = false;
>            return false;
>        }
>        else
>            return true;
>    }
>
>    bool operator()(T_sourcetype x, int)
>    {
>        if (!bool(x))
>        {
>            all_ = false;
>            return false;
>        }
>        else
>            return true;
>    }
>
>    T_resulttype result(int)
>    { return all_; }
>
>    void reset()
>    { all_ = true; }
>
>    void reset(T_resulttype)
>    {
>        ;
>        reset();
>    }
>
>    static const char* name()
>    { return "all"; }
>
>protected:
>    T_resulttype all_;
>};
>
>}
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h" 2
>
>namespace blitz {
>
>template<typename T_expr, int N_index, typename T_reduction>
>class _bz_ArrayExprReduce {
>
>public:
>    typedef typename T_reduction::T_numtype T_numtype;
>    typedef T_expr T_ctorArg1;
>    typedef T_reduction T_ctorArg2;
>
>    static const int
>        numArrayOperands = T_expr::numArrayOperands,
>        numIndexPlaceholders = T_expr::numIndexPlaceholders + 1,
>        rank = T_expr::rank - 1;
>
>    _bz_ArrayExprReduce(const _bz_ArrayExprReduce<T_expr,N_index,T_reduction>&
>        reduce)
>        : reduce_(reduce.reduce_), iter_(reduce.iter_), ordering_(reduce.ordering_)
>    {
>    }
>
>    _bz_ArrayExprReduce(T_expr expr)
>        : iter_(expr)
>    { computeOrdering(); }
>
>    _bz_ArrayExprReduce(T_expr expr, T_reduction reduce)
>        : iter_(expr), reduce_(reduce)
>    { computeOrdering(); }
>
>    int ascending(int r)
>    { return iter_.ascending(r); }
>
>    int ordering(int r)
>    { return ordering_[r]; }
>
>    int lbound(int r)
>    { return iter_.lbound(r); }
>
>    int ubound(int r)
>    { return iter_.ubound(r); }
>
>    template<int N_destRank>
>    T_numtype operator()(const TinyVector<int, N_destRank>& destIndex)
>    {
>        ;
>
>
>
>
>        TinyVector<int, N_destRank + 1> index;
>
>
>        _bz_meta_vecAssign<N_index, 0>::assign(index, destIndex,
>            _bz_update<int,int>());
>
>        int lbound = iter_.lbound(N_index);
>        int ubound = iter_.ubound(N_index);
>
>
>
>        ;
>
>
>
>
>
>        reduce_.reset();
>
>        for (index[N_index] = iter_.lbound(N_index);
>            index[N_index] <= ubound; ++index[N_index])
>        {
>            if (!reduce_(iter_(index), index[N_index]))
>                break;
>        }
>
>        return reduce_.result(ubound-lbound+1);
>    }
>
>
>
>
>
>    int operator*()
>    {
>        ;
>        return 0;
>    }
>
>
>    void push(int)
>    {
>        ;
>    }
>
>
>    void pop(int)
>    {
>        ;
>    }
>
>
>    void advance()
>    {
>        ;
>    }
>
>
>    void advance(int)
>    {
>        ;
>    }
>
>
>    void loadStride(int)
>    {
>        ;
>    }
>
>    bool isUnitStride(int) const
>    {
>        ;
>        return false;
>    }
>
>    void advanceUnitStride()
>    {
>        ;
>    }
>
>    bool canCollapse(int,int) const
>    { ; return false; }
>
>    T_numtype operator[](int)
>    {
>        ;
>        return T_numtype();
>    }
>
>    T_numtype fastRead(int)
>    {
>        ;
>        return T_numtype();
>    }
>
>    int suggestStride(int) const
>    {
>        ;
>        return 0;
>    }
>
>    bool isStride(int,int) const
>    {
>        ;
>        return true;
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>&)
>    {
>        ;
>        return;
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>
>        str += "reduce[NEEDS_WORK](";
>        iter_.prettyPrint(str,format);
>        str += ")";
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape&) const
>    {
>
>        return true;
>    }
>
>private:
>    _bz_ArrayExprReduce() { }
>
>    void computeOrdering()
>    {
>        TinyVector<bool,rank> in_ordering;
>        in_ordering = false;
>
>        int j = 0;
>        for (int i=0; i<rank; ++i)
>        {
>            int orderingj = iter_.ordering(i);
>            if (orderingj != (-2147483647 - 1) && orderingj < rank &&
>                !in_ordering(orderingj)) {
>                in_ordering(orderingj) = true;
>                ordering_(j++) = orderingj;
>            }
>
>        }
>
>
>
>
>        for (int i = rank-1; j < rank; ++j) {
>            while (in_ordering(i))
>                --i;
>            ordering_(j) = i--;
>        }
>    }
>
>    T_reduction reduce_;
>    T_expr iter_;
>    TinyVector<int,rank> ordering_;
>};
># 271 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h"
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceSum<typename T_expr::T_numtype> > > sum(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceSum<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceSum<T_numtype> > > sum(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceSum<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMean<typename T_expr::T_numtype> > > mean(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMean<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMean<T_numtype> > > mean(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMean<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMin<typename T_expr::T_numtype> > > min(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMin<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMin<T_numtype> > > min(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMin<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMinIndex<typename T_expr::T_numtype> > > minIndex(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMinIndex<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMinIndex<T_numtype> > > minIndex(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMinIndex<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMax<typename T_expr::T_numtype> > > max(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMax<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMax<T_numtype> > > max(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMax<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMaxIndex<typename T_expr::T_numtype> > > maxIndex(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceMaxIndex<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMaxIndex<T_numtype> > > maxIndex(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceMaxIndex<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceProduct<typename T_expr::T_numtype> > > product(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceProduct<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceProduct<T_numtype> > > product(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceProduct<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceCount<typename T_expr::T_numtype> > > count(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceCount<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceCount<T_numtype> > > count(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceCount<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceAny<typename T_expr::T_numtype> > > any(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceAny<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceAny<T_numtype> > > any(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceAny<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceAll<typename T_expr::T_numtype> > > all(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceAll<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceAll<T_numtype> > > all(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceAll<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceFirst<typename T_expr::T_numtype> > > first(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceFirst<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceFirst<T_numtype> > > first(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceFirst<T_numtype> > (array.beginFast()); }
>template<typename T_expr, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceLast<typename T_expr::T_numtype> > > last(_bz_ArrayExpr<T_expr> expr, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<_bz_ArrayExpr<T_expr>, N_index, ReduceLast<typename T_expr::T_numtype> >(expr); } template<typename T_numtype, int N_rank, int N_index> inline _bz_ArrayExpr<_bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceLast<T_numtype> > > last(const Array<T_numtype, N_rank>& array, const IndexPlaceholder<N_index>&) { return _bz_ArrayExprReduce<FastArrayIterator<T_numtype,N_rank>, N_index, ReduceLast<T_numtype> > (array.beginFast()); }
>
>
>
>
>
>
>template<typename T_expr, typename T_reduction>
>typename T_reduction::T_resulttype
>_bz_ArrayExprFullReduce(T_expr expr, T_reduction reduction);
># 312 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h"
>template<typename T_expr> inline typename ReduceSum<typename T_expr::T_numtype>::T_resulttype sum(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceSum<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceSum<T_numtype>::T_resulttype sum(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceSum<T_numtype>()); }
>template<typename T_expr> inline typename ReduceMean<typename T_expr::T_numtype>::T_resulttype mean(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceMean<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceMean<T_numtype>::T_resulttype mean(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceMean<T_numtype>()); }
>template<typename T_expr> inline typename ReduceMin<typename T_expr::T_numtype>::T_resulttype min(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceMin<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceMin<T_numtype>::T_resulttype min(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceMin<T_numtype>()); }
>template<typename T_expr> inline typename ReduceMax<typename T_expr::T_numtype>::T_resulttype max(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceMax<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceMax<T_numtype>::T_resulttype max(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceMax<T_numtype>()); }
>template<typename T_expr> inline typename ReduceProduct<typename T_expr::T_numtype>::T_resulttype product(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceProduct<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceProduct<T_numtype>::T_resulttype product(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceProduct<T_numtype>()); }
>template<typename T_expr> inline typename ReduceCount<typename T_expr::T_numtype>::T_resulttype count(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceCount<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceCount<T_numtype>::T_resulttype count(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceCount<T_numtype>()); }
>template<typename T_expr> inline typename ReduceAny<typename T_expr::T_numtype>::T_resulttype any(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceAny<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceAny<T_numtype>::T_resulttype any(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceAny<T_numtype>()); }
>template<typename T_expr> inline typename ReduceAll<typename T_expr::T_numtype>::T_resulttype all(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceAll<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceAll<T_numtype>::T_resulttype all(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceAll<T_numtype>()); }
>template<typename T_expr> inline typename ReduceFirst<typename T_expr::T_numtype>::T_resulttype first(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceFirst<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceFirst<T_numtype>::T_resulttype first(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceFirst<T_numtype>()); }
>template<typename T_expr> inline typename ReduceLast<typename T_expr::T_numtype>::T_resulttype last(_bz_ArrayExpr<T_expr> expr) { return _bz_ArrayExprFullReduce(expr, ReduceLast<typename T_expr::T_numtype>()); } template<typename T_numtype, int N_rank> inline typename ReduceLast<T_numtype>::T_resulttype last(const Array<T_numtype, N_rank>& array) { return _bz_ArrayExprFullReduce(array.beginFast(), ReduceLast<T_numtype>()); }
># 346 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h"
>template<typename T_expr> inline typename ReduceMinIndexVector<typename T_expr::T_numtype, T_expr::rank>::T_resulttype minIndex(_bz_ArrayExpr<T_expr> expr) { return _bz_reduceWithIndexVectorTraversal(expr, ReduceMinIndexVector<typename T_expr::T_numtype, T_expr::rank>()); } template<typename T_numtype, int N_rank> inline typename ReduceMinIndexVector<T_numtype,N_rank>::T_resulttype minIndex(const Array<T_numtype, N_rank>& array) { return _bz_reduceWithIndexVectorTraversal( array.beginFast(), ReduceMinIndexVector<T_numtype,N_rank>()); }
>template<typename T_expr> inline typename ReduceMaxIndexVector<typename T_expr::T_numtype, T_expr::rank>::T_resulttype maxIndex(_bz_ArrayExpr<T_expr> expr) { return _bz_reduceWithIndexVectorTraversal(expr, ReduceMaxIndexVector<typename T_expr::T_numtype, T_expr::rank>()); } template<typename T_numtype, int N_rank> inline typename ReduceMaxIndexVector<T_numtype,N_rank>::T_resulttype maxIndex(const Array<T_numtype, N_rank>& array) { return _bz_reduceWithIndexVectorTraversal( array.beginFast(), ReduceMaxIndexVector<T_numtype,N_rank>()); }
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.cc" 1
># 27 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.cc"
>namespace blitz {
>
>template<typename T_expr, typename T_reduction>
>typename T_reduction::T_resulttype
>_bz_reduceWithIndexTraversal(T_expr expr, T_reduction reduction);
>
>template<typename T_expr, typename T_reduction>
>typename T_reduction::T_resulttype
>_bz_reduceWithStackTraversal(T_expr expr, T_reduction reduction);
>
>template<typename T_expr, typename T_reduction>
>typename T_reduction::T_resulttype
>_bz_ArrayExprFullReduce(T_expr expr, T_reduction reduction)
>{
># 56 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.cc"
>    return _bz_reduceWithIndexTraversal(expr, reduction);
># 70 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.cc"
>}
>
>template<typename T_expr, typename T_reduction>
>typename T_reduction::T_resulttype
>_bz_reduceWithIndexTraversal(T_expr expr, T_reduction reduction)
>{
>
>
>    reduction.reset();
>
>    const int rank = T_expr::rank;
>
>    TinyVector<int,T_expr::rank> index, first, last;
>
>    unsigned long count = 1;
>
>    for (int i=0; i < rank; ++i)
>    {
>        index(i) = expr.lbound(i);
>        first(i) = index(i);
>        last(i) = expr.ubound(i) + 1;
>        count *= last(i) - first(i);
>    }
>
>    const int maxRank = rank - 1;
>    int lastlbound = expr.lbound(maxRank);
>    int lastubound = expr.ubound(maxRank);
>
>    int lastIndex = lastubound + 1;
>
>    bool loopFlag = true;
>
>    while(loopFlag) {
>        for (index[maxRank]=lastlbound;index[maxRank]<lastIndex;++index[maxRank])
>            if (!reduction(expr(index), index[maxRank])) {
>                loopFlag = false;
>                break;
>            }
>
>        int j = rank-2;
>        for (; j >= 0; --j) {
>            index(j+1) = first(j+1);
>            ++index(j);
>            if (index(j) != last(j))
>                break;
>        }
>
>        if (j < 0)
>            break;
>    }
>
>    return reduction.result(count);
>}
>
>
>template<typename T_expr, typename T_reduction>
>typename T_reduction::T_resulttype
>_bz_reduceWithIndexVectorTraversal(T_expr expr, T_reduction reduction)
>{
>
>
>
>    reduction.reset();
>
>    const int rank = T_expr::rank;
>
>    TinyVector<int,T_expr::rank> index, first, last;
>
>    unsigned long count = 1;
>
>    for (int i=0; i < rank; ++i)
>    {
>        index(i) = expr.lbound(i);
>        first(i) = index(i);
>        last(i) = expr.ubound(i) + 1;
>        count *= last(i) - first(i);
>    }
>
>    const int maxRank = rank - 1;
>    int lastlbound = expr.lbound(maxRank);
>    int lastubound = expr.ubound(maxRank);
>
>    int lastIndex = lastubound + 1;
>
>    bool loopFlag = true;
>
>    while(loopFlag) {
>        for (index[maxRank]=lastlbound;index[maxRank]<lastIndex;++index[maxRank])
>            if (!reduction(expr(index),index)) {
>                loopFlag = false;
>                break;
>            }
>
>        int j = rank-2;
>        for (; j >= 0; --j) {
>            index(j+1) = first(j+1);
>            ++index(j);
>            if (index(j) != last(j))
>                break;
>        }
>
>        if (j < 0)
>            break;
>    }
>
>    return reduction.result(count);
>}
>
>}
># 352 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/reduce.h" 2
># 2517 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/interlace.cc" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/interlace.cc"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/shape.h" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/shape.h"
>namespace blitz {
># 43 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/shape.h"
>inline TinyVector<int,1> shape(int n1)
>{ return TinyVector<int,1>(n1); }
>
>inline TinyVector<int,2> shape(int n1, int n2)
>{ return TinyVector<int,2>(n1,n2); }
>
>inline TinyVector<int,3> shape(int n1, int n2, int n3)
>{ return TinyVector<int,3>(n1,n2,n3); }
>
>inline TinyVector<int,4> shape(int n1, int n2, int n3, int n4)
>{ return TinyVector<int,4>(n1,n2,n3,n4); }
>
>inline TinyVector<int,5> shape(int n1, int n2, int n3, int n4,
>    int n5)
>{ return TinyVector<int,5>(n1,n2,n3,n4,n5); }
>
>inline TinyVector<int,6> shape(int n1, int n2, int n3, int n4,
>    int n5, int n6)
>{ return TinyVector<int,6>(n1,n2,n3,n4,n5,n6); }
>
>inline TinyVector<int,7> shape(int n1, int n2, int n3, int n4,
>    int n5, int n6, int n7)
>{ return TinyVector<int,7>(n1,n2,n3,n4,n5,n6,n7); }
>
>inline TinyVector<int,8> shape(int n1, int n2, int n3, int n4,
>    int n5, int n6, int n7, int n8)
>{ return TinyVector<int,8>(n1,n2,n3,n4,n5,n6,n7,n8); }
>
>inline TinyVector<int,9> shape(int n1, int n2, int n3, int n4,
>    int n5, int n6, int n7, int n8, int n9)
>{ return TinyVector<int,9>(n1,n2,n3,n4,n5,n6,n7,n8,n9); }
>
>inline TinyVector<int,10> shape(int n1, int n2, int n3, int n4,
>    int n5, int n6, int n7, int n8, int n9, int n10)
>{ return TinyVector<int,10>(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10); }
>
>inline TinyVector<int,11> shape(int n1, int n2, int n3, int n4,
>    int n5, int n6, int n7, int n8, int n9, int n10, int n11)
>{ return TinyVector<int,11>(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11); }
>
>}
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/interlace.cc" 2
>
>
>namespace blitz {
># 67 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/interlace.cc"
>template<typename T_numtype>
>void makeInterlacedArray(Array<T_numtype,2>& mainArray,
>    Array<T_numtype,1>& subarray, int slice)
>{
>    Array<T_numtype,1> tmp = mainArray(Range::all(), slice);
>    subarray.reference(tmp);
>}
>
>template<typename T_numtype>
>void makeInterlacedArray(Array<T_numtype,3>& mainArray,
>    Array<T_numtype,2>& subarray, int slice)
>{
>    Array<T_numtype,2> tmp = mainArray(Range::all(), Range::all(),
>        slice);
>    subarray.reference(tmp);
>}
>
>template<typename T_numtype>
>void makeInterlacedArray(Array<T_numtype,4>& mainArray,
>    Array<T_numtype,3>& subarray, int slice)
>{
>    Array<T_numtype,3> tmp = mainArray(Range::all(), Range::all(),
>        Range::all(), slice);
>    subarray.reference(tmp);
>}
>
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 2, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 3, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 4, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 5, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 6, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>    makeInterlacedArray(array, a6, 5);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 7, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>    makeInterlacedArray(array, a6, 5);
>    makeInterlacedArray(array, a7, 6);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 8, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>    makeInterlacedArray(array, a6, 5);
>    makeInterlacedArray(array, a7, 6);
>    makeInterlacedArray(array, a8, 7);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8,
>    Array<T_numtype,N_rank>& a9)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 9, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>    makeInterlacedArray(array, a6, 5);
>    makeInterlacedArray(array, a7, 6);
>    makeInterlacedArray(array, a8, 7);
>    makeInterlacedArray(array, a9, 8);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8,
>    Array<T_numtype,N_rank>& a9, Array<T_numtype,N_rank>& a10)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 10, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>    makeInterlacedArray(array, a6, 5);
>    makeInterlacedArray(array, a7, 6);
>    makeInterlacedArray(array, a8, 7);
>    makeInterlacedArray(array, a9, 8);
>    makeInterlacedArray(array, a10, 9);
>}
>
>template<typename T_numtype, int N_rank>
>void interlaceArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8,
>    Array<T_numtype,N_rank>& a9, Array<T_numtype,N_rank>& a10,
>    Array<T_numtype,N_rank>& a11)
>{
>    GeneralArrayStorage<N_rank+1> storage;
>    Array<T_numtype, N_rank+1> array(shape, 11, storage);
>    makeInterlacedArray(array, a1, 0);
>    makeInterlacedArray(array, a2, 1);
>    makeInterlacedArray(array, a3, 2);
>    makeInterlacedArray(array, a4, 3);
>    makeInterlacedArray(array, a5, 4);
>    makeInterlacedArray(array, a6, 5);
>    makeInterlacedArray(array, a7, 6);
>    makeInterlacedArray(array, a8, 7);
>    makeInterlacedArray(array, a9, 8);
>    makeInterlacedArray(array, a10, 9);
>    makeInterlacedArray(array, a11, 10);
>}
># 271 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/interlace.cc"
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>    a6.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>    a6.resize(shape);
>    a7.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>    a6.resize(shape);
>    a7.resize(shape);
>    a8.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8,
>    Array<T_numtype,N_rank>& a9)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>    a6.resize(shape);
>    a7.resize(shape);
>    a8.resize(shape);
>    a9.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8,
>    Array<T_numtype,N_rank>& a9, Array<T_numtype,N_rank>& a10)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>    a6.resize(shape);
>    a7.resize(shape);
>    a8.resize(shape);
>    a9.resize(shape);
>    a10.resize(shape);
>
>}
>
>template<typename T_numtype, int N_rank>
>void allocateArrays(const TinyVector<int,N_rank>& shape,
>    Array<T_numtype,N_rank>& a1, Array<T_numtype,N_rank>& a2,
>    Array<T_numtype,N_rank>& a3, Array<T_numtype,N_rank>& a4,
>    Array<T_numtype,N_rank>& a5, Array<T_numtype,N_rank>& a6,
>    Array<T_numtype,N_rank>& a7, Array<T_numtype,N_rank>& a8,
>    Array<T_numtype,N_rank>& a9, Array<T_numtype,N_rank>& a10,
>    Array<T_numtype,N_rank>& a11)
>{
>
>
>
>    a1.resize(shape);
>    a2.resize(shape);
>    a3.resize(shape);
>    a4.resize(shape);
>    a5.resize(shape);
>    a6.resize(shape);
>    a7.resize(shape);
>    a8.resize(shape);
>    a9.resize(shape);
>    a10.resize(shape);
>    a11.resize(shape);
>
>}
>
>
>
>
>template<typename T_numtype, int N_rank>
>Array<T_numtype,N_rank>::Array(const TinyVector<int,N_rank-1>& shape,
>    int lastExtent, const GeneralArrayStorage<N_rank>& storage)
>    : storage_(storage)
>{
>
>
>
>
>    if (ordering(0) == 0)
>    {
>
>        length_[0] = lastExtent;
>        storage_.setBase(0,0);
>        for (int i=1; i < N_rank; ++i)
>            length_[i] = shape[i-1];
>    }
>    else if (ordering(0) == N_rank-1)
>    {
>
>        for (int i=0; i < N_rank-1; ++i)
>            length_[i] = shape[i];
>        length_[N_rank-1] = lastExtent;
>        storage_.setBase(N_rank-1, 0);
>    }
>    else {
>        ;
>    }
>
>    setupStorage(N_rank-1);
>}
># 540 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/interlace.cc"
>}
># 2518 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/resize.cc" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/resize.cc"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/minmax.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/minmax.h"
>namespace blitz {
>
>
>
>
>
>
>namespace minmax {
>
>template<typename T1, typename T2>
>typename blitz::promote_trait<T1,T2>::T_promote min(const T1& a, const T2& b)
>{
>    typedef typename blitz::promote_trait<T1,T2>::T_promote T_promote;
>
>    if (a <= b)
>        return T_promote(a);
>    else
>        return T_promote(b);
>}
>
>template<typename T1, typename T2>
>typename blitz::promote_trait<T1,T2>::T_promote max(const T1& a, const T2& b)
>{
>    typedef typename blitz::promote_trait<T1,T2>::T_promote T_promote;
>
>    if (a >= b)
>        return T_promote(a);
>    else
>        return T_promote(b);
>}
>
>}
>
>}
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/resize.cc" 2
>
>namespace blitz {
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0)
>{
>    ;
>    ;
>
>    if (extent0 != length_[0])
>    {
>        length_[0] = extent0;
>        setupStorage(0);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1)
>{
>    ;
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        setupStorage(1);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2)
>{
>    ;
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        setupStorage(2);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3)
>{
>    ;
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        setupStorage(3);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4)
>{
>    ;
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        setupStorage(4);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4, int extent5)
>{
>    ;
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]) || (extent5 != length_[5]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        length_[5] = extent5;
>        setupStorage(5);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4, int extent5,
>    int extent6)
>{
>    ;
>
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]) || (extent5 != length_[5])
>        || (extent6 != length_[6]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        length_[5] = extent5;
>        length_[6] = extent6;
>        setupStorage(6);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4, int extent5,
>    int extent6, int extent7)
>{
>    ;
>
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]) || (extent5 != length_[5])
>        || (extent6 != length_[6]) || (extent7 != length_[7]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        length_[5] = extent5;
>        length_[6] = extent6;
>        length_[7] = extent7;
>        setupStorage(7);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4, int extent5,
>    int extent6, int extent7, int extent8)
>{
>    ;
>
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]) || (extent5 != length_[5])
>        || (extent6 != length_[6]) || (extent7 != length_[7])
>        || (extent8 != length_[8]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        length_[5] = extent5;
>        length_[6] = extent6;
>        length_[7] = extent7;
>        length_[8] = extent8;
>        setupStorage(8);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4, int extent5,
>    int extent6, int extent7, int extent8, int extent9)
>{
>    ;
>
>
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]) || (extent5 != length_[5])
>        || (extent6 != length_[6]) || (extent7 != length_[7])
>        || (extent8 != length_[8]) || (extent9 != length_[9]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        length_[5] = extent5;
>        length_[6] = extent6;
>        length_[7] = extent7;
>        length_[8] = extent8;
>        length_[9] = extent9;
>        setupStorage(9);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(int extent0, int extent1,
>    int extent2, int extent3, int extent4, int extent5,
>    int extent6, int extent7, int extent8, int extent9,
>    int extent10)
>{
>    ;
>
>
>
>    ;
>
>    if ((extent0 != length_[0]) || (extent1 != length_[1])
>        || (extent2 != length_[2]) || (extent3 != length_[3])
>        || (extent4 != length_[4]) || (extent5 != length_[5])
>        || (extent6 != length_[6]) || (extent7 != length_[7])
>        || (extent8 != length_[8]) || (extent9 != length_[9])
>        || (extent10 != length_[10]))
>    {
>        length_[0] = extent0;
>        length_[1] = extent1;
>        length_[2] = extent2;
>        length_[3] = extent3;
>        length_[4] = extent4;
>        length_[5] = extent5;
>        length_[6] = extent6;
>        length_[7] = extent7;
>        length_[8] = extent8;
>        length_[9] = extent9;
>        length_[10] = extent10;
>        setupStorage(10);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0)
>{
> ;
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
>
> setupStorage(0);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1)
>{
> ;
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
>
> setupStorage(1);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2)
>{
> ;
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
>
> setupStorage(2);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3)
>{
> ;
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
>
> setupStorage(3);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4)
>{
> ;
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
>
> setupStorage(4);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4, Range r5)
>{
> ;
>
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
> length_[5] = r5.length();
> storage_.setBase(5, r5.first());
>
> setupStorage(5);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4, Range r5, Range r6)
>{
> ;
>
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
> length_[5] = r5.length();
> storage_.setBase(5, r5.first());
> length_[6] = r6.length();
> storage_.setBase(6, r6.first());
>
> setupStorage(6);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4, Range r5, Range r6, Range r7)
>{
> ;
>
>
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
> length_[5] = r5.length();
> storage_.setBase(5, r5.first());
> length_[6] = r6.length();
> storage_.setBase(6, r6.first());
> length_[7] = r7.length();
> storage_.setBase(7, r7.first());
>
> setupStorage(7);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4, Range r5, Range r6, Range r7, Range r8)
>{
> ;
>
>
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
> length_[5] = r5.length();
> storage_.setBase(5, r5.first());
> length_[6] = r6.length();
> storage_.setBase(6, r6.first());
> length_[7] = r7.length();
> storage_.setBase(7, r7.first());
> length_[8] = r8.length();
> storage_.setBase(8, r8.first());
>
> setupStorage(8);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4, Range r5, Range r6, Range r7, Range r8,
>  Range r9)
>{
> ;
>
>
>
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
> length_[5] = r5.length();
> storage_.setBase(5, r5.first());
> length_[6] = r6.length();
> storage_.setBase(6, r6.first());
> length_[7] = r7.length();
> storage_.setBase(7, r7.first());
> length_[8] = r8.length();
> storage_.setBase(8, r8.first());
> length_[9] = r9.length();
> storage_.setBase(9, r9.first());
>
> setupStorage(9);
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(Range r0, Range r1, Range r2,
>  Range r3, Range r4, Range r5, Range r6, Range r7, Range r8,
>  Range r9, Range r10)
>{
> ;
>
>
>
>
>
>
> length_[0] = r0.length();
> storage_.setBase(0, r0.first());
> length_[1] = r1.length();
> storage_.setBase(1, r1.first());
> length_[2] = r2.length();
> storage_.setBase(2, r2.first());
> length_[3] = r3.length();
> storage_.setBase(3, r3.first());
> length_[4] = r4.length();
> storage_.setBase(4, r4.first());
> length_[5] = r5.length();
> storage_.setBase(5, r5.first());
> length_[6] = r6.length();
> storage_.setBase(6, r6.first());
> length_[7] = r7.length();
> storage_.setBase(7, r7.first());
> length_[8] = r8.length();
> storage_.setBase(8, r8.first());
> length_[9] = r9.length();
> storage_.setBase(9, r9.first());
> length_[10] = r10.length();
> storage_.setBase(10, r10.first());
>
> setupStorage(10);
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0)
>{
>    ;
>    ;
>
>    if (length0 != length_[firstRank])
>    {
># 587 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/resize.cc"
>        T_array B(base(), blitz::shape(length0), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>              ubound(0)));
>            B(overlap0) = (*this)(overlap0);
>        }
>        reference(B);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1)
>{
>    ;
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1]))
>    {
>        T_array B(base(), blitz::shape(length0, length1), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>                ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>                ubound(1)));
>            B(overlap0, overlap1) = (*this)(overlap0, overlap1);
>        }
>        reference(B);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2)
>{
>    ;
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2),
>            storage_);
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>                ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>                ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2),
>                ubound(2)));
>            B(overlap0, overlap1, overlap2) = (*this)(overlap0, overlap1,
>                overlap2);
>        }
>        reference(B);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3)
>{
>    ;
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3]))
>    {
>        T_array B(base(), blitz::shape(length0, length1,
>            length2, length3), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0), ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1), ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2), ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3), ubound(3)));
>            B(overlap0, overlap1, overlap2, overlap3) = (*this)(overlap0,
>                overlap1, overlap2, overlap3);
>        }
>        reference(B);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4)
>{
>    ;
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]))
>    {
>        T_array B(base(), blitz::shape(length0, length1,
>            length2, length3, length4), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0), ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1), ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2), ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3), ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4), ubound(4)));
>            B(overlap0, overlap1, overlap2, overlap3, overlap4) = (*this)
>                (overlap0, overlap1, overlap2, overlap3, overlap4);
>        }
>        reference(B);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4, int length5)
>{
>    ;
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]) || (length5 != length_[5]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2,
>            length3, length4, length5), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0), ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1), ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2), ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3), ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4), ubound(4)));
>            Range overlap5 = Range(fromStart, minmax::min(B.ubound(5), ubound(5)));
>            B(overlap0, overlap1, overlap2, overlap3, overlap4, overlap5)
>                = (*this)(overlap0, overlap1, overlap2, overlap3, overlap4,
>                overlap5);
>        }
>        reference(B);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4, int length5, int length6)
>{
>    ;
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]) || (length5 != length_[5])
>        || (length6 != length_[6]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2,
>            length3, length4, length5, length6), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>               ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>               ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2),
>               ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3),
>               ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4),
>               ubound(4)));
>            Range overlap5 = Range(fromStart, minmax::min(B.ubound(5),
>               ubound(5)));
>            Range overlap6 = Range(fromStart, minmax::min(B.ubound(6),
>               ubound(6)));
>            B(overlap0, overlap1, overlap2, overlap3, overlap4, overlap5,
>              overlap6)
>                = (*this)(overlap0, overlap1, overlap2, overlap3, overlap4,
>                overlap5, overlap6);
>        }
>        reference(B);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4, int length5, int length6,
>    int length7)
>{
>    ;
>
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]) || (length5 != length_[5])
>        || (length6 != length_[6]) || (length7 != length_[7]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2,
>            length3, length4, length5, length6, length7), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>               ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>               ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2),
>               ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3),
>               ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4),
>               ubound(4)));
>            Range overlap5 = Range(fromStart, minmax::min(B.ubound(5),
>               ubound(5)));
>            Range overlap6 = Range(fromStart, minmax::min(B.ubound(6),
>               ubound(6)));
>            Range overlap7 = Range(fromStart, minmax::min(B.ubound(7),
>               ubound(7)));
>            B(overlap0, overlap1, overlap2, overlap3, overlap4, overlap5,
>              overlap6, overlap7)
>                = (*this)(overlap0, overlap1, overlap2, overlap3, overlap4,
>                overlap5, overlap6, overlap7);
>        }
>        reference(B);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4, int length5, int length6,
>    int length7, int length8)
>{
>    ;
>
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]) || (length5 != length_[5])
>        || (length6 != length_[6]) || (length7 != length_[7])
>        || (length8 != length_[8]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2,
>            length3, length4, length5, length6, length7, length8), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>               ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>               ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2),
>               ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3),
>               ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4),
>               ubound(4)));
>            Range overlap5 = Range(fromStart, minmax::min(B.ubound(5),
>               ubound(5)));
>            Range overlap6 = Range(fromStart, minmax::min(B.ubound(6),
>               ubound(6)));
>            Range overlap7 = Range(fromStart, minmax::min(B.ubound(7),
>               ubound(7)));
>            Range overlap8 = Range(fromStart, minmax::min(B.ubound(8),
>               ubound(8)));
>            B(overlap0, overlap1, overlap2, overlap3, overlap4, overlap5,
>              overlap6, overlap7, overlap8)
>                = (*this)(overlap0, overlap1, overlap2, overlap3, overlap4,
>                overlap5, overlap6, overlap7, overlap8);
>        }
>        reference(B);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4, int length5, int length6,
>    int length7, int length8, int length9)
>{
>    ;
>
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]) || (length5 != length_[5])
>        || (length6 != length_[6]) || (length7 != length_[7])
>        || (length8 != length_[8]) || (length9 != length_[9]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2,
>            length3, length4, length5, length6, length7, length8, length9),
>            storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>               ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>               ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2),
>               ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3),
>               ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4),
>               ubound(4)));
>            Range overlap5 = Range(fromStart, minmax::min(B.ubound(5),
>               ubound(5)));
>            Range overlap6 = Range(fromStart, minmax::min(B.ubound(6),
>               ubound(6)));
>            Range overlap7 = Range(fromStart, minmax::min(B.ubound(7),
>               ubound(7)));
>            Range overlap8 = Range(fromStart, minmax::min(B.ubound(8),
>               ubound(8)));
>            Range overlap9 = Range(fromStart, minmax::min(B.ubound(9),
>               ubound(9)));
>            B(overlap0, overlap1, overlap2, overlap3, overlap4, overlap5,
>              overlap6, overlap7, overlap8, overlap9)
>                = (*this)(overlap0, overlap1, overlap2, overlap3, overlap4,
>                overlap5, overlap6, overlap7, overlap8, overlap9);
>        }
>        reference(B);
>    }
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(int length0, int length1,
>    int length2, int length3, int length4, int length5, int length6,
>    int length7, int length8, int length9, int length10)
>{
>    ;
>
>
>    ;
>
>    if ((length0 != length_[0]) || (length1 != length_[1])
>        || (length2 != length_[2]) || (length3 != length_[3])
>        || (length4 != length_[4]) || (length5 != length_[5])
>        || (length6 != length_[6]) || (length7 != length_[7])
>        || (length8 != length_[8]) || (length9 != length_[9])
>        || (length10 != length_[10]))
>    {
>        T_array B(base(), blitz::shape(length0, length1, length2,
>            length3, length4, length5, length6, length7, length8, length9,
>            length10), storage_);
>
>        if (numElements())
>        {
>            Range overlap0 = Range(fromStart, minmax::min(B.ubound(0),
>               ubound(0)));
>            Range overlap1 = Range(fromStart, minmax::min(B.ubound(1),
>               ubound(1)));
>            Range overlap2 = Range(fromStart, minmax::min(B.ubound(2),
>               ubound(2)));
>            Range overlap3 = Range(fromStart, minmax::min(B.ubound(3),
>               ubound(3)));
>            Range overlap4 = Range(fromStart, minmax::min(B.ubound(4),
>               ubound(4)));
>            Range overlap5 = Range(fromStart, minmax::min(B.ubound(5),
>               ubound(5)));
>            Range overlap6 = Range(fromStart, minmax::min(B.ubound(6),
>               ubound(6)));
>            Range overlap7 = Range(fromStart, minmax::min(B.ubound(7),
>               ubound(7)));
>            Range overlap8 = Range(fromStart, minmax::min(B.ubound(8),
>               ubound(8)));
>            Range overlap9 = Range(fromStart, minmax::min(B.ubound(9),
>               ubound(9)));
>            Range overlap10 = Range(fromStart, minmax::min(B.ubound(10),
>               ubound(10)));
>        }
>        reference(B);
>    }
>}
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resize(const TinyVector<int,N_rank>& extent)
>{
>
>
>
>
>        length_ = extent;
>        setupStorage(N_rank);
>
>}
>
>
>template<typename T_numtype, int N_rank>
>void Array<T_numtype, N_rank>::resizeAndPreserve(
>    const TinyVector<int,N_rank>& extent)
>{
>
>
>
>
>        T_array B(base(), extent, storage_);
>
>        if (numElements())
>        {
>          TinyVector<int,N_rank> ub;
>          for (int d=0; d < N_rank; ++d)
>            ub(d) = minmax::min(B.ubound(d),ubound(d));
>          RectDomain<N_rank> overlap(lbound(),ub);
>          B(overlap) = (*this)(overlap);
>        }
>        reference(B);
>
>}
>
>}
># 2519 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slicing.cc" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slicing.cc"
>namespace blitz {
>
>
>
>
>
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, const RectDomain<N_rank>& subdomain)
>{
>    reference(array);
>    for (int i=0; i < N_rank; ++i)
>        slice(i, subdomain[i]);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, const StridedDomain<N_rank>& subdomain)
>{
>    reference(array);
>    for (int i=0; i < N_rank; ++i)
>        slice(i, subdomain[i]);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0)
>{
>    reference(array);
>    slice(0, r0);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4, Range r5)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>    slice(5, r5);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4, Range r5, Range r6)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>    slice(5, r5);
>    slice(6, r6);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4, Range r5, Range r6, Range r7)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>    slice(5, r5);
>    slice(6, r6);
>    slice(7, r7);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4, Range r5, Range r6, Range r7, Range r8)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>    slice(5, r5);
>    slice(6, r6);
>    slice(7, r7);
>    slice(8, r8);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4, Range r5, Range r6, Range r7, Range r8, Range r9)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>    slice(5, r5);
>    slice(6, r6);
>    slice(7, r7);
>    slice(8, r8);
>    slice(9, r9);
>}
>
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::constructSubarray(
>    Array<T_numtype, N_rank>& array, Range r0, Range r1, Range r2, Range r3,
>    Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10)
>{
>    reference(array);
>    slice(0, r0);
>    slice(1, r1);
>    slice(2, r2);
>    slice(3, r3);
>    slice(4, r4);
>    slice(5, r5);
>    slice(6, r6);
>    slice(7, r7);
>    slice(8, r8);
>    slice(9, r9);
>    slice(10, r10);
>}
>
>
>
>
>
>
>template<typename P_numtype, int N_rank> template<int N_rank2, typename R0,
>    class R1, typename R2, typename R3, typename R4, typename R5, typename R6, typename R7,
>    class R8, typename R9, typename R10>
>void Array<P_numtype, N_rank>::constructSlice(Array<T_numtype, N_rank2>& array,
>    R0 r0, R1 r1, R2 r2, R3 r3, R4 r4, R5 r5, R6 r6, R7 r7, R8 r8, R9 r9,
>    R10 r10)
>{
>    MemoryBlockReference<T_numtype>::changeBlock(array);
>
>    int setRank = 0;
>
>    TinyVector<int, N_rank2> rankMap;
>
>    slice(setRank, r0, array, rankMap, 0);
>    slice(setRank, r1, array, rankMap, 1);
>    slice(setRank, r2, array, rankMap, 2);
>    slice(setRank, r3, array, rankMap, 3);
>    slice(setRank, r4, array, rankMap, 4);
>    slice(setRank, r5, array, rankMap, 5);
>    slice(setRank, r6, array, rankMap, 6);
>    slice(setRank, r7, array, rankMap, 7);
>    slice(setRank, r8, array, rankMap, 8);
>    slice(setRank, r9, array, rankMap, 9);
>    slice(setRank, r10, array, rankMap, 10);
>
>
>
>    int j = 0;
>    for (int i=0; i < N_rank2; ++i)
>    {
>        if (rankMap[array.ordering(i)] != -1)
>            storage_.setOrdering(j++, rankMap[array.ordering(i)]);
>    }
>
>    calculateZeroOffset();
>}
>
>
>
>
>
>
>
>template<typename P_numtype, int N_rank> template<int N_rank2>
>void Array<P_numtype, N_rank>::slice(int& setRank, Range r,
>    Array<T_numtype,N_rank2>& array, TinyVector<int,N_rank2>& rankMap,
>    int sourceRank)
>{
># 267 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slicing.cc"
>    rankMap[sourceRank] = setRank;
>    length_[setRank] = array.length(sourceRank);
>    stride_[setRank] = array.stride(sourceRank);
>    storage_.setAscendingFlag(setRank, array.isRankStoredAscending(sourceRank));
>    storage_.setBase(setRank, array.base(sourceRank));
>    slice(setRank, r);
>    ++setRank;
>}
>
>
>
>
>
>
>
>template<typename P_numtype, int N_rank> template<int N_rank2>
>void Array<P_numtype, N_rank>::slice(int&, int i,
>    Array<T_numtype,N_rank2>& array, TinyVector<int,N_rank2>& rankMap,
>    int sourceRank)
>{
>
>
>
>
>
>
>    ;
>
>
>
>
>    rankMap[sourceRank] = -1;
>    data_ += i * array.stride(sourceRank);
>
>
>
>}
># 312 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slicing.cc"
>template<typename P_numtype, int N_rank>
>void Array<P_numtype, N_rank>::slice(int rank, Range r)
>{
>    ;
>
>    int first = r.first(lbound(rank));
>    int last = r.last(ubound(rank));
>    int stride = r.stride();
>
>
>
>
>
>
>
>    ;
># 341 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/slicing.cc"
>    length_[rank] = (last - first) / stride + 1;
>
>
>    int offset = (first - base(rank) * stride) * stride_[rank];
>
>    data_ += offset;
>    zeroOffset_ += offset;
>
>    stride_[rank] *= stride;
>
>    if (stride<0)
>        storage_.setAscendingFlag(rank, !isRankStoredAscending(rank));
>}
>
>}
># 2520 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/cycle.cc" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/cycle.cc"
>namespace blitz {
>
>template<typename T_numtype, int N_rank>
>void cycleArrays(Array<T_numtype, N_rank>& a, Array<T_numtype, N_rank>& b)
>{
>    Array<T_numtype, N_rank> tmp(a);
>    a.reference(b);
>    b.reference(tmp);
>}
>
>template<typename T_numtype, int N_rank>
>void cycleArrays(Array<T_numtype, N_rank>& a, Array<T_numtype, N_rank>& b,
>    Array<T_numtype, N_rank>& c)
>{
>    Array<T_numtype, N_rank> tmp(a);
>    a.reference(b);
>    b.reference(c);
>    c.reference(tmp);
>}
>
>template<typename T_numtype, int N_rank>
>void cycleArrays(Array<T_numtype, N_rank>& a, Array<T_numtype, N_rank>& b,
>    Array<T_numtype, N_rank>& c, Array<T_numtype, N_rank>& d)
>{
>    Array<T_numtype, N_rank> tmp(a);
>    a.reference(b);
>    b.reference(c);
>    c.reference(d);
>    d.reference(tmp);
>}
>
>template<typename T_numtype, int N_rank>
>void cycleArrays(Array<T_numtype, N_rank>& a, Array<T_numtype, N_rank>& b,
>    Array<T_numtype, N_rank>& c, Array<T_numtype, N_rank>& d,
>    Array<T_numtype, N_rank>& e)
>{
>    Array<T_numtype, N_rank> tmp(a);
>    a.reference(b);
>    b.reference(c);
>    c.reference(d);
>    d.reference(e);
>    e.reference(tmp);
>}
>
>}
># 2521 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/complex.cc" 1
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/complex.cc"
>namespace blitz {
>
>
>
>template<typename T_numtype, int N_rank>
>inline Array<T_numtype, N_rank> real(const Array<complex<T_numtype>,N_rank>& A)
>{
>    return A.extractComponent(T_numtype(), 0, 2);
>}
>
>template<typename T_numtype, int N_rank>
>inline Array<T_numtype, N_rank> imag(const Array<complex<T_numtype>,N_rank>& A)
>{
>    return A.extractComponent(T_numtype(), 1, 2);
>}
>
>
>
>
>}
># 2522 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/zip.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/zip.h"
>namespace blitz {
>
>template<typename P_component, typename T1, typename T2>
>struct Zip2 {
>    typedef P_component T_numtype;
>
>    static inline T_numtype apply(T1 a, T2 b)
>    { return T_numtype(a,b); }
>
>    template<typename T_left, typename T_right>
>    static inline void prettyPrint(std::string &str,
>        prettyPrintFormat& format, const T_left& t1,
>        const T_right& t2)
>    {
>        str += "zip(";
>        t1.prettyPrint(str, format);
>        str += ",";
>        t2.prettyPrint(str, format);
>        str += ")";
>    }
>};
>
>template<typename T_component, typename T1, typename T2>
>inline _bz_ArrayExpr<_bz_ArrayExprBinaryOp<
>    typename asExpr<T1>::T_expr,
>    typename asExpr<T2>::T_expr,
>    Zip2<T_component,
>         typename asExpr<T1>::T_expr::T_numtype,
>         typename asExpr<T2>::T_expr::T_numtype> > >
>zip(const T1& a, const T2& b, T_component)
>{
>    return _bz_ArrayExpr<_bz_ArrayExprBinaryOp<
>        typename asExpr<T1>::T_expr,
>        typename asExpr<T2>::T_expr,
>        Zip2<T_component,
>             typename asExpr<T1>::T_expr::T_numtype,
>             typename asExpr<T2>::T_expr::T_numtype> > >(a,b);
>}
>
>}
># 2523 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/where.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/where.h"
>namespace blitz {
>
>template<typename P_expr1, typename P_expr2, typename P_expr3>
>class _bz_ArrayWhere {
>
>public:
>    typedef P_expr1 T_expr1;
>    typedef P_expr2 T_expr2;
>    typedef P_expr3 T_expr3;
>    typedef typename T_expr2::T_numtype T_numtype2;
>    typedef typename T_expr3::T_numtype T_numtype3;
>    typedef typename blitz::promote_trait<T_numtype2,T_numtype3>::T_promote T_numtype;
>    typedef T_expr1 T_ctorArg1;
>    typedef T_expr2 T_ctorArg2;
>    typedef T_expr3 T_ctorArg3;
>
>    static const int
>        numArrayOperands = P_expr1::numArrayOperands
>                         + P_expr2::numArrayOperands
>                         + P_expr3::numArrayOperands,
>        numIndexPlaceholders = P_expr1::numIndexPlaceholders
>                             + P_expr2::numIndexPlaceholders
>                             + P_expr3::numIndexPlaceholders,
>        rank = _bz_meta_max<_bz_meta_max<P_expr1::rank,P_expr2::rank>::max,
>                            P_expr3::rank>::max;
>
>    _bz_ArrayWhere(const _bz_ArrayWhere<T_expr1,T_expr2,T_expr3>& a)
>      : iter1_(a.iter1_), iter2_(a.iter2_), iter3_(a.iter3_)
>    { }
>
>    template<typename T1, typename T2, typename T3>
>    _bz_ArrayWhere(const T1& a, const T2& b, const T3& c)
>      : iter1_(a), iter2_(b), iter3_(c)
>    { }
>
>    T_numtype operator*()
>    { return (*iter1_) ? (*iter2_) : (*iter3_); }
>
>    template<int N_rank>
>    T_numtype operator()(const TinyVector<int, N_rank>& i)
>    { return iter1_(i) ? iter2_(i) : iter3_(i); }
>
>    int ascending(int rank)
>    {
>        return bounds::compute_ascending(rank, bounds::compute_ascending(
>          rank, iter1_.ascending(rank), iter2_.ascending(rank)),
>          iter3_.ascending(rank));
>    }
>
>    int ordering(int rank)
>    {
>        return bounds::compute_ordering(rank, bounds::compute_ordering(
>          rank, iter1_.ordering(rank), iter2_.ordering(rank)),
>          iter3_.ordering(rank));
>    }
>
>    int lbound(int rank)
>    {
>        return bounds::compute_lbound(rank, bounds::compute_lbound(
>          rank, iter1_.lbound(rank), iter2_.lbound(rank)),
>          iter3_.lbound(rank));
>    }
>
>    int ubound(int rank)
>    {
>        return bounds::compute_ubound(rank, bounds::compute_ubound(
>          rank, iter1_.ubound(rank), iter2_.ubound(rank)),
>          iter3_.ubound(rank));
>    }
>
>    void push(int position)
>    {
>        iter1_.push(position);
>        iter2_.push(position);
>        iter3_.push(position);
>    }
>
>    void pop(int position)
>    {
>        iter1_.pop(position);
>        iter2_.pop(position);
>        iter3_.pop(position);
>    }
>
>    void advance()
>    {
>        iter1_.advance();
>        iter2_.advance();
>        iter3_.advance();
>    }
>
>    void advance(int n)
>    {
>        iter1_.advance(n);
>        iter2_.advance(n);
>        iter3_.advance(n);
>    }
>
>    void loadStride(int rank)
>    {
>        iter1_.loadStride(rank);
>        iter2_.loadStride(rank);
>        iter3_.loadStride(rank);
>    }
>
>    bool isUnitStride(int rank) const
>    {
>        return iter1_.isUnitStride(rank)
>            && iter2_.isUnitStride(rank)
>            && iter3_.isUnitStride(rank);
>    }
>
>    void advanceUnitStride()
>    {
>        iter1_.advanceUnitStride();
>        iter2_.advanceUnitStride();
>        iter3_.advanceUnitStride();
>    }
>
>    bool canCollapse(int outerLoopRank, int innerLoopRank) const
>    {
>        return iter1_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter2_.canCollapse(outerLoopRank, innerLoopRank)
>            && iter3_.canCollapse(outerLoopRank, innerLoopRank);
>    }
>
>    template<int N_rank>
>    void moveTo(const TinyVector<int,N_rank>& i)
>    {
>        iter1_.moveTo(i);
>        iter2_.moveTo(i);
>        iter3_.moveTo(i);
>    }
>
>    T_numtype operator[](int i)
>    { return iter1_[i] ? iter2_[i] : iter3_[i]; }
>
>    T_numtype fastRead(int i)
>    { return iter1_.fastRead(i) ? iter2_.fastRead(i) : iter3_.fastRead(i); }
>
>    int suggestStride(int rank) const
>    {
>        int stride1 = iter1_.suggestStride(rank);
>        int stride2 = iter2_.suggestStride(rank);
>        int stride3 = iter3_.suggestStride(rank);
>        return stride1>(stride2=(stride2>stride3?stride2:stride3))?stride1:stride2;
>
>    }
>
>    bool isStride(int rank, int stride) const
>    {
>        return iter1_.isStride(rank,stride)
>            && iter2_.isStride(rank,stride)
>            && iter3_.isStride(rank,stride);
>    }
>
>    void prettyPrint(std::string &str,
>        prettyPrintFormat& format) const
>    {
>        str += "where(";
>        iter1_.prettyPrint(str,format);
>        str += ",";
>        iter2_.prettyPrint(str,format);
>        str += ",";
>        iter3_.prettyPrint(str,format);
>        str += ")";
>    }
>
>    template<typename T_shape>
>    bool shapeCheck(const T_shape& shape)
>    {
>        int t1 = iter1_.shapeCheck(shape);
>        int t2 = iter2_.shapeCheck(shape);
>        int t3 = iter3_.shapeCheck(shape);
>
>        return t1 && t2 && t3;
>    }
>
>private:
>    _bz_ArrayWhere() { }
>
>    T_expr1 iter1_;
>    T_expr2 iter2_;
>    T_expr3 iter3_;
>};
>
>template<typename T1, typename T2, typename T3>
>inline
>_bz_ArrayExpr<_bz_ArrayWhere<typename asExpr<T1>::T_expr,
>    typename asExpr<T2>::T_expr, typename asExpr<T3>::T_expr> >
>where(const T1& a, const T2& b, const T3& c)
>{
>    return _bz_ArrayExpr<_bz_ArrayWhere<typename asExpr<T1>::T_expr,
>       typename asExpr<T2>::T_expr,
>       typename asExpr<T3>::T_expr> >(a,b,c);
>}
>
>}
># 2524 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h" 1
># 28 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/cartesian.h" 1
># 26 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/cartesian.h"
>namespace blitz {
>
>
>
>
>
>
>
>template<typename T_tuple, typename T_container, int N_containers>
>class CartesianProductIterator;
>
>struct _cp_end_tag { };
>
>template<typename T_tuple, typename T_container, int N_containers>
>class CartesianProduct {
>public:
>    typedef T_tuple value_type;
>    typedef T_tuple& reference;
>    typedef const T_tuple& const_reference;
>    typedef CartesianProductIterator<T_tuple,T_container,N_containers> iterator;
>    typedef int difference_type;
>    typedef int size_type;
>
>    iterator begin()
>    { return iterator(*this); }
>
>    iterator end()
>    { return iterator(_cp_end_tag()); }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4,
>        const T_container& container5)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>        containers_[5] = &container5;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4,
>        const T_container& container5,
>        const T_container& container6)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>        containers_[5] = &container5;
>        containers_[6] = &container6;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4,
>        const T_container& container5,
>        const T_container& container6,
>        const T_container& container7)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>        containers_[5] = &container5;
>        containers_[6] = &container6;
>        containers_[7] = &container7;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4,
>        const T_container& container5,
>        const T_container& container6,
>        const T_container& container7,
>        const T_container& container8)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>        containers_[5] = &container5;
>        containers_[6] = &container6;
>        containers_[7] = &container7;
>        containers_[8] = &container8;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4,
>        const T_container& container5,
>        const T_container& container6,
>        const T_container& container7,
>        const T_container& container8,
>        const T_container& container9)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>        containers_[5] = &container5;
>        containers_[6] = &container6;
>        containers_[7] = &container7;
>        containers_[8] = &container8;
>        containers_[9] = &container9;
>    }
>
>    CartesianProduct(const T_container& container0,
>        const T_container& container1,
>        const T_container& container2,
>        const T_container& container3,
>        const T_container& container4,
>        const T_container& container5,
>        const T_container& container6,
>        const T_container& container7,
>        const T_container& container8,
>        const T_container& container9,
>        const T_container& container10)
>    {
>        ;
>        containers_[0] = &container0;
>        containers_[1] = &container1;
>        containers_[2] = &container2;
>        containers_[3] = &container3;
>        containers_[4] = &container4;
>        containers_[5] = &container5;
>        containers_[6] = &container6;
>        containers_[7] = &container7;
>        containers_[8] = &container8;
>        containers_[9] = &container9;
>        containers_[10] = &container10;
>    }
>
>    const T_container& operator[](int i)
>    { return *(containers_[i]); }
>
>    void debugDump();
>
>protected:
>    const T_container* containers_[N_containers];
>};
>
>template<typename T_tuple, typename T_container, int N_containers>
>void CartesianProduct<T_tuple,T_container,N_containers>::debugDump()
>{
>    cout << "Dump of CartesianProduct<..,..," << N_containers << ">" << endl;
>    for (int i=0; i < N_containers; ++i)
>    {
>        cout << "Container " << (i+1) << ": ";
>        typename T_container::const_iterator iter = containers_[i]->begin(),
>            end = containers_[i]->end();
>        for (; iter != end; ++iter)
>            cout << (*iter) << '\t';
>    }
>}
>
>template<typename T_tuple, typename T_container, int N_containers>
>class CartesianProductIterator {
>public:
>    typedef typename T_container::const_iterator citerator;
>    typedef CartesianProductIterator<T_tuple,T_container,N_containers> iterator;
>    typedef CartesianProduct<T_tuple,T_container,N_containers> T_cp;
>
>    CartesianProductIterator(T_cp& container)
>    {
>        for (int i=0; i < N_containers; ++i)
>        {
>            firstiters_[i] = container[i].begin();
>            iters_[i] = firstiters_[i];
>            enditers_[i] = container[i].end();
>            tuple_[i] = *iters_[i];
>        }
>
>        endflag_ = false;
>    }
>
>    void operator++();
>
>    CartesianProductIterator(_cp_end_tag)
>    {
>        endflag_ = true;
>    }
>
>    bool operator==(const iterator& x) const
>    {
>        return (endflag_ == x.endflag_);
>    }
>
>    bool operator!=(const iterator& x) const
>    {
>        return endflag_ != x.endflag_;
>    }
>
>    const T_tuple& operator*() const
>    { return tuple_; }
>
>protected:
>    citerator iters_[N_containers];
>    citerator firstiters_[N_containers];
>    citerator enditers_[N_containers];
>    T_tuple tuple_;
>    bool endflag_;
>};
>
>template<typename T_tuple, typename T_container, int N_containers>
>void CartesianProductIterator<T_tuple, T_container,
>    N_containers>::operator++()
>{
>
>    const int Nminus1 = N_containers - 1;
>
>    int i = Nminus1;
>
>
>
>
>    if((++iters_[i]) != enditers_[i])
>    {
>        tuple_[i] = *iters_[i];
>        return;
>    }
>
>
>
>    for (--i; i >= 0; --i)
>    {
>        ++iters_[i];
>        if (iters_[i] != enditers_[i])
>            break;
>    }
>
>    if (i == -1)
>    {
>        endflag_ = true;
>        return;
>    }
>
>    tuple_[i] = *iters_[i];
>
>    for (++i; i < N_containers; ++i)
>    {
>        iters_[i] = firstiters_[i];
>        tuple_[i] = *iters_[i];
>    }
>}
>
>}
># 29 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h" 2
>
>namespace blitz {
>
>template<typename T_array, typename T_index>
>class IndirectArray {
>
>public:
>    IndirectArray(T_array& array, T_index& index)
>        : array_(array), index_(index)
>    { }
>
>    template<typename T_expr>
>    void operator=(T_expr expr);
>
>protected:
>    T_array& array_;
>    T_index& index_;
>};
>
>
>template<typename T_array, typename T_arrayiter, typename T_subdomain, typename T_expr>
>inline void applyOverSubdomain(const T_array& array, T_arrayiter& arrayIter,
>    T_subdomain subdomain, T_expr expr);
>template<typename T_array, typename T_arrayiter, int N_rank, typename T_expr>
>inline void applyOverSubdomain(const T_array& array, T_arrayiter& arrayIter,
>    RectDomain<N_rank> subdomain,
>    T_expr expr);
>
>template<typename T_array, typename T_index> template<typename T_rhs>
>void IndirectArray<T_array, T_index>::operator=(T_rhs rhs)
>{
>    typedef typename asExpr<T_rhs>::T_expr T_expr;
>    T_expr expr(rhs);
>
>    typename T_array::T_iterator arrayIter(array_);
>
>    typename T_index::iterator iter = index_.begin(),
>                       end = index_.end();
>
>    for (; iter != end; ++iter)
>    {
>        typename T_index::value_type subdomain = *iter;
>        applyOverSubdomain(array_, arrayIter, subdomain, expr);
>    }
>}
>
>template<typename T_array, typename T_arrayiter, typename T_subdomain, typename T_expr>
>inline void applyOverSubdomain(const T_array& , T_arrayiter& arrayIter,
>    T_subdomain subdomain, T_expr expr)
>{
>   
>
>
>
>
>
>
>    arrayIter.moveTo(subdomain);
>    expr.moveTo(subdomain);
>
>    *const_cast<typename T_arrayiter::T_numtype*>(arrayIter.data()) = *expr;
>}
>
>
>template<typename T_array, typename T_arrayiter, int N_rank, typename T_expr>
>inline void applyOverSubdomain(const T_array& , T_arrayiter& arrayIter,
>    RectDomain<N_rank> subdomain,
>    T_expr expr)
>{
>    typedef typename T_array::T_numtype T_numtype;
>
>
>
>
>
>
>    static int stripDim = 0;
>
>    if (subdomain.lbound(stripDim) == subdomain.ubound(stripDim))
>    {
>
>        for (stripDim=0; stripDim < N_rank; ++stripDim)
>          if (subdomain.lbound(stripDim) != subdomain.ubound(stripDim))
>            break;
>
>
>        if (stripDim == N_rank)
>            stripDim = 0;
>    }
># 131 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h"
>   
>
>
>
>
>
>
>
>   
># 148 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h"
>    arrayIter.moveTo(subdomain.lbound());
>    expr.moveTo(subdomain.lbound());
>
>
>
>
>
>    bool useUnitStride = arrayIter.isUnitStride(stripDim)
>          && expr.isUnitStride(stripDim);
>
>    int lbound = subdomain.lbound(stripDim);
>    int ubound = subdomain.ubound(stripDim);
>
>    if (useUnitStride)
>    {
>        T_numtype* __restrict__ data = const_cast<T_numtype*>(arrayIter.data());
>
>        int length = ubound - lbound + 1;
>        for (int i=0; i < length; ++i)
>            *data++ = expr.fastRead(i);
>    }
>    else {
>
>
>    arrayIter.loadStride(stripDim);
>    expr.loadStride(stripDim);
>
>    for (int i=lbound; i <= ubound; ++i)
>    {
>        *const_cast<typename T_arrayiter::T_numtype*>(arrayIter.data())
>            = *expr;
>        expr.advance();
>        arrayIter.advance();
>    }
>
>
>    }
>
>}
>
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,2>,T_container,2>
>indexSet(const T_container& container0, const T_container& container1)
>{
>    return CartesianProduct<TinyVector<int,2>,T_container,2>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,3>,T_container,3>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2)
>{
>    return CartesianProduct<TinyVector<int,3>,T_container,3>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,4>,T_container,4>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3)
>{
>    return CartesianProduct<TinyVector<int,4>,T_container,4>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,5>,T_container,5>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4)
>{
>    return CartesianProduct<TinyVector<int,5>,T_container,5>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,6>,T_container,6>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4, const T_container& container5)
>{
>    return CartesianProduct<TinyVector<int,6>,T_container,6>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4),
>        const_cast<T_container&>(container5));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,7>,T_container,7>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4, const T_container& container5,
>    const T_container& container6)
>{
>    return CartesianProduct<TinyVector<int,7>,T_container,7>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4),
>        const_cast<T_container&>(container5),
>        const_cast<T_container&>(container6));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,8>,T_container,8>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4, const T_container& container5,
>    const T_container& container6, const T_container& container7)
>{
>    return CartesianProduct<TinyVector<int,8>,T_container,8>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4),
>        const_cast<T_container&>(container5),
>        const_cast<T_container&>(container6),
>        const_cast<T_container&>(container7));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,9>,T_container,9>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4, const T_container& container5,
>    const T_container& container6, const T_container& container7,
>    const T_container& container8)
>{
>    return CartesianProduct<TinyVector<int,9>,T_container,9>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4),
>        const_cast<T_container&>(container5),
>        const_cast<T_container&>(container6),
>        const_cast<T_container&>(container7),
>        const_cast<T_container&>(container8));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,10>,T_container,10>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4, const T_container& container5,
>    const T_container& container6, const T_container& container7,
>    const T_container& container8, const T_container& container9)
>{
>    return CartesianProduct<TinyVector<int,10>,T_container,10>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4),
>        const_cast<T_container&>(container5),
>        const_cast<T_container&>(container6),
>        const_cast<T_container&>(container7),
>        const_cast<T_container&>(container8),
>        const_cast<T_container&>(container9));
>}
>
>template<typename T_container>
>CartesianProduct<TinyVector<int,11>,T_container,11>
>indexSet(const T_container& container0, const T_container& container1,
>    const T_container& container2, const T_container& container3,
>    const T_container& container4, const T_container& container5,
>    const T_container& container6, const T_container& container7,
>    const T_container& container8, const T_container& container9,
>    const T_container& container10)
>{
>    return CartesianProduct<TinyVector<int,11>,T_container,11>(
>        const_cast<T_container&>(container0),
>        const_cast<T_container&>(container1),
>        const_cast<T_container&>(container2),
>        const_cast<T_container&>(container3),
>        const_cast<T_container&>(container4),
>        const_cast<T_container&>(container5),
>        const_cast<T_container&>(container6),
>        const_cast<T_container&>(container7),
>        const_cast<T_container&>(container8),
>        const_cast<T_container&>(container9),
>        const_cast<T_container&>(container10));
>}
># 360 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h"
>template<typename T1, typename T2, typename T3=int, typename T4=int,
>         typename T5=int, typename T6=int, typename T7=int, typename T8=int,
>         typename T9=int, typename T10=int, typename T11=int>
>struct cp_findContainerType {
>    typedef T1 T_container;
>};
>
>template<typename T2, typename T3, typename T4, typename T5, typename T6,
>         typename T7, typename T8, typename T9, typename T10, typename T11>
>struct cp_findContainerType<int,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11> {
>    typedef typename
>        cp_findContainerType<T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_container
>        T_container;
>};
># 385 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/indirect.h"
>template<typename T, typename T2>
>struct cp_traits {
>    typedef T T_container;
>
>    static const T_container& make(const T& x)
>    { return x; }
>};
>
>template<typename T2>
>struct cp_traits<int,T2> {
>    typedef T2 T_container;
>
>    static T2 make(int x)
>    {
>        T2 singleton;
>        singleton.push_back(x);
>        return singleton;
>    }
>};
>
>
>
>
>
>template<typename T1, typename T2>
>CartesianProduct<TinyVector<int,2>, typename
>    cp_findContainerType<T1,T2>::T_container,2>
>indexSet(const T1& c1, const T2& c2)
>{
>    typedef typename cp_findContainerType<T1,T2>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,2>, T_container, 2>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2));
>}
>
>template<typename T1, typename T2, typename T3>
>CartesianProduct<TinyVector<int,3>, typename
>    cp_findContainerType<T1,T2,T3>::T_container, 3>
>indexSet(const T1& c1, const T2& c2, const T3& c3)
>{
>    typedef typename cp_findContainerType<T1,T2,T3>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,3>, T_container, 3>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3));
>}
>
>template<typename T1, typename T2, typename T3, typename T4>
>CartesianProduct<TinyVector<int,4>, typename
>    cp_findContainerType<T1,T2,T3,T4>::T_container, 4>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4)
>{
>    typedef typename cp_findContainerType<T1,T2,T3,T4>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,4>, T_container, 4>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5>
>CartesianProduct<TinyVector<int,5>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5>::T_container, 5>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5)
>{
>    typedef typename cp_findContainerType<T1,T2,T3,T4,T5>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,5>, T_container, 5>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5,
>         typename T6>
>CartesianProduct<TinyVector<int,6>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5,T6>::T_container, 6>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5,
>    const T6& c6)
>{
>    typedef typename cp_findContainerType<T1,T2,T3,T4,T5,T6>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,6>, T_container, 6>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5),
>          cp_traits<T6,T_container>::make(c6));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5,
>         typename T6, typename T7>
>CartesianProduct<TinyVector<int,7>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5,T6,T7>::T_container, 7>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5,
>    const T6& c6, const T7& c7)
>{
>    typedef typename
>        cp_findContainerType<T1,T2,T3,T4,T5,T6,T7>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,7>, T_container, 7>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5),
>          cp_traits<T6,T_container>::make(c6),
>          cp_traits<T7,T_container>::make(c7));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5,
>         typename T6, typename T7, typename T8>
>CartesianProduct<TinyVector<int,8>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8>::T_container, 8>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5,
>    const T6& c6, const T7& c7, const T8& c8)
>{
>    typedef typename
>        cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,8>, T_container, 8>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5),
>          cp_traits<T6,T_container>::make(c6),
>          cp_traits<T7,T_container>::make(c7),
>          cp_traits<T8,T_container>::make(c8));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5,
>         typename T6, typename T7, typename T8, typename T9>
>CartesianProduct<TinyVector<int,9>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9>::T_container, 9>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5,
>    const T6& c6, const T7& c7, const T8& c8, const T9& c9)
>{
>    typedef typename
>        cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,9>, T_container, 9>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5),
>          cp_traits<T6,T_container>::make(c6),
>          cp_traits<T7,T_container>::make(c7),
>          cp_traits<T8,T_container>::make(c8),
>          cp_traits<T9,T_container>::make(c9));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5,
>         typename T6, typename T7, typename T8, typename T9, typename T10>
>CartesianProduct<TinyVector<int,10>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::T_container, 10>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5,
>    const T6& c6, const T7& c7, const T8& c8, const T9& c9, const T10& c10)
>{
>    typedef typename
>        cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,10>, T_container, 10>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5),
>          cp_traits<T6,T_container>::make(c6),
>          cp_traits<T7,T_container>::make(c7),
>          cp_traits<T8,T_container>::make(c8),
>          cp_traits<T9,T_container>::make(c9),
>          cp_traits<T10,T_container>::make(c10));
>}
>
>template<typename T1, typename T2, typename T3, typename T4, typename T5,
>         typename T6, typename T7, typename T8, typename T9, typename T10,
>         typename T11>
>CartesianProduct<TinyVector<int,11>, typename
>    cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_container, 11>
>indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5,
>    const T6& c6, const T7& c7, const T8& c8, const T9& c9, const T10& c10,
>    const T11& c11)
>{
>    typedef typename
>        cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_container
>        T_container;
>
>    return CartesianProduct<TinyVector<int,11>, T_container, 11>(
>          cp_traits<T1,T_container>::make(c1),
>          cp_traits<T2,T_container>::make(c2),
>          cp_traits<T3,T_container>::make(c3),
>          cp_traits<T4,T_container>::make(c4),
>          cp_traits<T5,T_container>::make(c5),
>          cp_traits<T6,T_container>::make(c6),
>          cp_traits<T7,T_container>::make(c7),
>          cp_traits<T8,T_container>::make(c8),
>          cp_traits<T9,T_container>::make(c9),
>          cp_traits<T10,T_container>::make(c10),
>          cp_traits<T11,T_container>::make(c11));
>}
>
>}
># 2525 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h" 1
># 35 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/geometry.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/geometry.h"
>namespace blitz {
>
>typedef double T_defaultSpatialCoordinate;
>
>template<int N_dim, typename T = T_defaultSpatialCoordinate>
>class UniformOrthoGeometry {
>public:
>};
>
>template<int N_dim, typename T = T_defaultSpatialCoordinate>
>class UniformCubicGeometry {
>    T h_;
>    T recip_h_;
>    T recip2_h_;
>    T recip3_h_;
>    TinyVector<T,N_dim> zero_;
>
>public:
>    typedef T T_coord;
>
>    UniformCubicGeometry()
>    {
>        h_ = 0.0;
>        recip_h_ = 0.0;
>        recip2_h_ = 0.0;
>        recip3_h_ = 0.0;
>        zero_ = 0.0;
>    }
>
>    UniformCubicGeometry(T spatialStep)
>    {
>        h_ = spatialStep;
>        zero_ = T(0);
>        setup();
>    }
>
>    UniformCubicGeometry(T spatialStep, TinyVector<T,N_dim> zeroCoordinates)
>    {
>        h_ = spatialStep;
>        zero_ = zeroCoordinates;
>        setup();
>    }
>
>    TinyVector<T,N_dim> toSpatial(TinyVector<int,N_dim> logicalCoord) const
>    {
>        return zero_ + h_ * logicalCoord;
>    }
>
>    T spatialStep() const
>    { return h_; }
>
>    T recipSpatialStep() const
>    { return recip_h_; }
>
>    T recipSpatialStepPow2() const
>    { return recip2_h_; }
>
>private:
>    void setup()
>    {
>        recip_h_ = 1.0 / h_;
>        recip2_h_ = 1.0 / pow2(h_);
>        recip3_h_ = 1.0 / pow3(h_);
>    }
>};
>
>template<int N_dim, typename T = T_defaultSpatialCoordinate>
>class TensorProductGeometry {
>public:
>};
>
>}
># 36 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h" 2
>
>
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h" 1
># 41 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymatexpr.h" 1
># 34 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymatexpr.h"
>namespace blitz {
>
>template<typename T_expr>
>class _bz_tinyMatExpr {
>public:
>    typedef typename T_expr::T_numtype T_numtype;
>
>    static const int
>        rows = T_expr::rows,
>        columns = T_expr::columns;
>
>    _bz_tinyMatExpr(T_expr expr)
>        : expr_(expr)
>    { }
>
>    _bz_tinyMatExpr(const _bz_tinyMatExpr<T_expr>& x)
>        : expr_(x.expr_)
>    { }
>
>    T_numtype operator()(int i, int j) const
>    { return expr_(i,j); }
>
>protected:
>    T_expr expr_;
>};
>
>}
># 42 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/matassign.h" 1
># 31 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/matassign.h"
>namespace blitz {
>
>template<int N_rows, int N_columns, int I, int J>
>class _bz_meta_matAssign2 {
>public:
>    static const int go = (J < N_columns - 1) ? 1 : 0;
>
>    template<typename T_matrix, typename T_expr, typename T_updater>
>    static inline void f(T_matrix& mat, T_expr expr, T_updater u)
>    {
>        u.update(mat(I,J), expr(I,J));
>        _bz_meta_matAssign2<N_rows * go, N_columns * go, I * go, (J+1) * go>
>            ::f(mat, expr, u);
>    }
>};
>
>template<>
>class _bz_meta_matAssign2<0,0,0,0> {
>public:
>    template<typename T_matrix, typename T_expr, typename T_updater>
>    static inline void f(T_matrix&, T_expr, T_updater)
>    { }
>};
>
>template<int N_rows, int N_columns, int I>
>class _bz_meta_matAssign {
>public:
>    static const int go = (I < N_rows-1) ? 1 : 0;
>
>    template<typename T_matrix, typename T_expr, typename T_updater>
>    static inline void f(T_matrix& mat, T_expr expr, T_updater u)
>    {
>        _bz_meta_matAssign2<N_rows, N_columns, I, 0>::f(mat, expr, u);
>        _bz_meta_matAssign<N_rows * go, N_columns * go, (I+1) * go>
>            ::f(mat, expr, u);
>    }
>};
>
>template<>
>class _bz_meta_matAssign<0,0,0> {
>public:
>    template<typename T_matrix, typename T_expr, typename T_updater>
>    static inline void f(T_matrix&, T_expr, T_updater)
>    { }
>};
>
>
>}
># 43 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h" 2
>
>namespace blitz {
>
>
>template<typename T_expr>
>class _bz_tinyMatExpr;
>
>template<typename T_numtype, int N_rows, int N_columns, int N_rowStride,
>    int N_colStride>
>class _bz_tinyMatrixRef {
>
>public:
>    _bz_tinyMatrixRef(T_numtype* __restrict__ const data)
>        : data_(data)
>    { }
>
>    T_numtype * __restrict__ data()
>    { return (T_numtype * __restrict__)data_; }
>
>    T_numtype& __restrict__ operator()(int i, int j)
>    { return data_[i * N_rowStride + j * N_colStride]; }
>
>    T_numtype operator()(int i, int j) const
>    { return data_[i * N_rowStride + j * N_colStride]; }
>
>protected:
>    T_numtype * __restrict__ const data_;
>};
>
>template<typename P_numtype, int N_rows, int N_columns>
>class TinyMatrix {
>
>public:
>    typedef P_numtype T_numtype;
>    typedef _bz_tinyMatrixRef<T_numtype, N_rows, N_columns, N_columns, 1>
>        T_reference;
>    typedef TinyMatrix<T_numtype, N_rows, N_columns> T_matrix;
>
>    TinyMatrix() { }
>
>    T_numtype* __restrict__ data()
>    { return data_; }
>
>    const T_numtype* __restrict__ data() const
>    { return data_; }
>
>    T_numtype* __restrict__ dataFirst()
>    { return data_; }
>
>    const T_numtype* __restrict__ dataFirst() const
>    { return data_; }
>
>
>    T_numtype& __restrict__ operator()(int i, int j)
>    { return data_[i*N_columns + j]; }
>
>    T_numtype operator()(int i, int j) const
>    { return data_[i*N_columns + j]; }
>
>    T_reference getRef()
>    { return T_reference((T_numtype*)data_); }
>
>    const T_reference getRef() const
>    { return T_reference((T_numtype*)data_); }
>
>
>    ListInitializationSwitch<T_matrix,T_numtype*>
>    operator=(T_numtype x)
>    {
>        return ListInitializationSwitch<T_matrix,T_numtype*>(*this, x);
>    }
>
>    template<typename T_expr>
>    TinyMatrix<T_numtype, N_rows, N_columns>&
>    operator=(_bz_tinyMatExpr<T_expr> expr)
>    {
>        _bz_meta_matAssign<N_rows, N_columns, 0>::f(*this, expr,
>            _bz_update<T_numtype, typename T_expr::T_numtype>());
>        return *this;
>    }
>
>    void initialize(T_numtype x)
>    {
>        for (int i=0; i < N_rows; ++i)
>          for (int j=0; j < N_columns; ++j)
>            (*this)(i,j) = x;
>    }
>
>    T_numtype* __restrict__ getInitializationIterator()
>    { return dataFirst(); }
>
>protected:
>    T_numtype data_[N_rows * N_columns];
>};
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/matvec.h" 1
># 42 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/matvec.h"
>namespace blitz {
>
>
>template<int N_rows, int N_columns, int N_rowStride, int N_colStride,
>    int N_vecStride, int J>
>class _bz_meta_matrixVectorProduct2;
>
>
>template<typename T_numtype1, typename T_numtype2, int N_rows, int N_columns,
>    int N_rowStride, int N_colStride, int N_vecStride>
>class _bz_tinyMatrixVectorProduct {
>public:
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype;
>
>    _bz_tinyMatrixVectorProduct(const _bz_tinyMatrixVectorProduct<T_numtype1,
>        T_numtype2, N_rows, N_columns, N_rowStride, N_colStride,
>        N_vecStride>& z)
>            : matrix_(z.matrix_), vector_(z.vector_)
>    { }
>
>    _bz_tinyMatrixVectorProduct(const T_numtype1* matrix,
>        const T_numtype2* vector)
>        : matrix_(matrix), vector_(vector)
>    { }
>
>    T_numtype operator[](unsigned i) const
>    {
>        return _bz_meta_matrixVectorProduct2<N_rows, N_columns, N_rowStride,
>            N_colStride, N_vecStride, 0>::f(matrix_, vector_, i);
>    }
>
>    T_numtype operator()(unsigned i) const
>    {
>        return _bz_meta_matrixVectorProduct2<N_rows, N_columns, N_rowStride,
>            N_colStride, N_vecStride, 0>::f(matrix_, vector_, i);
>    }
>
>    static const int
>        _bz_staticLengthCount = 1,
>        _bz_dynamicLengthCount = 0,
>        _bz_staticLength = N_rows;
>
>
>
>
>
>
>
>    unsigned _bz_suggestLength() const
>    {
>        return N_rows;
>    }
>
>    bool _bz_hasFastAccess() const
>    { return true; }
>
>    T_numtype _bz_fastAccess(unsigned i) const
>    {
>        return _bz_meta_matrixVectorProduct2<N_rows, N_columns, N_rowStride,
>            N_colStride, N_vecStride, 0>::f(matrix_, vector_, i);
>    }
>
>    unsigned length(unsigned recommendedLength) const
>    { return N_rows; }
>
>    const T_numtype1* matrix() const
>    { return matrix_; }
>
>    const T_numtype2* vector() const
>    { return vector_; }
>
>protected:
>    const T_numtype1* matrix_;
>    const T_numtype2* vector_;
>};
>
>template<typename T_numtype1, typename T_numtype2, int N_rows, int N_columns>
>inline _bz_VecExpr<_bz_tinyMatrixVectorProduct<T_numtype1, T_numtype2,
>    N_rows, N_columns, N_columns, 1, 1> >
>product(const TinyMatrix<T_numtype1, N_rows, N_columns>& matrix,
>    const TinyVector<T_numtype2, N_columns>& vector)
>{
>    typedef _bz_tinyMatrixVectorProduct<T_numtype1, T_numtype2, N_rows,
>        N_columns, N_columns, 1, 1> T_expr;
>    return _bz_VecExpr<T_expr>(T_expr(matrix.data(), vector.data()));
>}
>
>
>
>template<int N_rows, int N_columns, int N_rowStride, int N_colStride,
>    int N_vecStride, int J>
>class _bz_meta_matrixVectorProduct2 {
>
>public:
>    static const int go = J < (N_columns-1) ? 1 : 0;
>
>    template<typename T_numtype1, typename T_numtype2>
>    static inline typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote
>    f(const T_numtype1* matrix, const T_numtype2* vector, int i)
>    {
>        return matrix[i * N_rowStride + J * N_colStride]
>            * vector[J * N_vecStride]
>
>            + _bz_meta_matrixVectorProduct2<N_rows * go, N_columns * go,
>                N_rowStride * go, N_colStride * go, N_vecStride * go, (J+1)*go>
>                ::f(matrix, vector, i);
>    }
>
>};
>
>template<>
>class _bz_meta_matrixVectorProduct2<0,0,0,0,0,0> {
>public:
>    static inline _bz_meta_nullOperand f(const void*, const void*, int)
>    { return _bz_meta_nullOperand(); }
>};
>
>template<int N_rows, int N_columns, int N_rowStride, int N_colStride,
>    int N_vecStride, int I>
>class _bz_meta_matrixVectorProduct {
>public:
>    static const int go = I < (N_rows - 1) ? 1 : 0;
>
>    template<typename T_numtype1, typename T_numtype2, typename T_numtype3>
>    static inline void f(TinyVector<T_numtype3, N_rows>& result,
>        const T_numtype1* matrix, const T_numtype2* vector)
>    {
>        result[I] = _bz_meta_matrixVectorProduct2<N_rows, N_columns,
>            N_rowStride, N_colStride, N_vecStride, 0>::f(matrix,vector, I);
>
>        _bz_meta_matrixVectorProduct<N_rows * go, N_columns * go,
>            N_rowStride * go, N_colStride * go, N_vecStride * go, (I+1)*go>
>              ::f(result, matrix, vector);
>    }
>};
>
>template<>
>class _bz_meta_matrixVectorProduct<0,0,0,0,0,0> {
>public:
>    static inline void f(const _bz_tinyBase&, const void*, const void*)
>    { }
>};
>
>}
># 141 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/matmat.h" 1
># 37 "/mn/anatu/cma-u3/tmac/usr/include/blitz/meta/matmat.h"
>namespace blitz {
>
>
>template<int N_rows1, int N_columns, int N_columns2, int N_rowStride1,
>    int N_colStride1, int N_rowStride2, int N_colStride2, int K>
>class _bz_meta_matrixMatrixProduct {
>public:
>    static const int go = (K != N_columns - 1) ? 1 : 0;
>
>    template<typename T_numtype1, typename T_numtype2>
>    static inline typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote
>    f(const T_numtype1* matrix1, const T_numtype2* matrix2, int i, int j)
>    {
>        return matrix1[i * N_rowStride1 + K * N_colStride1]
>            * matrix2[K * N_rowStride2 + j * N_colStride2]
>            + _bz_meta_matrixMatrixProduct<N_rows1 * go, N_columns * go,
>                N_columns2 * go, N_rowStride1 * go, N_colStride1 * go,
>                N_rowStride2 * go, N_colStride2 * go, (K+1) * go>
>              ::f(matrix1, matrix2, i, j);
>    }
>};
>
>template<>
>class _bz_meta_matrixMatrixProduct<0,0,0,0,0,0,0,0> {
>public:
>    static inline _bz_meta_nullOperand f(const void*, const void*, int, int)
>    { return _bz_meta_nullOperand(); }
>};
>
>
>
>
>template<typename T_numtype1, typename T_numtype2, int N_rows1, int N_columns,
>    int N_columns2, int N_rowStride1, int N_colStride1,
>    int N_rowStride2, int N_colStride2>
>class _bz_tinyMatrixMatrixProduct {
>public:
>    typedef typename blitz::promote_trait<T_numtype1,T_numtype2>::T_promote T_numtype;
>
>    static const int rows = N_rows1, columns = N_columns2;
>
>    _bz_tinyMatrixMatrixProduct(const T_numtype1* matrix1,
>        const T_numtype2* matrix2)
>        : matrix1_(matrix1), matrix2_(matrix2)
>    { }
>
>    _bz_tinyMatrixMatrixProduct(const _bz_tinyMatrixMatrixProduct<T_numtype1,
>        T_numtype2, N_rows1, N_columns, N_columns2, N_rowStride1, N_colStride1,
>        N_rowStride2, N_colStride2>& x)
>        : matrix1_(x.matrix1_), matrix2_(x.matrix2_)
>    { }
>
>    const T_numtype1* matrix1() const
>    { return matrix1_; }
>
>    const T_numtype2* matrix2() const
>    { return matrix2_; }
>
>    T_numtype operator()(int i, int j) const
>    {
>        return _bz_meta_matrixMatrixProduct<N_rows1, N_columns,
>            N_columns2, N_rowStride1, N_colStride1, N_rowStride2,
>            N_colStride2, 0>::f(matrix1_, matrix2_, i, j);
>    }
>
>protected:
>    const T_numtype1* matrix1_;
>    const T_numtype2* matrix2_;
>};
>
>template<typename T_numtype1, typename T_numtype2, int N_rows1, int N_columns1,
>    int N_columns2>
>inline
>_bz_tinyMatExpr<_bz_tinyMatrixMatrixProduct<T_numtype1, T_numtype2, N_rows1,
>    N_columns1, N_columns2, N_columns1, 1, N_columns2, 1> >
>product(const TinyMatrix<T_numtype1, N_rows1, N_columns1>& a,
>    const TinyMatrix<T_numtype2, N_columns1, N_columns2>& b)
>{
>    typedef _bz_tinyMatrixMatrixProduct<T_numtype1, T_numtype2,
>        N_rows1, N_columns1, N_columns2, N_columns1, 1, N_columns2, 1> T_expr;
>    return _bz_tinyMatExpr<T_expr>(T_expr(a.data(), b.data()));
>}
>
>}
># 142 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymatio.cc" 1
># 15 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymatio.cc"
>namespace blitz {
>
>template <typename P_numtype, int N_rows, int N_columns>
>ostream& operator<<(ostream& os,
>    const TinyMatrix<P_numtype, N_rows, N_columns>& x)
>{
>    os << "(" << N_rows << "," << N_columns << "): " << endl;
>    for (int i=0; i < N_rows; ++i)
>    {
>        os << " [ ";
>        for (int j=0; j < N_columns; ++j)
>        {
>            os << setw(10) << x(i,j);
>            if (!((j+1)%7))
>                os << endl << "  ";
>        }
>        os << " ]" << endl;
>    }
>    return os;
>}
>
>template <typename P_numtype, int N_rows, int N_columns>
>istream& operator>>(istream& is,
>    TinyMatrix<P_numtype, N_rows, N_columns>& x)
>{
>    int rows, columns;
>    char sep;
>
>    is >> rows >> columns;
>
>    ;
>    ;
>
>    for (int i=0; i < N_rows; ++i)
>    {
>        is >> sep;
>        ;
>
>        for (int j = 0; j < N_columns; ++j)
>        {
>            ;
>            is >> x(i,j);
>        }
>        is >> sep;
>        ;
>
>    }
>
>    return is;
>}
>
>}
># 143 "/mn/anatu/cma-u3/tmac/usr/include/blitz/tinymat.h" 2
># 40 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h" 2
>
>
>namespace blitz {
># 62 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h"
>const double recip_2 = .500000000000000000000000000000000000000000000;
>const double recip_4 = .250000000000000000000000000000000000000000000;
>const double recip_6 = .166666666666666666666666666666666666666666667;
>const double recip_8 = .125000000000000000000000000000000000000000000;
>const double recip_12 = .0833333333333333333333333333333333333333333333;
>const double recip_144 = .00694444444444444444444444444444444444444444444;
>
>
>
>
>
>template<typename T> inline typename T::T_numtype Laplacian2D(T& A) {
>  return -4.0 * (*A)
>    + A.shift(-1,0) + A.shift(1,0)
>    + A.shift(-1,1) + A.shift(1,1);
>}
>
>template<typename T> inline typename T::T_numtype Laplacian3D(T& A) {
>  return -6.0 * (*A)
>    + A.shift(-1,0) + A.shift(1,0)
>    + A.shift(-1,1) + A.shift(1,1)
>    + A.shift(-1,2) + A.shift(1,2);
>}
>
>template<typename T> inline typename T::T_numtype Laplacian2D4(T& A) {
>  return -60.0 * (*A)
>    + 16.0 * (A.shift(-1,0) + A.shift(1,0) + A.shift(-1,1) + A.shift(1,1))
>    - (A.shift(-2,0) + A.shift(2,0) + A.shift(-2,1) + A.shift(2,1));
>}
>
>template<typename T> inline typename T::T_numtype Laplacian2D4n(T& A) {
>  return Laplacian2D4(A) * recip_12;
>}
>
>template<typename T> inline typename T::T_numtype Laplacian3D4(T& A) {
>  return -90.0 * (*A)
>    + 16.0 * (A.shift(-1,0) + A.shift(1,0) + A.shift(-1,1) + A.shift(1,1) +
>              A.shift(-1,2) + A.shift(1,2))
>    - (A.shift(-2,0) + A.shift(2,0) + A.shift(-2,1) + A.shift(2,1) +
>              A.shift(-2,2) + A.shift(2,2));
>}
>
>template<typename T> inline typename T::T_numtype Laplacian3D4n(T& A) {
>  return Laplacian3D4(A) * recip_12;
>}
># 125 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h"
>template<typename T> inline typename T::T_numtype central12(T& A, int dim = firstDim) {
>  return A.shift(1,dim) - A.shift(-1,dim);
>}
>
>template<typename T> inline typename T::T_numtype central22(T& A, int dim = firstDim) {
>  return -2.0 * (*A) + A.shift(1,dim) + A.shift(-1,dim);
>}
>
>template<typename T> inline typename T::T_numtype central32(T& A, int dim = firstDim) {
>  return -2.0 * (A.shift(1,dim) - A.shift(-1,dim))
>    + (A.shift(2,dim) - A.shift(-2,dim));
>}
>
>template<typename T> inline typename T::T_numtype central42(T& A, int dim = firstDim) {
>  return 6.0 * (*A)
>    - 4.0 * (A.shift(1,dim) + A.shift(-1,dim))
>    + (A.shift(2,dim) + A.shift(-2,dim));
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central12(T& A, int comp, int dim) {
>  return A.shift(1,dim)[comp] - A.shift(-1,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central22(T& A, int comp, int dim) {
>  return -2.0 * (*A)[comp]
>    + A.shift(1,dim)[comp] + A.shift(-1,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central32(T& A, int comp, int dim) {
>  return -2.0 * (A.shift(1,dim)[comp] - A.shift(-1,dim)[comp])
>    + (A.shift(2,dim)[comp] - A.shift(-2,dim)[comp]);
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central42(T& A, int comp, int dim) {
>  return 6.0 * (*A)[comp]
>    -4.0 * (A.shift(1,dim)[comp] + A.shift(-1,dim)[comp])
>    + (A.shift(2,dim)[comp] + A.shift(-2,dim)[comp]);
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype central12n(T& A, int dim = firstDim) {
>  return central12(A,dim) * recip_2;
>}
>
>template<typename T> inline typename T::T_numtype central22n(T& A, int dim = firstDim) {
>  return central22(A,dim);
>}
>
>template<typename T> inline typename T::T_numtype central32n(T& A, int dim = firstDim) {
>  return central32(A,dim) * recip_2;
>}
>
>template<typename T> inline typename T::T_numtype central42n(T& A, int dim = firstDim) {
>  return central42(A,dim);
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central12n(T& A, int comp, int dim) {
>  return central12(A,comp,dim) * recip_2;
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central22n(T& A, int comp, int dim) {
>  return central22(A,comp,dim);
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central32n(T& A, int comp, int dim) {
>  return central32(A,comp,dim) * recip_2;
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central42n(T& A, int comp, int dim) {
>  return central42(A,comp,dim);
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype central14(T& A, int dim = firstDim) {
>  return 8.0 * (A.shift(1,dim) - A.shift(-1,dim))
>    - (A.shift(2,dim) - A.shift(-2,dim));
>}
>
>template<typename T> inline typename T::T_numtype central24(T& A, int dim = firstDim) {
>  return -30.0 * (*A)
>    + 16.0 * (A.shift(1,dim) + A.shift(-1,dim))
>    - (A.shift(2,dim) + A.shift(-2,dim));
>}
>
>template<typename T> inline typename T::T_numtype central34(T& A, int dim = firstDim) {
>  return -13.0 * (A.shift(1,dim) - A.shift(-1,dim))
>    + 8.0 * (A.shift(2,dim) - A.shift(-2,dim))
>    - (A.shift(3,dim) - A.shift(-3,dim));
>}
>
>template<typename T> inline typename T::T_numtype central44(T& A, int dim = firstDim) {
>  return 56.0 * (*A)
>    - 39.0 * (A.shift(1,dim) + A.shift(-1,dim))
>    + 12.0 * (A.shift(2,dim) + A.shift(-2,dim))
>    - (A.shift(3,dim) + A.shift(-3,dim));
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central14(T& A, int comp, int dim) {
>  return 8.0 * (A.shift(1,dim)[comp] - A.shift(-1,dim)[comp])
>    - (A.shift(2,dim)[comp] - A.shift(-2,dim)[comp]);
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central24(T& A, int comp, int dim) {
>  return - 30.0 * (*A)[comp]
>    + 16.0 * (A.shift(1,dim)[comp] + A.shift(-1,dim)[comp])
>    - (A.shift(2,dim)[comp] + A.shift(-2,dim)[comp]);
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central34(T& A, int comp, int dim) {
>  return -13.0 * (A.shift(1,dim)[comp] - A.shift(-1,dim)[comp])
>    + 8.0 * (A.shift(2,dim)[comp] - A.shift(-2,dim)[comp])
>    - (A.shift(3,dim)[comp] - A.shift(-3,dim)[comp]);
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central44(T& A, int comp, int dim) {
>  return 56.0 * (*A)[comp]
>    - 39.0 * (A.shift(1,dim)[comp] + A.shift(-1,dim)[comp])
>    + 12.0 * (A.shift(2,dim)[comp] + A.shift(-2,dim)[comp])
>    - (A.shift(3,dim)[comp] + A.shift(-3,dim)[comp]);
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype central14n(T& A, int dim = firstDim) {
>  return central14(A,dim) * recip_12;
>}
>
>template<typename T> inline typename T::T_numtype central24n(T& A, int dim = firstDim) {
>  return central24(A,dim) * recip_12;
>}
>
>template<typename T> inline typename T::T_numtype central34n(T& A, int dim = firstDim) {
>  return central34(A,dim) * recip_8;
>}
>
>template<typename T> inline typename T::T_numtype central44n(T& A, int dim = firstDim) {
>  return central44(A,dim) * recip_6;
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central14n(T& A, int comp, int dim) {
>  return central14(A,comp,dim) * recip_12;
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central24n(T& A, int comp, int dim) {
>  return central24(A,comp,dim) * recip_12;
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central34n(T& A, int comp, int dim) {
>  return central34(A,comp,dim) * recip_8;
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element central44n(T& A, int comp, int dim) {
>  return central44(A,comp,dim) * recip_6;
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype backward11(T& A, int dim = firstDim) {
>  return (*A) - A.shift(-1,dim);
>}
>
>template<typename T> inline typename T::T_numtype backward21(T& A, int dim = firstDim) {
>  return (*A) - 2.0 * A.shift(-1,dim) + A.shift(-2,dim);
>}
>
>template<typename T> inline typename T::T_numtype backward31(T& A, int dim = firstDim) {
>  return (*A) - 3.0 * A.shift(-1,dim) + 3.0 * A.shift(-2,dim)
>    - A.shift(-3,dim);
>}
>
>template<typename T> inline typename T::T_numtype backward41(T& A, int dim = firstDim) {
>  return (*A) - 4.0 * A.shift(-1,dim) + 6.0 * A.shift(-2,dim)
>    - 4.0 * A.shift(-3,dim) + A.shift(-4,dim);
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward11(T& A, int comp, int dim) {
>  return (*A)[comp] - A.shift(-1,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward21(T& A, int comp, int dim) {
>  return (*A)[comp] - 2.0 * A.shift(-1,dim)[comp] + A.shift(-2,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward31(T& A, int comp, int dim) {
>  return (*A)[comp] - 3.0 * A.shift(-1,dim)[comp] + 3.0 * A.shift(-2,dim)[comp]
>    - A.shift(-3,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward41(T& A, int comp, int dim) {
>  return (*A)[comp] - 4.0 * A.shift(-1,dim)[comp] + 6.0 * A.shift(-2,dim)[comp]
>    - 4.0 * A.shift(-3,dim)[comp] + A.shift(-4,dim)[comp];
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype backward11n(T& A, int dim = firstDim) { return backward11(A,dim); }
>template<typename T> inline typename T::T_numtype backward21n(T& A, int dim = firstDim) { return backward21(A,dim); }
>template<typename T> inline typename T::T_numtype backward31n(T& A, int dim = firstDim) { return backward31(A,dim); }
>template<typename T> inline typename T::T_numtype backward41n(T& A, int dim = firstDim) { return backward41(A,dim); }
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward11n(T& A, int comp, int dim) { return backward11(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward21n(T& A, int comp, int dim) { return backward21(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward31n(T& A, int comp, int dim) { return backward31(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward41n(T& A, int comp, int dim) { return backward41(A,comp,dim); }
>
>
>
>
>
>template<typename T> inline typename T::T_numtype backward12(T& A, int dim = firstDim) {
>  return 3.0 * (*A) - 4.0 * A.shift(-1,dim) + A.shift(-2,dim);
>}
>
>template<typename T> inline typename T::T_numtype backward22(T& A, int dim = firstDim) {
>  return 2.0 * (*A) - 5.0 * A.shift(-1,dim) + 4.0 * A.shift(-2,dim)
>    - A.shift(-3,dim);
>}
>
>template<typename T> inline typename T::T_numtype backward32(T& A, int dim = firstDim) {
>  return 5.0 * (*A) - 18.0 * A.shift(-1,dim) + 24.0 * A.shift(-2,dim)
>    - 14.0 * A.shift(-3,dim) + 3.0 * A.shift(-4,dim);
>}
>
>template<typename T> inline typename T::T_numtype backward42(T& A, int dim = firstDim) {
>  return 3.0 * (*A) - 14.0 * A.shift(-1,dim) + 26.0 * A.shift(-2,dim)
>    - 24.0 * A.shift(-3,dim) + 11.0 * A.shift(-4,dim) - 2.0 * A.shift(-5,dim);
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward12(T& A, int comp, int dim) {
>  return 3.0 * (*A)[comp] - 4.0 * A.shift(-1,dim)[comp]
>    + A.shift(-2,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward22(T& A, int comp, int dim) {
>  return 2.0 * (*A)[comp] - 5.0 * A.shift(-1,dim)[comp]
>    + 4.0 * A.shift(-2,dim)[comp] - A.shift(-3,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward32(T& A, int comp, int dim) {
>  return 5.0 * (*A)[comp] - 18.0 * A.shift(-1,dim)[comp]
>    + 24.0 * A.shift(-2,dim)[comp] - 14.0 * A.shift(-3,dim)[comp]
>    + 3.0 * A.shift(-4,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward42(T& A, int comp, int dim) {
>  return 3.0 * (*A)[comp] - 14.0 * A.shift(-1,dim)[comp]
>    + 26.0 * A.shift(-2,dim)[comp] - 24.0 * A.shift(-3,dim)[comp]
>    + 11.0 * A.shift(-4,dim)[comp] - 2.0 * A.shift(-5,dim)[comp];
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype backward12n(T& A, int dim = firstDim) { return backward12(A,dim) * recip_2; }
>template<typename T> inline typename T::T_numtype backward22n(T& A, int dim = firstDim) { return backward22(A,dim); }
>template<typename T> inline typename T::T_numtype backward32n(T& A, int dim = firstDim) { return backward32(A,dim) * recip_2; }
>template<typename T> inline typename T::T_numtype backward42n(T& A, int dim = firstDim) { return backward42(A,dim); }
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward12n(T& A, int comp, int dim) { return backward12(A,comp,dim) * recip_2; }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward22n(T& A, int comp, int dim) { return backward22(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward32n(T& A, int comp, int dim) { return backward32(A,comp,dim) * recip_2; }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element backward42n(T& A, int comp, int dim) { return backward42(A,comp,dim); }
>
>
>
>
>
>template<typename T> inline typename T::T_numtype forward11(T& A, int dim = firstDim) {
>  return -(*A) + A.shift(1,dim);
>}
>
>template<typename T> inline typename T::T_numtype forward21(T& A, int dim = firstDim) {
>  return (*A) - 2.0 * A.shift(1,dim) + A.shift(2,dim);
>}
>
>template<typename T> inline typename T::T_numtype forward31(T& A, int dim = firstDim) {
>  return -(*A) + 3.0 * A.shift(1,dim) - 3.0 * A.shift(2,dim) + A.shift(3,dim);
>}
>
>template<typename T> inline typename T::T_numtype forward41(T& A, int dim = firstDim) {
>  return (*A) - 4.0 * A.shift(1,dim) + 6.0 * A.shift(2,dim)
>    - 4.0 * A.shift(3,dim) + A.shift(4,dim);
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward11(T& A, int comp, int dim) {
>  return -(*A)[comp] + A.shift(1,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward21(T& A, int comp, int dim) {
>  return (*A)[comp] - 2.0 * A.shift(1,dim)[comp] + A.shift(2,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward31(T& A, int comp, int dim) {
>  return -(*A)[comp] + 3.0 * A.shift(1,dim)[comp] - 3.0 * A.shift(2,dim)[comp]
>    + A.shift(3,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward41(T& A, int comp, int dim) {
>  return (*A)[comp] - 4.0 * A.shift(1,dim)[comp] + 6.0 * A.shift(2,dim)[comp]
>    - 4.0 * A.shift(3,dim)[comp] + A.shift(4,dim)[comp];
>}
>
>
>
>
>
>template<typename T> inline typename T::T_numtype forward11n(T& A, int dim = firstDim) { return forward11(A,dim); }
>template<typename T> inline typename T::T_numtype forward21n(T& A, int dim = firstDim) { return forward21(A,dim); }
>template<typename T> inline typename T::T_numtype forward31n(T& A, int dim = firstDim) { return forward31(A,dim); }
>template<typename T> inline typename T::T_numtype forward41n(T& A, int dim = firstDim) { return forward41(A,dim); }
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward11n(T& A, int comp, int dim) { return forward11(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward21n(T& A, int comp, int dim) { return forward21(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward31n(T& A, int comp, int dim) { return forward31(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward41n(T& A, int comp, int dim) { return forward41(A,comp,dim); }
>
>
>
>
>
>template<typename T> inline typename T::T_numtype forward12(T& A, int dim = firstDim) {
>  return -3.0 * (*A) + 4.0 * A.shift(1,dim) - A.shift(2,dim);
>}
>
>template<typename T> inline typename T::T_numtype forward22(T& A, int dim = firstDim) {
>  return 2.0 * (*A) - 5.0 * A.shift(1,dim) + 4.0 * A.shift(2,dim)
>    - A.shift(3,dim);
>}
>
>template<typename T> inline typename T::T_numtype forward32(T& A, int dim = firstDim) {
>  return -5.0 * (*A) + 18.0 * A.shift(1,dim) - 24.0 * A.shift(2,dim)
>    + 14.0 * A.shift(3,dim) - 3.0 * A.shift(4,dim);
>}
>
>template<typename T> inline typename T::T_numtype forward42(T& A, int dim = firstDim) {
>  return 3.0 * (*A) - 14.0 * A.shift(1,dim) + 26.0 * A.shift(2,dim)
>    - 24.0 * A.shift(3,dim) + 11.0 * A.shift(4,dim) - 2.0 * A.shift(5,dim);
>}
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward12(T& A, int comp, int dim) {
>  return -3.0 * (*A)[comp] + 4.0 * A.shift(1,dim)[comp] - A.shift(2,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward22(T& A, int comp, int dim) {
>  return 2.0 * (*A)[comp] - 5.0 * A.shift(1,dim)[comp]
>    + 4.0 * A.shift(2,dim)[comp] - A.shift(3,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward32(T& A, int comp, int dim) {
>  return -5.0 * (*A)[comp] + 18.0 * A.shift(1,dim)[comp]
>    - 24.0 * A.shift(2,dim)[comp] + 14.0 * A.shift(3,dim)[comp]
>    - 3.0 * A.shift(4,dim)[comp];
>}
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward42(T& A, int comp, int dim) {
>  return 3.0 * (*A)[comp] - 14.0 * A.shift(1,dim)[comp]
>    + 26.0 * A.shift(2,dim)[comp] - 24.0 * A.shift(3,dim)[comp]
>    + 11.0 * A.shift(4,dim)[comp] - 2.0 * A.shift(5,dim)[comp];
>}
>
>
>
>
>
>
>template<typename T> inline typename T::T_numtype forward12n(T& A, int dim = firstDim) { return forward12(A,dim) * recip_2; }
>template<typename T> inline typename T::T_numtype forward22n(T& A, int dim = firstDim) { return forward22(A,dim); }
>template<typename T> inline typename T::T_numtype forward32n(T& A, int dim = firstDim) { return forward32(A,dim) * recip_2; }
>template<typename T> inline typename T::T_numtype forward42n(T& A, int dim = firstDim) { return forward42(A,dim); }
>
>
>
>
>
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward12n(T& A, int comp, int dim) { return forward12(A,comp,dim) * recip_2; }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward22n(T& A, int comp, int dim) { return forward22(A,comp,dim); }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward32n(T& A, int comp, int dim) { return forward32(A,comp,dim) * recip_2; }
>template<typename T> inline typename multicomponent_traits<typename T::T_numtype>::T_element forward42n(T& A, int comp, int dim) { return forward42(A,comp,dim); }
>
>
>
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> grad2D(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central12(A,firstDim),
>    central12(A,secondDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> grad2D4(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central14(A,firstDim),
>    central14(A,secondDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> grad3D(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central12(A,firstDim),
>    central12(A,secondDim),
>    central12(A,thirdDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> grad3D4(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central14(A,firstDim),
>    central14(A,secondDim),
>    central14(A,thirdDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> grad2Dn(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central12n(A,firstDim),
>    central12n(A,secondDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> grad2D4n(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central14n(A,firstDim),
>    central14n(A,secondDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> grad3Dn(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central12n(A,firstDim),
>    central12n(A,secondDim),
>    central12n(A,thirdDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> grad3D4n(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central14n(A,firstDim),
>    central14n(A,secondDim),
>    central14n(A,thirdDim));
>}
>
>
>
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> gradSqr2D(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central22(A,firstDim),
>    central22(A,secondDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> gradSqr2D4(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central24(A,firstDim),
>    central24(A,secondDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> gradSqr3D(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central22(A,firstDim),
>    central22(A,secondDim),
>    central22(A,thirdDim));
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> gradSqr3D4(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central24(A,firstDim),
>    central24(A,secondDim),
>    central24(A,thirdDim));
>}
>
>
>
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> gradSqr2Dn(T& A) {
>  return gradSqr2D(A);
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,2> gradSqr2D4n(T& A) {
>  return TinyVector<typename T::T_numtype,2>(
>    central24(A,firstDim) * recip_12,
>    central24(A,secondDim) * recip_12);
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> gradSqr3Dn(T& A) {
>  return gradSqr3D(A);
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> gradSqr3D4n(T& A) {
>  return TinyVector<typename T::T_numtype,3>(
>    central24(A,firstDim) * recip_12,
>    central24(A,secondDim) * recip_12,
>    central24(A,thirdDim) * recip_12);
>}
>
>
>
>
>
>template<typename T>
>inline TinyMatrix<typename multicomponent_traits<typename
>    T::T_numtype>::T_element, 3, 3>
>Jacobian3D(T& A)
>{
>    const int x=0, y=1, z=2;
>    const int u=0, v=1, w=2;
>
>    TinyMatrix<typename multicomponent_traits<typename
>        T::T_numtype>::T_element, 3, 3> grad;
>
>    grad(u,x) = central12(A,u,x);
>    grad(u,y) = central12(A,u,y);
>    grad(u,z) = central12(A,u,z);
>    grad(v,x) = central12(A,v,x);
>    grad(v,y) = central12(A,v,y);
>    grad(v,z) = central12(A,v,z);
>    grad(w,x) = central12(A,w,x);
>    grad(w,y) = central12(A,w,y);
>    grad(w,z) = central12(A,w,z);
>
>    return grad;
>}
>
>template<typename T>
>inline TinyMatrix<typename multicomponent_traits<typename
>    T::T_numtype>::T_element, 3, 3>
>Jacobian3Dn(T& A)
>{
>    const int x=0, y=1, z=2;
>    const int u=0, v=1, w=2;
>
>    TinyMatrix<typename multicomponent_traits<typename
>        T::T_numtype>::T_element, 3, 3> grad;
>
>    grad(u,x) = central12n(A,u,x);
>    grad(u,y) = central12n(A,u,y);
>    grad(u,z) = central12n(A,u,z);
>    grad(v,x) = central12n(A,v,x);
>    grad(v,y) = central12n(A,v,y);
>    grad(v,z) = central12n(A,v,z);
>    grad(w,x) = central12n(A,w,x);
>    grad(w,y) = central12n(A,w,y);
>    grad(w,z) = central12n(A,w,z);
>
>    return grad;
>}
>
>template<typename T>
>inline TinyMatrix<typename multicomponent_traits<typename
>    T::T_numtype>::T_element, 3, 3>
>Jacobian3D4(T& A)
>{
>    const int x=0, y=1, z=2;
>    const int u=0, v=1, w=2;
>
>    TinyMatrix<typename multicomponent_traits<typename
>        T::T_numtype>::T_element, 3, 3> grad;
>
>    grad(u,x) = central14(A,u,x);
>    grad(u,y) = central14(A,u,y);
>    grad(u,z) = central14(A,u,z);
>    grad(v,x) = central14(A,v,x);
>    grad(v,y) = central14(A,v,y);
>    grad(v,z) = central14(A,v,z);
>    grad(w,x) = central14(A,w,x);
>    grad(w,y) = central14(A,w,y);
>    grad(w,z) = central14(A,w,z);
>
>    return grad;
>}
>
>template<typename T>
>inline TinyMatrix<typename multicomponent_traits<typename
>    T::T_numtype>::T_element, 3, 3>
>Jacobian3D4n(T& A)
>{
>    const int x=0, y=1, z=2;
>    const int u=0, v=1, w=2;
>
>    TinyMatrix<typename multicomponent_traits<typename
>        T::T_numtype>::T_element, 3, 3> grad;
>
>    grad(u,x) = central14n(A,u,x);
>    grad(u,y) = central14n(A,u,y);
>    grad(u,z) = central14n(A,u,z);
>    grad(v,x) = central14n(A,v,x);
>    grad(v,y) = central14n(A,v,y);
>    grad(v,z) = central14n(A,v,z);
>    grad(w,x) = central14n(A,w,x);
>    grad(w,y) = central14n(A,w,y);
>    grad(w,z) = central14n(A,w,z);
>
>    return grad;
>}
>
>
>
>
>
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3>
>curl(T& vx, T& vy, T& vz) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return TinyVector<typename T::T_numtype,3>(
>    central12(vz,y)-central12(vy,z),
>    central12(vx,z)-central12(vz,x),
>    central12(vy,x)-central12(vx,y));
>}
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3>
>curln(T& vx, T& vy, T& vz) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return TinyVector<typename T::T_numtype,3>(
>    (central12(vz,y)-central12(vy,z)) * recip_2,
>    (central12(vx,z)-central12(vz,x)) * recip_2,
>    (central12(vy,x)-central12(vx,y)) * recip_2);
>}
>
>
>template<typename T>
>inline typename T::T_numtype curl(T& A) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return typename T::T_numtype(
>    central12(A,z,y)-central12(A,y,z),
>    central12(A,x,z)-central12(A,z,x),
>    central12(A,y,x)-central12(A,x,y));
>}
>
>
>template<typename T>
>inline typename T::T_numtype curln(T& A) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return typename T::T_numtype(
>    (central12(A,z,y)-central12(A,y,z)) * recip_2,
>    (central12(A,x,z)-central12(A,z,x)) * recip_2,
>    (central12(A,y,x)-central12(A,x,y)) * recip_2);
>}
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3>
>curl4(T& vx, T& vy, T& vz) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return TinyVector<typename T::T_numtype,3>(
>    central14(vz,y)-central14(vy,z),
>    central14(vx,z)-central14(vz,x),
>    central14(vy,x)-central14(vx,y));
>}
>
>
>template<typename T>
>inline typename T::T_numtype
>curl4(T& A) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return typename T::T_numtype(
>    central14(A,z,y)-central14(A,y,z),
>    central14(A,x,z)-central14(A,z,x),
>    central14(A,y,x)-central14(A,x,y));
>}
>
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3>
>curl4n(T& vx, T& vy, T& vz) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return TinyVector<typename T::T_numtype,3>(
>    (central14(vz,y)-central14(vy,z)) * recip_2,
>    (central14(vx,z)-central14(vz,x)) * recip_2,
>    (central14(vy,x)-central14(vx,y)) * recip_2);
>}
>
>
>template<typename T>
>inline typename T::T_numtype
>curl4n(T& A) {
>  const int x = firstDim, y = secondDim, z = thirdDim;
>
>  return typename T::T_numtype(
>    (central14(A,z,y)-central14(A,y,z)) * recip_2,
>    (central14(A,x,z)-central14(A,z,x)) * recip_2,
>    (central14(A,y,x)-central14(A,x,y)) * recip_2);
>}
>
>
>
>
>
>template<typename T>
>inline typename T::T_numtype
>curl(T& vx, T& vy) {
>  const int x = firstDim, y = secondDim;
>
>  return central12(vy,x)-central12(vx,y);
>}
>
>template<typename T>
>inline typename T::T_numtype
>curln(T& vx, T& vy) {
>  const int x = firstDim, y = secondDim;
>
>  return (central12(vy,x)-central12(vx,y)) * recip_2;
>}
>
>
>template<typename T>
>inline typename T::T_numtype::T_numtype curl2D(T& A) {
>  const int x = firstDim, y = secondDim;
>  return central12(A,y,x)-central12(A,x,y);
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype curl2Dn(T& A) {
>  const int x = firstDim, y = secondDim;
>  return (central12(A,y,x)-central12(A,x,y)) * recip_2;
>}
>
>
>
>
>template<typename T>
>inline typename T::T_numtype
>curl4(T& vx, T& vy) {
>  const int x = firstDim, y = secondDim;
>
>  return central14(vy,x)-central14(vx,y);
>}
>
>template<typename T>
>inline typename T::T_numtype
>curl4n(T& vx, T& vy) {
>  const int x = firstDim, y = secondDim;
>
>  return (central14(vy,x)-central14(vx,y)) * recip_12;
>}
>
>
>template<typename T>
>inline typename T::T_numtype::T_numtype curl2D4(T& A) {
>  const int x = firstDim, y = secondDim;
>  return central14(A,y,x)-central14(A,x,y);
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype curl2D4n(T& A) {
>  const int x = firstDim, y = secondDim;
>  return (central14(A,y,x)-central14(A,x,y)) * recip_12;
>}
>
>
>
>
>
>
>template<typename T> inline typename T::T_numtype div(T& vx, T& vy) {
>  return central12(vx,firstDim) + central12(vy,secondDim);
>}
>
>template<typename T> inline typename T::T_numtype divn(T& vx, T& vy) {
>  return (central12(vx,firstDim) + central12(vy,secondDim))
>     * recip_2;
>}
>
>template<typename T> inline typename T::T_numtype div4(T& vx, T& vy) {
>  return central14(vx,firstDim) + central14(vy,secondDim);
>}
>
>template<typename T> inline typename T::T_numtype div4n(T& vx, T& vy) {
>  return (central14(vx,firstDim) + central14(vy,secondDim))
>    * recip_12;
>}
>
>template<typename T> inline typename T::T_numtype div(T& vx, T& vy, T& vz) {
>  return central12(vx,firstDim) + central12(vy,secondDim)
>    + central12(vz,thirdDim);
>}
>
>template<typename T> inline typename T::T_numtype divn(T& vx, T& vy, T& vz) {
>  return (central12(vx,firstDim) + central12(vy,secondDim)
>    + central12(vz,thirdDim)) * recip_2;
>}
>
>template<typename T> inline typename T::T_numtype div4(T& vx, T& vy, T& vz) {
>  return central14(vx,firstDim) + central14(vy,secondDim)
>    + central14(vz,thirdDim);
>}
>
>template<typename T> inline typename T::T_numtype div4n(T& vx, T& vy, T& vz) {
>  return (central14(vx,firstDim) + central14(vy,secondDim)
>    + central14(vz,thirdDim)) * recip_12;
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div2D(T& A)
>{
>    const int x = firstDim, y = secondDim;
>    return central12(A,x,x) + central12(A,y,y);
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div2D4(T& A)
>{
>    const int x = firstDim, y = secondDim;
>    return central14(A,x,x) + central14(A,y,y);
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div2Dn(T& A)
>{
>    const int x = firstDim, y = secondDim;
>    return (central12(A,x,x) + central12(A,y,y)) * recip_2;
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div2D4n(T& A)
>{
>    const int x = firstDim, y = secondDim;
>    return (central14(A,x,x) + central14(A,y,y)) * recip_12;
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div3D(T& A)
>{
>    const int x = firstDim, y = secondDim, z = thirdDim;
>    return central12(A,x,x) + central12(A,y,y) + central12(A,z,z);
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div3D4(T& A)
>{
>    const int x = firstDim, y = secondDim, z = thirdDim;
>    return central14(A,x,x) + central14(A,y,y) + central14(A,z,z);
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div3Dn(T& A)
>{
>    const int x = firstDim, y = secondDim, z = thirdDim;
>    return (central12(A,x,x) + central12(A,y,y) + central12(A,z,z)) * recip_2;
>}
>
>template<typename T>
>inline typename T::T_numtype::T_numtype
>div3D4n(T& A)
>{
>    const int x = firstDim, y = secondDim, z = thirdDim;
>    return (central14(A,x,x) + central14(A,y,y) + central14(A,z,z)) * recip_12;
>}
>
>
>
>
>
>template<typename T>
>inline typename T::T_numtype
>mixed22(T& A, int x, int y)
>{
>    return A.shift(-1,x,-1,y) - A.shift(-1,x,1,y)
>        - A.shift(1,x,-1,y) + A.shift(1,x,1,y);
>}
>
>template<typename T>
>inline typename T::T_numtype
>mixed22n(T& A, int x, int y)
>{
>    return mixed22(A,x,y) * recip_4;
>}
>
>template<typename T>
>inline typename T::T_numtype
>mixed24(T& A, int x, int y)
>{
>    return 64.0 * (A.shift(-1,x,-1,y) - A.shift(-1,x,1,y) -
>                   A.shift(1,x,-1,y) + A.shift(1,x,1,y))
>        + (A.shift(-2,x,1,y) - A.shift(-1,x,2,y) -
>                   A.shift(1,x,2,y) - A.shift(2,x,1,y) +
>                   A.shift(2,x,-1,y) + A.shift(1,x,-2,y) -
>                   A.shift(-1,x,-2,y) + A.shift(-2,x,-1,y))
>        + 8.0 * (A.shift(-1,x,1,y) + A.shift(-1,x,2,y) -
>                   A.shift(2,x,-2,y) + A.shift(2,x,2,y));
>}
>
>template<typename T>
>inline typename T::T_numtype
>mixed24n(T& A, int x, int y)
>{
>    return mixed24(A,x,y) * recip_144;
>}
># 1112 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencilops.h"
>template<typename T>
>inline typename multicomponent_traits<typename
>    T::T_numtype>::T_element div3DVec4(T& A,
>    const UniformCubicGeometry<3>& geom)
>{
>    const int x = 0, y = 1, z = 2;
>
>    return (central14(A, x, firstDim) + central14(A, y, secondDim)
>        + central14(A, z, thirdDim)) * recip_12 * geom.recipSpatialStep();
>}
>
>template<typename T>
>inline typename T::T_numtype Laplacian3D4(T& A,
>    const UniformCubicGeometry<3>& geom)
>{
>    return Laplacian3D4n(A) * geom.recipSpatialStepPow2();
>}
>
>template<typename T>
>inline typename T::T_numtype Laplacian3DVec4(T& A,
>    const UniformCubicGeometry<3>& geom)
>{
>    typedef typename T::T_numtype vector3d;
>    typedef typename multicomponent_traits<vector3d>::T_element
>        T_element;
>    const int u = 0, v = 1, w = 2;
>    const int x = 0, y = 1, z = 2;
>
>
>
>
>    T_element t1 = (central24(A,u,x) + central24(A,u,y) + central24(A,u,z))
>        * recip_12 * geom.recipSpatialStepPow2();
>
>    T_element t2 = (central24(A,v,x) + central24(A,v,y) + central24(A,v,z))
>        * recip_12 * geom.recipSpatialStepPow2();
>
>    T_element t3 = (central24(A,w,x) + central24(A,w,y) + central24(A,w,z))
>        * recip_12 * geom.recipSpatialStepPow2();
>
>    return vector3d(t1,t2,t3);
>}
>
>template<typename T>
>inline TinyMatrix<typename multicomponent_traits<typename
>    T::T_numtype>::T_element, 3, 3>
>grad3DVec4(T& A, const UniformCubicGeometry<3>& geom)
>{
>    const int x=0, y=1, z=2;
>    const int u=0, v=1, w=2;
>
>    TinyMatrix<typename multicomponent_traits<typename
>        T::T_numtype>::T_element, 3, 3> grad;
>
>
>    grad(u,x) = central14n(A,u,x) * geom.recipSpatialStep();
>    grad(u,y) = central14n(A,u,y) * geom.recipSpatialStep();
>    grad(u,z) = central14n(A,u,z) * geom.recipSpatialStep();
>    grad(v,x) = central14n(A,v,x) * geom.recipSpatialStep();
>    grad(v,y) = central14n(A,v,y) * geom.recipSpatialStep();
>    grad(v,z) = central14n(A,v,z) * geom.recipSpatialStep();
>    grad(w,x) = central14n(A,w,x) * geom.recipSpatialStep();
>    grad(w,y) = central14n(A,w,y) * geom.recipSpatialStep();
>    grad(w,z) = central14n(A,w,z) * geom.recipSpatialStep();
>
>    return grad;
>}
>
>template<typename T>
>inline TinyVector<typename T::T_numtype,3> grad3D4(T& A,
>    const UniformCubicGeometry<3>& geom) {
>  return TinyVector<typename T::T_numtype,3>(
>    central14(A,firstDim) * recip_12 * geom.recipSpatialStep(),
>    central14(A,secondDim) * recip_12 * geom.recipSpatialStep(),
>    central14(A,thirdDim) * recip_12 * geom.recipSpatialStep());
>}
>
>}
># 32 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.h" 2
># 143 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.h"
>namespace blitz {
>
>
>
>
>
>
>
>template<typename T> class dummy;
>
>struct dummyArray {
>    typedef dummy<double> T_iterator;
>
>    const dummyArray& shape() const { return *this; }
>};
>
>extern dummyArray _dummyArray;
>
>
>
>
>
>template<typename T>
>class dummy {
>public:
>    dummy() { }
>
>    dummy(T value)
>      : value_(value)
>    { }
>
>    dummy(const dummyArray&)
>    { }
>
>    operator T() const { return value_; };
>
>    template<typename T2>
>    void operator=(T2) { }
>
>    typename multicomponent_traits<T>::T_element operator[](int i) const
>    { return value_[i]; }
>
>    void loadStride(int) { }
>    void moveTo(int) { }
>    void moveTo(int,int) { }
>    void moveTo(int,int,int) { }
>    void moveTo(int,int,int,int) { }
>    void advance() { }
>    T shift(int,int) { return T(); }
>
>private:
>    T value_;
>};
># 205 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.h"
>template<int N_rank,typename P_numtype>
>class stencilExtent {
>public:
>    typedef P_numtype T_numtype;
>
>    stencilExtent()
>    {
>        min_ = 0;
>        max_ = 0;
>    }
>
>    dummy<T_numtype> operator()(int i)
>    {
>        update(0, i);
>        return dummy<T_numtype>(1);
>    }
>
>    dummy<T_numtype> operator()(int i, int j)
>    {
>        update(0, i);
>        update(1, j);
>        return dummy<T_numtype>(1);
>    }
>
>    dummy<T_numtype> operator()(int i, int j, int k)
>    {
>        update(0, i);
>        update(1, j);
>        update(2, k);
>        return dummy<T_numtype>(1);
>    }
>
>    dummy<T_numtype> shift(int offset, int dim)
>    {
>        update(dim, offset);
>        return dummy<T_numtype>(1);
>    }
>
>    dummy<T_numtype> shift(int offset1, int dim1, int offset2, int dim2)
>    {
>        update(dim1, offset1);
>        update(dim2, offset2);
>        return dummy<T_numtype>(1);
>    }
>
>    dummy<typename multicomponent_traits<T_numtype>::T_element>
>        operator[](int)
>    {
>        return dummy<typename multicomponent_traits<T_numtype>::T_element>
>            (1);
>    }
>
>    void update(int rank, int offset)
>    {
>        if (offset < min_[rank])
>            min_[rank] = offset;
>        if (offset > max_[rank])
>            max_[rank] = offset;
>    }
>
>    template<typename T_numtype2>
>    void combine(const stencilExtent<N_rank,T_numtype2>& x)
>    {
>        for (int i=0; i < N_rank; ++i)
>        {
>            min_[i] = minmax::min(min_[i], x.min(i));
>            max_[i] = minmax::max(max_[i], x.max(i));
>        }
>    }
>
>    template<typename T_numtype2>
>    void combine(const dummy<T_numtype2>&)
>    { }
>
>    int min(int i) const
>    { return min_[i]; }
>
>    int max(int i) const
>    { return max_[i]; }
>
>    const TinyVector<int,N_rank>& min() const
>    { return min_; }
>
>    const TinyVector<int,N_rank>& max() const
>    { return max_; }
>
>    template<typename T>
>    void operator=(T)
>    { }
>
>
>    template<typename T> void operator+=(T) { }
>    template<typename T> void operator-=(T) { }
>    template<typename T> void operator*=(T) { }
>    template<typename T> void operator/=(T) { }
>
>    operator T_numtype()
>    { return T_numtype(1); }
>
>    T_numtype operator*()
>    { return T_numtype(1); }
>
>private:
>    mutable TinyVector<int,N_rank> min_, max_;
>};
>
>
>
>
>
>
>template<typename T>
>struct stencilExtent_traits {
>    typedef dummy<double> T_stencilExtent;
>};
>
>template<typename T_numtype, int N_rank>
>struct stencilExtent_traits<Array<T_numtype,N_rank> > {
>    typedef stencilExtent<N_rank,T_numtype> T_stencilExtent;
>};
>
>
>
>
>
>
>template<typename T_shape1>
>inline bool areShapesConformable(const T_shape1&, const dummyArray&) {
>    return true;
>}
>
>}
>
># 1 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.cc" 1
># 30 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.cc"
>namespace blitz {
># 60 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.cc"
>template<int N_rank, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>void checkShapes(const Array<T_numtype1,N_rank>& ,
>    const T_array2& , const T_array3& ,
>    const T_array4& , const T_array5& ,
>    const T_array6& , const T_array7& ,
>    const T_array8& , const T_array9& ,
>    const T_array10& , const T_array11& )
>{
>    ;
># 81 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.cc"
>}
>
>template<typename T_extent, int N_rank,
>    class T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>void calcStencilExtent(T_extent& At, const T_stencil& stencil,
>    const Array<T_numtype1,N_rank>&,
>    const T_array2&, const T_array3&, const T_array4&, const T_array5&,
>    const T_array6&, const T_array7&, const T_array8&, const T_array9&,
>    const T_array10&, const T_array11&)
>{
>
>    typename stencilExtent_traits<T_array2>::T_stencilExtent Bt;
>    typename stencilExtent_traits<T_array3>::T_stencilExtent Ct;
>    typename stencilExtent_traits<T_array4>::T_stencilExtent Dt;
>    typename stencilExtent_traits<T_array5>::T_stencilExtent Et;
>    typename stencilExtent_traits<T_array6>::T_stencilExtent Ft;
>    typename stencilExtent_traits<T_array7>::T_stencilExtent Gt;
>    typename stencilExtent_traits<T_array8>::T_stencilExtent Ht;
>    typename stencilExtent_traits<T_array9>::T_stencilExtent It;
>    typename stencilExtent_traits<T_array10>::T_stencilExtent Jt;
>    typename stencilExtent_traits<T_array11>::T_stencilExtent Kt;
>
>    stencil.apply(At, Bt, Ct, Dt, Et, Ft, Gt, Ht, It, Jt, Kt);
>    At.combine(Bt);
>    At.combine(Ct);
>    At.combine(Dt);
>    At.combine(Et);
>    At.combine(Ft);
>    At.combine(Gt);
>    At.combine(Ht);
>    At.combine(It);
>    At.combine(Jt);
>    At.combine(Kt);
>}
>
>template<int N_rank, typename T_stencil, typename T_numtype1, typename T_array2>
>RectDomain<N_rank> interiorDomain(const T_stencil& stencil,
>    const Array<T_numtype1,N_rank>& A,
>    const T_array2& B)
>{
>    RectDomain<N_rank> domain = A.domain();
>
>
>    stencilExtent<3, T_numtype1> At;
>    calcStencilExtent(At, stencil, A, B, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray);
>
>
>    TinyVector<int,N_rank> lbound, ubound;
>    lbound = domain.lbound() - At.min();
>    ubound = domain.ubound() - At.max();
>    return RectDomain<N_rank>(lbound,ubound);
>}
>
>template<int hasExtents>
>struct _getStencilExtent {
>template<int N_rank,
>    class T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>static void getStencilExtent(TinyVector<int,N_rank>& minb,
>    TinyVector<int,N_rank>& maxb,
>    const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>    T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>    T_array7& G, T_array8& H, T_array9& I, T_array10& J, T_array11& K)
>{
>
>    stencilExtent<N_rank, T_numtype1> At;
>    calcStencilExtent(At, stencil, A, B, C, D, E, F, G, H, I, J, K);
>    minb = At.min();
>    maxb = At.max();
>}
>};
>
>template<>
>struct _getStencilExtent<1> {
>template<int N_rank,
>    class T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>static inline void getStencilExtent(TinyVector<int,N_rank>& minb,
>    TinyVector<int,N_rank>& maxb,
>    const T_stencil& stencil, Array<T_numtype1,N_rank>&,
>    T_array2&, T_array3&, T_array4&, T_array5&, T_array6&,
>    T_array7&, T_array8&, T_array9&, T_array10&, T_array11&)
>{
>    stencil.getExtent(minb, maxb);
>}
>};
>
>template<int N_rank,
>    class T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>inline void getStencilExtent(TinyVector<int,N_rank>& minb,
>    TinyVector<int,N_rank>& maxb,
>    const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>    T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>    T_array7& G, T_array8& H, T_array9& I, T_array10& J, T_array11& K)
>{
>    _getStencilExtent<T_stencil::hasExtent>::getStencilExtent(
>        minb, maxb, stencil, A, B, C, D, E, F, G, H, I, J, K);
>}
>
>
>
>
>
>
>template<typename T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>void applyStencil_imp(const T_stencil& stencil, Array<T_numtype1,3>& A,
>    T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>    T_array7& G, T_array8& H, T_array9& I, T_array10& J, T_array11& K)
>{
>    checkShapes(A,B,C,D,E,F,G,H,I,J,K);
>
>
>    TinyVector<int,3> minb, maxb;
>    getStencilExtent(minb, maxb, stencil, A, B, C, D, E, F, G, H, I, J, K);
>
>
>
>
>    int stencil_lbound0 = minb(0);
>    int stencil_lbound1 = minb(1);
>    int stencil_lbound2 = minb(2);
>
>    int stencil_ubound0 = maxb(0);
>    int stencil_ubound1 = maxb(1);
>    int stencil_ubound2 = maxb(2);
>
>    int lbound0 = minmax::max(A.lbound(0), A.lbound(0) - stencil_lbound0);
>    int lbound1 = minmax::max(A.lbound(1), A.lbound(1) - stencil_lbound1);
>    int lbound2 = minmax::max(A.lbound(2), A.lbound(2) - stencil_lbound2);
>
>    int ubound0 = minmax::min(A.ubound(0), A.ubound(0) - stencil_ubound0);
>    int ubound1 = minmax::min(A.ubound(1), A.ubound(1) - stencil_ubound1);
>    int ubound2 = minmax::min(A.ubound(2), A.ubound(2) - stencil_ubound2);
># 238 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.cc"
>    FastArrayIterator<T_numtype1,3> Aiter(A);
>    typename T_array2::T_iterator Biter(B);
>    typename T_array3::T_iterator Citer(C);
>    typename T_array4::T_iterator Diter(D);
>    typename T_array5::T_iterator Eiter(E);
>    typename T_array6::T_iterator Fiter(F);
>    typename T_array7::T_iterator Giter(G);
>    typename T_array8::T_iterator Hiter(H);
>    typename T_array9::T_iterator Iiter(I);
>    typename T_array10::T_iterator Jiter(J);
>    typename T_array11::T_iterator Kiter(K);
>
>
>    Aiter.loadStride(2);
>    Biter.loadStride(2);
>    Citer.loadStride(2);
>    Diter.loadStride(2);
>    Eiter.loadStride(2);
>    Fiter.loadStride(2);
>    Giter.loadStride(2);
>    Hiter.loadStride(2);
>    Iiter.loadStride(2);
>    Jiter.loadStride(2);
>    Kiter.loadStride(2);
>
>    for (int i=lbound0; i <= ubound0; ++i)
>    {
>      for (int j=lbound1; j <= ubound1; ++j)
>      {
>        Aiter.moveTo(i,j,lbound2);
>        Biter.moveTo(i,j,lbound2);
>        Citer.moveTo(i,j,lbound2);
>        Diter.moveTo(i,j,lbound2);
>        Eiter.moveTo(i,j,lbound2);
>        Fiter.moveTo(i,j,lbound2);
>        Giter.moveTo(i,j,lbound2);
>        Hiter.moveTo(i,j,lbound2);
>        Iiter.moveTo(i,j,lbound2);
>        Jiter.moveTo(i,j,lbound2);
>        Kiter.moveTo(i,j,lbound2);
>
>        for (int k=lbound2; k <= ubound2; ++k)
>        {
>            stencil.apply(Aiter, Biter, Citer, Diter, Eiter, Fiter, Giter,
>                Hiter, Iiter, Jiter, Kiter);
>
>            Aiter.advance();
>            Biter.advance();
>            Citer.advance();
>            Diter.advance();
>            Eiter.advance();
>            Fiter.advance();
>            Giter.advance();
>            Hiter.advance();
>            Iiter.advance();
>            Jiter.advance();
>            Kiter.advance();
>        }
>      }
>    }
>}
>
>
>
>
>
>
>template<typename T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>void applyStencil_imp(const T_stencil& stencil, Array<T_numtype1,2>& A,
>    T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>    T_array7& G, T_array8& H, T_array9& I, T_array10& J, T_array11& K)
>{
>    checkShapes(A,B,C,D,E,F,G,H,I,J,K);
>
>
>    TinyVector<int,2> minb, maxb;
>    getStencilExtent(minb, maxb, stencil, A, B, C, D, E, F, G, H, I, J, K);
>
>
>
>
>    int stencil_lbound0 = minb(0);
>    int stencil_lbound1 = minb(1);
>
>    int stencil_ubound0 = maxb(0);
>    int stencil_ubound1 = maxb(1);
>
>    int lbound0 = minmax::max(A.lbound(0), A.lbound(0) - stencil_lbound0);
>    int lbound1 = minmax::max(A.lbound(1), A.lbound(1) - stencil_lbound1);
>
>    int ubound0 = minmax::min(A.ubound(0), A.ubound(0) - stencil_ubound0);
>    int ubound1 = minmax::min(A.ubound(1), A.ubound(1) - stencil_ubound1);
># 341 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.cc"
>    FastArrayIterator<T_numtype1,2> Aiter(A);
>    typename T_array2::T_iterator Biter(B);
>    typename T_array3::T_iterator Citer(C);
>    typename T_array4::T_iterator Diter(D);
>    typename T_array5::T_iterator Eiter(E);
>    typename T_array6::T_iterator Fiter(F);
>    typename T_array7::T_iterator Giter(G);
>    typename T_array8::T_iterator Hiter(H);
>    typename T_array9::T_iterator Iiter(I);
>    typename T_array10::T_iterator Jiter(J);
>    typename T_array11::T_iterator Kiter(K);
>
>
>    Aiter.loadStride(1);
>    Biter.loadStride(1);
>    Citer.loadStride(1);
>    Diter.loadStride(1);
>    Eiter.loadStride(1);
>    Fiter.loadStride(1);
>    Giter.loadStride(1);
>    Hiter.loadStride(1);
>    Iiter.loadStride(1);
>    Jiter.loadStride(1);
>    Kiter.loadStride(1);
>
>    for (int i=lbound0; i <= ubound0; ++i)
>    {
>        Aiter.moveTo(i,lbound1);
>        Biter.moveTo(i,lbound1);
>        Citer.moveTo(i,lbound1);
>        Diter.moveTo(i,lbound1);
>        Eiter.moveTo(i,lbound1);
>        Fiter.moveTo(i,lbound1);
>        Giter.moveTo(i,lbound1);
>        Hiter.moveTo(i,lbound1);
>        Iiter.moveTo(i,lbound1);
>        Jiter.moveTo(i,lbound1);
>        Kiter.moveTo(i,lbound1);
>
>        for (int k=lbound1; k <= ubound1; ++k)
>        {
>            stencil.apply(Aiter, Biter, Citer, Diter, Eiter, Fiter, Giter,
>                Hiter, Iiter, Jiter, Kiter);
>
>            Aiter.advance();
>            Biter.advance();
>            Citer.advance();
>            Diter.advance();
>            Eiter.advance();
>            Fiter.advance();
>            Giter.advance();
>            Hiter.advance();
>            Iiter.advance();
>            Jiter.advance();
>            Kiter.advance();
>        }
>    }
>}
>
>
>
>
>
>
>template<typename T_stencil, typename T_numtype1, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>void applyStencil_imp(const T_stencil& stencil, Array<T_numtype1,1>& A,
>    T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>    T_array7& G, T_array8& H, T_array9& I, T_array10& J, T_array11& K)
>{
>    checkShapes(A,B,C,D,E,F,G,H,I,J,K);
>
>
>    TinyVector<int,1> minb, maxb;
>    getStencilExtent(minb, maxb, stencil, A, B, C, D, E, F, G, H, I, J, K);
>
>
>
>
>    int stencil_lbound0 = minb(0);
>    int stencil_ubound0 = maxb(0);
>
>    int lbound0 = minmax::max(A.lbound(0), A.lbound(0) - stencil_lbound0);
>    int ubound0 = minmax::min(A.ubound(0), A.ubound(0) - stencil_ubound0);
>
>
>
>
>
>
>
>    FastArrayIterator<T_numtype1,1> Aiter(A);
>    typename T_array2::T_iterator Biter(B);
>    typename T_array3::T_iterator Citer(C);
>    typename T_array4::T_iterator Diter(D);
>    typename T_array5::T_iterator Eiter(E);
>    typename T_array6::T_iterator Fiter(F);
>    typename T_array7::T_iterator Giter(G);
>    typename T_array8::T_iterator Hiter(H);
>    typename T_array9::T_iterator Iiter(I);
>    typename T_array10::T_iterator Jiter(J);
>    typename T_array11::T_iterator Kiter(K);
>
>
>    Aiter.loadStride(0);
>    Biter.loadStride(0);
>    Citer.loadStride(0);
>    Diter.loadStride(0);
>    Eiter.loadStride(0);
>    Fiter.loadStride(0);
>    Giter.loadStride(0);
>    Hiter.loadStride(0);
>    Iiter.loadStride(0);
>    Jiter.loadStride(0);
>    Kiter.loadStride(0);
>
>
>    Aiter.moveTo(lbound0);
>    Biter.moveTo(lbound0);
>    Citer.moveTo(lbound0);
>    Diter.moveTo(lbound0);
>    Eiter.moveTo(lbound0);
>    Fiter.moveTo(lbound0);
>    Giter.moveTo(lbound0);
>    Hiter.moveTo(lbound0);
>    Iiter.moveTo(lbound0);
>    Jiter.moveTo(lbound0);
>    Kiter.moveTo(lbound0);
>
>    for (int i=lbound0; i <= ubound0; ++i)
>    {
>        stencil.apply(Aiter, Biter, Citer, Diter, Eiter, Fiter, Giter,
>            Hiter, Iiter, Jiter, Kiter);
>
>        Aiter.advance();
>        Biter.advance();
>        Citer.advance();
>        Diter.advance();
>        Eiter.advance();
>        Fiter.advance();
>        Giter.advance();
>        Hiter.advance();
>        Iiter.advance();
>        Jiter.advance();
>        Kiter.advance();
>    }
>}
>
>
>
>
>
>
>template<typename T_stencil, typename T_numtype1, int N_rank>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A)
>{
>    applyStencil_imp(stencil, A, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>    T_array2& B)
>{
>    applyStencil_imp(stencil, A, B, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>    T_array2& B, T_array3& C)
>{
>    applyStencil_imp(stencil, A, B, C, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray, _dummyArray,
>        _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>    T_array2& B, T_array3& C, T_array4& D)
>{
>    applyStencil_imp(stencil, A, B, C, D, _dummyArray, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, _dummyArray,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, F,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>   T_array7& G)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, F, G,
>        _dummyArray, _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>   T_array7& G, T_array8& H)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, F, G, H,
>        _dummyArray, _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>   T_array7& G, T_array8& H, T_array9& I)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, F, G, H, I,
>        _dummyArray, _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>   T_array7& G, T_array8& H, T_array9& I, T_array10& J)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, F, G, H, I, J,
>        _dummyArray);
>}
>
>template<typename T_stencil, typename T_numtype1, int N_rank, typename T_array2,
>    class T_array3, typename T_array4, typename T_array5, typename T_array6,
>    class T_array7, typename T_array8, typename T_array9, typename T_array10,
>    class T_array11>
>inline void applyStencil(const T_stencil& stencil, Array<T_numtype1,N_rank>& A,
>   T_array2& B, T_array3& C, T_array4& D, T_array5& E, T_array6& F,
>   T_array7& G, T_array8& H, T_array9& I, T_array10& J, T_array11& K)
>{
>    applyStencil_imp(stencil, A, B, C, D, E, F, G, H, I, J, K);
>}
>
>}
># 339 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array/stencils.h" 2
># 2526 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array-impl.h" 2
># 33 "/mn/anatu/cma-u3/tmac/usr/include/blitz/array.h" 2
># 2 "openmp_gsl_rng.cpp" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_rng.h" 1
># 23 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_rng.h"
># 1 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_types.h" 1
># 24 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_rng.h" 2
># 1 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_errno.h" 1
># 24 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_errno.h"
># 1 "/usr/include/errno.h" 1 3 4
># 32 "/usr/include/errno.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/errno.h" 1 3 4
># 25 "/usr/include/bits/errno.h" 3 4
># 1 "/usr/include/linux/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm-generic/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm-generic/errno-base.h" 1 3 4
># 5 "/usr/include/asm-generic/errno.h" 2 3 4
># 5 "/usr/include/asm/errno.h" 2 3 4
># 5 "/usr/include/linux/errno.h" 2 3 4
># 26 "/usr/include/bits/errno.h" 2 3 4
># 43 "/usr/include/bits/errno.h" 3 4
>extern int *__errno_location (void) throw () __attribute__ ((__const__));
># 37 "/usr/include/errno.h" 2 3 4
># 55 "/usr/include/errno.h" 3 4
>extern char *program_invocation_name, *program_invocation_short_name;
>
>
>
>}
># 69 "/usr/include/errno.h" 3 4
>typedef int error_t;
># 25 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_errno.h" 2
># 37 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_errno.h"
>extern "C" {
>
>enum {
>  GSL_SUCCESS = 0,
>  GSL_FAILURE = -1,
>  GSL_CONTINUE = -2,
>  GSL_EDOM = 1,
>  GSL_ERANGE = 2,
>  GSL_EFAULT = 3,
>  GSL_EINVAL = 4,
>  GSL_EFAILED = 5,
>  GSL_EFACTOR = 6,
>  GSL_ESANITY = 7,
>  GSL_ENOMEM = 8,
>  GSL_EBADFUNC = 9,
>  GSL_ERUNAWAY = 10,
>  GSL_EMAXITER = 11,
>  GSL_EZERODIV = 12,
>  GSL_EBADTOL = 13,
>  GSL_ETOL = 14,
>  GSL_EUNDRFLW = 15,
>  GSL_EOVRFLW = 16,
>  GSL_ELOSS = 17,
>  GSL_EROUND = 18,
>  GSL_EBADLEN = 19,
>  GSL_ENOTSQR = 20,
>  GSL_ESING = 21,
>  GSL_EDIVERGE = 22,
>  GSL_EUNSUP = 23,
>  GSL_EUNIMPL = 24,
>  GSL_ECACHE = 25,
>  GSL_ETABLE = 26,
>  GSL_ENOPROG = 27,
>  GSL_ENOPROGJ = 28,
>  GSL_ETOLF = 29,
>  GSL_ETOLX = 30,
>  GSL_ETOLG = 31,
>  GSL_EOF = 32
>} ;
>
>void gsl_error (const char * reason, const char * file, int line,
>                int gsl_errno);
>
>void gsl_stream_printf (const char *label, const char *file,
>                        int line, const char *reason);
>
>const char * gsl_strerror (const int gsl_errno);
>
>typedef void gsl_error_handler_t (const char * reason, const char * file,
>                                  int line, int gsl_errno);
>
>typedef void gsl_stream_handler_t (const char * label, const char * file,
>                                   int line, const char * reason);
>
>gsl_error_handler_t *
>gsl_set_error_handler (gsl_error_handler_t * new_handler);
>
>gsl_error_handler_t *
>gsl_set_error_handler_off (void);
>
>gsl_stream_handler_t *
>gsl_set_stream_handler (gsl_stream_handler_t * new_handler);
>
>FILE * gsl_set_stream (FILE * new_stream);
># 152 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_errno.h"
>}
># 25 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_rng.h" 2
># 36 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_rng.h"
>extern "C" {
>
>typedef struct
>  {
>    const char *name;
>    unsigned long int max;
>    unsigned long int min;
>    size_t size;
>    void (*set) (void *state, unsigned long int seed);
>    unsigned long int (*get) (void *state);
>    double (*get_double) (void *state);
>  }
>gsl_rng_type;
>
>typedef struct
>  {
>    const gsl_rng_type * type;
>    void *state;
>  }
>gsl_rng;
>
>
>
>
>
>extern const gsl_rng_type *gsl_rng_borosh13;
>extern const gsl_rng_type *gsl_rng_coveyou;
>extern const gsl_rng_type *gsl_rng_cmrg;
>extern const gsl_rng_type *gsl_rng_fishman18;
>extern const gsl_rng_type *gsl_rng_fishman20;
>extern const gsl_rng_type *gsl_rng_fishman2x;
>extern const gsl_rng_type *gsl_rng_gfsr4;
>extern const gsl_rng_type *gsl_rng_knuthran;
>extern const gsl_rng_type *gsl_rng_knuthran2;
>extern const gsl_rng_type *gsl_rng_knuthran2002;
>extern const gsl_rng_type *gsl_rng_lecuyer21;
>extern const gsl_rng_type *gsl_rng_minstd;
>extern const gsl_rng_type *gsl_rng_mrg;
>extern const gsl_rng_type *gsl_rng_mt19937;
>extern const gsl_rng_type *gsl_rng_mt19937_1999;
>extern const gsl_rng_type *gsl_rng_mt19937_1998;
>extern const gsl_rng_type *gsl_rng_r250;
>extern const gsl_rng_type *gsl_rng_ran0;
>extern const gsl_rng_type *gsl_rng_ran1;
>extern const gsl_rng_type *gsl_rng_ran2;
>extern const gsl_rng_type *gsl_rng_ran3;
>extern const gsl_rng_type *gsl_rng_rand;
>extern const gsl_rng_type *gsl_rng_rand48;
>extern const gsl_rng_type *gsl_rng_random128_bsd;
>extern const gsl_rng_type *gsl_rng_random128_glibc2;
>extern const gsl_rng_type *gsl_rng_random128_libc5;
>extern const gsl_rng_type *gsl_rng_random256_bsd;
>extern const gsl_rng_type *gsl_rng_random256_glibc2;
>extern const gsl_rng_type *gsl_rng_random256_libc5;
>extern const gsl_rng_type *gsl_rng_random32_bsd;
>extern const gsl_rng_type *gsl_rng_random32_glibc2;
>extern const gsl_rng_type *gsl_rng_random32_libc5;
>extern const gsl_rng_type *gsl_rng_random64_bsd;
>extern const gsl_rng_type *gsl_rng_random64_glibc2;
>extern const gsl_rng_type *gsl_rng_random64_libc5;
>extern const gsl_rng_type *gsl_rng_random8_bsd;
>extern const gsl_rng_type *gsl_rng_random8_glibc2;
>extern const gsl_rng_type *gsl_rng_random8_libc5;
>extern const gsl_rng_type *gsl_rng_random_bsd;
>extern const gsl_rng_type *gsl_rng_random_glibc2;
>extern const gsl_rng_type *gsl_rng_random_libc5;
>extern const gsl_rng_type *gsl_rng_randu;
>extern const gsl_rng_type *gsl_rng_ranf;
>extern const gsl_rng_type *gsl_rng_ranlux;
>extern const gsl_rng_type *gsl_rng_ranlux389;
>extern const gsl_rng_type *gsl_rng_ranlxd1;
>extern const gsl_rng_type *gsl_rng_ranlxd2;
>extern const gsl_rng_type *gsl_rng_ranlxs0;
>extern const gsl_rng_type *gsl_rng_ranlxs1;
>extern const gsl_rng_type *gsl_rng_ranlxs2;
>extern const gsl_rng_type *gsl_rng_ranmar;
>extern const gsl_rng_type *gsl_rng_slatec;
>extern const gsl_rng_type *gsl_rng_taus;
>extern const gsl_rng_type *gsl_rng_taus2;
>extern const gsl_rng_type *gsl_rng_taus113;
>extern const gsl_rng_type *gsl_rng_transputer;
>extern const gsl_rng_type *gsl_rng_tt800;
>extern const gsl_rng_type *gsl_rng_uni;
>extern const gsl_rng_type *gsl_rng_uni32;
>extern const gsl_rng_type *gsl_rng_vax;
>extern const gsl_rng_type *gsl_rng_waterman14;
>extern const gsl_rng_type *gsl_rng_zuf;
>
>const gsl_rng_type ** gsl_rng_types_setup(void);
>
>extern const gsl_rng_type *gsl_rng_default;
>extern unsigned long int gsl_rng_default_seed;
>
>gsl_rng *gsl_rng_alloc (const gsl_rng_type * T);
>int gsl_rng_memcpy (gsl_rng * dest, const gsl_rng * src);
>gsl_rng *gsl_rng_clone (const gsl_rng * r);
>
>void gsl_rng_free (gsl_rng * r);
>
>void gsl_rng_set (const gsl_rng * r, unsigned long int seed);
>unsigned long int gsl_rng_max (const gsl_rng * r);
>unsigned long int gsl_rng_min (const gsl_rng * r);
>const char *gsl_rng_name (const gsl_rng * r);
>
>int gsl_rng_fread (FILE * stream, gsl_rng * r);
>int gsl_rng_fwrite (FILE * stream, const gsl_rng * r);
>
>size_t gsl_rng_size (const gsl_rng * r);
>void * gsl_rng_state (const gsl_rng * r);
>
>void gsl_rng_print_state (const gsl_rng * r);
>
>const gsl_rng_type * gsl_rng_env_setup (void);
>
>unsigned long int gsl_rng_get (const gsl_rng * r);
>double gsl_rng_uniform (const gsl_rng * r);
>double gsl_rng_uniform_pos (const gsl_rng * r);
>unsigned long int gsl_rng_uniform_int (const gsl_rng * r, unsigned long int n);
># 216 "/mn/anatu/cma-u3/tmac/usr/include/gsl/gsl_rng.h"
>}
># 3 "openmp_gsl_rng.cpp" 2
>
>using namespace std; using namespace blitz;
>
>Array<double,1> R(2);
>
>int main()
>{
>#pragma omp parallel private(R)
> {
>  const gsl_rng* r = gsl_rng_alloc(gsl_rng_mt19937);
>
> }
> return 0;
>}

Actions: View

Attachments on bug 452972: 310323